Subversion Repositories HelenOS

Rev

Rev 111 | Rev 125 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed

Rev Author Line No. Line
1 jermar 1
/*
2
 * Copyright (C) 2001-2004 Jakub Jermar
3
 * All rights reserved.
4
 *
5
 * Redistribution and use in source and binary forms, with or without
6
 * modification, are permitted provided that the following conditions
7
 * are met:
8
 *
9
 * - Redistributions of source code must retain the above copyright
10
 *   notice, this list of conditions and the following disclaimer.
11
 * - Redistributions in binary form must reproduce the above copyright
12
 *   notice, this list of conditions and the following disclaimer in the
13
 *   documentation and/or other materials provided with the distribution.
14
 * - The name of the author may not be used to endorse or promote products
15
 *   derived from this software without specific prior written permission.
16
 *
17
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
18
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
26
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27
 */
28
 
29
#include <proc/scheduler.h>
30
#include <proc/thread.h>
31
#include <proc/task.h>
32
#include <mm/heap.h>
33
#include <mm/frame.h>
34
#include <mm/page.h>
35
#include <arch/asm.h>
36
#include <arch.h>
37
#include <synch/synch.h>
38
#include <synch/spinlock.h>
39
#include <synch/waitq.h>
40
#include <synch/rwlock.h>
41
#include <cpu.h>
42
#include <func.h>
43
#include <context.h>
44
#include <list.h>
45
#include <typedefs.h>
46
#include <time/clock.h>
47
#include <list.h>
7 jermar 48
#include <config.h>
49
#include <arch/interrupt.h>
10 jermar 50
#include <smp/ipi.h>
76 jermar 51
#include <arch/faddr.h>
111 palkovsky 52
#include <arch/atomic.h>
7 jermar 53
 
107 decky 54
char *thread_states[] = {"Invalid", "Running", "Sleeping", "Ready", "Entering", "Exiting"}; /**< Thread states */
1 jermar 55
 
56
spinlock_t threads_lock;
57
link_t threads_head;
58
 
59
static spinlock_t tidlock;
60
__u32 last_tid = 0;
61
 
107 decky 62
 
63
/** Thread wrapper
64
 *
65
 * This wrapper is provided to ensure that every thread
1 jermar 66
 * makes a call to thread_exit() when its implementing
67
 * function returns.
68
 *
107 decky 69
 * cpu_priority_high() is assumed.
70
 *
1 jermar 71
 */
72
void cushion(void)
73
{
15 jermar 74
    void (*f)(void *) = THREAD->thread_code;
75
    void *arg = THREAD->thread_arg;
1 jermar 76
 
22 jermar 77
    before_thread_runs();
78
 
1 jermar 79
    /* this is where each thread wakes up after its creation */
15 jermar 80
    spinlock_unlock(&THREAD->lock);
1 jermar 81
    cpu_priority_low();
82
 
83
    f(arg);
84
    thread_exit();
85
    /* not reached */
86
}
87
 
107 decky 88
 
89
/** Initialize threads
90
 *
91
 * Initialize kernel threads support.
92
 *
93
 */
1 jermar 94
void thread_init(void)
95
{
15 jermar 96
    THREAD = NULL;
1 jermar 97
    nrdy = 0;
98
    spinlock_initialize(&threads_lock);
99
    list_initialize(&threads_head);
100
}
101
 
107 decky 102
 
103
/** Make thread ready
104
 *
105
 * Switch thread t to the ready state.
106
 *
107
 * @param t Thread to make ready.
108
 *
109
 */
1 jermar 110
void thread_ready(thread_t *t)
111
{
112
    cpu_t *cpu;
113
    runq_t *r;
114
    pri_t pri;
7 jermar 115
    int i, avg, send_ipi = 0;
1 jermar 116
 
117
    pri = cpu_priority_high();
118
 
119
    spinlock_lock(&t->lock);
120
 
121
    i = (t->pri < RQ_COUNT -1) ? ++t->pri : t->pri;
122
 
16 jermar 123
    cpu = CPU;
1 jermar 124
    if (t->flags & X_WIRED) {
125
        cpu = t->cpu;
126
    }
127
    spinlock_unlock(&t->lock);
128
 
107 decky 129
    /*
1 jermar 130
     * Append t to respective ready queue on respective processor.
131
     */
132
    r = &cpu->rq[i];
133
    spinlock_lock(&r->lock);
134
    list_append(&t->rq_link, &r->rq_head);
135
    r->n++;
136
    spinlock_unlock(&r->lock);
137
 
111 palkovsky 138
    atomic_inc(&nrdy);
139
    avg = nrdy / config.cpu_active;
1 jermar 140
 
141
    spinlock_lock(&cpu->lock);
10 jermar 142
    if ((++cpu->nrdy) > avg) {
7 jermar 143
        /*
144
         * If there are idle halted CPU's, this will wake them up.
145
         */
8 jermar 146
        ipi_broadcast(VECTOR_WAKEUP_IPI);
7 jermar 147
    }  
1 jermar 148
    spinlock_unlock(&cpu->lock);
149
 
150
    cpu_priority_restore(pri);
151
}
152
 
107 decky 153
 
154
/** Create new thread
155
 *
156
 * Create a new thread.
157
 *
158
 * @param func  Thread's implementing function.
159
 * @param arg   Thread's implementing function argument.
160
 * @param task  Task to which the thread belongs.
161
 * @param flags Thread flags.
162
 *
163
 * @return New thread's structure on success, NULL on failure.
164
 *
165
 */
1 jermar 166
thread_t *thread_create(void (* func)(void *), void *arg, task_t *task, int flags)
167
{
168
    thread_t *t;
169
    __address frame_ks, frame_us = NULL;
170
 
171
    t = (thread_t *) malloc(sizeof(thread_t));
172
    if (t) {
173
        pri_t pri;
174
 
175
        spinlock_initialize(&t->lock);
176
 
177
        frame_ks = frame_alloc(FRAME_KA);
178
        if (THREAD_USER_STACK & flags) {
115 jermar 179
            frame_us = frame_alloc(FRAME_KA);
1 jermar 180
        }
181
 
182
        pri = cpu_priority_high();
183
        spinlock_lock(&tidlock);
184
        t->tid = ++last_tid;
185
        spinlock_unlock(&tidlock);
186
        cpu_priority_restore(pri);
187
 
188
        memsetb(frame_ks, THREAD_STACK_SIZE, 0);
189
        link_initialize(&t->rq_link);
190
        link_initialize(&t->wq_link);
191
        link_initialize(&t->th_link);
192
        link_initialize(&t->threads_link);
193
        t->kstack = (__u8 *) frame_ks;
194
        t->ustack = (__u8 *) frame_us;
195
 
196
 
197
        context_save(&t->saved_context);
97 jermar 198
        context_set(&t->saved_context, FADDR(cushion), t->kstack, THREAD_STACK_SIZE);
1 jermar 199
 
200
        pri = cpu_priority_high();
201
        t->saved_context.pri = cpu_priority_read();
202
        cpu_priority_restore(pri);
203
 
204
        t->thread_code = func;
205
        t->thread_arg = arg;
206
        t->ticks = -1;
207
        t->pri = -1;        /* start in rq[0] */
208
        t->cpu = NULL;
209
        t->flags = 0;
210
        t->state = Entering;
211
        t->call_me = NULL;
212
        t->call_me_with = NULL;
213
 
214
        timeout_initialize(&t->sleep_timeout);
215
        t->sleep_queue = NULL;
216
        t->timeout_pending = 0;
217
 
218
        t->rwlock_holder_type = RWLOCK_NONE;
219
 
220
        t->task = task;
221
 
73 vana 222
        t->fpu_context_exists=0;
223
        t->fpu_context_engaged=0;
224
 
1 jermar 225
        /*
226
         * Register this thread in the system-wide list.
227
         */
228
        pri = cpu_priority_high();     
229
        spinlock_lock(&threads_lock);
230
        list_append(&t->threads_link, &threads_head);
231
        spinlock_unlock(&threads_lock);
232
 
233
        /*
234
         * Attach to the containing task.
235
         */
236
        spinlock_lock(&task->lock);
237
        list_append(&t->th_link, &task->th_head);
238
        spinlock_unlock(&task->lock);
239
 
240
        cpu_priority_restore(pri);
241
    }
242
 
243
    return t;
244
}
245
 
107 decky 246
 
247
/** Make thread exiting
248
 *
249
 * End current thread execution and switch it to the exiting
250
 * state. All pending timeouts are executed.
251
 *
252
 */
1 jermar 253
void thread_exit(void)
254
{
255
    pri_t pri;
256
 
257
restart:
258
    pri = cpu_priority_high();
15 jermar 259
    spinlock_lock(&THREAD->lock);
260
    if (THREAD->timeout_pending) { /* busy waiting for timeouts in progress */
261
        spinlock_unlock(&THREAD->lock);
1 jermar 262
        cpu_priority_restore(pri);
263
        goto restart;
264
    }
15 jermar 265
    THREAD->state = Exiting;
266
    spinlock_unlock(&THREAD->lock);
1 jermar 267
    scheduler();
268
}
269
 
107 decky 270
 
271
/** Thread sleep
272
 *
273
 * Suspend execution of the current thread.
274
 *
275
 * @param sec Number of seconds to sleep.
276
 *
277
 */
1 jermar 278
void thread_sleep(__u32 sec)
279
{
280
        thread_usleep(sec*1000000);
281
}
107 decky 282
 
283
 
284
/** Thread usleep
285
 *
286
 * Suspend execution of the current thread.
287
 *
288
 * @param usec Number of microseconds to sleep.
289
 *
290
 */
1 jermar 291
void thread_usleep(__u32 usec)
292
{
293
    waitq_t wq;
294
 
295
    waitq_initialize(&wq);
296
 
297
    (void) waitq_sleep_timeout(&wq, usec, SYNCH_NON_BLOCKING);
298
}
299
 
107 decky 300
 
301
/** Register thread out-of-context invocation
302
 *
303
 * Register a function and its argument to be executed
304
 * on next context switch to the current thread.
305
 *
306
 * @param call_me      Out-of-context function.
307
 * @param call_me_with Out-of-context function argument.
308
 *
309
 */
1 jermar 310
void thread_register_call_me(void (* call_me)(void *), void *call_me_with)
311
{
312
    pri_t pri;
313
 
314
    pri = cpu_priority_high();
15 jermar 315
    spinlock_lock(&THREAD->lock);
316
    THREAD->call_me = call_me;
317
    THREAD->call_me_with = call_me_with;
318
    spinlock_unlock(&THREAD->lock);
1 jermar 319
    cpu_priority_restore(pri);
320
}