projects / linux-2.6-block.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 3ae11c9) | patch
sched/fair: Optimize find_busiest_queue()
authorPeter Zijlstra <peterz@infradead.org>
Mon, 19 Aug 2013 13:20:21 +0000 (15:20 +0200)
committerIngo Molnar <mingo@kernel.org>
Mon, 2 Sep 2013 06:27:37 +0000 (08:27 +0200)
commit6906a40839198f33dbb56d20e644c01e00663952
tree27b31ae4522f4191cb82c17cf30b918b94562412tree | snapshot
parent3ae11c90fd055ba1b1b03a014f851b395bdd26ffcommit | diff
sched/fair: Optimize find_busiest_queue()

Use for_each_cpu_and() and thereby avoid computing the capacity for
CPUs we know we're not interested in.

Reviewed-by: Paul Turner <pjt@google.com>
Reviewed-by: Preeti U Murthy <preeti@linux.vnet.ibm.com>
Signed-off-by: Peter Zijlstra <peterz@infradead.org>
Link: http://lkml.kernel.org/n/tip-lppceyv6kb3a19g8spmrn20b@git.kernel.org
Signed-off-by: Ingo Molnar <mingo@kernel.org>
kernel/sched/fair.c diff | blob | blame | history
Linux 6.x block layer and io_uring tree(s)