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

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

better printouts for threads

  • Property mode set to 100644
File size: 21.4 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
[cc73a8a1]29/** @addtogroup genericproc
[b45c443]30 * @{
31 */
32
[9179d0a]33/**
[b45c443]34 * @file
[da1bafb]35 * @brief Thread management functions.
[9179d0a]36 */
37
[f761f1eb]38#include <proc/scheduler.h>
39#include <proc/thread.h>
40#include <proc/task.h>
[0f250f9]41#include <proc/uarg.h>
[f761f1eb]42#include <mm/frame.h>
43#include <mm/page.h>
44#include <arch/asm.h>
[cce6acf]45#include <arch/cycle.h>
[f761f1eb]46#include <arch.h>
47#include <synch/synch.h>
48#include <synch/spinlock.h>
49#include <synch/waitq.h>
50#include <synch/rwlock.h>
51#include <cpu.h>
[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>
[4ffa9e0]58#include <config.h>
59#include <arch/interrupt.h>
[26a8604f]60#include <smp/ipi.h>
[f2ffad4]61#include <arch/faddr.h>
[23684b7]62#include <atomic.h>
[9c0a9b3]63#include <memstr.h>
[55ab0f1]64#include <print.h>
[266294a9]65#include <mm/slab.h>
66#include <debug.h>
[9f52563]67#include <main/uinit.h>
[e3c762cd]68#include <syscall/copy.h>
69#include <errno.h>
[52755f1]70
71
72#ifndef LOADED_PROG_STACK_PAGES_NO
73#define LOADED_PROG_STACK_PAGES_NO 1
74#endif
[f761f1eb]75
[fe19611]76
77/** Thread states */
[a000878c]78const char *thread_states[] = {
[fe19611]79 "Invalid",
80 "Running",
81 "Sleeping",
82 "Ready",
83 "Entering",
84 "Exiting",
[48d14222]85 "Lingering"
[e1b6742]86};
87
88typedef struct {
89 thread_id_t thread_id;
90 thread_t *thread;
91} thread_iterator_t;
[f761f1eb]92
[5dcee525]93/** Lock protecting the threads_tree AVL tree.
[4e33b6b]94 *
95 * For locking rules, see declaration thereof.
[da1bafb]96 *
[4e33b6b]97 */
[da1bafb]98IRQ_SPINLOCK_INITIALIZE(threads_lock);
[88169d9]99
[81c0171e]100/** AVL tree of all threads.
[88169d9]101 *
[5dcee525]102 * When a thread is found in the threads_tree AVL tree, it is guaranteed to
[4e33b6b]103 * exist as long as the threads_lock is held.
[da1bafb]104 *
[88169d9]105 */
[da1bafb]106avltree_t threads_tree;
[f761f1eb]107
[da1bafb]108IRQ_SPINLOCK_STATIC_INITIALIZE(tidlock);
109static thread_id_t last_tid = 0;
[f761f1eb]110
[266294a9]111static slab_cache_t *thread_slab;
[da1bafb]112
[0f81ceb7]113#ifdef CONFIG_FPU
[f76fed4]114slab_cache_t *fpu_context_slab;
115#endif
[266294a9]116
[4e33b6b]117/** Thread wrapper.
[70527f1]118 *
[4e33b6b]119 * This wrapper is provided to ensure that every thread makes a call to
120 * thread_exit() when its implementing function returns.
[f761f1eb]121 *
[22f7769]122 * interrupts_disable() is assumed.
[70527f1]123 *
[f761f1eb]124 */
[e16e036a]125static void cushion(void)
[f761f1eb]126{
[43114c5]127 void (*f)(void *) = THREAD->thread_code;
128 void *arg = THREAD->thread_arg;
[449dc1ed]129 THREAD->last_cycle = get_cycle();
[da1bafb]130
[0313ff0]131 /* This is where each thread wakes up after its creation */
[da1bafb]132 irq_spinlock_unlock(&THREAD->lock, false);
[22f7769]133 interrupts_enable();
[da1bafb]134
[f761f1eb]135 f(arg);
[0313ff0]136
137 /* Accumulate accounting to the task */
[da1bafb]138 irq_spinlock_lock(&THREAD->lock, true);
[62b6d17]139 if (!THREAD->uncounted) {
[a2a00e8]140 thread_update_accounting(true);
141 uint64_t ucycles = THREAD->ucycles;
142 THREAD->ucycles = 0;
143 uint64_t kcycles = THREAD->kcycles;
144 THREAD->kcycles = 0;
[62b6d17]145
[da1bafb]146 irq_spinlock_pass(&THREAD->lock, &TASK->lock);
[a2a00e8]147 TASK->ucycles += ucycles;
148 TASK->kcycles += kcycles;
[da1bafb]149 irq_spinlock_unlock(&TASK->lock, true);
[62b6d17]150 } else
[da1bafb]151 irq_spinlock_unlock(&THREAD->lock, true);
[0313ff0]152
[f761f1eb]153 thread_exit();
[da1bafb]154
155 /* Not reached */
[f761f1eb]156}
157
[da1bafb]158/** Initialization and allocation for thread_t structure
159 *
160 */
161static int thr_constructor(void *obj, unsigned int kmflags)
[266294a9]162{
[da1bafb]163 thread_t *thread = (thread_t *) obj;
164
165 irq_spinlock_initialize(&thread->lock, "thread_t_lock");
166 link_initialize(&thread->rq_link);
167 link_initialize(&thread->wq_link);
168 link_initialize(&thread->th_link);
169
[32fffef0]170 /* call the architecture-specific part of the constructor */
[da1bafb]171 thr_constructor_arch(thread);
[266294a9]172
[0f81ceb7]173#ifdef CONFIG_FPU
[d8431986]174#ifdef CONFIG_FPU_LAZY
[da1bafb]175 thread->saved_fpu_context = NULL;
176#else /* CONFIG_FPU_LAZY */
177 thread->saved_fpu_context = slab_alloc(fpu_context_slab, kmflags);
178 if (!thread->saved_fpu_context)
[f76fed4]179 return -1;
[da1bafb]180#endif /* CONFIG_FPU_LAZY */
181#endif /* CONFIG_FPU */
182
183 thread->kstack = (uint8_t *) frame_alloc(STACK_FRAMES, FRAME_KA | kmflags);
184 if (!thread->kstack) {
[0f81ceb7]185#ifdef CONFIG_FPU
[da1bafb]186 if (thread->saved_fpu_context)
187 slab_free(fpu_context_slab, thread->saved_fpu_context);
[f76fed4]188#endif
[266294a9]189 return -1;
[f76fed4]190 }
[da1bafb]191
[9a1b20c]192#ifdef CONFIG_UDEBUG
[da1bafb]193 mutex_initialize(&thread->udebug.lock, MUTEX_PASSIVE);
[9a1b20c]194#endif
[da1bafb]195
[266294a9]196 return 0;
197}
198
199/** Destruction of thread_t object */
[da1bafb]200static size_t thr_destructor(void *obj)
[266294a9]201{
[da1bafb]202 thread_t *thread = (thread_t *) obj;
203
[32fffef0]204 /* call the architecture-specific part of the destructor */
[da1bafb]205 thr_destructor_arch(thread);
206
207 frame_free(KA2PA(thread->kstack));
208
[0f81ceb7]209#ifdef CONFIG_FPU
[da1bafb]210 if (thread->saved_fpu_context)
211 slab_free(fpu_context_slab, thread->saved_fpu_context);
[f76fed4]212#endif
[da1bafb]213
214 return 1; /* One page freed */
[266294a9]215}
[70527f1]216
217/** Initialize threads
218 *
219 * Initialize kernel threads support.
220 *
221 */
[f761f1eb]222void thread_init(void)
223{
[43114c5]224 THREAD = NULL;
[da1bafb]225
[7217199]226 atomic_set(&nrdy, 0);
[4e33b6b]227 thread_slab = slab_cache_create("thread_slab", sizeof(thread_t), 0,
[6f4495f5]228 thr_constructor, thr_destructor, 0);
[da1bafb]229
[0f81ceb7]230#ifdef CONFIG_FPU
[4e33b6b]231 fpu_context_slab = slab_cache_create("fpu_slab", sizeof(fpu_context_t),
[6f4495f5]232 FPU_CONTEXT_ALIGN, NULL, NULL, 0);
[f76fed4]233#endif
[da1bafb]234
[5dcee525]235 avltree_create(&threads_tree);
[016acbe]236}
[70527f1]237
238/** Make thread ready
239 *
[da1bafb]240 * Switch thread to the ready state.
[70527f1]241 *
242 * @param t Thread to make ready.
243 *
244 */
[da1bafb]245void thread_ready(thread_t *thread)
[f761f1eb]246{
[da1bafb]247 irq_spinlock_lock(&thread->lock, true);
[f761f1eb]248
[da1bafb]249 ASSERT(!(thread->state == Ready));
250
251 int i = (thread->priority < RQ_COUNT - 1)
252 ? ++thread->priority : thread->priority;
253
254 cpu_t *cpu = CPU;
255 if (thread->flags & THREAD_FLAG_WIRED) {
256 ASSERT(thread->cpu != NULL);
257 cpu = thread->cpu;
[f761f1eb]258 }
[da1bafb]259 thread->state = Ready;
260
261 irq_spinlock_pass(&thread->lock, &(cpu->rq[i].lock));
[f761f1eb]262
[70527f1]263 /*
[da1bafb]264 * Append thread to respective ready queue
265 * on respective processor.
[f761f1eb]266 */
[da1bafb]267
268 list_append(&thread->rq_link, &cpu->rq[i].rq_head);
269 cpu->rq[i].n++;
270 irq_spinlock_unlock(&(cpu->rq[i].lock), true);
271
[59e07c91]272 atomic_inc(&nrdy);
[da1bafb]273 // FIXME: Why is the avg value not used
274 // avg = atomic_get(&nrdy) / config.cpu_active;
[248fc1a]275 atomic_inc(&cpu->nrdy);
[f761f1eb]276}
277
[70527f1]278/** Create new thread
279 *
280 * Create a new thread.
281 *
[da1bafb]282 * @param func Thread's implementing function.
283 * @param arg Thread's implementing function argument.
284 * @param task Task to which the thread belongs. The caller must
285 * guarantee that the task won't cease to exist during the
286 * call. The task's lock may not be held.
287 * @param flags Thread flags.
288 * @param name Symbolic name (a copy is made).
289 * @param uncounted Thread's accounting doesn't affect accumulated task
290 * accounting.
[70527f1]291 *
[da1bafb]292 * @return New thread's structure on success, NULL on failure.
[70527f1]293 *
294 */
[4e33b6b]295thread_t *thread_create(void (* func)(void *), void *arg, task_t *task,
[da1bafb]296 unsigned int flags, const char *name, bool uncounted)
[f761f1eb]297{
[da1bafb]298 thread_t *thread = (thread_t *) slab_alloc(thread_slab, 0);
299 if (!thread)
[2a46e10]300 return NULL;
[aa8d0f7]301
[bb68433]302 /* Not needed, but good for debugging */
[da1bafb]303 memsetb(thread->kstack, THREAD_STACK_SIZE * 1 << STACK_FRAMES, 0);
[bb68433]304
[da1bafb]305 irq_spinlock_lock(&tidlock, true);
306 thread->tid = ++last_tid;
307 irq_spinlock_unlock(&tidlock, true);
[bb68433]308
[da1bafb]309 context_save(&thread->saved_context);
310 context_set(&thread->saved_context, FADDR(cushion),
311 (uintptr_t) thread->kstack, THREAD_STACK_SIZE);
[bb68433]312
[da1bafb]313 the_initialize((the_t *) thread->kstack);
[bb68433]314
[da1bafb]315 ipl_t ipl = interrupts_disable();
316 thread->saved_context.ipl = interrupts_read();
[bb68433]317 interrupts_restore(ipl);
318
[da1bafb]319 str_cpy(thread->name, THREAD_NAME_BUFLEN, name);
320
321 thread->thread_code = func;
322 thread->thread_arg = arg;
323 thread->ticks = -1;
324 thread->ucycles = 0;
325 thread->kcycles = 0;
326 thread->uncounted = uncounted;
327 thread->priority = -1; /* Start in rq[0] */
328 thread->cpu = NULL;
329 thread->flags = flags;
330 thread->state = Entering;
331 thread->call_me = NULL;
332 thread->call_me_with = NULL;
333
334 timeout_initialize(&thread->sleep_timeout);
335 thread->sleep_interruptible = false;
336 thread->sleep_queue = NULL;
337 thread->timeout_pending = false;
338
339 thread->in_copy_from_uspace = false;
340 thread->in_copy_to_uspace = false;
341
342 thread->interrupted = false;
343 thread->detached = false;
344 waitq_initialize(&thread->join_wq);
345
346 thread->rwlock_holder_type = RWLOCK_NONE;
347
348 thread->task = task;
349
350 thread->fpu_context_exists = 0;
351 thread->fpu_context_engaged = 0;
352
353 avltree_node_initialize(&thread->threads_tree_node);
354 thread->threads_tree_node.key = (uintptr_t) thread;
[bb68433]355
[9a1b20c]356#ifdef CONFIG_UDEBUG
357 /* Init debugging stuff */
[da1bafb]358 udebug_thread_initialize(&thread->udebug);
[9a1b20c]359#endif
[da1bafb]360
361 /* Might depend on previous initialization */
362 thread_create_arch(thread);
363
[d8431986]364 if (!(flags & THREAD_FLAG_NOATTACH))
[da1bafb]365 thread_attach(thread, task);
366
367 return thread;
[d8431986]368}
369
370/** Destroy thread memory structure
371 *
372 * Detach thread from all queues, cpus etc. and destroy it.
[da1bafb]373 *
374 * @param thread Thread to be destroyed.
375 * @param irq_res Indicate whether it should unlock thread->lock
376 * in interrupts-restore mode.
[d8431986]377 *
378 */
[da1bafb]379void thread_destroy(thread_t *thread, bool irq_res)
[d8431986]380{
[2d3ddad]381 ASSERT(irq_spinlock_locked(&thread->lock));
[da1bafb]382 ASSERT((thread->state == Exiting) || (thread->state == Lingering));
383 ASSERT(thread->task);
384 ASSERT(thread->cpu);
385
386 irq_spinlock_lock(&thread->cpu->lock, false);
387 if (thread->cpu->fpu_owner == thread)
388 thread->cpu->fpu_owner = NULL;
389 irq_spinlock_unlock(&thread->cpu->lock, false);
390
391 irq_spinlock_pass(&thread->lock, &threads_lock);
392
393 avltree_delete(&threads_tree, &thread->threads_tree_node);
394
395 irq_spinlock_pass(&threads_lock, &thread->task->lock);
396
[d8431986]397 /*
398 * Detach from the containing task.
399 */
[da1bafb]400 list_remove(&thread->th_link);
401 irq_spinlock_unlock(&thread->task->lock, irq_res);
402
[ea7890e7]403 /*
[7ed8530]404 * Drop the reference to the containing task.
[ea7890e7]405 */
[da1bafb]406 task_release(thread->task);
407 slab_free(thread_slab, thread);
[d8431986]408}
409
410/** Make the thread visible to the system.
411 *
412 * Attach the thread structure to the current task and make it visible in the
[5dcee525]413 * threads_tree.
[d8431986]414 *
[da1bafb]415 * @param t Thread to be attached to the task.
416 * @param task Task to which the thread is to be attached.
417 *
[d8431986]418 */
[da1bafb]419void thread_attach(thread_t *thread, task_t *task)
[d8431986]420{
421 /*
[9a1b20c]422 * Attach to the specified task.
[d8431986]423 */
[da1bafb]424 irq_spinlock_lock(&task->lock, true);
425
[7ed8530]426 /* Hold a reference to the task. */
427 task_hold(task);
[da1bafb]428
[9a1b20c]429 /* Must not count kbox thread into lifecount */
[da1bafb]430 if (thread->flags & THREAD_FLAG_USPACE)
[9a1b20c]431 atomic_inc(&task->lifecount);
[da1bafb]432
433 list_append(&thread->th_link, &task->th_head);
434
435 irq_spinlock_pass(&task->lock, &threads_lock);
436
[bb68433]437 /*
438 * Register this thread in the system-wide list.
439 */
[da1bafb]440 avltree_insert(&threads_tree, &thread->threads_tree_node);
441 irq_spinlock_unlock(&threads_lock, true);
[f761f1eb]442}
443
[0182a665]444/** Terminate thread.
[70527f1]445 *
[da1bafb]446 * End current thread execution and switch it to the exiting state.
447 * All pending timeouts are executed.
448 *
[70527f1]449 */
[f761f1eb]450void thread_exit(void)
451{
[9a1b20c]452 if (THREAD->flags & THREAD_FLAG_USPACE) {
453#ifdef CONFIG_UDEBUG
454 /* Generate udebug THREAD_E event */
455 udebug_thread_e_event();
[0ac99db]456
457 /*
458 * This thread will not execute any code or system calls from
459 * now on.
460 */
461 udebug_stoppable_begin();
[9a1b20c]462#endif
463 if (atomic_predec(&TASK->lifecount) == 0) {
464 /*
465 * We are the last userspace thread in the task that
466 * still has not exited. With the exception of the
467 * moment the task was created, new userspace threads
468 * can only be created by threads of the same task.
469 * We are safe to perform cleanup.
[da1bafb]470 *
[9a1b20c]471 */
[ea7890e7]472 ipc_cleanup();
[52755f1]473 futex_cleanup();
474 LOG("Cleanup of task %" PRIu64" completed.", TASK->taskid);
[ea7890e7]475 }
476 }
[da1bafb]477
[f761f1eb]478restart:
[da1bafb]479 irq_spinlock_lock(&THREAD->lock, true);
480 if (THREAD->timeout_pending) {
481 /* Busy waiting for timeouts in progress */
482 irq_spinlock_unlock(&THREAD->lock, true);
[f761f1eb]483 goto restart;
484 }
[ea7890e7]485
[43114c5]486 THREAD->state = Exiting;
[da1bafb]487 irq_spinlock_unlock(&THREAD->lock, true);
488
[f761f1eb]489 scheduler();
[da1bafb]490
[874621f]491 /* Not reached */
[da1bafb]492 while (true);
[f761f1eb]493}
494
[70527f1]495/** Thread sleep
496 *
497 * Suspend execution of the current thread.
498 *
499 * @param sec Number of seconds to sleep.
500 *
501 */
[7f1c620]502void thread_sleep(uint32_t sec)
[f761f1eb]503{
[22e6802]504 /* Sleep in 1000 second steps to support
505 full argument range */
506 while (sec > 0) {
507 uint32_t period = (sec > 1000) ? 1000 : sec;
[da1bafb]508
[22e6802]509 thread_usleep(period * 1000000);
510 sec -= period;
511 }
[f761f1eb]512}
[70527f1]513
[fe19611]514/** Wait for another thread to exit.
515 *
[da1bafb]516 * @param thread Thread to join on exit.
517 * @param usec Timeout in microseconds.
518 * @param flags Mode of operation.
[fe19611]519 *
520 * @return An error code from errno.h or an error code from synch.h.
[da1bafb]521 *
[fe19611]522 */
[da1bafb]523int thread_join_timeout(thread_t *thread, uint32_t usec, unsigned int flags)
[fe19611]524{
[da1bafb]525 if (thread == THREAD)
[fe19611]526 return EINVAL;
[da1bafb]527
[fe19611]528 /*
529 * Since thread join can only be called once on an undetached thread,
530 * the thread pointer is guaranteed to be still valid.
531 */
532
[da1bafb]533 irq_spinlock_lock(&thread->lock, true);
534 ASSERT(!thread->detached);
535 irq_spinlock_unlock(&thread->lock, true);
[0182a665]536
[da1bafb]537 return waitq_sleep_timeout(&thread->join_wq, usec, flags);
[fe19611]538}
539
540/** Detach thread.
541 *
[48d14222]542 * Mark the thread as detached, if the thread is already in the Lingering
543 * state, deallocate its resources.
[fe19611]544 *
[da1bafb]545 * @param thread Thread to be detached.
546 *
[fe19611]547 */
[da1bafb]548void thread_detach(thread_t *thread)
[fe19611]549{
550 /*
[31d8e10]551 * Since the thread is expected not to be already detached,
[fe19611]552 * pointer to it must be still valid.
553 */
[da1bafb]554 irq_spinlock_lock(&thread->lock, true);
555 ASSERT(!thread->detached);
556
557 if (thread->state == Lingering) {
558 /*
559 * Unlock &thread->lock and restore
560 * interrupts in thread_destroy().
561 */
562 thread_destroy(thread, true);
[fe19611]563 return;
564 } else {
[da1bafb]565 thread->detached = true;
[fe19611]566 }
[da1bafb]567
568 irq_spinlock_unlock(&thread->lock, true);
[fe19611]569}
570
[70527f1]571/** Thread usleep
572 *
573 * Suspend execution of the current thread.
574 *
575 * @param usec Number of microseconds to sleep.
576 *
577 */
[7f1c620]578void thread_usleep(uint32_t usec)
[f761f1eb]579{
580 waitq_t wq;
[22e6802]581
[f761f1eb]582 waitq_initialize(&wq);
[22e6802]583
[116d1ef4]584 (void) waitq_sleep_timeout(&wq, usec, SYNCH_FLAGS_NON_BLOCKING);
[f761f1eb]585}
586
[70527f1]587/** Register thread out-of-context invocation
588 *
589 * Register a function and its argument to be executed
[da1bafb]590 * on next context switch to the current thread. Must
591 * be called with interrupts disabled.
[70527f1]592 *
593 * @param call_me Out-of-context function.
594 * @param call_me_with Out-of-context function argument.
595 *
596 */
[f761f1eb]597void thread_register_call_me(void (* call_me)(void *), void *call_me_with)
598{
[da1bafb]599 irq_spinlock_lock(&THREAD->lock, false);
[43114c5]600 THREAD->call_me = call_me;
601 THREAD->call_me_with = call_me_with;
[da1bafb]602 irq_spinlock_unlock(&THREAD->lock, false);
[f761f1eb]603}
[55ab0f1]604
[b76a2217]605static bool thread_walker(avltree_node_t *node, void *arg)
[5dcee525]606{
[48dcc69]607 bool *additional = (bool *) arg;
[da1bafb]608 thread_t *thread = avltree_get_instance(node, thread_t, threads_tree_node);
[52755f1]609
[1ba37fa]610 uint64_t ucycles, kcycles;
611 char usuffix, ksuffix;
[da1bafb]612 order_suffix(thread->ucycles, &ucycles, &usuffix);
613 order_suffix(thread->kcycles, &kcycles, &ksuffix);
614
[52755f1]615#ifdef __32_BITS__
[48dcc69]616 if (*additional)
617 printf("%-8" PRIu64" %10p %9" PRIu64 "%c %9" PRIu64 "%c ",
618 thread->tid, thread->kstack, ucycles, usuffix,
619 kcycles, ksuffix);
620 else
621 printf("%-8" PRIu64" %-14s %10p %-8s %10p %-5" PRIu32 " %10p\n",
622 thread->tid, thread->name, thread, thread_states[thread->state],
623 thread->task, thread->task->context, thread->thread_code);
[52755f1]624#endif
[da1bafb]625
[52755f1]626#ifdef __64_BITS__
[48dcc69]627 if (*additional)
628 printf("%-8" PRIu64" %18p %18p\n"
629 " %9" PRIu64 "%c %9" PRIu64 "%c ",
630 thread->tid, thread->thread_code, thread->kstack,
631 ucycles, usuffix, kcycles, ksuffix);
[5dcee525]632 else
[48dcc69]633 printf("%-8" PRIu64" %-14s %18p %-8s %18p %-5" PRIu32 "\n",
634 thread->tid, thread->name, thread, thread_states[thread->state],
635 thread->task, thread->task->context);
636#endif
[da1bafb]637
[48dcc69]638 if (*additional) {
639 if (thread->cpu)
640 printf("%-5u", thread->cpu->id);
641 else
642 printf("none ");
643
644 if (thread->state == Sleeping) {
[52755f1]645#ifdef __32_BITS__
[48dcc69]646 printf(" %10p", thread->sleep_queue);
[52755f1]647#endif
[48dcc69]648
[52755f1]649#ifdef __64_BITS__
[48dcc69]650 printf(" %18p", thread->sleep_queue);
[52755f1]651#endif
[48dcc69]652 }
653
654 printf("\n");
[43b1e86]655 }
[da1bafb]656
[b76a2217]657 return true;
[5dcee525]658}
659
[da1bafb]660/** Print list of threads debug info
[48dcc69]661 *
662 * @param additional Print additional information.
[da1bafb]663 *
664 */
[48dcc69]665void thread_print_list(bool additional)
[55ab0f1]666{
667 /* Messing with thread structures, avoid deadlock */
[da1bafb]668 irq_spinlock_lock(&threads_lock, true);
669
670#ifdef __32_BITS__
[48dcc69]671 if (additional)
672 printf("[id ] [stack ] [ucycles ] [kcycles ] [cpu]"
673 " [waitqueue]\n");
674 else
675 printf("[id ] [name ] [address ] [state ] [task ]"
676 " [ctx] [code ]\n");
[52755f1]677#endif
[da1bafb]678
[52755f1]679#ifdef __64_BITS__
[48dcc69]680 if (additional) {
681 printf("[id ] [code ] [stack ]\n"
682 " [ucycles ] [kcycles ] [cpu] [waitqueue ]\n");
683 } else
684 printf("[id ] [name ] [address ] [state ]"
685 " [task ] [ctx]\n");
[52755f1]686#endif
[da1bafb]687
[48dcc69]688 avltree_walk(&threads_tree, thread_walker, &additional);
[da1bafb]689
690 irq_spinlock_unlock(&threads_lock, true);
[55ab0f1]691}
[9f52563]692
[016acbe]693/** Check whether thread exists.
694 *
695 * Note that threads_lock must be already held and
696 * interrupts must be already disabled.
697 *
[da1bafb]698 * @param thread Pointer to thread.
[016acbe]699 *
700 * @return True if thread t is known to the system, false otherwise.
[da1bafb]701 *
[016acbe]702 */
[da1bafb]703bool thread_exists(thread_t *thread)
[016acbe]704{
[1d432f9]705 ASSERT(interrupts_disabled());
706 ASSERT(irq_spinlock_locked(&threads_lock));
707
[da1bafb]708 avltree_node_t *node =
709 avltree_search(&threads_tree, (avltree_key_t) ((uintptr_t) thread));
[016acbe]710
[5dcee525]711 return node != NULL;
[016acbe]712}
713
[cce6acf]714/** Update accounting of current thread.
715 *
716 * Note that thread_lock on THREAD must be already held and
717 * interrupts must be already disabled.
718 *
[da1bafb]719 * @param user True to update user accounting, false for kernel.
720 *
[cce6acf]721 */
[a2a00e8]722void thread_update_accounting(bool user)
[cce6acf]723{
724 uint64_t time = get_cycle();
[1d432f9]725
726 ASSERT(interrupts_disabled());
727 ASSERT(irq_spinlock_locked(&THREAD->lock));
[da1bafb]728
729 if (user)
[a2a00e8]730 THREAD->ucycles += time - THREAD->last_cycle;
[da1bafb]731 else
[a2a00e8]732 THREAD->kcycles += time - THREAD->last_cycle;
[da1bafb]733
[cce6acf]734 THREAD->last_cycle = time;
735}
736
[e1b6742]737static bool thread_search_walker(avltree_node_t *node, void *arg)
738{
739 thread_t *thread =
740 (thread_t *) avltree_get_instance(node, thread_t, threads_tree_node);
741 thread_iterator_t *iterator = (thread_iterator_t *) arg;
742
743 if (thread->tid == iterator->thread_id) {
744 iterator->thread = thread;
745 return false;
746 }
747
748 return true;
749}
750
751/** Find thread structure corresponding to thread ID.
752 *
753 * The threads_lock must be already held by the caller of this function and
754 * interrupts must be disabled.
755 *
756 * @param id Thread ID.
757 *
758 * @return Thread structure address or NULL if there is no such thread ID.
759 *
760 */
761thread_t *thread_find_by_id(thread_id_t thread_id)
762{
[1d432f9]763 ASSERT(interrupts_disabled());
764 ASSERT(irq_spinlock_locked(&threads_lock));
765
[e1b6742]766 thread_iterator_t iterator;
767
768 iterator.thread_id = thread_id;
769 iterator.thread = NULL;
770
771 avltree_walk(&threads_tree, thread_search_walker, (void *) &iterator);
772
773 return iterator.thread;
774}
775
776
[9f52563]777/** Process syscall to create new thread.
778 *
779 */
[f6d2c81]780unative_t sys_thread_create(uspace_arg_t *uspace_uarg, char *uspace_name,
[7faabb7]781 size_t name_len, thread_id_t *uspace_thread_id)
[9f52563]782{
[24345a5]783 if (name_len > THREAD_NAME_BUFLEN - 1)
[7faabb7]784 name_len = THREAD_NAME_BUFLEN - 1;
[da1bafb]785
786 char namebuf[THREAD_NAME_BUFLEN];
787 int rc = copy_from_uspace(namebuf, uspace_name, name_len);
[e3c762cd]788 if (rc != 0)
[7f1c620]789 return (unative_t) rc;
[da1bafb]790
[b60c582]791 namebuf[name_len] = 0;
[da1bafb]792
[4680ef5]793 /*
794 * In case of failure, kernel_uarg will be deallocated in this function.
795 * In case of success, kernel_uarg will be freed in uinit().
[da1bafb]796 *
[4680ef5]797 */
[da1bafb]798 uspace_arg_t *kernel_uarg =
799 (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0);
[4680ef5]800
[e3c762cd]801 rc = copy_from_uspace(kernel_uarg, uspace_uarg, sizeof(uspace_arg_t));
802 if (rc != 0) {
803 free(kernel_uarg);
[7f1c620]804 return (unative_t) rc;
[e3c762cd]805 }
[da1bafb]806
807 thread_t *thread = thread_create(uinit, kernel_uarg, TASK,
[d8431986]808 THREAD_FLAG_USPACE | THREAD_FLAG_NOATTACH, namebuf, false);
[da1bafb]809 if (thread) {
[d8431986]810 if (uspace_thread_id != NULL) {
[da1bafb]811 rc = copy_to_uspace(uspace_thread_id, &thread->tid,
812 sizeof(thread->tid));
[d8431986]813 if (rc != 0) {
814 /*
815 * We have encountered a failure, but the thread
816 * has already been created. We need to undo its
817 * creation now.
[da1bafb]818 *
[d8431986]819 */
[da1bafb]820
[d8431986]821 /*
[ea7890e7]822 * The new thread structure is initialized, but
823 * is still not visible to the system.
[d8431986]824 * We can safely deallocate it.
825 */
[da1bafb]826 slab_free(thread_slab, thread);
827 free(kernel_uarg);
828
[d8431986]829 return (unative_t) rc;
830 }
831 }
[da1bafb]832
[9a1b20c]833#ifdef CONFIG_UDEBUG
[13964ef]834 /*
835 * Generate udebug THREAD_B event and attach the thread.
836 * This must be done atomically (with the debug locks held),
837 * otherwise we would either miss some thread or receive
838 * THREAD_B events for threads that already existed
839 * and could be detected with THREAD_READ before.
[da1bafb]840 *
[13964ef]841 */
[da1bafb]842 udebug_thread_b_event_attach(thread, TASK);
[13964ef]843#else
[da1bafb]844 thread_attach(thread, TASK);
[9a1b20c]845#endif
[da1bafb]846 thread_ready(thread);
847
[d8431986]848 return 0;
[201abde]849 } else
[0f250f9]850 free(kernel_uarg);
[da1bafb]851
[7f1c620]852 return (unative_t) ENOMEM;
[9f52563]853}
854
855/** Process syscall to terminate thread.
856 *
857 */
[7f1c620]858unative_t sys_thread_exit(int uspace_status)
[9f52563]859{
[68091bd]860 thread_exit();
[da1bafb]861
[68091bd]862 /* Unreachable */
863 return 0;
[9f52563]864}
[b45c443]865
[3ce7f082]866/** Syscall for getting TID.
867 *
[201abde]868 * @param uspace_thread_id Userspace address of 8-byte buffer where to store
869 * current thread ID.
870 *
871 * @return 0 on success or an error code from @ref errno.h.
[da1bafb]872 *
[b45c443]873 */
[201abde]874unative_t sys_thread_get_id(thread_id_t *uspace_thread_id)
[3ce7f082]875{
876 /*
877 * No need to acquire lock on THREAD because tid
878 * remains constant for the lifespan of the thread.
[da1bafb]879 *
[3ce7f082]880 */
[201abde]881 return (unative_t) copy_to_uspace(uspace_thread_id, &THREAD->tid,
882 sizeof(THREAD->tid));
[3ce7f082]883}
[6f4495f5]884
[d9ece1cb]885/** Syscall wrapper for sleeping. */
886unative_t sys_thread_usleep(uint32_t usec)
887{
[22e6802]888 thread_usleep(usec);
[d9ece1cb]889 return 0;
890}
891
[3ce7f082]892/** @}
893 */
Note: See TracBrowser for help on using the repository browser.