2 * Copyright (c) 1999 Peter Wemm <peter@FreeBSD.org>
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
26 * $DragonFly: src/sys/kern/usched_bsd4.c,v 1.26 2008/11/01 23:31:19 dillon Exp $
29 #include <sys/param.h>
30 #include <sys/systm.h>
31 #include <sys/kernel.h>
33 #include <sys/queue.h>
35 #include <sys/rtprio.h>
37 #include <sys/sysctl.h>
38 #include <sys/resourcevar.h>
39 #include <sys/spinlock.h>
40 #include <machine/cpu.h>
41 #include <machine/smp.h>
43 #include <sys/thread2.h>
44 #include <sys/spinlock2.h>
45 #include <sys/mplock2.h>
48 * Priorities. Note that with 32 run queues per scheduler each queue
49 * represents four priority levels.
53 #define PRIMASK (MAXPRI - 1)
54 #define PRIBASE_REALTIME 0
55 #define PRIBASE_NORMAL MAXPRI
56 #define PRIBASE_IDLE (MAXPRI * 2)
57 #define PRIBASE_THREAD (MAXPRI * 3)
58 #define PRIBASE_NULL (MAXPRI * 4)
60 #define NQS 32 /* 32 run queues. */
61 #define PPQ (MAXPRI / NQS) /* priorities per queue */
62 #define PPQMASK (PPQ - 1)
65 * NICEPPQ - number of nice units per priority queue
66 * ESTCPURAMP - number of scheduler ticks for estcpu to switch queues
68 * ESTCPUPPQ - number of estcpu units per priority queue
69 * ESTCPUMAX - number of estcpu units
70 * ESTCPUINCR - amount we have to increment p_estcpu per scheduling tick at
76 #define ESTCPUMAX (ESTCPUPPQ * NQS)
77 #define ESTCPUINCR (ESTCPUPPQ / ESTCPURAMP)
78 #define PRIO_RANGE (PRIO_MAX - PRIO_MIN + 1)
80 #define ESTCPULIM(v) min((v), ESTCPUMAX)
84 #define lwp_priority lwp_usdata.bsd4.priority
85 #define lwp_rqindex lwp_usdata.bsd4.rqindex
86 #define lwp_origcpu lwp_usdata.bsd4.origcpu
87 #define lwp_estcpu lwp_usdata.bsd4.estcpu
88 #define lwp_rqtype lwp_usdata.bsd4.rqtype
90 static void bsd4_acquire_curproc(struct lwp *lp);
91 static void bsd4_release_curproc(struct lwp *lp);
92 static void bsd4_select_curproc(globaldata_t gd);
93 static void bsd4_setrunqueue(struct lwp *lp);
94 static void bsd4_schedulerclock(struct lwp *lp, sysclock_t period,
96 static void bsd4_recalculate_estcpu(struct lwp *lp);
97 static void bsd4_resetpriority(struct lwp *lp);
98 static void bsd4_forking(struct lwp *plp, struct lwp *lp);
99 static void bsd4_exiting(struct lwp *plp, struct lwp *lp);
100 static void bsd4_yield(struct lwp *lp);
103 static void need_user_resched_remote(void *dummy);
105 static struct lwp *chooseproc_locked(struct lwp *chklp);
106 static void bsd4_remrunqueue_locked(struct lwp *lp);
107 static void bsd4_setrunqueue_locked(struct lwp *lp);
109 struct usched usched_bsd4 = {
111 "bsd4", "Original DragonFly Scheduler",
112 NULL, /* default registration */
113 NULL, /* default deregistration */
114 bsd4_acquire_curproc,
115 bsd4_release_curproc,
118 bsd4_recalculate_estcpu,
122 NULL, /* setcpumask not supported */
126 struct usched_bsd4_pcpu {
127 struct thread helper_thread;
130 struct lwp *uschedcp;
133 typedef struct usched_bsd4_pcpu *bsd4_pcpu_t;
136 * We have NQS (32) run queues per scheduling class. For the normal
137 * class, there are 128 priorities scaled onto these 32 queues. New
138 * processes are added to the last entry in each queue, and processes
139 * are selected for running by taking them from the head and maintaining
140 * a simple FIFO arrangement. Realtime and Idle priority processes have
141 * and explicit 0-31 priority which maps directly onto their class queue
142 * index. When a queue has something in it, the corresponding bit is
143 * set in the queuebits variable, allowing a single read to determine
144 * the state of all 32 queues and then a ffs() to find the first busy
147 static struct rq bsd4_queues[NQS];
148 static struct rq bsd4_rtqueues[NQS];
149 static struct rq bsd4_idqueues[NQS];
150 static u_int32_t bsd4_queuebits;
151 static u_int32_t bsd4_rtqueuebits;
152 static u_int32_t bsd4_idqueuebits;
153 static cpumask_t bsd4_curprocmask = -1; /* currently running a user process */
154 static cpumask_t bsd4_rdyprocmask; /* ready to accept a user process */
155 static int bsd4_runqcount;
157 static volatile int bsd4_scancpu;
159 static struct spinlock bsd4_spin;
160 static struct usched_bsd4_pcpu bsd4_pcpu[MAXCPU];
162 SYSCTL_INT(_debug, OID_AUTO, bsd4_runqcount, CTLFLAG_RD, &bsd4_runqcount, 0,
163 "Number of run queues");
165 static int usched_nonoptimal;
166 SYSCTL_INT(_debug, OID_AUTO, usched_nonoptimal, CTLFLAG_RW,
167 &usched_nonoptimal, 0, "acquire_curproc() was not optimal");
168 static int usched_optimal;
169 SYSCTL_INT(_debug, OID_AUTO, usched_optimal, CTLFLAG_RW,
170 &usched_optimal, 0, "acquire_curproc() was optimal");
172 static int usched_debug = -1;
173 SYSCTL_INT(_debug, OID_AUTO, scdebug, CTLFLAG_RW, &usched_debug, 0,
174 "Print debug information for this pid");
176 static int remote_resched_nonaffinity;
177 static int remote_resched_affinity;
178 static int choose_affinity;
179 SYSCTL_INT(_debug, OID_AUTO, remote_resched_nonaffinity, CTLFLAG_RD,
180 &remote_resched_nonaffinity, 0, "Number of remote rescheds");
181 SYSCTL_INT(_debug, OID_AUTO, remote_resched_affinity, CTLFLAG_RD,
182 &remote_resched_affinity, 0, "Number of remote rescheds");
183 SYSCTL_INT(_debug, OID_AUTO, choose_affinity, CTLFLAG_RD,
184 &choose_affinity, 0, "chooseproc() was smart");
187 static int usched_bsd4_rrinterval = (ESTCPUFREQ + 9) / 10;
188 SYSCTL_INT(_kern, OID_AUTO, usched_bsd4_rrinterval, CTLFLAG_RW,
189 &usched_bsd4_rrinterval, 0, "");
190 static int usched_bsd4_decay = ESTCPUINCR / 2;
191 SYSCTL_INT(_kern, OID_AUTO, usched_bsd4_decay, CTLFLAG_RW,
192 &usched_bsd4_decay, 0, "");
195 * Initialize the run queues at boot time.
202 spin_init(&bsd4_spin);
203 for (i = 0; i < NQS; i++) {
204 TAILQ_INIT(&bsd4_queues[i]);
205 TAILQ_INIT(&bsd4_rtqueues[i]);
206 TAILQ_INIT(&bsd4_idqueues[i]);
208 atomic_clear_cpumask(&bsd4_curprocmask, 1);
210 SYSINIT(runqueue, SI_BOOT2_USCHED, SI_ORDER_FIRST, rqinit, NULL)
213 * BSD4_ACQUIRE_CURPROC
215 * This function is called when the kernel intends to return to userland.
216 * It is responsible for making the thread the current designated userland
217 * thread for this cpu, blocking if necessary.
219 * The kernel has already depressed our LWKT priority so we must not switch
220 * until we have either assigned or disposed of the thread.
222 * WARNING! THIS FUNCTION IS ALLOWED TO CAUSE THE CURRENT THREAD TO MIGRATE
223 * TO ANOTHER CPU! Because most of the kernel assumes that no migration will
224 * occur, this function is called only under very controlled circumstances.
229 bsd4_acquire_curproc(struct lwp *lp)
236 bsd4_recalculate_estcpu(lp);
239 * If a reschedule was requested give another thread the
242 if (user_resched_wanted()) {
243 clear_user_resched();
244 bsd4_release_curproc(lp);
248 * Loop until we are the current user thread
252 * Reload after a switch or setrunqueue/switch possibly
253 * moved us to another cpu.
255 /*clear_lwkt_resched();*/
257 dd = &bsd4_pcpu[gd->gd_cpuid];
260 * Become the currently scheduled user thread for this cpu
261 * if we can do so trivially.
263 * We can steal another thread's current thread designation
264 * on this cpu since if we are running that other thread
265 * must not be, so we can safely deschedule it.
267 if (dd->uschedcp == lp) {
269 * We are already the current lwp (hot path).
271 dd->upri = lp->lwp_priority;
272 } else if (dd->uschedcp == NULL) {
274 * We can trivially become the current lwp.
276 atomic_set_cpumask(&bsd4_curprocmask, gd->gd_cpumask);
278 dd->upri = lp->lwp_priority;
279 } else if (dd->upri > lp->lwp_priority) {
281 * We can steal the current lwp designation from the
282 * olp that was previously assigned to this cpu.
286 dd->upri = lp->lwp_priority;
287 lwkt_deschedule(olp->lwp_thread);
288 bsd4_setrunqueue(olp);
291 * We cannot become the current lwp, place the lp
292 * on the bsd4 run-queue and deschedule ourselves.
294 lwkt_deschedule(lp->lwp_thread);
295 bsd4_setrunqueue(lp);
300 * Other threads at our current user priority have already
301 * put in their bids, but we must run any kernel threads
302 * at higher priorities, and we could lose our bid to
303 * another thread trying to return to user mode in the
306 * If we lose our bid we will be descheduled and put on
307 * the run queue. When we are reactivated we will have
310 if (lwkt_resched_wanted() ||
311 lp->lwp_thread->td_fairq_accum < 0) {
314 } while (dd->uschedcp != lp);
317 KKASSERT((lp->lwp_flag & LWP_ONRUNQ) == 0);
321 * BSD4_RELEASE_CURPROC
323 * This routine detaches the current thread from the userland scheduler,
324 * usually because the thread needs to run or block in the kernel (at
325 * kernel priority) for a while.
327 * This routine is also responsible for selecting a new thread to
328 * make the current thread.
330 * NOTE: This implementation differs from the dummy example in that
331 * bsd4_select_curproc() is able to select the current process, whereas
332 * dummy_select_curproc() is not able to select the current process.
333 * This means we have to NULL out uschedcp.
335 * Additionally, note that we may already be on a run queue if releasing
336 * via the lwkt_switch() in bsd4_setrunqueue().
341 bsd4_release_curproc(struct lwp *lp)
343 globaldata_t gd = mycpu;
344 bsd4_pcpu_t dd = &bsd4_pcpu[gd->gd_cpuid];
346 if (dd->uschedcp == lp) {
348 KKASSERT((lp->lwp_flag & LWP_ONRUNQ) == 0);
349 dd->uschedcp = NULL; /* don't let lp be selected */
350 dd->upri = PRIBASE_NULL;
351 atomic_clear_cpumask(&bsd4_curprocmask, gd->gd_cpumask);
352 bsd4_select_curproc(gd);
358 * BSD4_SELECT_CURPROC
360 * Select a new current process for this cpu and clear any pending user
361 * reschedule request. The cpu currently has no current process.
363 * This routine is also responsible for equal-priority round-robining,
364 * typically triggered from bsd4_schedulerclock(). In our dummy example
365 * all the 'user' threads are LWKT scheduled all at once and we just
366 * call lwkt_switch().
368 * The calling process is not on the queue and cannot be selected.
374 bsd4_select_curproc(globaldata_t gd)
376 bsd4_pcpu_t dd = &bsd4_pcpu[gd->gd_cpuid];
378 int cpuid = gd->gd_cpuid;
382 spin_lock(&bsd4_spin);
383 if ((nlp = chooseproc_locked(dd->uschedcp)) != NULL) {
384 atomic_set_cpumask(&bsd4_curprocmask, CPUMASK(cpuid));
385 dd->upri = nlp->lwp_priority;
387 spin_unlock(&bsd4_spin);
389 lwkt_acquire(nlp->lwp_thread);
391 lwkt_schedule(nlp->lwp_thread);
393 spin_unlock(&bsd4_spin);
396 } else if (bsd4_runqcount && (bsd4_rdyprocmask & CPUMASK(cpuid))) {
397 atomic_clear_cpumask(&bsd4_rdyprocmask, CPUMASK(cpuid));
398 spin_unlock(&bsd4_spin);
399 lwkt_schedule(&dd->helper_thread);
401 spin_unlock(&bsd4_spin);
410 * Place the specified lwp on the user scheduler's run queue. This routine
411 * must be called with the thread descheduled. The lwp must be runnable.
413 * The thread may be the current thread as a special case.
418 bsd4_setrunqueue(struct lwp *lp)
429 * First validate the process state relative to the current cpu.
430 * We don't need the spinlock for this, just a critical section.
431 * We are in control of the process.
434 KASSERT(lp->lwp_stat == LSRUN, ("setrunqueue: lwp not LSRUN"));
435 KASSERT((lp->lwp_flag & LWP_ONRUNQ) == 0,
436 ("lwp %d/%d already on runq! flag %08x/%08x", lp->lwp_proc->p_pid,
437 lp->lwp_tid, lp->lwp_proc->p_flag, lp->lwp_flag));
438 KKASSERT((lp->lwp_thread->td_flags & TDF_RUNQ) == 0);
441 * Note: gd and dd are relative to the target thread's last cpu,
442 * NOT our current cpu.
444 gd = lp->lwp_thread->td_gd;
445 dd = &bsd4_pcpu[gd->gd_cpuid];
448 * This process is not supposed to be scheduled anywhere or assigned
449 * as the current process anywhere. Assert the condition.
451 KKASSERT(dd->uschedcp != lp);
455 * If we are not SMP we do not have a scheduler helper to kick
456 * and must directly activate the process if none are scheduled.
458 * This is really only an issue when bootstrapping init since
459 * the caller in all other cases will be a user process, and
460 * even if released (dd->uschedcp == NULL), that process will
461 * kickstart the scheduler when it returns to user mode from
464 if (dd->uschedcp == NULL) {
465 atomic_set_cpumask(&bsd4_curprocmask, gd->gd_cpumask);
467 dd->upri = lp->lwp_priority;
468 lwkt_schedule(lp->lwp_thread);
476 * XXX fixme. Could be part of a remrunqueue/setrunqueue
477 * operation when the priority is recalculated, so TDF_MIGRATING
478 * may already be set.
480 if ((lp->lwp_thread->td_flags & TDF_MIGRATING) == 0)
481 lwkt_giveaway(lp->lwp_thread);
485 * We lose control of lp the moment we release the spinlock after
486 * having placed lp on the queue. i.e. another cpu could pick it
487 * up and it could exit, or its priority could be further adjusted,
488 * or something like that.
490 spin_lock(&bsd4_spin);
491 bsd4_setrunqueue_locked(lp);
495 * Kick the scheduler helper on one of the other cpu's
496 * and request a reschedule if appropriate.
498 * NOTE: We check all cpus whos rdyprocmask is set. First we
499 * look for cpus without designated lps, then we look for
500 * cpus with designated lps with a worse priority than our
504 cpuid = (bsd4_scancpu & 0xFFFF) % ncpus;
505 mask = ~bsd4_curprocmask & bsd4_rdyprocmask & lp->lwp_cpumask &
506 smp_active_mask & usched_global_cpumask;
509 tmpmask = ~(CPUMASK(cpuid) - 1);
511 cpuid = BSFCPUMASK(mask & tmpmask);
513 cpuid = BSFCPUMASK(mask);
514 gd = globaldata_find(cpuid);
515 dd = &bsd4_pcpu[cpuid];
517 if ((dd->upri & ~PPQMASK) >= (lp->lwp_priority & ~PPQMASK))
519 mask &= ~CPUMASK(cpuid);
523 * Then cpus which might have a currently running lp
525 mask = bsd4_curprocmask & bsd4_rdyprocmask &
526 lp->lwp_cpumask & smp_active_mask & usched_global_cpumask;
529 tmpmask = ~(CPUMASK(cpuid) - 1);
531 cpuid = BSFCPUMASK(mask & tmpmask);
533 cpuid = BSFCPUMASK(mask);
534 gd = globaldata_find(cpuid);
535 dd = &bsd4_pcpu[cpuid];
537 if ((dd->upri & ~PPQMASK) > (lp->lwp_priority & ~PPQMASK))
539 mask &= ~CPUMASK(cpuid);
543 * If we cannot find a suitable cpu we reload from bsd4_scancpu
544 * and round-robin. Other cpus will pickup as they release their
545 * current lwps or become ready.
547 * Avoid a degenerate system lockup case if usched_global_cpumask
548 * is set to 0 or otherwise does not cover lwp_cpumask.
550 * We only kick the target helper thread in this case, we do not
551 * set the user resched flag because
553 cpuid = (bsd4_scancpu & 0xFFFF) % ncpus;
554 if ((CPUMASK(cpuid) & usched_global_cpumask) == 0) {
557 gd = globaldata_find(cpuid);
558 dd = &bsd4_pcpu[cpuid];
561 spin_unlock(&bsd4_spin);
562 if ((dd->upri & ~PPQMASK) > (lp->lwp_priority & ~PPQMASK)) {
563 if (dd->uschedcp == NULL) {
564 lwkt_schedule(&dd->helper_thread);
570 atomic_clear_cpumask(&bsd4_rdyprocmask, CPUMASK(cpuid));
571 spin_unlock(&bsd4_spin);
572 if ((dd->upri & ~PPQMASK) > (lp->lwp_priority & ~PPQMASK))
573 lwkt_send_ipiq(gd, need_user_resched_remote, NULL);
575 lwkt_schedule(&dd->helper_thread);
579 * Request a reschedule if appropriate.
581 spin_unlock(&bsd4_spin);
582 if ((dd->upri & ~PPQMASK) > (lp->lwp_priority & ~PPQMASK)) {
590 * This routine is called from a systimer IPI. It MUST be MP-safe and
591 * the BGL IS NOT HELD ON ENTRY. This routine is called at ESTCPUFREQ on
598 bsd4_schedulerclock(struct lwp *lp, sysclock_t period, sysclock_t cpstamp)
600 globaldata_t gd = mycpu;
601 bsd4_pcpu_t dd = &bsd4_pcpu[gd->gd_cpuid];
604 * Do we need to round-robin? We round-robin 10 times a second.
605 * This should only occur for cpu-bound batch processes.
607 if (++dd->rrcount >= usched_bsd4_rrinterval) {
613 * As the process accumulates cpu time p_estcpu is bumped and may
614 * push the process into another scheduling queue. It typically
615 * takes 4 ticks to bump the queue.
617 lp->lwp_estcpu = ESTCPULIM(lp->lwp_estcpu + ESTCPUINCR);
620 * Reducing p_origcpu over time causes more of our estcpu to be
621 * returned to the parent when we exit. This is a small tweak
622 * for the batch detection heuristic.
628 * Spinlocks also hold a critical section so there should not be
631 KKASSERT(gd->gd_spinlocks_wr == 0);
633 bsd4_resetpriority(lp);
636 * if we can't call bsd4_resetpriority for some reason we must call
637 * need user_resched().
644 * Called from acquire and from kern_synch's one-second timer (one of the
645 * callout helper threads) with a critical section held.
647 * Decay p_estcpu based on the number of ticks we haven't been running
648 * and our p_nice. As the load increases each process observes a larger
649 * number of idle ticks (because other processes are running in them).
650 * This observation leads to a larger correction which tends to make the
651 * system more 'batchy'.
653 * Note that no recalculation occurs for a process which sleeps and wakes
654 * up in the same tick. That is, a system doing thousands of context
655 * switches per second will still only do serious estcpu calculations
656 * ESTCPUFREQ times per second.
662 bsd4_recalculate_estcpu(struct lwp *lp)
664 globaldata_t gd = mycpu;
672 * We have to subtract periodic to get the last schedclock
673 * timeout time, otherwise we would get the upcoming timeout.
674 * Keep in mind that a process can migrate between cpus and
675 * while the scheduler clock should be very close, boundary
676 * conditions could lead to a small negative delta.
678 cpbase = gd->gd_schedclock.time - gd->gd_schedclock.periodic;
680 if (lp->lwp_slptime > 1) {
682 * Too much time has passed, do a coarse correction.
684 lp->lwp_estcpu = lp->lwp_estcpu >> 1;
685 bsd4_resetpriority(lp);
686 lp->lwp_cpbase = cpbase;
688 } else if (lp->lwp_cpbase != cpbase) {
690 * Adjust estcpu if we are in a different tick. Don't waste
691 * time if we are in the same tick.
693 * First calculate the number of ticks in the measurement
694 * interval. The nticks calculation can wind up 0 due to
695 * a bug in the handling of lwp_slptime (as yet not found),
696 * so make sure we do not get a divide by 0 panic.
698 nticks = (cpbase - lp->lwp_cpbase) / gd->gd_schedclock.periodic;
701 updatepcpu(lp, lp->lwp_cpticks, nticks);
703 if ((nleft = nticks - lp->lwp_cpticks) < 0)
705 if (usched_debug == lp->lwp_proc->p_pid) {
706 kprintf("pid %d tid %d estcpu %d cpticks %d nticks %d nleft %d",
707 lp->lwp_proc->p_pid, lp->lwp_tid, lp->lwp_estcpu,
708 lp->lwp_cpticks, nticks, nleft);
712 * Calculate a decay value based on ticks remaining scaled
713 * down by the instantanious load and p_nice.
715 if ((loadfac = bsd4_runqcount) < 2)
717 ndecay = nleft * usched_bsd4_decay * 2 *
718 (PRIO_MAX * 2 - lp->lwp_proc->p_nice) / (loadfac * PRIO_MAX * 2);
721 * Adjust p_estcpu. Handle a border case where batch jobs
722 * can get stalled long enough to decay to zero when they
725 if (lp->lwp_estcpu > ndecay * 2)
726 lp->lwp_estcpu -= ndecay;
728 lp->lwp_estcpu >>= 1;
730 if (usched_debug == lp->lwp_proc->p_pid)
731 kprintf(" ndecay %d estcpu %d\n", ndecay, lp->lwp_estcpu);
732 bsd4_resetpriority(lp);
733 lp->lwp_cpbase = cpbase;
739 * Compute the priority of a process when running in user mode.
740 * Arrange to reschedule if the resulting priority is better
741 * than that of the current process.
743 * This routine may be called with any process.
745 * This routine is called by fork1() for initial setup with the process
746 * of the run queue, and also may be called normally with the process on or
752 bsd4_resetpriority(struct lwp *lp)
760 * Calculate the new priority and queue type
763 spin_lock(&bsd4_spin);
765 newrqtype = lp->lwp_rtprio.type;
768 case RTP_PRIO_REALTIME:
770 newpriority = PRIBASE_REALTIME +
771 (lp->lwp_rtprio.prio & PRIMASK);
773 case RTP_PRIO_NORMAL:
774 newpriority = (lp->lwp_proc->p_nice - PRIO_MIN) * PPQ / NICEPPQ;
775 newpriority += lp->lwp_estcpu * PPQ / ESTCPUPPQ;
776 newpriority = newpriority * MAXPRI / (PRIO_RANGE * PPQ /
777 NICEPPQ + ESTCPUMAX * PPQ / ESTCPUPPQ);
778 newpriority = PRIBASE_NORMAL + (newpriority & PRIMASK);
781 newpriority = PRIBASE_IDLE + (lp->lwp_rtprio.prio & PRIMASK);
783 case RTP_PRIO_THREAD:
784 newpriority = PRIBASE_THREAD + (lp->lwp_rtprio.prio & PRIMASK);
787 panic("Bad RTP_PRIO %d", newrqtype);
792 * The newpriority incorporates the queue type so do a simple masked
793 * check to determine if the process has moved to another queue. If
794 * it has, and it is currently on a run queue, then move it.
796 if ((lp->lwp_priority ^ newpriority) & ~PPQMASK) {
797 lp->lwp_priority = newpriority;
798 if (lp->lwp_flag & LWP_ONRUNQ) {
799 bsd4_remrunqueue_locked(lp);
800 lp->lwp_rqtype = newrqtype;
801 lp->lwp_rqindex = (newpriority & PRIMASK) / PPQ;
802 bsd4_setrunqueue_locked(lp);
803 reschedcpu = lp->lwp_thread->td_gd->gd_cpuid;
805 lp->lwp_rqtype = newrqtype;
806 lp->lwp_rqindex = (newpriority & PRIMASK) / PPQ;
810 lp->lwp_priority = newpriority;
815 * Determine if we need to reschedule the target cpu. This only
816 * occurs if the LWP is already on a scheduler queue, which means
817 * that idle cpu notification has already occured. At most we
818 * need only issue a need_user_resched() on the appropriate cpu.
820 * The LWP may be owned by a CPU different from the current one,
821 * in which case dd->uschedcp may be modified without an MP lock
822 * or a spinlock held. The worst that happens is that the code
823 * below causes a spurious need_user_resched() on the target CPU
824 * and dd->pri to be wrong for a short period of time, both of
825 * which are harmless.
827 if (reschedcpu >= 0) {
828 dd = &bsd4_pcpu[reschedcpu];
829 if ((bsd4_rdyprocmask & CPUMASK(reschedcpu)) &&
830 (dd->upri & ~PRIMASK) > (lp->lwp_priority & ~PRIMASK)) {
832 if (reschedcpu == mycpu->gd_cpuid) {
833 spin_unlock(&bsd4_spin);
836 spin_unlock(&bsd4_spin);
837 atomic_clear_cpumask(&bsd4_rdyprocmask,
838 CPUMASK(reschedcpu));
839 lwkt_send_ipiq(lp->lwp_thread->td_gd,
840 need_user_resched_remote, NULL);
843 spin_unlock(&bsd4_spin);
847 spin_unlock(&bsd4_spin);
850 spin_unlock(&bsd4_spin);
860 bsd4_yield(struct lwp *lp)
863 /* FUTURE (or something similar) */
864 switch(lp->lwp_rqtype) {
865 case RTP_PRIO_NORMAL:
866 lp->lwp_estcpu = ESTCPULIM(lp->lwp_estcpu + ESTCPUINCR);
876 * Called from fork1() when a new child process is being created.
878 * Give the child process an initial estcpu that is more batch then
879 * its parent and dock the parent for the fork (but do not
880 * reschedule the parent). This comprises the main part of our batch
881 * detection heuristic for both parallel forking and sequential execs.
883 * Interactive processes will decay the boosted estcpu quickly while batch
884 * processes will tend to compound it.
885 * XXX lwp should be "spawning" instead of "forking"
890 bsd4_forking(struct lwp *plp, struct lwp *lp)
892 lp->lwp_estcpu = ESTCPULIM(plp->lwp_estcpu + ESTCPUPPQ);
893 lp->lwp_origcpu = lp->lwp_estcpu;
894 plp->lwp_estcpu = ESTCPULIM(plp->lwp_estcpu + ESTCPUPPQ);
898 * Called when the parent reaps a child. Propogate cpu use by the child
899 * back to the parent.
904 bsd4_exiting(struct lwp *plp, struct lwp *lp)
908 if (plp->lwp_proc->p_pid != 1) {
909 delta = lp->lwp_estcpu - lp->lwp_origcpu;
911 plp->lwp_estcpu = ESTCPULIM(plp->lwp_estcpu + delta);
917 * chooseproc() is called when a cpu needs a user process to LWKT schedule,
918 * it selects a user process and returns it. If chklp is non-NULL and chklp
919 * has a better or equal priority then the process that would otherwise be
920 * chosen, NULL is returned.
922 * Until we fix the RUNQ code the chklp test has to be strict or we may
923 * bounce between processes trying to acquire the current process designation.
925 * MPSAFE - must be called with bsd4_spin exclusive held. The spinlock is
926 * left intact through the entire routine.
930 chooseproc_locked(struct lwp *chklp)
934 u_int32_t *which, *which2;
941 rtqbits = bsd4_rtqueuebits;
942 tsqbits = bsd4_queuebits;
943 idqbits = bsd4_idqueuebits;
944 cpumask = mycpu->gd_cpumask;
951 q = &bsd4_rtqueues[pri];
952 which = &bsd4_rtqueuebits;
954 } else if (tsqbits) {
956 q = &bsd4_queues[pri];
957 which = &bsd4_queuebits;
959 } else if (idqbits) {
961 q = &bsd4_idqueues[pri];
962 which = &bsd4_idqueuebits;
968 KASSERT(lp, ("chooseproc: no lwp on busy queue"));
971 while ((lp->lwp_cpumask & cpumask) == 0) {
972 lp = TAILQ_NEXT(lp, lwp_procq);
974 *which2 &= ~(1 << pri);
981 * If the passed lwp <chklp> is reasonably close to the selected
982 * lwp <lp>, return NULL (indicating that <chklp> should be kept).
984 * Note that we must error on the side of <chklp> to avoid bouncing
985 * between threads in the acquire code.
988 if (chklp->lwp_priority < lp->lwp_priority + PPQ)
994 * If the chosen lwp does not reside on this cpu spend a few
995 * cycles looking for a better candidate at the same priority level.
996 * This is a fallback check, setrunqueue() tries to wakeup the
997 * correct cpu and is our front-line affinity.
999 if (lp->lwp_thread->td_gd != mycpu &&
1000 (chklp = TAILQ_NEXT(lp, lwp_procq)) != NULL
1002 if (chklp->lwp_thread->td_gd == mycpu) {
1009 TAILQ_REMOVE(q, lp, lwp_procq);
1012 *which &= ~(1 << pri);
1013 KASSERT((lp->lwp_flag & LWP_ONRUNQ) != 0, ("not on runq6!"));
1014 lp->lwp_flag &= ~LWP_ONRUNQ;
1022 need_user_resched_remote(void *dummy)
1024 globaldata_t gd = mycpu;
1025 bsd4_pcpu_t dd = &bsd4_pcpu[gd->gd_cpuid];
1027 need_user_resched();
1028 lwkt_schedule(&dd->helper_thread);
1034 * bsd4_remrunqueue_locked() removes a given process from the run queue
1035 * that it is on, clearing the queue busy bit if it becomes empty.
1037 * Note that user process scheduler is different from the LWKT schedule.
1038 * The user process scheduler only manages user processes but it uses LWKT
1039 * underneath, and a user process operating in the kernel will often be
1040 * 'released' from our management.
1042 * MPSAFE - bsd4_spin must be held exclusively on call
1045 bsd4_remrunqueue_locked(struct lwp *lp)
1051 KKASSERT(lp->lwp_flag & LWP_ONRUNQ);
1052 lp->lwp_flag &= ~LWP_ONRUNQ;
1054 KKASSERT(bsd4_runqcount >= 0);
1056 pri = lp->lwp_rqindex;
1057 switch(lp->lwp_rqtype) {
1058 case RTP_PRIO_NORMAL:
1059 q = &bsd4_queues[pri];
1060 which = &bsd4_queuebits;
1062 case RTP_PRIO_REALTIME:
1064 q = &bsd4_rtqueues[pri];
1065 which = &bsd4_rtqueuebits;
1068 q = &bsd4_idqueues[pri];
1069 which = &bsd4_idqueuebits;
1072 panic("remrunqueue: invalid rtprio type");
1075 TAILQ_REMOVE(q, lp, lwp_procq);
1076 if (TAILQ_EMPTY(q)) {
1077 KASSERT((*which & (1 << pri)) != 0,
1078 ("remrunqueue: remove from empty queue"));
1079 *which &= ~(1 << pri);
1084 * bsd4_setrunqueue_locked()
1086 * Add a process whos rqtype and rqindex had previously been calculated
1087 * onto the appropriate run queue. Determine if the addition requires
1088 * a reschedule on a cpu and return the cpuid or -1.
1090 * NOTE: Lower priorities are better priorities.
1092 * MPSAFE - bsd4_spin must be held exclusively on call
1095 bsd4_setrunqueue_locked(struct lwp *lp)
1101 KKASSERT((lp->lwp_flag & LWP_ONRUNQ) == 0);
1102 lp->lwp_flag |= LWP_ONRUNQ;
1105 pri = lp->lwp_rqindex;
1107 switch(lp->lwp_rqtype) {
1108 case RTP_PRIO_NORMAL:
1109 q = &bsd4_queues[pri];
1110 which = &bsd4_queuebits;
1112 case RTP_PRIO_REALTIME:
1114 q = &bsd4_rtqueues[pri];
1115 which = &bsd4_rtqueuebits;
1118 q = &bsd4_idqueues[pri];
1119 which = &bsd4_idqueuebits;
1122 panic("remrunqueue: invalid rtprio type");
1127 * Add to the correct queue and set the appropriate bit. If no
1128 * lower priority (i.e. better) processes are in the queue then
1129 * we want a reschedule, calculate the best cpu for the job.
1131 * Always run reschedules on the LWPs original cpu.
1133 TAILQ_INSERT_TAIL(q, lp, lwp_procq);
1140 * For SMP systems a user scheduler helper thread is created for each
1141 * cpu and is used to allow one cpu to wakeup another for the purposes of
1142 * scheduling userland threads from setrunqueue().
1144 * UP systems do not need the helper since there is only one cpu.
1146 * We can't use the idle thread for this because we might block.
1147 * Additionally, doing things this way allows us to HLT idle cpus
1153 sched_thread(void *dummy)
1166 cpuid = gd->gd_cpuid; /* doesn't change */
1167 mask = gd->gd_cpumask; /* doesn't change */
1168 dd = &bsd4_pcpu[cpuid];
1171 * Since we are woken up only when no user processes are scheduled
1172 * on a cpu, we can run at an ultra low priority.
1174 lwkt_setpri_self(TDPRI_USER_SCHEDULER);
1178 * We use the LWKT deschedule-interlock trick to avoid racing
1179 * bsd4_rdyprocmask. This means we cannot block through to the
1180 * manual lwkt_switch() call we make below.
1183 lwkt_deschedule_self(gd->gd_curthread);
1184 spin_lock(&bsd4_spin);
1185 atomic_set_cpumask(&bsd4_rdyprocmask, mask);
1187 clear_user_resched(); /* This satisfied the reschedule request */
1188 dd->rrcount = 0; /* Reset the round-robin counter */
1190 if ((bsd4_curprocmask & mask) == 0) {
1192 * No thread is currently scheduled.
1194 KKASSERT(dd->uschedcp == NULL);
1195 if ((nlp = chooseproc_locked(NULL)) != NULL) {
1196 atomic_set_cpumask(&bsd4_curprocmask, mask);
1197 dd->upri = nlp->lwp_priority;
1199 spin_unlock(&bsd4_spin);
1200 lwkt_acquire(nlp->lwp_thread);
1201 lwkt_schedule(nlp->lwp_thread);
1203 spin_unlock(&bsd4_spin);
1205 } else if (bsd4_runqcount) {
1206 if ((nlp = chooseproc_locked(dd->uschedcp)) != NULL) {
1207 dd->upri = nlp->lwp_priority;
1209 spin_unlock(&bsd4_spin);
1210 lwkt_acquire(nlp->lwp_thread);
1211 lwkt_schedule(nlp->lwp_thread);
1214 * CHAINING CONDITION TRAIN
1216 * We could not deal with the scheduler wakeup
1217 * request on this cpu, locate a ready scheduler
1218 * with no current lp assignment and chain to it.
1220 * This ensures that a wakeup race which fails due
1221 * to priority test does not leave other unscheduled
1222 * cpus idle when the runqueue is not empty.
1224 tmpmask = ~bsd4_curprocmask & bsd4_rdyprocmask &
1227 tmpid = BSFCPUMASK(tmpmask);
1228 gd = globaldata_find(cpuid);
1229 dd = &bsd4_pcpu[cpuid];
1230 atomic_clear_cpumask(&bsd4_rdyprocmask,
1232 spin_unlock(&bsd4_spin);
1233 lwkt_schedule(&dd->helper_thread);
1235 spin_unlock(&bsd4_spin);
1240 * The runq is empty.
1242 spin_unlock(&bsd4_spin);
1250 * Setup our scheduler helpers. Note that curprocmask bit 0 has already
1251 * been cleared by rqinit() and we should not mess with it further.
1254 sched_thread_cpu_init(void)
1259 kprintf("start scheduler helpers on cpus:");
1261 for (i = 0; i < ncpus; ++i) {
1262 bsd4_pcpu_t dd = &bsd4_pcpu[i];
1263 cpumask_t mask = CPUMASK(i);
1265 if ((mask & smp_active_mask) == 0)
1271 lwkt_create(sched_thread, NULL, NULL, &dd->helper_thread,
1272 TDF_STOPREQ, i, "usched %d", i);
1275 * Allow user scheduling on the target cpu. cpu #0 has already
1276 * been enabled in rqinit().
1279 atomic_clear_cpumask(&bsd4_curprocmask, mask);
1280 atomic_set_cpumask(&bsd4_rdyprocmask, mask);
1281 dd->upri = PRIBASE_NULL;
1286 SYSINIT(uschedtd, SI_BOOT2_USCHED, SI_ORDER_SECOND,
1287 sched_thread_cpu_init, NULL)