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

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since bcaca55 was ae0300b5, checked in by Martin Decky <martin@…>, 14 years ago

fix wrong formatting arguments

  • Property mode set to 100644
File size: 22.0 KB
Line 
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 */
77const char *thread_states[] = {
78 "Invalid",
79 "Running",
80 "Sleeping",
81 "Ready",
82 "Entering",
83 "Exiting",
84 "Lingering"
85};
86
87typedef 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 */
97IRQ_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 */
105avltree_t threads_tree;
106
107IRQ_SPINLOCK_STATIC_INITIALIZE(tidlock);
108static thread_id_t last_tid = 0;
109
110static slab_cache_t *thread_slab;
111
112#ifdef CONFIG_FPU
113slab_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 */
124static 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 */
160static 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 */
199static 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 */
221void 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 thread Thread to make ready.
242 *
243 */
244void 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 */
294thread_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 /* Initialize debugging stuff */
353 thread->btrace = false;
354 udebug_thread_initialize(&thread->udebug);
355#endif
356
357 /* Might depend on previous initialization */
358 thread_create_arch(thread);
359
360 if (!(flags & THREAD_FLAG_NOATTACH))
361 thread_attach(thread, task);
362
363 return thread;
364}
365
366/** Destroy thread memory structure
367 *
368 * Detach thread from all queues, cpus etc. and destroy it.
369 *
370 * @param thread Thread to be destroyed.
371 * @param irq_res Indicate whether it should unlock thread->lock
372 * in interrupts-restore mode.
373 *
374 */
375void thread_destroy(thread_t *thread, bool irq_res)
376{
377 ASSERT(irq_spinlock_locked(&thread->lock));
378 ASSERT((thread->state == Exiting) || (thread->state == Lingering));
379 ASSERT(thread->task);
380 ASSERT(thread->cpu);
381
382 irq_spinlock_lock(&thread->cpu->lock, false);
383 if (thread->cpu->fpu_owner == thread)
384 thread->cpu->fpu_owner = NULL;
385 irq_spinlock_unlock(&thread->cpu->lock, false);
386
387 irq_spinlock_pass(&thread->lock, &threads_lock);
388
389 avltree_delete(&threads_tree, &thread->threads_tree_node);
390
391 irq_spinlock_pass(&threads_lock, &thread->task->lock);
392
393 /*
394 * Detach from the containing task.
395 */
396 list_remove(&thread->th_link);
397 irq_spinlock_unlock(&thread->task->lock, irq_res);
398
399 /*
400 * Drop the reference to the containing task.
401 */
402 task_release(thread->task);
403 slab_free(thread_slab, thread);
404}
405
406/** Make the thread visible to the system.
407 *
408 * Attach the thread structure to the current task and make it visible in the
409 * threads_tree.
410 *
411 * @param t Thread to be attached to the task.
412 * @param task Task to which the thread is to be attached.
413 *
414 */
415void thread_attach(thread_t *thread, task_t *task)
416{
417 /*
418 * Attach to the specified task.
419 */
420 irq_spinlock_lock(&task->lock, true);
421
422 /* Hold a reference to the task. */
423 task_hold(task);
424
425 /* Must not count kbox thread into lifecount */
426 if (thread->flags & THREAD_FLAG_USPACE)
427 atomic_inc(&task->lifecount);
428
429 list_append(&thread->th_link, &task->th_head);
430
431 irq_spinlock_pass(&task->lock, &threads_lock);
432
433 /*
434 * Register this thread in the system-wide list.
435 */
436 avltree_insert(&threads_tree, &thread->threads_tree_node);
437 irq_spinlock_unlock(&threads_lock, true);
438}
439
440/** Terminate thread.
441 *
442 * End current thread execution and switch it to the exiting state.
443 * All pending timeouts are executed.
444 *
445 */
446void thread_exit(void)
447{
448 if (THREAD->flags & THREAD_FLAG_USPACE) {
449#ifdef CONFIG_UDEBUG
450 /* Generate udebug THREAD_E event */
451 udebug_thread_e_event();
452
453 /*
454 * This thread will not execute any code or system calls from
455 * now on.
456 */
457 udebug_stoppable_begin();
458#endif
459 if (atomic_predec(&TASK->lifecount) == 0) {
460 /*
461 * We are the last userspace thread in the task that
462 * still has not exited. With the exception of the
463 * moment the task was created, new userspace threads
464 * can only be created by threads of the same task.
465 * We are safe to perform cleanup.
466 *
467 */
468 ipc_cleanup();
469 futex_cleanup();
470 LOG("Cleanup of task %" PRIu64" completed.", TASK->taskid);
471 }
472 }
473
474restart:
475 irq_spinlock_lock(&THREAD->lock, true);
476 if (THREAD->timeout_pending) {
477 /* Busy waiting for timeouts in progress */
478 irq_spinlock_unlock(&THREAD->lock, true);
479 goto restart;
480 }
481
482 THREAD->state = Exiting;
483 irq_spinlock_unlock(&THREAD->lock, true);
484
485 scheduler();
486
487 /* Not reached */
488 while (true);
489}
490
491/** Thread sleep
492 *
493 * Suspend execution of the current thread.
494 *
495 * @param sec Number of seconds to sleep.
496 *
497 */
498void thread_sleep(uint32_t sec)
499{
500 /* Sleep in 1000 second steps to support
501 full argument range */
502 while (sec > 0) {
503 uint32_t period = (sec > 1000) ? 1000 : sec;
504
505 thread_usleep(period * 1000000);
506 sec -= period;
507 }
508}
509
510/** Wait for another thread to exit.
511 *
512 * @param thread Thread to join on exit.
513 * @param usec Timeout in microseconds.
514 * @param flags Mode of operation.
515 *
516 * @return An error code from errno.h or an error code from synch.h.
517 *
518 */
519int thread_join_timeout(thread_t *thread, uint32_t usec, unsigned int flags)
520{
521 if (thread == THREAD)
522 return EINVAL;
523
524 /*
525 * Since thread join can only be called once on an undetached thread,
526 * the thread pointer is guaranteed to be still valid.
527 */
528
529 irq_spinlock_lock(&thread->lock, true);
530 ASSERT(!thread->detached);
531 irq_spinlock_unlock(&thread->lock, true);
532
533 return waitq_sleep_timeout(&thread->join_wq, usec, flags);
534}
535
536/** Detach thread.
537 *
538 * Mark the thread as detached. If the thread is already
539 * in the Lingering state, deallocate its resources.
540 *
541 * @param thread Thread to be detached.
542 *
543 */
544void thread_detach(thread_t *thread)
545{
546 /*
547 * Since the thread is expected not to be already detached,
548 * pointer to it must be still valid.
549 */
550 irq_spinlock_lock(&thread->lock, true);
551 ASSERT(!thread->detached);
552
553 if (thread->state == Lingering) {
554 /*
555 * Unlock &thread->lock and restore
556 * interrupts in thread_destroy().
557 */
558 thread_destroy(thread, true);
559 return;
560 } else {
561 thread->detached = true;
562 }
563
564 irq_spinlock_unlock(&thread->lock, true);
565}
566
567/** Thread usleep
568 *
569 * Suspend execution of the current thread.
570 *
571 * @param usec Number of microseconds to sleep.
572 *
573 */
574void thread_usleep(uint32_t usec)
575{
576 waitq_t wq;
577
578 waitq_initialize(&wq);
579
580 (void) waitq_sleep_timeout(&wq, usec, SYNCH_FLAGS_NON_BLOCKING);
581}
582
583static bool thread_walker(avltree_node_t *node, void *arg)
584{
585 bool *additional = (bool *) arg;
586 thread_t *thread = avltree_get_instance(node, thread_t, threads_tree_node);
587
588 uint64_t ucycles, kcycles;
589 char usuffix, ksuffix;
590 order_suffix(thread->ucycles, &ucycles, &usuffix);
591 order_suffix(thread->kcycles, &kcycles, &ksuffix);
592
593 char *name;
594 if (str_cmp(thread->name, "uinit") == 0)
595 name = thread->task->name;
596 else
597 name = thread->name;
598
599#ifdef __32_BITS__
600 if (*additional)
601 printf("%-8" PRIu64 " %10p %10p %9" PRIu64 "%c %9" PRIu64 "%c ",
602 thread->tid, thread->thread_code, thread->kstack,
603 ucycles, usuffix, kcycles, ksuffix);
604 else
605 printf("%-8" PRIu64 " %-14s %10p %-8s %10p %-5" PRIu32 "\n",
606 thread->tid, name, thread, thread_states[thread->state],
607 thread->task, thread->task->context);
608#endif
609
610#ifdef __64_BITS__
611 if (*additional)
612 printf("%-8" PRIu64 " %18p %18p\n"
613 " %9" PRIu64 "%c %9" PRIu64 "%c ",
614 thread->tid, thread->thread_code, thread->kstack,
615 ucycles, usuffix, kcycles, ksuffix);
616 else
617 printf("%-8" PRIu64 " %-14s %18p %-8s %18p %-5" PRIu32 "\n",
618 thread->tid, name, thread, thread_states[thread->state],
619 thread->task, thread->task->context);
620#endif
621
622 if (*additional) {
623 if (thread->cpu)
624 printf("%-5u", thread->cpu->id);
625 else
626 printf("none ");
627
628 if (thread->state == Sleeping) {
629#ifdef __32_BITS__
630 printf(" %10p", thread->sleep_queue);
631#endif
632
633#ifdef __64_BITS__
634 printf(" %18p", thread->sleep_queue);
635#endif
636 }
637
638 printf("\n");
639 }
640
641 return true;
642}
643
644/** Print list of threads debug info
645 *
646 * @param additional Print additional information.
647 *
648 */
649void thread_print_list(bool additional)
650{
651 /* Messing with thread structures, avoid deadlock */
652 irq_spinlock_lock(&threads_lock, true);
653
654#ifdef __32_BITS__
655 if (additional)
656 printf("[id ] [code ] [stack ] [ucycles ] [kcycles ]"
657 " [cpu] [waitqueue]\n");
658 else
659 printf("[id ] [name ] [address ] [state ] [task ]"
660 " [ctx]\n");
661#endif
662
663#ifdef __64_BITS__
664 if (additional) {
665 printf("[id ] [code ] [stack ]\n"
666 " [ucycles ] [kcycles ] [cpu] [waitqueue ]\n");
667 } else
668 printf("[id ] [name ] [address ] [state ]"
669 " [task ] [ctx]\n");
670#endif
671
672 avltree_walk(&threads_tree, thread_walker, &additional);
673
674 irq_spinlock_unlock(&threads_lock, true);
675}
676
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 thread Pointer to thread.
683 *
684 * @return True if thread t is known to the system, false otherwise.
685 *
686 */
687bool thread_exists(thread_t *thread)
688{
689 ASSERT(interrupts_disabled());
690 ASSERT(irq_spinlock_locked(&threads_lock));
691
692 avltree_node_t *node =
693 avltree_search(&threads_tree, (avltree_key_t) ((uintptr_t) thread));
694
695 return node != NULL;
696}
697
698/** Update accounting of current thread.
699 *
700 * Note that thread_lock on THREAD must be already held and
701 * interrupts must be already disabled.
702 *
703 * @param user True to update user accounting, false for kernel.
704 *
705 */
706void thread_update_accounting(bool user)
707{
708 uint64_t time = get_cycle();
709
710 ASSERT(interrupts_disabled());
711 ASSERT(irq_spinlock_locked(&THREAD->lock));
712
713 if (user)
714 THREAD->ucycles += time - THREAD->last_cycle;
715 else
716 THREAD->kcycles += time - THREAD->last_cycle;
717
718 THREAD->last_cycle = time;
719}
720
721static bool thread_search_walker(avltree_node_t *node, void *arg)
722{
723 thread_t *thread =
724 (thread_t *) avltree_get_instance(node, thread_t, threads_tree_node);
725 thread_iterator_t *iterator = (thread_iterator_t *) arg;
726
727 if (thread->tid == iterator->thread_id) {
728 iterator->thread = thread;
729 return false;
730 }
731
732 return true;
733}
734
735/** Find thread structure corresponding to thread ID.
736 *
737 * The threads_lock must be already held by the caller of this function and
738 * interrupts must be disabled.
739 *
740 * @param id Thread ID.
741 *
742 * @return Thread structure address or NULL if there is no such thread ID.
743 *
744 */
745thread_t *thread_find_by_id(thread_id_t thread_id)
746{
747 ASSERT(interrupts_disabled());
748 ASSERT(irq_spinlock_locked(&threads_lock));
749
750 thread_iterator_t iterator;
751
752 iterator.thread_id = thread_id;
753 iterator.thread = NULL;
754
755 avltree_walk(&threads_tree, thread_search_walker, (void *) &iterator);
756
757 return iterator.thread;
758}
759
760#ifdef CONFIG_UDEBUG
761
762void thread_stack_trace(thread_id_t thread_id)
763{
764 irq_spinlock_lock(&threads_lock, true);
765
766 thread_t *thread = thread_find_by_id(thread_id);
767 if (thread == NULL) {
768 printf("No such thread.\n");
769 irq_spinlock_unlock(&threads_lock, true);
770 return;
771 }
772
773 irq_spinlock_lock(&thread->lock, false);
774
775 /*
776 * Schedule a stack trace to be printed
777 * just before the thread is scheduled next.
778 *
779 * If the thread is sleeping then try to interrupt
780 * the sleep. Any request for printing an uspace stack
781 * trace from within the kernel should be always
782 * considered a last resort debugging means, therefore
783 * forcing the thread's sleep to be interrupted
784 * is probably justifiable.
785 */
786
787 bool sleeping = false;
788 istate_t *istate = thread->udebug.uspace_state;
789 if (istate != NULL) {
790 printf("Scheduling thread stack trace.\n");
791 thread->btrace = true;
792 if (thread->state == Sleeping)
793 sleeping = true;
794 } else
795 printf("Thread interrupt state not available.\n");
796
797 irq_spinlock_unlock(&thread->lock, false);
798
799 if (sleeping)
800 waitq_interrupt_sleep(thread);
801
802 irq_spinlock_unlock(&threads_lock, true);
803}
804
805#endif /* CONFIG_UDEBUG */
806
807/** Process syscall to create new thread.
808 *
809 */
810sysarg_t sys_thread_create(uspace_arg_t *uspace_uarg, char *uspace_name,
811 size_t name_len, thread_id_t *uspace_thread_id)
812{
813 if (name_len > THREAD_NAME_BUFLEN - 1)
814 name_len = THREAD_NAME_BUFLEN - 1;
815
816 char namebuf[THREAD_NAME_BUFLEN];
817 int rc = copy_from_uspace(namebuf, uspace_name, name_len);
818 if (rc != 0)
819 return (sysarg_t) rc;
820
821 namebuf[name_len] = 0;
822
823 /*
824 * In case of failure, kernel_uarg will be deallocated in this function.
825 * In case of success, kernel_uarg will be freed in uinit().
826 *
827 */
828 uspace_arg_t *kernel_uarg =
829 (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0);
830
831 rc = copy_from_uspace(kernel_uarg, uspace_uarg, sizeof(uspace_arg_t));
832 if (rc != 0) {
833 free(kernel_uarg);
834 return (sysarg_t) rc;
835 }
836
837 thread_t *thread = thread_create(uinit, kernel_uarg, TASK,
838 THREAD_FLAG_USPACE | THREAD_FLAG_NOATTACH, namebuf, false);
839 if (thread) {
840 if (uspace_thread_id != NULL) {
841 rc = copy_to_uspace(uspace_thread_id, &thread->tid,
842 sizeof(thread->tid));
843 if (rc != 0) {
844 /*
845 * We have encountered a failure, but the thread
846 * has already been created. We need to undo its
847 * creation now.
848 */
849
850 /*
851 * The new thread structure is initialized, but
852 * is still not visible to the system.
853 * We can safely deallocate it.
854 */
855 slab_free(thread_slab, thread);
856 free(kernel_uarg);
857
858 return (sysarg_t) rc;
859 }
860 }
861
862#ifdef CONFIG_UDEBUG
863 /*
864 * Generate udebug THREAD_B event and attach the thread.
865 * This must be done atomically (with the debug locks held),
866 * otherwise we would either miss some thread or receive
867 * THREAD_B events for threads that already existed
868 * and could be detected with THREAD_READ before.
869 */
870 udebug_thread_b_event_attach(thread, TASK);
871#else
872 thread_attach(thread, TASK);
873#endif
874 thread_ready(thread);
875
876 return 0;
877 } else
878 free(kernel_uarg);
879
880 return (sysarg_t) ENOMEM;
881}
882
883/** Process syscall to terminate thread.
884 *
885 */
886sysarg_t sys_thread_exit(int uspace_status)
887{
888 thread_exit();
889
890 /* Unreachable */
891 return 0;
892}
893
894/** Syscall for getting TID.
895 *
896 * @param uspace_thread_id Userspace address of 8-byte buffer where to store
897 * current thread ID.
898 *
899 * @return 0 on success or an error code from @ref errno.h.
900 *
901 */
902sysarg_t sys_thread_get_id(thread_id_t *uspace_thread_id)
903{
904 /*
905 * No need to acquire lock on THREAD because tid
906 * remains constant for the lifespan of the thread.
907 *
908 */
909 return (sysarg_t) copy_to_uspace(uspace_thread_id, &THREAD->tid,
910 sizeof(THREAD->tid));
911}
912
913/** Syscall wrapper for sleeping. */
914sysarg_t sys_thread_usleep(uint32_t usec)
915{
916 thread_usleep(usec);
917 return 0;
918}
919
920/** @}
921 */
Note: See TracBrowser for help on using the repository browser.