summaryrefslogtreecommitdiffstats
path: root/otherlibs/threads/scheduler.c
blob: f87d259527d368f36dbd59758b2b61f4c3c45e21 (plain)
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
#include <sys/time.h>
#include <sys/types.h>
#include <unistd.h>

#include "config.h"
#include "misc.h"
#include "mlvalues.h"
#include "stacks.h"
#include "fail.h"
#include "io.h"
#include "roots.h"
#include "alloc.h"
#include "memory.h"

#if defined(HAS_SELECT) && defined(HAS_SETITIMER) && defined(HAS_GETTIMEOFDAY)
#else
#include "Cannot compile libthreads, system calls missing"
#endif

/* Configuration */

/* Initial size of stack when a thread is created (4 Ko) */
#define Thread_stack_size (Stack_size / 4)

/* Max computation time before rescheduling, in microseconds (50ms) */
#define Thread_timeout 50000

/* The thread descriptors */

struct thread_struct {
  value ident;                  /* Unique id (for equality comparisons) */
  struct thread_struct * next;  /* Double linking of threads */
  struct thread_struct * prev;
  value * stack_low;            /* The execution stack for this thread */
  value * stack_high;
  value * stack_threshold;
  value * sp;
  value * trapsp;
  value runnable;               /* RUNNABLE, STOPPED or KILLED */
  value fd;               /* File descriptor on which this thread is waiting */
  value delay;                  /* Time until which this thread is blocked */
  value joining;                /* Thread we're trying to join */
};

typedef struct thread_struct * thread_t;

#define STOPPED Val_int(0)
#define RUNNABLE Val_int(1)
#define KILLED Val_int(2)
#define NO_FD Val_int(-1)
#define NO_DELAY Val_int(0)
#define NO_JOINING Val_int(0)

#define DELAY_INFTY 1E30        /* +infty, for this purpose */

/* The thread currently active */
static thread_t curr_thread = NULL;
/* Number of threads waiting on file descrs. */
static int num_waiting_on_fd;
/* Number of threads waiting on the timer */
static int num_waiting_on_timer;
/* Number of threads waiting on a join op. */
static int num_waiting_on_join;
/* Identifier for next thread creation */
static value next_ident = Val_int(0);

#define Assign(dst,src) modify((value *)&(dst), (value)(src))

/* Scan the stacks of the other threads */

static void (*prev_scan_roots_hook) P((scanning_action));

static void thread_scan_roots(action)
     scanning_action action;
{
  thread_t th;
  register value * sp;
  /* Scan all active descriptors */
  (*action)((value) curr_thread, (value *) &curr_thread);
  /* Don't scan curr_thread->sp, this has already been done */
  for (th = curr_thread->next; th != curr_thread; th = th->next) {
    (*action)((value) th, (value *) &th);
    for (sp = th->sp; sp < th->stack_high; sp++) {
      (*action)(*sp, sp);
    }
  }
  /* Hook */
  if (prev_scan_roots_hook != NULL) (*prev_scan_roots_hook)(action);
}

/* Initialize the thread machinery */

value thread_initialize(unit)       /* ML */
     value unit;
{
  struct itimerval timer;
  /* Create a descriptor for the current thread */
  curr_thread =
    (thread_t) alloc_shr(sizeof(struct thread_struct) / sizeof(value), 0);
  curr_thread->ident = next_ident;
  next_ident = Val_int(Int_val(next_ident) + 1);
  curr_thread->next = curr_thread;
  curr_thread->prev = curr_thread;
  curr_thread->stack_low = stack_low;
  curr_thread->stack_high = stack_high;
  curr_thread->stack_threshold = stack_threshold;
  curr_thread->sp = extern_sp;
  curr_thread->trapsp = trapsp;
  curr_thread->runnable = RUNNABLE;
  curr_thread->fd = NO_FD;
  curr_thread->delay = NO_DELAY;
  curr_thread->joining = NO_JOINING;
  /* Initialize scheduling */
  num_waiting_on_fd = 0;
  num_waiting_on_timer = 0;
  num_waiting_on_join = 0;
  /* Initialize GC */
  prev_scan_roots_hook = scan_roots_hook;
  scan_roots_hook = thread_scan_roots;
  /* Initialize interval timer */
  timer.it_interval.tv_sec = 0;
  timer.it_interval.tv_usec = Thread_timeout;
  timer.it_value = timer.it_interval;
  setitimer(ITIMER_VIRTUAL, &timer, NULL);
  return Val_unit;
}

/* Create a thread */

value thread_new(clos)          /* ML */
     value clos;
{
  thread_t th;
  /* Allocate the thread and its stack */
  Push_roots(r, 1);
  r[0] = clos;
  th = (thread_t) alloc_shr(sizeof(struct thread_struct) / sizeof(value), 0);
  clos = r[0];
  Pop_roots();
  th->ident = next_ident;
  next_ident = Val_int(Int_val(next_ident) + 1);
  th->stack_low = (value *) stat_alloc(Thread_stack_size);
  th->stack_high = th->stack_low + Thread_stack_size / sizeof(value);
  th->stack_threshold = th->stack_low + Stack_threshold / sizeof(value);
  th->sp = th->stack_high;
  th->trapsp = th->stack_high;
  /* Set up a return frame that pretends we're applying clos to ().
     This way, when this thread is activated, the RETURN will take us
     to the entry point of the closure. */
  th->sp -= 4;
  th->sp[0] = Val_unit;
  th->sp[1] = (value) Code_val(clos);
  th->sp[2] = clos;
  th->sp[3] = Val_long(0);      /* no extra args */
  /* Fake a C call frame */
  th->sp--;
  th->sp[0] = Val_unit;         /* a dummy environment */
  /* The thread is initially runnable */
  th->runnable = RUNNABLE;
  th->fd = NO_FD;
  th->delay = NO_DELAY;
  th->joining = NO_JOINING;
  /* Insert thread in doubly linked list of threads */
  Assign(th->prev, curr_thread->prev);
  Assign(curr_thread->prev->next, th);
  Assign(th->next, curr_thread);
  Assign(curr_thread->prev, th);
  /* Return thread */
  return (value) th;
}

/* Return the current time as a floating-point number */

double timeofday()
{
  struct timeval tv;
  gettimeofday(&tv, NULL);
  return (double) tv.tv_sec + (double) tv.tv_usec * 1e-6;
}

/* Find a runnable thread and activate it */

#define FOREACH_THREAD(x) x = curr_thread; do { x = x->next;
#define END_FOREACH(x) } while (x != curr_thread)

void schedule_thread()
{
  thread_t run_thread, th;

  /* Save the status of the current thread */
  curr_thread->stack_low = stack_low;
  curr_thread->stack_high = stack_high;
  curr_thread->stack_threshold = stack_threshold;
  curr_thread->sp = extern_sp;
  curr_thread->trapsp = trapsp;

  /* See if some join operations succeeded */
  if (num_waiting_on_join > 0) {
    FOREACH_THREAD(th)
      if (th->joining != NO_JOINING &&
          ((thread_t)(th->joining))->runnable == KILLED) {
        th->runnable = RUNNABLE;
        th->joining = NO_JOINING;
        num_waiting_on_join--;
      }
    END_FOREACH(th);
  }
  /* Find the next runnable thread */
  run_thread = NULL;
  FOREACH_THREAD(th)
    if (th->runnable == RUNNABLE) { run_thread = th; break; }
  END_FOREACH(th);

  if (num_waiting_on_fd > 0 || num_waiting_on_timer > 0) {
    fd_set readfds;
    struct timeval delay_tv, * delay_ptr;
    double delay, now;
    int retcode;

    do {
      /* If some threads are blocked on I/O,  get ready to select on all
         descriptors they are waiting for */
      FD_ZERO(&readfds);
      if (num_waiting_on_fd > 0) {
        FOREACH_THREAD(th)
          if (th->fd != NO_FD) FD_SET(Int_val(th->fd), &readfds);
        END_FOREACH(th);
      }
      /* If some threads are blocked on the timer, activate those for which the
         time has elapsed, and compute the minimal delay until one gets
         ready. */
      delay = DELAY_INFTY;
      if (num_waiting_on_timer > 0) {
        now = timeofday();
        FOREACH_THREAD(th)
          if (th->delay != NO_DELAY) {
            double th_delay = Double_val(th->delay);
            if (th_delay <= now) {
              th->runnable = 1;
              th->delay = NO_DELAY;
              num_waiting_on_timer--;
              if (run_thread == NULL) run_thread = th; /* Found one. */
            } else {
              if (th_delay < delay) delay = th_delay;
            }
          }
        END_FOREACH(th);
        delay -= now;
      }
      /* Do the select if needed */
      if (num_waiting_on_fd > 0 || run_thread == NULL) {
        /* Convert delay to a timeval */
        /* If a thread is runnable, just poll */
        if (run_thread != NULL) {
          delay_tv.tv_sec = 0;
          delay_tv.tv_usec = 0;
          delay_ptr = &delay_tv;
        }
        else if (delay == DELAY_INFTY) {
          delay_ptr = NULL;
        } else {
          delay_tv.tv_sec = (unsigned int) delay;
          delay_tv.tv_usec = (delay - (double) delay_tv.tv_sec) * 1E6;
          delay_ptr = &delay_tv;
        }
        retcode = select(FD_SETSIZE, &readfds, NULL, NULL, delay_ptr);
        if (retcode > 0) {
          /* Some descriptors are ready. 
             Make the corresponding threads runnable. */
          FOREACH_THREAD(th)
            if (th->fd != NO_FD && FD_ISSET(Int_val(th->fd), &readfds)) {
              /* Wake up only one thread per fd. */
              FD_CLR(Int_val(th->fd), &readfds);
              th->runnable = RUNNABLE;
              th->fd = NO_FD;
              num_waiting_on_fd--;
              if (run_thread == NULL) run_thread = th; /* Found one. */
            }
          END_FOREACH(th);
        }
      }
      /* The delays for some of the threads should have expired.
         Go through the loop once more, to check the delays. */
    } while (run_thread == NULL && delay != DELAY_INFTY);
  }
  /* If we haven't something to run at that point, we're in big trouble. */
  if (run_thread == NULL) invalid_argument("Thread: deadlock");

  /* Activate the thread */
  curr_thread = run_thread;
  stack_low = curr_thread->stack_low;
  stack_high = curr_thread->stack_high;
  stack_threshold = curr_thread->stack_threshold;
  extern_sp = curr_thread->sp;
  trapsp = curr_thread->trapsp;
}

/* Reschedule without suspending the current thread */

value thread_yield(unit)        /* ML */
     value unit;
{
  schedule_thread();
  return Val_unit;
}

/* Suspend the current thread */

value thread_sleep(unit)        /* ML */
     value unit;
{
  curr_thread->runnable = STOPPED;
  schedule_thread();
  return Val_unit;
}

/* Suspend the current thread on a Unix file descriptor */

value thread_wait_descr(fd)        /* ML */
     value fd;
{
  curr_thread->runnable = STOPPED;
  curr_thread->fd = fd;
  num_waiting_on_fd++;
  schedule_thread();
  return Val_unit;
}

/* Suspend the current thread on a buffered input channel */

value thread_wait_inchan(vchan)       /* ML */
     value vchan;
{
  struct channel * chan = (struct channel *) vchan;
  if (chan->curr < chan->max) return Val_unit;
  curr_thread->runnable = STOPPED;
  curr_thread->fd = Val_int(chan->fd);
  num_waiting_on_fd++;
  schedule_thread();
  return Val_unit;
}

/* Suspend the current thread for some time */

value thread_wait_for(time)          /* ML */
     value time;
{
  double date = timeofday() + Double_val(time);
  curr_thread->runnable = STOPPED;
  Assign(curr_thread->delay, copy_double(date));
  num_waiting_on_timer++;
  schedule_thread();
  return Val_unit;
}

/* Suspend the current thread until another thread terminates */

value thread_join(th)          /* ML */
     value th;
{
  if (((thread_t)th)->runnable == KILLED) return Val_unit;
  curr_thread->runnable = STOPPED;
  Assign(curr_thread->joining, th);
  num_waiting_on_join++;
  schedule_thread();
  return Val_unit;
}

/* Reactivate another thread */

value thread_wakeup(thread)     /* ML */
     value thread;
{
  thread_t th = (thread_t) thread;
  if (th->runnable == KILLED) failwith("Thread.wakeup: killed thread");
  /* The thread is no longer waiting on anything */
  if (th->fd != NO_FD) {
    th->fd = NO_FD; num_waiting_on_fd--;
  }
  if (th->delay != NO_DELAY) {
    th->delay = NO_DELAY; num_waiting_on_timer--;
  }
  if (th->joining != NO_JOINING) {
    th->joining = NO_JOINING; num_waiting_on_join--;
  }
  th->runnable = RUNNABLE;
  return Val_unit;
}

/* Return the current thread */

value thread_self(unit)         /* ML */
     value unit;
{
  return (value) curr_thread;
}

/* Kill a thread */

value thread_kill(thread)       /* ML */
     value thread;
{
  thread_t th = (thread_t) thread;
  /* Don't paint ourselves in a corner */
  if (th == th->next) failwith("Thread.kill: cannot kill the last thread");
  /* This thread is no longer waiting on anything */
  if (th->fd != NO_FD) { num_waiting_on_fd--; }
  if (th->delay != NO_DELAY) { num_waiting_on_timer--; }
  if (th->joining != NO_JOINING) { num_waiting_on_join--; }
  th->runnable = KILLED;
  /* If this is the current thread, activate another one */
  if (th == curr_thread) schedule_thread();
  /* Remove thread from the doubly-linked list */
  Assign(th->prev->next, th->next);
  Assign(th->next->prev, th->prev);
  /* Free its resources */
  stat_free((char *) th->stack_low);
  return Val_unit;
}