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

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

Remove RCU and CHT support

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