4 * Kernel scheduler and related syscalls
6 * Copyright (C) 1991-2002 Linus Torvalds
8 * 1996-12-23 Modified by Dave Grothe to fix bugs in semaphores and
9 * make semaphores SMP safe
10 * 1998-11-19 Implemented schedule_timeout() and related stuff
12 * 2002-01-04 New ultra-scalable O(1) scheduler by Ingo Molnar:
13 * hybrid priority-list and round-robin design with
14 * an array-switch method of distributing timeslices
15 * and per-CPU runqueues. Cleanups and useful suggestions
16 * by Davide Libenzi, preemptible kernel bits by Robert Love.
17 * 2003-09-03 Interactivity tuning by Con Kolivas.
18 * 2004-04-02 Scheduler domains code by Nick Piggin
22 #include <linux/module.h>
23 #include <linux/nmi.h>
24 #include <linux/init.h>
25 #include <asm/uaccess.h>
26 #include <linux/highmem.h>
27 #include <linux/smp_lock.h>
28 #include <linux/pagemap.h>
29 #include <asm/mmu_context.h>
30 #include <linux/interrupt.h>
31 #include <linux/completion.h>
32 #include <linux/kernel_stat.h>
33 #include <linux/security.h>
34 #include <linux/notifier.h>
35 #include <linux/suspend.h>
36 #include <linux/blkdev.h>
37 #include <linux/delay.h>
38 #include <linux/smp.h>
39 #include <linux/timer.h>
40 #include <linux/rcupdate.h>
41 #include <linux/cpu.h>
42 #include <linux/percpu.h>
43 #include <linux/kthread.h>
45 #include <asm/unistd.h>
48 #define cpu_to_node_mask(cpu) node_to_cpumask(cpu_to_node(cpu))
50 #define cpu_to_node_mask(cpu) (cpu_online_map)
54 * Convert user-nice values [ -20 ... 0 ... 19 ]
55 * to static priority [ MAX_RT_PRIO..MAX_PRIO-1 ],
58 #define NICE_TO_PRIO(nice) (MAX_RT_PRIO + (nice) + 20)
59 #define PRIO_TO_NICE(prio) ((prio) - MAX_RT_PRIO - 20)
60 #define TASK_NICE(p) PRIO_TO_NICE((p)->static_prio)
63 * 'User priority' is the nice value converted to something we
64 * can work with better when scaling various scheduler parameters,
65 * it's a [ 0 ... 39 ] range.
67 #define USER_PRIO(p) ((p)-MAX_RT_PRIO)
68 #define TASK_USER_PRIO(p) USER_PRIO((p)->static_prio)
69 #define MAX_USER_PRIO (USER_PRIO(MAX_PRIO))
70 #define AVG_TIMESLICE (MIN_TIMESLICE + ((MAX_TIMESLICE - MIN_TIMESLICE) *\
71 (MAX_PRIO-1-NICE_TO_PRIO(0))/(MAX_USER_PRIO - 1)))
74 * Some helpers for converting nanosecond timing to jiffy resolution
76 #define NS_TO_JIFFIES(TIME) ((TIME) / (1000000000 / HZ))
77 #define JIFFIES_TO_NS(TIME) ((TIME) * (1000000000 / HZ))
80 * These are the 'tuning knobs' of the scheduler:
82 * Minimum timeslice is 10 msecs, default timeslice is 100 msecs,
83 * maximum timeslice is 200 msecs. Timeslices get refilled after
86 #define MIN_TIMESLICE ( 10 * HZ / 1000)
87 #define MAX_TIMESLICE (200 * HZ / 1000)
88 #define ON_RUNQUEUE_WEIGHT 30
89 #define CHILD_PENALTY 95
90 #define PARENT_PENALTY 100
92 #define PRIO_BONUS_RATIO 25
93 #define MAX_BONUS (MAX_USER_PRIO * PRIO_BONUS_RATIO / 100)
94 #define INTERACTIVE_DELTA 2
95 #define MAX_SLEEP_AVG (AVG_TIMESLICE * MAX_BONUS)
96 #define STARVATION_LIMIT (MAX_SLEEP_AVG)
97 #define NS_MAX_SLEEP_AVG (JIFFIES_TO_NS(MAX_SLEEP_AVG))
98 #define CREDIT_LIMIT 100
101 * If a task is 'interactive' then we reinsert it in the active
102 * array after it has expired its current timeslice. (it will not
103 * continue to run immediately, it will still roundrobin with
104 * other interactive tasks.)
106 * This part scales the interactivity limit depending on niceness.
108 * We scale it linearly, offset by the INTERACTIVE_DELTA delta.
109 * Here are a few examples of different nice levels:
111 * TASK_INTERACTIVE(-20): [1,1,1,1,1,1,1,1,1,0,0]
112 * TASK_INTERACTIVE(-10): [1,1,1,1,1,1,1,0,0,0,0]
113 * TASK_INTERACTIVE( 0): [1,1,1,1,0,0,0,0,0,0,0]
114 * TASK_INTERACTIVE( 10): [1,1,0,0,0,0,0,0,0,0,0]
115 * TASK_INTERACTIVE( 19): [0,0,0,0,0,0,0,0,0,0,0]
117 * (the X axis represents the possible -5 ... 0 ... +5 dynamic
118 * priority range a task can explore, a value of '1' means the
119 * task is rated interactive.)
121 * Ie. nice +19 tasks can never get 'interactive' enough to be
122 * reinserted into the active array. And only heavily CPU-hog nice -20
123 * tasks will be expired. Default nice 0 tasks are somewhere between,
124 * it takes some effort for them to get interactive, but it's not
128 #define CURRENT_BONUS(p) \
129 (NS_TO_JIFFIES((p)->sleep_avg) * MAX_BONUS / \
133 #define TIMESLICE_GRANULARITY(p) (MIN_TIMESLICE * \
134 (1 << (((MAX_BONUS - CURRENT_BONUS(p)) ? : 1) - 1)) * \
137 #define TIMESLICE_GRANULARITY(p) (MIN_TIMESLICE * \
138 (1 << (((MAX_BONUS - CURRENT_BONUS(p)) ? : 1) - 1)))
141 #define SCALE(v1,v1_max,v2_max) \
142 (v1) * (v2_max) / (v1_max)
145 (SCALE(TASK_NICE(p), 40, MAX_BONUS) + INTERACTIVE_DELTA)
147 #define TASK_INTERACTIVE(p) \
148 ((p)->prio <= (p)->static_prio - DELTA(p))
150 #define INTERACTIVE_SLEEP(p) \
151 (JIFFIES_TO_NS(MAX_SLEEP_AVG * \
152 (MAX_BONUS / 2 + DELTA((p)) + 1) / MAX_BONUS - 1))
154 #define HIGH_CREDIT(p) \
155 ((p)->interactive_credit > CREDIT_LIMIT)
157 #define LOW_CREDIT(p) \
158 ((p)->interactive_credit < -CREDIT_LIMIT)
160 #define TASK_PREEMPTS_CURR(p, rq) \
161 ((p)->prio < (rq)->curr->prio)
164 * BASE_TIMESLICE scales user-nice values [ -20 ... 19 ]
165 * to time slice values.
167 * The higher a thread's priority, the bigger timeslices
168 * it gets during one round of execution. But even the lowest
169 * priority thread gets MIN_TIMESLICE worth of execution time.
171 * task_timeslice() is the interface that is used by the scheduler.
174 #define BASE_TIMESLICE(p) (MIN_TIMESLICE + \
175 ((MAX_TIMESLICE - MIN_TIMESLICE) * \
176 (MAX_PRIO-1 - (p)->static_prio) / (MAX_USER_PRIO-1)))
178 static unsigned int task_timeslice(task_t *p)
180 return BASE_TIMESLICE(p);
183 #define task_hot(p, now, sd) ((now) - (p)->timestamp < (sd)->cache_hot_time)
186 * These are the runqueue data structures:
189 #define BITMAP_SIZE ((((MAX_PRIO+1+7)/8)+sizeof(long)-1)/sizeof(long))
191 typedef struct runqueue runqueue_t;
194 unsigned int nr_active;
195 unsigned long bitmap[BITMAP_SIZE];
196 struct list_head queue[MAX_PRIO];
200 * This is the main, per-CPU runqueue data structure.
202 * Locking rule: those places that want to lock multiple runqueues
203 * (such as the load balancing or the thread migration code), lock
204 * acquire operations must be ordered by ascending &runqueue.
210 * nr_running and cpu_load should be in the same cacheline because
211 * remote CPUs use both these fields when doing load calculation.
213 unsigned long nr_running;
215 unsigned long cpu_load;
217 unsigned long long nr_switches;
218 unsigned long expired_timestamp, nr_uninterruptible;
219 unsigned long long timestamp_last_tick;
221 struct mm_struct *prev_mm;
222 prio_array_t *active, *expired, arrays[2];
223 int best_expired_prio;
227 struct sched_domain *sd;
229 /* For active balancing */
233 task_t *migration_thread;
234 struct list_head migration_queue;
238 static DEFINE_PER_CPU(struct runqueue, runqueues);
240 #define for_each_domain(cpu, domain) \
241 for (domain = cpu_rq(cpu)->sd; domain; domain = domain->parent)
243 #define cpu_rq(cpu) (&per_cpu(runqueues, (cpu)))
244 #define this_rq() (&__get_cpu_var(runqueues))
245 #define task_rq(p) cpu_rq(task_cpu(p))
246 #define cpu_curr(cpu) (cpu_rq(cpu)->curr)
249 * Default context-switch locking:
251 #ifndef prepare_arch_switch
252 # define prepare_arch_switch(rq, next) do { } while (0)
253 # define finish_arch_switch(rq, next) spin_unlock_irq(&(rq)->lock)
254 # define task_running(rq, p) ((rq)->curr == (p))
258 * task_rq_lock - lock the runqueue a given task resides on and disable
259 * interrupts. Note the ordering: we can safely lookup the task_rq without
260 * explicitly disabling preemption.
262 static runqueue_t *task_rq_lock(task_t *p, unsigned long *flags)
267 local_irq_save(*flags);
269 spin_lock(&rq->lock);
270 if (unlikely(rq != task_rq(p))) {
271 spin_unlock_irqrestore(&rq->lock, *flags);
272 goto repeat_lock_task;
277 static inline void task_rq_unlock(runqueue_t *rq, unsigned long *flags)
279 spin_unlock_irqrestore(&rq->lock, *flags);
283 * rq_lock - lock a given runqueue and disable interrupts.
285 static runqueue_t *this_rq_lock(void)
291 spin_lock(&rq->lock);
296 static inline void rq_unlock(runqueue_t *rq)
298 spin_unlock_irq(&rq->lock);
302 * Adding/removing a task to/from a priority array:
304 static void dequeue_task(struct task_struct *p, prio_array_t *array)
307 list_del(&p->run_list);
308 if (list_empty(array->queue + p->prio))
309 __clear_bit(p->prio, array->bitmap);
312 static void enqueue_task(struct task_struct *p, prio_array_t *array)
314 list_add_tail(&p->run_list, array->queue + p->prio);
315 __set_bit(p->prio, array->bitmap);
321 * Used by the migration code - we pull tasks from the head of the
322 * remote queue so we want these tasks to show up at the head of the
325 static inline void enqueue_task_head(struct task_struct *p, prio_array_t *array)
327 list_add(&p->run_list, array->queue + p->prio);
328 __set_bit(p->prio, array->bitmap);
334 * effective_prio - return the priority that is based on the static
335 * priority but is modified by bonuses/penalties.
337 * We scale the actual sleep average [0 .... MAX_SLEEP_AVG]
338 * into the -5 ... 0 ... +5 bonus/penalty range.
340 * We use 25% of the full 0...39 priority range so that:
342 * 1) nice +19 interactive tasks do not preempt nice 0 CPU hogs.
343 * 2) nice -20 CPU hogs do not get preempted by nice 0 tasks.
345 * Both properties are important to certain workloads.
347 static int effective_prio(task_t *p)
354 bonus = CURRENT_BONUS(p) - MAX_BONUS / 2;
356 prio = p->static_prio - bonus;
357 if (prio < MAX_RT_PRIO)
359 if (prio > MAX_PRIO-1)
365 * __activate_task - move a task to the runqueue.
367 static inline void __activate_task(task_t *p, runqueue_t *rq)
369 enqueue_task(p, rq->active);
374 * __activate_idle_task - move idle task to the _front_ of runqueue.
376 static inline void __activate_idle_task(task_t *p, runqueue_t *rq)
378 enqueue_task_head(p, rq->active);
382 static void recalc_task_prio(task_t *p, unsigned long long now)
384 unsigned long long __sleep_time = now - p->timestamp;
385 unsigned long sleep_time;
387 if (__sleep_time > NS_MAX_SLEEP_AVG)
388 sleep_time = NS_MAX_SLEEP_AVG;
390 sleep_time = (unsigned long)__sleep_time;
392 if (likely(sleep_time > 0)) {
394 * User tasks that sleep a long time are categorised as
395 * idle and will get just interactive status to stay active &
396 * prevent them suddenly becoming cpu hogs and starving
399 if (p->mm && p->activated != -1 &&
400 sleep_time > INTERACTIVE_SLEEP(p)) {
401 p->sleep_avg = JIFFIES_TO_NS(MAX_SLEEP_AVG -
404 p->interactive_credit++;
407 * The lower the sleep avg a task has the more
408 * rapidly it will rise with sleep time.
410 sleep_time *= (MAX_BONUS - CURRENT_BONUS(p)) ? : 1;
413 * Tasks with low interactive_credit are limited to
414 * one timeslice worth of sleep avg bonus.
417 sleep_time > JIFFIES_TO_NS(task_timeslice(p)))
418 sleep_time = JIFFIES_TO_NS(task_timeslice(p));
421 * Non high_credit tasks waking from uninterruptible
422 * sleep are limited in their sleep_avg rise as they
423 * are likely to be cpu hogs waiting on I/O
425 if (p->activated == -1 && !HIGH_CREDIT(p) && p->mm) {
426 if (p->sleep_avg >= INTERACTIVE_SLEEP(p))
428 else if (p->sleep_avg + sleep_time >=
429 INTERACTIVE_SLEEP(p)) {
430 p->sleep_avg = INTERACTIVE_SLEEP(p);
436 * This code gives a bonus to interactive tasks.
438 * The boost works by updating the 'average sleep time'
439 * value here, based on ->timestamp. The more time a
440 * task spends sleeping, the higher the average gets -
441 * and the higher the priority boost gets as well.
443 p->sleep_avg += sleep_time;
445 if (p->sleep_avg > NS_MAX_SLEEP_AVG) {
446 p->sleep_avg = NS_MAX_SLEEP_AVG;
448 p->interactive_credit++;
453 p->prio = effective_prio(p);
457 * activate_task - move a task to the runqueue and do priority recalculation
459 * Update all the scheduling statistics stuff. (sleep average
460 * calculation, priority modifiers, etc.)
462 static void activate_task(task_t *p, runqueue_t *rq, int local)
464 unsigned long long now;
469 /* Compensate for drifting sched_clock */
470 runqueue_t *this_rq = this_rq();
471 now = (now - this_rq->timestamp_last_tick)
472 + rq->timestamp_last_tick;
476 recalc_task_prio(p, now);
479 * This checks to make sure it's not an uninterruptible task
480 * that is now waking up.
484 * Tasks which were woken up by interrupts (ie. hw events)
485 * are most likely of interactive nature. So we give them
486 * the credit of extending their sleep time to the period
487 * of time they spend on the runqueue, waiting for execution
488 * on a CPU, first time around:
494 * Normal first-time wakeups get a credit too for
495 * on-runqueue time, but it will be weighted down:
502 __activate_task(p, rq);
506 * deactivate_task - remove a task from the runqueue.
508 static void deactivate_task(struct task_struct *p, runqueue_t *rq)
511 if (p->state == TASK_UNINTERRUPTIBLE)
512 rq->nr_uninterruptible++;
513 dequeue_task(p, p->array);
518 * resched_task - mark a task 'to be rescheduled now'.
520 * On UP this means the setting of the need_resched flag, on SMP it
521 * might also involve a cross-CPU call to trigger the scheduler on
525 static void resched_task(task_t *p)
527 int need_resched, nrpolling;
530 /* minimise the chance of sending an interrupt to poll_idle() */
531 nrpolling = test_tsk_thread_flag(p,TIF_POLLING_NRFLAG);
532 need_resched = test_and_set_tsk_thread_flag(p,TIF_NEED_RESCHED);
533 nrpolling |= test_tsk_thread_flag(p,TIF_POLLING_NRFLAG);
535 if (!need_resched && !nrpolling && (task_cpu(p) != smp_processor_id()))
536 smp_send_reschedule(task_cpu(p));
540 static inline void resched_task(task_t *p)
542 set_tsk_need_resched(p);
547 * task_curr - is this task currently executing on a CPU?
548 * @p: the task in question.
550 inline int task_curr(const task_t *p)
552 return cpu_curr(task_cpu(p)) == p;
562 struct list_head list;
563 enum request_type type;
565 /* For REQ_MOVE_TASK */
569 /* For REQ_SET_DOMAIN */
570 struct sched_domain *sd;
572 struct completion done;
576 * The task's runqueue lock must be held.
577 * Returns true if you have to wait for migration thread.
579 static int migrate_task(task_t *p, int dest_cpu, migration_req_t *req)
581 runqueue_t *rq = task_rq(p);
584 * If the task is not on a runqueue (and not running), then
585 * it is sufficient to simply update the task's cpu field.
587 if (!p->array && !task_running(rq, p)) {
588 set_task_cpu(p, dest_cpu);
592 init_completion(&req->done);
593 req->type = REQ_MOVE_TASK;
595 req->dest_cpu = dest_cpu;
596 list_add(&req->list, &rq->migration_queue);
601 * wait_task_inactive - wait for a thread to unschedule.
603 * The caller must ensure that the task *will* unschedule sometime soon,
604 * else this function might spin for a *long* time. This function can't
605 * be called with interrupts off, or it may introduce deadlock with
606 * smp_call_function() if an IPI is sent by the same process we are
607 * waiting to become inactive.
609 void wait_task_inactive(task_t * p)
616 rq = task_rq_lock(p, &flags);
617 /* Must be off runqueue entirely, not preempted. */
618 if (unlikely(p->array)) {
619 /* If it's preempted, we yield. It could be a while. */
620 preempted = !task_running(rq, p);
621 task_rq_unlock(rq, &flags);
627 task_rq_unlock(rq, &flags);
631 * kick_process - kick a running thread to enter/exit the kernel
632 * @p: the to-be-kicked thread
634 * Cause a process which is running on another CPU to enter
635 * kernel-mode, without any delay. (to get signals handled.)
637 void kick_process(task_t *p)
643 if ((cpu != smp_processor_id()) && task_curr(p))
644 smp_send_reschedule(cpu);
648 EXPORT_SYMBOL_GPL(kick_process);
651 * Return a low guess at the load of a migration-source cpu.
653 * We want to under-estimate the load of migration sources, to
654 * balance conservatively.
656 static inline unsigned long source_load(int cpu)
658 runqueue_t *rq = cpu_rq(cpu);
659 unsigned long load_now = rq->nr_running * SCHED_LOAD_SCALE;
661 return min(rq->cpu_load, load_now);
665 * Return a high guess at the load of a migration-target cpu
667 static inline unsigned long target_load(int cpu)
669 runqueue_t *rq = cpu_rq(cpu);
670 unsigned long load_now = rq->nr_running * SCHED_LOAD_SCALE;
672 return max(rq->cpu_load, load_now);
678 * wake_idle() is useful especially on SMT architectures to wake a
679 * task onto an idle sibling if we would otherwise wake it onto a
682 * Returns the CPU we should wake onto.
684 #if defined(ARCH_HAS_SCHED_WAKE_IDLE)
685 static int wake_idle(int cpu, task_t *p)
688 runqueue_t *rq = cpu_rq(cpu);
689 struct sched_domain *sd;
696 if (!(sd->flags & SD_WAKE_IDLE))
699 cpus_and(tmp, sd->span, cpu_online_map);
700 for_each_cpu_mask(i, tmp) {
701 if (!cpu_isset(i, p->cpus_allowed))
711 static inline int wake_idle(int cpu, task_t *p)
718 * try_to_wake_up - wake up a thread
719 * @p: the to-be-woken-up thread
720 * @state: the mask of task states that can be woken
721 * @sync: do a synchronous wakeup?
723 * Put it on the run-queue if it's not already there. The "current"
724 * thread is always on the run-queue (except when the actual
725 * re-schedule is in progress), and as such you're allowed to do
726 * the simpler "current->state = TASK_RUNNING" to mark yourself
727 * runnable without the overhead of this.
729 * returns failure only if the task is already active.
731 static int try_to_wake_up(task_t * p, unsigned int state, int sync)
733 int cpu, this_cpu, success = 0;
738 unsigned long load, this_load;
739 struct sched_domain *sd;
743 rq = task_rq_lock(p, &flags);
744 old_state = p->state;
745 if (!(old_state & state))
752 this_cpu = smp_processor_id();
755 if (unlikely(task_running(rq, p)))
760 if (cpu == this_cpu || unlikely(!cpu_isset(this_cpu, p->cpus_allowed)))
763 load = source_load(cpu);
764 this_load = target_load(this_cpu);
767 * If sync wakeup then subtract the (maximum possible) effect of
768 * the currently running task from the load of the current CPU:
771 this_load -= SCHED_LOAD_SCALE;
773 /* Don't pull the task off an idle CPU to a busy one */
774 if (load < SCHED_LOAD_SCALE/2 && this_load > SCHED_LOAD_SCALE/2)
777 new_cpu = this_cpu; /* Wake to this CPU if we can */
780 * Scan domains for affine wakeup and passive balancing
783 for_each_domain(this_cpu, sd) {
784 unsigned int imbalance;
786 * Start passive balancing when half the imbalance_pct
789 imbalance = sd->imbalance_pct + (sd->imbalance_pct - 100) / 2;
791 if ( ((sd->flags & SD_WAKE_AFFINE) &&
792 !task_hot(p, rq->timestamp_last_tick, sd))
793 || ((sd->flags & SD_WAKE_BALANCE) &&
794 imbalance*this_load <= 100*load) ) {
796 * Now sd has SD_WAKE_AFFINE and p is cache cold in sd
797 * or sd has SD_WAKE_BALANCE and there is an imbalance
799 if (cpu_isset(cpu, sd->span))
804 new_cpu = cpu; /* Could not wake to this_cpu. Wake to cpu instead */
806 new_cpu = wake_idle(new_cpu, p);
807 if (new_cpu != cpu && cpu_isset(new_cpu, p->cpus_allowed)) {
808 set_task_cpu(p, new_cpu);
809 task_rq_unlock(rq, &flags);
810 /* might preempt at this point */
811 rq = task_rq_lock(p, &flags);
812 old_state = p->state;
813 if (!(old_state & state))
818 this_cpu = smp_processor_id();
823 #endif /* CONFIG_SMP */
824 if (old_state == TASK_UNINTERRUPTIBLE) {
825 rq->nr_uninterruptible--;
827 * Tasks on involuntary sleep don't earn
828 * sleep_avg beyond just interactive state.
834 * Sync wakeups (i.e. those types of wakeups where the waker
835 * has indicated that it will leave the CPU in short order)
836 * don't trigger a preemption, if the woken up task will run on
837 * this cpu. (in this case the 'I will reschedule' promise of
838 * the waker guarantees that the freshly woken up task is going
839 * to be considered on this CPU.)
841 activate_task(p, rq, cpu == this_cpu);
842 if (!sync || cpu != this_cpu) {
843 if (TASK_PREEMPTS_CURR(p, rq))
844 resched_task(rq->curr);
849 p->state = TASK_RUNNING;
851 task_rq_unlock(rq, &flags);
856 int fastcall wake_up_process(task_t * p)
858 return try_to_wake_up(p, TASK_STOPPED |
859 TASK_INTERRUPTIBLE | TASK_UNINTERRUPTIBLE, 0);
862 EXPORT_SYMBOL(wake_up_process);
864 int fastcall wake_up_state(task_t *p, unsigned int state)
866 return try_to_wake_up(p, state, 0);
870 * Perform scheduler related setup for a newly forked process p.
871 * p is forked by current.
873 void fastcall sched_fork(task_t *p)
876 * We mark the process as running here, but have not actually
877 * inserted it onto the runqueue yet. This guarantees that
878 * nobody will actually run it, and a signal or other external
879 * event cannot wake it up and insert it on the runqueue either.
881 p->state = TASK_RUNNING;
882 INIT_LIST_HEAD(&p->run_list);
884 spin_lock_init(&p->switch_lock);
885 #ifdef CONFIG_PREEMPT
887 * During context-switch we hold precisely one spinlock, which
888 * schedule_tail drops. (in the common case it's this_rq()->lock,
889 * but it also can be p->switch_lock.) So we compensate with a count
890 * of 1. Also, we want to start with kernel preemption disabled.
892 p->thread_info->preempt_count = 1;
895 * Share the timeslice between parent and child, thus the
896 * total amount of pending timeslices in the system doesn't change,
897 * resulting in more scheduling fairness.
900 p->time_slice = (current->time_slice + 1) >> 1;
902 * The remainder of the first timeslice might be recovered by
903 * the parent if the child exits early enough.
905 p->first_time_slice = 1;
906 current->time_slice >>= 1;
907 p->timestamp = sched_clock();
908 if (!current->time_slice) {
910 * This case is rare, it happens when the parent has only
911 * a single jiffy left from its timeslice. Taking the
912 * runqueue lock is not a problem.
914 current->time_slice = 1;
916 scheduler_tick(0, 0);
924 * wake_up_forked_process - wake up a freshly forked process.
926 * This function will do some initial scheduler statistics housekeeping
927 * that must be done for every newly created process.
929 void fastcall wake_up_forked_process(task_t * p)
932 runqueue_t *rq = task_rq_lock(current, &flags);
934 BUG_ON(p->state != TASK_RUNNING);
937 * We decrease the sleep average of forking parents
938 * and children as well, to keep max-interactive tasks
939 * from forking tasks that are max-interactive.
941 current->sleep_avg = JIFFIES_TO_NS(CURRENT_BONUS(current) *
942 PARENT_PENALTY / 100 * MAX_SLEEP_AVG / MAX_BONUS);
944 p->sleep_avg = JIFFIES_TO_NS(CURRENT_BONUS(p) *
945 CHILD_PENALTY / 100 * MAX_SLEEP_AVG / MAX_BONUS);
947 p->interactive_credit = 0;
949 p->prio = effective_prio(p);
950 set_task_cpu(p, smp_processor_id());
952 if (unlikely(!current->array))
953 __activate_task(p, rq);
955 p->prio = current->prio;
956 list_add_tail(&p->run_list, ¤t->run_list);
957 p->array = current->array;
958 p->array->nr_active++;
961 task_rq_unlock(rq, &flags);
965 * Potentially available exiting-child timeslices are
966 * retrieved here - this way the parent does not get
967 * penalized for creating too many threads.
969 * (this cannot be used to 'generate' timeslices
970 * artificially, because any timeslice recovered here
971 * was given away by the parent in the first place.)
973 void fastcall sched_exit(task_t * p)
978 local_irq_save(flags);
979 if (p->first_time_slice) {
980 p->parent->time_slice += p->time_slice;
981 if (unlikely(p->parent->time_slice > MAX_TIMESLICE))
982 p->parent->time_slice = MAX_TIMESLICE;
984 local_irq_restore(flags);
986 * If the child was a (relative-) CPU hog then decrease
987 * the sleep_avg of the parent as well.
989 rq = task_rq_lock(p->parent, &flags);
990 if (p->sleep_avg < p->parent->sleep_avg)
991 p->parent->sleep_avg = p->parent->sleep_avg /
992 (EXIT_WEIGHT + 1) * EXIT_WEIGHT + p->sleep_avg /
994 task_rq_unlock(rq, &flags);
998 * finish_task_switch - clean up after a task-switch
999 * @prev: the thread we just switched away from.
1001 * We enter this with the runqueue still locked, and finish_arch_switch()
1002 * will unlock it along with doing any other architecture-specific cleanup
1005 * Note that we may have delayed dropping an mm in context_switch(). If
1006 * so, we finish that here outside of the runqueue lock. (Doing it
1007 * with the lock held can cause deadlocks; see schedule() for
1010 static void finish_task_switch(task_t *prev)
1012 runqueue_t *rq = this_rq();
1013 struct mm_struct *mm = rq->prev_mm;
1014 unsigned long prev_task_flags;
1019 * A task struct has one reference for the use as "current".
1020 * If a task dies, then it sets TASK_ZOMBIE in tsk->state and calls
1021 * schedule one last time. The schedule call will never return,
1022 * and the scheduled task must drop that reference.
1023 * The test for TASK_ZOMBIE must occur while the runqueue locks are
1024 * still held, otherwise prev could be scheduled on another cpu, die
1025 * there before we look at prev->state, and then the reference would
1027 * Manfred Spraul <manfred@colorfullife.com>
1029 prev_task_flags = prev->flags;
1030 finish_arch_switch(rq, prev);
1033 if (unlikely(prev_task_flags & PF_DEAD))
1034 put_task_struct(prev);
1038 * schedule_tail - first thing a freshly forked thread must call.
1039 * @prev: the thread we just switched away from.
1041 asmlinkage void schedule_tail(task_t *prev)
1043 finish_task_switch(prev);
1045 if (current->set_child_tid)
1046 put_user(current->pid, current->set_child_tid);
1050 * context_switch - switch to the new MM and the new
1051 * thread's register state.
1054 task_t * context_switch(runqueue_t *rq, task_t *prev, task_t *next)
1056 struct mm_struct *mm = next->mm;
1057 struct mm_struct *oldmm = prev->active_mm;
1059 if (unlikely(!mm)) {
1060 next->active_mm = oldmm;
1061 atomic_inc(&oldmm->mm_count);
1062 enter_lazy_tlb(oldmm, next);
1064 switch_mm(oldmm, mm, next);
1066 if (unlikely(!prev->mm)) {
1067 prev->active_mm = NULL;
1068 WARN_ON(rq->prev_mm);
1069 rq->prev_mm = oldmm;
1072 /* Here we just switch the register state and the stack. */
1073 switch_to(prev, next, prev);
1079 * nr_running, nr_uninterruptible and nr_context_switches:
1081 * externally visible scheduler statistics: current number of runnable
1082 * threads, current number of uninterruptible-sleeping threads, total
1083 * number of context switches performed since bootup.
1085 unsigned long nr_running(void)
1087 unsigned long i, sum = 0;
1090 sum += cpu_rq(i)->nr_running;
1095 unsigned long nr_uninterruptible(void)
1097 unsigned long i, sum = 0;
1099 for_each_online_cpu(i)
1100 sum += cpu_rq(i)->nr_uninterruptible;
1105 unsigned long long nr_context_switches(void)
1107 unsigned long long i, sum = 0;
1109 for_each_online_cpu(i)
1110 sum += cpu_rq(i)->nr_switches;
1115 unsigned long nr_iowait(void)
1117 unsigned long i, sum = 0;
1119 for_each_online_cpu(i)
1120 sum += atomic_read(&cpu_rq(i)->nr_iowait);
1126 * double_rq_lock - safely lock two runqueues
1128 * Note this does not disable interrupts like task_rq_lock,
1129 * you need to do so manually before calling.
1131 static void double_rq_lock(runqueue_t *rq1, runqueue_t *rq2)
1134 spin_lock(&rq1->lock);
1137 spin_lock(&rq1->lock);
1138 spin_lock(&rq2->lock);
1140 spin_lock(&rq2->lock);
1141 spin_lock(&rq1->lock);
1147 * double_rq_unlock - safely unlock two runqueues
1149 * Note this does not restore interrupts like task_rq_unlock,
1150 * you need to do so manually after calling.
1152 static void double_rq_unlock(runqueue_t *rq1, runqueue_t *rq2)
1154 spin_unlock(&rq1->lock);
1156 spin_unlock(&rq2->lock);
1169 * find_idlest_cpu - find the least busy runqueue.
1171 static int find_idlest_cpu(struct task_struct *p, int this_cpu,
1172 struct sched_domain *sd)
1174 unsigned long load, min_load, this_load;
1179 min_load = ULONG_MAX;
1181 cpus_and(mask, sd->span, cpu_online_map);
1182 cpus_and(mask, mask, p->cpus_allowed);
1184 for_each_cpu_mask(i, mask) {
1185 load = target_load(i);
1187 if (load < min_load) {
1191 /* break out early on an idle CPU: */
1197 /* add +1 to account for the new task */
1198 this_load = source_load(this_cpu) + SCHED_LOAD_SCALE;
1201 * Would with the addition of the new task to the
1202 * current CPU there be an imbalance between this
1203 * CPU and the idlest CPU?
1205 * Use half of the balancing threshold - new-context is
1206 * a good opportunity to balance.
1208 if (min_load*(100 + (sd->imbalance_pct-100)/2) < this_load*100)
1215 * wake_up_forked_thread - wake up a freshly forked thread.
1217 * This function will do some initial scheduler statistics housekeeping
1218 * that must be done for every newly created context, and it also does
1219 * runqueue balancing.
1221 void fastcall wake_up_forked_thread(task_t * p)
1223 unsigned long flags;
1224 int this_cpu = get_cpu(), cpu;
1225 struct sched_domain *tmp, *sd = NULL;
1226 runqueue_t *this_rq = cpu_rq(this_cpu), *rq;
1229 * Find the largest domain that this CPU is part of that
1230 * is willing to balance on clone:
1232 for_each_domain(this_cpu, tmp)
1233 if (tmp->flags & SD_BALANCE_CLONE)
1236 cpu = find_idlest_cpu(p, this_cpu, sd);
1240 local_irq_save(flags);
1243 double_rq_lock(this_rq, rq);
1245 BUG_ON(p->state != TASK_RUNNING);
1248 * We did find_idlest_cpu() unlocked, so in theory
1249 * the mask could have changed - just dont migrate
1252 if (unlikely(!cpu_isset(cpu, p->cpus_allowed))) {
1254 double_rq_unlock(this_rq, rq);
1258 * We decrease the sleep average of forking parents
1259 * and children as well, to keep max-interactive tasks
1260 * from forking tasks that are max-interactive.
1262 current->sleep_avg = JIFFIES_TO_NS(CURRENT_BONUS(current) *
1263 PARENT_PENALTY / 100 * MAX_SLEEP_AVG / MAX_BONUS);
1265 p->sleep_avg = JIFFIES_TO_NS(CURRENT_BONUS(p) *
1266 CHILD_PENALTY / 100 * MAX_SLEEP_AVG / MAX_BONUS);
1268 p->interactive_credit = 0;
1270 p->prio = effective_prio(p);
1271 set_task_cpu(p, cpu);
1273 if (cpu == this_cpu) {
1274 if (unlikely(!current->array))
1275 __activate_task(p, rq);
1277 p->prio = current->prio;
1278 list_add_tail(&p->run_list, ¤t->run_list);
1279 p->array = current->array;
1280 p->array->nr_active++;
1284 /* Not the local CPU - must adjust timestamp */
1285 p->timestamp = (p->timestamp - this_rq->timestamp_last_tick)
1286 + rq->timestamp_last_tick;
1287 __activate_task(p, rq);
1288 if (TASK_PREEMPTS_CURR(p, rq))
1289 resched_task(rq->curr);
1292 double_rq_unlock(this_rq, rq);
1293 local_irq_restore(flags);
1298 * If dest_cpu is allowed for this process, migrate the task to it.
1299 * This is accomplished by forcing the cpu_allowed mask to only
1300 * allow dest_cpu, which will force the cpu onto dest_cpu. Then
1301 * the cpu_allowed mask is restored.
1303 static void sched_migrate_task(task_t *p, int dest_cpu)
1305 migration_req_t req;
1307 unsigned long flags;
1309 rq = task_rq_lock(p, &flags);
1310 if (!cpu_isset(dest_cpu, p->cpus_allowed)
1311 || unlikely(cpu_is_offline(dest_cpu)))
1314 /* force the process onto the specified CPU */
1315 if (migrate_task(p, dest_cpu, &req)) {
1316 /* Need to wait for migration thread (might exit: take ref). */
1317 struct task_struct *mt = rq->migration_thread;
1318 get_task_struct(mt);
1319 task_rq_unlock(rq, &flags);
1320 wake_up_process(mt);
1321 put_task_struct(mt);
1322 wait_for_completion(&req.done);
1326 task_rq_unlock(rq, &flags);
1330 * sched_balance_exec(): find the highest-level, exec-balance-capable
1331 * domain and try to migrate the task to the least loaded CPU.
1333 * execve() is a valuable balancing opportunity, because at this point
1334 * the task has the smallest effective memory and cache footprint.
1336 void sched_balance_exec(void)
1338 struct sched_domain *tmp, *sd = NULL;
1339 int new_cpu, this_cpu = get_cpu();
1341 /* Prefer the current CPU if there's only this task running */
1342 if (this_rq()->nr_running <= 1)
1345 for_each_domain(this_cpu, tmp)
1346 if (tmp->flags & SD_BALANCE_EXEC)
1350 new_cpu = find_idlest_cpu(current, this_cpu, sd);
1351 if (new_cpu != this_cpu) {
1353 sched_migrate_task(current, new_cpu);
1362 * double_lock_balance - lock the busiest runqueue, this_rq is locked already.
1364 static void double_lock_balance(runqueue_t *this_rq, runqueue_t *busiest)
1366 if (unlikely(!spin_trylock(&busiest->lock))) {
1367 if (busiest < this_rq) {
1368 spin_unlock(&this_rq->lock);
1369 spin_lock(&busiest->lock);
1370 spin_lock(&this_rq->lock);
1372 spin_lock(&busiest->lock);
1377 * pull_task - move a task from a remote runqueue to the local runqueue.
1378 * Both runqueues must be locked.
1381 void pull_task(runqueue_t *src_rq, prio_array_t *src_array, task_t *p,
1382 runqueue_t *this_rq, prio_array_t *this_array, int this_cpu)
1384 dequeue_task(p, src_array);
1385 src_rq->nr_running--;
1386 set_task_cpu(p, this_cpu);
1387 this_rq->nr_running++;
1388 enqueue_task(p, this_array);
1389 p->timestamp = (p->timestamp - src_rq->timestamp_last_tick)
1390 + this_rq->timestamp_last_tick;
1392 * Note that idle threads have a prio of MAX_PRIO, for this test
1393 * to be always true for them.
1395 if (TASK_PREEMPTS_CURR(p, this_rq))
1396 resched_task(this_rq->curr);
1400 * can_migrate_task - may task p from runqueue rq be migrated to this_cpu?
1403 int can_migrate_task(task_t *p, runqueue_t *rq, int this_cpu,
1404 struct sched_domain *sd, enum idle_type idle)
1407 * We do not migrate tasks that are:
1408 * 1) running (obviously), or
1409 * 2) cannot be migrated to this CPU due to cpus_allowed, or
1410 * 3) are cache-hot on their current CPU.
1412 if (task_running(rq, p))
1414 if (!cpu_isset(this_cpu, p->cpus_allowed))
1417 /* Aggressive migration if we've failed balancing */
1418 if (idle == NEWLY_IDLE ||
1419 sd->nr_balance_failed < sd->cache_nice_tries) {
1420 if (task_hot(p, rq->timestamp_last_tick, sd))
1428 * move_tasks tries to move up to max_nr_move tasks from busiest to this_rq,
1429 * as part of a balancing operation within "domain". Returns the number of
1432 * Called with both runqueues locked.
1434 static int move_tasks(runqueue_t *this_rq, int this_cpu, runqueue_t *busiest,
1435 unsigned long max_nr_move, struct sched_domain *sd,
1436 enum idle_type idle)
1438 prio_array_t *array, *dst_array;
1439 struct list_head *head, *curr;
1440 int idx, pulled = 0;
1443 if (max_nr_move <= 0 || busiest->nr_running <= 1)
1447 * We first consider expired tasks. Those will likely not be
1448 * executed in the near future, and they are most likely to
1449 * be cache-cold, thus switching CPUs has the least effect
1452 if (busiest->expired->nr_active) {
1453 array = busiest->expired;
1454 dst_array = this_rq->expired;
1456 array = busiest->active;
1457 dst_array = this_rq->active;
1461 /* Start searching at priority 0: */
1465 idx = sched_find_first_bit(array->bitmap);
1467 idx = find_next_bit(array->bitmap, MAX_PRIO, idx);
1468 if (idx >= MAX_PRIO) {
1469 if (array == busiest->expired && busiest->active->nr_active) {
1470 array = busiest->active;
1471 dst_array = this_rq->active;
1477 head = array->queue + idx;
1480 tmp = list_entry(curr, task_t, run_list);
1484 if (!can_migrate_task(tmp, busiest, this_cpu, sd, idle)) {
1490 pull_task(busiest, array, tmp, this_rq, dst_array, this_cpu);
1493 /* We only want to steal up to the prescribed number of tasks. */
1494 if (pulled < max_nr_move) {
1505 * find_busiest_group finds and returns the busiest CPU group within the
1506 * domain. It calculates and returns the number of tasks which should be
1507 * moved to restore balance via the imbalance parameter.
1509 static struct sched_group *
1510 find_busiest_group(struct sched_domain *sd, int this_cpu,
1511 unsigned long *imbalance, enum idle_type idle)
1513 struct sched_group *busiest = NULL, *this = NULL, *group = sd->groups;
1514 unsigned long max_load, avg_load, total_load, this_load, total_pwr;
1516 max_load = this_load = total_load = total_pwr = 0;
1524 local_group = cpu_isset(this_cpu, group->cpumask);
1526 /* Tally up the load of all CPUs in the group */
1528 cpus_and(tmp, group->cpumask, cpu_online_map);
1529 if (unlikely(cpus_empty(tmp)))
1532 for_each_cpu_mask(i, tmp) {
1533 /* Bias balancing toward cpus of our domain */
1535 load = target_load(i);
1537 load = source_load(i);
1546 total_load += avg_load;
1547 total_pwr += group->cpu_power;
1549 /* Adjust by relative CPU power of the group */
1550 avg_load = (avg_load * SCHED_LOAD_SCALE) / group->cpu_power;
1553 this_load = avg_load;
1556 } else if (avg_load > max_load) {
1557 max_load = avg_load;
1561 group = group->next;
1562 } while (group != sd->groups);
1564 if (!busiest || this_load >= max_load)
1567 avg_load = (SCHED_LOAD_SCALE * total_load) / total_pwr;
1569 if (this_load >= avg_load ||
1570 100*max_load <= sd->imbalance_pct*this_load)
1574 * We're trying to get all the cpus to the average_load, so we don't
1575 * want to push ourselves above the average load, nor do we wish to
1576 * reduce the max loaded cpu below the average load, as either of these
1577 * actions would just result in more rebalancing later, and ping-pong
1578 * tasks around. Thus we look for the minimum possible imbalance.
1579 * Negative imbalances (*we* are more loaded than anyone else) will
1580 * be counted as no imbalance for these purposes -- we can't fix that
1581 * by pulling tasks to us. Be careful of negative numbers as they'll
1582 * appear as very large values with unsigned longs.
1584 *imbalance = min(max_load - avg_load, avg_load - this_load);
1586 /* How much load to actually move to equalise the imbalance */
1587 *imbalance = (*imbalance * min(busiest->cpu_power, this->cpu_power))
1590 if (*imbalance < SCHED_LOAD_SCALE - 1) {
1591 unsigned long pwr_now = 0, pwr_move = 0;
1594 if (max_load - this_load >= SCHED_LOAD_SCALE*2) {
1600 * OK, we don't have enough imbalance to justify moving tasks,
1601 * however we may be able to increase total CPU power used by
1605 pwr_now += busiest->cpu_power*min(SCHED_LOAD_SCALE, max_load);
1606 pwr_now += this->cpu_power*min(SCHED_LOAD_SCALE, this_load);
1607 pwr_now /= SCHED_LOAD_SCALE;
1609 /* Amount of load we'd subtract */
1610 tmp = SCHED_LOAD_SCALE*SCHED_LOAD_SCALE/busiest->cpu_power;
1612 pwr_move += busiest->cpu_power*min(SCHED_LOAD_SCALE,
1615 /* Amount of load we'd add */
1616 tmp = SCHED_LOAD_SCALE*SCHED_LOAD_SCALE/this->cpu_power;
1619 pwr_move += this->cpu_power*min(SCHED_LOAD_SCALE, this_load + tmp);
1620 pwr_move /= SCHED_LOAD_SCALE;
1622 /* Move if we gain another 8th of a CPU worth of throughput */
1623 if (pwr_move < pwr_now + SCHED_LOAD_SCALE / 8)
1630 /* Get rid of the scaling factor, rounding down as we divide */
1631 *imbalance = (*imbalance + 1) / SCHED_LOAD_SCALE;
1636 if (busiest && (idle == NEWLY_IDLE ||
1637 (idle == IDLE && max_load > SCHED_LOAD_SCALE)) ) {
1647 * find_busiest_queue - find the busiest runqueue among the cpus in group.
1649 static runqueue_t *find_busiest_queue(struct sched_group *group)
1652 unsigned long load, max_load = 0;
1653 runqueue_t *busiest = NULL;
1656 cpus_and(tmp, group->cpumask, cpu_online_map);
1657 for_each_cpu_mask(i, tmp) {
1658 load = source_load(i);
1660 if (load > max_load) {
1662 busiest = cpu_rq(i);
1670 * Check this_cpu to ensure it is balanced within domain. Attempt to move
1671 * tasks if there is an imbalance.
1673 * Called with this_rq unlocked.
1675 static int load_balance(int this_cpu, runqueue_t *this_rq,
1676 struct sched_domain *sd, enum idle_type idle)
1678 struct sched_group *group;
1679 runqueue_t *busiest;
1680 unsigned long imbalance;
1683 spin_lock(&this_rq->lock);
1685 group = find_busiest_group(sd, this_cpu, &imbalance, idle);
1689 busiest = find_busiest_queue(group);
1693 * This should be "impossible", but since load
1694 * balancing is inherently racy and statistical,
1695 * it could happen in theory.
1697 if (unlikely(busiest == this_rq)) {
1703 if (busiest->nr_running > 1) {
1705 * Attempt to move tasks. If find_busiest_group has found
1706 * an imbalance but busiest->nr_running <= 1, the group is
1707 * still unbalanced. nr_moved simply stays zero, so it is
1708 * correctly treated as an imbalance.
1710 double_lock_balance(this_rq, busiest);
1711 nr_moved = move_tasks(this_rq, this_cpu, busiest,
1712 imbalance, sd, idle);
1713 spin_unlock(&busiest->lock);
1715 spin_unlock(&this_rq->lock);
1718 sd->nr_balance_failed++;
1720 if (unlikely(sd->nr_balance_failed > sd->cache_nice_tries+2)) {
1723 spin_lock(&busiest->lock);
1724 if (!busiest->active_balance) {
1725 busiest->active_balance = 1;
1726 busiest->push_cpu = this_cpu;
1729 spin_unlock(&busiest->lock);
1731 wake_up_process(busiest->migration_thread);
1734 * We've kicked active balancing, reset the failure
1737 sd->nr_balance_failed = sd->cache_nice_tries;
1740 sd->nr_balance_failed = 0;
1742 /* We were unbalanced, so reset the balancing interval */
1743 sd->balance_interval = sd->min_interval;
1748 spin_unlock(&this_rq->lock);
1750 /* tune up the balancing interval */
1751 if (sd->balance_interval < sd->max_interval)
1752 sd->balance_interval *= 2;
1758 * Check this_cpu to ensure it is balanced within domain. Attempt to move
1759 * tasks if there is an imbalance.
1761 * Called from schedule when this_rq is about to become idle (NEWLY_IDLE).
1762 * this_rq is locked.
1764 static int load_balance_newidle(int this_cpu, runqueue_t *this_rq,
1765 struct sched_domain *sd)
1767 struct sched_group *group;
1768 runqueue_t *busiest = NULL;
1769 unsigned long imbalance;
1772 group = find_busiest_group(sd, this_cpu, &imbalance, NEWLY_IDLE);
1776 busiest = find_busiest_queue(group);
1777 if (!busiest || busiest == this_rq)
1780 /* Attempt to move tasks */
1781 double_lock_balance(this_rq, busiest);
1783 nr_moved = move_tasks(this_rq, this_cpu, busiest,
1784 imbalance, sd, NEWLY_IDLE);
1786 spin_unlock(&busiest->lock);
1793 * idle_balance is called by schedule() if this_cpu is about to become
1794 * idle. Attempts to pull tasks from other CPUs.
1796 static inline void idle_balance(int this_cpu, runqueue_t *this_rq)
1798 struct sched_domain *sd;
1800 for_each_domain(this_cpu, sd) {
1801 if (sd->flags & SD_BALANCE_NEWIDLE) {
1802 if (load_balance_newidle(this_cpu, this_rq, sd)) {
1803 /* We've pulled tasks over so stop searching */
1811 * active_load_balance is run by migration threads. It pushes a running
1812 * task off the cpu. It can be required to correctly have at least 1 task
1813 * running on each physical CPU where possible, and not have a physical /
1814 * logical imbalance.
1816 * Called with busiest locked.
1818 static void active_load_balance(runqueue_t *busiest, int busiest_cpu)
1820 struct sched_domain *sd;
1821 struct sched_group *group, *busy_group;
1824 if (busiest->nr_running <= 1)
1827 for_each_domain(busiest_cpu, sd)
1828 if (cpu_isset(busiest->push_cpu, sd->span))
1836 while (!cpu_isset(busiest_cpu, group->cpumask))
1837 group = group->next;
1846 if (group == busy_group)
1849 cpus_and(tmp, group->cpumask, cpu_online_map);
1850 if (!cpus_weight(tmp))
1853 for_each_cpu_mask(i, tmp) {
1859 rq = cpu_rq(push_cpu);
1862 * This condition is "impossible", but since load
1863 * balancing is inherently a bit racy and statistical,
1864 * it can trigger.. Reported by Bjorn Helgaas on a
1867 if (unlikely(busiest == rq))
1869 double_lock_balance(busiest, rq);
1870 move_tasks(rq, push_cpu, busiest, 1, sd, IDLE);
1871 spin_unlock(&rq->lock);
1873 group = group->next;
1874 } while (group != sd->groups);
1878 * rebalance_tick will get called every timer tick, on every CPU.
1880 * It checks each scheduling domain to see if it is due to be balanced,
1881 * and initiates a balancing operation if so.
1883 * Balancing parameters are set up in arch_init_sched_domains.
1886 /* Don't have all balancing operations going off at once */
1887 #define CPU_OFFSET(cpu) (HZ * cpu / NR_CPUS)
1889 static void rebalance_tick(int this_cpu, runqueue_t *this_rq,
1890 enum idle_type idle)
1892 unsigned long old_load, this_load;
1893 unsigned long j = jiffies + CPU_OFFSET(this_cpu);
1894 struct sched_domain *sd;
1896 /* Update our load */
1897 old_load = this_rq->cpu_load;
1898 this_load = this_rq->nr_running * SCHED_LOAD_SCALE;
1900 * Round up the averaging division if load is increasing. This
1901 * prevents us from getting stuck on 9 if the load is 10, for
1904 if (this_load > old_load)
1906 this_rq->cpu_load = (old_load + this_load) / 2;
1908 for_each_domain(this_cpu, sd) {
1909 unsigned long interval = sd->balance_interval;
1912 interval *= sd->busy_factor;
1914 /* scale ms to jiffies */
1915 interval = msecs_to_jiffies(interval);
1916 if (unlikely(!interval))
1919 if (j - sd->last_balance >= interval) {
1920 if (load_balance(this_cpu, this_rq, sd, idle)) {
1921 /* We've pulled tasks over so no longer idle */
1924 sd->last_balance += interval;
1930 * on UP we do not need to balance between CPUs:
1932 static inline void rebalance_tick(int cpu, runqueue_t *rq, enum idle_type idle)
1935 static inline void idle_balance(int cpu, runqueue_t *rq)
1940 static inline int wake_priority_sleeper(runqueue_t *rq)
1942 #ifdef CONFIG_SCHED_SMT
1944 * If an SMT sibling task has been put to sleep for priority
1945 * reasons reschedule the idle task to see if it can now run.
1947 if (rq->nr_running) {
1948 resched_task(rq->idle);
1955 DEFINE_PER_CPU(struct kernel_stat, kstat);
1957 EXPORT_PER_CPU_SYMBOL(kstat);
1960 * We place interactive tasks back into the active array, if possible.
1962 * To guarantee that this does not starve expired tasks we ignore the
1963 * interactivity of a task if the first expired task had to wait more
1964 * than a 'reasonable' amount of time. This deadline timeout is
1965 * load-dependent, as the frequency of array switched decreases with
1966 * increasing number of running tasks. We also ignore the interactivity
1967 * if a better static_prio task has expired:
1969 #define EXPIRED_STARVING(rq) \
1970 ((STARVATION_LIMIT && ((rq)->expired_timestamp && \
1971 (jiffies - (rq)->expired_timestamp >= \
1972 STARVATION_LIMIT * ((rq)->nr_running) + 1))) || \
1973 ((rq)->curr->static_prio > (rq)->best_expired_prio))
1976 * This function gets called by the timer code, with HZ frequency.
1977 * We call it with interrupts disabled.
1979 * It also gets called by the fork code, when changing the parent's
1982 void scheduler_tick(int user_ticks, int sys_ticks)
1984 int cpu = smp_processor_id();
1985 struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat;
1986 runqueue_t *rq = this_rq();
1987 task_t *p = current;
1989 rq->timestamp_last_tick = sched_clock();
1991 if (rcu_pending(cpu))
1992 rcu_check_callbacks(cpu, user_ticks);
1994 /* note: this timer irq context must be accounted for as well */
1995 if (hardirq_count() - HARDIRQ_OFFSET) {
1996 cpustat->irq += sys_ticks;
1998 } else if (softirq_count()) {
1999 cpustat->softirq += sys_ticks;
2003 if (p == rq->idle) {
2004 if (atomic_read(&rq->nr_iowait) > 0)
2005 cpustat->iowait += sys_ticks;
2007 cpustat->idle += sys_ticks;
2008 if (wake_priority_sleeper(rq))
2010 rebalance_tick(cpu, rq, IDLE);
2013 if (TASK_NICE(p) > 0)
2014 cpustat->nice += user_ticks;
2016 cpustat->user += user_ticks;
2017 cpustat->system += sys_ticks;
2019 /* Task might have expired already, but not scheduled off yet */
2020 if (p->array != rq->active) {
2021 set_tsk_need_resched(p);
2024 spin_lock(&rq->lock);
2026 * The task was running during this tick - update the
2027 * time slice counter. Note: we do not update a thread's
2028 * priority until it either goes to sleep or uses up its
2029 * timeslice. This makes it possible for interactive tasks
2030 * to use up their timeslices at their highest priority levels.
2032 if (unlikely(rt_task(p))) {
2034 * RR tasks need a special form of timeslice management.
2035 * FIFO tasks have no timeslices.
2037 if ((p->policy == SCHED_RR) && !--p->time_slice) {
2038 p->time_slice = task_timeslice(p);
2039 p->first_time_slice = 0;
2040 set_tsk_need_resched(p);
2042 /* put it at the end of the queue: */
2043 dequeue_task(p, rq->active);
2044 enqueue_task(p, rq->active);
2048 if (!--p->time_slice) {
2049 dequeue_task(p, rq->active);
2050 set_tsk_need_resched(p);
2051 p->prio = effective_prio(p);
2052 p->time_slice = task_timeslice(p);
2053 p->first_time_slice = 0;
2055 if (!rq->expired_timestamp)
2056 rq->expired_timestamp = jiffies;
2057 if (!TASK_INTERACTIVE(p) || EXPIRED_STARVING(rq)) {
2058 enqueue_task(p, rq->expired);
2059 if (p->static_prio < rq->best_expired_prio)
2060 rq->best_expired_prio = p->static_prio;
2062 enqueue_task(p, rq->active);
2065 * Prevent a too long timeslice allowing a task to monopolize
2066 * the CPU. We do this by splitting up the timeslice into
2069 * Note: this does not mean the task's timeslices expire or
2070 * get lost in any way, they just might be preempted by
2071 * another task of equal priority. (one with higher
2072 * priority would have preempted this task already.) We
2073 * requeue this task to the end of the list on this priority
2074 * level, which is in essence a round-robin of tasks with
2077 * This only applies to tasks in the interactive
2078 * delta range with at least TIMESLICE_GRANULARITY to requeue.
2080 if (TASK_INTERACTIVE(p) && !((task_timeslice(p) -
2081 p->time_slice) % TIMESLICE_GRANULARITY(p)) &&
2082 (p->time_slice >= TIMESLICE_GRANULARITY(p)) &&
2083 (p->array == rq->active)) {
2085 dequeue_task(p, rq->active);
2086 set_tsk_need_resched(p);
2087 p->prio = effective_prio(p);
2088 enqueue_task(p, rq->active);
2092 spin_unlock(&rq->lock);
2094 rebalance_tick(cpu, rq, NOT_IDLE);
2097 #ifdef CONFIG_SCHED_SMT
2098 static inline void wake_sleeping_dependent(int cpu, runqueue_t *rq)
2101 struct sched_domain *sd = rq->sd;
2102 cpumask_t sibling_map;
2104 if (!(sd->flags & SD_SHARE_CPUPOWER))
2107 cpus_and(sibling_map, sd->span, cpu_online_map);
2108 for_each_cpu_mask(i, sibling_map) {
2117 * If an SMT sibling task is sleeping due to priority
2118 * reasons wake it up now.
2120 if (smt_rq->curr == smt_rq->idle && smt_rq->nr_running)
2121 resched_task(smt_rq->idle);
2125 static inline int dependent_sleeper(int cpu, runqueue_t *rq, task_t *p)
2127 struct sched_domain *sd = rq->sd;
2128 cpumask_t sibling_map;
2131 if (!(sd->flags & SD_SHARE_CPUPOWER))
2134 cpus_and(sibling_map, sd->span, cpu_online_map);
2135 for_each_cpu_mask(i, sibling_map) {
2143 smt_curr = smt_rq->curr;
2146 * If a user task with lower static priority than the
2147 * running task on the SMT sibling is trying to schedule,
2148 * delay it till there is proportionately less timeslice
2149 * left of the sibling task to prevent a lower priority
2150 * task from using an unfair proportion of the
2151 * physical cpu's resources. -ck
2153 if (((smt_curr->time_slice * (100 - sd->per_cpu_gain) / 100) >
2154 task_timeslice(p) || rt_task(smt_curr)) &&
2155 p->mm && smt_curr->mm && !rt_task(p))
2159 * Reschedule a lower priority task on the SMT sibling,
2160 * or wake it up if it has been put to sleep for priority
2163 if ((((p->time_slice * (100 - sd->per_cpu_gain) / 100) >
2164 task_timeslice(smt_curr) || rt_task(p)) &&
2165 smt_curr->mm && p->mm && !rt_task(smt_curr)) ||
2166 (smt_curr == smt_rq->idle && smt_rq->nr_running))
2167 resched_task(smt_curr);
2172 static inline void wake_sleeping_dependent(int cpu, runqueue_t *rq)
2176 static inline int dependent_sleeper(int cpu, runqueue_t *rq, task_t *p)
2183 * schedule() is the main scheduler function.
2185 asmlinkage void __sched schedule(void)
2188 task_t *prev, *next;
2190 prio_array_t *array;
2191 struct list_head *queue;
2192 unsigned long long now;
2193 unsigned long run_time;
2197 * Test if we are atomic. Since do_exit() needs to call into
2198 * schedule() atomically, we ignore that path for now.
2199 * Otherwise, whine if we are scheduling when we should not be.
2201 if (likely(!(current->state & (TASK_DEAD | TASK_ZOMBIE)))) {
2202 if (unlikely(in_atomic())) {
2203 printk(KERN_ERR "bad: scheduling while atomic!\n");
2213 release_kernel_lock(prev);
2214 now = sched_clock();
2215 if (likely(now - prev->timestamp < NS_MAX_SLEEP_AVG))
2216 run_time = now - prev->timestamp;
2218 run_time = NS_MAX_SLEEP_AVG;
2221 * Tasks with interactive credits get charged less run_time
2222 * at high sleep_avg to delay them losing their interactive
2225 if (HIGH_CREDIT(prev))
2226 run_time /= (CURRENT_BONUS(prev) ? : 1);
2228 spin_lock_irq(&rq->lock);
2231 * if entering off of a kernel preemption go straight
2232 * to picking the next task.
2234 switch_count = &prev->nivcsw;
2235 if (prev->state && !(preempt_count() & PREEMPT_ACTIVE)) {
2236 switch_count = &prev->nvcsw;
2237 if (unlikely((prev->state & TASK_INTERRUPTIBLE) &&
2238 unlikely(signal_pending(prev))))
2239 prev->state = TASK_RUNNING;
2241 deactivate_task(prev, rq);
2244 cpu = smp_processor_id();
2245 if (unlikely(!rq->nr_running)) {
2246 idle_balance(cpu, rq);
2247 if (!rq->nr_running) {
2249 rq->expired_timestamp = 0;
2250 wake_sleeping_dependent(cpu, rq);
2256 if (unlikely(!array->nr_active)) {
2258 * Switch the active and expired arrays.
2260 rq->active = rq->expired;
2261 rq->expired = array;
2263 rq->expired_timestamp = 0;
2264 rq->best_expired_prio = MAX_PRIO;
2267 idx = sched_find_first_bit(array->bitmap);
2268 queue = array->queue + idx;
2269 next = list_entry(queue->next, task_t, run_list);
2271 if (dependent_sleeper(cpu, rq, next)) {
2276 if (!rt_task(next) && next->activated > 0) {
2277 unsigned long long delta = now - next->timestamp;
2279 if (next->activated == 1)
2280 delta = delta * (ON_RUNQUEUE_WEIGHT * 128 / 100) / 128;
2282 array = next->array;
2283 dequeue_task(next, array);
2284 recalc_task_prio(next, next->timestamp + delta);
2285 enqueue_task(next, array);
2287 next->activated = 0;
2290 clear_tsk_need_resched(prev);
2291 RCU_qsctr(task_cpu(prev))++;
2293 prev->sleep_avg -= run_time;
2294 if ((long)prev->sleep_avg <= 0) {
2295 prev->sleep_avg = 0;
2296 if (!(HIGH_CREDIT(prev) || LOW_CREDIT(prev)))
2297 prev->interactive_credit--;
2299 prev->timestamp = now;
2301 if (likely(prev != next)) {
2302 next->timestamp = now;
2307 prepare_arch_switch(rq, next);
2308 prev = context_switch(rq, prev, next);
2311 finish_task_switch(prev);
2313 spin_unlock_irq(&rq->lock);
2315 reacquire_kernel_lock(current);
2316 preempt_enable_no_resched();
2317 if (test_thread_flag(TIF_NEED_RESCHED))
2321 EXPORT_SYMBOL(schedule);
2323 #ifdef CONFIG_PREEMPT
2325 * this is is the entry point to schedule() from in-kernel preemption
2326 * off of preempt_enable. Kernel preemptions off return from interrupt
2327 * occur there and call schedule directly.
2329 asmlinkage void __sched preempt_schedule(void)
2331 struct thread_info *ti = current_thread_info();
2334 * If there is a non-zero preempt_count or interrupts are disabled,
2335 * we do not want to preempt the current task. Just return..
2337 if (unlikely(ti->preempt_count || irqs_disabled()))
2341 ti->preempt_count = PREEMPT_ACTIVE;
2343 ti->preempt_count = 0;
2345 /* we could miss a preemption opportunity between schedule and now */
2347 if (unlikely(test_thread_flag(TIF_NEED_RESCHED)))
2351 EXPORT_SYMBOL(preempt_schedule);
2352 #endif /* CONFIG_PREEMPT */
2354 int default_wake_function(wait_queue_t *curr, unsigned mode, int sync, void *key)
2356 task_t *p = curr->task;
2357 return try_to_wake_up(p, mode, sync);
2360 EXPORT_SYMBOL(default_wake_function);
2363 * The core wakeup function. Non-exclusive wakeups (nr_exclusive == 0) just
2364 * wake everything up. If it's an exclusive wakeup (nr_exclusive == small +ve
2365 * number) then we wake all the non-exclusive tasks and one exclusive task.
2367 * There are circumstances in which we can try to wake a task which has already
2368 * started to run but is not in state TASK_RUNNING. try_to_wake_up() returns
2369 * zero in this (rare) case, and we handle it by continuing to scan the queue.
2371 static void __wake_up_common(wait_queue_head_t *q, unsigned int mode,
2372 int nr_exclusive, int sync, void *key)
2374 struct list_head *tmp, *next;
2376 list_for_each_safe(tmp, next, &q->task_list) {
2379 curr = list_entry(tmp, wait_queue_t, task_list);
2380 flags = curr->flags;
2381 if (curr->func(curr, mode, sync, key) &&
2382 (flags & WQ_FLAG_EXCLUSIVE) &&
2389 * __wake_up - wake up threads blocked on a waitqueue.
2391 * @mode: which threads
2392 * @nr_exclusive: how many wake-one or wake-many threads to wake up
2394 void fastcall __wake_up(wait_queue_head_t *q, unsigned int mode,
2395 int nr_exclusive, void *key)
2397 unsigned long flags;
2399 spin_lock_irqsave(&q->lock, flags);
2400 __wake_up_common(q, mode, nr_exclusive, 0, key);
2401 spin_unlock_irqrestore(&q->lock, flags);
2404 EXPORT_SYMBOL(__wake_up);
2407 * Same as __wake_up but called with the spinlock in wait_queue_head_t held.
2409 void fastcall __wake_up_locked(wait_queue_head_t *q, unsigned int mode)
2411 __wake_up_common(q, mode, 1, 0, NULL);
2415 * __wake_up - sync- wake up threads blocked on a waitqueue.
2417 * @mode: which threads
2418 * @nr_exclusive: how many wake-one or wake-many threads to wake up
2420 * The sync wakeup differs that the waker knows that it will schedule
2421 * away soon, so while the target thread will be woken up, it will not
2422 * be migrated to another CPU - ie. the two threads are 'synchronized'
2423 * with each other. This can prevent needless bouncing between CPUs.
2425 * On UP it can prevent extra preemption.
2427 void fastcall __wake_up_sync(wait_queue_head_t *q, unsigned int mode, int nr_exclusive)
2429 unsigned long flags;
2435 if (unlikely(!nr_exclusive))
2438 spin_lock_irqsave(&q->lock, flags);
2439 __wake_up_common(q, mode, nr_exclusive, sync, NULL);
2440 spin_unlock_irqrestore(&q->lock, flags);
2442 EXPORT_SYMBOL_GPL(__wake_up_sync); /* For internal use only */
2444 void fastcall complete(struct completion *x)
2446 unsigned long flags;
2448 spin_lock_irqsave(&x->wait.lock, flags);
2450 __wake_up_common(&x->wait, TASK_UNINTERRUPTIBLE | TASK_INTERRUPTIBLE,
2452 spin_unlock_irqrestore(&x->wait.lock, flags);
2454 EXPORT_SYMBOL(complete);
2456 void fastcall complete_all(struct completion *x)
2458 unsigned long flags;
2460 spin_lock_irqsave(&x->wait.lock, flags);
2461 x->done += UINT_MAX/2;
2462 __wake_up_common(&x->wait, TASK_UNINTERRUPTIBLE | TASK_INTERRUPTIBLE,
2464 spin_unlock_irqrestore(&x->wait.lock, flags);
2466 EXPORT_SYMBOL(complete_all);
2468 void fastcall __sched wait_for_completion(struct completion *x)
2471 spin_lock_irq(&x->wait.lock);
2473 DECLARE_WAITQUEUE(wait, current);
2475 wait.flags |= WQ_FLAG_EXCLUSIVE;
2476 __add_wait_queue_tail(&x->wait, &wait);
2478 __set_current_state(TASK_UNINTERRUPTIBLE);
2479 spin_unlock_irq(&x->wait.lock);
2481 spin_lock_irq(&x->wait.lock);
2483 __remove_wait_queue(&x->wait, &wait);
2486 spin_unlock_irq(&x->wait.lock);
2488 EXPORT_SYMBOL(wait_for_completion);
2490 #define SLEEP_ON_VAR \
2491 unsigned long flags; \
2492 wait_queue_t wait; \
2493 init_waitqueue_entry(&wait, current);
2495 #define SLEEP_ON_HEAD \
2496 spin_lock_irqsave(&q->lock,flags); \
2497 __add_wait_queue(q, &wait); \
2498 spin_unlock(&q->lock);
2500 #define SLEEP_ON_TAIL \
2501 spin_lock_irq(&q->lock); \
2502 __remove_wait_queue(q, &wait); \
2503 spin_unlock_irqrestore(&q->lock, flags);
2505 #define SLEEP_ON_BKLCHECK \
2506 if (unlikely(!kernel_locked()) && \
2507 sleep_on_bkl_warnings < 10) { \
2508 sleep_on_bkl_warnings++; \
2512 static int sleep_on_bkl_warnings;
2514 void fastcall __sched interruptible_sleep_on(wait_queue_head_t *q)
2520 current->state = TASK_INTERRUPTIBLE;
2527 EXPORT_SYMBOL(interruptible_sleep_on);
2529 long fastcall __sched interruptible_sleep_on_timeout(wait_queue_head_t *q, long timeout)
2535 current->state = TASK_INTERRUPTIBLE;
2538 timeout = schedule_timeout(timeout);
2544 EXPORT_SYMBOL(interruptible_sleep_on_timeout);
2546 long fastcall __sched sleep_on_timeout(wait_queue_head_t *q, long timeout)
2552 current->state = TASK_UNINTERRUPTIBLE;
2555 timeout = schedule_timeout(timeout);
2561 EXPORT_SYMBOL(sleep_on_timeout);
2563 void set_user_nice(task_t *p, long nice)
2565 unsigned long flags;
2566 prio_array_t *array;
2568 int old_prio, new_prio, delta;
2570 if (TASK_NICE(p) == nice || nice < -20 || nice > 19)
2573 * We have to be careful, if called from sys_setpriority(),
2574 * the task might be in the middle of scheduling on another CPU.
2576 rq = task_rq_lock(p, &flags);
2578 * The RT priorities are set via setscheduler(), but we still
2579 * allow the 'normal' nice value to be set - but as expected
2580 * it wont have any effect on scheduling until the task is
2584 p->static_prio = NICE_TO_PRIO(nice);
2589 dequeue_task(p, array);
2592 new_prio = NICE_TO_PRIO(nice);
2593 delta = new_prio - old_prio;
2594 p->static_prio = NICE_TO_PRIO(nice);
2598 enqueue_task(p, array);
2600 * If the task increased its priority or is running and
2601 * lowered its priority, then reschedule its CPU:
2603 if (delta < 0 || (delta > 0 && task_running(rq, p)))
2604 resched_task(rq->curr);
2607 task_rq_unlock(rq, &flags);
2610 EXPORT_SYMBOL(set_user_nice);
2612 #ifdef __ARCH_WANT_SYS_NICE
2615 * sys_nice - change the priority of the current process.
2616 * @increment: priority increment
2618 * sys_setpriority is a more generic, but much slower function that
2619 * does similar things.
2621 asmlinkage long sys_nice(int increment)
2627 * Setpriority might change our priority at the same moment.
2628 * We don't have to worry. Conceptually one call occurs first
2629 * and we have a single winner.
2631 if (increment < 0) {
2632 if (!capable(CAP_SYS_NICE))
2634 if (increment < -40)
2640 nice = PRIO_TO_NICE(current->static_prio) + increment;
2646 retval = security_task_setnice(current, nice);
2650 set_user_nice(current, nice);
2657 * task_prio - return the priority value of a given task.
2658 * @p: the task in question.
2660 * This is the priority value as seen by users in /proc.
2661 * RT tasks are offset by -200. Normal tasks are centered
2662 * around 0, value goes from -16 to +15.
2664 int task_prio(const task_t *p)
2666 return p->prio - MAX_RT_PRIO;
2670 * task_nice - return the nice value of a given task.
2671 * @p: the task in question.
2673 int task_nice(const task_t *p)
2675 return TASK_NICE(p);
2678 EXPORT_SYMBOL(task_nice);
2681 * idle_cpu - is a given cpu idle currently?
2682 * @cpu: the processor in question.
2684 int idle_cpu(int cpu)
2686 return cpu_curr(cpu) == cpu_rq(cpu)->idle;
2689 EXPORT_SYMBOL_GPL(idle_cpu);
2692 * find_process_by_pid - find a process with a matching PID value.
2693 * @pid: the pid in question.
2695 static inline task_t *find_process_by_pid(pid_t pid)
2697 return pid ? find_task_by_pid(pid) : current;
2700 /* Actually do priority change: must hold rq lock. */
2701 static void __setscheduler(struct task_struct *p, int policy, int prio)
2705 p->rt_priority = prio;
2706 if (policy != SCHED_NORMAL)
2707 p->prio = MAX_USER_RT_PRIO-1 - p->rt_priority;
2709 p->prio = p->static_prio;
2713 * setscheduler - change the scheduling policy and/or RT priority of a thread.
2715 static int setscheduler(pid_t pid, int policy, struct sched_param __user *param)
2717 struct sched_param lp;
2718 int retval = -EINVAL;
2720 prio_array_t *array;
2721 unsigned long flags;
2725 if (!param || pid < 0)
2729 if (copy_from_user(&lp, param, sizeof(struct sched_param)))
2733 * We play safe to avoid deadlocks.
2735 read_lock_irq(&tasklist_lock);
2737 p = find_process_by_pid(pid);
2741 goto out_unlock_tasklist;
2744 * To be able to change p->policy safely, the apropriate
2745 * runqueue lock must be held.
2747 rq = task_rq_lock(p, &flags);
2753 if (policy != SCHED_FIFO && policy != SCHED_RR &&
2754 policy != SCHED_NORMAL)
2759 * Valid priorities for SCHED_FIFO and SCHED_RR are
2760 * 1..MAX_USER_RT_PRIO-1, valid priority for SCHED_NORMAL is 0.
2763 if (lp.sched_priority < 0 || lp.sched_priority > MAX_USER_RT_PRIO-1)
2765 if ((policy == SCHED_NORMAL) != (lp.sched_priority == 0))
2769 if ((policy == SCHED_FIFO || policy == SCHED_RR) &&
2770 !capable(CAP_SYS_NICE))
2772 if ((current->euid != p->euid) && (current->euid != p->uid) &&
2773 !capable(CAP_SYS_NICE))
2776 retval = security_task_setscheduler(p, policy, &lp);
2782 deactivate_task(p, task_rq(p));
2785 __setscheduler(p, policy, lp.sched_priority);
2787 __activate_task(p, task_rq(p));
2789 * Reschedule if we are currently running on this runqueue and
2790 * our priority decreased, or if we are not currently running on
2791 * this runqueue and our priority is higher than the current's
2793 if (task_running(rq, p)) {
2794 if (p->prio > oldprio)
2795 resched_task(rq->curr);
2796 } else if (TASK_PREEMPTS_CURR(p, rq))
2797 resched_task(rq->curr);
2801 task_rq_unlock(rq, &flags);
2802 out_unlock_tasklist:
2803 read_unlock_irq(&tasklist_lock);
2810 * sys_sched_setscheduler - set/change the scheduler policy and RT priority
2811 * @pid: the pid in question.
2812 * @policy: new policy
2813 * @param: structure containing the new RT priority.
2815 asmlinkage long sys_sched_setscheduler(pid_t pid, int policy,
2816 struct sched_param __user *param)
2818 return setscheduler(pid, policy, param);
2822 * sys_sched_setparam - set/change the RT priority of a thread
2823 * @pid: the pid in question.
2824 * @param: structure containing the new RT priority.
2826 asmlinkage long sys_sched_setparam(pid_t pid, struct sched_param __user *param)
2828 return setscheduler(pid, -1, param);
2832 * sys_sched_getscheduler - get the policy (scheduling class) of a thread
2833 * @pid: the pid in question.
2835 asmlinkage long sys_sched_getscheduler(pid_t pid)
2837 int retval = -EINVAL;
2844 read_lock(&tasklist_lock);
2845 p = find_process_by_pid(pid);
2847 retval = security_task_getscheduler(p);
2851 read_unlock(&tasklist_lock);
2858 * sys_sched_getscheduler - get the RT priority of a thread
2859 * @pid: the pid in question.
2860 * @param: structure containing the RT priority.
2862 asmlinkage long sys_sched_getparam(pid_t pid, struct sched_param __user *param)
2864 struct sched_param lp;
2865 int retval = -EINVAL;
2868 if (!param || pid < 0)
2871 read_lock(&tasklist_lock);
2872 p = find_process_by_pid(pid);
2877 retval = security_task_getscheduler(p);
2881 lp.sched_priority = p->rt_priority;
2882 read_unlock(&tasklist_lock);
2885 * This one might sleep, we cannot do it with a spinlock held ...
2887 retval = copy_to_user(param, &lp, sizeof(*param)) ? -EFAULT : 0;
2893 read_unlock(&tasklist_lock);
2898 * sys_sched_setaffinity - set the cpu affinity of a process
2899 * @pid: pid of the process
2900 * @len: length in bytes of the bitmask pointed to by user_mask_ptr
2901 * @user_mask_ptr: user-space pointer to the new cpu mask
2903 asmlinkage long sys_sched_setaffinity(pid_t pid, unsigned int len,
2904 unsigned long __user *user_mask_ptr)
2910 if (len < sizeof(new_mask))
2913 if (copy_from_user(&new_mask, user_mask_ptr, sizeof(new_mask)))
2917 read_lock(&tasklist_lock);
2919 p = find_process_by_pid(pid);
2921 read_unlock(&tasklist_lock);
2922 unlock_cpu_hotplug();
2927 * It is not safe to call set_cpus_allowed with the
2928 * tasklist_lock held. We will bump the task_struct's
2929 * usage count and then drop tasklist_lock.
2932 read_unlock(&tasklist_lock);
2935 if ((current->euid != p->euid) && (current->euid != p->uid) &&
2936 !capable(CAP_SYS_NICE))
2939 retval = set_cpus_allowed(p, new_mask);
2943 unlock_cpu_hotplug();
2948 * sys_sched_getaffinity - get the cpu affinity of a process
2949 * @pid: pid of the process
2950 * @len: length in bytes of the bitmask pointed to by user_mask_ptr
2951 * @user_mask_ptr: user-space pointer to hold the current cpu mask
2953 asmlinkage long sys_sched_getaffinity(pid_t pid, unsigned int len,
2954 unsigned long __user *user_mask_ptr)
2956 unsigned int real_len;
2961 real_len = sizeof(mask);
2966 read_lock(&tasklist_lock);
2969 p = find_process_by_pid(pid);
2974 cpus_and(mask, p->cpus_allowed, cpu_possible_map);
2977 read_unlock(&tasklist_lock);
2978 unlock_cpu_hotplug();
2981 if (copy_to_user(user_mask_ptr, &mask, real_len))
2987 * sys_sched_yield - yield the current processor to other threads.
2989 * this function yields the current CPU by moving the calling thread
2990 * to the expired array. If there are no other threads running on this
2991 * CPU then this function will return.
2993 asmlinkage long sys_sched_yield(void)
2995 runqueue_t *rq = this_rq_lock();
2996 prio_array_t *array = current->array;
2997 prio_array_t *target = rq->expired;
3000 * We implement yielding by moving the task into the expired
3003 * (special rule: RT tasks will just roundrobin in the active
3006 if (unlikely(rt_task(current)))
3007 target = rq->active;
3009 dequeue_task(current, array);
3010 enqueue_task(current, target);
3013 * Since we are going to call schedule() anyway, there's
3014 * no need to preempt or enable interrupts:
3016 _raw_spin_unlock(&rq->lock);
3017 preempt_enable_no_resched();
3024 void __sched __cond_resched(void)
3026 set_current_state(TASK_RUNNING);
3030 EXPORT_SYMBOL(__cond_resched);
3033 * yield - yield the current processor to other threads.
3035 * this is a shortcut for kernel-space yielding - it marks the
3036 * thread runnable and calls sys_sched_yield().
3038 void __sched yield(void)
3040 set_current_state(TASK_RUNNING);
3044 EXPORT_SYMBOL(yield);
3047 * This task is about to go to sleep on IO. Increment rq->nr_iowait so
3048 * that process accounting knows that this is a task in IO wait state.
3050 * But don't do that if it is a deliberate, throttling IO wait (this task
3051 * has set its backing_dev_info: the queue against which it should throttle)
3053 void __sched io_schedule(void)
3055 struct runqueue *rq = this_rq();
3057 atomic_inc(&rq->nr_iowait);
3059 atomic_dec(&rq->nr_iowait);
3062 EXPORT_SYMBOL(io_schedule);
3064 long __sched io_schedule_timeout(long timeout)
3066 struct runqueue *rq = this_rq();
3069 atomic_inc(&rq->nr_iowait);
3070 ret = schedule_timeout(timeout);
3071 atomic_dec(&rq->nr_iowait);
3076 * sys_sched_get_priority_max - return maximum RT priority.
3077 * @policy: scheduling class.
3079 * this syscall returns the maximum rt_priority that can be used
3080 * by a given scheduling class.
3082 asmlinkage long sys_sched_get_priority_max(int policy)
3089 ret = MAX_USER_RT_PRIO-1;
3099 * sys_sched_get_priority_min - return minimum RT priority.
3100 * @policy: scheduling class.
3102 * this syscall returns the minimum rt_priority that can be used
3103 * by a given scheduling class.
3105 asmlinkage long sys_sched_get_priority_min(int policy)
3121 * sys_sched_rr_get_interval - return the default timeslice of a process.
3122 * @pid: pid of the process.
3123 * @interval: userspace pointer to the timeslice value.
3125 * this syscall writes the default timeslice value of a given process
3126 * into the user-space timespec buffer. A value of '0' means infinity.
3129 long sys_sched_rr_get_interval(pid_t pid, struct timespec __user *interval)
3131 int retval = -EINVAL;
3139 read_lock(&tasklist_lock);
3140 p = find_process_by_pid(pid);
3144 retval = security_task_getscheduler(p);
3148 jiffies_to_timespec(p->policy & SCHED_FIFO ?
3149 0 : task_timeslice(p), &t);
3150 read_unlock(&tasklist_lock);
3151 retval = copy_to_user(interval, &t, sizeof(t)) ? -EFAULT : 0;
3155 read_unlock(&tasklist_lock);
3159 static inline struct task_struct *eldest_child(struct task_struct *p)
3161 if (list_empty(&p->children)) return NULL;
3162 return list_entry(p->children.next,struct task_struct,sibling);
3165 static inline struct task_struct *older_sibling(struct task_struct *p)
3167 if (p->sibling.prev==&p->parent->children) return NULL;
3168 return list_entry(p->sibling.prev,struct task_struct,sibling);
3171 static inline struct task_struct *younger_sibling(struct task_struct *p)
3173 if (p->sibling.next==&p->parent->children) return NULL;
3174 return list_entry(p->sibling.next,struct task_struct,sibling);
3177 static void show_task(task_t * p)
3181 unsigned long free = 0;
3182 static const char *stat_nam[] = { "R", "S", "D", "T", "Z", "W" };
3184 printk("%-13.13s ", p->comm);
3185 state = p->state ? __ffs(p->state) + 1 : 0;
3186 if (state < ARRAY_SIZE(stat_nam))
3187 printk(stat_nam[state]);
3190 #if (BITS_PER_LONG == 32)
3191 if (state == TASK_RUNNING)
3192 printk(" running ");
3194 printk(" %08lX ", thread_saved_pc(p));
3196 if (state == TASK_RUNNING)
3197 printk(" running task ");
3199 printk(" %016lx ", thread_saved_pc(p));
3201 #ifdef CONFIG_DEBUG_STACK_USAGE
3203 unsigned long * n = (unsigned long *) (p->thread_info+1);
3206 free = (unsigned long) n - (unsigned long)(p->thread_info+1);
3209 printk("%5lu %5d %6d ", free, p->pid, p->parent->pid);
3210 if ((relative = eldest_child(p)))
3211 printk("%5d ", relative->pid);
3214 if ((relative = younger_sibling(p)))
3215 printk("%7d", relative->pid);
3218 if ((relative = older_sibling(p)))
3219 printk(" %5d", relative->pid);
3223 printk(" (L-TLB)\n");
3225 printk(" (NOTLB)\n");
3227 if (state != TASK_RUNNING)
3228 show_stack(p, NULL);
3231 void show_state(void)
3235 #if (BITS_PER_LONG == 32)
3238 printk(" task PC pid father child younger older\n");
3242 printk(" task PC pid father child younger older\n");
3244 read_lock(&tasklist_lock);
3245 do_each_thread(g, p) {
3247 * reset the NMI-timeout, listing all files on a slow
3248 * console might take alot of time:
3250 touch_nmi_watchdog();
3252 } while_each_thread(g, p);
3254 read_unlock(&tasklist_lock);
3257 void __devinit init_idle(task_t *idle, int cpu)
3259 runqueue_t *idle_rq = cpu_rq(cpu), *rq = cpu_rq(task_cpu(idle));
3260 unsigned long flags;
3262 local_irq_save(flags);
3263 double_rq_lock(idle_rq, rq);
3265 idle_rq->curr = idle_rq->idle = idle;
3266 deactivate_task(idle, rq);
3268 idle->prio = MAX_PRIO;
3269 idle->state = TASK_RUNNING;
3270 set_task_cpu(idle, cpu);
3271 double_rq_unlock(idle_rq, rq);
3272 set_tsk_need_resched(idle);
3273 local_irq_restore(flags);
3275 /* Set the preempt count _outside_ the spinlocks! */
3276 #ifdef CONFIG_PREEMPT
3277 idle->thread_info->preempt_count = (idle->lock_depth >= 0);
3279 idle->thread_info->preempt_count = 0;
3284 * In a system that switches off the HZ timer nohz_cpu_mask
3285 * indicates which cpus entered this state. This is used
3286 * in the rcu update to wait only for active cpus. For system
3287 * which do not switch off the HZ timer nohz_cpu_mask should
3288 * always be CPU_MASK_NONE.
3290 cpumask_t nohz_cpu_mask = CPU_MASK_NONE;
3294 * This is how migration works:
3296 * 1) we queue a migration_req_t structure in the source CPU's
3297 * runqueue and wake up that CPU's migration thread.
3298 * 2) we down() the locked semaphore => thread blocks.
3299 * 3) migration thread wakes up (implicitly it forces the migrated
3300 * thread off the CPU)
3301 * 4) it gets the migration request and checks whether the migrated
3302 * task is still in the wrong runqueue.
3303 * 5) if it's in the wrong runqueue then the migration thread removes
3304 * it and puts it into the right queue.
3305 * 6) migration thread up()s the semaphore.
3306 * 7) we wake up and the migration is done.
3310 * Change a given task's CPU affinity. Migrate the thread to a
3311 * proper CPU and schedule it away if the CPU it's executing on
3312 * is removed from the allowed bitmask.
3314 * NOTE: the caller must have a valid reference to the task, the
3315 * task must not exit() & deallocate itself prematurely. The
3316 * call is not atomic; no spinlocks may be held.
3318 int set_cpus_allowed(task_t *p, cpumask_t new_mask)
3320 unsigned long flags;
3322 migration_req_t req;
3325 rq = task_rq_lock(p, &flags);
3326 if (any_online_cpu(new_mask) == NR_CPUS) {
3331 p->cpus_allowed = new_mask;
3332 /* Can the task run on the task's current CPU? If so, we're done */
3333 if (cpu_isset(task_cpu(p), new_mask))
3336 if (migrate_task(p, any_online_cpu(new_mask), &req)) {
3337 /* Need help from migration thread: drop lock and wait. */
3338 task_rq_unlock(rq, &flags);
3339 wake_up_process(rq->migration_thread);
3340 wait_for_completion(&req.done);
3344 task_rq_unlock(rq, &flags);
3348 EXPORT_SYMBOL_GPL(set_cpus_allowed);
3351 * Move (not current) task off this cpu, onto dest cpu. We're doing
3352 * this because either it can't run here any more (set_cpus_allowed()
3353 * away from this CPU, or CPU going down), or because we're
3354 * attempting to rebalance this task on exec (sched_balance_exec).
3356 * So we race with normal scheduler movements, but that's OK, as long
3357 * as the task is no longer on this CPU.
3359 static void __migrate_task(struct task_struct *p, int src_cpu, int dest_cpu)
3361 runqueue_t *rq_dest, *rq_src;
3363 if (unlikely(cpu_is_offline(dest_cpu)))
3366 rq_src = cpu_rq(src_cpu);
3367 rq_dest = cpu_rq(dest_cpu);
3369 double_rq_lock(rq_src, rq_dest);
3370 /* Already moved. */
3371 if (task_cpu(p) != src_cpu)
3373 /* Affinity changed (again). */
3374 if (!cpu_isset(dest_cpu, p->cpus_allowed))
3377 set_task_cpu(p, dest_cpu);
3380 * Sync timestamp with rq_dest's before activating.
3381 * The same thing could be achieved by doing this step
3382 * afterwards, and pretending it was a local activate.
3383 * This way is cleaner and logically correct.
3385 p->timestamp = p->timestamp - rq_src->timestamp_last_tick
3386 + rq_dest->timestamp_last_tick;
3387 deactivate_task(p, rq_src);
3388 activate_task(p, rq_dest, 0);
3389 if (TASK_PREEMPTS_CURR(p, rq_dest))
3390 resched_task(rq_dest->curr);
3394 double_rq_unlock(rq_src, rq_dest);
3398 * migration_thread - this is a highprio system thread that performs
3399 * thread migration by bumping thread off CPU then 'pushing' onto
3402 static int migration_thread(void * data)
3405 int cpu = (long)data;
3408 BUG_ON(rq->migration_thread != current);
3410 set_current_state(TASK_INTERRUPTIBLE);
3411 while (!kthread_should_stop()) {
3412 struct list_head *head;
3413 migration_req_t *req;
3415 if (current->flags & PF_FREEZE)
3416 refrigerator(PF_FREEZE);
3418 spin_lock_irq(&rq->lock);
3420 if (cpu_is_offline(cpu)) {
3421 spin_unlock_irq(&rq->lock);
3425 if (rq->active_balance) {
3426 active_load_balance(rq, cpu);
3427 rq->active_balance = 0;
3430 head = &rq->migration_queue;
3432 if (list_empty(head)) {
3433 spin_unlock_irq(&rq->lock);
3435 set_current_state(TASK_INTERRUPTIBLE);
3438 req = list_entry(head->next, migration_req_t, list);
3439 list_del_init(head->next);
3441 if (req->type == REQ_MOVE_TASK) {
3442 spin_unlock(&rq->lock);
3443 __migrate_task(req->task, smp_processor_id(),
3446 } else if (req->type == REQ_SET_DOMAIN) {
3448 spin_unlock_irq(&rq->lock);
3450 spin_unlock_irq(&rq->lock);
3454 complete(&req->done);
3456 __set_current_state(TASK_RUNNING);
3460 /* Wait for kthread_stop */
3461 set_current_state(TASK_INTERRUPTIBLE);
3462 while (!kthread_should_stop()) {
3464 set_current_state(TASK_INTERRUPTIBLE);
3466 __set_current_state(TASK_RUNNING);
3470 #ifdef CONFIG_HOTPLUG_CPU
3471 /* migrate_all_tasks - function to migrate all tasks from the dead cpu. */
3472 static void migrate_all_tasks(int src_cpu)
3474 struct task_struct *tsk, *t;
3478 write_lock_irq(&tasklist_lock);
3480 /* watch out for per node tasks, let's stay on this node */
3481 node = cpu_to_node(src_cpu);
3483 do_each_thread(t, tsk) {
3488 if (task_cpu(tsk) != src_cpu)
3491 /* Figure out where this task should go (attempting to
3492 * keep it on-node), and check if it can be migrated
3493 * as-is. NOTE that kernel threads bound to more than
3494 * one online cpu will be migrated. */
3495 mask = node_to_cpumask(node);
3496 cpus_and(mask, mask, tsk->cpus_allowed);
3497 dest_cpu = any_online_cpu(mask);
3498 if (dest_cpu == NR_CPUS)
3499 dest_cpu = any_online_cpu(tsk->cpus_allowed);
3500 if (dest_cpu == NR_CPUS) {
3501 cpus_clear(tsk->cpus_allowed);
3502 cpus_complement(tsk->cpus_allowed);
3503 dest_cpu = any_online_cpu(tsk->cpus_allowed);
3505 /* Don't tell them about moving exiting tasks
3506 or kernel threads (both mm NULL), since
3507 they never leave kernel. */
3508 if (tsk->mm && printk_ratelimit())
3509 printk(KERN_INFO "process %d (%s) no "
3510 "longer affine to cpu%d\n",
3511 tsk->pid, tsk->comm, src_cpu);
3514 __migrate_task(tsk, src_cpu, dest_cpu);
3515 } while_each_thread(t, tsk);
3517 write_unlock_irq(&tasklist_lock);
3520 /* Schedules idle task to be the next runnable task on current CPU.
3521 * It does so by boosting its priority to highest possible and adding it to
3522 * the _front_ of runqueue. Used by CPU offline code.
3524 void sched_idle_next(void)
3526 int cpu = smp_processor_id();
3527 runqueue_t *rq = this_rq();
3528 struct task_struct *p = rq->idle;
3529 unsigned long flags;
3531 /* cpu has to be offline */
3532 BUG_ON(cpu_online(cpu));
3534 /* Strictly not necessary since rest of the CPUs are stopped by now
3535 * and interrupts disabled on current cpu.
3537 spin_lock_irqsave(&rq->lock, flags);
3539 __setscheduler(p, SCHED_FIFO, MAX_RT_PRIO-1);
3540 /* Add idle task to _front_ of it's priority queue */
3541 __activate_idle_task(p, rq);
3543 spin_unlock_irqrestore(&rq->lock, flags);
3545 #endif /* CONFIG_HOTPLUG_CPU */
3548 * migration_call - callback that gets triggered when a CPU is added.
3549 * Here we can start up the necessary migration thread for the new CPU.
3551 static int migration_call(struct notifier_block *nfb, unsigned long action,
3554 int cpu = (long)hcpu;
3555 struct task_struct *p;
3556 struct runqueue *rq;
3557 unsigned long flags;
3560 case CPU_UP_PREPARE:
3561 p = kthread_create(migration_thread, hcpu, "migration/%d",cpu);
3564 kthread_bind(p, cpu);
3565 /* Must be high prio: stop_machine expects to yield to it. */
3566 rq = task_rq_lock(p, &flags);
3567 __setscheduler(p, SCHED_FIFO, MAX_RT_PRIO-1);
3568 task_rq_unlock(rq, &flags);
3569 cpu_rq(cpu)->migration_thread = p;
3572 /* Strictly unneccessary, as first user will wake it. */
3573 wake_up_process(cpu_rq(cpu)->migration_thread);
3575 #ifdef CONFIG_HOTPLUG_CPU
3576 case CPU_UP_CANCELED:
3577 /* Unbind it from offline cpu so it can run. Fall thru. */
3578 kthread_bind(cpu_rq(cpu)->migration_thread,smp_processor_id());
3579 kthread_stop(cpu_rq(cpu)->migration_thread);
3580 cpu_rq(cpu)->migration_thread = NULL;
3583 migrate_all_tasks(cpu);
3585 kthread_stop(rq->migration_thread);
3586 rq->migration_thread = NULL;
3587 /* Idle task back to normal (off runqueue, low prio) */
3588 rq = task_rq_lock(rq->idle, &flags);
3589 deactivate_task(rq->idle, rq);
3590 rq->idle->static_prio = MAX_PRIO;
3591 __setscheduler(rq->idle, SCHED_NORMAL, 0);
3592 task_rq_unlock(rq, &flags);
3593 BUG_ON(rq->nr_running != 0);
3595 /* No need to migrate the tasks: it was best-effort if
3596 * they didn't do lock_cpu_hotplug(). Just wake up
3597 * the requestors. */
3598 spin_lock_irq(&rq->lock);
3599 while (!list_empty(&rq->migration_queue)) {
3600 migration_req_t *req;
3601 req = list_entry(rq->migration_queue.next,
3602 migration_req_t, list);
3603 BUG_ON(req->type != REQ_MOVE_TASK);
3604 list_del_init(&req->list);
3605 complete(&req->done);
3607 spin_unlock_irq(&rq->lock);
3614 /* Register at highest priority so that task migration (migrate_all_tasks)
3615 * happens before everything else.
3617 static struct notifier_block __devinitdata migration_notifier = {
3618 .notifier_call = migration_call,
3622 int __init migration_init(void)
3624 void *cpu = (void *)(long)smp_processor_id();
3625 /* Start one for boot CPU. */
3626 migration_call(&migration_notifier, CPU_UP_PREPARE, cpu);
3627 migration_call(&migration_notifier, CPU_ONLINE, cpu);
3628 register_cpu_notifier(&migration_notifier);
3634 * The 'big kernel lock'
3636 * This spinlock is taken and released recursively by lock_kernel()
3637 * and unlock_kernel(). It is transparently dropped and reaquired
3638 * over schedule(). It is used to protect legacy code that hasn't
3639 * been migrated to a proper locking design yet.
3641 * Don't use in new code.
3643 * Note: spinlock debugging needs this even on !CONFIG_SMP.
3645 spinlock_t kernel_flag __cacheline_aligned_in_smp = SPIN_LOCK_UNLOCKED;
3646 EXPORT_SYMBOL(kernel_flag);
3649 /* Attach the domain 'sd' to 'cpu' as its base domain */
3650 void cpu_attach_domain(struct sched_domain *sd, int cpu)
3652 migration_req_t req;
3653 unsigned long flags;
3654 runqueue_t *rq = cpu_rq(cpu);
3659 spin_lock_irqsave(&rq->lock, flags);
3661 if (cpu == smp_processor_id() || !cpu_online(cpu)) {
3664 init_completion(&req.done);
3665 req.type = REQ_SET_DOMAIN;
3667 list_add(&req.list, &rq->migration_queue);
3671 spin_unlock_irqrestore(&rq->lock, flags);
3674 wake_up_process(rq->migration_thread);
3675 wait_for_completion(&req.done);
3678 unlock_cpu_hotplug();
3681 #ifdef ARCH_HAS_SCHED_DOMAIN
3682 extern void __init arch_init_sched_domains(void);
3684 static struct sched_group sched_group_cpus[NR_CPUS];
3685 static DEFINE_PER_CPU(struct sched_domain, cpu_domains);
3687 static struct sched_group sched_group_nodes[MAX_NUMNODES];
3688 static DEFINE_PER_CPU(struct sched_domain, node_domains);
3689 static void __init arch_init_sched_domains(void)
3692 struct sched_group *first_node = NULL, *last_node = NULL;
3694 /* Set up domains */
3696 int node = cpu_to_node(i);
3697 cpumask_t nodemask = node_to_cpumask(node);
3698 struct sched_domain *node_sd = &per_cpu(node_domains, i);
3699 struct sched_domain *cpu_sd = &per_cpu(cpu_domains, i);
3701 *node_sd = SD_NODE_INIT;
3702 node_sd->span = cpu_possible_map;
3703 node_sd->groups = &sched_group_nodes[cpu_to_node(i)];
3705 *cpu_sd = SD_CPU_INIT;
3706 cpus_and(cpu_sd->span, nodemask, cpu_possible_map);
3707 cpu_sd->groups = &sched_group_cpus[i];
3708 cpu_sd->parent = node_sd;
3712 for (i = 0; i < MAX_NUMNODES; i++) {
3713 cpumask_t tmp = node_to_cpumask(i);
3715 struct sched_group *first_cpu = NULL, *last_cpu = NULL;
3716 struct sched_group *node = &sched_group_nodes[i];
3719 cpus_and(nodemask, tmp, cpu_possible_map);
3721 if (cpus_empty(nodemask))
3724 node->cpumask = nodemask;
3725 node->cpu_power = SCHED_LOAD_SCALE * cpus_weight(node->cpumask);
3727 for_each_cpu_mask(j, node->cpumask) {
3728 struct sched_group *cpu = &sched_group_cpus[j];
3730 cpus_clear(cpu->cpumask);
3731 cpu_set(j, cpu->cpumask);
3732 cpu->cpu_power = SCHED_LOAD_SCALE;
3737 last_cpu->next = cpu;
3740 last_cpu->next = first_cpu;
3745 last_node->next = node;
3748 last_node->next = first_node;
3752 struct sched_domain *cpu_sd = &per_cpu(cpu_domains, i);
3753 cpu_attach_domain(cpu_sd, i);
3757 #else /* !CONFIG_NUMA */
3758 static void __init arch_init_sched_domains(void)
3761 struct sched_group *first_cpu = NULL, *last_cpu = NULL;
3763 /* Set up domains */
3765 struct sched_domain *cpu_sd = &per_cpu(cpu_domains, i);
3767 *cpu_sd = SD_CPU_INIT;
3768 cpu_sd->span = cpu_possible_map;
3769 cpu_sd->groups = &sched_group_cpus[i];
3772 /* Set up CPU groups */
3773 for_each_cpu_mask(i, cpu_possible_map) {
3774 struct sched_group *cpu = &sched_group_cpus[i];
3776 cpus_clear(cpu->cpumask);
3777 cpu_set(i, cpu->cpumask);
3778 cpu->cpu_power = SCHED_LOAD_SCALE;
3783 last_cpu->next = cpu;
3786 last_cpu->next = first_cpu;
3788 mb(); /* domains were modified outside the lock */
3790 struct sched_domain *cpu_sd = &per_cpu(cpu_domains, i);
3791 cpu_attach_domain(cpu_sd, i);
3795 #endif /* CONFIG_NUMA */
3796 #endif /* ARCH_HAS_SCHED_DOMAIN */
3798 #define SCHED_DOMAIN_DEBUG
3799 #ifdef SCHED_DOMAIN_DEBUG
3800 void sched_domain_debug(void)
3805 runqueue_t *rq = cpu_rq(i);
3806 struct sched_domain *sd;
3811 printk(KERN_WARNING "CPU%d: %s\n",
3812 i, (cpu_online(i) ? " online" : "offline"));
3817 struct sched_group *group = sd->groups;
3818 cpumask_t groupmask, tmp;
3820 cpumask_scnprintf(str, NR_CPUS, sd->span);
3821 cpus_clear(groupmask);
3824 for (j = 0; j < level + 1; j++)
3826 printk("domain %d: span %s\n", level, str);
3828 if (!cpu_isset(i, sd->span))
3829 printk(KERN_WARNING "ERROR domain->span does not contain CPU%d\n", i);
3830 if (!cpu_isset(i, group->cpumask))
3831 printk(KERN_WARNING "ERROR domain->groups does not contain CPU%d\n", i);
3832 if (!group->cpu_power)
3833 printk(KERN_WARNING "ERROR domain->cpu_power not set\n");
3835 printk(KERN_WARNING);
3836 for (j = 0; j < level + 2; j++)
3841 printk(" ERROR: NULL");
3845 if (!cpus_weight(group->cpumask))
3846 printk(" ERROR empty group:");
3848 cpus_and(tmp, groupmask, group->cpumask);
3849 if (cpus_weight(tmp) > 0)
3850 printk(" ERROR repeated CPUs:");
3852 cpus_or(groupmask, groupmask, group->cpumask);
3854 cpumask_scnprintf(str, NR_CPUS, group->cpumask);
3857 group = group->next;
3858 } while (group != sd->groups);
3861 if (!cpus_equal(sd->span, groupmask))
3862 printk(KERN_DEBUG "ERROR groups don't span domain->span\n");
3868 cpus_and(tmp, groupmask, sd->span);
3869 if (!cpus_equal(tmp, groupmask))
3870 printk(KERN_WARNING "ERROR parent span is not a superset of domain->span\n");
3877 #define sched_domain_debug() {}
3880 void __init sched_init_smp(void)
3882 arch_init_sched_domains();
3883 sched_domain_debug();
3886 void __init sched_init_smp(void)
3889 #endif /* CONFIG_SMP */
3891 int in_sched_functions(unsigned long addr)
3893 /* Linker adds these: start and end of __sched functions */
3894 extern char __sched_text_start[], __sched_text_end[];
3895 return addr >= (unsigned long)__sched_text_start
3896 && addr < (unsigned long)__sched_text_end;
3899 void __init sched_init(void)
3905 /* Set up an initial dummy domain for early boot */
3906 static struct sched_domain sched_domain_init;
3907 static struct sched_group sched_group_init;
3908 cpumask_t cpu_mask_all = CPU_MASK_ALL;
3910 memset(&sched_domain_init, 0, sizeof(struct sched_domain));
3911 sched_domain_init.span = cpu_mask_all;
3912 sched_domain_init.groups = &sched_group_init;
3913 sched_domain_init.last_balance = jiffies;
3914 sched_domain_init.balance_interval = INT_MAX; /* Don't balance */
3916 memset(&sched_group_init, 0, sizeof(struct sched_group));
3917 sched_group_init.cpumask = cpu_mask_all;
3918 sched_group_init.next = &sched_group_init;
3919 sched_group_init.cpu_power = SCHED_LOAD_SCALE;
3922 for (i = 0; i < NR_CPUS; i++) {
3923 prio_array_t *array;
3926 spin_lock_init(&rq->lock);
3927 rq->active = rq->arrays;
3928 rq->expired = rq->arrays + 1;
3929 rq->best_expired_prio = MAX_PRIO;
3932 rq->sd = &sched_domain_init;
3934 rq->active_balance = 0;
3936 rq->migration_thread = NULL;
3937 INIT_LIST_HEAD(&rq->migration_queue);
3939 atomic_set(&rq->nr_iowait, 0);
3941 for (j = 0; j < 2; j++) {
3942 array = rq->arrays + j;
3943 for (k = 0; k < MAX_PRIO; k++) {
3944 INIT_LIST_HEAD(array->queue + k);
3945 __clear_bit(k, array->bitmap);
3947 // delimiter for bitsearch
3948 __set_bit(MAX_PRIO, array->bitmap);
3952 * We have to do a little magic to get the first
3953 * thread right in SMP mode.
3958 set_task_cpu(current, smp_processor_id());
3959 wake_up_forked_process(current);
3962 * The boot idle thread does lazy MMU switching as well:
3964 atomic_inc(&init_mm.mm_count);
3965 enter_lazy_tlb(&init_mm, current);
3968 #ifdef CONFIG_DEBUG_SPINLOCK_SLEEP
3969 void __might_sleep(char *file, int line)
3971 #if defined(in_atomic)
3972 static unsigned long prev_jiffy; /* ratelimiting */
3974 if ((in_atomic() || irqs_disabled()) &&
3975 system_state == SYSTEM_RUNNING) {
3976 if (time_before(jiffies, prev_jiffy + HZ) && prev_jiffy)
3978 prev_jiffy = jiffies;
3979 printk(KERN_ERR "Debug: sleeping function called from invalid"
3980 " context at %s:%d\n", file, line);
3981 printk("in_atomic():%d, irqs_disabled():%d\n",
3982 in_atomic(), irqs_disabled());
3987 EXPORT_SYMBOL(__might_sleep);
3991 #if defined(CONFIG_SMP) && defined(CONFIG_PREEMPT)
3993 * This could be a long-held lock. If another CPU holds it for a long time,
3994 * and that CPU is not asked to reschedule then *this* CPU will spin on the
3995 * lock for a long time, even if *this* CPU is asked to reschedule.
3997 * So what we do here, in the slow (contended) path is to spin on the lock by
3998 * hand while permitting preemption.
4000 * Called inside preempt_disable().
4002 void __sched __preempt_spin_lock(spinlock_t *lock)
4004 if (preempt_count() > 1) {
4005 _raw_spin_lock(lock);
4010 while (spin_is_locked(lock))
4013 } while (!_raw_spin_trylock(lock));
4016 EXPORT_SYMBOL(__preempt_spin_lock);
4018 void __sched __preempt_write_lock(rwlock_t *lock)
4020 if (preempt_count() > 1) {
4021 _raw_write_lock(lock);
4027 while (rwlock_is_locked(lock))
4030 } while (!_raw_write_trylock(lock));
4033 EXPORT_SYMBOL(__preempt_write_lock);
4034 #endif /* defined(CONFIG_SMP) && defined(CONFIG_PREEMPT) */