X-Git-Url: https://git.kernelconcepts.de/?a=blobdiff_plain;f=block%2Fbfq-iosched.c;h=ed93da2462abbc94ab75c10a0d9c7ce251f3f0fb;hb=9d0eb4624601ac978b9e89be4aeadbd51ab2c830;hp=bd8499ef157ce8786c6eaa164448eb0bf9e84c6c;hpb=f94c128eefcce2e3448d543f13cd7d7b8aa660a5;p=karo-tx-linux.git

diff --git a/block/bfq-iosched.c b/block/bfq-iosched.c
index bd8499ef157c..ed93da2462ab 100644
--- a/block/bfq-iosched.c
+++ b/block/bfq-iosched.c
@@ -56,6 +56,11 @@
  * rotational or flash-based devices, and to get the job done quickly
  * for applications consisting in many I/O-bound processes.
  *
+ * NOTE: if the main or only goal, with a given device, is to achieve
+ * the maximum-possible throughput at all times, then do switch off
+ * all low-latency heuristics for that device, by setting low_latency
+ * to 0.
+ *
  * BFQ is described in [1], where also a reference to the initial, more
  * theoretical paper on BFQ can be found. The interested reader can find
  * in the latter paper full details on the main algorithm, as well as
@@ -3660,7 +3665,7 @@ void bfq_put_queue(struct bfq_queue *bfqq)
 
 	kmem_cache_free(bfq_pool, bfqq);
 #ifdef CONFIG_BFQ_GROUP_IOSCHED
-	bfqg_put(bfqg);
+	bfqg_and_blkg_put(bfqg);
 #endif
 }