124 		return tg->td;  in sq_to_td()
137 static uint64_t throtl_adjusted_limit(uint64_t low, struct throtl_data *td)  in throtl_adjusted_limit()  argument
140 	if (td->scale < 4096 && time_after_eq(jiffies,  in throtl_adjusted_limit()
141 	    td->low_upgrade_time + td->scale * td->throtl_slice))  in throtl_adjusted_limit()
142 		td->scale = (jiffies - td->low_upgrade_time) / td->throtl_slice;  in throtl_adjusted_limit()
144 	return low + (low >> 1) * td->scale;  in throtl_adjusted_limit()
150 	struct throtl_data *td;  in tg_bps_limit()  local
156 	td = tg->td;  in tg_bps_limit()
157 	ret = tg->bps[rw][td->limit_index];  in tg_bps_limit()
158 	if (ret == 0 && td->limit_index == LIMIT_LOW) {  in tg_bps_limit()
161 		    tg->iops[rw][td->limit_index])  in tg_bps_limit()
167 	if (td->limit_index == LIMIT_MAX && tg->bps[rw][LIMIT_LOW] &&  in tg_bps_limit()
171 		adjusted = throtl_adjusted_limit(tg->bps[rw][LIMIT_LOW], td);  in tg_bps_limit()
180 	struct throtl_data *td;  in tg_iops_limit()  local
186 	td = tg->td;  in tg_iops_limit()
187 	ret = tg->iops[rw][td->limit_index];  in tg_iops_limit()
188 	if (ret == 0 && tg->td->limit_index == LIMIT_LOW) {  in tg_iops_limit()
191 		    tg->bps[rw][td->limit_index])  in tg_iops_limit()
197 	if (td->limit_index == LIMIT_MAX && tg->iops[rw][LIMIT_LOW] &&  in tg_iops_limit()
201 		adjusted = throtl_adjusted_limit(tg->iops[rw][LIMIT_LOW], td);  in tg_iops_limit()
390 	struct throtl_data *td = blkg->q->td;  in throtl_pd_init()  local
407 	sq->parent_sq = &td->service_queue;  in throtl_pd_init()
410 	tg->td = td;  in throtl_pd_init()
421 	struct throtl_data *td = tg->td;  in tg_update_has_rules()  local
427 			(td->limit_valid[td->limit_index] &&  in tg_update_has_rules()
431 			(td->limit_valid[td->limit_index] &&  in tg_update_has_rules()
447 static void blk_throtl_update_limit_valid(struct throtl_data *td)  in blk_throtl_update_limit_valid()  argument
454 	blkg_for_each_descendant_post(blkg, pos_css, td->queue->root_blkg) {  in blk_throtl_update_limit_valid()
465 	td->limit_valid[LIMIT_LOW] = low_valid;  in blk_throtl_update_limit_valid()
468 static inline void blk_throtl_update_limit_valid(struct throtl_data *td)  in blk_throtl_update_limit_valid()  argument
473 static void throtl_upgrade_state(struct throtl_data *td);
483 	blk_throtl_update_limit_valid(tg->td);  in throtl_pd_offline()
485 	if (!tg->td->limit_valid[tg->td->limit_index])  in throtl_pd_offline()
486 		throtl_upgrade_state(tg->td);  in throtl_pd_offline()
650 	tg->slice_end[rw] = jiffies + tg->td->throtl_slice;  in throtl_start_new_slice_with_credit()
663 	tg->slice_end[rw] = jiffies + tg->td->throtl_slice;  in throtl_start_new_slice()
678 	tg->slice_end[rw] = roundup(jiffy_end, tg->td->throtl_slice);  in throtl_set_slice_end()
760 	throtl_set_slice_end(tg, rw, jiffies + tg->td->throtl_slice);  in throtl_trim_slice()
763 				 tg->td->throtl_slice);  in throtl_trim_slice()
791 		   rw == READ ? 'R' : 'W', time_elapsed / tg->td->throtl_slice,  in throtl_trim_slice()
845 	jiffy_elapsed_rnd = roundup(jiffy_elapsed + 1, tg->td->throtl_slice);  in tg_within_iops_limit()
874 		jiffy_elapsed_rnd = tg->td->throtl_slice;  in tg_within_bps_limit()
876 	jiffy_elapsed_rnd = roundup(jiffy_elapsed_rnd, tg->td->throtl_slice);  in tg_within_bps_limit()
937 		    jiffies + tg->td->throtl_slice))  in tg_may_dispatch()
939 				jiffies + tg->td->throtl_slice);  in tg_may_dispatch()
1078 		BUG_ON(tg->td->nr_queued[rw] <= 0);  in tg_dispatch_one_bio()
1079 		tg->td->nr_queued[rw]--;  in tg_dispatch_one_bio()
1154 static bool throtl_can_upgrade(struct throtl_data *td,
1175 	struct throtl_data *td = sq_to_td(sq);  in throtl_pending_timer_fn()  local
1185 		q = td->queue;  in throtl_pending_timer_fn()
1192 	if (throtl_can_upgrade(td, NULL))  in throtl_pending_timer_fn()
1193 		throtl_upgrade_state(td);  in throtl_pending_timer_fn()
1235 		queue_work(kthrotld_workqueue, &td->dispatch_work);  in throtl_pending_timer_fn()
1251 	struct throtl_data *td = container_of(work, struct throtl_data,  in blk_throtl_dispatch_work_fn()  local
1253 	struct throtl_service_queue *td_sq = &td->service_queue;  in blk_throtl_dispatch_work_fn()
1254 	struct request_queue *q = td->queue;  in blk_throtl_dispatch_work_fn()
1331 			global ? tg->td->queue->root_blkg : tg_to_blkg(tg)) {  in tg_conf_updated()
1665 	blk_throtl_update_limit_valid(tg->td);  in tg_set_limit()
1666 	if (tg->td->limit_valid[LIMIT_LOW]) {  in tg_set_limit()
1668 			tg->td->limit_index = LIMIT_LOW;  in tg_set_limit()
1670 		tg->td->limit_index = LIMIT_MAX;  in tg_set_limit()
1672 		tg->td->limit_valid[LIMIT_LOW]);  in tg_set_limit()
1701 	struct throtl_data *td = q->td;  in throtl_shutdown_wq()  local
1703 	cancel_work_sync(&td->dispatch_work);  in throtl_shutdown_wq()
1823 		tg->bio_cnt, ret, tg->td->scale);  in throtl_tg_is_idle()
1853 		tg_last_low_overflow_time(tg) + tg->td->throtl_slice) &&  in throtl_tg_can_upgrade()
1871 static bool throtl_can_upgrade(struct throtl_data *td,  in throtl_can_upgrade()  argument
1877 	if (td->limit_index != LIMIT_LOW)  in throtl_can_upgrade()
1880 	if (time_before(jiffies, td->low_downgrade_time + td->throtl_slice))  in throtl_can_upgrade()
1884 	blkg_for_each_descendant_post(blkg, pos_css, td->queue->root_blkg) {  in throtl_can_upgrade()
1904 	if (tg->td->limit_index != LIMIT_LOW)  in throtl_upgrade_check()
1907 	if (time_after(tg->last_check_time + tg->td->throtl_slice, now))  in throtl_upgrade_check()
1913 	     __tg_last_low_overflow_time(tg) + tg->td->throtl_slice))  in throtl_upgrade_check()
1916 	if (throtl_can_upgrade(tg->td, NULL))  in throtl_upgrade_check()
1917 		throtl_upgrade_state(tg->td);  in throtl_upgrade_check()
1920 static void throtl_upgrade_state(struct throtl_data *td)  in throtl_upgrade_state()  argument
1925 	throtl_log(&td->service_queue, "upgrade to max");  in throtl_upgrade_state()
1926 	td->limit_index = LIMIT_MAX;  in throtl_upgrade_state()
1927 	td->low_upgrade_time = jiffies;  in throtl_upgrade_state()
1928 	td->scale = 0;  in throtl_upgrade_state()
1930 	blkg_for_each_descendant_post(blkg, pos_css, td->queue->root_blkg) {  in throtl_upgrade_state()
1939 	throtl_select_dispatch(&td->service_queue);  in throtl_upgrade_state()
1940 	throtl_schedule_next_dispatch(&td->service_queue, true);  in throtl_upgrade_state()
1941 	queue_work(kthrotld_workqueue, &td->dispatch_work);  in throtl_upgrade_state()
1944 static void throtl_downgrade_state(struct throtl_data *td)  in throtl_downgrade_state()  argument
1946 	td->scale /= 2;  in throtl_downgrade_state()
1948 	throtl_log(&td->service_queue, "downgrade, scale %d", td->scale);  in throtl_downgrade_state()
1949 	if (td->scale) {  in throtl_downgrade_state()
1950 		td->low_upgrade_time = jiffies - td->scale * td->throtl_slice;  in throtl_downgrade_state()
1954 	td->limit_index = LIMIT_LOW;  in throtl_downgrade_state()
1955 	td->low_downgrade_time = jiffies;  in throtl_downgrade_state()
1960 	struct throtl_data *td = tg->td;  in throtl_tg_can_downgrade()  local
1968 					td->throtl_slice) &&  in throtl_tg_can_downgrade()
1977 	struct throtl_data *td = tg->td;  in throtl_hierarchy_can_downgrade()  local
1979 	if (time_before(jiffies, td->low_upgrade_time + td->throtl_slice))  in throtl_hierarchy_can_downgrade()
1999 	if (tg->td->limit_index != LIMIT_MAX ||  in throtl_downgrade_check()
2000 	    !tg->td->limit_valid[LIMIT_LOW])  in throtl_downgrade_check()
2004 	if (time_after(tg->last_check_time + tg->td->throtl_slice, now))  in throtl_downgrade_check()
2011 			tg->td->throtl_slice))  in throtl_downgrade_check()
2045 		throtl_downgrade_state(tg->td);  in throtl_downgrade_check()
2070 static void throtl_update_latency_buckets(struct throtl_data *td)  in throtl_update_latency_buckets()  argument
2077 	if (!blk_queue_nonrot(td->queue) || !td->limit_valid[LIMIT_LOW])  in throtl_update_latency_buckets()
2079 	if (time_before(jiffies, td->last_calculate_time + HZ))  in throtl_update_latency_buckets()
2081 	td->last_calculate_time = jiffies;  in throtl_update_latency_buckets()
2086 			struct latency_bucket *tmp = &td->tmp_buckets[rw][i];  in throtl_update_latency_buckets()
2092 				bucket = per_cpu_ptr(td->latency_buckets[rw],  in throtl_update_latency_buckets()
2118 				if (td->avg_buckets[rw][i].latency < last_latency[rw])  in throtl_update_latency_buckets()
2119 					td->avg_buckets[rw][i].latency =  in throtl_update_latency_buckets()
2124 			if (!td->avg_buckets[rw][i].valid)  in throtl_update_latency_buckets()
2127 				latency[rw] = (td->avg_buckets[rw][i].latency * 7 +  in throtl_update_latency_buckets()
2130 			td->avg_buckets[rw][i].latency = max(latency[rw],  in throtl_update_latency_buckets()
2132 			td->avg_buckets[rw][i].valid = true;  in throtl_update_latency_buckets()
2133 			last_latency[rw] = td->avg_buckets[rw][i].latency;  in throtl_update_latency_buckets()
2138 		throtl_log(&td->service_queue,  in throtl_update_latency_buckets()
2141 			td->avg_buckets[READ][i].latency,  in throtl_update_latency_buckets()
2142 			td->avg_buckets[READ][i].valid,  in throtl_update_latency_buckets()
2143 			td->avg_buckets[WRITE][i].latency,  in throtl_update_latency_buckets()
2144 			td->avg_buckets[WRITE][i].valid);  in throtl_update_latency_buckets()
2147 static inline void throtl_update_latency_buckets(struct throtl_data *td)  in throtl_update_latency_buckets()  argument
2163 static bool throtl_can_upgrade(struct throtl_data *td,  in throtl_can_upgrade()  argument
2169 static void throtl_upgrade_state(struct throtl_data *td)  in throtl_upgrade_state()  argument
2183 	struct throtl_data *td = tg->td;  in __blk_throtl_bio()  local
2189 	throtl_update_latency_buckets(td);  in __blk_throtl_bio()
2208 			if (throtl_can_upgrade(td, tg)) {  in __blk_throtl_bio()
2209 				throtl_upgrade_state(td);  in __blk_throtl_bio()
2255 	td->nr_queued[rw]++;  in __blk_throtl_bio()
2272 	if (throttled || !td->track_bio_latency)  in __blk_throtl_bio()
2282 static void throtl_track_latency(struct throtl_data *td, sector_t size,  in throtl_track_latency()  argument
2289 	if (!td || td->limit_index != LIMIT_LOW ||  in throtl_track_latency()
2291 	    !blk_queue_nonrot(td->queue))  in throtl_track_latency()
2296 	latency = get_cpu_ptr(td->latency_buckets[rw]);  in throtl_track_latency()
2299 	put_cpu_ptr(td->latency_buckets[rw]);  in throtl_track_latency()
2305 	struct throtl_data *td = q->td;  in blk_throtl_stat_add()  local
2307 	throtl_track_latency(td, blk_rq_stats_sectors(rq), req_op(rq),  in blk_throtl_stat_add()
2325 	if (!tg->td->limit_valid[LIMIT_LOW])  in blk_throtl_bio_endio()
2339 		throtl_track_latency(tg->td, bio_issue_size(&bio->bi_issue),  in blk_throtl_bio_endio()
2342 	if (tg->latency_target && lat >= tg->td->filtered_latency) {  in blk_throtl_bio_endio()
2347 		threshold = tg->td->avg_buckets[rw][bucket].latency +  in blk_throtl_bio_endio()
2359 		tg->bio_cnt_reset_time = tg->td->throtl_slice + jiffies;  in blk_throtl_bio_endio()
2369 	struct throtl_data *td;  in blk_throtl_init()  local
2372 	td = kzalloc_node(sizeof(*td), GFP_KERNEL, q->node);  in blk_throtl_init()
2373 	if (!td)  in blk_throtl_init()
2375 	td->latency_buckets[READ] = __alloc_percpu(sizeof(struct latency_bucket) *  in blk_throtl_init()
2377 	if (!td->latency_buckets[READ]) {  in blk_throtl_init()
2378 		kfree(td);  in blk_throtl_init()
2381 	td->latency_buckets[WRITE] = __alloc_percpu(sizeof(struct latency_bucket) *  in blk_throtl_init()
2383 	if (!td->latency_buckets[WRITE]) {  in blk_throtl_init()
2384 		free_percpu(td->latency_buckets[READ]);  in blk_throtl_init()
2385 		kfree(td);  in blk_throtl_init()
2389 	INIT_WORK(&td->dispatch_work, blk_throtl_dispatch_work_fn);  in blk_throtl_init()
2390 	throtl_service_queue_init(&td->service_queue);  in blk_throtl_init()
2392 	q->td = td;  in blk_throtl_init()
2393 	td->queue = q;  in blk_throtl_init()
2395 	td->limit_valid[LIMIT_MAX] = true;  in blk_throtl_init()
2396 	td->limit_index = LIMIT_MAX;  in blk_throtl_init()
2397 	td->low_upgrade_time = jiffies;  in blk_throtl_init()
2398 	td->low_downgrade_time = jiffies;  in blk_throtl_init()
2403 		free_percpu(td->latency_buckets[READ]);  in blk_throtl_init()
2404 		free_percpu(td->latency_buckets[WRITE]);  in blk_throtl_init()
2405 		kfree(td);  in blk_throtl_init()
2414 	BUG_ON(!q->td);  in blk_throtl_exit()
2415 	del_timer_sync(&q->td->service_queue.pending_timer);  in blk_throtl_exit()
2418 	free_percpu(q->td->latency_buckets[READ]);  in blk_throtl_exit()
2419 	free_percpu(q->td->latency_buckets[WRITE]);  in blk_throtl_exit()
2420 	kfree(q->td);  in blk_throtl_exit()
2426 	struct throtl_data *td;  in blk_throtl_register()  local
2429 	td = q->td;  in blk_throtl_register()
2430 	BUG_ON(!td);  in blk_throtl_register()
2433 		td->throtl_slice = DFL_THROTL_SLICE_SSD;  in blk_throtl_register()
2434 		td->filtered_latency = LATENCY_FILTERED_SSD;  in blk_throtl_register()
2436 		td->throtl_slice = DFL_THROTL_SLICE_HD;  in blk_throtl_register()
2437 		td->filtered_latency = LATENCY_FILTERED_HD;  in blk_throtl_register()
2439 			td->avg_buckets[READ][i].latency = DFL_HD_BASELINE_LATENCY;  in blk_throtl_register()
2440 			td->avg_buckets[WRITE][i].latency = DFL_HD_BASELINE_LATENCY;  in blk_throtl_register()
2445 	td->throtl_slice = DFL_THROTL_SLICE_HD;  in blk_throtl_register()
2448 	td->track_bio_latency = !queue_is_mq(q);  in blk_throtl_register()
2449 	if (!td->track_bio_latency)  in blk_throtl_register()
2457 	if (!q->td)  in blk_throtl_sample_time_show()
2459 	return sprintf(page, "%u\n", jiffies_to_msecs(q->td->throtl_slice));  in blk_throtl_sample_time_show()
2468 	if (!q->td)  in blk_throtl_sample_time_store()
2475 	q->td->throtl_slice = t;  in blk_throtl_sample_time_store()