source: mainline/kernel/generic/src/proc/thread.c@ 6c0adbc

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since 6c0adbc was 13964ef, checked in by Jiri Svoboda <jirik.svoboda@…>, 17 years ago

Fix race that allowed Udebug to report THREAD_B events for threads already reported with THREAD_READ.

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