source: mainline/kernel/generic/src/proc/thread.c@ 81c0171e

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since 81c0171e was 81c0171e, checked in by Jakub Jermar <jakub@…>, 17 years ago

Fix typo ALV tree vs. AVL tree.

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