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

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

thread CPU cycles accounting

  • Property mode set to 100644
File size: 14.7 KB
RevLine 
[f761f1eb]1/*
2 * Copyright (C) 2001-2004 Jakub Jermar
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 *
9 * - Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * - Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
14 * - The name of the author may not be used to endorse or promote products
15 * derived from this software without specific prior written permission.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
18 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
26 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 */
28
[cc73a8a1]29/** @addtogroup genericproc
[b45c443]30 * @{
31 */
32
[9179d0a]33/**
[b45c443]34 * @file
[9179d0a]35 * @brief Thread management functions.
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>
52#include <func.h>
53#include <context.h>
[016acbe]54#include <adt/btree.h>
[5c9a08b]55#include <adt/list.h>
[f761f1eb]56#include <typedefs.h>
57#include <time/clock.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>
[f761f1eb]70
[fe19611]71
72/** Thread states */
73char *thread_states[] = {
74 "Invalid",
75 "Running",
76 "Sleeping",
77 "Ready",
78 "Entering",
79 "Exiting",
80 "Undead"
81};
[f761f1eb]82
[88169d9]83/** Lock protecting the threads_btree B+tree. For locking rules, see declaration thereof. */
[016acbe]84SPINLOCK_INITIALIZE(threads_lock);
[88169d9]85
86/** B+tree of all threads.
87 *
88 * When a thread is found in the threads_btree B+tree, it is guaranteed to exist as long
89 * as the threads_lock is held.
90 */
91btree_t threads_btree;
[f761f1eb]92
[dc747e3]93SPINLOCK_INITIALIZE(tidlock);
[7f1c620]94uint32_t last_tid = 0;
[f761f1eb]95
[266294a9]96static slab_cache_t *thread_slab;
[f76fed4]97#ifdef ARCH_HAS_FPU
98slab_cache_t *fpu_context_slab;
99#endif
[266294a9]100
[70527f1]101/** Thread wrapper
102 *
103 * This wrapper is provided to ensure that every thread
[f761f1eb]104 * makes a call to thread_exit() when its implementing
105 * function returns.
106 *
[22f7769]107 * interrupts_disable() is assumed.
[70527f1]108 *
[f761f1eb]109 */
[e16e036a]110static void cushion(void)
[f761f1eb]111{
[43114c5]112 void (*f)(void *) = THREAD->thread_code;
113 void *arg = THREAD->thread_arg;
[f761f1eb]114
[3e1607f]115 /* this is where each thread wakes up after its creation */
[43114c5]116 spinlock_unlock(&THREAD->lock);
[22f7769]117 interrupts_enable();
[f761f1eb]118
119 f(arg);
120 thread_exit();
121 /* not reached */
122}
123
[266294a9]124/** Initialization and allocation for thread_t structure */
125static int thr_constructor(void *obj, int kmflags)
126{
[764c302]127 thread_t *t = (thread_t *) obj;
[266294a9]128
129 spinlock_initialize(&t->lock, "thread_t_lock");
130 link_initialize(&t->rq_link);
131 link_initialize(&t->wq_link);
132 link_initialize(&t->th_link);
[32fffef0]133
134 /* call the architecture-specific part of the constructor */
135 thr_constructor_arch(t);
[266294a9]136
[f76fed4]137#ifdef ARCH_HAS_FPU
138# ifdef CONFIG_FPU_LAZY
139 t->saved_fpu_context = NULL;
140# else
141 t->saved_fpu_context = slab_alloc(fpu_context_slab,kmflags);
142 if (!t->saved_fpu_context)
143 return -1;
144# endif
145#endif
146
[e45f81a]147 t->kstack = frame_alloc(STACK_FRAMES, FRAME_KA | kmflags);
148 if (! t->kstack) {
[f76fed4]149#ifdef ARCH_HAS_FPU
150 if (t->saved_fpu_context)
151 slab_free(fpu_context_slab,t->saved_fpu_context);
152#endif
[266294a9]153 return -1;
[f76fed4]154 }
[266294a9]155
156 return 0;
157}
158
159/** Destruction of thread_t object */
160static int thr_destructor(void *obj)
161{
[764c302]162 thread_t *t = (thread_t *) obj;
[266294a9]163
[32fffef0]164 /* call the architecture-specific part of the destructor */
165 thr_destructor_arch(t);
166
[2e9eae2]167 frame_free(KA2PA(t->kstack));
[f76fed4]168#ifdef ARCH_HAS_FPU
169 if (t->saved_fpu_context)
170 slab_free(fpu_context_slab,t->saved_fpu_context);
171#endif
[266294a9]172 return 1; /* One page freed */
173}
[70527f1]174
175/** Initialize threads
176 *
177 * Initialize kernel threads support.
178 *
179 */
[f761f1eb]180void thread_init(void)
181{
[43114c5]182 THREAD = NULL;
[80d2bdb]183 atomic_set(&nrdy,0);
[266294a9]184 thread_slab = slab_cache_create("thread_slab",
185 sizeof(thread_t),0,
186 thr_constructor, thr_destructor, 0);
[f76fed4]187#ifdef ARCH_HAS_FPU
188 fpu_context_slab = slab_cache_create("fpu_slab",
189 sizeof(fpu_context_t),
190 FPU_CONTEXT_ALIGN,
191 NULL, NULL, 0);
192#endif
[f761f1eb]193
[016acbe]194 btree_create(&threads_btree);
195}
[70527f1]196
197/** Make thread ready
198 *
199 * Switch thread t to the ready state.
200 *
201 * @param t Thread to make ready.
202 *
203 */
[f761f1eb]204void thread_ready(thread_t *t)
205{
206 cpu_t *cpu;
207 runq_t *r;
[22f7769]208 ipl_t ipl;
[80d2bdb]209 int i, avg;
[f761f1eb]210
[22f7769]211 ipl = interrupts_disable();
[f761f1eb]212
213 spinlock_lock(&t->lock);
214
[fbcfd458]215 ASSERT(! (t->state == Ready));
216
[22f7769]217 i = (t->priority < RQ_COUNT -1) ? ++t->priority : t->priority;
[f761f1eb]218
[8262010]219 cpu = CPU;
[32fffef0]220 if (t->flags & THREAD_FLAG_WIRED) {
[f761f1eb]221 cpu = t->cpu;
222 }
[81c4c6da]223 t->state = Ready;
[f761f1eb]224 spinlock_unlock(&t->lock);
225
[70527f1]226 /*
[f761f1eb]227 * Append t to respective ready queue on respective processor.
228 */
229 r = &cpu->rq[i];
230 spinlock_lock(&r->lock);
231 list_append(&t->rq_link, &r->rq_head);
232 r->n++;
233 spinlock_unlock(&r->lock);
234
[59e07c91]235 atomic_inc(&nrdy);
[80d2bdb]236 avg = atomic_get(&nrdy) / config.cpu_active;
[248fc1a]237 atomic_inc(&cpu->nrdy);
[76cec1e]238
[22f7769]239 interrupts_restore(ipl);
[f761f1eb]240}
241
[266294a9]242/** Destroy thread memory structure
243 *
244 * Detach thread from all queues, cpus etc. and destroy it.
245 *
246 * Assume thread->lock is held!!
247 */
248void thread_destroy(thread_t *t)
249{
[7509ddc]250 bool destroy_task = false;
251
[c778c1a]252 ASSERT(t->state == Exiting || t->state == Undead);
[266294a9]253 ASSERT(t->task);
254 ASSERT(t->cpu);
255
256 spinlock_lock(&t->cpu->lock);
257 if(t->cpu->fpu_owner==t)
258 t->cpu->fpu_owner=NULL;
259 spinlock_unlock(&t->cpu->lock);
260
[7509ddc]261 spinlock_unlock(&t->lock);
262
263 spinlock_lock(&threads_lock);
[7f1c620]264 btree_remove(&threads_btree, (btree_key_t) ((uintptr_t ) t), NULL);
[7509ddc]265 spinlock_unlock(&threads_lock);
266
[266294a9]267 /*
268 * Detach from the containing task.
269 */
270 spinlock_lock(&t->task->lock);
271 list_remove(&t->th_link);
[7509ddc]272 if (--t->task->refcount == 0) {
273 t->task->accept_new_threads = false;
274 destroy_task = true;
275 }
276 spinlock_unlock(&t->task->lock);
[266294a9]277
[7509ddc]278 if (destroy_task)
279 task_destroy(t->task);
[266294a9]280
281 slab_free(thread_slab, t);
282}
283
[70527f1]284/** Create new thread
285 *
286 * Create a new thread.
287 *
288 * @param func Thread's implementing function.
289 * @param arg Thread's implementing function argument.
290 * @param task Task to which the thread belongs.
291 * @param flags Thread flags.
[ff14c520]292 * @param name Symbolic name.
[70527f1]293 *
294 * @return New thread's structure on success, NULL on failure.
295 *
296 */
[ff14c520]297thread_t *thread_create(void (* func)(void *), void *arg, task_t *task, int flags, char *name)
[f761f1eb]298{
299 thread_t *t;
[bb68433]300 ipl_t ipl;
301
[266294a9]302 t = (thread_t *) slab_alloc(thread_slab, 0);
[2a46e10]303 if (!t)
304 return NULL;
[f761f1eb]305
[bb68433]306 /* Not needed, but good for debugging */
[764c302]307 memsetb((uintptr_t) t->kstack, THREAD_STACK_SIZE * 1 << STACK_FRAMES, 0);
[bb68433]308
309 ipl = interrupts_disable();
310 spinlock_lock(&tidlock);
311 t->tid = ++last_tid;
312 spinlock_unlock(&tidlock);
313 interrupts_restore(ipl);
314
315 context_save(&t->saved_context);
[7f1c620]316 context_set(&t->saved_context, FADDR(cushion), (uintptr_t) t->kstack, THREAD_STACK_SIZE);
[bb68433]317
318 the_initialize((the_t *) t->kstack);
319
320 ipl = interrupts_disable();
321 t->saved_context.ipl = interrupts_read();
322 interrupts_restore(ipl);
323
[9f52563]324 memcpy(t->name, name, THREAD_NAME_BUFLEN);
325
[bb68433]326 t->thread_code = func;
327 t->thread_arg = arg;
328 t->ticks = -1;
[cce6acf]329 t->cycles = 0;
[bb68433]330 t->priority = -1; /* start in rq[0] */
331 t->cpu = NULL;
[32fffef0]332 t->flags = flags;
[bb68433]333 t->state = Entering;
334 t->call_me = NULL;
335 t->call_me_with = NULL;
336
337 timeout_initialize(&t->sleep_timeout);
[116d1ef4]338 t->sleep_interruptible = false;
[bb68433]339 t->sleep_queue = NULL;
340 t->timeout_pending = 0;
[e3c762cd]341
342 t->in_copy_from_uspace = false;
343 t->in_copy_to_uspace = false;
[7509ddc]344
345 t->interrupted = false;
[48e7dd6]346 t->join_type = None;
[fe19611]347 t->detached = false;
348 waitq_initialize(&t->join_wq);
349
[bb68433]350 t->rwlock_holder_type = RWLOCK_NONE;
[6a27d63]351
[bb68433]352 t->task = task;
353
[6f8a426]354 t->fpu_context_exists = 0;
355 t->fpu_context_engaged = 0;
[32fffef0]356
357 thread_create_arch(t); /* might depend on previous initialization */
[bb68433]358
[7509ddc]359 /*
360 * Attach to the containing task.
361 */
[0182a665]362 ipl = interrupts_disable();
[7509ddc]363 spinlock_lock(&task->lock);
364 if (!task->accept_new_threads) {
365 spinlock_unlock(&task->lock);
366 slab_free(thread_slab, t);
[0182a665]367 interrupts_restore(ipl);
[7509ddc]368 return NULL;
369 }
370 list_append(&t->th_link, &task->th_head);
[b91bb65]371 if (task->refcount++ == 0)
372 task->main_thread = t;
[7509ddc]373 spinlock_unlock(&task->lock);
374
[bb68433]375 /*
376 * Register this thread in the system-wide list.
377 */
378 spinlock_lock(&threads_lock);
[7f1c620]379 btree_insert(&threads_btree, (btree_key_t) ((uintptr_t) t), (void *) t, NULL);
[bb68433]380 spinlock_unlock(&threads_lock);
381
382 interrupts_restore(ipl);
[6f8a426]383
[f761f1eb]384 return t;
385}
386
[0182a665]387/** Terminate thread.
[70527f1]388 *
389 * End current thread execution and switch it to the exiting
390 * state. All pending timeouts are executed.
391 *
392 */
[f761f1eb]393void thread_exit(void)
394{
[22f7769]395 ipl_t ipl;
[f761f1eb]396
397restart:
[22f7769]398 ipl = interrupts_disable();
[43114c5]399 spinlock_lock(&THREAD->lock);
400 if (THREAD->timeout_pending) { /* busy waiting for timeouts in progress */
401 spinlock_unlock(&THREAD->lock);
[22f7769]402 interrupts_restore(ipl);
[f761f1eb]403 goto restart;
404 }
[43114c5]405 THREAD->state = Exiting;
406 spinlock_unlock(&THREAD->lock);
[f761f1eb]407 scheduler();
[874621f]408
409 /* Not reached */
410 while (1)
411 ;
[f761f1eb]412}
413
[70527f1]414
415/** Thread sleep
416 *
417 * Suspend execution of the current thread.
418 *
419 * @param sec Number of seconds to sleep.
420 *
421 */
[7f1c620]422void thread_sleep(uint32_t sec)
[f761f1eb]423{
[76cec1e]424 thread_usleep(sec*1000000);
[f761f1eb]425}
[70527f1]426
[fe19611]427/** Wait for another thread to exit.
428 *
429 * @param t Thread to join on exit.
430 * @param usec Timeout in microseconds.
431 * @param flags Mode of operation.
432 *
433 * @return An error code from errno.h or an error code from synch.h.
434 */
[7f1c620]435int thread_join_timeout(thread_t *t, uint32_t usec, int flags)
[fe19611]436{
437 ipl_t ipl;
438 int rc;
439
440 if (t == THREAD)
441 return EINVAL;
442
443 /*
444 * Since thread join can only be called once on an undetached thread,
445 * the thread pointer is guaranteed to be still valid.
446 */
447
448 ipl = interrupts_disable();
449 spinlock_lock(&t->lock);
450 ASSERT(!t->detached);
451 spinlock_unlock(&t->lock);
[7b3e7f4]452 interrupts_restore(ipl);
[fe19611]453
[0182a665]454 rc = waitq_sleep_timeout(&t->join_wq, usec, flags);
455
[fe19611]456 return rc;
457}
458
459/** Detach thread.
460 *
461 * Mark the thread as detached, if the thread is already in the Undead state,
462 * deallocate its resources.
463 *
464 * @param t Thread to be detached.
465 */
466void thread_detach(thread_t *t)
467{
468 ipl_t ipl;
469
470 /*
471 * Since the thread is expected to not be already detached,
472 * pointer to it must be still valid.
473 */
474 ipl = interrupts_disable();
475 spinlock_lock(&t->lock);
476 ASSERT(!t->detached);
477 if (t->state == Undead) {
478 thread_destroy(t); /* unlocks &t->lock */
479 interrupts_restore(ipl);
480 return;
481 } else {
482 t->detached = true;
483 }
484 spinlock_unlock(&t->lock);
485 interrupts_restore(ipl);
486}
487
[70527f1]488/** Thread usleep
489 *
490 * Suspend execution of the current thread.
491 *
492 * @param usec Number of microseconds to sleep.
493 *
494 */
[7f1c620]495void thread_usleep(uint32_t usec)
[f761f1eb]496{
497 waitq_t wq;
498
499 waitq_initialize(&wq);
500
[116d1ef4]501 (void) waitq_sleep_timeout(&wq, usec, SYNCH_FLAGS_NON_BLOCKING);
[f761f1eb]502}
503
[70527f1]504/** Register thread out-of-context invocation
505 *
506 * Register a function and its argument to be executed
507 * on next context switch to the current thread.
508 *
509 * @param call_me Out-of-context function.
510 * @param call_me_with Out-of-context function argument.
511 *
512 */
[f761f1eb]513void thread_register_call_me(void (* call_me)(void *), void *call_me_with)
514{
[22f7769]515 ipl_t ipl;
[f761f1eb]516
[22f7769]517 ipl = interrupts_disable();
[43114c5]518 spinlock_lock(&THREAD->lock);
519 THREAD->call_me = call_me;
520 THREAD->call_me_with = call_me_with;
521 spinlock_unlock(&THREAD->lock);
[22f7769]522 interrupts_restore(ipl);
[f761f1eb]523}
[55ab0f1]524
525/** Print list of threads debug info */
526void thread_print_list(void)
527{
528 link_t *cur;
529 ipl_t ipl;
530
531 /* Messing with thread structures, avoid deadlock */
532 ipl = interrupts_disable();
533 spinlock_lock(&threads_lock);
[cce6acf]534
535 printf("tid name address state task ctx code stack cycles cpu kst wq\n");
536 printf("------ ---------- ---------- -------- ---------- --- ---------- ---------- ---------- ---- ---------- ----------\n");
[55ab0f1]537
[016acbe]538 for (cur = threads_btree.leaf_head.next; cur != &threads_btree.leaf_head; cur = cur->next) {
539 btree_node_t *node;
540 int i;
541
542 node = list_get_instance(cur, btree_node_t, leaf_link);
543 for (i = 0; i < node->keys; i++) {
544 thread_t *t;
545
546 t = (thread_t *) node->value[i];
[cce6acf]547
548 uint64_t cycles;
549 char suffix;
550
551 if (t->cycles > 1000000000000000000LL) {
552 cycles = t->cycles / 1000000000000000000LL;
553 suffix = 'E';
554 } else if (t->cycles > 1000000000000LL) {
555 cycles = t->cycles / 1000000000000LL;
556 suffix = 'T';
557 } else if (t->cycles > 1000000LL) {
558 cycles = t->cycles / 1000000LL;
559 suffix = 'M';
560 } else {
561 cycles = t->cycles;
562 suffix = ' ';
563 }
564
565 printf("%-6zd %-10s %#10zx %-8s %#10zx %-3ld %#10zx %#10zx %9llu%c ", t->tid, t->name, t, thread_states[t->state], t->task, t->task->context, t->thread_code, t->kstack, cycles, suffix);
566
[016acbe]567 if (t->cpu)
[cce6acf]568 printf("%-4zd", t->cpu->id);
[016acbe]569 else
570 printf("none");
[cce6acf]571
572 if (t->state == Sleeping)
573 printf(" %#10zx %#10zx", t->kstack, t->sleep_queue);
574
[016acbe]575 printf("\n");
576 }
[55ab0f1]577 }
578
579 spinlock_unlock(&threads_lock);
[37c57f2]580 interrupts_restore(ipl);
[55ab0f1]581}
[9f52563]582
[016acbe]583/** Check whether thread exists.
584 *
585 * Note that threads_lock must be already held and
586 * interrupts must be already disabled.
587 *
588 * @param t Pointer to thread.
589 *
590 * @return True if thread t is known to the system, false otherwise.
591 */
592bool thread_exists(thread_t *t)
593{
594 btree_node_t *leaf;
595
[7f1c620]596 return btree_search(&threads_btree, (btree_key_t) ((uintptr_t) t), &leaf) != NULL;
[016acbe]597}
598
[cce6acf]599
600/** Update accounting of current thread.
601 *
602 * Note that thread_lock on THREAD must be already held and
603 * interrupts must be already disabled.
604 *
605 * @param t Pointer to thread.
606 *
607 */
608void thread_update_accounting(void)
609{
610 uint64_t time = get_cycle();
611 THREAD->cycles += time - THREAD->last_cycle;
612 THREAD->last_cycle = time;
613}
614
[9f52563]615/** Process syscall to create new thread.
616 *
617 */
[7f1c620]618unative_t sys_thread_create(uspace_arg_t *uspace_uarg, char *uspace_name)
[9f52563]619{
[68091bd]620 thread_t *t;
621 char namebuf[THREAD_NAME_BUFLEN];
[45fb65c]622 uspace_arg_t *kernel_uarg;
[7f1c620]623 uint32_t tid;
[e3c762cd]624 int rc;
[9f52563]625
[e3c762cd]626 rc = copy_from_uspace(namebuf, uspace_name, THREAD_NAME_BUFLEN);
627 if (rc != 0)
[7f1c620]628 return (unative_t) rc;
[0f250f9]629
630 kernel_uarg = (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0);
[e3c762cd]631 rc = copy_from_uspace(kernel_uarg, uspace_uarg, sizeof(uspace_arg_t));
632 if (rc != 0) {
633 free(kernel_uarg);
[7f1c620]634 return (unative_t) rc;
[e3c762cd]635 }
[9f52563]636
[32fffef0]637 if ((t = thread_create(uinit, kernel_uarg, TASK, THREAD_FLAG_USPACE, namebuf))) {
[9f52563]638 tid = t->tid;
[68091bd]639 thread_ready(t);
[7f1c620]640 return (unative_t) tid;
[68091bd]641 } else {
[0f250f9]642 free(kernel_uarg);
[68091bd]643 }
[9f52563]644
[7f1c620]645 return (unative_t) ENOMEM;
[9f52563]646}
647
648/** Process syscall to terminate thread.
649 *
650 */
[7f1c620]651unative_t sys_thread_exit(int uspace_status)
[9f52563]652{
[68091bd]653 thread_exit();
654 /* Unreachable */
655 return 0;
[9f52563]656}
[b45c443]657
[cc73a8a1]658/** @}
[b45c443]659 */
Note: See TracBrowser for help on using the repository browser.