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

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since 2e4343b was 2e4343b, checked in by Jiří Zárevúcky <zarevucky.jiri@…>, 7 years ago

Fix comments

get_current() refers to out of order local changes.

  • Property mode set to 100644
File size: 25.5 KB
RevLine 
[f761f1eb]1/*
[7ed8530]2 * Copyright (c) 2010 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
[174156fd]29/** @addtogroup kernel_generic_proc
[b45c443]30 * @{
31 */
32
[9179d0a]33/**
[b45c443]34 * @file
[da1bafb]35 * @brief Thread management functions.
[9179d0a]36 */
37
[63e27ef]38#include <assert.h>
[f761f1eb]39#include <proc/scheduler.h>
40#include <proc/thread.h>
41#include <proc/task.h>
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/spinlock.h>
48#include <synch/waitq.h>
[8a64e81e]49#include <synch/workqueue.h>
[181a746]50#include <synch/rcu.h>
[f761f1eb]51#include <cpu.h>
[e535eeb]52#include <str.h>
[f761f1eb]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>
[8d6c1f1]58#include <time/delay.h>
[4ffa9e0]59#include <config.h>
60#include <arch/interrupt.h>
[26a8604f]61#include <smp/ipi.h>
[f2ffad4]62#include <arch/faddr.h>
[23684b7]63#include <atomic.h>
[44a7ee5]64#include <mem.h>
[bab75df6]65#include <stdio.h>
[266294a9]66#include <mm/slab.h>
[9f52563]67#include <main/uinit.h>
[e3c762cd]68#include <syscall/copy.h>
69#include <errno.h>
[52755f1]70
[fe19611]71/** Thread states */
[a000878c]72const char *thread_states[] = {
[fe19611]73 "Invalid",
74 "Running",
75 "Sleeping",
76 "Ready",
77 "Entering",
78 "Exiting",
[48d14222]79 "Lingering"
[e1b6742]80};
81
82typedef struct {
83 thread_id_t thread_id;
84 thread_t *thread;
85} thread_iterator_t;
[f761f1eb]86
[5dcee525]87/** Lock protecting the threads_tree AVL tree.
[4e33b6b]88 *
89 * For locking rules, see declaration thereof.
[da1bafb]90 *
[4e33b6b]91 */
[da1bafb]92IRQ_SPINLOCK_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.
[da1bafb]98 *
[88169d9]99 */
[da1bafb]100avltree_t threads_tree;
[f761f1eb]101
[da1bafb]102IRQ_SPINLOCK_STATIC_INITIALIZE(tidlock);
103static thread_id_t last_tid = 0;
[f761f1eb]104
[82d515e9]105static slab_cache_t *thread_cache;
[da1bafb]106
[0f81ceb7]107#ifdef CONFIG_FPU
[82d515e9]108slab_cache_t *fpu_context_cache;
[f76fed4]109#endif
[266294a9]110
[4e33b6b]111/** Thread wrapper.
[70527f1]112 *
[4e33b6b]113 * This wrapper is provided to ensure that every thread makes a call to
114 * thread_exit() when its implementing function returns.
[f761f1eb]115 *
[22f7769]116 * interrupts_disable() is assumed.
[70527f1]117 *
[f761f1eb]118 */
[e16e036a]119static void cushion(void)
[f761f1eb]120{
[43114c5]121 void (*f)(void *) = THREAD->thread_code;
122 void *arg = THREAD->thread_arg;
[449dc1ed]123 THREAD->last_cycle = get_cycle();
[a35b458]124
[0313ff0]125 /* This is where each thread wakes up after its creation */
[da1bafb]126 irq_spinlock_unlock(&THREAD->lock, false);
[22f7769]127 interrupts_enable();
[a35b458]128
[f761f1eb]129 f(arg);
[a35b458]130
[0313ff0]131 /* Accumulate accounting to the task */
[da1bafb]132 irq_spinlock_lock(&THREAD->lock, true);
[62b6d17]133 if (!THREAD->uncounted) {
[a2a00e8]134 thread_update_accounting(true);
135 uint64_t ucycles = THREAD->ucycles;
136 THREAD->ucycles = 0;
137 uint64_t kcycles = THREAD->kcycles;
138 THREAD->kcycles = 0;
[a35b458]139
[da1bafb]140 irq_spinlock_pass(&THREAD->lock, &TASK->lock);
[a2a00e8]141 TASK->ucycles += ucycles;
142 TASK->kcycles += kcycles;
[da1bafb]143 irq_spinlock_unlock(&TASK->lock, true);
[62b6d17]144 } else
[da1bafb]145 irq_spinlock_unlock(&THREAD->lock, true);
[a35b458]146
[f761f1eb]147 thread_exit();
[a35b458]148
[da1bafb]149 /* Not reached */
[f761f1eb]150}
151
[da1bafb]152/** Initialization and allocation for thread_t structure
153 *
154 */
[b7fd2a0]155static errno_t thr_constructor(void *obj, unsigned int kmflags)
[266294a9]156{
[da1bafb]157 thread_t *thread = (thread_t *) obj;
[a35b458]158
[da1bafb]159 irq_spinlock_initialize(&thread->lock, "thread_t_lock");
160 link_initialize(&thread->rq_link);
161 link_initialize(&thread->wq_link);
162 link_initialize(&thread->th_link);
[a35b458]163
[32fffef0]164 /* call the architecture-specific part of the constructor */
[da1bafb]165 thr_constructor_arch(thread);
[a35b458]166
[0f81ceb7]167#ifdef CONFIG_FPU
[d8431986]168#ifdef CONFIG_FPU_LAZY
[da1bafb]169 thread->saved_fpu_context = NULL;
170#else /* CONFIG_FPU_LAZY */
[82d515e9]171 thread->saved_fpu_context = slab_alloc(fpu_context_cache, kmflags);
[da1bafb]172 if (!thread->saved_fpu_context)
[7f11dc6]173 return ENOMEM;
[da1bafb]174#endif /* CONFIG_FPU_LAZY */
175#endif /* CONFIG_FPU */
[a35b458]176
[38ff925]177 /*
178 * Allocate the kernel stack from the low-memory to prevent an infinite
179 * nesting of TLB-misses when accessing the stack from the part of the
180 * TLB-miss handler written in C.
181 *
182 * Note that low-memory is safe to be used for the stack as it will be
183 * covered by the kernel identity mapping, which guarantees not to
184 * nest TLB-misses infinitely (either via some hardware mechanism or
185 * by the construciton of the assembly-language part of the TLB-miss
186 * handler).
187 *
188 * This restriction can be lifted once each architecture provides
189 * a similar guarantee, for example by locking the kernel stack
190 * in the TLB whenever it is allocated from the high-memory and the
191 * thread is being scheduled to run.
192 */
193 kmflags |= FRAME_LOWMEM;
194 kmflags &= ~FRAME_HIGHMEM;
[a35b458]195
[d1da1ff2]196 // XXX: All kernel stacks must be aligned to STACK_SIZE,
[2e4343b]197 // see get_stack_base().
[d1da1ff2]198
[cd3b380]199 uintptr_t stack_phys =
200 frame_alloc(STACK_FRAMES, kmflags, STACK_SIZE - 1);
201 if (!stack_phys) {
[0f81ceb7]202#ifdef CONFIG_FPU
[da1bafb]203 if (thread->saved_fpu_context)
[82d515e9]204 slab_free(fpu_context_cache, thread->saved_fpu_context);
[f76fed4]205#endif
[7f11dc6]206 return ENOMEM;
[f76fed4]207 }
[a35b458]208
[cd3b380]209 thread->kstack = (uint8_t *) PA2KA(stack_phys);
[a35b458]210
[9a1b20c]211#ifdef CONFIG_UDEBUG
[da1bafb]212 mutex_initialize(&thread->udebug.lock, MUTEX_PASSIVE);
[9a1b20c]213#endif
[a35b458]214
[7f11dc6]215 return EOK;
[266294a9]216}
217
218/** Destruction of thread_t object */
[da1bafb]219static size_t thr_destructor(void *obj)
[266294a9]220{
[da1bafb]221 thread_t *thread = (thread_t *) obj;
[a35b458]222
[32fffef0]223 /* call the architecture-specific part of the destructor */
[da1bafb]224 thr_destructor_arch(thread);
[a35b458]225
[5df1963]226 frame_free(KA2PA(thread->kstack), STACK_FRAMES);
[a35b458]227
[0f81ceb7]228#ifdef CONFIG_FPU
[da1bafb]229 if (thread->saved_fpu_context)
[82d515e9]230 slab_free(fpu_context_cache, thread->saved_fpu_context);
[f76fed4]231#endif
[a35b458]232
[e7c4115d]233 return STACK_FRAMES; /* number of frames freed */
[266294a9]234}
[70527f1]235
236/** Initialize threads
237 *
238 * Initialize kernel threads support.
239 *
240 */
[f761f1eb]241void thread_init(void)
242{
[43114c5]243 THREAD = NULL;
[a35b458]244
[e3306d04]245 atomic_store(&nrdy, 0);
[82d515e9]246 thread_cache = slab_cache_create("thread_t", sizeof(thread_t), 0,
[6f4495f5]247 thr_constructor, thr_destructor, 0);
[a35b458]248
[0f81ceb7]249#ifdef CONFIG_FPU
[82d515e9]250 fpu_context_cache = slab_cache_create("fpu_context_t",
[f97f1e51]251 sizeof(fpu_context_t), FPU_CONTEXT_ALIGN, NULL, NULL, 0);
[f76fed4]252#endif
[a35b458]253
[5dcee525]254 avltree_create(&threads_tree);
[016acbe]255}
[70527f1]256
[6eef3c4]257/** Wire thread to the given CPU
258 *
259 * @param cpu CPU to wire the thread to.
260 *
261 */
262void thread_wire(thread_t *thread, cpu_t *cpu)
263{
264 irq_spinlock_lock(&thread->lock, true);
265 thread->cpu = cpu;
266 thread->wired = true;
267 irq_spinlock_unlock(&thread->lock, true);
268}
269
[8a64e81e]270/** Invoked right before thread_ready() readies the thread. thread is locked. */
271static void before_thread_is_ready(thread_t *thread)
272{
[63e27ef]273 assert(irq_spinlock_locked(&thread->lock));
[8a64e81e]274 workq_before_thread_is_ready(thread);
275}
276
[70527f1]277/** Make thread ready
278 *
[da1bafb]279 * Switch thread to the ready state.
[70527f1]280 *
[df58e44]281 * @param thread Thread to make ready.
[70527f1]282 *
283 */
[da1bafb]284void thread_ready(thread_t *thread)
[f761f1eb]285{
[da1bafb]286 irq_spinlock_lock(&thread->lock, true);
[a35b458]287
[63e27ef]288 assert(thread->state != Ready);
[518dd43]289
[8a64e81e]290 before_thread_is_ready(thread);
[a35b458]291
[6eef3c4]292 int i = (thread->priority < RQ_COUNT - 1) ?
293 ++thread->priority : thread->priority;
[518dd43]294
[8ad7dd1]295 cpu_t *cpu;
296 if (thread->wired || thread->nomigrate || thread->fpu_context_engaged) {
297 /* Cannot ready to another CPU */
[63e27ef]298 assert(thread->cpu != NULL);
[8ad7dd1]299 cpu = thread->cpu;
300 } else if (thread->stolen) {
301 /* Ready to the stealing CPU */
[6eef3c4]302 cpu = CPU;
[8ad7dd1]303 } else if (thread->cpu) {
304 /* Prefer the CPU on which the thread ran last */
[63e27ef]305 assert(thread->cpu != NULL);
[8ad7dd1]306 cpu = thread->cpu;
307 } else {
308 cpu = CPU;
309 }
[a35b458]310
[da1bafb]311 thread->state = Ready;
[a35b458]312
[da1bafb]313 irq_spinlock_pass(&thread->lock, &(cpu->rq[i].lock));
[a35b458]314
[70527f1]315 /*
[da1bafb]316 * Append thread to respective ready queue
317 * on respective processor.
[f761f1eb]318 */
[a35b458]319
[55b77d9]320 list_append(&thread->rq_link, &cpu->rq[i].rq);
[da1bafb]321 cpu->rq[i].n++;
322 irq_spinlock_unlock(&(cpu->rq[i].lock), true);
[a35b458]323
[59e07c91]324 atomic_inc(&nrdy);
[248fc1a]325 atomic_inc(&cpu->nrdy);
[f761f1eb]326}
327
[70527f1]328/** Create new thread
329 *
330 * Create a new thread.
331 *
[da1bafb]332 * @param func Thread's implementing function.
333 * @param arg Thread's implementing function argument.
334 * @param task Task to which the thread belongs. The caller must
335 * guarantee that the task won't cease to exist during the
336 * call. The task's lock may not be held.
337 * @param flags Thread flags.
338 * @param name Symbolic name (a copy is made).
[70527f1]339 *
[da1bafb]340 * @return New thread's structure on success, NULL on failure.
[70527f1]341 *
342 */
[3bacee1]343thread_t *thread_create(void (*func)(void *), void *arg, task_t *task,
[6eef3c4]344 thread_flags_t flags, const char *name)
[f761f1eb]345{
[82d515e9]346 thread_t *thread = (thread_t *) slab_alloc(thread_cache, 0);
[da1bafb]347 if (!thread)
[2a46e10]348 return NULL;
[a35b458]349
[bb68433]350 /* Not needed, but good for debugging */
[26aafe8]351 memsetb(thread->kstack, STACK_SIZE, 0);
[a35b458]352
[da1bafb]353 irq_spinlock_lock(&tidlock, true);
354 thread->tid = ++last_tid;
355 irq_spinlock_unlock(&tidlock, true);
[a35b458]356
[edc64c0]357 memset(&thread->saved_context, 0, sizeof(thread->saved_context));
[da1bafb]358 context_set(&thread->saved_context, FADDR(cushion),
[26aafe8]359 (uintptr_t) thread->kstack, STACK_SIZE);
[a35b458]360
[a6e55886]361 current_initialize((current_t *) thread->kstack);
[a35b458]362
[da1bafb]363 ipl_t ipl = interrupts_disable();
364 thread->saved_context.ipl = interrupts_read();
[bb68433]365 interrupts_restore(ipl);
[a35b458]366
[da1bafb]367 str_cpy(thread->name, THREAD_NAME_BUFLEN, name);
[a35b458]368
[da1bafb]369 thread->thread_code = func;
370 thread->thread_arg = arg;
371 thread->ticks = -1;
372 thread->ucycles = 0;
373 thread->kcycles = 0;
[6eef3c4]374 thread->uncounted =
375 ((flags & THREAD_FLAG_UNCOUNTED) == THREAD_FLAG_UNCOUNTED);
[da1bafb]376 thread->priority = -1; /* Start in rq[0] */
377 thread->cpu = NULL;
[6eef3c4]378 thread->wired = false;
379 thread->stolen = false;
380 thread->uspace =
381 ((flags & THREAD_FLAG_USPACE) == THREAD_FLAG_USPACE);
[a35b458]382
[43ac0cc]383 thread->nomigrate = 0;
[da1bafb]384 thread->state = Entering;
[a35b458]385
[da1bafb]386 timeout_initialize(&thread->sleep_timeout);
387 thread->sleep_interruptible = false;
[b59318e]388 thread->sleep_composable = false;
[da1bafb]389 thread->sleep_queue = NULL;
390 thread->timeout_pending = false;
[a35b458]391
[da1bafb]392 thread->in_copy_from_uspace = false;
393 thread->in_copy_to_uspace = false;
[a35b458]394
[da1bafb]395 thread->interrupted = false;
396 thread->detached = false;
397 waitq_initialize(&thread->join_wq);
[a35b458]398
[da1bafb]399 thread->task = task;
[a35b458]400
[8a64e81e]401 thread->workq = NULL;
[a35b458]402
[6eef3c4]403 thread->fpu_context_exists = false;
404 thread->fpu_context_engaged = false;
[a35b458]405
[da1bafb]406 avltree_node_initialize(&thread->threads_tree_node);
407 thread->threads_tree_node.key = (uintptr_t) thread;
[a35b458]408
[9a1b20c]409#ifdef CONFIG_UDEBUG
[5b7a107]410 /* Initialize debugging stuff */
411 thread->btrace = false;
[da1bafb]412 udebug_thread_initialize(&thread->udebug);
[9a1b20c]413#endif
[a35b458]414
[da1bafb]415 /* Might depend on previous initialization */
416 thread_create_arch(thread);
[a35b458]417
[181a746]418 rcu_thread_init(thread);
[a35b458]419
[6eef3c4]420 if ((flags & THREAD_FLAG_NOATTACH) != THREAD_FLAG_NOATTACH)
[da1bafb]421 thread_attach(thread, task);
[a35b458]422
[da1bafb]423 return thread;
[d8431986]424}
425
426/** Destroy thread memory structure
427 *
428 * Detach thread from all queues, cpus etc. and destroy it.
[da1bafb]429 *
430 * @param thread Thread to be destroyed.
431 * @param irq_res Indicate whether it should unlock thread->lock
432 * in interrupts-restore mode.
[d8431986]433 *
434 */
[da1bafb]435void thread_destroy(thread_t *thread, bool irq_res)
[d8431986]436{
[63e27ef]437 assert(irq_spinlock_locked(&thread->lock));
438 assert((thread->state == Exiting) || (thread->state == Lingering));
439 assert(thread->task);
440 assert(thread->cpu);
[a35b458]441
[da1bafb]442 irq_spinlock_lock(&thread->cpu->lock, false);
443 if (thread->cpu->fpu_owner == thread)
444 thread->cpu->fpu_owner = NULL;
445 irq_spinlock_unlock(&thread->cpu->lock, false);
[a35b458]446
[da1bafb]447 irq_spinlock_pass(&thread->lock, &threads_lock);
[a35b458]448
[da1bafb]449 avltree_delete(&threads_tree, &thread->threads_tree_node);
[a35b458]450
[da1bafb]451 irq_spinlock_pass(&threads_lock, &thread->task->lock);
[a35b458]452
[d8431986]453 /*
454 * Detach from the containing task.
455 */
[da1bafb]456 list_remove(&thread->th_link);
457 irq_spinlock_unlock(&thread->task->lock, irq_res);
[a35b458]458
[ea7890e7]459 /*
[7ed8530]460 * Drop the reference to the containing task.
[ea7890e7]461 */
[da1bafb]462 task_release(thread->task);
[82d515e9]463 slab_free(thread_cache, thread);
[d8431986]464}
465
466/** Make the thread visible to the system.
467 *
468 * Attach the thread structure to the current task and make it visible in the
[5dcee525]469 * threads_tree.
[d8431986]470 *
[da1bafb]471 * @param t Thread to be attached to the task.
472 * @param task Task to which the thread is to be attached.
473 *
[d8431986]474 */
[da1bafb]475void thread_attach(thread_t *thread, task_t *task)
[d8431986]476{
477 /*
[9a1b20c]478 * Attach to the specified task.
[d8431986]479 */
[da1bafb]480 irq_spinlock_lock(&task->lock, true);
[a35b458]481
[7ed8530]482 /* Hold a reference to the task. */
483 task_hold(task);
[a35b458]484
[9a1b20c]485 /* Must not count kbox thread into lifecount */
[6eef3c4]486 if (thread->uspace)
[9a1b20c]487 atomic_inc(&task->lifecount);
[a35b458]488
[55b77d9]489 list_append(&thread->th_link, &task->threads);
[a35b458]490
[da1bafb]491 irq_spinlock_pass(&task->lock, &threads_lock);
[a35b458]492
[bb68433]493 /*
494 * Register this thread in the system-wide list.
495 */
[da1bafb]496 avltree_insert(&threads_tree, &thread->threads_tree_node);
497 irq_spinlock_unlock(&threads_lock, true);
[f761f1eb]498}
499
[0182a665]500/** Terminate thread.
[70527f1]501 *
[da1bafb]502 * End current thread execution and switch it to the exiting state.
503 * All pending timeouts are executed.
504 *
[70527f1]505 */
[f761f1eb]506void thread_exit(void)
507{
[6eef3c4]508 if (THREAD->uspace) {
[9a1b20c]509#ifdef CONFIG_UDEBUG
510 /* Generate udebug THREAD_E event */
511 udebug_thread_e_event();
[a35b458]512
[0ac99db]513 /*
514 * This thread will not execute any code or system calls from
515 * now on.
516 */
517 udebug_stoppable_begin();
[9a1b20c]518#endif
519 if (atomic_predec(&TASK->lifecount) == 0) {
520 /*
521 * We are the last userspace thread in the task that
522 * still has not exited. With the exception of the
523 * moment the task was created, new userspace threads
524 * can only be created by threads of the same task.
525 * We are safe to perform cleanup.
[da1bafb]526 *
[9a1b20c]527 */
[ea7890e7]528 ipc_cleanup();
[669f3d32]529 futex_task_cleanup();
[3bacee1]530 LOG("Cleanup of task %" PRIu64 " completed.", TASK->taskid);
[ea7890e7]531 }
532 }
[a35b458]533
[f761f1eb]534restart:
[da1bafb]535 irq_spinlock_lock(&THREAD->lock, true);
536 if (THREAD->timeout_pending) {
537 /* Busy waiting for timeouts in progress */
538 irq_spinlock_unlock(&THREAD->lock, true);
[f761f1eb]539 goto restart;
540 }
[a35b458]541
[43114c5]542 THREAD->state = Exiting;
[da1bafb]543 irq_spinlock_unlock(&THREAD->lock, true);
[a35b458]544
[f761f1eb]545 scheduler();
[a35b458]546
[874621f]547 /* Not reached */
[3bacee1]548 while (true)
549 ;
[f761f1eb]550}
551
[518dd43]552/** Interrupts an existing thread so that it may exit as soon as possible.
[1b20da0]553 *
554 * Threads that are blocked waiting for a synchronization primitive
[897fd8f1]555 * are woken up with a return code of EINTR if the
[518dd43]556 * blocking call was interruptable. See waitq_sleep_timeout().
[1b20da0]557 *
[518dd43]558 * The caller must guarantee the thread object is valid during the entire
559 * function, eg by holding the threads_lock lock.
[1b20da0]560 *
[518dd43]561 * Interrupted threads automatically exit when returning back to user space.
[1b20da0]562 *
[518dd43]563 * @param thread A valid thread object. The caller must guarantee it
564 * will remain valid until thread_interrupt() exits.
565 */
566void thread_interrupt(thread_t *thread)
567{
[63e27ef]568 assert(thread != NULL);
[a35b458]569
[518dd43]570 irq_spinlock_lock(&thread->lock, true);
[a35b458]571
[518dd43]572 thread->interrupted = true;
573 bool sleeping = (thread->state == Sleeping);
[a35b458]574
[518dd43]575 irq_spinlock_unlock(&thread->lock, true);
[a35b458]576
[518dd43]577 if (sleeping)
578 waitq_interrupt_sleep(thread);
579}
580
581/** Returns true if the thread was interrupted.
[1b20da0]582 *
[518dd43]583 * @param thread A valid thread object. User must guarantee it will
584 * be alive during the entire call.
585 * @return true if the thread was already interrupted via thread_interrupt().
586 */
587bool thread_interrupted(thread_t *thread)
588{
[63e27ef]589 assert(thread != NULL);
[a35b458]590
[518dd43]591 bool interrupted;
[a35b458]592
[518dd43]593 irq_spinlock_lock(&thread->lock, true);
594 interrupted = thread->interrupted;
595 irq_spinlock_unlock(&thread->lock, true);
[a35b458]596
[518dd43]597 return interrupted;
598}
599
[43ac0cc]600/** Prevent the current thread from being migrated to another processor. */
601void thread_migration_disable(void)
602{
[63e27ef]603 assert(THREAD);
[a35b458]604
[43ac0cc]605 THREAD->nomigrate++;
606}
607
608/** Allow the current thread to be migrated to another processor. */
609void thread_migration_enable(void)
610{
[63e27ef]611 assert(THREAD);
612 assert(THREAD->nomigrate > 0);
[a35b458]613
[6eef3c4]614 if (THREAD->nomigrate > 0)
615 THREAD->nomigrate--;
[43ac0cc]616}
617
[70527f1]618/** Thread sleep
619 *
620 * Suspend execution of the current thread.
621 *
622 * @param sec Number of seconds to sleep.
623 *
624 */
[7f1c620]625void thread_sleep(uint32_t sec)
[f761f1eb]626{
[7c3fb9b]627 /*
628 * Sleep in 1000 second steps to support
629 * full argument range
630 */
[22e6802]631 while (sec > 0) {
632 uint32_t period = (sec > 1000) ? 1000 : sec;
[a35b458]633
[22e6802]634 thread_usleep(period * 1000000);
635 sec -= period;
636 }
[f761f1eb]637}
[70527f1]638
[fe19611]639/** Wait for another thread to exit.
640 *
[da1bafb]641 * @param thread Thread to join on exit.
642 * @param usec Timeout in microseconds.
643 * @param flags Mode of operation.
[fe19611]644 *
645 * @return An error code from errno.h or an error code from synch.h.
[da1bafb]646 *
[fe19611]647 */
[b7fd2a0]648errno_t thread_join_timeout(thread_t *thread, uint32_t usec, unsigned int flags)
[fe19611]649{
[da1bafb]650 if (thread == THREAD)
[fe19611]651 return EINVAL;
[a35b458]652
[fe19611]653 /*
654 * Since thread join can only be called once on an undetached thread,
655 * the thread pointer is guaranteed to be still valid.
656 */
[a35b458]657
[da1bafb]658 irq_spinlock_lock(&thread->lock, true);
[63e27ef]659 assert(!thread->detached);
[da1bafb]660 irq_spinlock_unlock(&thread->lock, true);
[a35b458]661
[897fd8f1]662 return waitq_sleep_timeout(&thread->join_wq, usec, flags, NULL);
[fe19611]663}
664
665/** Detach thread.
666 *
[df58e44]667 * Mark the thread as detached. If the thread is already
668 * in the Lingering state, deallocate its resources.
[fe19611]669 *
[da1bafb]670 * @param thread Thread to be detached.
671 *
[fe19611]672 */
[da1bafb]673void thread_detach(thread_t *thread)
[fe19611]674{
675 /*
[31d8e10]676 * Since the thread is expected not to be already detached,
[fe19611]677 * pointer to it must be still valid.
678 */
[da1bafb]679 irq_spinlock_lock(&thread->lock, true);
[63e27ef]680 assert(!thread->detached);
[a35b458]681
[da1bafb]682 if (thread->state == Lingering) {
683 /*
684 * Unlock &thread->lock and restore
685 * interrupts in thread_destroy().
686 */
687 thread_destroy(thread, true);
[fe19611]688 return;
689 } else {
[da1bafb]690 thread->detached = true;
[fe19611]691 }
[a35b458]692
[da1bafb]693 irq_spinlock_unlock(&thread->lock, true);
[fe19611]694}
695
[70527f1]696/** Thread usleep
697 *
698 * Suspend execution of the current thread.
699 *
700 * @param usec Number of microseconds to sleep.
701 *
[1b20da0]702 */
[7f1c620]703void thread_usleep(uint32_t usec)
[f761f1eb]704{
705 waitq_t wq;
[a35b458]706
[f761f1eb]707 waitq_initialize(&wq);
[a35b458]708
[897fd8f1]709 (void) waitq_sleep_timeout(&wq, usec, SYNCH_FLAGS_NON_BLOCKING, NULL);
[f761f1eb]710}
711
[b76a2217]712static bool thread_walker(avltree_node_t *node, void *arg)
[5dcee525]713{
[48dcc69]714 bool *additional = (bool *) arg;
[da1bafb]715 thread_t *thread = avltree_get_instance(node, thread_t, threads_tree_node);
[a35b458]716
[1ba37fa]717 uint64_t ucycles, kcycles;
718 char usuffix, ksuffix;
[da1bafb]719 order_suffix(thread->ucycles, &ucycles, &usuffix);
720 order_suffix(thread->kcycles, &kcycles, &ksuffix);
[a35b458]721
[577f042a]722 char *name;
723 if (str_cmp(thread->name, "uinit") == 0)
724 name = thread->task->name;
725 else
726 name = thread->name;
[a35b458]727
[52755f1]728#ifdef __32_BITS__
[48dcc69]729 if (*additional)
[ae0300b5]730 printf("%-8" PRIu64 " %10p %10p %9" PRIu64 "%c %9" PRIu64 "%c ",
[577f042a]731 thread->tid, thread->thread_code, thread->kstack,
732 ucycles, usuffix, kcycles, ksuffix);
[48dcc69]733 else
[ae0300b5]734 printf("%-8" PRIu64 " %-14s %10p %-8s %10p %-5" PRIu32 "\n",
[577f042a]735 thread->tid, name, thread, thread_states[thread->state],
[26aafe8]736 thread->task, thread->task->container);
[52755f1]737#endif
[a35b458]738
[52755f1]739#ifdef __64_BITS__
[48dcc69]740 if (*additional)
[ae0300b5]741 printf("%-8" PRIu64 " %18p %18p\n"
[48dcc69]742 " %9" PRIu64 "%c %9" PRIu64 "%c ",
743 thread->tid, thread->thread_code, thread->kstack,
744 ucycles, usuffix, kcycles, ksuffix);
[5dcee525]745 else
[ae0300b5]746 printf("%-8" PRIu64 " %-14s %18p %-8s %18p %-5" PRIu32 "\n",
[577f042a]747 thread->tid, name, thread, thread_states[thread->state],
[26aafe8]748 thread->task, thread->task->container);
[48dcc69]749#endif
[a35b458]750
[48dcc69]751 if (*additional) {
752 if (thread->cpu)
753 printf("%-5u", thread->cpu->id);
754 else
755 printf("none ");
[a35b458]756
[48dcc69]757 if (thread->state == Sleeping) {
[52755f1]758#ifdef __32_BITS__
[48dcc69]759 printf(" %10p", thread->sleep_queue);
[52755f1]760#endif
[a35b458]761
[52755f1]762#ifdef __64_BITS__
[48dcc69]763 printf(" %18p", thread->sleep_queue);
[52755f1]764#endif
[48dcc69]765 }
[a35b458]766
[48dcc69]767 printf("\n");
[43b1e86]768 }
[a35b458]769
[b76a2217]770 return true;
[5dcee525]771}
772
[da1bafb]773/** Print list of threads debug info
[48dcc69]774 *
775 * @param additional Print additional information.
[da1bafb]776 *
777 */
[48dcc69]778void thread_print_list(bool additional)
[55ab0f1]779{
780 /* Messing with thread structures, avoid deadlock */
[da1bafb]781 irq_spinlock_lock(&threads_lock, true);
[a35b458]782
[da1bafb]783#ifdef __32_BITS__
[48dcc69]784 if (additional)
[577f042a]785 printf("[id ] [code ] [stack ] [ucycles ] [kcycles ]"
786 " [cpu] [waitqueue]\n");
[48dcc69]787 else
788 printf("[id ] [name ] [address ] [state ] [task ]"
[26aafe8]789 " [ctn]\n");
[52755f1]790#endif
[a35b458]791
[52755f1]792#ifdef __64_BITS__
[48dcc69]793 if (additional) {
794 printf("[id ] [code ] [stack ]\n"
795 " [ucycles ] [kcycles ] [cpu] [waitqueue ]\n");
796 } else
797 printf("[id ] [name ] [address ] [state ]"
[26aafe8]798 " [task ] [ctn]\n");
[52755f1]799#endif
[a35b458]800
[48dcc69]801 avltree_walk(&threads_tree, thread_walker, &additional);
[a35b458]802
[da1bafb]803 irq_spinlock_unlock(&threads_lock, true);
[55ab0f1]804}
[9f52563]805
[016acbe]806/** Check whether thread exists.
807 *
808 * Note that threads_lock must be already held and
809 * interrupts must be already disabled.
810 *
[da1bafb]811 * @param thread Pointer to thread.
[016acbe]812 *
813 * @return True if thread t is known to the system, false otherwise.
[da1bafb]814 *
[016acbe]815 */
[da1bafb]816bool thread_exists(thread_t *thread)
[016acbe]817{
[63e27ef]818 assert(interrupts_disabled());
819 assert(irq_spinlock_locked(&threads_lock));
[1d432f9]820
[da1bafb]821 avltree_node_t *node =
822 avltree_search(&threads_tree, (avltree_key_t) ((uintptr_t) thread));
[a35b458]823
[5dcee525]824 return node != NULL;
[016acbe]825}
826
[cce6acf]827/** Update accounting of current thread.
828 *
829 * Note that thread_lock on THREAD must be already held and
830 * interrupts must be already disabled.
831 *
[da1bafb]832 * @param user True to update user accounting, false for kernel.
833 *
[cce6acf]834 */
[a2a00e8]835void thread_update_accounting(bool user)
[cce6acf]836{
837 uint64_t time = get_cycle();
[1d432f9]838
[63e27ef]839 assert(interrupts_disabled());
840 assert(irq_spinlock_locked(&THREAD->lock));
[a35b458]841
[da1bafb]842 if (user)
[a2a00e8]843 THREAD->ucycles += time - THREAD->last_cycle;
[da1bafb]844 else
[a2a00e8]845 THREAD->kcycles += time - THREAD->last_cycle;
[a35b458]846
[cce6acf]847 THREAD->last_cycle = time;
848}
849
[e1b6742]850static bool thread_search_walker(avltree_node_t *node, void *arg)
851{
852 thread_t *thread =
853 (thread_t *) avltree_get_instance(node, thread_t, threads_tree_node);
854 thread_iterator_t *iterator = (thread_iterator_t *) arg;
[a35b458]855
[e1b6742]856 if (thread->tid == iterator->thread_id) {
857 iterator->thread = thread;
858 return false;
859 }
[a35b458]860
[e1b6742]861 return true;
862}
863
864/** Find thread structure corresponding to thread ID.
865 *
866 * The threads_lock must be already held by the caller of this function and
867 * interrupts must be disabled.
868 *
869 * @param id Thread ID.
870 *
871 * @return Thread structure address or NULL if there is no such thread ID.
872 *
873 */
874thread_t *thread_find_by_id(thread_id_t thread_id)
875{
[63e27ef]876 assert(interrupts_disabled());
877 assert(irq_spinlock_locked(&threads_lock));
[a35b458]878
[e1b6742]879 thread_iterator_t iterator;
[a35b458]880
[e1b6742]881 iterator.thread_id = thread_id;
882 iterator.thread = NULL;
[a35b458]883
[e1b6742]884 avltree_walk(&threads_tree, thread_search_walker, (void *) &iterator);
[a35b458]885
[e1b6742]886 return iterator.thread;
887}
888
[5b7a107]889#ifdef CONFIG_UDEBUG
890
[df58e44]891void thread_stack_trace(thread_id_t thread_id)
892{
893 irq_spinlock_lock(&threads_lock, true);
[a35b458]894
[df58e44]895 thread_t *thread = thread_find_by_id(thread_id);
896 if (thread == NULL) {
897 printf("No such thread.\n");
898 irq_spinlock_unlock(&threads_lock, true);
899 return;
900 }
[a35b458]901
[df58e44]902 irq_spinlock_lock(&thread->lock, false);
[a35b458]903
[df58e44]904 /*
905 * Schedule a stack trace to be printed
906 * just before the thread is scheduled next.
907 *
908 * If the thread is sleeping then try to interrupt
909 * the sleep. Any request for printing an uspace stack
910 * trace from within the kernel should be always
911 * considered a last resort debugging means, therefore
912 * forcing the thread's sleep to be interrupted
913 * is probably justifiable.
914 */
[a35b458]915
[df58e44]916 bool sleeping = false;
917 istate_t *istate = thread->udebug.uspace_state;
918 if (istate != NULL) {
919 printf("Scheduling thread stack trace.\n");
920 thread->btrace = true;
921 if (thread->state == Sleeping)
922 sleeping = true;
923 } else
924 printf("Thread interrupt state not available.\n");
[a35b458]925
[df58e44]926 irq_spinlock_unlock(&thread->lock, false);
[a35b458]927
[df58e44]928 if (sleeping)
929 waitq_interrupt_sleep(thread);
[a35b458]930
[df58e44]931 irq_spinlock_unlock(&threads_lock, true);
932}
[e1b6742]933
[5b7a107]934#endif /* CONFIG_UDEBUG */
[e1b6742]935
[9f52563]936/** Process syscall to create new thread.
937 *
938 */
[b7fd2a0]939sys_errno_t sys_thread_create(uspace_arg_t *uspace_uarg, char *uspace_name,
[7faabb7]940 size_t name_len, thread_id_t *uspace_thread_id)
[9f52563]941{
[24345a5]942 if (name_len > THREAD_NAME_BUFLEN - 1)
[7faabb7]943 name_len = THREAD_NAME_BUFLEN - 1;
[a35b458]944
[da1bafb]945 char namebuf[THREAD_NAME_BUFLEN];
[b7fd2a0]946 errno_t rc = copy_from_uspace(namebuf, uspace_name, name_len);
[a53ed3a]947 if (rc != EOK)
[b7fd2a0]948 return (sys_errno_t) rc;
[a35b458]949
[b60c582]950 namebuf[name_len] = 0;
[a35b458]951
[4680ef5]952 /*
953 * In case of failure, kernel_uarg will be deallocated in this function.
954 * In case of success, kernel_uarg will be freed in uinit().
955 */
[da1bafb]956 uspace_arg_t *kernel_uarg =
[11b285d]957 (uspace_arg_t *) malloc(sizeof(uspace_arg_t));
[7473807]958 if (!kernel_uarg)
959 return (sys_errno_t) ENOMEM;
[a35b458]960
[e3c762cd]961 rc = copy_from_uspace(kernel_uarg, uspace_uarg, sizeof(uspace_arg_t));
[a53ed3a]962 if (rc != EOK) {
[e3c762cd]963 free(kernel_uarg);
[b7fd2a0]964 return (sys_errno_t) rc;
[e3c762cd]965 }
[a35b458]966
[da1bafb]967 thread_t *thread = thread_create(uinit, kernel_uarg, TASK,
[6eef3c4]968 THREAD_FLAG_USPACE | THREAD_FLAG_NOATTACH, namebuf);
[da1bafb]969 if (thread) {
[d8431986]970 if (uspace_thread_id != NULL) {
[da1bafb]971 rc = copy_to_uspace(uspace_thread_id, &thread->tid,
972 sizeof(thread->tid));
[a53ed3a]973 if (rc != EOK) {
[d8431986]974 /*
975 * We have encountered a failure, but the thread
976 * has already been created. We need to undo its
977 * creation now.
978 */
[a35b458]979
[d8431986]980 /*
[ea7890e7]981 * The new thread structure is initialized, but
982 * is still not visible to the system.
[d8431986]983 * We can safely deallocate it.
984 */
[82d515e9]985 slab_free(thread_cache, thread);
[da1bafb]986 free(kernel_uarg);
[a35b458]987
[b7fd2a0]988 return (sys_errno_t) rc;
[3bacee1]989 }
[d8431986]990 }
[a35b458]991
[9a1b20c]992#ifdef CONFIG_UDEBUG
[13964ef]993 /*
994 * Generate udebug THREAD_B event and attach the thread.
995 * This must be done atomically (with the debug locks held),
996 * otherwise we would either miss some thread or receive
997 * THREAD_B events for threads that already existed
998 * and could be detected with THREAD_READ before.
999 */
[da1bafb]1000 udebug_thread_b_event_attach(thread, TASK);
[13964ef]1001#else
[da1bafb]1002 thread_attach(thread, TASK);
[9a1b20c]1003#endif
[da1bafb]1004 thread_ready(thread);
[a35b458]1005
[d8431986]1006 return 0;
[201abde]1007 } else
[0f250f9]1008 free(kernel_uarg);
[a35b458]1009
[b7fd2a0]1010 return (sys_errno_t) ENOMEM;
[9f52563]1011}
1012
1013/** Process syscall to terminate thread.
1014 *
1015 */
[b7fd2a0]1016sys_errno_t sys_thread_exit(int uspace_status)
[9f52563]1017{
[68091bd]1018 thread_exit();
[9f52563]1019}
[b45c443]1020
[3ce7f082]1021/** Syscall for getting TID.
1022 *
[201abde]1023 * @param uspace_thread_id Userspace address of 8-byte buffer where to store
1024 * current thread ID.
1025 *
1026 * @return 0 on success or an error code from @ref errno.h.
[da1bafb]1027 *
[b45c443]1028 */
[b7fd2a0]1029sys_errno_t sys_thread_get_id(thread_id_t *uspace_thread_id)
[3ce7f082]1030{
1031 /*
1032 * No need to acquire lock on THREAD because tid
1033 * remains constant for the lifespan of the thread.
[da1bafb]1034 *
[3ce7f082]1035 */
[b7fd2a0]1036 return (sys_errno_t) copy_to_uspace(uspace_thread_id, &THREAD->tid,
[201abde]1037 sizeof(THREAD->tid));
[3ce7f082]1038}
[6f4495f5]1039
[d9ece1cb]1040/** Syscall wrapper for sleeping. */
[b7fd2a0]1041sys_errno_t sys_thread_usleep(uint32_t usec)
[d9ece1cb]1042{
[22e6802]1043 thread_usleep(usec);
[d9ece1cb]1044 return 0;
1045}
1046
[b7fd2a0]1047sys_errno_t sys_thread_udelay(uint32_t usec)
[7e7b791]1048{
[8d6c1f1]1049 delay(usec);
[7e7b791]1050 return 0;
1051}
1052
[3ce7f082]1053/** @}
1054 */
Note: See TracBrowser for help on using the repository browser.