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

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

cleanup the huge mess related to stacks, their sizes and locations
use two frames for kernel stacks by default on all platforms (to play it safe)

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