blk-sysfs.c 26.3 KB
Newer Older
1
// SPDX-License-Identifier: GPL-2.0
2 3 4 5
/*
 * Functions related to sysfs handling
 */
#include <linux/kernel.h>
6
#include <linux/slab.h>
7 8 9
#include <linux/module.h>
#include <linux/bio.h>
#include <linux/blkdev.h>
10
#include <linux/backing-dev.h>
11
#include <linux/blktrace_api.h>
12
#include <linux/blk-mq.h>
13
#include <linux/blk-cgroup.h>
14 15

#include "blk.h"
16
#include "blk-mq.h"
17
#include "blk-mq-debugfs.h"
J
Jens Axboe 已提交
18
#include "blk-wbt.h"
19 20 21 22 23 24 25 26

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
27
queue_var_show(unsigned long var, char *page)
28
{
29
	return sprintf(page, "%lu\n", var);
30 31 32 33 34
}

static ssize_t
queue_var_store(unsigned long *var, const char *page, size_t count)
{
35 36 37
	int err;
	unsigned long v;

38
	err = kstrtoul(page, 10, &v);
39 40 41 42
	if (err || v > UINT_MAX)
		return -EINVAL;

	*var = v;
43 44 45 46

	return count;
}

47
static ssize_t queue_var_store64(s64 *var, const char *page)
J
Jens Axboe 已提交
48 49
{
	int err;
50
	s64 v;
J
Jens Axboe 已提交
51

52
	err = kstrtos64(page, 10, &v);
J
Jens Axboe 已提交
53 54 55 56 57 58 59
	if (err < 0)
		return err;

	*var = v;
	return 0;
}

60 61 62 63 64 65 66 67 68
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)
{
	unsigned long nr;
69
	int ret, err;
70

J
Jens Axboe 已提交
71
	if (!queue_is_mq(q))
72 73 74
		return -EINVAL;

	ret = queue_var_store(&nr, page, count);
75 76 77
	if (ret < 0)
		return ret;

78 79 80
	if (nr < BLKDEV_MIN_RQ)
		nr = BLKDEV_MIN_RQ;

J
Jens Axboe 已提交
81
	err = blk_mq_update_nr_requests(q, nr);
82 83 84
	if (err)
		return err;

85 86 87 88 89
	return ret;
}

static ssize_t queue_ra_show(struct request_queue *q, char *page)
{
90
	unsigned long ra_kb = q->backing_dev_info->ra_pages <<
91
					(PAGE_SHIFT - 10);
92 93 94 95 96 97 98 99 100 101

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

102 103 104
	if (ret < 0)
		return ret;

105
	q->backing_dev_info->ra_pages = ra_kb >> (PAGE_SHIFT - 10);
106 107 108 109 110 111

	return ret;
}

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

	return queue_var_show(max_sectors_kb, (page));
}

117 118 119 120 121
static ssize_t queue_max_segments_show(struct request_queue *q, char *page)
{
	return queue_var_show(queue_max_segments(q), (page));
}

122 123 124 125 126 127
static ssize_t queue_max_discard_segments_show(struct request_queue *q,
		char *page)
{
	return queue_var_show(queue_max_discard_segments(q), (page));
}

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

133 134
static ssize_t queue_max_segment_size_show(struct request_queue *q, char *page)
{
135
	return queue_var_show(queue_max_segment_size(q), (page));
136 137
}

138
static ssize_t queue_logical_block_size_show(struct request_queue *q, char *page)
M
Martin K. Petersen 已提交
139
{
140
	return queue_var_show(queue_logical_block_size(q), page);
M
Martin K. Petersen 已提交
141 142
}

143 144 145 146 147
static ssize_t queue_physical_block_size_show(struct request_queue *q, char *page)
{
	return queue_var_show(queue_physical_block_size(q), page);
}

148 149 150 151 152
static ssize_t queue_chunk_sectors_show(struct request_queue *q, char *page)
{
	return queue_var_show(q->limits.chunk_sectors, page);
}

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

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

168 169 170
static ssize_t queue_discard_max_hw_show(struct request_queue *q, char *page)
{

171 172
	return sprintf(page, "%llu\n",
		(unsigned long long)q->limits.max_hw_discard_sectors << 9);
173 174
}

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

181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203
static ssize_t queue_discard_max_store(struct request_queue *q,
				       const char *page, size_t count)
{
	unsigned long max_discard;
	ssize_t ret = queue_var_store(&max_discard, page, count);

	if (ret < 0)
		return ret;

	if (max_discard & (q->limits.discard_granularity - 1))
		return -EINVAL;

	max_discard >>= 9;
	if (max_discard > UINT_MAX)
		return -EINVAL;

	if (max_discard > q->limits.max_hw_discard_sectors)
		max_discard = q->limits.max_hw_discard_sectors;

	q->limits.max_discard_sectors = max_discard;
	return ret;
}

204 205
static ssize_t queue_discard_zeroes_data_show(struct request_queue *q, char *page)
{
206
	return queue_var_show(0, page);
207 208
}

209 210 211 212 213 214
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);
}

215 216 217 218 219
static ssize_t queue_write_zeroes_max_show(struct request_queue *q, char *page)
{
	return sprintf(page, "%llu\n",
		(unsigned long long)q->limits.max_write_zeroes_sectors << 9);
}
220

221 222 223 224
static ssize_t
queue_max_sectors_store(struct request_queue *q, const char *page, size_t count)
{
	unsigned long max_sectors_kb,
225
		max_hw_sectors_kb = queue_max_hw_sectors(q) >> 1,
226
			page_kb = 1 << (PAGE_SHIFT - 10);
227 228
	ssize_t ret = queue_var_store(&max_sectors_kb, page, count);

229 230 231
	if (ret < 0)
		return ret;

232 233 234
	max_hw_sectors_kb = min_not_zero(max_hw_sectors_kb, (unsigned long)
					 q->limits.max_dev_sectors >> 1);

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

238
	spin_lock_irq(&q->queue_lock);
239
	q->limits.max_sectors = max_sectors_kb << 1;
240
	q->backing_dev_info->io_pages = max_sectors_kb >> (PAGE_SHIFT - 10);
241
	spin_unlock_irq(&q->queue_lock);
242 243 244 245 246 247

	return ret;
}

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

	return queue_var_show(max_hw_sectors_kb, (page));
}

253 254 255 256 257 258 259 260 261 262 263 264 265 266
#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);			\
267 268
	if (ret < 0)							\
		 return ret;						\
269 270 271 272
	if (neg)							\
		val = !val;						\
									\
	if (val)							\
273
		blk_queue_flag_set(QUEUE_FLAG_##flag, q);		\
274
	else								\
275
		blk_queue_flag_clear(QUEUE_FLAG_##flag, q);		\
276
	return ret;							\
277 278
}

279 280 281 282
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
283

D
Damien Le Moal 已提交
284 285 286 287 288 289 290 291 292 293 294 295
static ssize_t queue_zoned_show(struct request_queue *q, char *page)
{
	switch (blk_queue_zoned_model(q)) {
	case BLK_ZONED_HA:
		return sprintf(page, "host-aware\n");
	case BLK_ZONED_HM:
		return sprintf(page, "host-managed\n");
	default:
		return sprintf(page, "none\n");
	}
}

296 297 298 299 300
static ssize_t queue_nr_zones_show(struct request_queue *q, char *page)
{
	return queue_var_show(blk_queue_nr_zones(q), page);
}

301 302
static ssize_t queue_nomerges_show(struct request_queue *q, char *page)
{
303 304
	return queue_var_show((blk_queue_nomerges(q) << 1) |
			       blk_queue_noxmerges(q), page);
305 306 307 308 309 310 311 312
}

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

313 314 315
	if (ret < 0)
		return ret;

316 317
	blk_queue_flag_clear(QUEUE_FLAG_NOMERGES, q);
	blk_queue_flag_clear(QUEUE_FLAG_NOXMERGES, q);
318
	if (nm == 2)
319
		blk_queue_flag_set(QUEUE_FLAG_NOMERGES, q);
320
	else if (nm)
321
		blk_queue_flag_set(QUEUE_FLAG_NOXMERGES, q);
322

323 324 325
	return ret;
}

326 327
static ssize_t queue_rq_affinity_show(struct request_queue *q, char *page)
{
328
	bool set = test_bit(QUEUE_FLAG_SAME_COMP, &q->queue_flags);
D
Dan Williams 已提交
329
	bool force = test_bit(QUEUE_FLAG_SAME_FORCE, &q->queue_flags);
330

D
Dan Williams 已提交
331
	return queue_var_show(set << force, page);
332 333 334 335 336 337
}

static ssize_t
queue_rq_affinity_store(struct request_queue *q, const char *page, size_t count)
{
	ssize_t ret = -EINVAL;
338
#ifdef CONFIG_SMP
339 340 341
	unsigned long val;

	ret = queue_var_store(&val, page, count);
342 343 344
	if (ret < 0)
		return ret;

345
	if (val == 2) {
346 347
		blk_queue_flag_set(QUEUE_FLAG_SAME_COMP, q);
		blk_queue_flag_set(QUEUE_FLAG_SAME_FORCE, q);
348
	} else if (val == 1) {
349 350
		blk_queue_flag_set(QUEUE_FLAG_SAME_COMP, q);
		blk_queue_flag_clear(QUEUE_FLAG_SAME_FORCE, q);
351
	} else if (val == 0) {
352 353
		blk_queue_flag_clear(QUEUE_FLAG_SAME_COMP, q);
		blk_queue_flag_clear(QUEUE_FLAG_SAME_FORCE, q);
D
Dan Williams 已提交
354
	}
355 356 357
#endif
	return ret;
}
358

359 360
static ssize_t queue_poll_delay_show(struct request_queue *q, char *page)
{
361 362
	int val;

363 364
	if (q->poll_nsec == BLK_MQ_POLL_CLASSIC)
		val = BLK_MQ_POLL_CLASSIC;
365 366 367 368
	else
		val = q->poll_nsec / 1000;

	return sprintf(page, "%d\n", val);
369 370 371 372 373
}

static ssize_t queue_poll_delay_store(struct request_queue *q, const char *page,
				size_t count)
{
374
	int err, val;
375 376 377 378

	if (!q->mq_ops || !q->mq_ops->poll)
		return -EINVAL;

379 380 381
	err = kstrtoint(page, 10, &val);
	if (err < 0)
		return err;
382

383 384 385
	if (val == BLK_MQ_POLL_CLASSIC)
		q->poll_nsec = BLK_MQ_POLL_CLASSIC;
	else if (val >= 0)
386
		q->poll_nsec = val * 1000;
387 388
	else
		return -EINVAL;
389 390

	return count;
391 392
}

J
Jens Axboe 已提交
393 394 395 396 397 398 399 400 401 402 403
static ssize_t queue_poll_show(struct request_queue *q, char *page)
{
	return queue_var_show(test_bit(QUEUE_FLAG_POLL, &q->queue_flags), page);
}

static ssize_t queue_poll_store(struct request_queue *q, const char *page,
				size_t count)
{
	unsigned long poll_on;
	ssize_t ret;

404 405
	if (!q->tag_set || q->tag_set->nr_maps <= HCTX_TYPE_POLL ||
	    !q->tag_set->map[HCTX_TYPE_POLL].nr_queues)
J
Jens Axboe 已提交
406 407 408 409 410 411 412
		return -EINVAL;

	ret = queue_var_store(&poll_on, page, count);
	if (ret < 0)
		return ret;

	if (poll_on)
413
		blk_queue_flag_set(QUEUE_FLAG_POLL, q);
J
Jens Axboe 已提交
414
	else
415
		blk_queue_flag_clear(QUEUE_FLAG_POLL, q);
J
Jens Axboe 已提交
416 417 418 419

	return ret;
}

W
Weiping Zhang 已提交
420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439
static ssize_t queue_io_timeout_show(struct request_queue *q, char *page)
{
	return sprintf(page, "%u\n", jiffies_to_msecs(q->rq_timeout));
}

static ssize_t queue_io_timeout_store(struct request_queue *q, const char *page,
				  size_t count)
{
	unsigned int val;
	int err;

	err = kstrtou32(page, 10, &val);
	if (err || val == 0)
		return -EINVAL;

	blk_queue_rq_timeout(q, msecs_to_jiffies(val));

	return count;
}

J
Jens Axboe 已提交
440 441
static ssize_t queue_wb_lat_show(struct request_queue *q, char *page)
{
442
	if (!wbt_rq_qos(q))
J
Jens Axboe 已提交
443 444
		return -EINVAL;

445
	return sprintf(page, "%llu\n", div_u64(wbt_get_min_lat(q), 1000));
J
Jens Axboe 已提交
446 447 448 449 450
}

static ssize_t queue_wb_lat_store(struct request_queue *q, const char *page,
				  size_t count)
{
451
	struct rq_qos *rqos;
J
Jens Axboe 已提交
452
	ssize_t ret;
453
	s64 val;
J
Jens Axboe 已提交
454 455 456 457

	ret = queue_var_store64(&val, page);
	if (ret < 0)
		return ret;
458 459 460
	if (val < -1)
		return -EINVAL;

461 462
	rqos = wbt_rq_qos(q);
	if (!rqos) {
463 464 465 466
		ret = wbt_init(q);
		if (ret)
			return ret;
	}
J
Jens Axboe 已提交
467

468
	if (val == -1)
469
		val = wbt_default_latency_nsec(q);
470
	else if (val >= 0)
471
		val *= 1000ULL;
472

473 474 475
	if (wbt_get_min_lat(q) == val)
		return count;

476 477 478 479 480
	/*
	 * Ensure that the queue is idled, in case the latency update
	 * ends up either enabling or disabling wbt completely. We can't
	 * have IO inflight if that happens.
	 */
J
Jens Axboe 已提交
481 482
	blk_mq_freeze_queue(q);
	blk_mq_quiesce_queue(q);
483

484 485
	wbt_set_min_lat(q, val);

J
Jens Axboe 已提交
486 487
	blk_mq_unquiesce_queue(q);
	blk_mq_unfreeze_queue(q);
488

J
Jens Axboe 已提交
489 490 491
	return count;
}

492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514
static ssize_t queue_wc_show(struct request_queue *q, char *page)
{
	if (test_bit(QUEUE_FLAG_WC, &q->queue_flags))
		return sprintf(page, "write back\n");

	return sprintf(page, "write through\n");
}

static ssize_t queue_wc_store(struct request_queue *q, const char *page,
			      size_t count)
{
	int set = -1;

	if (!strncmp(page, "write back", 10))
		set = 1;
	else if (!strncmp(page, "write through", 13) ||
		 !strncmp(page, "none", 4))
		set = 0;

	if (set == -1)
		return -EINVAL;

	if (set)
515
		blk_queue_flag_set(QUEUE_FLAG_WC, q);
516
	else
517
		blk_queue_flag_clear(QUEUE_FLAG_WC, q);
518 519 520 521

	return count;
}

522 523 524 525 526
static ssize_t queue_fua_show(struct request_queue *q, char *page)
{
	return sprintf(page, "%u\n", test_bit(QUEUE_FLAG_FUA, &q->queue_flags));
}

527 528 529 530 531
static ssize_t queue_dax_show(struct request_queue *q, char *page)
{
	return queue_var_show(blk_queue_dax(q), page);
}

532
static struct queue_sysfs_entry queue_requests_entry = {
533
	.attr = {.name = "nr_requests", .mode = 0644 },
534 535 536 537 538
	.show = queue_requests_show,
	.store = queue_requests_store,
};

static struct queue_sysfs_entry queue_ra_entry = {
539
	.attr = {.name = "read_ahead_kb", .mode = 0644 },
540 541 542 543 544
	.show = queue_ra_show,
	.store = queue_ra_store,
};

static struct queue_sysfs_entry queue_max_sectors_entry = {
545
	.attr = {.name = "max_sectors_kb", .mode = 0644 },
546 547 548 549 550
	.show = queue_max_sectors_show,
	.store = queue_max_sectors_store,
};

static struct queue_sysfs_entry queue_max_hw_sectors_entry = {
551
	.attr = {.name = "max_hw_sectors_kb", .mode = 0444 },
552 553 554
	.show = queue_max_hw_sectors_show,
};

555
static struct queue_sysfs_entry queue_max_segments_entry = {
556
	.attr = {.name = "max_segments", .mode = 0444 },
557 558 559
	.show = queue_max_segments_show,
};

560
static struct queue_sysfs_entry queue_max_discard_segments_entry = {
561
	.attr = {.name = "max_discard_segments", .mode = 0444 },
562 563 564
	.show = queue_max_discard_segments_show,
};

565
static struct queue_sysfs_entry queue_max_integrity_segments_entry = {
566
	.attr = {.name = "max_integrity_segments", .mode = 0444 },
567 568 569
	.show = queue_max_integrity_segments_show,
};

570
static struct queue_sysfs_entry queue_max_segment_size_entry = {
571
	.attr = {.name = "max_segment_size", .mode = 0444 },
572 573 574
	.show = queue_max_segment_size_show,
};

575
static struct queue_sysfs_entry queue_iosched_entry = {
576
	.attr = {.name = "scheduler", .mode = 0644 },
577 578 579 580
	.show = elv_iosched_show,
	.store = elv_iosched_store,
};

M
Martin K. Petersen 已提交
581
static struct queue_sysfs_entry queue_hw_sector_size_entry = {
582
	.attr = {.name = "hw_sector_size", .mode = 0444 },
583 584 585 586
	.show = queue_logical_block_size_show,
};

static struct queue_sysfs_entry queue_logical_block_size_entry = {
587
	.attr = {.name = "logical_block_size", .mode = 0444 },
588
	.show = queue_logical_block_size_show,
M
Martin K. Petersen 已提交
589 590
};

591
static struct queue_sysfs_entry queue_physical_block_size_entry = {
592
	.attr = {.name = "physical_block_size", .mode = 0444 },
593 594 595
	.show = queue_physical_block_size_show,
};

596
static struct queue_sysfs_entry queue_chunk_sectors_entry = {
597
	.attr = {.name = "chunk_sectors", .mode = 0444 },
598 599 600
	.show = queue_chunk_sectors_show,
};

601
static struct queue_sysfs_entry queue_io_min_entry = {
602
	.attr = {.name = "minimum_io_size", .mode = 0444 },
603 604 605 606
	.show = queue_io_min_show,
};

static struct queue_sysfs_entry queue_io_opt_entry = {
607
	.attr = {.name = "optimal_io_size", .mode = 0444 },
608
	.show = queue_io_opt_show,
M
Martin K. Petersen 已提交
609 610
};

611
static struct queue_sysfs_entry queue_discard_granularity_entry = {
612
	.attr = {.name = "discard_granularity", .mode = 0444 },
613 614 615
	.show = queue_discard_granularity_show,
};

616
static struct queue_sysfs_entry queue_discard_max_hw_entry = {
617
	.attr = {.name = "discard_max_hw_bytes", .mode = 0444 },
618 619 620
	.show = queue_discard_max_hw_show,
};

621
static struct queue_sysfs_entry queue_discard_max_entry = {
622
	.attr = {.name = "discard_max_bytes", .mode = 0644 },
623
	.show = queue_discard_max_show,
624
	.store = queue_discard_max_store,
625 626
};

627
static struct queue_sysfs_entry queue_discard_zeroes_data_entry = {
628
	.attr = {.name = "discard_zeroes_data", .mode = 0444 },
629 630 631
	.show = queue_discard_zeroes_data_show,
};

632
static struct queue_sysfs_entry queue_write_same_max_entry = {
633
	.attr = {.name = "write_same_max_bytes", .mode = 0444 },
634 635 636
	.show = queue_write_same_max_show,
};

637
static struct queue_sysfs_entry queue_write_zeroes_max_entry = {
638
	.attr = {.name = "write_zeroes_max_bytes", .mode = 0444 },
639 640 641
	.show = queue_write_zeroes_max_show,
};

642
static struct queue_sysfs_entry queue_nonrot_entry = {
643
	.attr = {.name = "rotational", .mode = 0644 },
644 645
	.show = queue_show_nonrot,
	.store = queue_store_nonrot,
646 647
};

D
Damien Le Moal 已提交
648
static struct queue_sysfs_entry queue_zoned_entry = {
649
	.attr = {.name = "zoned", .mode = 0444 },
D
Damien Le Moal 已提交
650 651 652
	.show = queue_zoned_show,
};

653 654 655 656 657
static struct queue_sysfs_entry queue_nr_zones_entry = {
	.attr = {.name = "nr_zones", .mode = 0444 },
	.show = queue_nr_zones_show,
};

658
static struct queue_sysfs_entry queue_nomerges_entry = {
659
	.attr = {.name = "nomerges", .mode = 0644 },
660 661 662 663
	.show = queue_nomerges_show,
	.store = queue_nomerges_store,
};

664
static struct queue_sysfs_entry queue_rq_affinity_entry = {
665
	.attr = {.name = "rq_affinity", .mode = 0644 },
666 667 668 669
	.show = queue_rq_affinity_show,
	.store = queue_rq_affinity_store,
};

670
static struct queue_sysfs_entry queue_iostats_entry = {
671
	.attr = {.name = "iostats", .mode = 0644 },
672 673
	.show = queue_show_iostats,
	.store = queue_store_iostats,
674 675
};

676
static struct queue_sysfs_entry queue_random_entry = {
677
	.attr = {.name = "add_random", .mode = 0644 },
678 679
	.show = queue_show_random,
	.store = queue_store_random,
680 681
};

J
Jens Axboe 已提交
682
static struct queue_sysfs_entry queue_poll_entry = {
683
	.attr = {.name = "io_poll", .mode = 0644 },
J
Jens Axboe 已提交
684 685 686 687
	.show = queue_poll_show,
	.store = queue_poll_store,
};

688
static struct queue_sysfs_entry queue_poll_delay_entry = {
689
	.attr = {.name = "io_poll_delay", .mode = 0644 },
690 691 692 693
	.show = queue_poll_delay_show,
	.store = queue_poll_delay_store,
};

694
static struct queue_sysfs_entry queue_wc_entry = {
695
	.attr = {.name = "write_cache", .mode = 0644 },
696 697 698 699
	.show = queue_wc_show,
	.store = queue_wc_store,
};

700
static struct queue_sysfs_entry queue_fua_entry = {
701
	.attr = {.name = "fua", .mode = 0444 },
702 703 704
	.show = queue_fua_show,
};

705
static struct queue_sysfs_entry queue_dax_entry = {
706
	.attr = {.name = "dax", .mode = 0444 },
707 708 709
	.show = queue_dax_show,
};

W
Weiping Zhang 已提交
710 711 712 713 714 715
static struct queue_sysfs_entry queue_io_timeout_entry = {
	.attr = {.name = "io_timeout", .mode = 0644 },
	.show = queue_io_timeout_show,
	.store = queue_io_timeout_store,
};

J
Jens Axboe 已提交
716
static struct queue_sysfs_entry queue_wb_lat_entry = {
717
	.attr = {.name = "wbt_lat_usec", .mode = 0644 },
J
Jens Axboe 已提交
718 719 720 721
	.show = queue_wb_lat_show,
	.store = queue_wb_lat_store,
};

722 723
#ifdef CONFIG_BLK_DEV_THROTTLING_LOW
static struct queue_sysfs_entry throtl_sample_time_entry = {
724
	.attr = {.name = "throttle_sample_time", .mode = 0644 },
725 726 727 728 729
	.show = blk_throtl_sample_time_show,
	.store = blk_throtl_sample_time_store,
};
#endif

730
static struct attribute *queue_attrs[] = {
731 732 733 734
	&queue_requests_entry.attr,
	&queue_ra_entry.attr,
	&queue_max_hw_sectors_entry.attr,
	&queue_max_sectors_entry.attr,
735
	&queue_max_segments_entry.attr,
736
	&queue_max_discard_segments_entry.attr,
737
	&queue_max_integrity_segments_entry.attr,
738
	&queue_max_segment_size_entry.attr,
739
	&queue_iosched_entry.attr,
M
Martin K. Petersen 已提交
740
	&queue_hw_sector_size_entry.attr,
741
	&queue_logical_block_size_entry.attr,
742
	&queue_physical_block_size_entry.attr,
743
	&queue_chunk_sectors_entry.attr,
744 745
	&queue_io_min_entry.attr,
	&queue_io_opt_entry.attr,
746 747
	&queue_discard_granularity_entry.attr,
	&queue_discard_max_entry.attr,
748
	&queue_discard_max_hw_entry.attr,
749
	&queue_discard_zeroes_data_entry.attr,
750
	&queue_write_same_max_entry.attr,
751
	&queue_write_zeroes_max_entry.attr,
752
	&queue_nonrot_entry.attr,
D
Damien Le Moal 已提交
753
	&queue_zoned_entry.attr,
754
	&queue_nr_zones_entry.attr,
755
	&queue_nomerges_entry.attr,
756
	&queue_rq_affinity_entry.attr,
757
	&queue_iostats_entry.attr,
758
	&queue_random_entry.attr,
J
Jens Axboe 已提交
759
	&queue_poll_entry.attr,
760
	&queue_wc_entry.attr,
761
	&queue_fua_entry.attr,
762
	&queue_dax_entry.attr,
J
Jens Axboe 已提交
763
	&queue_wb_lat_entry.attr,
764
	&queue_poll_delay_entry.attr,
W
Weiping Zhang 已提交
765
	&queue_io_timeout_entry.attr,
766 767 768
#ifdef CONFIG_BLK_DEV_THROTTLING_LOW
	&throtl_sample_time_entry.attr,
#endif
769 770 771
	NULL,
};

772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790
static umode_t queue_attr_visible(struct kobject *kobj, struct attribute *attr,
				int n)
{
	struct request_queue *q =
		container_of(kobj, struct request_queue, kobj);

	if (attr == &queue_io_timeout_entry.attr &&
		(!q->mq_ops || !q->mq_ops->timeout))
			return 0;

	return attr->mode;
}

static struct attribute_group queue_attr_group = {
	.attrs = queue_attrs,
	.is_visible = queue_attr_visible,
};


791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813
#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);
	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);
814
	struct request_queue *q;
815 816 817 818
	ssize_t res;

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

	q = container_of(kobj, struct request_queue, kobj);
821 822 823 824 825 826
	mutex_lock(&q->sysfs_lock);
	res = entry->store(q, page, length);
	mutex_unlock(&q->sysfs_lock);
	return res;
}

T
Tejun Heo 已提交
827 828 829 830 831 832 833
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);
}

834 835 836 837 838 839 840 841 842 843
/* Unconfigure the I/O scheduler and dissociate from the cgroup controller. */
static void blk_exit_queue(struct request_queue *q)
{
	/*
	 * Since the I/O scheduler exit code may access cgroup information,
	 * perform I/O scheduler exit before disassociating from the block
	 * cgroup controller.
	 */
	if (q->elevator) {
		ioc_clear_queue(q);
844
		__elevator_exit(q, q->elevator);
845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863
		q->elevator = NULL;
	}

	/*
	 * Remove all references to @q from the block cgroup controller before
	 * restoring @q->queue_lock to avoid that restoring this pointer causes
	 * e.g. blkcg_print_blkgs() to crash.
	 */
	blkcg_exit_queue(q);

	/*
	 * Since the cgroup code may dereference the @q->backing_dev_info
	 * pointer, only decrease its reference count after having removed the
	 * association with the block cgroup controller.
	 */
	bdi_put(q->backing_dev_info);
}


864
/**
865
 * __blk_release_queue - release a request queue
866
 * @work: pointer to the release_work member of the request queue to be released
867 868
 *
 * Description:
869 870 871 872 873 874
 *     This function is called when a block device is being unregistered. The
 *     process of releasing a request queue starts with blk_cleanup_queue, which
 *     set the appropriate flags and then calls blk_put_queue, that decrements
 *     the reference counter of the request queue. Once the reference counter
 *     of the request queue reaches zero, blk_release_queue is called to release
 *     all allocated resources of the request queue.
875 876
 */
static void __blk_release_queue(struct work_struct *work)
877
{
878
	struct request_queue *q = container_of(work, typeof(*q), release_work);
879

880 881 882
	if (test_bit(QUEUE_FLAG_POLL_STATS, &q->queue_flags))
		blk_stat_remove_callback(q, q->poll_cb);
	blk_stat_free_callback(q->poll_cb);
883

884 885
	blk_free_queue_stats(q->stats);

886 887 888
	if (queue_is_mq(q))
		cancel_delayed_work_sync(&q->requeue_work);

889 890
	blk_exit_queue(q);

891 892
	blk_queue_free_zone_bitmaps(q);

J
Jens Axboe 已提交
893
	if (queue_is_mq(q))
894
		blk_mq_release(q);
895

896 897
	blk_trace_shutdown(q);

J
Jens Axboe 已提交
898
	if (queue_is_mq(q))
899 900
		blk_mq_debugfs_unregister(q);

901
	bioset_exit(&q->bio_split);
902

903
	ida_simple_remove(&blk_queue_ida, q->id);
T
Tejun Heo 已提交
904
	call_rcu(&q->rcu_head, blk_free_queue_rcu);
905 906
}

907 908 909 910 911 912 913 914 915
static void blk_release_queue(struct kobject *kobj)
{
	struct request_queue *q =
		container_of(kobj, struct request_queue, kobj);

	INIT_WORK(&q->release_work, __blk_release_queue);
	schedule_work(&q->release_work);
}

916
static const struct sysfs_ops queue_sysfs_ops = {
917 918 919 920 921 922 923 924 925
	.show	= queue_attr_show,
	.store	= queue_attr_store,
};

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

926 927 928 929
/**
 * blk_register_queue - register a block layer queue with sysfs
 * @disk: Disk of which the request queue should be registered with sysfs.
 */
930 931 932
int blk_register_queue(struct gendisk *disk)
{
	int ret;
933
	struct device *dev = disk_to_dev(disk);
934
	struct request_queue *q = disk->queue;
935
	bool has_elevator = false;
936

937
	if (WARN_ON(!q))
938 939
		return -ENXIO;

940
	WARN_ONCE(blk_queue_registered(q),
941 942 943
		  "%s is registering an already registered queue\n",
		  kobject_name(&dev->kobj));

944
	/*
945 946 947 948 949 950 951
	 * SCSI probing may synchronously create and destroy a lot of
	 * request_queues for non-existent devices.  Shutting down a fully
	 * functional queue takes measureable wallclock time as RCU grace
	 * periods are involved.  To avoid excessive latency in these
	 * cases, a request_queue starts out in a degraded mode which is
	 * faster to shut down and is made fully functional here as
	 * request_queues for non-existent devices never get registered.
952
	 */
953
	if (!blk_queue_init_done(q)) {
954
		blk_queue_flag_set(QUEUE_FLAG_INIT_DONE, q);
955
		percpu_ref_switch_to_percpu(&q->q_usage_counter);
956
	}
957

958 959 960 961
	ret = blk_trace_init_sysfs(dev);
	if (ret)
		return ret;

962
	mutex_lock(&q->sysfs_dir_lock);
963

964
	ret = kobject_add(&q->kobj, kobject_get(&dev->kobj), "%s", "queue");
965 966
	if (ret < 0) {
		blk_trace_remove_sysfs(dev);
967
		goto unlock;
968
	}
969

970 971 972 973 974 975 976 977
	ret = sysfs_create_group(&q->kobj, &queue_attr_group);
	if (ret) {
		blk_trace_remove_sysfs(dev);
		kobject_del(&q->kobj);
		kobject_put(&dev->kobj);
		goto unlock;
	}

J
Jens Axboe 已提交
978
	if (queue_is_mq(q)) {
979
		__blk_mq_register_dev(dev, q);
980 981
		blk_mq_debugfs_register(q);
	}
982

983
	mutex_lock(&q->sysfs_lock);
J
Jens Axboe 已提交
984
	if (q->elevator) {
985
		ret = elv_register_queue(q, false);
986
		if (ret) {
987
			mutex_unlock(&q->sysfs_lock);
988
			mutex_unlock(&q->sysfs_dir_lock);
989 990 991
			kobject_del(&q->kobj);
			blk_trace_remove_sysfs(dev);
			kobject_put(&dev->kobj);
992
			return ret;
993
		}
994
		has_elevator = true;
995
	}
996 997 998 999 1000 1001 1002 1003 1004 1005 1006

	blk_queue_flag_set(QUEUE_FLAG_REGISTERED, q);
	wbt_enable_default(q);
	blk_throtl_register_queue(q);

	/* Now everything is ready and send out KOBJ_ADD uevent */
	kobject_uevent(&q->kobj, KOBJ_ADD);
	if (has_elevator)
		kobject_uevent(&q->elevator->kobj, KOBJ_ADD);
	mutex_unlock(&q->sysfs_lock);

1007 1008
	ret = 0;
unlock:
1009
	mutex_unlock(&q->sysfs_dir_lock);
1010
	return ret;
1011
}
1012
EXPORT_SYMBOL_GPL(blk_register_queue);
1013

1014 1015 1016 1017 1018 1019 1020
/**
 * blk_unregister_queue - counterpart of blk_register_queue()
 * @disk: Disk of which the request queue should be unregistered from sysfs.
 *
 * Note: the caller is responsible for guaranteeing that this function is called
 * after blk_register_queue() has finished.
 */
1021 1022 1023 1024
void blk_unregister_queue(struct gendisk *disk)
{
	struct request_queue *q = disk->queue;

1025 1026 1027
	if (WARN_ON(!q))
		return;

1028
	/* Return early if disk->queue was never registered. */
1029
	if (!blk_queue_registered(q))
1030 1031
		return;

1032
	/*
1033 1034 1035
	 * Since sysfs_remove_dir() prevents adding new directory entries
	 * before removal of existing entries starts, protect against
	 * concurrent elv_iosched_store() calls.
1036
	 */
1037
	mutex_lock(&q->sysfs_lock);
1038
	blk_queue_flag_clear(QUEUE_FLAG_REGISTERED, q);
1039
	mutex_unlock(&q->sysfs_lock);
O
Omar Sandoval 已提交
1040

1041
	mutex_lock(&q->sysfs_dir_lock);
1042 1043 1044 1045
	/*
	 * Remove the sysfs attributes before unregistering the queue data
	 * structures that can be modified through sysfs.
	 */
J
Jens Axboe 已提交
1046
	if (queue_is_mq(q))
1047
		blk_mq_unregister_dev(disk_to_dev(disk), q);
1048

1049 1050 1051
	kobject_uevent(&q->kobj, KOBJ_REMOVE);
	kobject_del(&q->kobj);
	blk_trace_remove_sysfs(disk_to_dev(disk));
1052

1053
	mutex_lock(&q->sysfs_lock);
J
Jens Axboe 已提交
1054
	if (q->elevator)
1055
		elv_unregister_queue(q);
1056
	mutex_unlock(&q->sysfs_lock);
1057
	mutex_unlock(&q->sysfs_dir_lock);
1058 1059

	kobject_put(&disk_to_dev(disk)->kobj);
1060
}