Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1 | /* |
| 2 | * Completely Fair Scheduling (CFS) Class (SCHED_NORMAL/SCHED_BATCH) |
| 3 | * |
| 4 | * Copyright (C) 2007 Red Hat, Inc., Ingo Molnar <mingo@redhat.com> |
| 5 | * |
| 6 | * Interactivity improvements by Mike Galbraith |
| 7 | * (C) 2007 Mike Galbraith <efault@gmx.de> |
| 8 | * |
| 9 | * Various enhancements by Dmitry Adamushko. |
| 10 | * (C) 2007 Dmitry Adamushko <dmitry.adamushko@gmail.com> |
| 11 | * |
| 12 | * Group scheduling enhancements by Srivatsa Vaddagiri |
| 13 | * Copyright IBM Corporation, 2007 |
| 14 | * Author: Srivatsa Vaddagiri <vatsa@linux.vnet.ibm.com> |
| 15 | * |
| 16 | * Scaled math optimizations by Thomas Gleixner |
| 17 | * Copyright (C) 2007, Thomas Gleixner <tglx@linutronix.de> |
Peter Zijlstra | 2180508 | 2007-08-25 18:41:53 +0200 | [diff] [blame] | 18 | * |
| 19 | * Adaptive scheduling granularity, math enhancements by Peter Zijlstra |
| 20 | * Copyright (C) 2007 Red Hat, Inc., Peter Zijlstra <pzijlstr@redhat.com> |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 21 | */ |
| 22 | |
Arjan van de Ven | 9745512 | 2008-01-25 21:08:34 +0100 | [diff] [blame] | 23 | #include <linux/latencytop.h> |
Christian Ehrhardt | 1983a92 | 2009-11-30 12:16:47 +0100 | [diff] [blame] | 24 | #include <linux/sched.h> |
Arjan van de Ven | 9745512 | 2008-01-25 21:08:34 +0100 | [diff] [blame] | 25 | |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 26 | /* |
Peter Zijlstra | 2180508 | 2007-08-25 18:41:53 +0200 | [diff] [blame] | 27 | * Targeted preemption latency for CPU-bound tasks: |
Mike Galbraith | 172e082 | 2009-09-09 15:41:37 +0200 | [diff] [blame] | 28 | * (default: 5ms * (1 + ilog(ncpus)), units: nanoseconds) |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 29 | * |
Peter Zijlstra | 2180508 | 2007-08-25 18:41:53 +0200 | [diff] [blame] | 30 | * NOTE: this latency value is not the same as the concept of |
Ingo Molnar | d274a4c | 2007-10-15 17:00:14 +0200 | [diff] [blame] | 31 | * 'timeslice length' - timeslices in CFS are of variable length |
| 32 | * and have no persistent notion like in traditional, time-slice |
| 33 | * based scheduling concepts. |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 34 | * |
Ingo Molnar | d274a4c | 2007-10-15 17:00:14 +0200 | [diff] [blame] | 35 | * (to see the precise effective timeslice length of your workload, |
| 36 | * run vmstat and monitor the context-switches (cs) field) |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 37 | */ |
Mike Galbraith | 172e082 | 2009-09-09 15:41:37 +0200 | [diff] [blame] | 38 | unsigned int sysctl_sched_latency = 5000000ULL; |
Christian Ehrhardt | 0bcdcf2 | 2009-11-30 12:16:46 +0100 | [diff] [blame] | 39 | unsigned int normalized_sysctl_sched_latency = 5000000ULL; |
Ingo Molnar | 2bd8e6d | 2007-10-15 17:00:02 +0200 | [diff] [blame] | 40 | |
| 41 | /* |
Christian Ehrhardt | 1983a92 | 2009-11-30 12:16:47 +0100 | [diff] [blame] | 42 | * The initial- and re-scaling of tunables is configurable |
| 43 | * (default SCHED_TUNABLESCALING_LOG = *(1+ilog(ncpus)) |
| 44 | * |
| 45 | * Options are: |
| 46 | * SCHED_TUNABLESCALING_NONE - unscaled, always *1 |
| 47 | * SCHED_TUNABLESCALING_LOG - scaled logarithmical, *1+ilog(ncpus) |
| 48 | * SCHED_TUNABLESCALING_LINEAR - scaled linear, *ncpus |
| 49 | */ |
| 50 | enum sched_tunable_scaling sysctl_sched_tunable_scaling |
| 51 | = SCHED_TUNABLESCALING_LOG; |
| 52 | |
| 53 | /* |
Peter Zijlstra | b2be5e9 | 2007-11-09 22:39:37 +0100 | [diff] [blame] | 54 | * Minimal preemption granularity for CPU-bound tasks: |
Mike Galbraith | 172e082 | 2009-09-09 15:41:37 +0200 | [diff] [blame] | 55 | * (default: 1 msec * (1 + ilog(ncpus)), units: nanoseconds) |
Peter Zijlstra | b2be5e9 | 2007-11-09 22:39:37 +0100 | [diff] [blame] | 56 | */ |
Mike Galbraith | 172e082 | 2009-09-09 15:41:37 +0200 | [diff] [blame] | 57 | unsigned int sysctl_sched_min_granularity = 1000000ULL; |
Christian Ehrhardt | 0bcdcf2 | 2009-11-30 12:16:46 +0100 | [diff] [blame] | 58 | unsigned int normalized_sysctl_sched_min_granularity = 1000000ULL; |
Peter Zijlstra | b2be5e9 | 2007-11-09 22:39:37 +0100 | [diff] [blame] | 59 | |
| 60 | /* |
| 61 | * is kept at sysctl_sched_latency / sysctl_sched_min_granularity |
| 62 | */ |
Zou Nan hai | 722aab0 | 2007-11-26 21:21:49 +0100 | [diff] [blame] | 63 | static unsigned int sched_nr_latency = 5; |
Peter Zijlstra | b2be5e9 | 2007-11-09 22:39:37 +0100 | [diff] [blame] | 64 | |
| 65 | /* |
Mike Galbraith | 2bba22c | 2009-09-09 15:41:37 +0200 | [diff] [blame] | 66 | * After fork, child runs first. If set to 0 (default) then |
Ingo Molnar | 2bd8e6d | 2007-10-15 17:00:02 +0200 | [diff] [blame] | 67 | * parent will (try to) run first. |
| 68 | */ |
Mike Galbraith | 2bba22c | 2009-09-09 15:41:37 +0200 | [diff] [blame] | 69 | unsigned int sysctl_sched_child_runs_first __read_mostly; |
Peter Zijlstra | 2180508 | 2007-08-25 18:41:53 +0200 | [diff] [blame] | 70 | |
| 71 | /* |
Ingo Molnar | 1799e35 | 2007-09-19 23:34:46 +0200 | [diff] [blame] | 72 | * sys_sched_yield() compat mode |
| 73 | * |
| 74 | * This option switches the agressive yield implementation of the |
| 75 | * old scheduler back on. |
| 76 | */ |
| 77 | unsigned int __read_mostly sysctl_sched_compat_yield; |
| 78 | |
| 79 | /* |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 80 | * SCHED_OTHER wake-up granularity. |
Mike Galbraith | 172e082 | 2009-09-09 15:41:37 +0200 | [diff] [blame] | 81 | * (default: 1 msec * (1 + ilog(ncpus)), units: nanoseconds) |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 82 | * |
| 83 | * This option delays the preemption effects of decoupled workloads |
| 84 | * and reduces their over-scheduling. Synchronous workloads will still |
| 85 | * have immediate wakeup/sleep latencies. |
| 86 | */ |
Mike Galbraith | 172e082 | 2009-09-09 15:41:37 +0200 | [diff] [blame] | 87 | unsigned int sysctl_sched_wakeup_granularity = 1000000UL; |
Christian Ehrhardt | 0bcdcf2 | 2009-11-30 12:16:46 +0100 | [diff] [blame] | 88 | unsigned int normalized_sysctl_sched_wakeup_granularity = 1000000UL; |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 89 | |
Ingo Molnar | da84d96 | 2007-10-15 17:00:18 +0200 | [diff] [blame] | 90 | const_debug unsigned int sysctl_sched_migration_cost = 500000UL; |
| 91 | |
Peter Zijlstra | a4c2f00 | 2008-10-17 19:27:03 +0200 | [diff] [blame] | 92 | static const struct sched_class fair_sched_class; |
| 93 | |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 94 | /************************************************************** |
| 95 | * CFS operations on generic schedulable entities: |
| 96 | */ |
| 97 | |
| 98 | #ifdef CONFIG_FAIR_GROUP_SCHED |
| 99 | |
| 100 | /* cpu runqueue to which this cfs_rq is attached */ |
| 101 | static inline struct rq *rq_of(struct cfs_rq *cfs_rq) |
| 102 | { |
| 103 | return cfs_rq->rq; |
| 104 | } |
| 105 | |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 106 | /* An entity is a task if it doesn't "own" a runqueue */ |
| 107 | #define entity_is_task(se) (!se->my_q) |
| 108 | |
Peter Zijlstra | 8f48894 | 2009-07-24 12:25:30 +0200 | [diff] [blame] | 109 | static inline struct task_struct *task_of(struct sched_entity *se) |
| 110 | { |
| 111 | #ifdef CONFIG_SCHED_DEBUG |
| 112 | WARN_ON_ONCE(!entity_is_task(se)); |
| 113 | #endif |
| 114 | return container_of(se, struct task_struct, se); |
| 115 | } |
| 116 | |
Peter Zijlstra | b758149 | 2008-04-19 19:45:00 +0200 | [diff] [blame] | 117 | /* Walk up scheduling entities hierarchy */ |
| 118 | #define for_each_sched_entity(se) \ |
| 119 | for (; se; se = se->parent) |
| 120 | |
| 121 | static inline struct cfs_rq *task_cfs_rq(struct task_struct *p) |
| 122 | { |
| 123 | return p->se.cfs_rq; |
| 124 | } |
| 125 | |
| 126 | /* runqueue on which this entity is (to be) queued */ |
| 127 | static inline struct cfs_rq *cfs_rq_of(struct sched_entity *se) |
| 128 | { |
| 129 | return se->cfs_rq; |
| 130 | } |
| 131 | |
| 132 | /* runqueue "owned" by this group */ |
| 133 | static inline struct cfs_rq *group_cfs_rq(struct sched_entity *grp) |
| 134 | { |
| 135 | return grp->my_q; |
| 136 | } |
| 137 | |
| 138 | /* Given a group's cfs_rq on one cpu, return its corresponding cfs_rq on |
| 139 | * another cpu ('this_cpu') |
| 140 | */ |
| 141 | static inline struct cfs_rq *cpu_cfs_rq(struct cfs_rq *cfs_rq, int this_cpu) |
| 142 | { |
| 143 | return cfs_rq->tg->cfs_rq[this_cpu]; |
| 144 | } |
| 145 | |
| 146 | /* Iterate thr' all leaf cfs_rq's on a runqueue */ |
| 147 | #define for_each_leaf_cfs_rq(rq, cfs_rq) \ |
| 148 | list_for_each_entry_rcu(cfs_rq, &rq->leaf_cfs_rq_list, leaf_cfs_rq_list) |
| 149 | |
| 150 | /* Do the two (enqueued) entities belong to the same group ? */ |
| 151 | static inline int |
| 152 | is_same_group(struct sched_entity *se, struct sched_entity *pse) |
| 153 | { |
| 154 | if (se->cfs_rq == pse->cfs_rq) |
| 155 | return 1; |
| 156 | |
| 157 | return 0; |
| 158 | } |
| 159 | |
| 160 | static inline struct sched_entity *parent_entity(struct sched_entity *se) |
| 161 | { |
| 162 | return se->parent; |
| 163 | } |
| 164 | |
Peter Zijlstra | 464b752 | 2008-10-24 11:06:15 +0200 | [diff] [blame] | 165 | /* return depth at which a sched entity is present in the hierarchy */ |
| 166 | static inline int depth_se(struct sched_entity *se) |
| 167 | { |
| 168 | int depth = 0; |
| 169 | |
| 170 | for_each_sched_entity(se) |
| 171 | depth++; |
| 172 | |
| 173 | return depth; |
| 174 | } |
| 175 | |
| 176 | static void |
| 177 | find_matching_se(struct sched_entity **se, struct sched_entity **pse) |
| 178 | { |
| 179 | int se_depth, pse_depth; |
| 180 | |
| 181 | /* |
| 182 | * preemption test can be made between sibling entities who are in the |
| 183 | * same cfs_rq i.e who have a common parent. Walk up the hierarchy of |
| 184 | * both tasks until we find their ancestors who are siblings of common |
| 185 | * parent. |
| 186 | */ |
| 187 | |
| 188 | /* First walk up until both entities are at same depth */ |
| 189 | se_depth = depth_se(*se); |
| 190 | pse_depth = depth_se(*pse); |
| 191 | |
| 192 | while (se_depth > pse_depth) { |
| 193 | se_depth--; |
| 194 | *se = parent_entity(*se); |
| 195 | } |
| 196 | |
| 197 | while (pse_depth > se_depth) { |
| 198 | pse_depth--; |
| 199 | *pse = parent_entity(*pse); |
| 200 | } |
| 201 | |
| 202 | while (!is_same_group(*se, *pse)) { |
| 203 | *se = parent_entity(*se); |
| 204 | *pse = parent_entity(*pse); |
| 205 | } |
| 206 | } |
| 207 | |
Peter Zijlstra | 8f48894 | 2009-07-24 12:25:30 +0200 | [diff] [blame] | 208 | #else /* !CONFIG_FAIR_GROUP_SCHED */ |
| 209 | |
| 210 | static inline struct task_struct *task_of(struct sched_entity *se) |
| 211 | { |
| 212 | return container_of(se, struct task_struct, se); |
| 213 | } |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 214 | |
| 215 | static inline struct rq *rq_of(struct cfs_rq *cfs_rq) |
| 216 | { |
| 217 | return container_of(cfs_rq, struct rq, cfs); |
| 218 | } |
| 219 | |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 220 | #define entity_is_task(se) 1 |
| 221 | |
Peter Zijlstra | b758149 | 2008-04-19 19:45:00 +0200 | [diff] [blame] | 222 | #define for_each_sched_entity(se) \ |
| 223 | for (; se; se = NULL) |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 224 | |
Peter Zijlstra | b758149 | 2008-04-19 19:45:00 +0200 | [diff] [blame] | 225 | static inline struct cfs_rq *task_cfs_rq(struct task_struct *p) |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 226 | { |
Peter Zijlstra | b758149 | 2008-04-19 19:45:00 +0200 | [diff] [blame] | 227 | return &task_rq(p)->cfs; |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 228 | } |
| 229 | |
Peter Zijlstra | b758149 | 2008-04-19 19:45:00 +0200 | [diff] [blame] | 230 | static inline struct cfs_rq *cfs_rq_of(struct sched_entity *se) |
| 231 | { |
| 232 | struct task_struct *p = task_of(se); |
| 233 | struct rq *rq = task_rq(p); |
| 234 | |
| 235 | return &rq->cfs; |
| 236 | } |
| 237 | |
| 238 | /* runqueue "owned" by this group */ |
| 239 | static inline struct cfs_rq *group_cfs_rq(struct sched_entity *grp) |
| 240 | { |
| 241 | return NULL; |
| 242 | } |
| 243 | |
| 244 | static inline struct cfs_rq *cpu_cfs_rq(struct cfs_rq *cfs_rq, int this_cpu) |
| 245 | { |
| 246 | return &cpu_rq(this_cpu)->cfs; |
| 247 | } |
| 248 | |
| 249 | #define for_each_leaf_cfs_rq(rq, cfs_rq) \ |
| 250 | for (cfs_rq = &rq->cfs; cfs_rq; cfs_rq = NULL) |
| 251 | |
| 252 | static inline int |
| 253 | is_same_group(struct sched_entity *se, struct sched_entity *pse) |
| 254 | { |
| 255 | return 1; |
| 256 | } |
| 257 | |
| 258 | static inline struct sched_entity *parent_entity(struct sched_entity *se) |
| 259 | { |
| 260 | return NULL; |
| 261 | } |
| 262 | |
Peter Zijlstra | 464b752 | 2008-10-24 11:06:15 +0200 | [diff] [blame] | 263 | static inline void |
| 264 | find_matching_se(struct sched_entity **se, struct sched_entity **pse) |
| 265 | { |
| 266 | } |
| 267 | |
Peter Zijlstra | b758149 | 2008-04-19 19:45:00 +0200 | [diff] [blame] | 268 | #endif /* CONFIG_FAIR_GROUP_SCHED */ |
| 269 | |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 270 | |
| 271 | /************************************************************** |
| 272 | * Scheduling class tree data structure manipulation methods: |
| 273 | */ |
| 274 | |
Ingo Molnar | 0702e3e | 2007-10-15 17:00:14 +0200 | [diff] [blame] | 275 | static inline u64 max_vruntime(u64 min_vruntime, u64 vruntime) |
Peter Zijlstra | 02e0431 | 2007-10-15 17:00:07 +0200 | [diff] [blame] | 276 | { |
Peter Zijlstra | 368059a | 2007-10-15 17:00:11 +0200 | [diff] [blame] | 277 | s64 delta = (s64)(vruntime - min_vruntime); |
| 278 | if (delta > 0) |
Peter Zijlstra | 02e0431 | 2007-10-15 17:00:07 +0200 | [diff] [blame] | 279 | min_vruntime = vruntime; |
| 280 | |
| 281 | return min_vruntime; |
| 282 | } |
| 283 | |
Ingo Molnar | 0702e3e | 2007-10-15 17:00:14 +0200 | [diff] [blame] | 284 | static inline u64 min_vruntime(u64 min_vruntime, u64 vruntime) |
Peter Zijlstra | b0ffd24 | 2007-10-15 17:00:12 +0200 | [diff] [blame] | 285 | { |
| 286 | s64 delta = (s64)(vruntime - min_vruntime); |
| 287 | if (delta < 0) |
| 288 | min_vruntime = vruntime; |
| 289 | |
| 290 | return min_vruntime; |
| 291 | } |
| 292 | |
Fabio Checconi | 54fdc58 | 2009-07-16 12:32:27 +0200 | [diff] [blame] | 293 | static inline int entity_before(struct sched_entity *a, |
| 294 | struct sched_entity *b) |
| 295 | { |
| 296 | return (s64)(a->vruntime - b->vruntime) < 0; |
| 297 | } |
| 298 | |
Ingo Molnar | 0702e3e | 2007-10-15 17:00:14 +0200 | [diff] [blame] | 299 | static inline s64 entity_key(struct cfs_rq *cfs_rq, struct sched_entity *se) |
Peter Zijlstra | 9014623 | 2007-10-15 17:00:05 +0200 | [diff] [blame] | 300 | { |
Dmitry Adamushko | 30cfdcf | 2007-10-15 17:00:07 +0200 | [diff] [blame] | 301 | return se->vruntime - cfs_rq->min_vruntime; |
Peter Zijlstra | 9014623 | 2007-10-15 17:00:05 +0200 | [diff] [blame] | 302 | } |
| 303 | |
Peter Zijlstra | 1af5f73 | 2008-10-24 11:06:13 +0200 | [diff] [blame] | 304 | static void update_min_vruntime(struct cfs_rq *cfs_rq) |
| 305 | { |
| 306 | u64 vruntime = cfs_rq->min_vruntime; |
| 307 | |
| 308 | if (cfs_rq->curr) |
| 309 | vruntime = cfs_rq->curr->vruntime; |
| 310 | |
| 311 | if (cfs_rq->rb_leftmost) { |
| 312 | struct sched_entity *se = rb_entry(cfs_rq->rb_leftmost, |
| 313 | struct sched_entity, |
| 314 | run_node); |
| 315 | |
Peter Zijlstra | e17036d | 2009-01-15 14:53:39 +0100 | [diff] [blame] | 316 | if (!cfs_rq->curr) |
Peter Zijlstra | 1af5f73 | 2008-10-24 11:06:13 +0200 | [diff] [blame] | 317 | vruntime = se->vruntime; |
| 318 | else |
| 319 | vruntime = min_vruntime(vruntime, se->vruntime); |
| 320 | } |
| 321 | |
| 322 | cfs_rq->min_vruntime = max_vruntime(cfs_rq->min_vruntime, vruntime); |
| 323 | } |
| 324 | |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 325 | /* |
| 326 | * Enqueue an entity into the rb-tree: |
| 327 | */ |
Ingo Molnar | 0702e3e | 2007-10-15 17:00:14 +0200 | [diff] [blame] | 328 | static void __enqueue_entity(struct cfs_rq *cfs_rq, struct sched_entity *se) |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 329 | { |
| 330 | struct rb_node **link = &cfs_rq->tasks_timeline.rb_node; |
| 331 | struct rb_node *parent = NULL; |
| 332 | struct sched_entity *entry; |
Peter Zijlstra | 9014623 | 2007-10-15 17:00:05 +0200 | [diff] [blame] | 333 | s64 key = entity_key(cfs_rq, se); |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 334 | int leftmost = 1; |
| 335 | |
| 336 | /* |
| 337 | * Find the right place in the rbtree: |
| 338 | */ |
| 339 | while (*link) { |
| 340 | parent = *link; |
| 341 | entry = rb_entry(parent, struct sched_entity, run_node); |
| 342 | /* |
| 343 | * We dont care about collisions. Nodes with |
| 344 | * the same key stay together. |
| 345 | */ |
Peter Zijlstra | 9014623 | 2007-10-15 17:00:05 +0200 | [diff] [blame] | 346 | if (key < entity_key(cfs_rq, entry)) { |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 347 | link = &parent->rb_left; |
| 348 | } else { |
| 349 | link = &parent->rb_right; |
| 350 | leftmost = 0; |
| 351 | } |
| 352 | } |
| 353 | |
| 354 | /* |
| 355 | * Maintain a cache of leftmost tree entries (it is frequently |
| 356 | * used): |
| 357 | */ |
Peter Zijlstra | 1af5f73 | 2008-10-24 11:06:13 +0200 | [diff] [blame] | 358 | if (leftmost) |
Ingo Molnar | 57cb499 | 2007-10-15 17:00:11 +0200 | [diff] [blame] | 359 | cfs_rq->rb_leftmost = &se->run_node; |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 360 | |
| 361 | rb_link_node(&se->run_node, parent, link); |
| 362 | rb_insert_color(&se->run_node, &cfs_rq->tasks_timeline); |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 363 | } |
| 364 | |
Ingo Molnar | 0702e3e | 2007-10-15 17:00:14 +0200 | [diff] [blame] | 365 | static void __dequeue_entity(struct cfs_rq *cfs_rq, struct sched_entity *se) |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 366 | { |
Peter Zijlstra | 3fe6974 | 2008-03-14 20:55:51 +0100 | [diff] [blame] | 367 | if (cfs_rq->rb_leftmost == &se->run_node) { |
| 368 | struct rb_node *next_node; |
Peter Zijlstra | 3fe6974 | 2008-03-14 20:55:51 +0100 | [diff] [blame] | 369 | |
| 370 | next_node = rb_next(&se->run_node); |
| 371 | cfs_rq->rb_leftmost = next_node; |
Peter Zijlstra | 3fe6974 | 2008-03-14 20:55:51 +0100 | [diff] [blame] | 372 | } |
Ingo Molnar | e9acbff | 2007-10-15 17:00:04 +0200 | [diff] [blame] | 373 | |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 374 | rb_erase(&se->run_node, &cfs_rq->tasks_timeline); |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 375 | } |
| 376 | |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 377 | static struct sched_entity *__pick_next_entity(struct cfs_rq *cfs_rq) |
| 378 | { |
Peter Zijlstra | f4b6755 | 2008-11-04 21:25:07 +0100 | [diff] [blame] | 379 | struct rb_node *left = cfs_rq->rb_leftmost; |
| 380 | |
| 381 | if (!left) |
| 382 | return NULL; |
| 383 | |
| 384 | return rb_entry(left, struct sched_entity, run_node); |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 385 | } |
| 386 | |
Peter Zijlstra | f4b6755 | 2008-11-04 21:25:07 +0100 | [diff] [blame] | 387 | static struct sched_entity *__pick_last_entity(struct cfs_rq *cfs_rq) |
Peter Zijlstra | aeb73b0 | 2007-10-15 17:00:05 +0200 | [diff] [blame] | 388 | { |
Ingo Molnar | 7eee3e6 | 2008-02-22 10:32:21 +0100 | [diff] [blame] | 389 | struct rb_node *last = rb_last(&cfs_rq->tasks_timeline); |
Peter Zijlstra | aeb73b0 | 2007-10-15 17:00:05 +0200 | [diff] [blame] | 390 | |
Balbir Singh | 70eee74 | 2008-02-22 13:25:53 +0530 | [diff] [blame] | 391 | if (!last) |
| 392 | return NULL; |
Ingo Molnar | 7eee3e6 | 2008-02-22 10:32:21 +0100 | [diff] [blame] | 393 | |
| 394 | return rb_entry(last, struct sched_entity, run_node); |
Peter Zijlstra | aeb73b0 | 2007-10-15 17:00:05 +0200 | [diff] [blame] | 395 | } |
| 396 | |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 397 | /************************************************************** |
| 398 | * Scheduling class statistics methods: |
| 399 | */ |
| 400 | |
Peter Zijlstra | b2be5e9 | 2007-11-09 22:39:37 +0100 | [diff] [blame] | 401 | #ifdef CONFIG_SCHED_DEBUG |
Christian Ehrhardt | acb4a84 | 2009-11-30 12:16:48 +0100 | [diff] [blame] | 402 | int sched_proc_update_handler(struct ctl_table *table, int write, |
Alexey Dobriyan | 8d65af7 | 2009-09-23 15:57:19 -0700 | [diff] [blame] | 403 | void __user *buffer, size_t *lenp, |
Peter Zijlstra | b2be5e9 | 2007-11-09 22:39:37 +0100 | [diff] [blame] | 404 | loff_t *ppos) |
| 405 | { |
Alexey Dobriyan | 8d65af7 | 2009-09-23 15:57:19 -0700 | [diff] [blame] | 406 | int ret = proc_dointvec_minmax(table, write, buffer, lenp, ppos); |
Christian Ehrhardt | acb4a84 | 2009-11-30 12:16:48 +0100 | [diff] [blame] | 407 | int factor = get_update_sysctl_factor(); |
Peter Zijlstra | b2be5e9 | 2007-11-09 22:39:37 +0100 | [diff] [blame] | 408 | |
| 409 | if (ret || !write) |
| 410 | return ret; |
| 411 | |
| 412 | sched_nr_latency = DIV_ROUND_UP(sysctl_sched_latency, |
| 413 | sysctl_sched_min_granularity); |
| 414 | |
Christian Ehrhardt | acb4a84 | 2009-11-30 12:16:48 +0100 | [diff] [blame] | 415 | #define WRT_SYSCTL(name) \ |
| 416 | (normalized_sysctl_##name = sysctl_##name / (factor)) |
| 417 | WRT_SYSCTL(sched_min_granularity); |
| 418 | WRT_SYSCTL(sched_latency); |
| 419 | WRT_SYSCTL(sched_wakeup_granularity); |
| 420 | WRT_SYSCTL(sched_shares_ratelimit); |
| 421 | #undef WRT_SYSCTL |
| 422 | |
Peter Zijlstra | b2be5e9 | 2007-11-09 22:39:37 +0100 | [diff] [blame] | 423 | return 0; |
| 424 | } |
| 425 | #endif |
Ingo Molnar | 647e7ca | 2007-10-15 17:00:13 +0200 | [diff] [blame] | 426 | |
| 427 | /* |
Peter Zijlstra | f9c0b09 | 2008-10-17 19:27:04 +0200 | [diff] [blame] | 428 | * delta /= w |
Peter Zijlstra | a7be37a | 2008-06-27 13:41:11 +0200 | [diff] [blame] | 429 | */ |
| 430 | static inline unsigned long |
| 431 | calc_delta_fair(unsigned long delta, struct sched_entity *se) |
| 432 | { |
Peter Zijlstra | f9c0b09 | 2008-10-17 19:27:04 +0200 | [diff] [blame] | 433 | if (unlikely(se->load.weight != NICE_0_LOAD)) |
| 434 | delta = calc_delta_mine(delta, NICE_0_LOAD, &se->load); |
Peter Zijlstra | a7be37a | 2008-06-27 13:41:11 +0200 | [diff] [blame] | 435 | |
| 436 | return delta; |
| 437 | } |
| 438 | |
| 439 | /* |
Ingo Molnar | 647e7ca | 2007-10-15 17:00:13 +0200 | [diff] [blame] | 440 | * The idea is to set a period in which each task runs once. |
| 441 | * |
| 442 | * When there are too many tasks (sysctl_sched_nr_latency) we have to stretch |
| 443 | * this period because otherwise the slices get too small. |
| 444 | * |
| 445 | * p = (nr <= nl) ? l : l*nr/nl |
| 446 | */ |
Peter Zijlstra | 4d78e7b | 2007-10-15 17:00:04 +0200 | [diff] [blame] | 447 | static u64 __sched_period(unsigned long nr_running) |
| 448 | { |
| 449 | u64 period = sysctl_sched_latency; |
Peter Zijlstra | b2be5e9 | 2007-11-09 22:39:37 +0100 | [diff] [blame] | 450 | unsigned long nr_latency = sched_nr_latency; |
Peter Zijlstra | 4d78e7b | 2007-10-15 17:00:04 +0200 | [diff] [blame] | 451 | |
| 452 | if (unlikely(nr_running > nr_latency)) { |
Peter Zijlstra | 4bf0b77 | 2008-01-25 21:08:21 +0100 | [diff] [blame] | 453 | period = sysctl_sched_min_granularity; |
Peter Zijlstra | 4d78e7b | 2007-10-15 17:00:04 +0200 | [diff] [blame] | 454 | period *= nr_running; |
Peter Zijlstra | 4d78e7b | 2007-10-15 17:00:04 +0200 | [diff] [blame] | 455 | } |
| 456 | |
| 457 | return period; |
| 458 | } |
| 459 | |
Ingo Molnar | 647e7ca | 2007-10-15 17:00:13 +0200 | [diff] [blame] | 460 | /* |
| 461 | * We calculate the wall-time slice from the period by taking a part |
| 462 | * proportional to the weight. |
| 463 | * |
Peter Zijlstra | f9c0b09 | 2008-10-17 19:27:04 +0200 | [diff] [blame] | 464 | * s = p*P[w/rw] |
Ingo Molnar | 647e7ca | 2007-10-15 17:00:13 +0200 | [diff] [blame] | 465 | */ |
Peter Zijlstra | 6d0f0eb | 2007-10-15 17:00:05 +0200 | [diff] [blame] | 466 | static u64 sched_slice(struct cfs_rq *cfs_rq, struct sched_entity *se) |
Peter Zijlstra | 2180508 | 2007-08-25 18:41:53 +0200 | [diff] [blame] | 467 | { |
Mike Galbraith | 0a58244 | 2009-01-02 12:16:42 +0100 | [diff] [blame] | 468 | u64 slice = __sched_period(cfs_rq->nr_running + !se->on_rq); |
Peter Zijlstra | f9c0b09 | 2008-10-17 19:27:04 +0200 | [diff] [blame] | 469 | |
Mike Galbraith | 0a58244 | 2009-01-02 12:16:42 +0100 | [diff] [blame] | 470 | for_each_sched_entity(se) { |
Lin Ming | 6272d68 | 2009-01-15 17:17:15 +0100 | [diff] [blame] | 471 | struct load_weight *load; |
Christian Engelmayer | 3104bf0 | 2009-06-16 10:35:12 +0200 | [diff] [blame] | 472 | struct load_weight lw; |
Lin Ming | 6272d68 | 2009-01-15 17:17:15 +0100 | [diff] [blame] | 473 | |
| 474 | cfs_rq = cfs_rq_of(se); |
| 475 | load = &cfs_rq->load; |
Peter Zijlstra | f9c0b09 | 2008-10-17 19:27:04 +0200 | [diff] [blame] | 476 | |
Mike Galbraith | 0a58244 | 2009-01-02 12:16:42 +0100 | [diff] [blame] | 477 | if (unlikely(!se->on_rq)) { |
Christian Engelmayer | 3104bf0 | 2009-06-16 10:35:12 +0200 | [diff] [blame] | 478 | lw = cfs_rq->load; |
Mike Galbraith | 0a58244 | 2009-01-02 12:16:42 +0100 | [diff] [blame] | 479 | |
| 480 | update_load_add(&lw, se->load.weight); |
| 481 | load = &lw; |
| 482 | } |
| 483 | slice = calc_delta_mine(slice, se->load.weight, load); |
| 484 | } |
| 485 | return slice; |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 486 | } |
| 487 | |
Ingo Molnar | 647e7ca | 2007-10-15 17:00:13 +0200 | [diff] [blame] | 488 | /* |
Peter Zijlstra | ac884de | 2008-04-19 19:45:00 +0200 | [diff] [blame] | 489 | * We calculate the vruntime slice of a to be inserted task |
Ingo Molnar | 647e7ca | 2007-10-15 17:00:13 +0200 | [diff] [blame] | 490 | * |
Peter Zijlstra | f9c0b09 | 2008-10-17 19:27:04 +0200 | [diff] [blame] | 491 | * vs = s/w |
Ingo Molnar | 647e7ca | 2007-10-15 17:00:13 +0200 | [diff] [blame] | 492 | */ |
Peter Zijlstra | f9c0b09 | 2008-10-17 19:27:04 +0200 | [diff] [blame] | 493 | static u64 sched_vslice(struct cfs_rq *cfs_rq, struct sched_entity *se) |
Ingo Molnar | 647e7ca | 2007-10-15 17:00:13 +0200 | [diff] [blame] | 494 | { |
Peter Zijlstra | f9c0b09 | 2008-10-17 19:27:04 +0200 | [diff] [blame] | 495 | return calc_delta_fair(sched_slice(cfs_rq, se), se); |
Peter Zijlstra | a7be37a | 2008-06-27 13:41:11 +0200 | [diff] [blame] | 496 | } |
| 497 | |
| 498 | /* |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 499 | * Update the current task's runtime statistics. Skip current tasks that |
| 500 | * are not in our scheduling class. |
| 501 | */ |
| 502 | static inline void |
Ingo Molnar | 8ebc91d | 2007-10-15 17:00:03 +0200 | [diff] [blame] | 503 | __update_curr(struct cfs_rq *cfs_rq, struct sched_entity *curr, |
| 504 | unsigned long delta_exec) |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 505 | { |
Ingo Molnar | bbdba7c | 2007-10-15 17:00:06 +0200 | [diff] [blame] | 506 | unsigned long delta_exec_weighted; |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 507 | |
Ingo Molnar | 8179ca23 | 2007-08-02 17:41:40 +0200 | [diff] [blame] | 508 | schedstat_set(curr->exec_max, max((u64)delta_exec, curr->exec_max)); |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 509 | |
| 510 | curr->sum_exec_runtime += delta_exec; |
Ingo Molnar | 7a62eab | 2007-10-15 17:00:06 +0200 | [diff] [blame] | 511 | schedstat_add(cfs_rq, exec_clock, delta_exec); |
Peter Zijlstra | a7be37a | 2008-06-27 13:41:11 +0200 | [diff] [blame] | 512 | delta_exec_weighted = calc_delta_fair(delta_exec, curr); |
Ingo Molnar | e9acbff | 2007-10-15 17:00:04 +0200 | [diff] [blame] | 513 | curr->vruntime += delta_exec_weighted; |
Peter Zijlstra | 1af5f73 | 2008-10-24 11:06:13 +0200 | [diff] [blame] | 514 | update_min_vruntime(cfs_rq); |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 515 | } |
| 516 | |
Ingo Molnar | b7cc089 | 2007-08-09 11:16:47 +0200 | [diff] [blame] | 517 | static void update_curr(struct cfs_rq *cfs_rq) |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 518 | { |
Ingo Molnar | 429d43b | 2007-10-15 17:00:03 +0200 | [diff] [blame] | 519 | struct sched_entity *curr = cfs_rq->curr; |
Ingo Molnar | 8ebc91d | 2007-10-15 17:00:03 +0200 | [diff] [blame] | 520 | u64 now = rq_of(cfs_rq)->clock; |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 521 | unsigned long delta_exec; |
| 522 | |
| 523 | if (unlikely(!curr)) |
| 524 | return; |
| 525 | |
| 526 | /* |
| 527 | * Get the amount of time the current task was running |
| 528 | * since the last time we changed load (this cannot |
| 529 | * overflow on 32 bits): |
| 530 | */ |
Ingo Molnar | 8ebc91d | 2007-10-15 17:00:03 +0200 | [diff] [blame] | 531 | delta_exec = (unsigned long)(now - curr->exec_start); |
Peter Zijlstra | 34f28ec | 2008-12-16 08:45:31 +0100 | [diff] [blame] | 532 | if (!delta_exec) |
| 533 | return; |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 534 | |
Ingo Molnar | 8ebc91d | 2007-10-15 17:00:03 +0200 | [diff] [blame] | 535 | __update_curr(cfs_rq, curr, delta_exec); |
| 536 | curr->exec_start = now; |
Srivatsa Vaddagiri | d842de8 | 2007-12-02 20:04:49 +0100 | [diff] [blame] | 537 | |
| 538 | if (entity_is_task(curr)) { |
| 539 | struct task_struct *curtask = task_of(curr); |
| 540 | |
Ingo Molnar | f977bb4 | 2009-09-13 18:15:54 +0200 | [diff] [blame] | 541 | trace_sched_stat_runtime(curtask, delta_exec, curr->vruntime); |
Srivatsa Vaddagiri | d842de8 | 2007-12-02 20:04:49 +0100 | [diff] [blame] | 542 | cpuacct_charge(curtask, delta_exec); |
Frank Mayhar | f06febc | 2008-09-12 09:54:39 -0700 | [diff] [blame] | 543 | account_group_exec_runtime(curtask, delta_exec); |
Srivatsa Vaddagiri | d842de8 | 2007-12-02 20:04:49 +0100 | [diff] [blame] | 544 | } |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 545 | } |
| 546 | |
| 547 | static inline void |
Ingo Molnar | 5870db5 | 2007-08-09 11:16:47 +0200 | [diff] [blame] | 548 | update_stats_wait_start(struct cfs_rq *cfs_rq, struct sched_entity *se) |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 549 | { |
Ingo Molnar | d281918 | 2007-08-09 11:16:47 +0200 | [diff] [blame] | 550 | schedstat_set(se->wait_start, rq_of(cfs_rq)->clock); |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 551 | } |
| 552 | |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 553 | /* |
| 554 | * Task is being enqueued - update stats: |
| 555 | */ |
Ingo Molnar | d2417e5 | 2007-08-09 11:16:47 +0200 | [diff] [blame] | 556 | static void update_stats_enqueue(struct cfs_rq *cfs_rq, struct sched_entity *se) |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 557 | { |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 558 | /* |
| 559 | * Are we enqueueing a waiting task? (for current tasks |
| 560 | * a dequeue/enqueue event is a NOP) |
| 561 | */ |
Ingo Molnar | 429d43b | 2007-10-15 17:00:03 +0200 | [diff] [blame] | 562 | if (se != cfs_rq->curr) |
Ingo Molnar | 5870db5 | 2007-08-09 11:16:47 +0200 | [diff] [blame] | 563 | update_stats_wait_start(cfs_rq, se); |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 564 | } |
| 565 | |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 566 | static void |
Ingo Molnar | 9ef0a96 | 2007-08-09 11:16:47 +0200 | [diff] [blame] | 567 | update_stats_wait_end(struct cfs_rq *cfs_rq, struct sched_entity *se) |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 568 | { |
Ingo Molnar | bbdba7c | 2007-10-15 17:00:06 +0200 | [diff] [blame] | 569 | schedstat_set(se->wait_max, max(se->wait_max, |
| 570 | rq_of(cfs_rq)->clock - se->wait_start)); |
Arjan van de Ven | 6d08259 | 2008-01-25 21:08:35 +0100 | [diff] [blame] | 571 | schedstat_set(se->wait_count, se->wait_count + 1); |
| 572 | schedstat_set(se->wait_sum, se->wait_sum + |
| 573 | rq_of(cfs_rq)->clock - se->wait_start); |
Peter Zijlstra | 768d0c2 | 2009-07-23 20:13:26 +0200 | [diff] [blame] | 574 | #ifdef CONFIG_SCHEDSTATS |
| 575 | if (entity_is_task(se)) { |
| 576 | trace_sched_stat_wait(task_of(se), |
| 577 | rq_of(cfs_rq)->clock - se->wait_start); |
| 578 | } |
| 579 | #endif |
Ingo Molnar | e1f8450 | 2009-09-10 20:52:09 +0200 | [diff] [blame] | 580 | schedstat_set(se->wait_start, 0); |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 581 | } |
| 582 | |
| 583 | static inline void |
Ingo Molnar | 19b6a2e | 2007-08-09 11:16:48 +0200 | [diff] [blame] | 584 | update_stats_dequeue(struct cfs_rq *cfs_rq, struct sched_entity *se) |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 585 | { |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 586 | /* |
| 587 | * Mark the end of the wait period if dequeueing a |
| 588 | * waiting task: |
| 589 | */ |
Ingo Molnar | 429d43b | 2007-10-15 17:00:03 +0200 | [diff] [blame] | 590 | if (se != cfs_rq->curr) |
Ingo Molnar | 9ef0a96 | 2007-08-09 11:16:47 +0200 | [diff] [blame] | 591 | update_stats_wait_end(cfs_rq, se); |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 592 | } |
| 593 | |
| 594 | /* |
| 595 | * We are picking a new current task - update its stats: |
| 596 | */ |
| 597 | static inline void |
Ingo Molnar | 79303e9 | 2007-08-09 11:16:47 +0200 | [diff] [blame] | 598 | update_stats_curr_start(struct cfs_rq *cfs_rq, struct sched_entity *se) |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 599 | { |
| 600 | /* |
| 601 | * We are starting a new run period: |
| 602 | */ |
Ingo Molnar | d281918 | 2007-08-09 11:16:47 +0200 | [diff] [blame] | 603 | se->exec_start = rq_of(cfs_rq)->clock; |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 604 | } |
| 605 | |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 606 | /************************************************** |
| 607 | * Scheduling class queueing methods: |
| 608 | */ |
| 609 | |
Peter Zijlstra | c09595f | 2008-06-27 13:41:14 +0200 | [diff] [blame] | 610 | #if defined CONFIG_SMP && defined CONFIG_FAIR_GROUP_SCHED |
| 611 | static void |
| 612 | add_cfs_task_weight(struct cfs_rq *cfs_rq, unsigned long weight) |
| 613 | { |
| 614 | cfs_rq->task_weight += weight; |
| 615 | } |
| 616 | #else |
| 617 | static inline void |
| 618 | add_cfs_task_weight(struct cfs_rq *cfs_rq, unsigned long weight) |
| 619 | { |
| 620 | } |
| 621 | #endif |
| 622 | |
Dmitry Adamushko | 30cfdcf | 2007-10-15 17:00:07 +0200 | [diff] [blame] | 623 | static void |
| 624 | account_entity_enqueue(struct cfs_rq *cfs_rq, struct sched_entity *se) |
| 625 | { |
| 626 | update_load_add(&cfs_rq->load, se->load.weight); |
Peter Zijlstra | c09595f | 2008-06-27 13:41:14 +0200 | [diff] [blame] | 627 | if (!parent_entity(se)) |
| 628 | inc_cpu_load(rq_of(cfs_rq), se->load.weight); |
Bharata B Rao | b87f172 | 2008-09-25 09:53:54 +0530 | [diff] [blame] | 629 | if (entity_is_task(se)) { |
Peter Zijlstra | c09595f | 2008-06-27 13:41:14 +0200 | [diff] [blame] | 630 | add_cfs_task_weight(cfs_rq, se->load.weight); |
Bharata B Rao | b87f172 | 2008-09-25 09:53:54 +0530 | [diff] [blame] | 631 | list_add(&se->group_node, &cfs_rq->tasks); |
| 632 | } |
Dmitry Adamushko | 30cfdcf | 2007-10-15 17:00:07 +0200 | [diff] [blame] | 633 | cfs_rq->nr_running++; |
| 634 | se->on_rq = 1; |
| 635 | } |
| 636 | |
| 637 | static void |
| 638 | account_entity_dequeue(struct cfs_rq *cfs_rq, struct sched_entity *se) |
| 639 | { |
| 640 | update_load_sub(&cfs_rq->load, se->load.weight); |
Peter Zijlstra | c09595f | 2008-06-27 13:41:14 +0200 | [diff] [blame] | 641 | if (!parent_entity(se)) |
| 642 | dec_cpu_load(rq_of(cfs_rq), se->load.weight); |
Bharata B Rao | b87f172 | 2008-09-25 09:53:54 +0530 | [diff] [blame] | 643 | if (entity_is_task(se)) { |
Peter Zijlstra | c09595f | 2008-06-27 13:41:14 +0200 | [diff] [blame] | 644 | add_cfs_task_weight(cfs_rq, -se->load.weight); |
Bharata B Rao | b87f172 | 2008-09-25 09:53:54 +0530 | [diff] [blame] | 645 | list_del_init(&se->group_node); |
| 646 | } |
Dmitry Adamushko | 30cfdcf | 2007-10-15 17:00:07 +0200 | [diff] [blame] | 647 | cfs_rq->nr_running--; |
| 648 | se->on_rq = 0; |
| 649 | } |
| 650 | |
Ingo Molnar | 2396af6 | 2007-08-09 11:16:48 +0200 | [diff] [blame] | 651 | static void enqueue_sleeper(struct cfs_rq *cfs_rq, struct sched_entity *se) |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 652 | { |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 653 | #ifdef CONFIG_SCHEDSTATS |
Peter Zijlstra | e414314 | 2009-07-23 20:13:26 +0200 | [diff] [blame] | 654 | struct task_struct *tsk = NULL; |
| 655 | |
| 656 | if (entity_is_task(se)) |
| 657 | tsk = task_of(se); |
| 658 | |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 659 | if (se->sleep_start) { |
Ingo Molnar | d281918 | 2007-08-09 11:16:47 +0200 | [diff] [blame] | 660 | u64 delta = rq_of(cfs_rq)->clock - se->sleep_start; |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 661 | |
| 662 | if ((s64)delta < 0) |
| 663 | delta = 0; |
| 664 | |
| 665 | if (unlikely(delta > se->sleep_max)) |
| 666 | se->sleep_max = delta; |
| 667 | |
| 668 | se->sleep_start = 0; |
| 669 | se->sum_sleep_runtime += delta; |
Arjan van de Ven | 9745512 | 2008-01-25 21:08:34 +0100 | [diff] [blame] | 670 | |
Peter Zijlstra | 768d0c2 | 2009-07-23 20:13:26 +0200 | [diff] [blame] | 671 | if (tsk) { |
Peter Zijlstra | e414314 | 2009-07-23 20:13:26 +0200 | [diff] [blame] | 672 | account_scheduler_latency(tsk, delta >> 10, 1); |
Peter Zijlstra | 768d0c2 | 2009-07-23 20:13:26 +0200 | [diff] [blame] | 673 | trace_sched_stat_sleep(tsk, delta); |
| 674 | } |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 675 | } |
| 676 | if (se->block_start) { |
Ingo Molnar | d281918 | 2007-08-09 11:16:47 +0200 | [diff] [blame] | 677 | u64 delta = rq_of(cfs_rq)->clock - se->block_start; |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 678 | |
| 679 | if ((s64)delta < 0) |
| 680 | delta = 0; |
| 681 | |
| 682 | if (unlikely(delta > se->block_max)) |
| 683 | se->block_max = delta; |
| 684 | |
| 685 | se->block_start = 0; |
| 686 | se->sum_sleep_runtime += delta; |
Ingo Molnar | 30084fb | 2007-10-02 14:13:08 +0200 | [diff] [blame] | 687 | |
Peter Zijlstra | e414314 | 2009-07-23 20:13:26 +0200 | [diff] [blame] | 688 | if (tsk) { |
Arjan van de Ven | 8f0dfc3 | 2009-07-20 11:26:58 -0700 | [diff] [blame] | 689 | if (tsk->in_iowait) { |
| 690 | se->iowait_sum += delta; |
| 691 | se->iowait_count++; |
Peter Zijlstra | 768d0c2 | 2009-07-23 20:13:26 +0200 | [diff] [blame] | 692 | trace_sched_stat_iowait(tsk, delta); |
Arjan van de Ven | 8f0dfc3 | 2009-07-20 11:26:58 -0700 | [diff] [blame] | 693 | } |
| 694 | |
Peter Zijlstra | e414314 | 2009-07-23 20:13:26 +0200 | [diff] [blame] | 695 | /* |
| 696 | * Blocking time is in units of nanosecs, so shift by |
| 697 | * 20 to get a milliseconds-range estimation of the |
| 698 | * amount of time that the task spent sleeping: |
| 699 | */ |
| 700 | if (unlikely(prof_on == SLEEP_PROFILING)) { |
| 701 | profile_hits(SLEEP_PROFILING, |
| 702 | (void *)get_wchan(tsk), |
| 703 | delta >> 20); |
| 704 | } |
| 705 | account_scheduler_latency(tsk, delta >> 10, 0); |
Ingo Molnar | 30084fb | 2007-10-02 14:13:08 +0200 | [diff] [blame] | 706 | } |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 707 | } |
| 708 | #endif |
| 709 | } |
| 710 | |
Peter Zijlstra | ddc9729 | 2007-10-15 17:00:10 +0200 | [diff] [blame] | 711 | static void check_spread(struct cfs_rq *cfs_rq, struct sched_entity *se) |
| 712 | { |
| 713 | #ifdef CONFIG_SCHED_DEBUG |
| 714 | s64 d = se->vruntime - cfs_rq->min_vruntime; |
| 715 | |
| 716 | if (d < 0) |
| 717 | d = -d; |
| 718 | |
| 719 | if (d > 3*sysctl_sched_latency) |
| 720 | schedstat_inc(cfs_rq, nr_spread_over); |
| 721 | #endif |
| 722 | } |
| 723 | |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 724 | static void |
Peter Zijlstra | aeb73b0 | 2007-10-15 17:00:05 +0200 | [diff] [blame] | 725 | place_entity(struct cfs_rq *cfs_rq, struct sched_entity *se, int initial) |
| 726 | { |
Peter Zijlstra | 1af5f73 | 2008-10-24 11:06:13 +0200 | [diff] [blame] | 727 | u64 vruntime = cfs_rq->min_vruntime; |
Peter Zijlstra | 94dfb5e | 2007-10-15 17:00:05 +0200 | [diff] [blame] | 728 | |
Peter Zijlstra | 2cb8600 | 2007-11-09 22:39:37 +0100 | [diff] [blame] | 729 | /* |
| 730 | * The 'current' period is already promised to the current tasks, |
| 731 | * however the extra weight of the new task will slow them down a |
| 732 | * little, place the new task so that it fits in the slot that |
| 733 | * stays open at the end. |
| 734 | */ |
Peter Zijlstra | 94dfb5e | 2007-10-15 17:00:05 +0200 | [diff] [blame] | 735 | if (initial && sched_feat(START_DEBIT)) |
Peter Zijlstra | f9c0b09 | 2008-10-17 19:27:04 +0200 | [diff] [blame] | 736 | vruntime += sched_vslice(cfs_rq, se); |
Peter Zijlstra | aeb73b0 | 2007-10-15 17:00:05 +0200 | [diff] [blame] | 737 | |
Mike Galbraith | a2e7a7e | 2009-09-18 09:19:25 +0200 | [diff] [blame] | 738 | /* sleeps up to a single latency don't count. */ |
| 739 | if (!initial && sched_feat(FAIR_SLEEPERS)) { |
| 740 | unsigned long thresh = sysctl_sched_latency; |
Peter Zijlstra | a7be37a | 2008-06-27 13:41:11 +0200 | [diff] [blame] | 741 | |
Mike Galbraith | a2e7a7e | 2009-09-18 09:19:25 +0200 | [diff] [blame] | 742 | /* |
| 743 | * Convert the sleeper threshold into virtual time. |
| 744 | * SCHED_IDLE is a special sub-class. We care about |
| 745 | * fairness only relative to other SCHED_IDLE tasks, |
| 746 | * all of which have the same weight. |
| 747 | */ |
| 748 | if (sched_feat(NORMALIZED_SLEEPER) && (!entity_is_task(se) || |
| 749 | task_of(se)->policy != SCHED_IDLE)) |
| 750 | thresh = calc_delta_fair(thresh, se); |
Peter Zijlstra | a7be37a | 2008-06-27 13:41:11 +0200 | [diff] [blame] | 751 | |
Mike Galbraith | a2e7a7e | 2009-09-18 09:19:25 +0200 | [diff] [blame] | 752 | /* |
| 753 | * Halve their sleep time's effect, to allow |
| 754 | * for a gentler effect of sleepers: |
| 755 | */ |
| 756 | if (sched_feat(GENTLE_FAIR_SLEEPERS)) |
| 757 | thresh >>= 1; |
Ingo Molnar | 51e0304 | 2009-09-16 08:54:45 +0200 | [diff] [blame] | 758 | |
Mike Galbraith | a2e7a7e | 2009-09-18 09:19:25 +0200 | [diff] [blame] | 759 | vruntime -= thresh; |
Peter Zijlstra | aeb73b0 | 2007-10-15 17:00:05 +0200 | [diff] [blame] | 760 | } |
| 761 | |
Mike Galbraith | b5d9d73 | 2009-09-08 11:12:28 +0200 | [diff] [blame] | 762 | /* ensure we never gain time by being placed backwards. */ |
| 763 | vruntime = max_vruntime(se->vruntime, vruntime); |
| 764 | |
Peter Zijlstra | 67e9fb2 | 2007-10-15 17:00:10 +0200 | [diff] [blame] | 765 | se->vruntime = vruntime; |
Peter Zijlstra | aeb73b0 | 2007-10-15 17:00:05 +0200 | [diff] [blame] | 766 | } |
| 767 | |
| 768 | static void |
Srivatsa Vaddagiri | 83b699e | 2007-10-15 17:00:08 +0200 | [diff] [blame] | 769 | enqueue_entity(struct cfs_rq *cfs_rq, struct sched_entity *se, int wakeup) |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 770 | { |
| 771 | /* |
Dmitry Adamushko | a2a2d68 | 2007-10-15 17:00:13 +0200 | [diff] [blame] | 772 | * Update run-time statistics of the 'current'. |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 773 | */ |
Ingo Molnar | b7cc089 | 2007-08-09 11:16:47 +0200 | [diff] [blame] | 774 | update_curr(cfs_rq); |
Peter Zijlstra | a992241 | 2008-05-05 23:56:17 +0200 | [diff] [blame] | 775 | account_entity_enqueue(cfs_rq, se); |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 776 | |
Ingo Molnar | e9acbff | 2007-10-15 17:00:04 +0200 | [diff] [blame] | 777 | if (wakeup) { |
Peter Zijlstra | aeb73b0 | 2007-10-15 17:00:05 +0200 | [diff] [blame] | 778 | place_entity(cfs_rq, se, 0); |
Ingo Molnar | 2396af6 | 2007-08-09 11:16:48 +0200 | [diff] [blame] | 779 | enqueue_sleeper(cfs_rq, se); |
Ingo Molnar | e9acbff | 2007-10-15 17:00:04 +0200 | [diff] [blame] | 780 | } |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 781 | |
Ingo Molnar | d2417e5 | 2007-08-09 11:16:47 +0200 | [diff] [blame] | 782 | update_stats_enqueue(cfs_rq, se); |
Peter Zijlstra | ddc9729 | 2007-10-15 17:00:10 +0200 | [diff] [blame] | 783 | check_spread(cfs_rq, se); |
Srivatsa Vaddagiri | 83b699e | 2007-10-15 17:00:08 +0200 | [diff] [blame] | 784 | if (se != cfs_rq->curr) |
| 785 | __enqueue_entity(cfs_rq, se); |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 786 | } |
| 787 | |
Peter Zijlstra | a571bbe | 2009-01-28 14:51:40 +0100 | [diff] [blame] | 788 | static void __clear_buddies(struct cfs_rq *cfs_rq, struct sched_entity *se) |
Peter Zijlstra | 2002c69 | 2008-11-11 11:52:33 +0100 | [diff] [blame] | 789 | { |
Peter Zijlstra | de69a80 | 2009-09-17 09:01:20 +0200 | [diff] [blame] | 790 | if (!se || cfs_rq->last == se) |
Peter Zijlstra | 2002c69 | 2008-11-11 11:52:33 +0100 | [diff] [blame] | 791 | cfs_rq->last = NULL; |
| 792 | |
Peter Zijlstra | de69a80 | 2009-09-17 09:01:20 +0200 | [diff] [blame] | 793 | if (!se || cfs_rq->next == se) |
Peter Zijlstra | 2002c69 | 2008-11-11 11:52:33 +0100 | [diff] [blame] | 794 | cfs_rq->next = NULL; |
| 795 | } |
| 796 | |
Peter Zijlstra | a571bbe | 2009-01-28 14:51:40 +0100 | [diff] [blame] | 797 | static void clear_buddies(struct cfs_rq *cfs_rq, struct sched_entity *se) |
| 798 | { |
| 799 | for_each_sched_entity(se) |
| 800 | __clear_buddies(cfs_rq_of(se), se); |
| 801 | } |
| 802 | |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 803 | static void |
Ingo Molnar | 525c271 | 2007-08-09 11:16:48 +0200 | [diff] [blame] | 804 | dequeue_entity(struct cfs_rq *cfs_rq, struct sched_entity *se, int sleep) |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 805 | { |
Dmitry Adamushko | a2a2d68 | 2007-10-15 17:00:13 +0200 | [diff] [blame] | 806 | /* |
| 807 | * Update run-time statistics of the 'current'. |
| 808 | */ |
| 809 | update_curr(cfs_rq); |
| 810 | |
Ingo Molnar | 19b6a2e | 2007-08-09 11:16:48 +0200 | [diff] [blame] | 811 | update_stats_dequeue(cfs_rq, se); |
Dmitry Adamushko | db36cc7 | 2007-10-15 17:00:06 +0200 | [diff] [blame] | 812 | if (sleep) { |
Peter Zijlstra | 67e9fb2 | 2007-10-15 17:00:10 +0200 | [diff] [blame] | 813 | #ifdef CONFIG_SCHEDSTATS |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 814 | if (entity_is_task(se)) { |
| 815 | struct task_struct *tsk = task_of(se); |
| 816 | |
| 817 | if (tsk->state & TASK_INTERRUPTIBLE) |
Ingo Molnar | d281918 | 2007-08-09 11:16:47 +0200 | [diff] [blame] | 818 | se->sleep_start = rq_of(cfs_rq)->clock; |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 819 | if (tsk->state & TASK_UNINTERRUPTIBLE) |
Ingo Molnar | d281918 | 2007-08-09 11:16:47 +0200 | [diff] [blame] | 820 | se->block_start = rq_of(cfs_rq)->clock; |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 821 | } |
Dmitry Adamushko | db36cc7 | 2007-10-15 17:00:06 +0200 | [diff] [blame] | 822 | #endif |
Peter Zijlstra | 67e9fb2 | 2007-10-15 17:00:10 +0200 | [diff] [blame] | 823 | } |
| 824 | |
Peter Zijlstra | 2002c69 | 2008-11-11 11:52:33 +0100 | [diff] [blame] | 825 | clear_buddies(cfs_rq, se); |
Peter Zijlstra | 4793241 | 2008-11-04 21:25:09 +0100 | [diff] [blame] | 826 | |
Srivatsa Vaddagiri | 83b699e | 2007-10-15 17:00:08 +0200 | [diff] [blame] | 827 | if (se != cfs_rq->curr) |
Dmitry Adamushko | 30cfdcf | 2007-10-15 17:00:07 +0200 | [diff] [blame] | 828 | __dequeue_entity(cfs_rq, se); |
| 829 | account_entity_dequeue(cfs_rq, se); |
Peter Zijlstra | 1af5f73 | 2008-10-24 11:06:13 +0200 | [diff] [blame] | 830 | update_min_vruntime(cfs_rq); |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 831 | } |
| 832 | |
| 833 | /* |
| 834 | * Preempt the current task with a newly woken task if needed: |
| 835 | */ |
Peter Zijlstra | 7c92e54 | 2007-09-05 14:32:49 +0200 | [diff] [blame] | 836 | static void |
Ingo Molnar | 2e09bf5 | 2007-10-15 17:00:05 +0200 | [diff] [blame] | 837 | check_preempt_tick(struct cfs_rq *cfs_rq, struct sched_entity *curr) |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 838 | { |
Peter Zijlstra | 1169783 | 2007-09-05 14:32:49 +0200 | [diff] [blame] | 839 | unsigned long ideal_runtime, delta_exec; |
| 840 | |
Peter Zijlstra | 6d0f0eb | 2007-10-15 17:00:05 +0200 | [diff] [blame] | 841 | ideal_runtime = sched_slice(cfs_rq, curr); |
Peter Zijlstra | 1169783 | 2007-09-05 14:32:49 +0200 | [diff] [blame] | 842 | delta_exec = curr->sum_exec_runtime - curr->prev_sum_exec_runtime; |
Mike Galbraith | a9f3e2b | 2009-01-28 14:51:39 +0100 | [diff] [blame] | 843 | if (delta_exec > ideal_runtime) { |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 844 | resched_task(rq_of(cfs_rq)->curr); |
Mike Galbraith | a9f3e2b | 2009-01-28 14:51:39 +0100 | [diff] [blame] | 845 | /* |
| 846 | * The current task ran long enough, ensure it doesn't get |
| 847 | * re-elected due to buddy favours. |
| 848 | */ |
| 849 | clear_buddies(cfs_rq, curr); |
Mike Galbraith | f685cea | 2009-10-23 23:09:22 +0200 | [diff] [blame] | 850 | return; |
| 851 | } |
| 852 | |
| 853 | /* |
| 854 | * Ensure that a task that missed wakeup preemption by a |
| 855 | * narrow margin doesn't have to wait for a full slice. |
| 856 | * This also mitigates buddy induced latencies under load. |
| 857 | */ |
| 858 | if (!sched_feat(WAKEUP_PREEMPT)) |
| 859 | return; |
| 860 | |
| 861 | if (delta_exec < sysctl_sched_min_granularity) |
| 862 | return; |
| 863 | |
| 864 | if (cfs_rq->nr_running > 1) { |
| 865 | struct sched_entity *se = __pick_next_entity(cfs_rq); |
| 866 | s64 delta = curr->vruntime - se->vruntime; |
| 867 | |
| 868 | if (delta > ideal_runtime) |
| 869 | resched_task(rq_of(cfs_rq)->curr); |
Mike Galbraith | a9f3e2b | 2009-01-28 14:51:39 +0100 | [diff] [blame] | 870 | } |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 871 | } |
| 872 | |
Srivatsa Vaddagiri | 83b699e | 2007-10-15 17:00:08 +0200 | [diff] [blame] | 873 | static void |
Ingo Molnar | 8494f41 | 2007-08-09 11:16:48 +0200 | [diff] [blame] | 874 | set_next_entity(struct cfs_rq *cfs_rq, struct sched_entity *se) |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 875 | { |
Srivatsa Vaddagiri | 83b699e | 2007-10-15 17:00:08 +0200 | [diff] [blame] | 876 | /* 'current' is not kept within the tree. */ |
| 877 | if (se->on_rq) { |
| 878 | /* |
| 879 | * Any task has to be enqueued before it get to execute on |
| 880 | * a CPU. So account for the time it spent waiting on the |
| 881 | * runqueue. |
| 882 | */ |
| 883 | update_stats_wait_end(cfs_rq, se); |
| 884 | __dequeue_entity(cfs_rq, se); |
| 885 | } |
| 886 | |
Ingo Molnar | 79303e9 | 2007-08-09 11:16:47 +0200 | [diff] [blame] | 887 | update_stats_curr_start(cfs_rq, se); |
Ingo Molnar | 429d43b | 2007-10-15 17:00:03 +0200 | [diff] [blame] | 888 | cfs_rq->curr = se; |
Ingo Molnar | eba1ed4 | 2007-10-15 17:00:02 +0200 | [diff] [blame] | 889 | #ifdef CONFIG_SCHEDSTATS |
| 890 | /* |
| 891 | * Track our maximum slice length, if the CPU's load is at |
| 892 | * least twice that of our own weight (i.e. dont track it |
| 893 | * when there are only lesser-weight tasks around): |
| 894 | */ |
Dmitry Adamushko | 495eca4 | 2007-10-15 17:00:06 +0200 | [diff] [blame] | 895 | if (rq_of(cfs_rq)->load.weight >= 2*se->load.weight) { |
Ingo Molnar | eba1ed4 | 2007-10-15 17:00:02 +0200 | [diff] [blame] | 896 | se->slice_max = max(se->slice_max, |
| 897 | se->sum_exec_runtime - se->prev_sum_exec_runtime); |
| 898 | } |
| 899 | #endif |
Peter Zijlstra | 4a55b45 | 2007-09-05 14:32:49 +0200 | [diff] [blame] | 900 | se->prev_sum_exec_runtime = se->sum_exec_runtime; |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 901 | } |
| 902 | |
Peter Zijlstra | 3f3a490 | 2008-10-24 11:06:16 +0200 | [diff] [blame] | 903 | static int |
| 904 | wakeup_preempt_entity(struct sched_entity *curr, struct sched_entity *se); |
| 905 | |
Peter Zijlstra | f4b6755 | 2008-11-04 21:25:07 +0100 | [diff] [blame] | 906 | static struct sched_entity *pick_next_entity(struct cfs_rq *cfs_rq) |
Peter Zijlstra | aa2ac25 | 2008-03-14 21:12:12 +0100 | [diff] [blame] | 907 | { |
Peter Zijlstra | f4b6755 | 2008-11-04 21:25:07 +0100 | [diff] [blame] | 908 | struct sched_entity *se = __pick_next_entity(cfs_rq); |
Mike Galbraith | f685cea | 2009-10-23 23:09:22 +0200 | [diff] [blame] | 909 | struct sched_entity *left = se; |
Peter Zijlstra | f4b6755 | 2008-11-04 21:25:07 +0100 | [diff] [blame] | 910 | |
Mike Galbraith | f685cea | 2009-10-23 23:09:22 +0200 | [diff] [blame] | 911 | if (cfs_rq->next && wakeup_preempt_entity(cfs_rq->next, left) < 1) |
| 912 | se = cfs_rq->next; |
Peter Zijlstra | aa2ac25 | 2008-03-14 21:12:12 +0100 | [diff] [blame] | 913 | |
Mike Galbraith | f685cea | 2009-10-23 23:09:22 +0200 | [diff] [blame] | 914 | /* |
| 915 | * Prefer last buddy, try to return the CPU to a preempted task. |
| 916 | */ |
| 917 | if (cfs_rq->last && wakeup_preempt_entity(cfs_rq->last, left) < 1) |
| 918 | se = cfs_rq->last; |
| 919 | |
| 920 | clear_buddies(cfs_rq, se); |
Peter Zijlstra | 4793241 | 2008-11-04 21:25:09 +0100 | [diff] [blame] | 921 | |
| 922 | return se; |
Peter Zijlstra | aa2ac25 | 2008-03-14 21:12:12 +0100 | [diff] [blame] | 923 | } |
| 924 | |
Ingo Molnar | ab6cde2 | 2007-08-09 11:16:48 +0200 | [diff] [blame] | 925 | static void put_prev_entity(struct cfs_rq *cfs_rq, struct sched_entity *prev) |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 926 | { |
| 927 | /* |
| 928 | * If still on the runqueue then deactivate_task() |
| 929 | * was not called and update_curr() has to be done: |
| 930 | */ |
| 931 | if (prev->on_rq) |
Ingo Molnar | b7cc089 | 2007-08-09 11:16:47 +0200 | [diff] [blame] | 932 | update_curr(cfs_rq); |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 933 | |
Peter Zijlstra | ddc9729 | 2007-10-15 17:00:10 +0200 | [diff] [blame] | 934 | check_spread(cfs_rq, prev); |
Dmitry Adamushko | 30cfdcf | 2007-10-15 17:00:07 +0200 | [diff] [blame] | 935 | if (prev->on_rq) { |
Ingo Molnar | 5870db5 | 2007-08-09 11:16:47 +0200 | [diff] [blame] | 936 | update_stats_wait_start(cfs_rq, prev); |
Dmitry Adamushko | 30cfdcf | 2007-10-15 17:00:07 +0200 | [diff] [blame] | 937 | /* Put 'current' back into the tree. */ |
| 938 | __enqueue_entity(cfs_rq, prev); |
| 939 | } |
Ingo Molnar | 429d43b | 2007-10-15 17:00:03 +0200 | [diff] [blame] | 940 | cfs_rq->curr = NULL; |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 941 | } |
| 942 | |
Peter Zijlstra | 8f4d37e | 2008-01-25 21:08:29 +0100 | [diff] [blame] | 943 | static void |
| 944 | entity_tick(struct cfs_rq *cfs_rq, struct sched_entity *curr, int queued) |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 945 | { |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 946 | /* |
Dmitry Adamushko | 30cfdcf | 2007-10-15 17:00:07 +0200 | [diff] [blame] | 947 | * Update run-time statistics of the 'current'. |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 948 | */ |
Dmitry Adamushko | 30cfdcf | 2007-10-15 17:00:07 +0200 | [diff] [blame] | 949 | update_curr(cfs_rq); |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 950 | |
Peter Zijlstra | 8f4d37e | 2008-01-25 21:08:29 +0100 | [diff] [blame] | 951 | #ifdef CONFIG_SCHED_HRTICK |
| 952 | /* |
| 953 | * queued ticks are scheduled to match the slice, so don't bother |
| 954 | * validating it and just reschedule. |
| 955 | */ |
Harvey Harrison | 983ed7a | 2008-04-24 18:17:55 -0700 | [diff] [blame] | 956 | if (queued) { |
| 957 | resched_task(rq_of(cfs_rq)->curr); |
| 958 | return; |
| 959 | } |
Peter Zijlstra | 8f4d37e | 2008-01-25 21:08:29 +0100 | [diff] [blame] | 960 | /* |
| 961 | * don't let the period tick interfere with the hrtick preemption |
| 962 | */ |
| 963 | if (!sched_feat(DOUBLE_TICK) && |
| 964 | hrtimer_active(&rq_of(cfs_rq)->hrtick_timer)) |
| 965 | return; |
| 966 | #endif |
| 967 | |
Peter Zijlstra | ce6c131 | 2007-10-15 17:00:14 +0200 | [diff] [blame] | 968 | if (cfs_rq->nr_running > 1 || !sched_feat(WAKEUP_PREEMPT)) |
Ingo Molnar | 2e09bf5 | 2007-10-15 17:00:05 +0200 | [diff] [blame] | 969 | check_preempt_tick(cfs_rq, curr); |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 970 | } |
| 971 | |
| 972 | /************************************************** |
| 973 | * CFS operations on tasks: |
| 974 | */ |
| 975 | |
Peter Zijlstra | 8f4d37e | 2008-01-25 21:08:29 +0100 | [diff] [blame] | 976 | #ifdef CONFIG_SCHED_HRTICK |
| 977 | static void hrtick_start_fair(struct rq *rq, struct task_struct *p) |
| 978 | { |
Peter Zijlstra | 8f4d37e | 2008-01-25 21:08:29 +0100 | [diff] [blame] | 979 | struct sched_entity *se = &p->se; |
| 980 | struct cfs_rq *cfs_rq = cfs_rq_of(se); |
| 981 | |
| 982 | WARN_ON(task_rq(p) != rq); |
| 983 | |
| 984 | if (hrtick_enabled(rq) && cfs_rq->nr_running > 1) { |
| 985 | u64 slice = sched_slice(cfs_rq, se); |
| 986 | u64 ran = se->sum_exec_runtime - se->prev_sum_exec_runtime; |
| 987 | s64 delta = slice - ran; |
| 988 | |
| 989 | if (delta < 0) { |
| 990 | if (rq->curr == p) |
| 991 | resched_task(p); |
| 992 | return; |
| 993 | } |
| 994 | |
| 995 | /* |
| 996 | * Don't schedule slices shorter than 10000ns, that just |
| 997 | * doesn't make sense. Rely on vruntime for fairness. |
| 998 | */ |
Peter Zijlstra | 3165651 | 2008-07-18 18:01:23 +0200 | [diff] [blame] | 999 | if (rq->curr != p) |
Peter Zijlstra | 157124c | 2008-07-28 11:53:11 +0200 | [diff] [blame] | 1000 | delta = max_t(s64, 10000LL, delta); |
Peter Zijlstra | 8f4d37e | 2008-01-25 21:08:29 +0100 | [diff] [blame] | 1001 | |
Peter Zijlstra | 3165651 | 2008-07-18 18:01:23 +0200 | [diff] [blame] | 1002 | hrtick_start(rq, delta); |
Peter Zijlstra | 8f4d37e | 2008-01-25 21:08:29 +0100 | [diff] [blame] | 1003 | } |
| 1004 | } |
Peter Zijlstra | a4c2f00 | 2008-10-17 19:27:03 +0200 | [diff] [blame] | 1005 | |
| 1006 | /* |
| 1007 | * called from enqueue/dequeue and updates the hrtick when the |
| 1008 | * current task is from our class and nr_running is low enough |
| 1009 | * to matter. |
| 1010 | */ |
| 1011 | static void hrtick_update(struct rq *rq) |
| 1012 | { |
| 1013 | struct task_struct *curr = rq->curr; |
| 1014 | |
| 1015 | if (curr->sched_class != &fair_sched_class) |
| 1016 | return; |
| 1017 | |
| 1018 | if (cfs_rq_of(&curr->se)->nr_running < sched_nr_latency) |
| 1019 | hrtick_start_fair(rq, curr); |
| 1020 | } |
Dhaval Giani | 55e12e5 | 2008-06-24 23:39:43 +0530 | [diff] [blame] | 1021 | #else /* !CONFIG_SCHED_HRTICK */ |
Peter Zijlstra | 8f4d37e | 2008-01-25 21:08:29 +0100 | [diff] [blame] | 1022 | static inline void |
| 1023 | hrtick_start_fair(struct rq *rq, struct task_struct *p) |
| 1024 | { |
| 1025 | } |
Peter Zijlstra | a4c2f00 | 2008-10-17 19:27:03 +0200 | [diff] [blame] | 1026 | |
| 1027 | static inline void hrtick_update(struct rq *rq) |
| 1028 | { |
| 1029 | } |
Peter Zijlstra | 8f4d37e | 2008-01-25 21:08:29 +0100 | [diff] [blame] | 1030 | #endif |
| 1031 | |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1032 | /* |
| 1033 | * The enqueue_task method is called before nr_running is |
| 1034 | * increased. Here we update the fair scheduling stats and |
| 1035 | * then put the task into the rbtree: |
| 1036 | */ |
Ingo Molnar | fd390f6 | 2007-08-09 11:16:48 +0200 | [diff] [blame] | 1037 | static void enqueue_task_fair(struct rq *rq, struct task_struct *p, int wakeup) |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1038 | { |
| 1039 | struct cfs_rq *cfs_rq; |
Peter Zijlstra | 62fb185 | 2008-02-25 17:34:02 +0100 | [diff] [blame] | 1040 | struct sched_entity *se = &p->se; |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1041 | |
| 1042 | for_each_sched_entity(se) { |
Peter Zijlstra | 62fb185 | 2008-02-25 17:34:02 +0100 | [diff] [blame] | 1043 | if (se->on_rq) |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1044 | break; |
| 1045 | cfs_rq = cfs_rq_of(se); |
Srivatsa Vaddagiri | 83b699e | 2007-10-15 17:00:08 +0200 | [diff] [blame] | 1046 | enqueue_entity(cfs_rq, se, wakeup); |
Srivatsa Vaddagiri | b9fa3df | 2007-10-15 17:00:12 +0200 | [diff] [blame] | 1047 | wakeup = 1; |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1048 | } |
Peter Zijlstra | 8f4d37e | 2008-01-25 21:08:29 +0100 | [diff] [blame] | 1049 | |
Peter Zijlstra | a4c2f00 | 2008-10-17 19:27:03 +0200 | [diff] [blame] | 1050 | hrtick_update(rq); |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1051 | } |
| 1052 | |
| 1053 | /* |
| 1054 | * The dequeue_task method is called before nr_running is |
| 1055 | * decreased. We remove the task from the rbtree and |
| 1056 | * update the fair scheduling stats: |
| 1057 | */ |
Ingo Molnar | f02231e | 2007-08-09 11:16:48 +0200 | [diff] [blame] | 1058 | static void dequeue_task_fair(struct rq *rq, struct task_struct *p, int sleep) |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1059 | { |
| 1060 | struct cfs_rq *cfs_rq; |
Peter Zijlstra | 62fb185 | 2008-02-25 17:34:02 +0100 | [diff] [blame] | 1061 | struct sched_entity *se = &p->se; |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1062 | |
| 1063 | for_each_sched_entity(se) { |
| 1064 | cfs_rq = cfs_rq_of(se); |
Ingo Molnar | 525c271 | 2007-08-09 11:16:48 +0200 | [diff] [blame] | 1065 | dequeue_entity(cfs_rq, se, sleep); |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1066 | /* Don't dequeue parent if it has other entities besides us */ |
Peter Zijlstra | 62fb185 | 2008-02-25 17:34:02 +0100 | [diff] [blame] | 1067 | if (cfs_rq->load.weight) |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1068 | break; |
Srivatsa Vaddagiri | b9fa3df | 2007-10-15 17:00:12 +0200 | [diff] [blame] | 1069 | sleep = 1; |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1070 | } |
Peter Zijlstra | 8f4d37e | 2008-01-25 21:08:29 +0100 | [diff] [blame] | 1071 | |
Peter Zijlstra | a4c2f00 | 2008-10-17 19:27:03 +0200 | [diff] [blame] | 1072 | hrtick_update(rq); |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1073 | } |
| 1074 | |
| 1075 | /* |
Ingo Molnar | 1799e35 | 2007-09-19 23:34:46 +0200 | [diff] [blame] | 1076 | * sched_yield() support is very simple - we dequeue and enqueue. |
| 1077 | * |
| 1078 | * If compat_yield is turned on then we requeue to the end of the tree. |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1079 | */ |
Dmitry Adamushko | 4530d7a | 2007-10-15 17:00:08 +0200 | [diff] [blame] | 1080 | static void yield_task_fair(struct rq *rq) |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1081 | { |
Ingo Molnar | db292ca | 2007-12-04 17:04:39 +0100 | [diff] [blame] | 1082 | struct task_struct *curr = rq->curr; |
| 1083 | struct cfs_rq *cfs_rq = task_cfs_rq(curr); |
| 1084 | struct sched_entity *rightmost, *se = &curr->se; |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1085 | |
| 1086 | /* |
Ingo Molnar | 1799e35 | 2007-09-19 23:34:46 +0200 | [diff] [blame] | 1087 | * Are we the only task in the tree? |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1088 | */ |
Ingo Molnar | 1799e35 | 2007-09-19 23:34:46 +0200 | [diff] [blame] | 1089 | if (unlikely(cfs_rq->nr_running == 1)) |
| 1090 | return; |
| 1091 | |
Peter Zijlstra | 2002c69 | 2008-11-11 11:52:33 +0100 | [diff] [blame] | 1092 | clear_buddies(cfs_rq, se); |
| 1093 | |
Ingo Molnar | db292ca | 2007-12-04 17:04:39 +0100 | [diff] [blame] | 1094 | if (likely(!sysctl_sched_compat_yield) && curr->policy != SCHED_BATCH) { |
Peter Zijlstra | 3e51f33 | 2008-05-03 18:29:28 +0200 | [diff] [blame] | 1095 | update_rq_clock(rq); |
Ingo Molnar | 1799e35 | 2007-09-19 23:34:46 +0200 | [diff] [blame] | 1096 | /* |
Dmitry Adamushko | a2a2d68 | 2007-10-15 17:00:13 +0200 | [diff] [blame] | 1097 | * Update run-time statistics of the 'current'. |
Ingo Molnar | 1799e35 | 2007-09-19 23:34:46 +0200 | [diff] [blame] | 1098 | */ |
Dmitry Adamushko | 2b1e315 | 2007-10-15 17:00:12 +0200 | [diff] [blame] | 1099 | update_curr(cfs_rq); |
Ingo Molnar | 1799e35 | 2007-09-19 23:34:46 +0200 | [diff] [blame] | 1100 | |
| 1101 | return; |
| 1102 | } |
| 1103 | /* |
| 1104 | * Find the rightmost entry in the rbtree: |
| 1105 | */ |
Dmitry Adamushko | 2b1e315 | 2007-10-15 17:00:12 +0200 | [diff] [blame] | 1106 | rightmost = __pick_last_entity(cfs_rq); |
Ingo Molnar | 1799e35 | 2007-09-19 23:34:46 +0200 | [diff] [blame] | 1107 | /* |
| 1108 | * Already in the rightmost position? |
| 1109 | */ |
Fabio Checconi | 54fdc58 | 2009-07-16 12:32:27 +0200 | [diff] [blame] | 1110 | if (unlikely(!rightmost || entity_before(rightmost, se))) |
Ingo Molnar | 1799e35 | 2007-09-19 23:34:46 +0200 | [diff] [blame] | 1111 | return; |
| 1112 | |
| 1113 | /* |
| 1114 | * Minimally necessary key value to be last in the tree: |
Dmitry Adamushko | 2b1e315 | 2007-10-15 17:00:12 +0200 | [diff] [blame] | 1115 | * Upon rescheduling, sched_class::put_prev_task() will place |
| 1116 | * 'current' within the tree based on its new key value. |
Ingo Molnar | 1799e35 | 2007-09-19 23:34:46 +0200 | [diff] [blame] | 1117 | */ |
Dmitry Adamushko | 30cfdcf | 2007-10-15 17:00:07 +0200 | [diff] [blame] | 1118 | se->vruntime = rightmost->vruntime + 1; |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1119 | } |
| 1120 | |
Gregory Haskins | e7693a3 | 2008-01-25 21:08:09 +0100 | [diff] [blame] | 1121 | #ifdef CONFIG_SMP |
Ingo Molnar | 098fb9d | 2008-03-16 20:36:10 +0100 | [diff] [blame] | 1122 | |
Peter Zijlstra | bb3469a | 2008-06-27 13:41:27 +0200 | [diff] [blame] | 1123 | #ifdef CONFIG_FAIR_GROUP_SCHED |
Peter Zijlstra | f5bfb7d | 2008-06-27 13:41:39 +0200 | [diff] [blame] | 1124 | /* |
| 1125 | * effective_load() calculates the load change as seen from the root_task_group |
| 1126 | * |
| 1127 | * Adding load to a group doesn't make a group heavier, but can cause movement |
| 1128 | * of group shares between cpus. Assuming the shares were perfectly aligned one |
| 1129 | * can calculate the shift in shares. |
| 1130 | * |
| 1131 | * The problem is that perfectly aligning the shares is rather expensive, hence |
| 1132 | * we try to avoid doing that too often - see update_shares(), which ratelimits |
| 1133 | * this change. |
| 1134 | * |
| 1135 | * We compensate this by not only taking the current delta into account, but |
| 1136 | * also considering the delta between when the shares were last adjusted and |
| 1137 | * now. |
| 1138 | * |
| 1139 | * We still saw a performance dip, some tracing learned us that between |
| 1140 | * cgroup:/ and cgroup:/foo balancing the number of affine wakeups increased |
| 1141 | * significantly. Therefore try to bias the error in direction of failing |
| 1142 | * the affine wakeup. |
| 1143 | * |
| 1144 | */ |
Peter Zijlstra | f1d239f | 2008-06-27 13:41:38 +0200 | [diff] [blame] | 1145 | static long effective_load(struct task_group *tg, int cpu, |
| 1146 | long wl, long wg) |
Peter Zijlstra | bb3469a | 2008-06-27 13:41:27 +0200 | [diff] [blame] | 1147 | { |
Peter Zijlstra | 4be9daa | 2008-06-27 13:41:30 +0200 | [diff] [blame] | 1148 | struct sched_entity *se = tg->se[cpu]; |
Peter Zijlstra | f1d239f | 2008-06-27 13:41:38 +0200 | [diff] [blame] | 1149 | |
| 1150 | if (!tg->parent) |
| 1151 | return wl; |
| 1152 | |
| 1153 | /* |
Peter Zijlstra | f5bfb7d | 2008-06-27 13:41:39 +0200 | [diff] [blame] | 1154 | * By not taking the decrease of shares on the other cpu into |
| 1155 | * account our error leans towards reducing the affine wakeups. |
| 1156 | */ |
| 1157 | if (!wl && sched_feat(ASYM_EFF_LOAD)) |
| 1158 | return wl; |
| 1159 | |
Peter Zijlstra | 4be9daa | 2008-06-27 13:41:30 +0200 | [diff] [blame] | 1160 | for_each_sched_entity(se) { |
Peter Zijlstra | cb5ef42 | 2008-06-27 13:41:32 +0200 | [diff] [blame] | 1161 | long S, rw, s, a, b; |
Peter Zijlstra | 940959e | 2008-09-23 15:33:42 +0200 | [diff] [blame] | 1162 | long more_w; |
| 1163 | |
| 1164 | /* |
| 1165 | * Instead of using this increment, also add the difference |
| 1166 | * between when the shares were last updated and now. |
| 1167 | */ |
| 1168 | more_w = se->my_q->load.weight - se->my_q->rq_weight; |
| 1169 | wl += more_w; |
| 1170 | wg += more_w; |
Peter Zijlstra | bb3469a | 2008-06-27 13:41:27 +0200 | [diff] [blame] | 1171 | |
Peter Zijlstra | 4be9daa | 2008-06-27 13:41:30 +0200 | [diff] [blame] | 1172 | S = se->my_q->tg->shares; |
| 1173 | s = se->my_q->shares; |
Peter Zijlstra | f1d239f | 2008-06-27 13:41:38 +0200 | [diff] [blame] | 1174 | rw = se->my_q->rq_weight; |
Peter Zijlstra | 4be9daa | 2008-06-27 13:41:30 +0200 | [diff] [blame] | 1175 | |
Peter Zijlstra | cb5ef42 | 2008-06-27 13:41:32 +0200 | [diff] [blame] | 1176 | a = S*(rw + wl); |
| 1177 | b = S*rw + s*wg; |
Peter Zijlstra | 4be9daa | 2008-06-27 13:41:30 +0200 | [diff] [blame] | 1178 | |
Peter Zijlstra | 940959e | 2008-09-23 15:33:42 +0200 | [diff] [blame] | 1179 | wl = s*(a-b); |
| 1180 | |
| 1181 | if (likely(b)) |
| 1182 | wl /= b; |
| 1183 | |
Peter Zijlstra | 8337826 | 2008-06-27 13:41:37 +0200 | [diff] [blame] | 1184 | /* |
| 1185 | * Assume the group is already running and will |
| 1186 | * thus already be accounted for in the weight. |
| 1187 | * |
| 1188 | * That is, moving shares between CPUs, does not |
| 1189 | * alter the group weight. |
| 1190 | */ |
Peter Zijlstra | 4be9daa | 2008-06-27 13:41:30 +0200 | [diff] [blame] | 1191 | wg = 0; |
Peter Zijlstra | 4be9daa | 2008-06-27 13:41:30 +0200 | [diff] [blame] | 1192 | } |
| 1193 | |
| 1194 | return wl; |
Peter Zijlstra | bb3469a | 2008-06-27 13:41:27 +0200 | [diff] [blame] | 1195 | } |
Peter Zijlstra | 4be9daa | 2008-06-27 13:41:30 +0200 | [diff] [blame] | 1196 | |
Peter Zijlstra | bb3469a | 2008-06-27 13:41:27 +0200 | [diff] [blame] | 1197 | #else |
Peter Zijlstra | 4be9daa | 2008-06-27 13:41:30 +0200 | [diff] [blame] | 1198 | |
Peter Zijlstra | 8337826 | 2008-06-27 13:41:37 +0200 | [diff] [blame] | 1199 | static inline unsigned long effective_load(struct task_group *tg, int cpu, |
| 1200 | unsigned long wl, unsigned long wg) |
Peter Zijlstra | 4be9daa | 2008-06-27 13:41:30 +0200 | [diff] [blame] | 1201 | { |
Peter Zijlstra | 8337826 | 2008-06-27 13:41:37 +0200 | [diff] [blame] | 1202 | return wl; |
Peter Zijlstra | bb3469a | 2008-06-27 13:41:27 +0200 | [diff] [blame] | 1203 | } |
Peter Zijlstra | 4be9daa | 2008-06-27 13:41:30 +0200 | [diff] [blame] | 1204 | |
Peter Zijlstra | bb3469a | 2008-06-27 13:41:27 +0200 | [diff] [blame] | 1205 | #endif |
| 1206 | |
Peter Zijlstra | c88d591 | 2009-09-10 13:50:02 +0200 | [diff] [blame] | 1207 | static int wake_affine(struct sched_domain *sd, struct task_struct *p, int sync) |
Ingo Molnar | 098fb9d | 2008-03-16 20:36:10 +0100 | [diff] [blame] | 1208 | { |
Peter Zijlstra | c88d591 | 2009-09-10 13:50:02 +0200 | [diff] [blame] | 1209 | struct task_struct *curr = current; |
| 1210 | unsigned long this_load, load; |
| 1211 | int idx, this_cpu, prev_cpu; |
Ingo Molnar | 098fb9d | 2008-03-16 20:36:10 +0100 | [diff] [blame] | 1212 | unsigned long tl_per_task; |
Peter Zijlstra | c88d591 | 2009-09-10 13:50:02 +0200 | [diff] [blame] | 1213 | unsigned int imbalance; |
| 1214 | struct task_group *tg; |
Peter Zijlstra | 8337826 | 2008-06-27 13:41:37 +0200 | [diff] [blame] | 1215 | unsigned long weight; |
Mike Galbraith | b3137bc | 2008-05-29 11:11:41 +0200 | [diff] [blame] | 1216 | int balanced; |
Ingo Molnar | 098fb9d | 2008-03-16 20:36:10 +0100 | [diff] [blame] | 1217 | |
Peter Zijlstra | c88d591 | 2009-09-10 13:50:02 +0200 | [diff] [blame] | 1218 | idx = sd->wake_idx; |
| 1219 | this_cpu = smp_processor_id(); |
| 1220 | prev_cpu = task_cpu(p); |
| 1221 | load = source_load(prev_cpu, idx); |
| 1222 | this_load = target_load(this_cpu, idx); |
Ingo Molnar | 098fb9d | 2008-03-16 20:36:10 +0100 | [diff] [blame] | 1223 | |
Peter Zijlstra | e69b0f1 | 2009-09-15 19:38:52 +0200 | [diff] [blame] | 1224 | if (sync) { |
| 1225 | if (sched_feat(SYNC_LESS) && |
| 1226 | (curr->se.avg_overlap > sysctl_sched_migration_cost || |
| 1227 | p->se.avg_overlap > sysctl_sched_migration_cost)) |
| 1228 | sync = 0; |
| 1229 | } else { |
| 1230 | if (sched_feat(SYNC_MORE) && |
| 1231 | (curr->se.avg_overlap < sysctl_sched_migration_cost && |
| 1232 | p->se.avg_overlap < sysctl_sched_migration_cost)) |
| 1233 | sync = 1; |
| 1234 | } |
Peter Zijlstra | fc631c8 | 2009-02-11 14:27:17 +0100 | [diff] [blame] | 1235 | |
Ingo Molnar | 098fb9d | 2008-03-16 20:36:10 +0100 | [diff] [blame] | 1236 | /* |
Ingo Molnar | 098fb9d | 2008-03-16 20:36:10 +0100 | [diff] [blame] | 1237 | * If sync wakeup then subtract the (maximum possible) |
| 1238 | * effect of the currently running task from the load |
| 1239 | * of the current CPU: |
| 1240 | */ |
Peter Zijlstra | 8337826 | 2008-06-27 13:41:37 +0200 | [diff] [blame] | 1241 | if (sync) { |
| 1242 | tg = task_group(current); |
| 1243 | weight = current->se.load.weight; |
Ingo Molnar | 098fb9d | 2008-03-16 20:36:10 +0100 | [diff] [blame] | 1244 | |
Peter Zijlstra | c88d591 | 2009-09-10 13:50:02 +0200 | [diff] [blame] | 1245 | this_load += effective_load(tg, this_cpu, -weight, -weight); |
Peter Zijlstra | 8337826 | 2008-06-27 13:41:37 +0200 | [diff] [blame] | 1246 | load += effective_load(tg, prev_cpu, 0, -weight); |
| 1247 | } |
| 1248 | |
| 1249 | tg = task_group(p); |
| 1250 | weight = p->se.load.weight; |
| 1251 | |
Peter Zijlstra | c88d591 | 2009-09-10 13:50:02 +0200 | [diff] [blame] | 1252 | imbalance = 100 + (sd->imbalance_pct - 100) / 2; |
| 1253 | |
Peter Zijlstra | 71a29aa | 2009-09-07 18:28:05 +0200 | [diff] [blame] | 1254 | /* |
| 1255 | * In low-load situations, where prev_cpu is idle and this_cpu is idle |
Peter Zijlstra | c88d591 | 2009-09-10 13:50:02 +0200 | [diff] [blame] | 1256 | * due to the sync cause above having dropped this_load to 0, we'll |
| 1257 | * always have an imbalance, but there's really nothing you can do |
| 1258 | * about that, so that's good too. |
Peter Zijlstra | 71a29aa | 2009-09-07 18:28:05 +0200 | [diff] [blame] | 1259 | * |
| 1260 | * Otherwise check if either cpus are near enough in load to allow this |
| 1261 | * task to be woken on this_cpu. |
| 1262 | */ |
Peter Zijlstra | c88d591 | 2009-09-10 13:50:02 +0200 | [diff] [blame] | 1263 | balanced = !this_load || |
| 1264 | 100*(this_load + effective_load(tg, this_cpu, weight, weight)) <= |
Peter Zijlstra | 8337826 | 2008-06-27 13:41:37 +0200 | [diff] [blame] | 1265 | imbalance*(load + effective_load(tg, prev_cpu, 0, weight)); |
Mike Galbraith | b3137bc | 2008-05-29 11:11:41 +0200 | [diff] [blame] | 1266 | |
| 1267 | /* |
| 1268 | * If the currently running task will sleep within |
| 1269 | * a reasonable amount of time then attract this newly |
| 1270 | * woken task: |
| 1271 | */ |
Peter Zijlstra | 2fb7635 | 2008-10-08 09:16:04 +0200 | [diff] [blame] | 1272 | if (sync && balanced) |
| 1273 | return 1; |
Mike Galbraith | b3137bc | 2008-05-29 11:11:41 +0200 | [diff] [blame] | 1274 | |
| 1275 | schedstat_inc(p, se.nr_wakeups_affine_attempts); |
| 1276 | tl_per_task = cpu_avg_load_per_task(this_cpu); |
| 1277 | |
Peter Zijlstra | c88d591 | 2009-09-10 13:50:02 +0200 | [diff] [blame] | 1278 | if (balanced || |
| 1279 | (this_load <= load && |
| 1280 | this_load + target_load(prev_cpu, idx) <= tl_per_task)) { |
Ingo Molnar | 098fb9d | 2008-03-16 20:36:10 +0100 | [diff] [blame] | 1281 | /* |
| 1282 | * This domain has SD_WAKE_AFFINE and |
| 1283 | * p is cache cold in this domain, and |
| 1284 | * there is no bad imbalance. |
| 1285 | */ |
Peter Zijlstra | c88d591 | 2009-09-10 13:50:02 +0200 | [diff] [blame] | 1286 | schedstat_inc(sd, ttwu_move_affine); |
Ingo Molnar | 098fb9d | 2008-03-16 20:36:10 +0100 | [diff] [blame] | 1287 | schedstat_inc(p, se.nr_wakeups_affine); |
| 1288 | |
| 1289 | return 1; |
| 1290 | } |
| 1291 | return 0; |
| 1292 | } |
| 1293 | |
Peter Zijlstra | aaee120 | 2009-09-10 13:36:25 +0200 | [diff] [blame] | 1294 | /* |
| 1295 | * find_idlest_group finds and returns the least busy CPU group within the |
| 1296 | * domain. |
| 1297 | */ |
| 1298 | static struct sched_group * |
Peter Zijlstra | 78e7ed5 | 2009-09-03 13:16:51 +0200 | [diff] [blame] | 1299 | find_idlest_group(struct sched_domain *sd, struct task_struct *p, |
Peter Zijlstra | 5158f4e | 2009-09-16 13:46:59 +0200 | [diff] [blame] | 1300 | int this_cpu, int load_idx) |
Gregory Haskins | e7693a3 | 2008-01-25 21:08:09 +0100 | [diff] [blame] | 1301 | { |
Peter Zijlstra | aaee120 | 2009-09-10 13:36:25 +0200 | [diff] [blame] | 1302 | struct sched_group *idlest = NULL, *this = NULL, *group = sd->groups; |
| 1303 | unsigned long min_load = ULONG_MAX, this_load = 0; |
Peter Zijlstra | aaee120 | 2009-09-10 13:36:25 +0200 | [diff] [blame] | 1304 | int imbalance = 100 + (sd->imbalance_pct-100)/2; |
Gregory Haskins | e7693a3 | 2008-01-25 21:08:09 +0100 | [diff] [blame] | 1305 | |
Peter Zijlstra | aaee120 | 2009-09-10 13:36:25 +0200 | [diff] [blame] | 1306 | do { |
| 1307 | unsigned long load, avg_load; |
| 1308 | int local_group; |
| 1309 | int i; |
Gregory Haskins | e7693a3 | 2008-01-25 21:08:09 +0100 | [diff] [blame] | 1310 | |
Peter Zijlstra | aaee120 | 2009-09-10 13:36:25 +0200 | [diff] [blame] | 1311 | /* Skip over this group if it has no CPUs allowed */ |
| 1312 | if (!cpumask_intersects(sched_group_cpus(group), |
| 1313 | &p->cpus_allowed)) |
| 1314 | continue; |
| 1315 | |
| 1316 | local_group = cpumask_test_cpu(this_cpu, |
| 1317 | sched_group_cpus(group)); |
| 1318 | |
| 1319 | /* Tally up the load of all CPUs in the group */ |
| 1320 | avg_load = 0; |
| 1321 | |
| 1322 | for_each_cpu(i, sched_group_cpus(group)) { |
| 1323 | /* Bias balancing toward cpus of our domain */ |
| 1324 | if (local_group) |
| 1325 | load = source_load(i, load_idx); |
| 1326 | else |
| 1327 | load = target_load(i, load_idx); |
| 1328 | |
| 1329 | avg_load += load; |
| 1330 | } |
| 1331 | |
| 1332 | /* Adjust by relative CPU power of the group */ |
| 1333 | avg_load = (avg_load * SCHED_LOAD_SCALE) / group->cpu_power; |
| 1334 | |
| 1335 | if (local_group) { |
| 1336 | this_load = avg_load; |
| 1337 | this = group; |
| 1338 | } else if (avg_load < min_load) { |
| 1339 | min_load = avg_load; |
| 1340 | idlest = group; |
| 1341 | } |
| 1342 | } while (group = group->next, group != sd->groups); |
| 1343 | |
| 1344 | if (!idlest || 100*this_load < imbalance*min_load) |
| 1345 | return NULL; |
| 1346 | return idlest; |
| 1347 | } |
| 1348 | |
| 1349 | /* |
| 1350 | * find_idlest_cpu - find the idlest cpu among the cpus in group. |
| 1351 | */ |
| 1352 | static int |
| 1353 | find_idlest_cpu(struct sched_group *group, struct task_struct *p, int this_cpu) |
| 1354 | { |
| 1355 | unsigned long load, min_load = ULONG_MAX; |
| 1356 | int idlest = -1; |
| 1357 | int i; |
| 1358 | |
| 1359 | /* Traverse only the allowed CPUs */ |
| 1360 | for_each_cpu_and(i, sched_group_cpus(group), &p->cpus_allowed) { |
| 1361 | load = weighted_cpuload(i); |
| 1362 | |
| 1363 | if (load < min_load || (load == min_load && i == this_cpu)) { |
| 1364 | min_load = load; |
| 1365 | idlest = i; |
Gregory Haskins | e7693a3 | 2008-01-25 21:08:09 +0100 | [diff] [blame] | 1366 | } |
| 1367 | } |
| 1368 | |
Peter Zijlstra | aaee120 | 2009-09-10 13:36:25 +0200 | [diff] [blame] | 1369 | return idlest; |
| 1370 | } |
Gregory Haskins | e7693a3 | 2008-01-25 21:08:09 +0100 | [diff] [blame] | 1371 | |
Peter Zijlstra | aaee120 | 2009-09-10 13:36:25 +0200 | [diff] [blame] | 1372 | /* |
Peter Zijlstra | a50bde5 | 2009-11-12 15:55:28 +0100 | [diff] [blame] | 1373 | * Try and locate an idle CPU in the sched_domain. |
| 1374 | */ |
| 1375 | static int |
| 1376 | select_idle_sibling(struct task_struct *p, struct sched_domain *sd, int target) |
| 1377 | { |
| 1378 | int cpu = smp_processor_id(); |
| 1379 | int prev_cpu = task_cpu(p); |
| 1380 | int i; |
| 1381 | |
| 1382 | /* |
| 1383 | * If this domain spans both cpu and prev_cpu (see the SD_WAKE_AFFINE |
| 1384 | * test in select_task_rq_fair) and the prev_cpu is idle then that's |
| 1385 | * always a better target than the current cpu. |
| 1386 | */ |
Peter Zijlstra | fe3bcfe | 2009-11-12 15:55:29 +0100 | [diff] [blame] | 1387 | if (target == cpu && !cpu_rq(prev_cpu)->cfs.nr_running) |
| 1388 | return prev_cpu; |
Peter Zijlstra | a50bde5 | 2009-11-12 15:55:28 +0100 | [diff] [blame] | 1389 | |
| 1390 | /* |
| 1391 | * Otherwise, iterate the domain and find an elegible idle cpu. |
| 1392 | */ |
Peter Zijlstra | fe3bcfe | 2009-11-12 15:55:29 +0100 | [diff] [blame] | 1393 | for_each_cpu_and(i, sched_domain_span(sd), &p->cpus_allowed) { |
| 1394 | if (!cpu_rq(i)->cfs.nr_running) { |
| 1395 | target = i; |
| 1396 | break; |
Peter Zijlstra | a50bde5 | 2009-11-12 15:55:28 +0100 | [diff] [blame] | 1397 | } |
| 1398 | } |
| 1399 | |
| 1400 | return target; |
| 1401 | } |
| 1402 | |
| 1403 | /* |
Peter Zijlstra | aaee120 | 2009-09-10 13:36:25 +0200 | [diff] [blame] | 1404 | * sched_balance_self: balance the current task (running on cpu) in domains |
| 1405 | * that have the 'flag' flag set. In practice, this is SD_BALANCE_FORK and |
| 1406 | * SD_BALANCE_EXEC. |
| 1407 | * |
| 1408 | * Balance, ie. select the least loaded group. |
| 1409 | * |
| 1410 | * Returns the target CPU number, or the same CPU if no balancing is needed. |
| 1411 | * |
| 1412 | * preempt must be disabled. |
| 1413 | */ |
Peter Zijlstra | 5158f4e | 2009-09-16 13:46:59 +0200 | [diff] [blame] | 1414 | static int select_task_rq_fair(struct task_struct *p, int sd_flag, int wake_flags) |
Peter Zijlstra | aaee120 | 2009-09-10 13:36:25 +0200 | [diff] [blame] | 1415 | { |
Peter Zijlstra | 29cd8ba | 2009-09-17 09:01:14 +0200 | [diff] [blame] | 1416 | struct sched_domain *tmp, *affine_sd = NULL, *sd = NULL; |
Peter Zijlstra | c88d591 | 2009-09-10 13:50:02 +0200 | [diff] [blame] | 1417 | int cpu = smp_processor_id(); |
| 1418 | int prev_cpu = task_cpu(p); |
| 1419 | int new_cpu = cpu; |
| 1420 | int want_affine = 0; |
Peter Zijlstra | 29cd8ba | 2009-09-17 09:01:14 +0200 | [diff] [blame] | 1421 | int want_sd = 1; |
Peter Zijlstra | 5158f4e | 2009-09-16 13:46:59 +0200 | [diff] [blame] | 1422 | int sync = wake_flags & WF_SYNC; |
Gregory Haskins | e7693a3 | 2008-01-25 21:08:09 +0100 | [diff] [blame] | 1423 | |
Peter Zijlstra | 0763a66 | 2009-09-14 19:37:39 +0200 | [diff] [blame] | 1424 | if (sd_flag & SD_BALANCE_WAKE) { |
Mike Galbraith | 3f04e8c | 2009-09-19 16:52:35 +0200 | [diff] [blame] | 1425 | if (sched_feat(AFFINE_WAKEUPS) && |
| 1426 | cpumask_test_cpu(cpu, &p->cpus_allowed)) |
Peter Zijlstra | c88d591 | 2009-09-10 13:50:02 +0200 | [diff] [blame] | 1427 | want_affine = 1; |
| 1428 | new_cpu = prev_cpu; |
| 1429 | } |
Gregory Haskins | e7693a3 | 2008-01-25 21:08:09 +0100 | [diff] [blame] | 1430 | |
Peter Zijlstra | aaee120 | 2009-09-10 13:36:25 +0200 | [diff] [blame] | 1431 | for_each_domain(cpu, tmp) { |
| 1432 | /* |
Peter Zijlstra | ae154be | 2009-09-10 14:40:57 +0200 | [diff] [blame] | 1433 | * If power savings logic is enabled for a domain, see if we |
| 1434 | * are not overloaded, if so, don't balance wider. |
Peter Zijlstra | aaee120 | 2009-09-10 13:36:25 +0200 | [diff] [blame] | 1435 | */ |
Peter Zijlstra | 59abf02 | 2009-09-16 08:28:30 +0200 | [diff] [blame] | 1436 | if (tmp->flags & (SD_POWERSAVINGS_BALANCE|SD_PREFER_LOCAL)) { |
Peter Zijlstra | ae154be | 2009-09-10 14:40:57 +0200 | [diff] [blame] | 1437 | unsigned long power = 0; |
| 1438 | unsigned long nr_running = 0; |
| 1439 | unsigned long capacity; |
| 1440 | int i; |
Gregory Haskins | e7693a3 | 2008-01-25 21:08:09 +0100 | [diff] [blame] | 1441 | |
Peter Zijlstra | ae154be | 2009-09-10 14:40:57 +0200 | [diff] [blame] | 1442 | for_each_cpu(i, sched_domain_span(tmp)) { |
| 1443 | power += power_of(i); |
| 1444 | nr_running += cpu_rq(i)->cfs.nr_running; |
| 1445 | } |
Gregory Haskins | e7693a3 | 2008-01-25 21:08:09 +0100 | [diff] [blame] | 1446 | |
Peter Zijlstra | ae154be | 2009-09-10 14:40:57 +0200 | [diff] [blame] | 1447 | capacity = DIV_ROUND_CLOSEST(power, SCHED_LOAD_SCALE); |
Ingo Molnar | 4ae7d5c | 2008-03-19 01:42:00 +0100 | [diff] [blame] | 1448 | |
Peter Zijlstra | 59abf02 | 2009-09-16 08:28:30 +0200 | [diff] [blame] | 1449 | if (tmp->flags & SD_POWERSAVINGS_BALANCE) |
| 1450 | nr_running /= 2; |
| 1451 | |
| 1452 | if (nr_running < capacity) |
Peter Zijlstra | 29cd8ba | 2009-09-17 09:01:14 +0200 | [diff] [blame] | 1453 | want_sd = 0; |
Gregory Haskins | e7693a3 | 2008-01-25 21:08:09 +0100 | [diff] [blame] | 1454 | } |
Peter Zijlstra | aaee120 | 2009-09-10 13:36:25 +0200 | [diff] [blame] | 1455 | |
Peter Zijlstra | fe3bcfe | 2009-11-12 15:55:29 +0100 | [diff] [blame] | 1456 | /* |
| 1457 | * While iterating the domains looking for a spanning |
| 1458 | * WAKE_AFFINE domain, adjust the affine target to any idle cpu |
| 1459 | * in cache sharing domains along the way. |
| 1460 | */ |
| 1461 | if (want_affine) { |
Peter Zijlstra | a50bde5 | 2009-11-12 15:55:28 +0100 | [diff] [blame] | 1462 | int target = -1; |
Mike Galbraith | a1f84a3 | 2009-10-27 15:35:38 +0100 | [diff] [blame] | 1463 | |
| 1464 | /* |
Peter Zijlstra | a50bde5 | 2009-11-12 15:55:28 +0100 | [diff] [blame] | 1465 | * If both cpu and prev_cpu are part of this domain, |
| 1466 | * cpu is a valid SD_WAKE_AFFINE target. |
Mike Galbraith | a1f84a3 | 2009-10-27 15:35:38 +0100 | [diff] [blame] | 1467 | */ |
Peter Zijlstra | a50bde5 | 2009-11-12 15:55:28 +0100 | [diff] [blame] | 1468 | if (cpumask_test_cpu(prev_cpu, sched_domain_span(tmp))) |
| 1469 | target = cpu; |
Mike Galbraith | a1f84a3 | 2009-10-27 15:35:38 +0100 | [diff] [blame] | 1470 | |
Peter Zijlstra | a50bde5 | 2009-11-12 15:55:28 +0100 | [diff] [blame] | 1471 | /* |
| 1472 | * If there's an idle sibling in this domain, make that |
| 1473 | * the wake_affine target instead of the current cpu. |
Peter Zijlstra | a50bde5 | 2009-11-12 15:55:28 +0100 | [diff] [blame] | 1474 | */ |
| 1475 | if (tmp->flags & SD_PREFER_SIBLING) |
| 1476 | target = select_idle_sibling(p, tmp, target); |
Mike Galbraith | a1f84a3 | 2009-10-27 15:35:38 +0100 | [diff] [blame] | 1477 | |
Peter Zijlstra | a50bde5 | 2009-11-12 15:55:28 +0100 | [diff] [blame] | 1478 | if (target >= 0) { |
Peter Zijlstra | fe3bcfe | 2009-11-12 15:55:29 +0100 | [diff] [blame] | 1479 | if (tmp->flags & SD_WAKE_AFFINE) { |
| 1480 | affine_sd = tmp; |
| 1481 | want_affine = 0; |
| 1482 | } |
Peter Zijlstra | a50bde5 | 2009-11-12 15:55:28 +0100 | [diff] [blame] | 1483 | cpu = target; |
Mike Galbraith | a1f84a3 | 2009-10-27 15:35:38 +0100 | [diff] [blame] | 1484 | } |
Peter Zijlstra | c88d591 | 2009-09-10 13:50:02 +0200 | [diff] [blame] | 1485 | } |
| 1486 | |
Peter Zijlstra | 29cd8ba | 2009-09-17 09:01:14 +0200 | [diff] [blame] | 1487 | if (!want_sd && !want_affine) |
| 1488 | break; |
| 1489 | |
Peter Zijlstra | 0763a66 | 2009-09-14 19:37:39 +0200 | [diff] [blame] | 1490 | if (!(tmp->flags & sd_flag)) |
Peter Zijlstra | c88d591 | 2009-09-10 13:50:02 +0200 | [diff] [blame] | 1491 | continue; |
| 1492 | |
Peter Zijlstra | 29cd8ba | 2009-09-17 09:01:14 +0200 | [diff] [blame] | 1493 | if (want_sd) |
| 1494 | sd = tmp; |
Peter Zijlstra | c88d591 | 2009-09-10 13:50:02 +0200 | [diff] [blame] | 1495 | } |
Peter Zijlstra | aaee120 | 2009-09-10 13:36:25 +0200 | [diff] [blame] | 1496 | |
Peter Zijlstra | 29cd8ba | 2009-09-17 09:01:14 +0200 | [diff] [blame] | 1497 | if (sched_feat(LB_SHARES_UPDATE)) { |
| 1498 | /* |
| 1499 | * Pick the largest domain to update shares over |
| 1500 | */ |
| 1501 | tmp = sd; |
| 1502 | if (affine_sd && (!tmp || |
| 1503 | cpumask_weight(sched_domain_span(affine_sd)) > |
| 1504 | cpumask_weight(sched_domain_span(sd)))) |
| 1505 | tmp = affine_sd; |
| 1506 | |
| 1507 | if (tmp) |
| 1508 | update_shares(tmp); |
| 1509 | } |
| 1510 | |
Peter Zijlstra | fb58bac | 2009-12-01 12:21:47 +0100 | [diff] [blame] | 1511 | if (affine_sd && wake_affine(affine_sd, p, sync)) |
| 1512 | return cpu; |
Peter Zijlstra | 3b64089 | 2009-09-16 13:44:33 +0200 | [diff] [blame] | 1513 | |
Peter Zijlstra | aaee120 | 2009-09-10 13:36:25 +0200 | [diff] [blame] | 1514 | while (sd) { |
Peter Zijlstra | 5158f4e | 2009-09-16 13:46:59 +0200 | [diff] [blame] | 1515 | int load_idx = sd->forkexec_idx; |
Peter Zijlstra | aaee120 | 2009-09-10 13:36:25 +0200 | [diff] [blame] | 1516 | struct sched_group *group; |
Peter Zijlstra | c88d591 | 2009-09-10 13:50:02 +0200 | [diff] [blame] | 1517 | int weight; |
Peter Zijlstra | aaee120 | 2009-09-10 13:36:25 +0200 | [diff] [blame] | 1518 | |
Peter Zijlstra | 0763a66 | 2009-09-14 19:37:39 +0200 | [diff] [blame] | 1519 | if (!(sd->flags & sd_flag)) { |
Peter Zijlstra | aaee120 | 2009-09-10 13:36:25 +0200 | [diff] [blame] | 1520 | sd = sd->child; |
| 1521 | continue; |
| 1522 | } |
| 1523 | |
Peter Zijlstra | 5158f4e | 2009-09-16 13:46:59 +0200 | [diff] [blame] | 1524 | if (sd_flag & SD_BALANCE_WAKE) |
| 1525 | load_idx = sd->wake_idx; |
| 1526 | |
| 1527 | group = find_idlest_group(sd, p, cpu, load_idx); |
Peter Zijlstra | aaee120 | 2009-09-10 13:36:25 +0200 | [diff] [blame] | 1528 | if (!group) { |
| 1529 | sd = sd->child; |
| 1530 | continue; |
| 1531 | } |
| 1532 | |
Peter Zijlstra | d7c33c4 | 2009-09-11 12:45:38 +0200 | [diff] [blame] | 1533 | new_cpu = find_idlest_cpu(group, p, cpu); |
Peter Zijlstra | aaee120 | 2009-09-10 13:36:25 +0200 | [diff] [blame] | 1534 | if (new_cpu == -1 || new_cpu == cpu) { |
| 1535 | /* Now try balancing at a lower domain level of cpu */ |
| 1536 | sd = sd->child; |
| 1537 | continue; |
| 1538 | } |
| 1539 | |
| 1540 | /* Now try balancing at a lower domain level of new_cpu */ |
| 1541 | cpu = new_cpu; |
| 1542 | weight = cpumask_weight(sched_domain_span(sd)); |
| 1543 | sd = NULL; |
| 1544 | for_each_domain(cpu, tmp) { |
| 1545 | if (weight <= cpumask_weight(sched_domain_span(tmp))) |
| 1546 | break; |
Peter Zijlstra | 0763a66 | 2009-09-14 19:37:39 +0200 | [diff] [blame] | 1547 | if (tmp->flags & sd_flag) |
Peter Zijlstra | aaee120 | 2009-09-10 13:36:25 +0200 | [diff] [blame] | 1548 | sd = tmp; |
| 1549 | } |
| 1550 | /* while loop will break here if sd == NULL */ |
Gregory Haskins | e7693a3 | 2008-01-25 21:08:09 +0100 | [diff] [blame] | 1551 | } |
| 1552 | |
Peter Zijlstra | c88d591 | 2009-09-10 13:50:02 +0200 | [diff] [blame] | 1553 | return new_cpu; |
Gregory Haskins | e7693a3 | 2008-01-25 21:08:09 +0100 | [diff] [blame] | 1554 | } |
| 1555 | #endif /* CONFIG_SMP */ |
| 1556 | |
Peter Zijlstra | e52fb7c | 2009-01-14 12:39:19 +0100 | [diff] [blame] | 1557 | /* |
| 1558 | * Adaptive granularity |
| 1559 | * |
| 1560 | * se->avg_wakeup gives the average time a task runs until it does a wakeup, |
| 1561 | * with the limit of wakeup_gran -- when it never does a wakeup. |
| 1562 | * |
| 1563 | * So the smaller avg_wakeup is the faster we want this task to preempt, |
| 1564 | * but we don't want to treat the preemptee unfairly and therefore allow it |
| 1565 | * to run for at least the amount of time we'd like to run. |
| 1566 | * |
| 1567 | * NOTE: we use 2*avg_wakeup to increase the probability of actually doing one |
| 1568 | * |
| 1569 | * NOTE: we use *nr_running to scale with load, this nicely matches the |
| 1570 | * degrading latency on load. |
| 1571 | */ |
| 1572 | static unsigned long |
| 1573 | adaptive_gran(struct sched_entity *curr, struct sched_entity *se) |
| 1574 | { |
| 1575 | u64 this_run = curr->sum_exec_runtime - curr->prev_sum_exec_runtime; |
| 1576 | u64 expected_wakeup = 2*se->avg_wakeup * cfs_rq_of(se)->nr_running; |
| 1577 | u64 gran = 0; |
| 1578 | |
| 1579 | if (this_run < expected_wakeup) |
| 1580 | gran = expected_wakeup - this_run; |
| 1581 | |
| 1582 | return min_t(s64, gran, sysctl_sched_wakeup_granularity); |
| 1583 | } |
| 1584 | |
| 1585 | static unsigned long |
| 1586 | wakeup_gran(struct sched_entity *curr, struct sched_entity *se) |
Peter Zijlstra | 0bbd333 | 2008-04-19 19:44:57 +0200 | [diff] [blame] | 1587 | { |
| 1588 | unsigned long gran = sysctl_sched_wakeup_granularity; |
| 1589 | |
Peter Zijlstra | e52fb7c | 2009-01-14 12:39:19 +0100 | [diff] [blame] | 1590 | if (cfs_rq_of(curr)->curr && sched_feat(ADAPTIVE_GRAN)) |
| 1591 | gran = adaptive_gran(curr, se); |
| 1592 | |
Peter Zijlstra | 0bbd333 | 2008-04-19 19:44:57 +0200 | [diff] [blame] | 1593 | /* |
Peter Zijlstra | e52fb7c | 2009-01-14 12:39:19 +0100 | [diff] [blame] | 1594 | * Since its curr running now, convert the gran from real-time |
| 1595 | * to virtual-time in his units. |
Peter Zijlstra | 0bbd333 | 2008-04-19 19:44:57 +0200 | [diff] [blame] | 1596 | */ |
Peter Zijlstra | e52fb7c | 2009-01-14 12:39:19 +0100 | [diff] [blame] | 1597 | if (sched_feat(ASYM_GRAN)) { |
| 1598 | /* |
| 1599 | * By using 'se' instead of 'curr' we penalize light tasks, so |
| 1600 | * they get preempted easier. That is, if 'se' < 'curr' then |
| 1601 | * the resulting gran will be larger, therefore penalizing the |
| 1602 | * lighter, if otoh 'se' > 'curr' then the resulting gran will |
| 1603 | * be smaller, again penalizing the lighter task. |
| 1604 | * |
| 1605 | * This is especially important for buddies when the leftmost |
| 1606 | * task is higher priority than the buddy. |
| 1607 | */ |
| 1608 | if (unlikely(se->load.weight != NICE_0_LOAD)) |
| 1609 | gran = calc_delta_fair(gran, se); |
| 1610 | } else { |
| 1611 | if (unlikely(curr->load.weight != NICE_0_LOAD)) |
| 1612 | gran = calc_delta_fair(gran, curr); |
| 1613 | } |
Peter Zijlstra | 0bbd333 | 2008-04-19 19:44:57 +0200 | [diff] [blame] | 1614 | |
| 1615 | return gran; |
| 1616 | } |
| 1617 | |
| 1618 | /* |
Peter Zijlstra | 464b752 | 2008-10-24 11:06:15 +0200 | [diff] [blame] | 1619 | * Should 'se' preempt 'curr'. |
| 1620 | * |
| 1621 | * |s1 |
| 1622 | * |s2 |
| 1623 | * |s3 |
| 1624 | * g |
| 1625 | * |<--->|c |
| 1626 | * |
| 1627 | * w(c, s1) = -1 |
| 1628 | * w(c, s2) = 0 |
| 1629 | * w(c, s3) = 1 |
| 1630 | * |
| 1631 | */ |
| 1632 | static int |
| 1633 | wakeup_preempt_entity(struct sched_entity *curr, struct sched_entity *se) |
| 1634 | { |
| 1635 | s64 gran, vdiff = curr->vruntime - se->vruntime; |
| 1636 | |
| 1637 | if (vdiff <= 0) |
| 1638 | return -1; |
| 1639 | |
Peter Zijlstra | e52fb7c | 2009-01-14 12:39:19 +0100 | [diff] [blame] | 1640 | gran = wakeup_gran(curr, se); |
Peter Zijlstra | 464b752 | 2008-10-24 11:06:15 +0200 | [diff] [blame] | 1641 | if (vdiff > gran) |
| 1642 | return 1; |
| 1643 | |
| 1644 | return 0; |
| 1645 | } |
| 1646 | |
Peter Zijlstra | 0247909 | 2008-11-04 21:25:10 +0100 | [diff] [blame] | 1647 | static void set_last_buddy(struct sched_entity *se) |
| 1648 | { |
Peter Zijlstra | 6bc912b | 2009-01-15 14:53:38 +0100 | [diff] [blame] | 1649 | if (likely(task_of(se)->policy != SCHED_IDLE)) { |
| 1650 | for_each_sched_entity(se) |
| 1651 | cfs_rq_of(se)->last = se; |
| 1652 | } |
Peter Zijlstra | 0247909 | 2008-11-04 21:25:10 +0100 | [diff] [blame] | 1653 | } |
| 1654 | |
| 1655 | static void set_next_buddy(struct sched_entity *se) |
| 1656 | { |
Peter Zijlstra | 6bc912b | 2009-01-15 14:53:38 +0100 | [diff] [blame] | 1657 | if (likely(task_of(se)->policy != SCHED_IDLE)) { |
| 1658 | for_each_sched_entity(se) |
| 1659 | cfs_rq_of(se)->next = se; |
| 1660 | } |
Peter Zijlstra | 0247909 | 2008-11-04 21:25:10 +0100 | [diff] [blame] | 1661 | } |
| 1662 | |
Peter Zijlstra | 464b752 | 2008-10-24 11:06:15 +0200 | [diff] [blame] | 1663 | /* |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1664 | * Preempt the current task with a newly woken task if needed: |
| 1665 | */ |
Peter Zijlstra | 5a9b86f | 2009-09-16 13:47:58 +0200 | [diff] [blame] | 1666 | static void check_preempt_wakeup(struct rq *rq, struct task_struct *p, int wake_flags) |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1667 | { |
| 1668 | struct task_struct *curr = rq->curr; |
Srivatsa Vaddagiri | 8651a86 | 2007-10-15 17:00:12 +0200 | [diff] [blame] | 1669 | struct sched_entity *se = &curr->se, *pse = &p->se; |
Mike Galbraith | 03e89e4 | 2008-12-16 08:45:30 +0100 | [diff] [blame] | 1670 | struct cfs_rq *cfs_rq = task_cfs_rq(curr); |
Peter Zijlstra | 5a9b86f | 2009-09-16 13:47:58 +0200 | [diff] [blame] | 1671 | int sync = wake_flags & WF_SYNC; |
Mike Galbraith | f685cea | 2009-10-23 23:09:22 +0200 | [diff] [blame] | 1672 | int scale = cfs_rq->nr_running >= sched_nr_latency; |
Mike Galbraith | 03e89e4 | 2008-12-16 08:45:30 +0100 | [diff] [blame] | 1673 | |
Peter Zijlstra | 3a7e73a | 2009-11-28 18:51:02 +0100 | [diff] [blame] | 1674 | if (unlikely(rt_prio(p->prio))) |
| 1675 | goto preempt; |
Peter Zijlstra | aa2ac25 | 2008-03-14 21:12:12 +0100 | [diff] [blame] | 1676 | |
Peter Zijlstra | d95f98d | 2008-11-04 21:25:08 +0100 | [diff] [blame] | 1677 | if (unlikely(p->sched_class != &fair_sched_class)) |
| 1678 | return; |
| 1679 | |
Ingo Molnar | 4ae7d5c | 2008-03-19 01:42:00 +0100 | [diff] [blame] | 1680 | if (unlikely(se == pse)) |
| 1681 | return; |
| 1682 | |
Mike Galbraith | f685cea | 2009-10-23 23:09:22 +0200 | [diff] [blame] | 1683 | if (sched_feat(NEXT_BUDDY) && scale && !(wake_flags & WF_FORK)) |
Mike Galbraith | 3cb63d5 | 2009-09-11 12:01:17 +0200 | [diff] [blame] | 1684 | set_next_buddy(pse); |
Peter Zijlstra | 57fdc26 | 2008-09-23 15:33:45 +0200 | [diff] [blame] | 1685 | |
Bharata B Rao | aec0a51 | 2008-08-28 14:42:49 +0530 | [diff] [blame] | 1686 | /* |
| 1687 | * We can come here with TIF_NEED_RESCHED already set from new task |
| 1688 | * wake up path. |
| 1689 | */ |
| 1690 | if (test_tsk_need_resched(curr)) |
| 1691 | return; |
| 1692 | |
Ingo Molnar | 91c234b | 2007-10-15 17:00:18 +0200 | [diff] [blame] | 1693 | /* |
Peter Zijlstra | 6bc912b | 2009-01-15 14:53:38 +0100 | [diff] [blame] | 1694 | * Batch and idle tasks do not preempt (their preemption is driven by |
Ingo Molnar | 91c234b | 2007-10-15 17:00:18 +0200 | [diff] [blame] | 1695 | * the tick): |
| 1696 | */ |
Peter Zijlstra | 6bc912b | 2009-01-15 14:53:38 +0100 | [diff] [blame] | 1697 | if (unlikely(p->policy != SCHED_NORMAL)) |
Ingo Molnar | 91c234b | 2007-10-15 17:00:18 +0200 | [diff] [blame] | 1698 | return; |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1699 | |
Peter Zijlstra | 6bc912b | 2009-01-15 14:53:38 +0100 | [diff] [blame] | 1700 | /* Idle tasks are by definition preempted by everybody. */ |
Peter Zijlstra | 3a7e73a | 2009-11-28 18:51:02 +0100 | [diff] [blame] | 1701 | if (unlikely(curr->policy == SCHED_IDLE)) |
| 1702 | goto preempt; |
Peter Zijlstra | 6bc912b | 2009-01-15 14:53:38 +0100 | [diff] [blame] | 1703 | |
Peter Zijlstra | 3a7e73a | 2009-11-28 18:51:02 +0100 | [diff] [blame] | 1704 | if (sched_feat(WAKEUP_SYNC) && sync) |
| 1705 | goto preempt; |
Peter Zijlstra | 15afe09 | 2008-09-20 23:38:02 +0200 | [diff] [blame] | 1706 | |
Peter Zijlstra | 3a7e73a | 2009-11-28 18:51:02 +0100 | [diff] [blame] | 1707 | if (sched_feat(WAKEUP_OVERLAP) && |
| 1708 | se->avg_overlap < sysctl_sched_migration_cost && |
| 1709 | pse->avg_overlap < sysctl_sched_migration_cost) |
| 1710 | goto preempt; |
| 1711 | |
Peter Zijlstra | ad4b78b | 2009-09-16 12:31:31 +0200 | [diff] [blame] | 1712 | if (!sched_feat(WAKEUP_PREEMPT)) |
| 1713 | return; |
| 1714 | |
Jupyung Lee | a65ac74 | 2009-11-17 18:51:40 +0900 | [diff] [blame] | 1715 | update_curr(cfs_rq); |
Peter Zijlstra | 3a7e73a | 2009-11-28 18:51:02 +0100 | [diff] [blame] | 1716 | find_matching_se(&se, &pse); |
| 1717 | BUG_ON(!pse); |
| 1718 | if (wakeup_preempt_entity(se, pse) == 1) |
| 1719 | goto preempt; |
Jupyung Lee | a65ac74 | 2009-11-17 18:51:40 +0900 | [diff] [blame] | 1720 | |
Peter Zijlstra | 3a7e73a | 2009-11-28 18:51:02 +0100 | [diff] [blame] | 1721 | return; |
| 1722 | |
| 1723 | preempt: |
| 1724 | resched_task(curr); |
| 1725 | /* |
| 1726 | * Only set the backward buddy when the current task is still |
| 1727 | * on the rq. This can happen when a wakeup gets interleaved |
| 1728 | * with schedule on the ->pre_schedule() or idle_balance() |
| 1729 | * point, either of which can * drop the rq lock. |
| 1730 | * |
| 1731 | * Also, during early boot the idle thread is in the fair class, |
| 1732 | * for obvious reasons its a bad idea to schedule back to it. |
| 1733 | */ |
| 1734 | if (unlikely(!se->on_rq || curr == rq->idle)) |
| 1735 | return; |
| 1736 | |
| 1737 | if (sched_feat(LAST_BUDDY) && scale && entity_is_task(se)) |
| 1738 | set_last_buddy(se); |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1739 | } |
| 1740 | |
Ingo Molnar | fb8d472 | 2007-08-09 11:16:48 +0200 | [diff] [blame] | 1741 | static struct task_struct *pick_next_task_fair(struct rq *rq) |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1742 | { |
Peter Zijlstra | 8f4d37e | 2008-01-25 21:08:29 +0100 | [diff] [blame] | 1743 | struct task_struct *p; |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1744 | struct cfs_rq *cfs_rq = &rq->cfs; |
| 1745 | struct sched_entity *se; |
| 1746 | |
Tim Blechmann | 36ace27 | 2009-11-24 11:55:45 +0100 | [diff] [blame] | 1747 | if (!cfs_rq->nr_running) |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1748 | return NULL; |
| 1749 | |
| 1750 | do { |
Ingo Molnar | 9948f4b | 2007-08-09 11:16:48 +0200 | [diff] [blame] | 1751 | se = pick_next_entity(cfs_rq); |
Peter Zijlstra | f4b6755 | 2008-11-04 21:25:07 +0100 | [diff] [blame] | 1752 | set_next_entity(cfs_rq, se); |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1753 | cfs_rq = group_cfs_rq(se); |
| 1754 | } while (cfs_rq); |
| 1755 | |
Peter Zijlstra | 8f4d37e | 2008-01-25 21:08:29 +0100 | [diff] [blame] | 1756 | p = task_of(se); |
| 1757 | hrtick_start_fair(rq, p); |
| 1758 | |
| 1759 | return p; |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1760 | } |
| 1761 | |
| 1762 | /* |
| 1763 | * Account for a descheduled task: |
| 1764 | */ |
Ingo Molnar | 31ee529 | 2007-08-09 11:16:49 +0200 | [diff] [blame] | 1765 | static void put_prev_task_fair(struct rq *rq, struct task_struct *prev) |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1766 | { |
| 1767 | struct sched_entity *se = &prev->se; |
| 1768 | struct cfs_rq *cfs_rq; |
| 1769 | |
| 1770 | for_each_sched_entity(se) { |
| 1771 | cfs_rq = cfs_rq_of(se); |
Ingo Molnar | ab6cde2 | 2007-08-09 11:16:48 +0200 | [diff] [blame] | 1772 | put_prev_entity(cfs_rq, se); |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1773 | } |
| 1774 | } |
| 1775 | |
Peter Williams | 681f3e6 | 2007-10-24 18:23:51 +0200 | [diff] [blame] | 1776 | #ifdef CONFIG_SMP |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1777 | /************************************************** |
| 1778 | * Fair scheduling class load-balancing methods: |
| 1779 | */ |
| 1780 | |
| 1781 | /* |
| 1782 | * Load-balancing iterator. Note: while the runqueue stays locked |
| 1783 | * during the whole iteration, the current task might be |
| 1784 | * dequeued so the iterator has to be dequeue-safe. Here we |
| 1785 | * achieve that by always pre-iterating before returning |
| 1786 | * the current task: |
| 1787 | */ |
Alexey Dobriyan | a995744 | 2007-10-15 17:00:13 +0200 | [diff] [blame] | 1788 | static struct task_struct * |
Peter Zijlstra | 4a55bd5 | 2008-04-19 19:45:00 +0200 | [diff] [blame] | 1789 | __load_balance_iterator(struct cfs_rq *cfs_rq, struct list_head *next) |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1790 | { |
Dhaval Giani | 354d60c | 2008-04-19 19:44:59 +0200 | [diff] [blame] | 1791 | struct task_struct *p = NULL; |
| 1792 | struct sched_entity *se; |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1793 | |
Mike Galbraith | 77ae651 | 2008-08-11 13:32:02 +0200 | [diff] [blame] | 1794 | if (next == &cfs_rq->tasks) |
| 1795 | return NULL; |
| 1796 | |
Bharata B Rao | b87f172 | 2008-09-25 09:53:54 +0530 | [diff] [blame] | 1797 | se = list_entry(next, struct sched_entity, group_node); |
| 1798 | p = task_of(se); |
| 1799 | cfs_rq->balance_iterator = next->next; |
Mike Galbraith | 77ae651 | 2008-08-11 13:32:02 +0200 | [diff] [blame] | 1800 | |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1801 | return p; |
| 1802 | } |
| 1803 | |
| 1804 | static struct task_struct *load_balance_start_fair(void *arg) |
| 1805 | { |
| 1806 | struct cfs_rq *cfs_rq = arg; |
| 1807 | |
Peter Zijlstra | 4a55bd5 | 2008-04-19 19:45:00 +0200 | [diff] [blame] | 1808 | return __load_balance_iterator(cfs_rq, cfs_rq->tasks.next); |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1809 | } |
| 1810 | |
| 1811 | static struct task_struct *load_balance_next_fair(void *arg) |
| 1812 | { |
| 1813 | struct cfs_rq *cfs_rq = arg; |
| 1814 | |
Peter Zijlstra | 4a55bd5 | 2008-04-19 19:45:00 +0200 | [diff] [blame] | 1815 | return __load_balance_iterator(cfs_rq, cfs_rq->balance_iterator); |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1816 | } |
| 1817 | |
Peter Zijlstra | c09595f | 2008-06-27 13:41:14 +0200 | [diff] [blame] | 1818 | static unsigned long |
| 1819 | __load_balance_fair(struct rq *this_rq, int this_cpu, struct rq *busiest, |
| 1820 | unsigned long max_load_move, struct sched_domain *sd, |
| 1821 | enum cpu_idle_type idle, int *all_pinned, int *this_best_prio, |
| 1822 | struct cfs_rq *cfs_rq) |
Peter Zijlstra | 62fb185 | 2008-02-25 17:34:02 +0100 | [diff] [blame] | 1823 | { |
Peter Zijlstra | c09595f | 2008-06-27 13:41:14 +0200 | [diff] [blame] | 1824 | struct rq_iterator cfs_rq_iterator; |
Ingo Molnar | 6363ca5 | 2008-05-29 11:28:57 +0200 | [diff] [blame] | 1825 | |
Peter Zijlstra | c09595f | 2008-06-27 13:41:14 +0200 | [diff] [blame] | 1826 | cfs_rq_iterator.start = load_balance_start_fair; |
| 1827 | cfs_rq_iterator.next = load_balance_next_fair; |
| 1828 | cfs_rq_iterator.arg = cfs_rq; |
Ingo Molnar | 6363ca5 | 2008-05-29 11:28:57 +0200 | [diff] [blame] | 1829 | |
Peter Zijlstra | c09595f | 2008-06-27 13:41:14 +0200 | [diff] [blame] | 1830 | return balance_tasks(this_rq, this_cpu, busiest, |
| 1831 | max_load_move, sd, idle, all_pinned, |
| 1832 | this_best_prio, &cfs_rq_iterator); |
Ingo Molnar | 6363ca5 | 2008-05-29 11:28:57 +0200 | [diff] [blame] | 1833 | } |
Ingo Molnar | 6363ca5 | 2008-05-29 11:28:57 +0200 | [diff] [blame] | 1834 | |
Peter Zijlstra | c09595f | 2008-06-27 13:41:14 +0200 | [diff] [blame] | 1835 | #ifdef CONFIG_FAIR_GROUP_SCHED |
Ingo Molnar | 6363ca5 | 2008-05-29 11:28:57 +0200 | [diff] [blame] | 1836 | static unsigned long |
| 1837 | load_balance_fair(struct rq *this_rq, int this_cpu, struct rq *busiest, |
| 1838 | unsigned long max_load_move, |
| 1839 | struct sched_domain *sd, enum cpu_idle_type idle, |
| 1840 | int *all_pinned, int *this_best_prio) |
| 1841 | { |
Ingo Molnar | 6363ca5 | 2008-05-29 11:28:57 +0200 | [diff] [blame] | 1842 | long rem_load_move = max_load_move; |
Peter Zijlstra | c09595f | 2008-06-27 13:41:14 +0200 | [diff] [blame] | 1843 | int busiest_cpu = cpu_of(busiest); |
| 1844 | struct task_group *tg; |
Peter Zijlstra | 62fb185 | 2008-02-25 17:34:02 +0100 | [diff] [blame] | 1845 | |
Peter Zijlstra | c09595f | 2008-06-27 13:41:14 +0200 | [diff] [blame] | 1846 | rcu_read_lock(); |
Peter Zijlstra | c8cba85 | 2008-06-27 13:41:23 +0200 | [diff] [blame] | 1847 | update_h_load(busiest_cpu); |
Peter Zijlstra | 62fb185 | 2008-02-25 17:34:02 +0100 | [diff] [blame] | 1848 | |
Chris Friesen | caea8a0 | 2008-09-22 11:06:09 -0600 | [diff] [blame] | 1849 | list_for_each_entry_rcu(tg, &task_groups, list) { |
Peter Zijlstra | c8cba85 | 2008-06-27 13:41:23 +0200 | [diff] [blame] | 1850 | struct cfs_rq *busiest_cfs_rq = tg->cfs_rq[busiest_cpu]; |
Peter Zijlstra | 42a3ac7 | 2008-06-27 13:41:29 +0200 | [diff] [blame] | 1851 | unsigned long busiest_h_load = busiest_cfs_rq->h_load; |
| 1852 | unsigned long busiest_weight = busiest_cfs_rq->load.weight; |
Srivatsa Vaddagiri | 243e0e7 | 2008-06-27 13:41:36 +0200 | [diff] [blame] | 1853 | u64 rem_load, moved_load; |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1854 | |
Peter Zijlstra | c09595f | 2008-06-27 13:41:14 +0200 | [diff] [blame] | 1855 | /* |
| 1856 | * empty group |
| 1857 | */ |
Peter Zijlstra | c8cba85 | 2008-06-27 13:41:23 +0200 | [diff] [blame] | 1858 | if (!busiest_cfs_rq->task_weight) |
Ingo Molnar | 6363ca5 | 2008-05-29 11:28:57 +0200 | [diff] [blame] | 1859 | continue; |
| 1860 | |
Srivatsa Vaddagiri | 243e0e7 | 2008-06-27 13:41:36 +0200 | [diff] [blame] | 1861 | rem_load = (u64)rem_load_move * busiest_weight; |
| 1862 | rem_load = div_u64(rem_load, busiest_h_load + 1); |
Ingo Molnar | 6363ca5 | 2008-05-29 11:28:57 +0200 | [diff] [blame] | 1863 | |
Peter Zijlstra | c09595f | 2008-06-27 13:41:14 +0200 | [diff] [blame] | 1864 | moved_load = __load_balance_fair(this_rq, this_cpu, busiest, |
Srivatsa Vaddagiri | 53fecd8 | 2008-06-27 13:41:20 +0200 | [diff] [blame] | 1865 | rem_load, sd, idle, all_pinned, this_best_prio, |
Peter Zijlstra | c09595f | 2008-06-27 13:41:14 +0200 | [diff] [blame] | 1866 | tg->cfs_rq[busiest_cpu]); |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1867 | |
Peter Zijlstra | c09595f | 2008-06-27 13:41:14 +0200 | [diff] [blame] | 1868 | if (!moved_load) |
| 1869 | continue; |
| 1870 | |
Peter Zijlstra | 42a3ac7 | 2008-06-27 13:41:29 +0200 | [diff] [blame] | 1871 | moved_load *= busiest_h_load; |
Srivatsa Vaddagiri | 243e0e7 | 2008-06-27 13:41:36 +0200 | [diff] [blame] | 1872 | moved_load = div_u64(moved_load, busiest_weight + 1); |
Peter Zijlstra | c09595f | 2008-06-27 13:41:14 +0200 | [diff] [blame] | 1873 | |
| 1874 | rem_load_move -= moved_load; |
| 1875 | if (rem_load_move < 0) |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1876 | break; |
| 1877 | } |
Peter Zijlstra | c09595f | 2008-06-27 13:41:14 +0200 | [diff] [blame] | 1878 | rcu_read_unlock(); |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1879 | |
Peter Williams | 4301065 | 2007-08-09 11:16:46 +0200 | [diff] [blame] | 1880 | return max_load_move - rem_load_move; |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1881 | } |
Peter Zijlstra | c09595f | 2008-06-27 13:41:14 +0200 | [diff] [blame] | 1882 | #else |
| 1883 | static unsigned long |
| 1884 | load_balance_fair(struct rq *this_rq, int this_cpu, struct rq *busiest, |
| 1885 | unsigned long max_load_move, |
| 1886 | struct sched_domain *sd, enum cpu_idle_type idle, |
| 1887 | int *all_pinned, int *this_best_prio) |
| 1888 | { |
| 1889 | return __load_balance_fair(this_rq, this_cpu, busiest, |
| 1890 | max_load_move, sd, idle, all_pinned, |
| 1891 | this_best_prio, &busiest->cfs); |
| 1892 | } |
| 1893 | #endif |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1894 | |
Peter Williams | e1d1484 | 2007-10-24 18:23:51 +0200 | [diff] [blame] | 1895 | static int |
| 1896 | move_one_task_fair(struct rq *this_rq, int this_cpu, struct rq *busiest, |
| 1897 | struct sched_domain *sd, enum cpu_idle_type idle) |
| 1898 | { |
| 1899 | struct cfs_rq *busy_cfs_rq; |
| 1900 | struct rq_iterator cfs_rq_iterator; |
| 1901 | |
| 1902 | cfs_rq_iterator.start = load_balance_start_fair; |
| 1903 | cfs_rq_iterator.next = load_balance_next_fair; |
| 1904 | |
| 1905 | for_each_leaf_cfs_rq(busiest, busy_cfs_rq) { |
| 1906 | /* |
| 1907 | * pass busy_cfs_rq argument into |
| 1908 | * load_balance_[start|next]_fair iterators |
| 1909 | */ |
| 1910 | cfs_rq_iterator.arg = busy_cfs_rq; |
| 1911 | if (iter_move_one_task(this_rq, this_cpu, busiest, sd, idle, |
| 1912 | &cfs_rq_iterator)) |
| 1913 | return 1; |
| 1914 | } |
| 1915 | |
| 1916 | return 0; |
| 1917 | } |
Christian Ehrhardt | 0bcdcf2 | 2009-11-30 12:16:46 +0100 | [diff] [blame] | 1918 | |
| 1919 | static void rq_online_fair(struct rq *rq) |
| 1920 | { |
| 1921 | update_sysctl(); |
| 1922 | } |
| 1923 | |
| 1924 | static void rq_offline_fair(struct rq *rq) |
| 1925 | { |
| 1926 | update_sysctl(); |
| 1927 | } |
| 1928 | |
Dhaval Giani | 55e12e5 | 2008-06-24 23:39:43 +0530 | [diff] [blame] | 1929 | #endif /* CONFIG_SMP */ |
Peter Williams | e1d1484 | 2007-10-24 18:23:51 +0200 | [diff] [blame] | 1930 | |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1931 | /* |
| 1932 | * scheduler tick hitting a task of our scheduling class: |
| 1933 | */ |
Peter Zijlstra | 8f4d37e | 2008-01-25 21:08:29 +0100 | [diff] [blame] | 1934 | static void task_tick_fair(struct rq *rq, struct task_struct *curr, int queued) |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1935 | { |
| 1936 | struct cfs_rq *cfs_rq; |
| 1937 | struct sched_entity *se = &curr->se; |
| 1938 | |
| 1939 | for_each_sched_entity(se) { |
| 1940 | cfs_rq = cfs_rq_of(se); |
Peter Zijlstra | 8f4d37e | 2008-01-25 21:08:29 +0100 | [diff] [blame] | 1941 | entity_tick(cfs_rq, se, queued); |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1942 | } |
| 1943 | } |
| 1944 | |
| 1945 | /* |
Peter Zijlstra | cd29fe6 | 2009-11-27 17:32:46 +0100 | [diff] [blame] | 1946 | * called on fork with the child task as argument from the parent's context |
| 1947 | * - child not yet on the tasklist |
| 1948 | * - preemption disabled |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1949 | */ |
Peter Zijlstra | cd29fe6 | 2009-11-27 17:32:46 +0100 | [diff] [blame] | 1950 | static void task_fork_fair(struct task_struct *p) |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1951 | { |
Peter Zijlstra | cd29fe6 | 2009-11-27 17:32:46 +0100 | [diff] [blame] | 1952 | struct cfs_rq *cfs_rq = task_cfs_rq(current); |
Ingo Molnar | 429d43b | 2007-10-15 17:00:03 +0200 | [diff] [blame] | 1953 | struct sched_entity *se = &p->se, *curr = cfs_rq->curr; |
Ingo Molnar | 00bf7bf | 2007-10-15 17:00:14 +0200 | [diff] [blame] | 1954 | int this_cpu = smp_processor_id(); |
Peter Zijlstra | cd29fe6 | 2009-11-27 17:32:46 +0100 | [diff] [blame] | 1955 | struct rq *rq = this_rq(); |
| 1956 | unsigned long flags; |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1957 | |
Thomas Gleixner | 05fa785 | 2009-11-17 14:28:38 +0100 | [diff] [blame] | 1958 | raw_spin_lock_irqsave(&rq->lock, flags); |
Peter Zijlstra | cd29fe6 | 2009-11-27 17:32:46 +0100 | [diff] [blame] | 1959 | |
| 1960 | if (unlikely(task_cpu(p) != this_cpu)) |
| 1961 | __set_task_cpu(p, this_cpu); |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1962 | |
Ting Yang | 7109c442 | 2007-08-28 12:53:24 +0200 | [diff] [blame] | 1963 | update_curr(cfs_rq); |
Peter Zijlstra | cd29fe6 | 2009-11-27 17:32:46 +0100 | [diff] [blame] | 1964 | |
Mike Galbraith | b5d9d73 | 2009-09-08 11:12:28 +0200 | [diff] [blame] | 1965 | if (curr) |
| 1966 | se->vruntime = curr->vruntime; |
Peter Zijlstra | aeb73b0 | 2007-10-15 17:00:05 +0200 | [diff] [blame] | 1967 | place_entity(cfs_rq, se, 1); |
Peter Zijlstra | 4d78e7b | 2007-10-15 17:00:04 +0200 | [diff] [blame] | 1968 | |
Peter Zijlstra | cd29fe6 | 2009-11-27 17:32:46 +0100 | [diff] [blame] | 1969 | if (sysctl_sched_child_runs_first && curr && entity_before(curr, se)) { |
Dmitry Adamushko | 87fefa3 | 2007-10-15 17:00:08 +0200 | [diff] [blame] | 1970 | /* |
Ingo Molnar | edcb60a | 2007-10-15 17:00:08 +0200 | [diff] [blame] | 1971 | * Upon rescheduling, sched_class::put_prev_task() will place |
| 1972 | * 'current' within the tree based on its new key value. |
| 1973 | */ |
Peter Zijlstra | 4d78e7b | 2007-10-15 17:00:04 +0200 | [diff] [blame] | 1974 | swap(curr->vruntime, se->vruntime); |
Bharata B Rao | aec0a51 | 2008-08-28 14:42:49 +0530 | [diff] [blame] | 1975 | resched_task(rq->curr); |
Peter Zijlstra | 4d78e7b | 2007-10-15 17:00:04 +0200 | [diff] [blame] | 1976 | } |
| 1977 | |
Thomas Gleixner | 05fa785 | 2009-11-17 14:28:38 +0100 | [diff] [blame] | 1978 | raw_spin_unlock_irqrestore(&rq->lock, flags); |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1979 | } |
| 1980 | |
Steven Rostedt | cb46984 | 2008-01-25 21:08:22 +0100 | [diff] [blame] | 1981 | /* |
| 1982 | * Priority of the task has changed. Check to see if we preempt |
| 1983 | * the current task. |
| 1984 | */ |
| 1985 | static void prio_changed_fair(struct rq *rq, struct task_struct *p, |
| 1986 | int oldprio, int running) |
| 1987 | { |
| 1988 | /* |
| 1989 | * Reschedule if we are currently running on this runqueue and |
| 1990 | * our priority decreased, or if we are not currently running on |
| 1991 | * this runqueue and our priority is higher than the current's |
| 1992 | */ |
| 1993 | if (running) { |
| 1994 | if (p->prio > oldprio) |
| 1995 | resched_task(rq->curr); |
| 1996 | } else |
Peter Zijlstra | 15afe09 | 2008-09-20 23:38:02 +0200 | [diff] [blame] | 1997 | check_preempt_curr(rq, p, 0); |
Steven Rostedt | cb46984 | 2008-01-25 21:08:22 +0100 | [diff] [blame] | 1998 | } |
| 1999 | |
| 2000 | /* |
| 2001 | * We switched to the sched_fair class. |
| 2002 | */ |
| 2003 | static void switched_to_fair(struct rq *rq, struct task_struct *p, |
| 2004 | int running) |
| 2005 | { |
| 2006 | /* |
| 2007 | * We were most likely switched from sched_rt, so |
| 2008 | * kick off the schedule if running, otherwise just see |
| 2009 | * if we can still preempt the current task. |
| 2010 | */ |
| 2011 | if (running) |
| 2012 | resched_task(rq->curr); |
| 2013 | else |
Peter Zijlstra | 15afe09 | 2008-09-20 23:38:02 +0200 | [diff] [blame] | 2014 | check_preempt_curr(rq, p, 0); |
Steven Rostedt | cb46984 | 2008-01-25 21:08:22 +0100 | [diff] [blame] | 2015 | } |
| 2016 | |
Srivatsa Vaddagiri | 83b699e | 2007-10-15 17:00:08 +0200 | [diff] [blame] | 2017 | /* Account for a task changing its policy or group. |
| 2018 | * |
| 2019 | * This routine is mostly called to set cfs_rq->curr field when a task |
| 2020 | * migrates between groups/classes. |
| 2021 | */ |
| 2022 | static void set_curr_task_fair(struct rq *rq) |
| 2023 | { |
| 2024 | struct sched_entity *se = &rq->curr->se; |
| 2025 | |
| 2026 | for_each_sched_entity(se) |
| 2027 | set_next_entity(cfs_rq_of(se), se); |
| 2028 | } |
| 2029 | |
Peter Zijlstra | 810b381 | 2008-02-29 15:21:01 -0500 | [diff] [blame] | 2030 | #ifdef CONFIG_FAIR_GROUP_SCHED |
| 2031 | static void moved_group_fair(struct task_struct *p) |
| 2032 | { |
| 2033 | struct cfs_rq *cfs_rq = task_cfs_rq(p); |
| 2034 | |
| 2035 | update_curr(cfs_rq); |
| 2036 | place_entity(cfs_rq, &p->se, 1); |
| 2037 | } |
| 2038 | #endif |
| 2039 | |
Thomas Gleixner | dba091b | 2009-12-09 09:32:03 +0100 | [diff] [blame] | 2040 | unsigned int get_rr_interval_fair(struct rq *rq, struct task_struct *task) |
Peter Williams | 0d721ce | 2009-09-21 01:31:53 +0000 | [diff] [blame] | 2041 | { |
| 2042 | struct sched_entity *se = &task->se; |
Peter Williams | 0d721ce | 2009-09-21 01:31:53 +0000 | [diff] [blame] | 2043 | unsigned int rr_interval = 0; |
| 2044 | |
| 2045 | /* |
| 2046 | * Time slice is 0 for SCHED_OTHER tasks that are on an otherwise |
| 2047 | * idle runqueue: |
| 2048 | */ |
Peter Williams | 0d721ce | 2009-09-21 01:31:53 +0000 | [diff] [blame] | 2049 | if (rq->cfs.load.weight) |
| 2050 | rr_interval = NS_TO_JIFFIES(sched_slice(&rq->cfs, se)); |
Peter Williams | 0d721ce | 2009-09-21 01:31:53 +0000 | [diff] [blame] | 2051 | |
| 2052 | return rr_interval; |
| 2053 | } |
| 2054 | |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 2055 | /* |
| 2056 | * All the scheduling class methods: |
| 2057 | */ |
Ingo Molnar | 5522d5d | 2007-10-15 17:00:12 +0200 | [diff] [blame] | 2058 | static const struct sched_class fair_sched_class = { |
| 2059 | .next = &idle_sched_class, |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 2060 | .enqueue_task = enqueue_task_fair, |
| 2061 | .dequeue_task = dequeue_task_fair, |
| 2062 | .yield_task = yield_task_fair, |
| 2063 | |
Ingo Molnar | 2e09bf5 | 2007-10-15 17:00:05 +0200 | [diff] [blame] | 2064 | .check_preempt_curr = check_preempt_wakeup, |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 2065 | |
| 2066 | .pick_next_task = pick_next_task_fair, |
| 2067 | .put_prev_task = put_prev_task_fair, |
| 2068 | |
Peter Williams | 681f3e6 | 2007-10-24 18:23:51 +0200 | [diff] [blame] | 2069 | #ifdef CONFIG_SMP |
Li Zefan | 4ce72a2 | 2008-10-22 15:25:26 +0800 | [diff] [blame] | 2070 | .select_task_rq = select_task_rq_fair, |
| 2071 | |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 2072 | .load_balance = load_balance_fair, |
Peter Williams | e1d1484 | 2007-10-24 18:23:51 +0200 | [diff] [blame] | 2073 | .move_one_task = move_one_task_fair, |
Christian Ehrhardt | 0bcdcf2 | 2009-11-30 12:16:46 +0100 | [diff] [blame] | 2074 | .rq_online = rq_online_fair, |
| 2075 | .rq_offline = rq_offline_fair, |
Peter Williams | 681f3e6 | 2007-10-24 18:23:51 +0200 | [diff] [blame] | 2076 | #endif |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 2077 | |
Srivatsa Vaddagiri | 83b699e | 2007-10-15 17:00:08 +0200 | [diff] [blame] | 2078 | .set_curr_task = set_curr_task_fair, |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 2079 | .task_tick = task_tick_fair, |
Peter Zijlstra | cd29fe6 | 2009-11-27 17:32:46 +0100 | [diff] [blame] | 2080 | .task_fork = task_fork_fair, |
Steven Rostedt | cb46984 | 2008-01-25 21:08:22 +0100 | [diff] [blame] | 2081 | |
| 2082 | .prio_changed = prio_changed_fair, |
| 2083 | .switched_to = switched_to_fair, |
Peter Zijlstra | 810b381 | 2008-02-29 15:21:01 -0500 | [diff] [blame] | 2084 | |
Peter Williams | 0d721ce | 2009-09-21 01:31:53 +0000 | [diff] [blame] | 2085 | .get_rr_interval = get_rr_interval_fair, |
| 2086 | |
Peter Zijlstra | 810b381 | 2008-02-29 15:21:01 -0500 | [diff] [blame] | 2087 | #ifdef CONFIG_FAIR_GROUP_SCHED |
| 2088 | .moved_group = moved_group_fair, |
| 2089 | #endif |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 2090 | }; |
| 2091 | |
| 2092 | #ifdef CONFIG_SCHED_DEBUG |
Ingo Molnar | 5cef9ec | 2007-08-09 11:16:47 +0200 | [diff] [blame] | 2093 | static void print_cfs_stats(struct seq_file *m, int cpu) |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 2094 | { |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 2095 | struct cfs_rq *cfs_rq; |
| 2096 | |
Peter Zijlstra | 5973e5b | 2008-01-25 21:08:34 +0100 | [diff] [blame] | 2097 | rcu_read_lock(); |
Ingo Molnar | c3b64f1 | 2007-08-09 11:16:51 +0200 | [diff] [blame] | 2098 | for_each_leaf_cfs_rq(cpu_rq(cpu), cfs_rq) |
Ingo Molnar | 5cef9ec | 2007-08-09 11:16:47 +0200 | [diff] [blame] | 2099 | print_cfs_rq(m, cpu, cfs_rq); |
Peter Zijlstra | 5973e5b | 2008-01-25 21:08:34 +0100 | [diff] [blame] | 2100 | rcu_read_unlock(); |
Ingo Molnar | bf0f6f2 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 2101 | } |
| 2102 | #endif |