1 | /*
|
---|
2 | * Copyright (c) 2010 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 | /** @addtogroup genericproc
|
---|
30 | * @{
|
---|
31 | */
|
---|
32 |
|
---|
33 | /**
|
---|
34 | * @file
|
---|
35 | * @brief Thread management functions.
|
---|
36 | */
|
---|
37 |
|
---|
38 | #include <proc/scheduler.h>
|
---|
39 | #include <proc/thread.h>
|
---|
40 | #include <proc/task.h>
|
---|
41 | #include <proc/uarg.h>
|
---|
42 | #include <mm/frame.h>
|
---|
43 | #include <mm/page.h>
|
---|
44 | #include <arch/asm.h>
|
---|
45 | #include <arch/cycle.h>
|
---|
46 | #include <arch.h>
|
---|
47 | #include <synch/synch.h>
|
---|
48 | #include <synch/spinlock.h>
|
---|
49 | #include <synch/waitq.h>
|
---|
50 | #include <cpu.h>
|
---|
51 | #include <str.h>
|
---|
52 | #include <context.h>
|
---|
53 | #include <adt/avl.h>
|
---|
54 | #include <adt/list.h>
|
---|
55 | #include <time/clock.h>
|
---|
56 | #include <time/timeout.h>
|
---|
57 | #include <config.h>
|
---|
58 | #include <arch/interrupt.h>
|
---|
59 | #include <smp/ipi.h>
|
---|
60 | #include <arch/faddr.h>
|
---|
61 | #include <atomic.h>
|
---|
62 | #include <memstr.h>
|
---|
63 | #include <print.h>
|
---|
64 | #include <mm/slab.h>
|
---|
65 | #include <debug.h>
|
---|
66 | #include <main/uinit.h>
|
---|
67 | #include <syscall/copy.h>
|
---|
68 | #include <errno.h>
|
---|
69 |
|
---|
70 |
|
---|
71 | #ifndef LOADED_PROG_STACK_PAGES_NO
|
---|
72 | #define LOADED_PROG_STACK_PAGES_NO 1
|
---|
73 | #endif
|
---|
74 |
|
---|
75 |
|
---|
76 | /** Thread states */
|
---|
77 | const char *thread_states[] = {
|
---|
78 | "Invalid",
|
---|
79 | "Running",
|
---|
80 | "Sleeping",
|
---|
81 | "Ready",
|
---|
82 | "Entering",
|
---|
83 | "Exiting",
|
---|
84 | "Lingering"
|
---|
85 | };
|
---|
86 |
|
---|
87 | typedef struct {
|
---|
88 | thread_id_t thread_id;
|
---|
89 | thread_t *thread;
|
---|
90 | } thread_iterator_t;
|
---|
91 |
|
---|
92 | /** Lock protecting the threads_tree AVL tree.
|
---|
93 | *
|
---|
94 | * For locking rules, see declaration thereof.
|
---|
95 | *
|
---|
96 | */
|
---|
97 | IRQ_SPINLOCK_INITIALIZE(threads_lock);
|
---|
98 |
|
---|
99 | /** AVL tree of all threads.
|
---|
100 | *
|
---|
101 | * When a thread is found in the threads_tree AVL tree, it is guaranteed to
|
---|
102 | * exist as long as the threads_lock is held.
|
---|
103 | *
|
---|
104 | */
|
---|
105 | avltree_t threads_tree;
|
---|
106 |
|
---|
107 | IRQ_SPINLOCK_STATIC_INITIALIZE(tidlock);
|
---|
108 | static thread_id_t last_tid = 0;
|
---|
109 |
|
---|
110 | static slab_cache_t *thread_slab;
|
---|
111 |
|
---|
112 | #ifdef CONFIG_FPU
|
---|
113 | slab_cache_t *fpu_context_slab;
|
---|
114 | #endif
|
---|
115 |
|
---|
116 | /** Thread wrapper.
|
---|
117 | *
|
---|
118 | * This wrapper is provided to ensure that every thread makes a call to
|
---|
119 | * thread_exit() when its implementing function returns.
|
---|
120 | *
|
---|
121 | * interrupts_disable() is assumed.
|
---|
122 | *
|
---|
123 | */
|
---|
124 | static void cushion(void)
|
---|
125 | {
|
---|
126 | void (*f)(void *) = THREAD->thread_code;
|
---|
127 | void *arg = THREAD->thread_arg;
|
---|
128 | THREAD->last_cycle = get_cycle();
|
---|
129 |
|
---|
130 | /* This is where each thread wakes up after its creation */
|
---|
131 | irq_spinlock_unlock(&THREAD->lock, false);
|
---|
132 | interrupts_enable();
|
---|
133 |
|
---|
134 | f(arg);
|
---|
135 |
|
---|
136 | /* Accumulate accounting to the task */
|
---|
137 | irq_spinlock_lock(&THREAD->lock, true);
|
---|
138 | if (!THREAD->uncounted) {
|
---|
139 | thread_update_accounting(true);
|
---|
140 | uint64_t ucycles = THREAD->ucycles;
|
---|
141 | THREAD->ucycles = 0;
|
---|
142 | uint64_t kcycles = THREAD->kcycles;
|
---|
143 | THREAD->kcycles = 0;
|
---|
144 |
|
---|
145 | irq_spinlock_pass(&THREAD->lock, &TASK->lock);
|
---|
146 | TASK->ucycles += ucycles;
|
---|
147 | TASK->kcycles += kcycles;
|
---|
148 | irq_spinlock_unlock(&TASK->lock, true);
|
---|
149 | } else
|
---|
150 | irq_spinlock_unlock(&THREAD->lock, true);
|
---|
151 |
|
---|
152 | thread_exit();
|
---|
153 |
|
---|
154 | /* Not reached */
|
---|
155 | }
|
---|
156 |
|
---|
157 | /** Initialization and allocation for thread_t structure
|
---|
158 | *
|
---|
159 | */
|
---|
160 | static int thr_constructor(void *obj, unsigned int kmflags)
|
---|
161 | {
|
---|
162 | thread_t *thread = (thread_t *) obj;
|
---|
163 |
|
---|
164 | irq_spinlock_initialize(&thread->lock, "thread_t_lock");
|
---|
165 | link_initialize(&thread->rq_link);
|
---|
166 | link_initialize(&thread->wq_link);
|
---|
167 | link_initialize(&thread->th_link);
|
---|
168 |
|
---|
169 | /* call the architecture-specific part of the constructor */
|
---|
170 | thr_constructor_arch(thread);
|
---|
171 |
|
---|
172 | #ifdef CONFIG_FPU
|
---|
173 | #ifdef CONFIG_FPU_LAZY
|
---|
174 | thread->saved_fpu_context = NULL;
|
---|
175 | #else /* CONFIG_FPU_LAZY */
|
---|
176 | thread->saved_fpu_context = slab_alloc(fpu_context_slab, kmflags);
|
---|
177 | if (!thread->saved_fpu_context)
|
---|
178 | return -1;
|
---|
179 | #endif /* CONFIG_FPU_LAZY */
|
---|
180 | #endif /* CONFIG_FPU */
|
---|
181 |
|
---|
182 | thread->kstack = (uint8_t *) frame_alloc(STACK_FRAMES, FRAME_KA | kmflags);
|
---|
183 | if (!thread->kstack) {
|
---|
184 | #ifdef CONFIG_FPU
|
---|
185 | if (thread->saved_fpu_context)
|
---|
186 | slab_free(fpu_context_slab, thread->saved_fpu_context);
|
---|
187 | #endif
|
---|
188 | return -1;
|
---|
189 | }
|
---|
190 |
|
---|
191 | #ifdef CONFIG_UDEBUG
|
---|
192 | mutex_initialize(&thread->udebug.lock, MUTEX_PASSIVE);
|
---|
193 | #endif
|
---|
194 |
|
---|
195 | return 0;
|
---|
196 | }
|
---|
197 |
|
---|
198 | /** Destruction of thread_t object */
|
---|
199 | static size_t thr_destructor(void *obj)
|
---|
200 | {
|
---|
201 | thread_t *thread = (thread_t *) obj;
|
---|
202 |
|
---|
203 | /* call the architecture-specific part of the destructor */
|
---|
204 | thr_destructor_arch(thread);
|
---|
205 |
|
---|
206 | frame_free(KA2PA(thread->kstack));
|
---|
207 |
|
---|
208 | #ifdef CONFIG_FPU
|
---|
209 | if (thread->saved_fpu_context)
|
---|
210 | slab_free(fpu_context_slab, thread->saved_fpu_context);
|
---|
211 | #endif
|
---|
212 |
|
---|
213 | return 1; /* One page freed */
|
---|
214 | }
|
---|
215 |
|
---|
216 | /** Initialize threads
|
---|
217 | *
|
---|
218 | * Initialize kernel threads support.
|
---|
219 | *
|
---|
220 | */
|
---|
221 | void thread_init(void)
|
---|
222 | {
|
---|
223 | THREAD = NULL;
|
---|
224 |
|
---|
225 | atomic_set(&nrdy, 0);
|
---|
226 | thread_slab = slab_cache_create("thread_slab", sizeof(thread_t), 0,
|
---|
227 | thr_constructor, thr_destructor, 0);
|
---|
228 |
|
---|
229 | #ifdef CONFIG_FPU
|
---|
230 | fpu_context_slab = slab_cache_create("fpu_slab", sizeof(fpu_context_t),
|
---|
231 | FPU_CONTEXT_ALIGN, NULL, NULL, 0);
|
---|
232 | #endif
|
---|
233 |
|
---|
234 | avltree_create(&threads_tree);
|
---|
235 | }
|
---|
236 |
|
---|
237 | /** Make thread ready
|
---|
238 | *
|
---|
239 | * Switch thread to the ready state.
|
---|
240 | *
|
---|
241 | * @param t Thread to make ready.
|
---|
242 | *
|
---|
243 | */
|
---|
244 | void thread_ready(thread_t *thread)
|
---|
245 | {
|
---|
246 | irq_spinlock_lock(&thread->lock, true);
|
---|
247 |
|
---|
248 | ASSERT(!(thread->state == Ready));
|
---|
249 |
|
---|
250 | int i = (thread->priority < RQ_COUNT - 1)
|
---|
251 | ? ++thread->priority : thread->priority;
|
---|
252 |
|
---|
253 | cpu_t *cpu = CPU;
|
---|
254 | if (thread->flags & THREAD_FLAG_WIRED) {
|
---|
255 | ASSERT(thread->cpu != NULL);
|
---|
256 | cpu = thread->cpu;
|
---|
257 | }
|
---|
258 | thread->state = Ready;
|
---|
259 |
|
---|
260 | irq_spinlock_pass(&thread->lock, &(cpu->rq[i].lock));
|
---|
261 |
|
---|
262 | /*
|
---|
263 | * Append thread to respective ready queue
|
---|
264 | * on respective processor.
|
---|
265 | */
|
---|
266 |
|
---|
267 | list_append(&thread->rq_link, &cpu->rq[i].rq_head);
|
---|
268 | cpu->rq[i].n++;
|
---|
269 | irq_spinlock_unlock(&(cpu->rq[i].lock), true);
|
---|
270 |
|
---|
271 | atomic_inc(&nrdy);
|
---|
272 | // FIXME: Why is the avg value not used
|
---|
273 | // avg = atomic_get(&nrdy) / config.cpu_active;
|
---|
274 | atomic_inc(&cpu->nrdy);
|
---|
275 | }
|
---|
276 |
|
---|
277 | /** Create new thread
|
---|
278 | *
|
---|
279 | * Create a new thread.
|
---|
280 | *
|
---|
281 | * @param func Thread's implementing function.
|
---|
282 | * @param arg Thread's implementing function argument.
|
---|
283 | * @param task Task to which the thread belongs. The caller must
|
---|
284 | * guarantee that the task won't cease to exist during the
|
---|
285 | * call. The task's lock may not be held.
|
---|
286 | * @param flags Thread flags.
|
---|
287 | * @param name Symbolic name (a copy is made).
|
---|
288 | * @param uncounted Thread's accounting doesn't affect accumulated task
|
---|
289 | * accounting.
|
---|
290 | *
|
---|
291 | * @return New thread's structure on success, NULL on failure.
|
---|
292 | *
|
---|
293 | */
|
---|
294 | thread_t *thread_create(void (* func)(void *), void *arg, task_t *task,
|
---|
295 | unsigned int flags, const char *name, bool uncounted)
|
---|
296 | {
|
---|
297 | thread_t *thread = (thread_t *) slab_alloc(thread_slab, 0);
|
---|
298 | if (!thread)
|
---|
299 | return NULL;
|
---|
300 |
|
---|
301 | /* Not needed, but good for debugging */
|
---|
302 | memsetb(thread->kstack, THREAD_STACK_SIZE * 1 << STACK_FRAMES, 0);
|
---|
303 |
|
---|
304 | irq_spinlock_lock(&tidlock, true);
|
---|
305 | thread->tid = ++last_tid;
|
---|
306 | irq_spinlock_unlock(&tidlock, true);
|
---|
307 |
|
---|
308 | context_save(&thread->saved_context);
|
---|
309 | context_set(&thread->saved_context, FADDR(cushion),
|
---|
310 | (uintptr_t) thread->kstack, THREAD_STACK_SIZE);
|
---|
311 |
|
---|
312 | the_initialize((the_t *) thread->kstack);
|
---|
313 |
|
---|
314 | ipl_t ipl = interrupts_disable();
|
---|
315 | thread->saved_context.ipl = interrupts_read();
|
---|
316 | interrupts_restore(ipl);
|
---|
317 |
|
---|
318 | str_cpy(thread->name, THREAD_NAME_BUFLEN, name);
|
---|
319 |
|
---|
320 | thread->thread_code = func;
|
---|
321 | thread->thread_arg = arg;
|
---|
322 | thread->ticks = -1;
|
---|
323 | thread->ucycles = 0;
|
---|
324 | thread->kcycles = 0;
|
---|
325 | thread->uncounted = uncounted;
|
---|
326 | thread->priority = -1; /* Start in rq[0] */
|
---|
327 | thread->cpu = NULL;
|
---|
328 | thread->flags = flags;
|
---|
329 | thread->state = Entering;
|
---|
330 |
|
---|
331 | timeout_initialize(&thread->sleep_timeout);
|
---|
332 | thread->sleep_interruptible = false;
|
---|
333 | thread->sleep_queue = NULL;
|
---|
334 | thread->timeout_pending = false;
|
---|
335 |
|
---|
336 | thread->in_copy_from_uspace = false;
|
---|
337 | thread->in_copy_to_uspace = false;
|
---|
338 |
|
---|
339 | thread->interrupted = false;
|
---|
340 | thread->detached = false;
|
---|
341 | waitq_initialize(&thread->join_wq);
|
---|
342 |
|
---|
343 | thread->task = task;
|
---|
344 |
|
---|
345 | thread->fpu_context_exists = 0;
|
---|
346 | thread->fpu_context_engaged = 0;
|
---|
347 |
|
---|
348 | avltree_node_initialize(&thread->threads_tree_node);
|
---|
349 | thread->threads_tree_node.key = (uintptr_t) thread;
|
---|
350 |
|
---|
351 | #ifdef CONFIG_UDEBUG
|
---|
352 | /* Init debugging stuff */
|
---|
353 | udebug_thread_initialize(&thread->udebug);
|
---|
354 | #endif
|
---|
355 |
|
---|
356 | /* Might depend on previous initialization */
|
---|
357 | thread_create_arch(thread);
|
---|
358 |
|
---|
359 | if (!(flags & THREAD_FLAG_NOATTACH))
|
---|
360 | thread_attach(thread, task);
|
---|
361 |
|
---|
362 | return thread;
|
---|
363 | }
|
---|
364 |
|
---|
365 | /** Destroy thread memory structure
|
---|
366 | *
|
---|
367 | * Detach thread from all queues, cpus etc. and destroy it.
|
---|
368 | *
|
---|
369 | * @param thread Thread to be destroyed.
|
---|
370 | * @param irq_res Indicate whether it should unlock thread->lock
|
---|
371 | * in interrupts-restore mode.
|
---|
372 | *
|
---|
373 | */
|
---|
374 | void thread_destroy(thread_t *thread, bool irq_res)
|
---|
375 | {
|
---|
376 | ASSERT(irq_spinlock_locked(&thread->lock));
|
---|
377 | ASSERT((thread->state == Exiting) || (thread->state == Lingering));
|
---|
378 | ASSERT(thread->task);
|
---|
379 | ASSERT(thread->cpu);
|
---|
380 |
|
---|
381 | irq_spinlock_lock(&thread->cpu->lock, false);
|
---|
382 | if (thread->cpu->fpu_owner == thread)
|
---|
383 | thread->cpu->fpu_owner = NULL;
|
---|
384 | irq_spinlock_unlock(&thread->cpu->lock, false);
|
---|
385 |
|
---|
386 | irq_spinlock_pass(&thread->lock, &threads_lock);
|
---|
387 |
|
---|
388 | avltree_delete(&threads_tree, &thread->threads_tree_node);
|
---|
389 |
|
---|
390 | irq_spinlock_pass(&threads_lock, &thread->task->lock);
|
---|
391 |
|
---|
392 | /*
|
---|
393 | * Detach from the containing task.
|
---|
394 | */
|
---|
395 | list_remove(&thread->th_link);
|
---|
396 | irq_spinlock_unlock(&thread->task->lock, irq_res);
|
---|
397 |
|
---|
398 | /*
|
---|
399 | * Drop the reference to the containing task.
|
---|
400 | */
|
---|
401 | task_release(thread->task);
|
---|
402 | slab_free(thread_slab, thread);
|
---|
403 | }
|
---|
404 |
|
---|
405 | /** Make the thread visible to the system.
|
---|
406 | *
|
---|
407 | * Attach the thread structure to the current task and make it visible in the
|
---|
408 | * threads_tree.
|
---|
409 | *
|
---|
410 | * @param t Thread to be attached to the task.
|
---|
411 | * @param task Task to which the thread is to be attached.
|
---|
412 | *
|
---|
413 | */
|
---|
414 | void thread_attach(thread_t *thread, task_t *task)
|
---|
415 | {
|
---|
416 | /*
|
---|
417 | * Attach to the specified task.
|
---|
418 | */
|
---|
419 | irq_spinlock_lock(&task->lock, true);
|
---|
420 |
|
---|
421 | /* Hold a reference to the task. */
|
---|
422 | task_hold(task);
|
---|
423 |
|
---|
424 | /* Must not count kbox thread into lifecount */
|
---|
425 | if (thread->flags & THREAD_FLAG_USPACE)
|
---|
426 | atomic_inc(&task->lifecount);
|
---|
427 |
|
---|
428 | list_append(&thread->th_link, &task->th_head);
|
---|
429 |
|
---|
430 | irq_spinlock_pass(&task->lock, &threads_lock);
|
---|
431 |
|
---|
432 | /*
|
---|
433 | * Register this thread in the system-wide list.
|
---|
434 | */
|
---|
435 | avltree_insert(&threads_tree, &thread->threads_tree_node);
|
---|
436 | irq_spinlock_unlock(&threads_lock, true);
|
---|
437 | }
|
---|
438 |
|
---|
439 | /** Terminate thread.
|
---|
440 | *
|
---|
441 | * End current thread execution and switch it to the exiting state.
|
---|
442 | * All pending timeouts are executed.
|
---|
443 | *
|
---|
444 | */
|
---|
445 | void thread_exit(void)
|
---|
446 | {
|
---|
447 | if (THREAD->flags & THREAD_FLAG_USPACE) {
|
---|
448 | #ifdef CONFIG_UDEBUG
|
---|
449 | /* Generate udebug THREAD_E event */
|
---|
450 | udebug_thread_e_event();
|
---|
451 |
|
---|
452 | /*
|
---|
453 | * This thread will not execute any code or system calls from
|
---|
454 | * now on.
|
---|
455 | */
|
---|
456 | udebug_stoppable_begin();
|
---|
457 | #endif
|
---|
458 | if (atomic_predec(&TASK->lifecount) == 0) {
|
---|
459 | /*
|
---|
460 | * We are the last userspace thread in the task that
|
---|
461 | * still has not exited. With the exception of the
|
---|
462 | * moment the task was created, new userspace threads
|
---|
463 | * can only be created by threads of the same task.
|
---|
464 | * We are safe to perform cleanup.
|
---|
465 | *
|
---|
466 | */
|
---|
467 | ipc_cleanup();
|
---|
468 | futex_cleanup();
|
---|
469 | LOG("Cleanup of task %" PRIu64" completed.", TASK->taskid);
|
---|
470 | }
|
---|
471 | }
|
---|
472 |
|
---|
473 | restart:
|
---|
474 | irq_spinlock_lock(&THREAD->lock, true);
|
---|
475 | if (THREAD->timeout_pending) {
|
---|
476 | /* Busy waiting for timeouts in progress */
|
---|
477 | irq_spinlock_unlock(&THREAD->lock, true);
|
---|
478 | goto restart;
|
---|
479 | }
|
---|
480 |
|
---|
481 | THREAD->state = Exiting;
|
---|
482 | irq_spinlock_unlock(&THREAD->lock, true);
|
---|
483 |
|
---|
484 | scheduler();
|
---|
485 |
|
---|
486 | /* Not reached */
|
---|
487 | while (true);
|
---|
488 | }
|
---|
489 |
|
---|
490 | /** Thread sleep
|
---|
491 | *
|
---|
492 | * Suspend execution of the current thread.
|
---|
493 | *
|
---|
494 | * @param sec Number of seconds to sleep.
|
---|
495 | *
|
---|
496 | */
|
---|
497 | void thread_sleep(uint32_t sec)
|
---|
498 | {
|
---|
499 | /* Sleep in 1000 second steps to support
|
---|
500 | full argument range */
|
---|
501 | while (sec > 0) {
|
---|
502 | uint32_t period = (sec > 1000) ? 1000 : sec;
|
---|
503 |
|
---|
504 | thread_usleep(period * 1000000);
|
---|
505 | sec -= period;
|
---|
506 | }
|
---|
507 | }
|
---|
508 |
|
---|
509 | /** Wait for another thread to exit.
|
---|
510 | *
|
---|
511 | * @param thread Thread to join on exit.
|
---|
512 | * @param usec Timeout in microseconds.
|
---|
513 | * @param flags Mode of operation.
|
---|
514 | *
|
---|
515 | * @return An error code from errno.h or an error code from synch.h.
|
---|
516 | *
|
---|
517 | */
|
---|
518 | int thread_join_timeout(thread_t *thread, uint32_t usec, unsigned int flags)
|
---|
519 | {
|
---|
520 | if (thread == THREAD)
|
---|
521 | return EINVAL;
|
---|
522 |
|
---|
523 | /*
|
---|
524 | * Since thread join can only be called once on an undetached thread,
|
---|
525 | * the thread pointer is guaranteed to be still valid.
|
---|
526 | */
|
---|
527 |
|
---|
528 | irq_spinlock_lock(&thread->lock, true);
|
---|
529 | ASSERT(!thread->detached);
|
---|
530 | irq_spinlock_unlock(&thread->lock, true);
|
---|
531 |
|
---|
532 | return waitq_sleep_timeout(&thread->join_wq, usec, flags);
|
---|
533 | }
|
---|
534 |
|
---|
535 | /** Detach thread.
|
---|
536 | *
|
---|
537 | * Mark the thread as detached, if the thread is already in the Lingering
|
---|
538 | * state, deallocate its resources.
|
---|
539 | *
|
---|
540 | * @param thread Thread to be detached.
|
---|
541 | *
|
---|
542 | */
|
---|
543 | void thread_detach(thread_t *thread)
|
---|
544 | {
|
---|
545 | /*
|
---|
546 | * Since the thread is expected not to be already detached,
|
---|
547 | * pointer to it must be still valid.
|
---|
548 | */
|
---|
549 | irq_spinlock_lock(&thread->lock, true);
|
---|
550 | ASSERT(!thread->detached);
|
---|
551 |
|
---|
552 | if (thread->state == Lingering) {
|
---|
553 | /*
|
---|
554 | * Unlock &thread->lock and restore
|
---|
555 | * interrupts in thread_destroy().
|
---|
556 | */
|
---|
557 | thread_destroy(thread, true);
|
---|
558 | return;
|
---|
559 | } else {
|
---|
560 | thread->detached = true;
|
---|
561 | }
|
---|
562 |
|
---|
563 | irq_spinlock_unlock(&thread->lock, true);
|
---|
564 | }
|
---|
565 |
|
---|
566 | /** Thread usleep
|
---|
567 | *
|
---|
568 | * Suspend execution of the current thread.
|
---|
569 | *
|
---|
570 | * @param usec Number of microseconds to sleep.
|
---|
571 | *
|
---|
572 | */
|
---|
573 | void thread_usleep(uint32_t usec)
|
---|
574 | {
|
---|
575 | waitq_t wq;
|
---|
576 |
|
---|
577 | waitq_initialize(&wq);
|
---|
578 |
|
---|
579 | (void) waitq_sleep_timeout(&wq, usec, SYNCH_FLAGS_NON_BLOCKING);
|
---|
580 | }
|
---|
581 |
|
---|
582 | static bool thread_walker(avltree_node_t *node, void *arg)
|
---|
583 | {
|
---|
584 | bool *additional = (bool *) arg;
|
---|
585 | thread_t *thread = avltree_get_instance(node, thread_t, threads_tree_node);
|
---|
586 |
|
---|
587 | uint64_t ucycles, kcycles;
|
---|
588 | char usuffix, ksuffix;
|
---|
589 | order_suffix(thread->ucycles, &ucycles, &usuffix);
|
---|
590 | order_suffix(thread->kcycles, &kcycles, &ksuffix);
|
---|
591 |
|
---|
592 | #ifdef __32_BITS__
|
---|
593 | if (*additional)
|
---|
594 | printf("%-8" PRIu64" %10p %9" PRIu64 "%c %9" PRIu64 "%c ",
|
---|
595 | thread->tid, thread->kstack, ucycles, usuffix,
|
---|
596 | kcycles, ksuffix);
|
---|
597 | else
|
---|
598 | printf("%-8" PRIu64" %-14s %10p %-8s %10p %-5" PRIu32 " %10p\n",
|
---|
599 | thread->tid, thread->name, thread, thread_states[thread->state],
|
---|
600 | thread->task, thread->task->context, thread->thread_code);
|
---|
601 | #endif
|
---|
602 |
|
---|
603 | #ifdef __64_BITS__
|
---|
604 | if (*additional)
|
---|
605 | printf("%-8" PRIu64" %18p %18p\n"
|
---|
606 | " %9" PRIu64 "%c %9" PRIu64 "%c ",
|
---|
607 | thread->tid, thread->thread_code, thread->kstack,
|
---|
608 | ucycles, usuffix, kcycles, ksuffix);
|
---|
609 | else
|
---|
610 | printf("%-8" PRIu64" %-14s %18p %-8s %18p %-5" PRIu32 "\n",
|
---|
611 | thread->tid, thread->name, thread, thread_states[thread->state],
|
---|
612 | thread->task, thread->task->context);
|
---|
613 | #endif
|
---|
614 |
|
---|
615 | if (*additional) {
|
---|
616 | if (thread->cpu)
|
---|
617 | printf("%-5u", thread->cpu->id);
|
---|
618 | else
|
---|
619 | printf("none ");
|
---|
620 |
|
---|
621 | if (thread->state == Sleeping) {
|
---|
622 | #ifdef __32_BITS__
|
---|
623 | printf(" %10p", thread->sleep_queue);
|
---|
624 | #endif
|
---|
625 |
|
---|
626 | #ifdef __64_BITS__
|
---|
627 | printf(" %18p", thread->sleep_queue);
|
---|
628 | #endif
|
---|
629 | }
|
---|
630 |
|
---|
631 | printf("\n");
|
---|
632 | }
|
---|
633 |
|
---|
634 | return true;
|
---|
635 | }
|
---|
636 |
|
---|
637 | /** Print list of threads debug info
|
---|
638 | *
|
---|
639 | * @param additional Print additional information.
|
---|
640 | *
|
---|
641 | */
|
---|
642 | void thread_print_list(bool additional)
|
---|
643 | {
|
---|
644 | /* Messing with thread structures, avoid deadlock */
|
---|
645 | irq_spinlock_lock(&threads_lock, true);
|
---|
646 |
|
---|
647 | #ifdef __32_BITS__
|
---|
648 | if (additional)
|
---|
649 | printf("[id ] [stack ] [ucycles ] [kcycles ] [cpu]"
|
---|
650 | " [waitqueue]\n");
|
---|
651 | else
|
---|
652 | printf("[id ] [name ] [address ] [state ] [task ]"
|
---|
653 | " [ctx] [code ]\n");
|
---|
654 | #endif
|
---|
655 |
|
---|
656 | #ifdef __64_BITS__
|
---|
657 | if (additional) {
|
---|
658 | printf("[id ] [code ] [stack ]\n"
|
---|
659 | " [ucycles ] [kcycles ] [cpu] [waitqueue ]\n");
|
---|
660 | } else
|
---|
661 | printf("[id ] [name ] [address ] [state ]"
|
---|
662 | " [task ] [ctx]\n");
|
---|
663 | #endif
|
---|
664 |
|
---|
665 | avltree_walk(&threads_tree, thread_walker, &additional);
|
---|
666 |
|
---|
667 | irq_spinlock_unlock(&threads_lock, true);
|
---|
668 | }
|
---|
669 |
|
---|
670 | /** Check whether thread exists.
|
---|
671 | *
|
---|
672 | * Note that threads_lock must be already held and
|
---|
673 | * interrupts must be already disabled.
|
---|
674 | *
|
---|
675 | * @param thread Pointer to thread.
|
---|
676 | *
|
---|
677 | * @return True if thread t is known to the system, false otherwise.
|
---|
678 | *
|
---|
679 | */
|
---|
680 | bool thread_exists(thread_t *thread)
|
---|
681 | {
|
---|
682 | ASSERT(interrupts_disabled());
|
---|
683 | ASSERT(irq_spinlock_locked(&threads_lock));
|
---|
684 |
|
---|
685 | avltree_node_t *node =
|
---|
686 | avltree_search(&threads_tree, (avltree_key_t) ((uintptr_t) thread));
|
---|
687 |
|
---|
688 | return node != NULL;
|
---|
689 | }
|
---|
690 |
|
---|
691 | /** Update accounting of current thread.
|
---|
692 | *
|
---|
693 | * Note that thread_lock on THREAD must be already held and
|
---|
694 | * interrupts must be already disabled.
|
---|
695 | *
|
---|
696 | * @param user True to update user accounting, false for kernel.
|
---|
697 | *
|
---|
698 | */
|
---|
699 | void thread_update_accounting(bool user)
|
---|
700 | {
|
---|
701 | uint64_t time = get_cycle();
|
---|
702 |
|
---|
703 | ASSERT(interrupts_disabled());
|
---|
704 | ASSERT(irq_spinlock_locked(&THREAD->lock));
|
---|
705 |
|
---|
706 | if (user)
|
---|
707 | THREAD->ucycles += time - THREAD->last_cycle;
|
---|
708 | else
|
---|
709 | THREAD->kcycles += time - THREAD->last_cycle;
|
---|
710 |
|
---|
711 | THREAD->last_cycle = time;
|
---|
712 | }
|
---|
713 |
|
---|
714 | static bool thread_search_walker(avltree_node_t *node, void *arg)
|
---|
715 | {
|
---|
716 | thread_t *thread =
|
---|
717 | (thread_t *) avltree_get_instance(node, thread_t, threads_tree_node);
|
---|
718 | thread_iterator_t *iterator = (thread_iterator_t *) arg;
|
---|
719 |
|
---|
720 | if (thread->tid == iterator->thread_id) {
|
---|
721 | iterator->thread = thread;
|
---|
722 | return false;
|
---|
723 | }
|
---|
724 |
|
---|
725 | return true;
|
---|
726 | }
|
---|
727 |
|
---|
728 | /** Find thread structure corresponding to thread ID.
|
---|
729 | *
|
---|
730 | * The threads_lock must be already held by the caller of this function and
|
---|
731 | * interrupts must be disabled.
|
---|
732 | *
|
---|
733 | * @param id Thread ID.
|
---|
734 | *
|
---|
735 | * @return Thread structure address or NULL if there is no such thread ID.
|
---|
736 | *
|
---|
737 | */
|
---|
738 | thread_t *thread_find_by_id(thread_id_t thread_id)
|
---|
739 | {
|
---|
740 | ASSERT(interrupts_disabled());
|
---|
741 | ASSERT(irq_spinlock_locked(&threads_lock));
|
---|
742 |
|
---|
743 | thread_iterator_t iterator;
|
---|
744 |
|
---|
745 | iterator.thread_id = thread_id;
|
---|
746 | iterator.thread = NULL;
|
---|
747 |
|
---|
748 | avltree_walk(&threads_tree, thread_search_walker, (void *) &iterator);
|
---|
749 |
|
---|
750 | return iterator.thread;
|
---|
751 | }
|
---|
752 |
|
---|
753 |
|
---|
754 | /** Process syscall to create new thread.
|
---|
755 | *
|
---|
756 | */
|
---|
757 | unative_t sys_thread_create(uspace_arg_t *uspace_uarg, char *uspace_name,
|
---|
758 | size_t name_len, thread_id_t *uspace_thread_id)
|
---|
759 | {
|
---|
760 | if (name_len > THREAD_NAME_BUFLEN - 1)
|
---|
761 | name_len = THREAD_NAME_BUFLEN - 1;
|
---|
762 |
|
---|
763 | char namebuf[THREAD_NAME_BUFLEN];
|
---|
764 | int rc = copy_from_uspace(namebuf, uspace_name, name_len);
|
---|
765 | if (rc != 0)
|
---|
766 | return (unative_t) rc;
|
---|
767 |
|
---|
768 | namebuf[name_len] = 0;
|
---|
769 |
|
---|
770 | /*
|
---|
771 | * In case of failure, kernel_uarg will be deallocated in this function.
|
---|
772 | * In case of success, kernel_uarg will be freed in uinit().
|
---|
773 | *
|
---|
774 | */
|
---|
775 | uspace_arg_t *kernel_uarg =
|
---|
776 | (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0);
|
---|
777 |
|
---|
778 | rc = copy_from_uspace(kernel_uarg, uspace_uarg, sizeof(uspace_arg_t));
|
---|
779 | if (rc != 0) {
|
---|
780 | free(kernel_uarg);
|
---|
781 | return (unative_t) rc;
|
---|
782 | }
|
---|
783 |
|
---|
784 | thread_t *thread = thread_create(uinit, kernel_uarg, TASK,
|
---|
785 | THREAD_FLAG_USPACE | THREAD_FLAG_NOATTACH, namebuf, false);
|
---|
786 | if (thread) {
|
---|
787 | if (uspace_thread_id != NULL) {
|
---|
788 | rc = copy_to_uspace(uspace_thread_id, &thread->tid,
|
---|
789 | sizeof(thread->tid));
|
---|
790 | if (rc != 0) {
|
---|
791 | /*
|
---|
792 | * We have encountered a failure, but the thread
|
---|
793 | * has already been created. We need to undo its
|
---|
794 | * creation now.
|
---|
795 | *
|
---|
796 | */
|
---|
797 |
|
---|
798 | /*
|
---|
799 | * The new thread structure is initialized, but
|
---|
800 | * is still not visible to the system.
|
---|
801 | * We can safely deallocate it.
|
---|
802 | */
|
---|
803 | slab_free(thread_slab, thread);
|
---|
804 | free(kernel_uarg);
|
---|
805 |
|
---|
806 | return (unative_t) rc;
|
---|
807 | }
|
---|
808 | }
|
---|
809 |
|
---|
810 | #ifdef CONFIG_UDEBUG
|
---|
811 | /*
|
---|
812 | * Generate udebug THREAD_B event and attach the thread.
|
---|
813 | * This must be done atomically (with the debug locks held),
|
---|
814 | * otherwise we would either miss some thread or receive
|
---|
815 | * THREAD_B events for threads that already existed
|
---|
816 | * and could be detected with THREAD_READ before.
|
---|
817 | *
|
---|
818 | */
|
---|
819 | udebug_thread_b_event_attach(thread, TASK);
|
---|
820 | #else
|
---|
821 | thread_attach(thread, TASK);
|
---|
822 | #endif
|
---|
823 | thread_ready(thread);
|
---|
824 |
|
---|
825 | return 0;
|
---|
826 | } else
|
---|
827 | free(kernel_uarg);
|
---|
828 |
|
---|
829 | return (unative_t) ENOMEM;
|
---|
830 | }
|
---|
831 |
|
---|
832 | /** Process syscall to terminate thread.
|
---|
833 | *
|
---|
834 | */
|
---|
835 | unative_t sys_thread_exit(int uspace_status)
|
---|
836 | {
|
---|
837 | thread_exit();
|
---|
838 |
|
---|
839 | /* Unreachable */
|
---|
840 | return 0;
|
---|
841 | }
|
---|
842 |
|
---|
843 | /** Syscall for getting TID.
|
---|
844 | *
|
---|
845 | * @param uspace_thread_id Userspace address of 8-byte buffer where to store
|
---|
846 | * current thread ID.
|
---|
847 | *
|
---|
848 | * @return 0 on success or an error code from @ref errno.h.
|
---|
849 | *
|
---|
850 | */
|
---|
851 | unative_t sys_thread_get_id(thread_id_t *uspace_thread_id)
|
---|
852 | {
|
---|
853 | /*
|
---|
854 | * No need to acquire lock on THREAD because tid
|
---|
855 | * remains constant for the lifespan of the thread.
|
---|
856 | *
|
---|
857 | */
|
---|
858 | return (unative_t) copy_to_uspace(uspace_thread_id, &THREAD->tid,
|
---|
859 | sizeof(THREAD->tid));
|
---|
860 | }
|
---|
861 |
|
---|
862 | /** Syscall wrapper for sleeping. */
|
---|
863 | unative_t sys_thread_usleep(uint32_t usec)
|
---|
864 | {
|
---|
865 | thread_usleep(usec);
|
---|
866 | return 0;
|
---|
867 | }
|
---|
868 |
|
---|
869 | /** @}
|
---|
870 | */
|
---|