diff options
Diffstat (limited to 'kernel/sched_rt.c')
| -rw-r--r-- | kernel/sched_rt.c | 537 |
1 files changed, 374 insertions, 163 deletions
diff --git a/kernel/sched_rt.c b/kernel/sched_rt.c index da932f4c852..299d012b439 100644 --- a/kernel/sched_rt.c +++ b/kernel/sched_rt.c | |||
| @@ -3,6 +3,40 @@ | |||
| 3 | * policies) | 3 | * policies) |
| 4 | */ | 4 | */ |
| 5 | 5 | ||
| 6 | static inline struct task_struct *rt_task_of(struct sched_rt_entity *rt_se) | ||
| 7 | { | ||
| 8 | return container_of(rt_se, struct task_struct, rt); | ||
| 9 | } | ||
| 10 | |||
| 11 | #ifdef CONFIG_RT_GROUP_SCHED | ||
| 12 | |||
| 13 | static inline struct rq *rq_of_rt_rq(struct rt_rq *rt_rq) | ||
| 14 | { | ||
| 15 | return rt_rq->rq; | ||
| 16 | } | ||
| 17 | |||
| 18 | static inline struct rt_rq *rt_rq_of_se(struct sched_rt_entity *rt_se) | ||
| 19 | { | ||
| 20 | return rt_se->rt_rq; | ||
| 21 | } | ||
| 22 | |||
| 23 | #else /* CONFIG_RT_GROUP_SCHED */ | ||
| 24 | |||
| 25 | static inline struct rq *rq_of_rt_rq(struct rt_rq *rt_rq) | ||
| 26 | { | ||
| 27 | return container_of(rt_rq, struct rq, rt); | ||
| 28 | } | ||
| 29 | |||
| 30 | static inline struct rt_rq *rt_rq_of_se(struct sched_rt_entity *rt_se) | ||
| 31 | { | ||
| 32 | struct task_struct *p = rt_task_of(rt_se); | ||
| 33 | struct rq *rq = task_rq(p); | ||
| 34 | |||
| 35 | return &rq->rt; | ||
| 36 | } | ||
| 37 | |||
| 38 | #endif /* CONFIG_RT_GROUP_SCHED */ | ||
| 39 | |||
| 6 | #ifdef CONFIG_SMP | 40 | #ifdef CONFIG_SMP |
| 7 | 41 | ||
| 8 | static inline int rt_overloaded(struct rq *rq) | 42 | static inline int rt_overloaded(struct rq *rq) |
| @@ -37,25 +71,69 @@ static inline void rt_clear_overload(struct rq *rq) | |||
| 37 | cpumask_clear_cpu(rq->cpu, rq->rd->rto_mask); | 71 | cpumask_clear_cpu(rq->cpu, rq->rd->rto_mask); |
| 38 | } | 72 | } |
| 39 | 73 | ||
| 40 | static void update_rt_migration(struct rq *rq) | 74 | static void update_rt_migration(struct rt_rq *rt_rq) |
| 41 | { | 75 | { |
| 42 | if (rq->rt.rt_nr_migratory && (rq->rt.rt_nr_running > 1)) { | 76 | if (rt_rq->rt_nr_migratory && (rt_rq->rt_nr_running > 1)) { |
| 43 | if (!rq->rt.overloaded) { | 77 | if (!rt_rq->overloaded) { |
| 44 | rt_set_overload(rq); | 78 | rt_set_overload(rq_of_rt_rq(rt_rq)); |
| 45 | rq->rt.overloaded = 1; | 79 | rt_rq->overloaded = 1; |
| 46 | } | 80 | } |
| 47 | } else if (rq->rt.overloaded) { | 81 | } else if (rt_rq->overloaded) { |
| 48 | rt_clear_overload(rq); | 82 | rt_clear_overload(rq_of_rt_rq(rt_rq)); |
| 49 | rq->rt.overloaded = 0; | 83 | rt_rq->overloaded = 0; |
| 50 | } | 84 | } |
| 51 | } | 85 | } |
| 52 | #endif /* CONFIG_SMP */ | ||
| 53 | 86 | ||
| 54 | static inline struct task_struct *rt_task_of(struct sched_rt_entity *rt_se) | 87 | static void inc_rt_migration(struct sched_rt_entity *rt_se, struct rt_rq *rt_rq) |
| 88 | { | ||
| 89 | if (rt_se->nr_cpus_allowed > 1) | ||
| 90 | rt_rq->rt_nr_migratory++; | ||
| 91 | |||
| 92 | update_rt_migration(rt_rq); | ||
| 93 | } | ||
| 94 | |||
| 95 | static void dec_rt_migration(struct sched_rt_entity *rt_se, struct rt_rq *rt_rq) | ||
| 96 | { | ||
| 97 | if (rt_se->nr_cpus_allowed > 1) | ||
| 98 | rt_rq->rt_nr_migratory--; | ||
| 99 | |||
| 100 | update_rt_migration(rt_rq); | ||
| 101 | } | ||
| 102 | |||
| 103 | static void enqueue_pushable_task(struct rq *rq, struct task_struct *p) | ||
| 104 | { | ||
| 105 | plist_del(&p->pushable_tasks, &rq->rt.pushable_tasks); | ||
| 106 | plist_node_init(&p->pushable_tasks, p->prio); | ||
| 107 | plist_add(&p->pushable_tasks, &rq->rt.pushable_tasks); | ||
| 108 | } | ||
| 109 | |||
| 110 | static void dequeue_pushable_task(struct rq *rq, struct task_struct *p) | ||
| 111 | { | ||
| 112 | plist_del(&p->pushable_tasks, &rq->rt.pushable_tasks); | ||
| 113 | } | ||
| 114 | |||
| 115 | #else | ||
| 116 | |||
| 117 | static inline void enqueue_pushable_task(struct rq *rq, struct task_struct *p) | ||
| 55 | { | 118 | { |
| 56 | return container_of(rt_se, struct task_struct, rt); | ||
| 57 | } | 119 | } |
| 58 | 120 | ||
| 121 | static inline void dequeue_pushable_task(struct rq *rq, struct task_struct *p) | ||
| 122 | { | ||
| 123 | } | ||
| 124 | |||
| 125 | static inline | ||
| 126 | void inc_rt_migration(struct sched_rt_entity *rt_se, struct rt_rq *rt_rq) | ||
| 127 | { | ||
| 128 | } | ||
| 129 | |||
| 130 | static inline | ||
| 131 | void dec_rt_migration(struct sched_rt_entity *rt_se, struct rt_rq *rt_rq) | ||
| 132 | { | ||
| 133 | } | ||
| 134 | |||
| 135 | #endif /* CONFIG_SMP */ | ||
| 136 | |||
| 59 | static inline int on_rt_rq(struct sched_rt_entity *rt_se) | 137 | static inline int on_rt_rq(struct sched_rt_entity *rt_se) |
| 60 | { | 138 | { |
| 61 | return !list_empty(&rt_se->run_list); | 139 | return !list_empty(&rt_se->run_list); |
| @@ -79,16 +157,6 @@ static inline u64 sched_rt_period(struct rt_rq *rt_rq) | |||
| 79 | #define for_each_leaf_rt_rq(rt_rq, rq) \ | 157 | #define for_each_leaf_rt_rq(rt_rq, rq) \ |
| 80 | list_for_each_entry_rcu(rt_rq, &rq->leaf_rt_rq_list, leaf_rt_rq_list) | 158 | list_for_each_entry_rcu(rt_rq, &rq->leaf_rt_rq_list, leaf_rt_rq_list) |
| 81 | 159 | ||
| 82 | static inline struct rq *rq_of_rt_rq(struct rt_rq *rt_rq) | ||
| 83 | { | ||
| 84 | return rt_rq->rq; | ||
| 85 | } | ||
| 86 | |||
| 87 | static inline struct rt_rq *rt_rq_of_se(struct sched_rt_entity *rt_se) | ||
| 88 | { | ||
| 89 | return rt_se->rt_rq; | ||
| 90 | } | ||
| 91 | |||
| 92 | #define for_each_sched_rt_entity(rt_se) \ | 160 | #define for_each_sched_rt_entity(rt_se) \ |
| 93 | for (; rt_se; rt_se = rt_se->parent) | 161 | for (; rt_se; rt_se = rt_se->parent) |
| 94 | 162 | ||
| @@ -108,7 +176,7 @@ static void sched_rt_rq_enqueue(struct rt_rq *rt_rq) | |||
| 108 | if (rt_rq->rt_nr_running) { | 176 | if (rt_rq->rt_nr_running) { |
| 109 | if (rt_se && !on_rt_rq(rt_se)) | 177 | if (rt_se && !on_rt_rq(rt_se)) |
| 110 | enqueue_rt_entity(rt_se); | 178 | enqueue_rt_entity(rt_se); |
| 111 | if (rt_rq->highest_prio < curr->prio) | 179 | if (rt_rq->highest_prio.curr < curr->prio) |
| 112 | resched_task(curr); | 180 | resched_task(curr); |
| 113 | } | 181 | } |
| 114 | } | 182 | } |
| @@ -176,19 +244,6 @@ static inline u64 sched_rt_period(struct rt_rq *rt_rq) | |||
| 176 | #define for_each_leaf_rt_rq(rt_rq, rq) \ | 244 | #define for_each_leaf_rt_rq(rt_rq, rq) \ |
| 177 | for (rt_rq = &rq->rt; rt_rq; rt_rq = NULL) | 245 | for (rt_rq = &rq->rt; rt_rq; rt_rq = NULL) |
| 178 | 246 | ||
| 179 | static inline struct rq *rq_of_rt_rq(struct rt_rq *rt_rq) | ||
| 180 | { | ||
| 181 | return container_of(rt_rq, struct rq, rt); | ||
| 182 | } | ||
| 183 | |||
| 184 | static inline struct rt_rq *rt_rq_of_se(struct sched_rt_entity *rt_se) | ||
| 185 | { | ||
| 186 | struct task_struct *p = rt_task_of(rt_se); | ||
| 187 | struct rq *rq = task_rq(p); | ||
| 188 | |||
| 189 | return &rq->rt; | ||
| 190 | } | ||
| 191 | |||
| 192 | #define for_each_sched_rt_entity(rt_se) \ | 247 | #define for_each_sched_rt_entity(rt_se) \ |
| 193 | for (; rt_se; rt_se = NULL) | 248 | for (; rt_se; rt_se = NULL) |
| 194 | 249 | ||
| @@ -473,7 +528,7 @@ static inline int rt_se_prio(struct sched_rt_entity *rt_se) | |||
| 473 | struct rt_rq *rt_rq = group_rt_rq(rt_se); | 528 | struct rt_rq *rt_rq = group_rt_rq(rt_se); |
| 474 | 529 | ||
| 475 | if (rt_rq) | 530 | if (rt_rq) |
| 476 | return rt_rq->highest_prio; | 531 | return rt_rq->highest_prio.curr; |
| 477 | #endif | 532 | #endif |
| 478 | 533 | ||
| 479 | return rt_task_of(rt_se)->prio; | 534 | return rt_task_of(rt_se)->prio; |
| @@ -547,91 +602,174 @@ static void update_curr_rt(struct rq *rq) | |||
| 547 | } | 602 | } |
| 548 | } | 603 | } |
| 549 | 604 | ||
| 550 | static inline | 605 | #if defined CONFIG_SMP |
| 551 | void inc_rt_tasks(struct sched_rt_entity *rt_se, struct rt_rq *rt_rq) | 606 | |
| 607 | static struct task_struct *pick_next_highest_task_rt(struct rq *rq, int cpu); | ||
| 608 | |||
| 609 | static inline int next_prio(struct rq *rq) | ||
| 552 | { | 610 | { |
| 553 | WARN_ON(!rt_prio(rt_se_prio(rt_se))); | 611 | struct task_struct *next = pick_next_highest_task_rt(rq, rq->cpu); |
| 554 | rt_rq->rt_nr_running++; | 612 | |
| 555 | #if defined CONFIG_SMP || defined CONFIG_RT_GROUP_SCHED | 613 | if (next && rt_prio(next->prio)) |
| 556 | if (rt_se_prio(rt_se) < rt_rq->highest_prio) { | 614 | return next->prio; |
| 557 | #ifdef CONFIG_SMP | 615 | else |
| 558 | struct rq *rq = rq_of_rt_rq(rt_rq); | 616 | return MAX_RT_PRIO; |
| 559 | #endif | 617 | } |
| 618 | |||
| 619 | static void | ||
| 620 | inc_rt_prio_smp(struct rt_rq *rt_rq, int prio, int prev_prio) | ||
| 621 | { | ||
| 622 | struct rq *rq = rq_of_rt_rq(rt_rq); | ||
| 623 | |||
