| commit | e2c880630438f80b474378d5487b511b07665051 | |
| author | Rusty Russell <rusty@rustcorp.com.au> | |
| Tue, 3 Nov 2009 04:23:15 +0000 (3 14:53 +1030) | ||
| committer | Ingo Molnar <mingo@elte.hu> | |
| Wed, 4 Nov 2009 12:16:38 +0000 (4 13:16 +0100) | ||
| tree | 0f35b58cd657a3b50e03a93a12367ab82bd569ef | treesnapshot (tar.gz zip) |
| parent | 45a5c8bad827ebb9c9798becc15bce2e804d49e0 | commitdiff |
cpumask: Simplify sched_rt.c
find_lowest_rq() wants to call pick_optimal_cpu() on the
intersection of sched_domain_span(sd) and lowest_mask. Rather
than doing a cpus_and into a temporary, we can open-code it.
This actually makes the code slightly clearer, IMHO.
Signed-off-by: Rusty Russell <rusty@rustcorp.com.au>
Acked-by: Gregory Haskins <ghaskins@novell.com>
Cc: Steven Rostedt <rostedt@goodmis.org>
LKML-Reference: <200911031453.15350.rusty@rustcorp.com.au>
Signed-off-by: Ingo Molnar <mingo@elte.hu>
find_lowest_rq() wants to call pick_optimal_cpu() on the
intersection of sched_domain_span(sd) and lowest_mask. Rather
than doing a cpus_and into a temporary, we can open-code it.
This actually makes the code slightly clearer, IMHO.
Signed-off-by: Rusty Russell <rusty@rustcorp.com.au>
Acked-by: Gregory Haskins <ghaskins@novell.com>
Cc: Steven Rostedt <rostedt@goodmis.org>
LKML-Reference: <200911031453.15350.rusty@rustcorp.com.au>
Signed-off-by: Ingo Molnar <mingo@elte.hu>
| kernel/sched_rt.c | diffblobblamehistory |