source: mainline/kernel/generic/src/proc/thread.c@ 7b63b6b

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

Kernel stack address was printed twice.

  • Property mode set to 100644
File size: 16.9 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>
[016acbe]54#include <adt/btree.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
[4e33b6b]84/** Lock protecting the threads_btree B+tree.
85 *
86 * For locking rules, see declaration thereof.
87 */
[016acbe]88SPINLOCK_INITIALIZE(threads_lock);
[88169d9]89
90/** B+tree of all threads.
91 *
[4e33b6b]92 * When a thread is found in the threads_btree B+tree, it is guaranteed to
93 * exist as long as the threads_lock is held.
[88169d9]94 */
95btree_t threads_btree;
[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
[016acbe]215 btree_create(&threads_btree);
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
[4e33b6b]342 /* might depend on previous initialization */
343 thread_create_arch(t);
[d8431986]344
345 if (!(flags & THREAD_FLAG_NOATTACH))
346 thread_attach(t, task);
347
348 return t;
349}
350
351/** Destroy thread memory structure
352 *
353 * Detach thread from all queues, cpus etc. and destroy it.
354 *
355 * Assume thread->lock is held!!
356 */
357void thread_destroy(thread_t *t)
358{
[48d14222]359 ASSERT(t->state == Exiting || t->state == Lingering);
[d8431986]360 ASSERT(t->task);
361 ASSERT(t->cpu);
362
363 spinlock_lock(&t->cpu->lock);
364 if (t->cpu->fpu_owner == t)
365 t->cpu->fpu_owner = NULL;
366 spinlock_unlock(&t->cpu->lock);
367
368 spinlock_unlock(&t->lock);
369
370 spinlock_lock(&threads_lock);
371 btree_remove(&threads_btree, (btree_key_t) ((uintptr_t ) t), NULL);
372 spinlock_unlock(&threads_lock);
373
374 /*
375 * Detach from the containing task.
376 */
377 spinlock_lock(&t->task->lock);
378 list_remove(&t->th_link);
379 spinlock_unlock(&t->task->lock);
[ea7890e7]380
381 /*
382 * t is guaranteed to be the very last thread of its task.
383 * It is safe to destroy the task.
384 */
385 if (atomic_predec(&t->task->refcount) == 0)
[d8431986]386 task_destroy(t->task);
387
388 slab_free(thread_slab, t);
389}
390
391/** Make the thread visible to the system.
392 *
393 * Attach the thread structure to the current task and make it visible in the
394 * threads_btree.
395 *
396 * @param t Thread to be attached to the task.
397 * @param task Task to which the thread is to be attached.
398 */
399void thread_attach(thread_t *t, task_t *task)
400{
401 ipl_t ipl;
402
403 /*
404 * Attach to the current task.
405 */
[ea7890e7]406 ipl = interrupts_disable();
[d8431986]407 spinlock_lock(&task->lock);
[ea7890e7]408 atomic_inc(&task->refcount);
409 atomic_inc(&task->lifecount);
[7509ddc]410 list_append(&t->th_link, &task->th_head);
411 spinlock_unlock(&task->lock);
412
[bb68433]413 /*
414 * Register this thread in the system-wide list.
415 */
416 spinlock_lock(&threads_lock);
[4e33b6b]417 btree_insert(&threads_btree, (btree_key_t) ((uintptr_t) t), (void *) t,
[6f4495f5]418 NULL);
[bb68433]419 spinlock_unlock(&threads_lock);
420
421 interrupts_restore(ipl);
[f761f1eb]422}
423
[0182a665]424/** Terminate thread.
[70527f1]425 *
[4e33b6b]426 * End current thread execution and switch it to the exiting state. All pending
427 * timeouts are executed.
[70527f1]428 */
[f761f1eb]429void thread_exit(void)
430{
[22f7769]431 ipl_t ipl;
[f761f1eb]432
[ea7890e7]433 if (atomic_predec(&TASK->lifecount) == 0) {
434 /*
435 * We are the last thread in the task that still has not exited.
436 * With the exception of the moment the task was created, new
437 * threads can only be created by threads of the same task.
438 * We are safe to perform cleanup.
439 */
440 if (THREAD->flags & THREAD_FLAG_USPACE) {
441 ipc_cleanup();
442 futex_cleanup();
443 klog_printf("Cleanup of task %llu completed.",
444 TASK->taskid);
445 }
446 }
447
[f761f1eb]448restart:
[22f7769]449 ipl = interrupts_disable();
[43114c5]450 spinlock_lock(&THREAD->lock);
[4e33b6b]451 if (THREAD->timeout_pending) {
452 /* busy waiting for timeouts in progress */
[43114c5]453 spinlock_unlock(&THREAD->lock);
[22f7769]454 interrupts_restore(ipl);
[f761f1eb]455 goto restart;
456 }
[ea7890e7]457
[43114c5]458 THREAD->state = Exiting;
459 spinlock_unlock(&THREAD->lock);
[f761f1eb]460 scheduler();
[874621f]461
462 /* Not reached */
463 while (1)
464 ;
[f761f1eb]465}
466
[70527f1]467
468/** Thread sleep
469 *
470 * Suspend execution of the current thread.
471 *
472 * @param sec Number of seconds to sleep.
473 *
474 */
[7f1c620]475void thread_sleep(uint32_t sec)
[f761f1eb]476{
[4e33b6b]477 thread_usleep(sec * 1000000);
[f761f1eb]478}
[70527f1]479
[fe19611]480/** Wait for another thread to exit.
481 *
482 * @param t Thread to join on exit.
483 * @param usec Timeout in microseconds.
484 * @param flags Mode of operation.
485 *
486 * @return An error code from errno.h or an error code from synch.h.
487 */
[7f1c620]488int thread_join_timeout(thread_t *t, uint32_t usec, int flags)
[fe19611]489{
490 ipl_t ipl;
491 int rc;
492
493 if (t == THREAD)
494 return EINVAL;
495
496 /*
497 * Since thread join can only be called once on an undetached thread,
498 * the thread pointer is guaranteed to be still valid.
499 */
500
501 ipl = interrupts_disable();
502 spinlock_lock(&t->lock);
503 ASSERT(!t->detached);
504 spinlock_unlock(&t->lock);
[7b3e7f4]505 interrupts_restore(ipl);
[fe19611]506
[0182a665]507 rc = waitq_sleep_timeout(&t->join_wq, usec, flags);
508
[fe19611]509 return rc;
510}
511
512/** Detach thread.
513 *
[48d14222]514 * Mark the thread as detached, if the thread is already in the Lingering
515 * state, deallocate its resources.
[fe19611]516 *
517 * @param t Thread to be detached.
518 */
519void thread_detach(thread_t *t)
520{
521 ipl_t ipl;
522
523 /*
[31d8e10]524 * Since the thread is expected not to be already detached,
[fe19611]525 * pointer to it must be still valid.
526 */
527 ipl = interrupts_disable();
528 spinlock_lock(&t->lock);
529 ASSERT(!t->detached);
[48d14222]530 if (t->state == Lingering) {
[fe19611]531 thread_destroy(t); /* unlocks &t->lock */
532 interrupts_restore(ipl);
533 return;
534 } else {
535 t->detached = true;
536 }
537 spinlock_unlock(&t->lock);
538 interrupts_restore(ipl);
539}
540
[70527f1]541/** Thread usleep
542 *
543 * Suspend execution of the current thread.
544 *
545 * @param usec Number of microseconds to sleep.
546 *
547 */
[7f1c620]548void thread_usleep(uint32_t usec)
[f761f1eb]549{
550 waitq_t wq;
551
552 waitq_initialize(&wq);
553
[116d1ef4]554 (void) waitq_sleep_timeout(&wq, usec, SYNCH_FLAGS_NON_BLOCKING);
[f761f1eb]555}
556
[70527f1]557/** Register thread out-of-context invocation
558 *
559 * Register a function and its argument to be executed
560 * on next context switch to the current thread.
561 *
562 * @param call_me Out-of-context function.
563 * @param call_me_with Out-of-context function argument.
564 *
565 */
[f761f1eb]566void thread_register_call_me(void (* call_me)(void *), void *call_me_with)
567{
[22f7769]568 ipl_t ipl;
[f761f1eb]569
[22f7769]570 ipl = interrupts_disable();
[43114c5]571 spinlock_lock(&THREAD->lock);
572 THREAD->call_me = call_me;
573 THREAD->call_me_with = call_me_with;
574 spinlock_unlock(&THREAD->lock);
[22f7769]575 interrupts_restore(ipl);
[f761f1eb]576}
[55ab0f1]577
578/** Print list of threads debug info */
579void thread_print_list(void)
580{
581 link_t *cur;
582 ipl_t ipl;
583
584 /* Messing with thread structures, avoid deadlock */
585 ipl = interrupts_disable();
586 spinlock_lock(&threads_lock);
[cce6acf]587
[6f4495f5]588 printf("tid name address state task ctx code "
[7b63b6b]589 " stack cycles cpu waitqueue\n");
[6f4495f5]590 printf("------ ---------- ---------- -------- ---------- --- --------"
[7b63b6b]591 "-- ---------- ---------- ---- ---------\n");
[55ab0f1]592
[6f4495f5]593 for (cur = threads_btree.leaf_head.next;
594 cur != &threads_btree.leaf_head; cur = cur->next) {
[016acbe]595 btree_node_t *node;
[4184e76]596 unsigned int i;
[016acbe]597
598 node = list_get_instance(cur, btree_node_t, leaf_link);
599 for (i = 0; i < node->keys; i++) {
600 thread_t *t;
601
602 t = (thread_t *) node->value[i];
[cce6acf]603
604 uint64_t cycles;
605 char suffix;
[95155b0c]606 order(t->cycles, &cycles, &suffix);
[cce6acf]607
[201abde]608 printf("%-6llu %-10s %#10zx %-8s %#10zx %-3ld %#10zx "
[6f4495f5]609 "%#10zx %9llu%c ", t->tid, t->name, t,
610 thread_states[t->state], t->task, t->task->context,
611 t->thread_code, t->kstack, cycles, suffix);
[cce6acf]612
[016acbe]613 if (t->cpu)
[cce6acf]614 printf("%-4zd", t->cpu->id);
[016acbe]615 else
616 printf("none");
[cce6acf]617
618 if (t->state == Sleeping)
[7b63b6b]619 printf(" %#10zx", t->sleep_queue);
[cce6acf]620
[016acbe]621 printf("\n");
622 }
[55ab0f1]623 }
624
625 spinlock_unlock(&threads_lock);
[37c57f2]626 interrupts_restore(ipl);
[55ab0f1]627}
[9f52563]628
[016acbe]629/** Check whether thread exists.
630 *
631 * Note that threads_lock must be already held and
632 * interrupts must be already disabled.
633 *
634 * @param t Pointer to thread.
635 *
636 * @return True if thread t is known to the system, false otherwise.
637 */
638bool thread_exists(thread_t *t)
639{
640 btree_node_t *leaf;
641
[6f4495f5]642 return btree_search(&threads_btree, (btree_key_t) ((uintptr_t) t),
643 &leaf) != NULL;
[016acbe]644}
645
[cce6acf]646
647/** Update accounting of current thread.
648 *
649 * Note that thread_lock on THREAD must be already held and
650 * interrupts must be already disabled.
651 *
652 */
653void thread_update_accounting(void)
654{
655 uint64_t time = get_cycle();
656 THREAD->cycles += time - THREAD->last_cycle;
657 THREAD->last_cycle = time;
658}
659
[9f52563]660/** Process syscall to create new thread.
661 *
662 */
[f6d2c81]663unative_t sys_thread_create(uspace_arg_t *uspace_uarg, char *uspace_name,
664 thread_id_t *uspace_thread_id)
[9f52563]665{
[68091bd]666 thread_t *t;
667 char namebuf[THREAD_NAME_BUFLEN];
[45fb65c]668 uspace_arg_t *kernel_uarg;
[e3c762cd]669 int rc;
[9f52563]670
[e3c762cd]671 rc = copy_from_uspace(namebuf, uspace_name, THREAD_NAME_BUFLEN);
672 if (rc != 0)
[7f1c620]673 return (unative_t) rc;
[0f250f9]674
[4680ef5]675 /*
676 * In case of failure, kernel_uarg will be deallocated in this function.
677 * In case of success, kernel_uarg will be freed in uinit().
678 */
679 kernel_uarg = (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0);
680
[e3c762cd]681 rc = copy_from_uspace(kernel_uarg, uspace_uarg, sizeof(uspace_arg_t));
682 if (rc != 0) {
683 free(kernel_uarg);
[7f1c620]684 return (unative_t) rc;
[e3c762cd]685 }
[9f52563]686
[d8431986]687 t = thread_create(uinit, kernel_uarg, TASK,
688 THREAD_FLAG_USPACE | THREAD_FLAG_NOATTACH, namebuf, false);
[6f4495f5]689 if (t) {
[d8431986]690 if (uspace_thread_id != NULL) {
691 int rc;
692
693 rc = copy_to_uspace(uspace_thread_id, &t->tid,
694 sizeof(t->tid));
695 if (rc != 0) {
696 /*
697 * We have encountered a failure, but the thread
698 * has already been created. We need to undo its
699 * creation now.
700 */
701
702 /*
[ea7890e7]703 * The new thread structure is initialized, but
704 * is still not visible to the system.
[d8431986]705 * We can safely deallocate it.
706 */
707 slab_free(thread_slab, t);
708 free(kernel_uarg);
709
710 return (unative_t) rc;
711 }
712 }
713 thread_attach(t, TASK);
[68091bd]714 thread_ready(t);
[d8431986]715
716 return 0;
[201abde]717 } else
[0f250f9]718 free(kernel_uarg);
[9f52563]719
[7f1c620]720 return (unative_t) ENOMEM;
[9f52563]721}
722
723/** Process syscall to terminate thread.
724 *
725 */
[7f1c620]726unative_t sys_thread_exit(int uspace_status)
[9f52563]727{
[68091bd]728 thread_exit();
729 /* Unreachable */
730 return 0;
[9f52563]731}
[b45c443]732
[3ce7f082]733/** Syscall for getting TID.
734 *
[201abde]735 * @param uspace_thread_id Userspace address of 8-byte buffer where to store
736 * current thread ID.
737 *
738 * @return 0 on success or an error code from @ref errno.h.
[b45c443]739 */
[201abde]740unative_t sys_thread_get_id(thread_id_t *uspace_thread_id)
[3ce7f082]741{
742 /*
743 * No need to acquire lock on THREAD because tid
744 * remains constant for the lifespan of the thread.
745 */
[201abde]746 return (unative_t) copy_to_uspace(uspace_thread_id, &THREAD->tid,
747 sizeof(THREAD->tid));
[3ce7f082]748}
[6f4495f5]749
[3ce7f082]750/** @}
751 */
Note: See TracBrowser for help on using the repository browser.