2 * lwp.c -- lightweight process creation, destruction and manipulation.
3 * Copyright (C) 1991-3 Stephen Crane.
5 * This library is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU Library General Public
7 * License as published by the Free Software Foundation; either
8 * version 2 of the License, or (at your option) any later version.
10 * This library is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * Library General Public License for more details.
15 * You should have received a copy of the GNU Library General Public
16 * License along with this library; if not, write to the Free
17 * Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
19 * author: Stephen Crane, (jsc@doc.ic.ac.uk), Department of Computing,
20 * Imperial College of Science, Technology and Medicine, 180 Queen's
21 * Gate, London SW7 2BZ, England.
30 #include "prototypes.h"
32 #if defined(_EMPTH_LWP)
34 struct lwpQueue LwpSchedQ[LWP_MAX_PRIO], LwpDeadQ;
36 struct lwpProc *LwpCurrent = NULL;
38 int LwpMaxpri = 0; /* maximum priority so far */
39 int LwpStackGrowsDown;
41 static sigset_t oldmask;
43 static void lwpStackCheckInit(struct lwpProc *newp);
44 static void lwpStackCheck(struct lwpProc *newp);
45 static void lwpStackCheckUsed(struct lwpProc *newp);
47 /* check stack direction */
57 * lwpReschedule -- schedule another process. we also check for dead
58 * processes here and free them.
63 static int lcount = LCOUNT;
64 static struct lwpProc *nextp;
66 static sigset_t tmask;
68 if (LwpCurrent && (LwpCurrent->flags & LWP_STACKCHECK)) {
69 lwpStackCheck(LwpCurrent);
72 int p = lwpSetPriority(LWP_MAX_PRIO - 1);
74 sigprocmask(SIG_SETMASK, &oldmask, &tmask);
75 sigprocmask(SIG_SETMASK, &tmask, &oldmask);
79 /* destroy dead threads */
80 lwpStatus(LwpCurrent, "Cleaning dead queue");
81 while (NULL != (nextp = lwpGetFirst(&LwpDeadQ))) {
82 if (nextp == LwpCurrent) {
83 lwpStatus(nextp, "OOOPS, we are running already dead thread");
87 lwpStatus(LwpCurrent, "Destroying done");
90 for (i = LwpMaxpri + 1; i--;) {
91 while (NULL != (nextp = lwpGetFirst(&LwpSchedQ[i]))) {
94 /* clean up after dead bodies */
95 lwpStatus(nextp, "got a dead body");
96 if (nextp == LwpCurrent) {
97 lwpStatus(nextp, "we are in it -- will bury later");
98 lwpAddTail(&LwpDeadQ, nextp);
107 if (LwpCurrent == 0 && nextp == 0) {
108 fprintf(stderr, "No processes to run!\n");
111 if (LwpCurrent != nextp) {
112 struct lwpProc *oldp = LwpCurrent;
114 lwpStatus(oldp, "switch out");
116 *LwpContextPtr = nextp->ud;
117 lwpSwitchContext(oldp, nextp);
118 lwpStatus(nextp, "switch in %d", nextp->pri);
123 * lwpEntryPoint -- process entry point.
131 sigaddset(&set, SIGALRM);
132 sigprocmask(SIG_SETMASK, &set, &oldmask);
133 *LwpContextPtr = LwpCurrent->ud;
135 lwpStatus(LwpCurrent, "starting at entry point");
136 (*LwpCurrent->entry)(LwpCurrent->ud);
141 * lwpCreate -- create a process.
144 lwpCreate(int priority, void (*entry)(void *), int stacksz, int flags, char *name, char *desc, int argc, char **argv, void *ud)
146 struct lwpProc *newp;
148 if (!(newp = malloc(sizeof(struct lwpProc))))
151 newp->name = strdup(name);
152 newp->desc = strdup(desc);
158 if (LWP_MAX_PRIO <= priority)
159 priority = LWP_MAX_PRIO - 1;
160 if (LwpMaxpri < (newp->pri = priority))
161 LwpMaxpri = priority;
162 if (lwpNewContext(newp, stacksz) < 0) {
168 lwpStatus(newp, "creating process structure %p (sbtm %p)",
170 if (flags & LWP_STACKCHECK)
171 lwpStackCheckInit(newp);
173 lwpReady(LwpCurrent);
179 lwpDestroy(struct lwpProc *proc)
181 if (proc->flags & LWP_STACKCHECK) {
182 lwpStackCheckUsed(proc);
185 lwpStatus(proc, "destroying sbtm: %p", proc->sbtm);
193 * lwpReady -- put process on ready queue. if null, assume current.
196 lwpReady(struct lwpProc *p)
200 lwpStatus(p, "added to run queue");
201 lwpAddTail(&LwpSchedQ[p->pri], p);
208 lwpGetUD(struct lwpProc *p)
219 lwpSetUD(struct lwpProc *p, char *ud)
230 lwpSetDesc(struct lwpProc *p, char *name, char *desc)
236 p->name = strdup(name);
237 p->desc = strdup(desc);
241 * lwpYield -- yield the processor to another thread.
246 lwpStatus(LwpCurrent, "yielding control");
247 lwpReady(LwpCurrent);
252 * cause the current process to be scheduled for deletion.
257 lwpStatus(LwpCurrent, "marking self as dead");
258 LwpCurrent->dead = 1;
263 * mark another process as dead, so it will never be rescheduled.
264 * remove any lingering FD action
267 lwpTerminate(struct lwpProc *p)
269 lwpStatus(p, "terminating process");
276 * set the thread's priority, returning the old.
277 * if the new priority is lower than the old, we reschedule.
280 lwpSetPriority(int new)
282 int old = LwpCurrent->pri;
284 if (LWP_MAX_PRIO <= new)
285 new = LWP_MAX_PRIO - 1;
288 LwpCurrent->pri = new;
289 lwpStatus(LwpCurrent, "resetting priority (%d -> %d)", old, new);
296 * initialise the coroutine structures
299 lwpInitSystem(int pri, char **ctxptr, int flags)
302 int i, *stack, marker;
305 LwpContextPtr = ctxptr;
308 /* *LwpContextPtr = 0; */
309 LwpStackGrowsDown = growsdown(&marker);
310 if (!(LwpCurrent = calloc(1, sizeof(struct lwpProc))))
312 if (!(stack = malloc(64)))
314 if (LWP_MAX_PRIO <= pri)
315 pri = LWP_MAX_PRIO - 1;
318 LwpCurrent->next = 0;
319 LwpCurrent->sbtm = stack; /* dummy stack for "main" */
320 LwpCurrent->pri = pri;
321 LwpCurrent->dead = 0;
322 LwpCurrent->flags = flags & ~LWP_STACKCHECK;
323 LwpCurrent->name = "Main";
324 for (i = LWP_MAX_PRIO, q = LwpSchedQ; i--; q++)
325 q->head = q->tail = 0;
326 LwpDeadQ.head = LwpDeadQ.tail = 0;
327 /* must be lower in priority than us for this to work right */
328 sel = lwpCreate(0, lwpSelect, 16384, flags, "EventHandler",
329 "Select (main loop) Event Handler", 0, 0, 0);
336 * Initialize the entire stack (including both redzones) with the stack
337 * check mark. Thus, we can get some indication of how much stack was
341 lwpStackCheckInit(struct lwpProc *newp)
344 int *lim = (int *)((char *)newp->sbtm + newp->size);
346 for (p = newp->sbtm; p < lim; p++)
352 * Check if the thread has overflowed/underflowed its stack.
353 * Should that happen, abort the process, as we cannot recover.
356 lwpStackCheck(struct lwpProc *newp)
358 int *btm = (int *)(newp->ustack - LWP_REDZONE);
359 int *top = (int *)(newp->ustack + newp->usize + LWP_REDZONE);
360 int n = LWP_REDZONE / sizeof(int);
361 int i, lo_clean, hi_clean, overflow, underflow;
363 for (i = 0; i < n && btm[i] == LWP_CHECKMARK; i++) ;
366 for (i = 1; i <= n && top[-i] == LWP_CHECKMARK; i++) ;
369 if (LwpStackGrowsDown) {
370 overflow = n - lo_clean;
371 underflow = n - hi_clean;
373 overflow = n - hi_clean;
374 underflow = n - lo_clean;
377 logerror("Thread %s stack overflow %d bytes",
378 newp->name, overflow * (int)sizeof(int));
380 logerror("Thread %s stack underflow %d bytes",
381 newp->name, underflow * (int)sizeof(int));
382 if (overflow || underflow)
388 * Figure out how much stack was used by this thread.
391 lwpStackCheckUsed(struct lwpProc *newp)
393 int *base = (int *)newp->ustack;
394 int *lim = (int *)(newp->ustack + newp->usize);
395 int total = (lim + 1 - base) * sizeof(int);
398 if (LwpStackGrowsDown) {
399 for (p = base; p < lim && *p == LWP_CHECKMARK; ++p) ;
400 used = (lim - p) * sizeof(int);
402 for (p = lim - 1; p >= base && *p == LWP_CHECKMARK; --p) ;
403 used = (p - base + 1) * sizeof(int);
405 lwpStatus(newp, "Thread stack %d used, %d left, %d total",
406 used, total - used, total);