-
Notifications
You must be signed in to change notification settings - Fork 117
/
usched_dummy.c
560 lines (515 loc) · 15 KB
/
usched_dummy.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
/*
* Copyright (c) 2006 The DragonFly Project. All rights reserved.
*
* This code is derived from software contributed to The DragonFly Project
* by Matthew Dillon <dillon@backplane.com>
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
* 3. Neither the name of The DragonFly Project nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific, prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
* COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING,
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
* AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
* $DragonFly: src/sys/kern/usched_dummy.c,v 1.9 2008/04/21 15:24:46 dillon Exp $
*/
#include <sys/param.h>
#include <sys/systm.h>
#include <sys/kernel.h>
#include <sys/lock.h>
#include <sys/queue.h>
#include <sys/proc.h>
#include <sys/rtprio.h>
#include <sys/uio.h>
#include <sys/sysctl.h>
#include <sys/resourcevar.h>
#include <sys/spinlock.h>
#include <machine/cpu.h>
#include <machine/smp.h>
#include <sys/thread2.h>
#include <sys/spinlock2.h>
#include <sys/mplock2.h>
#define MAXPRI 128
#define PRIBASE_REALTIME 0
#define PRIBASE_NORMAL MAXPRI
#define PRIBASE_IDLE (MAXPRI * 2)
#define PRIBASE_THREAD (MAXPRI * 3)
#define PRIBASE_NULL (MAXPRI * 4)
#define lwp_priority lwp_usdata.bsd4.priority
#define lwp_estcpu lwp_usdata.bsd4.estcpu
static void dummy_acquire_curproc(struct lwp *lp);
static void dummy_release_curproc(struct lwp *lp);
static void dummy_select_curproc(globaldata_t gd);
static void dummy_setrunqueue(struct lwp *lp);
static void dummy_schedulerclock(struct lwp *lp, sysclock_t period,
sysclock_t cpstamp);
static void dummy_recalculate_estcpu(struct lwp *lp);
static void dummy_resetpriority(struct lwp *lp);
static void dummy_forking(struct lwp *plp, struct lwp *lp);
static void dummy_exiting(struct lwp *plp, struct lwp *lp);
static void dummy_yield(struct lwp *lp);
struct usched usched_dummy = {
{ NULL },
"dummy", "Dummy DragonFly Scheduler",
NULL, /* default registration */
NULL, /* default deregistration */
dummy_acquire_curproc,
dummy_release_curproc,
dummy_setrunqueue,
dummy_schedulerclock,
dummy_recalculate_estcpu,
dummy_resetpriority,
dummy_forking,
dummy_exiting,
NULL, /* setcpumask not supported */
dummy_yield
};
struct usched_dummy_pcpu {
int rrcount;
struct thread helper_thread;
struct lwp *uschedcp;
};
typedef struct usched_dummy_pcpu *dummy_pcpu_t;
static struct usched_dummy_pcpu dummy_pcpu[MAXCPU];
static cpumask_t dummy_curprocmask = -1;
static cpumask_t dummy_rdyprocmask;
static struct spinlock dummy_spin;
static TAILQ_HEAD(rq, lwp) dummy_runq;
static int dummy_runqcount;
static int usched_dummy_rrinterval = (ESTCPUFREQ + 9) / 10;
SYSCTL_INT(_kern, OID_AUTO, usched_dummy_rrinterval, CTLFLAG_RW,
&usched_dummy_rrinterval, 0, "");
/*
* Initialize the run queues at boot time, clear cpu 0 in curprocmask
* to allow dummy scheduling on cpu 0.
*/
static void
dummyinit(void *dummy)
{
TAILQ_INIT(&dummy_runq);
spin_init(&dummy_spin);
atomic_clear_int(&dummy_curprocmask, 1);
}
SYSINIT(runqueue, SI_BOOT2_USCHED, SI_ORDER_FIRST, dummyinit, NULL)
/*
* DUMMY_ACQUIRE_CURPROC
*
* This function is called when the kernel intends to return to userland.
* It is responsible for making the thread the current designated userland
* thread for this cpu, blocking if necessary.
*
* We are expected to handle userland reschedule requests here too.
*
* WARNING! THIS FUNCTION IS ALLOWED TO CAUSE THE CURRENT THREAD TO MIGRATE
* TO ANOTHER CPU! Because most of the kernel assumes that no migration will
* occur, this function is called only under very controlled circumstances.
*
* MPSAFE
*/
static void
dummy_acquire_curproc(struct lwp *lp)
{
globaldata_t gd = mycpu;
dummy_pcpu_t dd = &dummy_pcpu[gd->gd_cpuid];
thread_t td = lp->lwp_thread;
/*
* Possibly select another thread
*/
if (user_resched_wanted())
dummy_select_curproc(gd);
/*
* If this cpu has no current thread, select ourself
*/
if (dd->uschedcp == lp ||
(dd->uschedcp == NULL && TAILQ_EMPTY(&dummy_runq))) {
atomic_set_int(&dummy_curprocmask, gd->gd_cpumask);
dd->uschedcp = lp;
return;
}
/*
* If this cpu's current user process thread is not our thread,
* deschedule ourselves and place us on the run queue, then
* switch away.
*
* We loop until we become the current process. Its a good idea
* to run any passive release(s) before we mess with the scheduler
* so our thread is in the expected state.
*/
KKASSERT(dd->uschedcp != lp);
if (td->td_release)
td->td_release(lp->lwp_thread);
do {
crit_enter();
lwkt_deschedule_self(td);
dummy_setrunqueue(lp);
if ((td->td_flags & TDF_RUNQ) == 0)
++lp->lwp_ru.ru_nivcsw;
lwkt_switch(); /* WE MAY MIGRATE TO ANOTHER CPU */
crit_exit();
gd = mycpu;
dd = &dummy_pcpu[gd->gd_cpuid];
KKASSERT((lp->lwp_flag & LWP_ONRUNQ) == 0);
} while (dd->uschedcp != lp);
}
/*
* DUMMY_RELEASE_CURPROC
*
* This routine detaches the current thread from the userland scheduler,
* usually because the thread needs to run in the kernel (at kernel priority)
* for a while.
*
* This routine is also responsible for selecting a new thread to
* make the current thread.
*
* WARNING! The MP lock may be in an unsynchronized state due to the
* way get_mplock() works and the fact that this function may be called
* from a passive release during a lwkt_switch(). try_mplock() will deal
* with this for us but you should be aware that td_mpcount may not be
* useable.
*
* MPSAFE
*/
static void
dummy_release_curproc(struct lwp *lp)
{
globaldata_t gd = mycpu;
dummy_pcpu_t dd = &dummy_pcpu[gd->gd_cpuid];
KKASSERT((lp->lwp_flag & LWP_ONRUNQ) == 0);
if (dd->uschedcp == lp) {
dummy_select_curproc(gd);
}
}
/*
* DUMMY_SELECT_CURPROC
*
* Select a new current process for this cpu. This satisfies a user
* scheduler reschedule request so clear that too.
*
* This routine is also responsible for equal-priority round-robining,
* typically triggered from dummy_schedulerclock(). In our dummy example
* all the 'user' threads are LWKT scheduled all at once and we just
* call lwkt_switch().
*
* MPSAFE
*/
static
void
dummy_select_curproc(globaldata_t gd)
{
dummy_pcpu_t dd = &dummy_pcpu[gd->gd_cpuid];
struct lwp *lp;
clear_user_resched();
spin_lock_wr(&dummy_spin);
if ((lp = TAILQ_FIRST(&dummy_runq)) == NULL) {
dd->uschedcp = NULL;
atomic_clear_int(&dummy_curprocmask, gd->gd_cpumask);
spin_unlock_wr(&dummy_spin);
} else {
--dummy_runqcount;
TAILQ_REMOVE(&dummy_runq, lp, lwp_procq);
lp->lwp_flag &= ~LWP_ONRUNQ;
dd->uschedcp = lp;
atomic_set_int(&dummy_curprocmask, gd->gd_cpumask);
spin_unlock_wr(&dummy_spin);
#ifdef SMP
lwkt_acquire(lp->lwp_thread);
#endif
lwkt_schedule(lp->lwp_thread);
}
}
/*
* DUMMY_SETRUNQUEUE
*
* This routine is called to schedule a new user process after a fork.
* The scheduler module itself might also call this routine to place
* the current process on the userland scheduler's run queue prior
* to calling dummy_select_curproc().
*
* The caller may set P_PASSIVE_ACQ in p_flag to indicate that we should
* attempt to leave the thread on the current cpu.
*
* MPSAFE
*/
static void
dummy_setrunqueue(struct lwp *lp)
{
globaldata_t gd = mycpu;
dummy_pcpu_t dd = &dummy_pcpu[gd->gd_cpuid];
cpumask_t mask;
int cpuid;
if (dd->uschedcp == NULL) {
dd->uschedcp = lp;
atomic_set_int(&dummy_curprocmask, gd->gd_cpumask);
lwkt_schedule(lp->lwp_thread);
} else {
/*
* Add to our global runq
*/
KKASSERT((lp->lwp_flag & LWP_ONRUNQ) == 0);
spin_lock_wr(&dummy_spin);
++dummy_runqcount;
TAILQ_INSERT_TAIL(&dummy_runq, lp, lwp_procq);
lp->lwp_flag |= LWP_ONRUNQ;
#ifdef SMP
lwkt_giveaway(lp->lwp_thread);
#endif
/* lp = TAILQ_FIRST(&dummy_runq); */
/*
* Notify the next available cpu. P.S. some
* cpu affinity could be done here.
*
* The rdyprocmask bit placeholds the knowledge that there
* is a process on the runq that needs service. If the
* helper thread cannot find a home for it it will forward
* the request to another available cpu.
*/
mask = ~dummy_curprocmask & dummy_rdyprocmask &
gd->gd_other_cpus;
if (mask) {
cpuid = bsfl(mask);
atomic_clear_int(&dummy_rdyprocmask, 1 << cpuid);
spin_unlock_wr(&dummy_spin);
lwkt_schedule(&dummy_pcpu[cpuid].helper_thread);
} else {
spin_unlock_wr(&dummy_spin);
}
}
}
/*
* This routine is called from a systimer IPI. Thus it is called with
* a critical section held. Any spinlocks we get here that are also
* obtained in other procedures must be proected by a critical section
* in those other procedures to avoid a deadlock.
*
* The MP lock may or may not be held on entry and cannot be obtained
* by this routine (because it is called from a systimer IPI). Additionally,
* because this is equivalent to a FAST interrupt, spinlocks cannot be used
* (or at least, you have to check that gd_spin* counts are 0 before you
* can).
*
* This routine is called at ESTCPUFREQ on each cpu independantly.
*
* This routine typically queues a reschedule request, which will cause
* the scheduler's BLAH_select_curproc() to be called as soon as possible.
*
* MPSAFE
*/
static
void
dummy_schedulerclock(struct lwp *lp, sysclock_t period, sysclock_t cpstamp)
{
globaldata_t gd = mycpu;
dummy_pcpu_t dd = &dummy_pcpu[gd->gd_cpuid];
if (++dd->rrcount >= usched_dummy_rrinterval) {
dd->rrcount = 0;
need_user_resched();
}
}
/*
* DUMMY_RECALCULATE_ESTCPU
*
* Called once a second for any process that is running or has slept
* for less then 2 seconds.
*
* MPSAFE
*/
static
void
dummy_recalculate_estcpu(struct lwp *lp)
{
}
/*
* MPSAFE
*/
static
void
dummy_yield(struct lwp *lp)
{
need_user_resched();
}
/*
* DUMMY_RESETPRIORITY
*
* This routine is called after the kernel has potentially modified
* the lwp_rtprio structure. The target process may be running or sleeping
* or scheduled but not yet running or owned by another cpu. Basically,
* it can be in virtually any state.
*
* This routine is called by fork1() for initial setup with the process
* of the run queue, and also may be called normally with the process on or
* off the run queue.
*
* MPSAFE
*/
static void
dummy_resetpriority(struct lwp *lp)
{
/* XXX spinlock usually needed */
/*
* Set p_priority for general process comparisons
*/
switch(lp->lwp_rtprio.type) {
case RTP_PRIO_REALTIME:
lp->lwp_priority = PRIBASE_REALTIME + lp->lwp_rtprio.prio;
return;
case RTP_PRIO_NORMAL:
lp->lwp_priority = PRIBASE_NORMAL + lp->lwp_rtprio.prio;
break;
case RTP_PRIO_IDLE:
lp->lwp_priority = PRIBASE_IDLE + lp->lwp_rtprio.prio;
return;
case RTP_PRIO_THREAD:
lp->lwp_priority = PRIBASE_THREAD + lp->lwp_rtprio.prio;
return;
}
/* XXX spinlock usually needed */
}
/*
* DUMMY_FORKING
*
* Called from fork1() when a new child process is being created. Allows
* the scheduler to predispose the child process before it gets scheduled.
*
* MPSAFE
*/
static void
dummy_forking(struct lwp *plp, struct lwp *lp)
{
lp->lwp_estcpu = plp->lwp_estcpu;
#if 0
++plp->lwp_estcpu;
#endif
}
/*
* DUMMY_EXITING
*
* Called when the parent reaps a child. Typically used to propogate cpu
* use by the child back to the parent as part of a batch detection
* heuristic.
*
* NOTE: cpu use is not normally back-propogated to PID 1.
*
* MPSAFE
*/
static void
dummy_exiting(struct lwp *plp, struct lwp *lp)
{
}
/*
* SMP systems may need a scheduler helper thread. This is how one can be
* setup.
*
* We use a neat LWKT scheduling trick to interlock the helper thread. It
* is possible to deschedule an LWKT thread and then do some work before
* switching away. The thread can be rescheduled at any time, even before
* we switch away.
*/
#ifdef SMP
static void
dummy_sched_thread(void *dummy)
{
globaldata_t gd;
dummy_pcpu_t dd;
struct lwp *lp;
cpumask_t cpumask;
cpumask_t tmpmask;
int cpuid;
int tmpid;
gd = mycpu;
cpuid = gd->gd_cpuid;
dd = &dummy_pcpu[cpuid];
cpumask = 1 << cpuid;
/*
* Our Scheduler helper thread does not need to hold the MP lock
*/
rel_mplock();
for (;;) {
lwkt_deschedule_self(gd->gd_curthread); /* interlock */
atomic_set_int(&dummy_rdyprocmask, cpumask);
spin_lock_wr(&dummy_spin);
if (dd->uschedcp) {
/*
* We raced another cpu trying to schedule a thread onto us.
* If the runq isn't empty hit another free cpu.
*/
tmpmask = ~dummy_curprocmask & dummy_rdyprocmask &
gd->gd_other_cpus;
if (tmpmask && dummy_runqcount) {
tmpid = bsfl(tmpmask);
KKASSERT(tmpid != cpuid);
atomic_clear_int(&dummy_rdyprocmask, 1 << tmpid);
spin_unlock_wr(&dummy_spin);
lwkt_schedule(&dummy_pcpu[tmpid].helper_thread);
} else {
spin_unlock_wr(&dummy_spin);
}
} else if ((lp = TAILQ_FIRST(&dummy_runq)) != NULL) {
--dummy_runqcount;
TAILQ_REMOVE(&dummy_runq, lp, lwp_procq);
lp->lwp_flag &= ~LWP_ONRUNQ;
dd->uschedcp = lp;
atomic_set_int(&dummy_curprocmask, cpumask);
spin_unlock_wr(&dummy_spin);
#ifdef SMP
lwkt_acquire(lp->lwp_thread);
#endif
lwkt_schedule(lp->lwp_thread);
} else {
spin_unlock_wr(&dummy_spin);
}
lwkt_switch();
}
}
/*
* Setup our scheduler helpers. Note that curprocmask bit 0 has already
* been cleared by rqinit() and we should not mess with it further.
*/
static void
dummy_sched_thread_cpu_init(void)
{
int i;
if (bootverbose)
kprintf("start dummy scheduler helpers on cpus:");
for (i = 0; i < ncpus; ++i) {
dummy_pcpu_t dd = &dummy_pcpu[i];
cpumask_t mask = 1 << i;
if ((mask & smp_active_mask) == 0)
continue;
if (bootverbose)
kprintf(" %d", i);
lwkt_create(dummy_sched_thread, NULL, NULL, &dd->helper_thread,
TDF_STOPREQ, i, "dsched %d", i);
/*
* Allow user scheduling on the target cpu. cpu #0 has already
* been enabled in rqinit().
*/
if (i)
atomic_clear_int(&dummy_curprocmask, mask);
atomic_set_int(&dummy_rdyprocmask, mask);
}
if (bootverbose)
kprintf("\n");
}
SYSINIT(uschedtd, SI_BOOT2_USCHED, SI_ORDER_SECOND,
dummy_sched_thread_cpu_init, NULL)
#endif