114 	struct throtl_data *td;  member
269 		return tg->td;  in sq_to_td()
282 static uint64_t throtl_adjusted_limit(uint64_t low, struct throtl_data *td)  in throtl_adjusted_limit()  argument
285 	if (td->scale < 4096 && time_after_eq(jiffies,  in throtl_adjusted_limit()
286 	    td->low_upgrade_time + td->scale * td->throtl_slice))  in throtl_adjusted_limit()
287 		td->scale = (jiffies - td->low_upgrade_time) / td->throtl_slice;  in throtl_adjusted_limit()
289 	return low + (low >> 1) * td->scale;  in throtl_adjusted_limit()
295 	struct throtl_data *td;  in tg_bps_limit()  local
301 	td = tg->td;  in tg_bps_limit()
302 	ret = tg->bps[rw][td->limit_index];  in tg_bps_limit()
303 	if (ret == 0 && td->limit_index == LIMIT_LOW) {  in tg_bps_limit()
306 		    tg->iops[rw][td->limit_index])  in tg_bps_limit()
312 	if (td->limit_index == LIMIT_MAX && tg->bps[rw][LIMIT_LOW] &&  in tg_bps_limit()
316 		adjusted = throtl_adjusted_limit(tg->bps[rw][LIMIT_LOW], td);  in tg_bps_limit()
325 	struct throtl_data *td;  in tg_iops_limit()  local
331 	td = tg->td;  in tg_iops_limit()
332 	ret = tg->iops[rw][td->limit_index];  in tg_iops_limit()
333 	if (ret == 0 && tg->td->limit_index == LIMIT_LOW) {  in tg_iops_limit()
336 		    tg->bps[rw][td->limit_index])  in tg_iops_limit()
342 	if (td->limit_index == LIMIT_MAX && tg->iops[rw][LIMIT_LOW] &&  in tg_iops_limit()
346 		adjusted = throtl_adjusted_limit(tg->iops[rw][LIMIT_LOW], td);  in tg_iops_limit()
522 	struct throtl_data *td = blkg->q->td;  in throtl_pd_init()  local
538 	sq->parent_sq = &td->service_queue;  in throtl_pd_init()
541 	tg->td = td;  in throtl_pd_init()
552 	struct throtl_data *td = tg->td;  in tg_update_has_rules()  local
557 			(td->limit_valid[td->limit_index] &&  in tg_update_has_rules()
572 static void blk_throtl_update_limit_valid(struct throtl_data *td)  in blk_throtl_update_limit_valid()  argument
579 	blkg_for_each_descendant_post(blkg, pos_css, td->queue->root_blkg) {  in blk_throtl_update_limit_valid()
590 	td->limit_valid[LIMIT_LOW] = low_valid;  in blk_throtl_update_limit_valid()
593 static void throtl_upgrade_state(struct throtl_data *td);
603 	blk_throtl_update_limit_valid(tg->td);  in throtl_pd_offline()
605 	if (!tg->td->limit_valid[tg->td->limit_index])  in throtl_pd_offline()
606 		throtl_upgrade_state(tg->td);  in throtl_pd_offline()
774 	tg->slice_end[rw] = jiffies + tg->td->throtl_slice;  in throtl_start_new_slice_with_credit()
786 	tg->slice_end[rw] = jiffies + tg->td->throtl_slice;  in throtl_start_new_slice()
796 	tg->slice_end[rw] = roundup(jiffy_end, tg->td->throtl_slice);  in throtl_set_slice_end()
802 	tg->slice_end[rw] = roundup(jiffy_end, tg->td->throtl_slice);  in throtl_extend_slice()
842 	throtl_set_slice_end(tg, rw, jiffies + tg->td->throtl_slice);  in throtl_trim_slice()
846 	nr_slices = time_elapsed / tg->td->throtl_slice;  in throtl_trim_slice()
850 	tmp = tg_bps_limit(tg, rw) * tg->td->throtl_slice * nr_slices;  in throtl_trim_slice()
854 	io_trim = (tg_iops_limit(tg, rw) * tg->td->throtl_slice * nr_slices) /  in throtl_trim_slice()
870 	tg->slice_start[rw] += nr_slices * tg->td->throtl_slice;  in throtl_trim_slice()
889 	jiffy_elapsed_rnd = roundup(jiffy_elapsed + 1, tg->td->throtl_slice);  in tg_with_in_iops_limit()
932 		jiffy_elapsed_rnd = tg->td->throtl_slice;  in tg_with_in_bps_limit()
934 	jiffy_elapsed_rnd = roundup(jiffy_elapsed_rnd, tg->td->throtl_slice);  in tg_with_in_bps_limit()
1001 		    jiffies + tg->td->throtl_slice))  in tg_may_dispatch()
1003 				jiffies + tg->td->throtl_slice);  in tg_may_dispatch()
1146 		BUG_ON(tg->td->nr_queued[rw] <= 0);  in tg_dispatch_one_bio()
1147 		tg->td->nr_queued[rw]--;  in tg_dispatch_one_bio()
1218 static bool throtl_can_upgrade(struct throtl_data *td,
1239 	struct throtl_data *td = sq_to_td(sq);  in throtl_pending_timer_fn()  local
1240 	struct request_queue *q = td->queue;  in throtl_pending_timer_fn()
1246 	if (throtl_can_upgrade(td, NULL))  in throtl_pending_timer_fn()
1247 		throtl_upgrade_state(td);  in throtl_pending_timer_fn()
1289 		queue_work(kthrotld_workqueue, &td->dispatch_work);  in throtl_pending_timer_fn()
1305 	struct throtl_data *td = container_of(work, struct throtl_data,  in blk_throtl_dispatch_work_fn()  local
1307 	struct throtl_service_queue *td_sq = &td->service_queue;  in blk_throtl_dispatch_work_fn()
1308 	struct request_queue *q = td->queue;  in blk_throtl_dispatch_work_fn()
1385 			global ? tg->td->queue->root_blkg : tg_to_blkg(tg)) {  in tg_conf_updated()
1687 	blk_throtl_update_limit_valid(tg->td);  in tg_set_limit()
1688 	if (tg->td->limit_valid[LIMIT_LOW]) {  in tg_set_limit()
1690 			tg->td->limit_index = LIMIT_LOW;  in tg_set_limit()
1692 		tg->td->limit_index = LIMIT_MAX;  in tg_set_limit()
1694 		tg->td->limit_valid[LIMIT_LOW]);  in tg_set_limit()
1723 	struct throtl_data *td = q->td;  in throtl_shutdown_wq()  local
1725 	cancel_work_sync(&td->dispatch_work);  in throtl_shutdown_wq()
1800 		tg->bio_cnt, ret, tg->td->scale);  in throtl_tg_is_idle()
1825 		tg_last_low_overflow_time(tg) + tg->td->throtl_slice) &&  in throtl_tg_can_upgrade()
1843 static bool throtl_can_upgrade(struct throtl_data *td,  in throtl_can_upgrade()  argument
1849 	if (td->limit_index != LIMIT_LOW)  in throtl_can_upgrade()
1852 	if (time_before(jiffies, td->low_downgrade_time + td->throtl_slice))  in throtl_can_upgrade()
1856 	blkg_for_each_descendant_post(blkg, pos_css, td->queue->root_blkg) {  in throtl_can_upgrade()
1876 	if (tg->td->limit_index != LIMIT_LOW)  in throtl_upgrade_check()
1879 	if (time_after(tg->last_check_time + tg->td->throtl_slice, now))  in throtl_upgrade_check()
1885 	     __tg_last_low_overflow_time(tg) + tg->td->throtl_slice))  in throtl_upgrade_check()
1888 	if (throtl_can_upgrade(tg->td, NULL))  in throtl_upgrade_check()
1889 		throtl_upgrade_state(tg->td);  in throtl_upgrade_check()
1892 static void throtl_upgrade_state(struct throtl_data *td)  in throtl_upgrade_state()  argument
1897 	throtl_log(&td->service_queue, "upgrade to max");  in throtl_upgrade_state()
1898 	td->limit_index = LIMIT_MAX;  in throtl_upgrade_state()
1899 	td->low_upgrade_time = jiffies;  in throtl_upgrade_state()
1900 	td->scale = 0;  in throtl_upgrade_state()
1902 	blkg_for_each_descendant_post(blkg, pos_css, td->queue->root_blkg) {  in throtl_upgrade_state()
1911 	throtl_select_dispatch(&td->service_queue);  in throtl_upgrade_state()
1912 	throtl_schedule_next_dispatch(&td->service_queue, true);  in throtl_upgrade_state()
1913 	queue_work(kthrotld_workqueue, &td->dispatch_work);  in throtl_upgrade_state()
1916 static void throtl_downgrade_state(struct throtl_data *td, int new)  in throtl_downgrade_state()  argument
1918 	td->scale /= 2;  in throtl_downgrade_state()
1920 	throtl_log(&td->service_queue, "downgrade, scale %d", td->scale);  in throtl_downgrade_state()
1921 	if (td->scale) {  in throtl_downgrade_state()
1922 		td->low_upgrade_time = jiffies - td->scale * td->throtl_slice;  in throtl_downgrade_state()
1926 	td->limit_index = new;  in throtl_downgrade_state()
1927 	td->low_downgrade_time = jiffies;  in throtl_downgrade_state()
1932 	struct throtl_data *td = tg->td;  in throtl_tg_can_downgrade()  local
1939 	if (time_after_eq(now, td->low_upgrade_time + td->throtl_slice) &&  in throtl_tg_can_downgrade()
1941 					td->throtl_slice) &&  in throtl_tg_can_downgrade()
1967 	if (tg->td->limit_index != LIMIT_MAX ||  in throtl_downgrade_check()
1968 	    !tg->td->limit_valid[LIMIT_LOW])  in throtl_downgrade_check()
1972 	if (time_after(tg->last_check_time + tg->td->throtl_slice, now))  in throtl_downgrade_check()
1979 			tg->td->throtl_slice))  in throtl_downgrade_check()
2013 		throtl_downgrade_state(tg->td, LIMIT_LOW);  in throtl_downgrade_check()
2035 static void throtl_update_latency_buckets(struct throtl_data *td)  in throtl_update_latency_buckets()  argument
2042 	if (!blk_queue_nonrot(td->queue))  in throtl_update_latency_buckets()
2044 	if (time_before(jiffies, td->last_calculate_time + HZ))  in throtl_update_latency_buckets()
2046 	td->last_calculate_time = jiffies;  in throtl_update_latency_buckets()
2051 			struct latency_bucket *tmp = &td->tmp_buckets[rw][i];  in throtl_update_latency_buckets()
2057 				bucket = per_cpu_ptr(td->latency_buckets[rw],  in throtl_update_latency_buckets()
2083 				if (td->avg_buckets[rw][i].latency < last_latency[rw])  in throtl_update_latency_buckets()
2084 					td->avg_buckets[rw][i].latency =  in throtl_update_latency_buckets()
2089 			if (!td->avg_buckets[rw][i].valid)  in throtl_update_latency_buckets()
2092 				latency[rw] = (td->avg_buckets[rw][i].latency * 7 +  in throtl_update_latency_buckets()
2095 			td->avg_buckets[rw][i].latency = max(latency[rw],  in throtl_update_latency_buckets()
2097 			td->avg_buckets[rw][i].valid = true;  in throtl_update_latency_buckets()
2098 			last_latency[rw] = td->avg_buckets[rw][i].latency;  in throtl_update_latency_buckets()
2103 		throtl_log(&td->service_queue,  in throtl_update_latency_buckets()
2106 			td->avg_buckets[READ][i].latency,  in throtl_update_latency_buckets()
2107 			td->avg_buckets[READ][i].valid,  in throtl_update_latency_buckets()
2108 			td->avg_buckets[WRITE][i].latency,  in throtl_update_latency_buckets()
2109 			td->avg_buckets[WRITE][i].valid);  in throtl_update_latency_buckets()
2112 static inline void throtl_update_latency_buckets(struct throtl_data *td)  in throtl_update_latency_buckets()  argument
2125 	struct throtl_data *td = tg->td;  in blk_throtl_bio()  local
2135 	throtl_update_latency_buckets(td);  in blk_throtl_bio()
2154 			if (throtl_can_upgrade(td, tg)) {  in blk_throtl_bio()
2155 				throtl_upgrade_state(td);  in blk_throtl_bio()
2199 	td->nr_queued[rw]++;  in blk_throtl_bio()
2220 	if (throttled || !td->track_bio_latency)  in blk_throtl_bio()
2227 static void throtl_track_latency(struct throtl_data *td, sector_t size,  in throtl_track_latency()  argument
2233 	if (!td || td->limit_index != LIMIT_LOW ||  in throtl_track_latency()
2235 	    !blk_queue_nonrot(td->queue))  in throtl_track_latency()
2240 	latency = get_cpu_ptr(td->latency_buckets[op]);  in throtl_track_latency()
2243 	put_cpu_ptr(td->latency_buckets[op]);  in throtl_track_latency()
2249 	struct throtl_data *td = q->td;  in blk_throtl_stat_add()  local
2251 	throtl_track_latency(td, blk_rq_stats_sectors(rq), req_op(rq),  in blk_throtl_stat_add()
2281 		throtl_track_latency(tg->td, bio_issue_size(&bio->bi_issue),  in blk_throtl_bio_endio()
2284 	if (tg->latency_target && lat >= tg->td->filtered_latency) {  in blk_throtl_bio_endio()
2289 		threshold = tg->td->avg_buckets[rw][bucket].latency +  in blk_throtl_bio_endio()
2301 		tg->bio_cnt_reset_time = tg->td->throtl_slice + jiffies;  in blk_throtl_bio_endio()
2339 	struct throtl_data *td = q->td;  in blk_throtl_drain()  local
2353 	blkg_for_each_descendant_post(blkg, pos_css, td->queue->root_blkg)  in blk_throtl_drain()
2357 	tg_drain_bios(&td->service_queue);  in blk_throtl_drain()
2364 		while ((bio = throtl_pop_queued(&td->service_queue.queued[rw],  in blk_throtl_drain()
2373 	struct throtl_data *td;  in blk_throtl_init()  local
2376 	td = kzalloc_node(sizeof(*td), GFP_KERNEL, q->node);  in blk_throtl_init()
2377 	if (!td)  in blk_throtl_init()
2379 	td->latency_buckets[READ] = __alloc_percpu(sizeof(struct latency_bucket) *  in blk_throtl_init()
2381 	if (!td->latency_buckets[READ]) {  in blk_throtl_init()
2382 		kfree(td);  in blk_throtl_init()
2385 	td->latency_buckets[WRITE] = __alloc_percpu(sizeof(struct latency_bucket) *  in blk_throtl_init()
2387 	if (!td->latency_buckets[WRITE]) {  in blk_throtl_init()
2388 		free_percpu(td->latency_buckets[READ]);  in blk_throtl_init()
2389 		kfree(td);  in blk_throtl_init()
2393 	INIT_WORK(&td->dispatch_work, blk_throtl_dispatch_work_fn);  in blk_throtl_init()
2394 	throtl_service_queue_init(&td->service_queue);  in blk_throtl_init()
2396 	q->td = td;  in blk_throtl_init()
2397 	td->queue = q;  in blk_throtl_init()
2399 	td->limit_valid[LIMIT_MAX] = true;  in blk_throtl_init()
2400 	td->limit_index = LIMIT_MAX;  in blk_throtl_init()
2401 	td->low_upgrade_time = jiffies;  in blk_throtl_init()
2402 	td->low_downgrade_time = jiffies;  in blk_throtl_init()
2407 		free_percpu(td->latency_buckets[READ]);  in blk_throtl_init()
2408 		free_percpu(td->latency_buckets[WRITE]);  in blk_throtl_init()
2409 		kfree(td);  in blk_throtl_init()
2416 	BUG_ON(!q->td);  in blk_throtl_exit()
2419 	free_percpu(q->td->latency_buckets[READ]);  in blk_throtl_exit()
2420 	free_percpu(q->td->latency_buckets[WRITE]);  in blk_throtl_exit()
2421 	kfree(q->td);  in blk_throtl_exit()
2426 	struct throtl_data *td;  in blk_throtl_register_queue()  local
2429 	td = q->td;  in blk_throtl_register_queue()
2430 	BUG_ON(!td);  in blk_throtl_register_queue()
2433 		td->throtl_slice = DFL_THROTL_SLICE_SSD;  in blk_throtl_register_queue()
2434 		td->filtered_latency = LATENCY_FILTERED_SSD;  in blk_throtl_register_queue()
2436 		td->throtl_slice = DFL_THROTL_SLICE_HD;  in blk_throtl_register_queue()
2437 		td->filtered_latency = LATENCY_FILTERED_HD;  in blk_throtl_register_queue()
2439 			td->avg_buckets[READ][i].latency = DFL_HD_BASELINE_LATENCY;  in blk_throtl_register_queue()
2440 			td->avg_buckets[WRITE][i].latency = DFL_HD_BASELINE_LATENCY;  in blk_throtl_register_queue()
2445 	td->throtl_slice = DFL_THROTL_SLICE_HD;  in blk_throtl_register_queue()
2448 	td->track_bio_latency = !queue_is_mq(q);  in blk_throtl_register_queue()
2449 	if (!td->track_bio_latency)  in blk_throtl_register_queue()
2456 	if (!q->td)  in blk_throtl_sample_time_show()
2458 	return sprintf(page, "%u\n", jiffies_to_msecs(q->td->throtl_slice));  in blk_throtl_sample_time_show()
2467 	if (!q->td)  in blk_throtl_sample_time_store()
2474 	q->td->throtl_slice = t;  in blk_throtl_sample_time_store()