提交 49246274 编写于 作者: P Peter Zijlstra 提交者: Ingo Molnar

sched: Unindent labels

Labels should be on column 0.
Signed-off-by: NPeter Zijlstra <a.p.zijlstra@chello.nl>
LKML-Reference: <new-submission>
Signed-off-by: NIngo Molnar <mingo@elte.hu>
上级 864616ee
......@@ -4891,7 +4891,7 @@ long sched_setaffinity(pid_t pid, const struct cpumask *in_mask)
cpuset_cpus_allowed(p, cpus_allowed);
cpumask_and(new_mask, in_mask, cpus_allowed);
again:
again:
retval = set_cpus_allowed_ptr(p, new_mask);
if (!retval) {
......@@ -8141,9 +8141,9 @@ int alloc_fair_sched_group(struct task_group *tg, struct task_group *parent)
return 1;
err_free_rq:
err_free_rq:
kfree(cfs_rq);
err:
err:
return 0;
}
......@@ -8231,9 +8231,9 @@ int alloc_rt_sched_group(struct task_group *tg, struct task_group *parent)
return 1;
err_free_rq:
err_free_rq:
kfree(rt_rq);
err:
err:
return 0;
}
......@@ -8591,7 +8591,7 @@ static int tg_set_bandwidth(struct task_group *tg,
raw_spin_unlock(&rt_rq->rt_runtime_lock);
}
raw_spin_unlock_irq(&tg->rt_bandwidth.rt_runtime_lock);
unlock:
unlock:
read_unlock(&tasklist_lock);
mutex_unlock(&rt_constraints_mutex);
......
......@@ -1140,7 +1140,7 @@ static struct task_struct *pick_next_highest_task_rt(struct rq *rq, int cpu)
for_each_leaf_rt_rq(rt_rq, rq) {
array = &rt_rq->active;
idx = sched_find_first_bit(array->bitmap);
next_idx:
next_idx:
if (idx >= MAX_RT_PRIO)
continue;
if (next && next->prio < idx)
......@@ -1316,7 +1316,7 @@ static int push_rt_task(struct rq *rq)
if (!next_task)
return 0;
retry:
retry:
if (unlikely(next_task == rq->curr)) {
WARN_ON(1);
return 0;
......@@ -1464,7 +1464,7 @@ static int pull_rt_task(struct rq *this_rq)
* but possible)
*/
}
skip:
skip:
double_unlock_balance(this_rq, src_rq);
}
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册