Subversion Repositories HelenOS

Rev

Rev 184 | Rev 210 | 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>
195 vana 53
#include <memstr.h>
7 jermar 54
 
107 decky 55
char *thread_states[] = {"Invalid", "Running", "Sleeping", "Ready", "Entering", "Exiting"}; /**< Thread states */
1 jermar 56
 
57
spinlock_t threads_lock;
58
link_t threads_head;
59
 
60
static spinlock_t tidlock;
61
__u32 last_tid = 0;
62
 
107 decky 63
 
64
/** Thread wrapper
65
 *
66
 * This wrapper is provided to ensure that every thread
1 jermar 67
 * makes a call to thread_exit() when its implementing
68
 * function returns.
69
 *
107 decky 70
 * cpu_priority_high() is assumed.
71
 *
1 jermar 72
 */
73
void cushion(void)
74
{
15 jermar 75
    void (*f)(void *) = THREAD->thread_code;
76
    void *arg = THREAD->thread_arg;
1 jermar 77
 
22 jermar 78
    before_thread_runs();
79
 
1 jermar 80
    /* this is where each thread wakes up after its creation */
15 jermar 81
    spinlock_unlock(&THREAD->lock);
1 jermar 82
    cpu_priority_low();
83
 
84
    f(arg);
85
    thread_exit();
86
    /* not reached */
87
}
88
 
107 decky 89
 
90
/** Initialize threads
91
 *
92
 * Initialize kernel threads support.
93
 *
94
 */
1 jermar 95
void thread_init(void)
96
{
15 jermar 97
    THREAD = NULL;
1 jermar 98
    nrdy = 0;
99
    spinlock_initialize(&threads_lock);
100
    list_initialize(&threads_head);
101
}
102
 
107 decky 103
 
104
/** Make thread ready
105
 *
106
 * Switch thread t to the ready state.
107
 *
108
 * @param t Thread to make ready.
109
 *
110
 */
1 jermar 111
void thread_ready(thread_t *t)
112
{
113
    cpu_t *cpu;
114
    runq_t *r;
115
    pri_t pri;
7 jermar 116
    int i, avg, send_ipi = 0;
1 jermar 117
 
118
    pri = cpu_priority_high();
119
 
120
    spinlock_lock(&t->lock);
121
 
122
    i = (t->pri < RQ_COUNT -1) ? ++t->pri : t->pri;
123
 
16 jermar 124
    cpu = CPU;
1 jermar 125
    if (t->flags & X_WIRED) {
126
        cpu = t->cpu;
127
    }
128
    spinlock_unlock(&t->lock);
129
 
107 decky 130
    /*
1 jermar 131
     * Append t to respective ready queue on respective processor.
132
     */
133
    r = &cpu->rq[i];
134
    spinlock_lock(&r->lock);
135
    list_append(&t->rq_link, &r->rq_head);
136
    r->n++;
137
    spinlock_unlock(&r->lock);
138
 
111 palkovsky 139
    atomic_inc(&nrdy);
140
    avg = nrdy / config.cpu_active;
1 jermar 141
 
142
    spinlock_lock(&cpu->lock);
10 jermar 143
    if ((++cpu->nrdy) > avg) {
7 jermar 144
        /*
145
         * If there are idle halted CPU's, this will wake them up.
146
         */
8 jermar 147
        ipi_broadcast(VECTOR_WAKEUP_IPI);
7 jermar 148
    }  
1 jermar 149
    spinlock_unlock(&cpu->lock);
125 jermar 150
 
1 jermar 151
    cpu_priority_restore(pri);
152
}
153
 
107 decky 154
 
155
/** Create new thread
156
 *
157
 * Create a new thread.
158
 *
159
 * @param func  Thread's implementing function.
160
 * @param arg   Thread's implementing function argument.
161
 * @param task  Task to which the thread belongs.
162
 * @param flags Thread flags.
163
 *
164
 * @return New thread's structure on success, NULL on failure.
165
 *
166
 */
1 jermar 167
thread_t *thread_create(void (* func)(void *), void *arg, task_t *task, int flags)
168
{
169
    thread_t *t;
170
    __address frame_ks, frame_us = NULL;
171
 
172
    t = (thread_t *) malloc(sizeof(thread_t));
173
    if (t) {
174
        pri_t pri;
175
 
176
        spinlock_initialize(&t->lock);
177
 
178
        frame_ks = frame_alloc(FRAME_KA);
179
        if (THREAD_USER_STACK & flags) {
115 jermar 180
            frame_us = frame_alloc(FRAME_KA);
1 jermar 181
        }
182
 
183
        pri = cpu_priority_high();
184
        spinlock_lock(&tidlock);
185
        t->tid = ++last_tid;
186
        spinlock_unlock(&tidlock);
187
        cpu_priority_restore(pri);
188
 
189
        memsetb(frame_ks, THREAD_STACK_SIZE, 0);
190
        link_initialize(&t->rq_link);
191
        link_initialize(&t->wq_link);
192
        link_initialize(&t->th_link);
193
        link_initialize(&t->threads_link);
194
        t->kstack = (__u8 *) frame_ks;
195
        t->ustack = (__u8 *) frame_us;
196
 
197
 
198
        context_save(&t->saved_context);
97 jermar 199
        context_set(&t->saved_context, FADDR(cushion), t->kstack, THREAD_STACK_SIZE);
184 jermar 200
 
201
        the_initialize((the_t *) t->kstack);
1 jermar 202
 
203
        pri = cpu_priority_high();
204
        t->saved_context.pri = cpu_priority_read();
205
        cpu_priority_restore(pri);
206
 
207
        t->thread_code = func;
208
        t->thread_arg = arg;
209
        t->ticks = -1;
210
        t->pri = -1;        /* start in rq[0] */
211
        t->cpu = NULL;
212
        t->flags = 0;
213
        t->state = Entering;
214
        t->call_me = NULL;
215
        t->call_me_with = NULL;
216
 
217
        timeout_initialize(&t->sleep_timeout);
218
        t->sleep_queue = NULL;
219
        t->timeout_pending = 0;
220
 
221
        t->rwlock_holder_type = RWLOCK_NONE;
222
 
223
        t->task = task;
224
 
73 vana 225
        t->fpu_context_exists=0;
226
        t->fpu_context_engaged=0;
227
 
1 jermar 228
        /*
229
         * Register this thread in the system-wide list.
230
         */
231
        pri = cpu_priority_high();     
232
        spinlock_lock(&threads_lock);
233
        list_append(&t->threads_link, &threads_head);
234
        spinlock_unlock(&threads_lock);
235
 
236
        /*
237
         * Attach to the containing task.
238
         */
239
        spinlock_lock(&task->lock);
240
        list_append(&t->th_link, &task->th_head);
241
        spinlock_unlock(&task->lock);
242
 
243
        cpu_priority_restore(pri);
244
    }
245
 
246
    return t;
247
}
248
 
107 decky 249
 
250
/** Make thread exiting
251
 *
252
 * End current thread execution and switch it to the exiting
253
 * state. All pending timeouts are executed.
254
 *
255
 */
1 jermar 256
void thread_exit(void)
257
{
258
    pri_t pri;
259
 
260
restart:
261
    pri = cpu_priority_high();
15 jermar 262
    spinlock_lock(&THREAD->lock);
263
    if (THREAD->timeout_pending) { /* busy waiting for timeouts in progress */
264
        spinlock_unlock(&THREAD->lock);
1 jermar 265
        cpu_priority_restore(pri);
266
        goto restart;
267
    }
15 jermar 268
    THREAD->state = Exiting;
269
    spinlock_unlock(&THREAD->lock);
1 jermar 270
    scheduler();
271
}
272
 
107 decky 273
 
274
/** Thread sleep
275
 *
276
 * Suspend execution of the current thread.
277
 *
278
 * @param sec Number of seconds to sleep.
279
 *
280
 */
1 jermar 281
void thread_sleep(__u32 sec)
282
{
125 jermar 283
    thread_usleep(sec*1000000);
1 jermar 284
}
107 decky 285
 
286
 
287
/** Thread usleep
288
 *
289
 * Suspend execution of the current thread.
290
 *
291
 * @param usec Number of microseconds to sleep.
292
 *
293
 */
1 jermar 294
void thread_usleep(__u32 usec)
295
{
296
    waitq_t wq;
297
 
298
    waitq_initialize(&wq);
299
 
300
    (void) waitq_sleep_timeout(&wq, usec, SYNCH_NON_BLOCKING);
301
}
302
 
107 decky 303
 
304
/** Register thread out-of-context invocation
305
 *
306
 * Register a function and its argument to be executed
307
 * on next context switch to the current thread.
308
 *
309
 * @param call_me      Out-of-context function.
310
 * @param call_me_with Out-of-context function argument.
311
 *
312
 */
1 jermar 313
void thread_register_call_me(void (* call_me)(void *), void *call_me_with)
314
{
315
    pri_t pri;
316
 
317
    pri = cpu_priority_high();
15 jermar 318
    spinlock_lock(&THREAD->lock);
319
    THREAD->call_me = call_me;
320
    THREAD->call_me_with = call_me_with;
321
    spinlock_unlock(&THREAD->lock);
1 jermar 322
    cpu_priority_restore(pri);
323
}