Skip to contentSkip to conversation

cfq-iosched: cleanup unreachable code

PATCH Applied Corrado Zoccolo 3 participants 3 messages Nov 24, 2009 – Nov 26, 2009 Block layer

lore
Share & tools
lore
#0 lore raw

PATCH 1/1 cfq-iosched: cleanup unreachable code

cfq_should_idle returns false for no-idle queues that are not the last, so the control flow will never reach the removed code in a state that satisfies the if condition.
The unreachable code was added to emulate previous cfq behaviour for non-NCQ rotational devices. My tests show that even without it, the performances and fairness are comparable with previous cfq, thanks to the fact that all seeky queues are grouped together, and that we idle at the end of the tree.

---
 block/cfq-iosched.c |   13 -------------
 1 files changed, 0 insertions(+), 13 deletions(-)
block/cfq-iosched.c +0 -13
index d44f8a4..7144649 100644
@@ -1274,19 +1274,6 @@ static void cfq_arm_slice_timer(struct cfq_data *cfqd)
 	cfq_mark_cfqq_wait_request(cfqq);
 
 	sl = cfqd->cfq_slice_idle;
-	/* are we servicing noidle tree, and there are more queues?
-	 * non-rotational or NCQ: no idle
-	 * non-NCQ rotational : very small idle, to allow
-	 *     fair distribution of slice time for a process doing back-to-back
-	 *     seeks.
-	 */
-	if (cfqd->serving_type == SYNC_NOIDLE_WORKLOAD &&
-	    service_tree_for(cfqd->serving_prio, SYNC_NOIDLE_WORKLOAD, cfqd)
-		->count > 0) {
-		if (blk_queue_nonrot(cfqd->queue) || cfqd->hw_tag)
-			return;
-		sl = min(sl, msecs_to_jiffies(CFQ_MIN_TT));
-	}
 
 	mod_timer(&cfqd->idle_slice_timer, jiffies + sl);
 	cfq_log_cfqq(cfqd, cfqq, "arm_idle: %lu", sl);
Signature · 1 line
1.6.2.5
Acked-by on v1 1/1
#1 lore raw
Quoted 9 lines · Corrado Zoccolo

cfq_should_idle returns false for no-idle queues that are not the last, so the control flow will never reach the removed code in a state that satisfies the if condition.
The unreachable code was added to emulate previous cfq behaviour for non-NCQ rotational devices. My tests show that even without it, the performances and fairness are comparable with previous cfq, thanks to the fact that all seeky queues are grouped together, and that we idle at the end of the tree.

As you said that right now it is dead code, so better remove it.

Theoretically, by retaining this code we could benefit on non NCQ rotational media if seek cost across the sync-noidle queues is higher as compared to seek cost with-in queue. Fix it if we run into it.

Till then better to remove dead code.

Thanks
Vivek

Quoted 32 lines
---
 block/cfq-iosched.c |   13 -------------
 1 files changed, 0 insertions(+), 13 deletions(-)
block/cfq-iosched.c +0 -13
index d44f8a4..7144649 100644
@@ -1274,19 +1274,6 @@ static void cfq_arm_slice_timer(struct cfq_data *cfqd)
 	cfq_mark_cfqq_wait_request(cfqq);
 
 	sl = cfqd->cfq_slice_idle;
-	/* are we servicing noidle tree, and there are more queues?
-	 * non-rotational or NCQ: no idle
-	 * non-NCQ rotational : very small idle, to allow
-	 *     fair distribution of slice time for a process doing back-to-back
-	 *     seeks.
-	 */
-	if (cfqd->serving_type == SYNC_NOIDLE_WORKLOAD &&
-	    service_tree_for(cfqd->serving_prio, SYNC_NOIDLE_WORKLOAD, cfqd)
-		->count > 0) {
-		if (blk_queue_nonrot(cfqd->queue) || cfqd->hw_tag)
-			return;
-		sl = min(sl, msecs_to_jiffies(CFQ_MIN_TT));
-	}
 
 	mod_timer(&cfqd->idle_slice_timer, jiffies + sl);
 	cfq_log_cfqq(cfqd, cfqq, "arm_idle: %lu", sl);
Signature · 1 line
1.6.2.5
Applied
#2 lore raw
In reply to Corrado Zoccolo
Quoted 8 lines · Corrado Zoccolo

cfq_should_idle returns false for no-idle queues that are not the last, so the control flow will never reach the removed code in a state that satisfies the if condition.
The unreachable code was added to emulate previous cfq behaviour for non-NCQ rotational devices. My tests show that even without it, the performances and fairness are comparable with previous cfq, thanks to the fact that all seeky queues are grouped together, and that we idle at the end of the tree.

Applied, thanks.

Signature · 1 line
Jens Axboe