Rev 2042 | Rev 2067 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
1 | jermar | 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 | |||
1757 | jermar | 29 | /** @addtogroup genericproc |
1702 | cejka | 30 | * @{ |
31 | */ |
||
32 | |||
1248 | jermar | 33 | /** |
1702 | cejka | 34 | * @file |
1248 | jermar | 35 | * @brief Thread management functions. |
36 | */ |
||
37 | |||
1 | jermar | 38 | #include <proc/scheduler.h> |
39 | #include <proc/thread.h> |
||
40 | #include <proc/task.h> |
||
1078 | jermar | 41 | #include <proc/uarg.h> |
1 | jermar | 42 | #include <mm/frame.h> |
43 | #include <mm/page.h> |
||
44 | #include <arch/asm.h> |
||
2030 | decky | 45 | #include <arch/cycle.h> |
1 | jermar | 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> |
||
1158 | jermar | 54 | #include <adt/btree.h> |
788 | jermar | 55 | #include <adt/list.h> |
1 | jermar | 56 | #include <typedefs.h> |
57 | #include <time/clock.h> |
||
7 | jermar | 58 | #include <config.h> |
59 | #include <arch/interrupt.h> |
||
10 | jermar | 60 | #include <smp/ipi.h> |
76 | jermar | 61 | #include <arch/faddr.h> |
1104 | jermar | 62 | #include <atomic.h> |
195 | vana | 63 | #include <memstr.h> |
777 | palkovsky | 64 | #include <print.h> |
787 | palkovsky | 65 | #include <mm/slab.h> |
66 | #include <debug.h> |
||
1066 | jermar | 67 | #include <main/uinit.h> |
1288 | jermar | 68 | #include <syscall/copy.h> |
69 | #include <errno.h> |
||
7 | jermar | 70 | |
1 | jermar | 71 | |
1571 | jermar | 72 | /** Thread states */ |
73 | char *thread_states[] = { |
||
74 | "Invalid", |
||
75 | "Running", |
||
76 | "Sleeping", |
||
77 | "Ready", |
||
78 | "Entering", |
||
79 | "Exiting", |
||
80 | "Undead" |
||
81 | }; |
||
82 | |||
1636 | jermar | 83 | /** Lock protecting the threads_btree B+tree. For locking rules, see declaration thereof. */ |
1158 | jermar | 84 | SPINLOCK_INITIALIZE(threads_lock); |
1 | jermar | 85 | |
1636 | jermar | 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 | */ |
||
91 | btree_t threads_btree; |
||
92 | |||
623 | jermar | 93 | SPINLOCK_INITIALIZE(tidlock); |
1780 | jermar | 94 | uint32_t last_tid = 0; |
1 | jermar | 95 | |
787 | palkovsky | 96 | static slab_cache_t *thread_slab; |
906 | palkovsky | 97 | #ifdef ARCH_HAS_FPU |
98 | slab_cache_t *fpu_context_slab; |
||
99 | #endif |
||
107 | decky | 100 | |
101 | /** Thread wrapper |
||
102 | * |
||
103 | * This wrapper is provided to ensure that every thread |
||
1 | jermar | 104 | * makes a call to thread_exit() when its implementing |
105 | * function returns. |
||
106 | * |
||
413 | jermar | 107 | * interrupts_disable() is assumed. |
107 | decky | 108 | * |
1 | jermar | 109 | */ |
452 | decky | 110 | static void cushion(void) |
1 | jermar | 111 | { |
15 | jermar | 112 | void (*f)(void *) = THREAD->thread_code; |
113 | void *arg = THREAD->thread_arg; |
||
2032 | decky | 114 | THREAD->last_cycle = get_cycle(); |
1 | jermar | 115 | |
2039 | decky | 116 | /* This is where each thread wakes up after its creation */ |
15 | jermar | 117 | spinlock_unlock(&THREAD->lock); |
413 | jermar | 118 | interrupts_enable(); |
1 | jermar | 119 | |
120 | f(arg); |
||
2039 | decky | 121 | |
122 | /* Accumulate accounting to the task */ |
||
123 | ipl_t ipl = interrupts_disable(); |
||
124 | |||
125 | spinlock_lock(&THREAD->lock); |
||
2042 | decky | 126 | if (!THREAD->uncounted) { |
127 | thread_update_accounting(); |
||
128 | uint64_t cycles = THREAD->cycles; |
||
129 | THREAD->cycles = 0; |
||
130 | spinlock_unlock(&THREAD->lock); |
||
131 | |||
132 | spinlock_lock(&TASK->lock); |
||
133 | TASK->cycles += cycles; |
||
134 | spinlock_unlock(&TASK->lock); |
||
135 | } else |
||
136 | spinlock_unlock(&THREAD->lock); |
||
2039 | decky | 137 | |
138 | interrupts_restore(ipl); |
||
139 | |||
1 | jermar | 140 | thread_exit(); |
141 | /* not reached */ |
||
142 | } |
||
143 | |||
787 | palkovsky | 144 | /** Initialization and allocation for thread_t structure */ |
145 | static int thr_constructor(void *obj, int kmflags) |
||
146 | { |
||
1820 | decky | 147 | thread_t *t = (thread_t *) obj; |
107 | decky | 148 | |
787 | palkovsky | 149 | spinlock_initialize(&t->lock, "thread_t_lock"); |
150 | link_initialize(&t->rq_link); |
||
151 | link_initialize(&t->wq_link); |
||
152 | link_initialize(&t->th_link); |
||
1854 | jermar | 153 | |
154 | /* call the architecture-specific part of the constructor */ |
||
155 | thr_constructor_arch(t); |
||
787 | palkovsky | 156 | |
906 | palkovsky | 157 | #ifdef ARCH_HAS_FPU |
158 | # ifdef CONFIG_FPU_LAZY |
||
159 | t->saved_fpu_context = NULL; |
||
160 | # else |
||
161 | t->saved_fpu_context = slab_alloc(fpu_context_slab,kmflags); |
||
162 | if (!t->saved_fpu_context) |
||
163 | return -1; |
||
164 | # endif |
||
165 | #endif |
||
166 | |||
1766 | palkovsky | 167 | t->kstack = frame_alloc(STACK_FRAMES, FRAME_KA | kmflags); |
168 | if (! t->kstack) { |
||
906 | palkovsky | 169 | #ifdef ARCH_HAS_FPU |
170 | if (t->saved_fpu_context) |
||
171 | slab_free(fpu_context_slab,t->saved_fpu_context); |
||
172 | #endif |
||
842 | palkovsky | 173 | return -1; |
906 | palkovsky | 174 | } |
787 | palkovsky | 175 | |
176 | return 0; |
||
177 | } |
||
178 | |||
179 | /** Destruction of thread_t object */ |
||
180 | static int thr_destructor(void *obj) |
||
181 | { |
||
1820 | decky | 182 | thread_t *t = (thread_t *) obj; |
787 | palkovsky | 183 | |
1854 | jermar | 184 | /* call the architecture-specific part of the destructor */ |
185 | thr_destructor_arch(t); |
||
186 | |||
1760 | palkovsky | 187 | frame_free(KA2PA(t->kstack)); |
906 | palkovsky | 188 | #ifdef ARCH_HAS_FPU |
189 | if (t->saved_fpu_context) |
||
190 | slab_free(fpu_context_slab,t->saved_fpu_context); |
||
191 | #endif |
||
787 | palkovsky | 192 | return 1; /* One page freed */ |
193 | } |
||
194 | |||
107 | decky | 195 | /** Initialize threads |
196 | * |
||
197 | * Initialize kernel threads support. |
||
198 | * |
||
199 | */ |
||
1 | jermar | 200 | void thread_init(void) |
201 | { |
||
15 | jermar | 202 | THREAD = NULL; |
625 | palkovsky | 203 | atomic_set(&nrdy,0); |
787 | palkovsky | 204 | thread_slab = slab_cache_create("thread_slab", |
205 | sizeof(thread_t),0, |
||
206 | thr_constructor, thr_destructor, 0); |
||
906 | palkovsky | 207 | #ifdef ARCH_HAS_FPU |
208 | fpu_context_slab = slab_cache_create("fpu_slab", |
||
209 | sizeof(fpu_context_t), |
||
210 | FPU_CONTEXT_ALIGN, |
||
211 | NULL, NULL, 0); |
||
212 | #endif |
||
1158 | jermar | 213 | |
214 | btree_create(&threads_btree); |
||
1 | jermar | 215 | } |
216 | |||
107 | decky | 217 | /** Make thread ready |
218 | * |
||
219 | * Switch thread t to the ready state. |
||
220 | * |
||
221 | * @param t Thread to make ready. |
||
222 | * |
||
223 | */ |
||
1 | jermar | 224 | void thread_ready(thread_t *t) |
225 | { |
||
226 | cpu_t *cpu; |
||
227 | runq_t *r; |
||
413 | jermar | 228 | ipl_t ipl; |
625 | palkovsky | 229 | int i, avg; |
1 | jermar | 230 | |
413 | jermar | 231 | ipl = interrupts_disable(); |
1 | jermar | 232 | |
233 | spinlock_lock(&t->lock); |
||
234 | |||
1086 | palkovsky | 235 | ASSERT(! (t->state == Ready)); |
236 | |||
413 | jermar | 237 | i = (t->priority < RQ_COUNT -1) ? ++t->priority : t->priority; |
1 | jermar | 238 | |
16 | jermar | 239 | cpu = CPU; |
1854 | jermar | 240 | if (t->flags & THREAD_FLAG_WIRED) { |
1 | jermar | 241 | cpu = t->cpu; |
242 | } |
||
1083 | palkovsky | 243 | t->state = Ready; |
1 | jermar | 244 | spinlock_unlock(&t->lock); |
245 | |||
107 | decky | 246 | /* |
1 | jermar | 247 | * Append t to respective ready queue on respective processor. |
248 | */ |
||
249 | r = &cpu->rq[i]; |
||
250 | spinlock_lock(&r->lock); |
||
251 | list_append(&t->rq_link, &r->rq_head); |
||
252 | r->n++; |
||
253 | spinlock_unlock(&r->lock); |
||
254 | |||
475 | jermar | 255 | atomic_inc(&nrdy); |
625 | palkovsky | 256 | avg = atomic_get(&nrdy) / config.cpu_active; |
783 | palkovsky | 257 | atomic_inc(&cpu->nrdy); |
1 | jermar | 258 | |
413 | jermar | 259 | interrupts_restore(ipl); |
1 | jermar | 260 | } |
261 | |||
787 | palkovsky | 262 | /** Destroy thread memory structure |
263 | * |
||
264 | * Detach thread from all queues, cpus etc. and destroy it. |
||
265 | * |
||
266 | * Assume thread->lock is held!! |
||
267 | */ |
||
268 | void thread_destroy(thread_t *t) |
||
269 | { |
||
1579 | jermar | 270 | bool destroy_task = false; |
271 | |||
1581 | jermar | 272 | ASSERT(t->state == Exiting || t->state == Undead); |
787 | palkovsky | 273 | ASSERT(t->task); |
274 | ASSERT(t->cpu); |
||
275 | |||
276 | spinlock_lock(&t->cpu->lock); |
||
277 | if(t->cpu->fpu_owner==t) |
||
278 | t->cpu->fpu_owner=NULL; |
||
279 | spinlock_unlock(&t->cpu->lock); |
||
280 | |||
1579 | jermar | 281 | spinlock_unlock(&t->lock); |
282 | |||
283 | spinlock_lock(&threads_lock); |
||
1780 | jermar | 284 | btree_remove(&threads_btree, (btree_key_t) ((uintptr_t ) t), NULL); |
1579 | jermar | 285 | spinlock_unlock(&threads_lock); |
286 | |||
787 | palkovsky | 287 | /* |
288 | * Detach from the containing task. |
||
289 | */ |
||
290 | spinlock_lock(&t->task->lock); |
||
291 | list_remove(&t->th_link); |
||
1579 | jermar | 292 | if (--t->task->refcount == 0) { |
293 | t->task->accept_new_threads = false; |
||
294 | destroy_task = true; |
||
295 | } |
||
296 | spinlock_unlock(&t->task->lock); |
||
787 | palkovsky | 297 | |
1579 | jermar | 298 | if (destroy_task) |
299 | task_destroy(t->task); |
||
787 | palkovsky | 300 | |
301 | slab_free(thread_slab, t); |
||
302 | } |
||
303 | |||
107 | decky | 304 | /** Create new thread |
305 | * |
||
306 | * Create a new thread. |
||
307 | * |
||
2042 | decky | 308 | * @param func Thread's implementing function. |
309 | * @param arg Thread's implementing function argument. |
||
310 | * @param task Task to which the thread belongs. |
||
311 | * @param flags Thread flags. |
||
312 | * @param name Symbolic name. |
||
313 | * @param uncounted Thread's accounting doesn't affect accumulated task accounting. |
||
107 | decky | 314 | * |
315 | * @return New thread's structure on success, NULL on failure. |
||
316 | * |
||
317 | */ |
||
2042 | decky | 318 | thread_t *thread_create(void (* func)(void *), void *arg, task_t *task, int flags, char *name, bool uncounted) |
1 | jermar | 319 | { |
320 | thread_t *t; |
||
822 | palkovsky | 321 | ipl_t ipl; |
322 | |||
787 | palkovsky | 323 | t = (thread_t *) slab_alloc(thread_slab, 0); |
842 | palkovsky | 324 | if (!t) |
325 | return NULL; |
||
1 | jermar | 326 | |
822 | palkovsky | 327 | /* Not needed, but good for debugging */ |
1820 | decky | 328 | memsetb((uintptr_t) t->kstack, THREAD_STACK_SIZE * 1 << STACK_FRAMES, 0); |
822 | palkovsky | 329 | |
330 | ipl = interrupts_disable(); |
||
331 | spinlock_lock(&tidlock); |
||
332 | t->tid = ++last_tid; |
||
333 | spinlock_unlock(&tidlock); |
||
334 | interrupts_restore(ipl); |
||
335 | |||
336 | context_save(&t->saved_context); |
||
1780 | jermar | 337 | context_set(&t->saved_context, FADDR(cushion), (uintptr_t) t->kstack, THREAD_STACK_SIZE); |
822 | palkovsky | 338 | |
339 | the_initialize((the_t *) t->kstack); |
||
340 | |||
341 | ipl = interrupts_disable(); |
||
342 | t->saved_context.ipl = interrupts_read(); |
||
343 | interrupts_restore(ipl); |
||
344 | |||
1066 | jermar | 345 | memcpy(t->name, name, THREAD_NAME_BUFLEN); |
346 | |||
822 | palkovsky | 347 | t->thread_code = func; |
348 | t->thread_arg = arg; |
||
349 | t->ticks = -1; |
||
2030 | decky | 350 | t->cycles = 0; |
2042 | decky | 351 | t->uncounted = uncounted; |
822 | palkovsky | 352 | t->priority = -1; /* start in rq[0] */ |
353 | t->cpu = NULL; |
||
1854 | jermar | 354 | t->flags = flags; |
822 | palkovsky | 355 | t->state = Entering; |
356 | t->call_me = NULL; |
||
357 | t->call_me_with = NULL; |
||
358 | |||
359 | timeout_initialize(&t->sleep_timeout); |
||
1502 | jermar | 360 | t->sleep_interruptible = false; |
822 | palkovsky | 361 | t->sleep_queue = NULL; |
362 | t->timeout_pending = 0; |
||
1288 | jermar | 363 | |
364 | t->in_copy_from_uspace = false; |
||
365 | t->in_copy_to_uspace = false; |
||
1579 | jermar | 366 | |
367 | t->interrupted = false; |
||
1661 | jermar | 368 | t->join_type = None; |
1571 | jermar | 369 | t->detached = false; |
370 | waitq_initialize(&t->join_wq); |
||
371 | |||
822 | palkovsky | 372 | t->rwlock_holder_type = RWLOCK_NONE; |
210 | decky | 373 | |
822 | palkovsky | 374 | t->task = task; |
375 | |||
860 | decky | 376 | t->fpu_context_exists = 0; |
377 | t->fpu_context_engaged = 0; |
||
1854 | jermar | 378 | |
379 | thread_create_arch(t); /* might depend on previous initialization */ |
||
822 | palkovsky | 380 | |
381 | /* |
||
1579 | jermar | 382 | * Attach to the containing task. |
383 | */ |
||
1687 | jermar | 384 | ipl = interrupts_disable(); |
1579 | jermar | 385 | spinlock_lock(&task->lock); |
386 | if (!task->accept_new_threads) { |
||
387 | spinlock_unlock(&task->lock); |
||
388 | slab_free(thread_slab, t); |
||
1687 | jermar | 389 | interrupts_restore(ipl); |
1579 | jermar | 390 | return NULL; |
391 | } |
||
392 | list_append(&t->th_link, &task->th_head); |
||
1585 | jermar | 393 | if (task->refcount++ == 0) |
394 | task->main_thread = t; |
||
1579 | jermar | 395 | spinlock_unlock(&task->lock); |
396 | |||
397 | /* |
||
822 | palkovsky | 398 | * Register this thread in the system-wide list. |
399 | */ |
||
400 | spinlock_lock(&threads_lock); |
||
1780 | jermar | 401 | btree_insert(&threads_btree, (btree_key_t) ((uintptr_t) t), (void *) t, NULL); |
822 | palkovsky | 402 | spinlock_unlock(&threads_lock); |
403 | |||
404 | interrupts_restore(ipl); |
||
860 | decky | 405 | |
1 | jermar | 406 | return t; |
407 | } |
||
408 | |||
1687 | jermar | 409 | /** Terminate thread. |
107 | decky | 410 | * |
411 | * End current thread execution and switch it to the exiting |
||
412 | * state. All pending timeouts are executed. |
||
413 | * |
||
414 | */ |
||
1 | jermar | 415 | void thread_exit(void) |
416 | { |
||
413 | jermar | 417 | ipl_t ipl; |
1 | jermar | 418 | |
419 | restart: |
||
413 | jermar | 420 | ipl = interrupts_disable(); |
15 | jermar | 421 | spinlock_lock(&THREAD->lock); |
422 | if (THREAD->timeout_pending) { /* busy waiting for timeouts in progress */ |
||
423 | spinlock_unlock(&THREAD->lock); |
||
413 | jermar | 424 | interrupts_restore(ipl); |
1 | jermar | 425 | goto restart; |
426 | } |
||
15 | jermar | 427 | THREAD->state = Exiting; |
428 | spinlock_unlock(&THREAD->lock); |
||
1 | jermar | 429 | scheduler(); |
1595 | palkovsky | 430 | |
431 | /* Not reached */ |
||
432 | while (1) |
||
433 | ; |
||
1 | jermar | 434 | } |
435 | |||
107 | decky | 436 | |
437 | /** Thread sleep |
||
438 | * |
||
439 | * Suspend execution of the current thread. |
||
440 | * |
||
441 | * @param sec Number of seconds to sleep. |
||
442 | * |
||
443 | */ |
||
1780 | jermar | 444 | void thread_sleep(uint32_t sec) |
1 | jermar | 445 | { |
125 | jermar | 446 | thread_usleep(sec*1000000); |
1 | jermar | 447 | } |
107 | decky | 448 | |
1571 | jermar | 449 | /** Wait for another thread to exit. |
450 | * |
||
451 | * @param t Thread to join on exit. |
||
452 | * @param usec Timeout in microseconds. |
||
453 | * @param flags Mode of operation. |
||
454 | * |
||
455 | * @return An error code from errno.h or an error code from synch.h. |
||
456 | */ |
||
1780 | jermar | 457 | int thread_join_timeout(thread_t *t, uint32_t usec, int flags) |
1571 | jermar | 458 | { |
459 | ipl_t ipl; |
||
460 | int rc; |
||
461 | |||
462 | if (t == THREAD) |
||
463 | return EINVAL; |
||
464 | |||
465 | /* |
||
466 | * Since thread join can only be called once on an undetached thread, |
||
467 | * the thread pointer is guaranteed to be still valid. |
||
468 | */ |
||
469 | |||
470 | ipl = interrupts_disable(); |
||
471 | spinlock_lock(&t->lock); |
||
472 | ASSERT(!t->detached); |
||
473 | spinlock_unlock(&t->lock); |
||
1687 | jermar | 474 | interrupts_restore(ipl); |
1571 | jermar | 475 | |
1687 | jermar | 476 | rc = waitq_sleep_timeout(&t->join_wq, usec, flags); |
1571 | jermar | 477 | |
478 | return rc; |
||
479 | } |
||
480 | |||
481 | /** Detach thread. |
||
482 | * |
||
483 | * Mark the thread as detached, if the thread is already in the Undead state, |
||
484 | * deallocate its resources. |
||
485 | * |
||
486 | * @param t Thread to be detached. |
||
487 | */ |
||
488 | void thread_detach(thread_t *t) |
||
489 | { |
||
490 | ipl_t ipl; |
||
491 | |||
492 | /* |
||
493 | * Since the thread is expected to not be already detached, |
||
494 | * pointer to it must be still valid. |
||
495 | */ |
||
496 | ipl = interrupts_disable(); |
||
497 | spinlock_lock(&t->lock); |
||
498 | ASSERT(!t->detached); |
||
499 | if (t->state == Undead) { |
||
500 | thread_destroy(t); /* unlocks &t->lock */ |
||
501 | interrupts_restore(ipl); |
||
502 | return; |
||
503 | } else { |
||
504 | t->detached = true; |
||
505 | } |
||
506 | spinlock_unlock(&t->lock); |
||
507 | interrupts_restore(ipl); |
||
508 | } |
||
509 | |||
107 | decky | 510 | /** Thread usleep |
511 | * |
||
512 | * Suspend execution of the current thread. |
||
513 | * |
||
514 | * @param usec Number of microseconds to sleep. |
||
515 | * |
||
516 | */ |
||
1780 | jermar | 517 | void thread_usleep(uint32_t usec) |
1 | jermar | 518 | { |
519 | waitq_t wq; |
||
520 | |||
521 | waitq_initialize(&wq); |
||
522 | |||
1502 | jermar | 523 | (void) waitq_sleep_timeout(&wq, usec, SYNCH_FLAGS_NON_BLOCKING); |
1 | jermar | 524 | } |
525 | |||
107 | decky | 526 | /** Register thread out-of-context invocation |
527 | * |
||
528 | * Register a function and its argument to be executed |
||
529 | * on next context switch to the current thread. |
||
530 | * |
||
531 | * @param call_me Out-of-context function. |
||
532 | * @param call_me_with Out-of-context function argument. |
||
533 | * |
||
534 | */ |
||
1 | jermar | 535 | void thread_register_call_me(void (* call_me)(void *), void *call_me_with) |
536 | { |
||
413 | jermar | 537 | ipl_t ipl; |
1 | jermar | 538 | |
413 | jermar | 539 | ipl = interrupts_disable(); |
15 | jermar | 540 | spinlock_lock(&THREAD->lock); |
541 | THREAD->call_me = call_me; |
||
542 | THREAD->call_me_with = call_me_with; |
||
543 | spinlock_unlock(&THREAD->lock); |
||
413 | jermar | 544 | interrupts_restore(ipl); |
1 | jermar | 545 | } |
777 | palkovsky | 546 | |
547 | /** Print list of threads debug info */ |
||
548 | void thread_print_list(void) |
||
549 | { |
||
550 | link_t *cur; |
||
551 | ipl_t ipl; |
||
552 | |||
553 | /* Messing with thread structures, avoid deadlock */ |
||
554 | ipl = interrupts_disable(); |
||
555 | spinlock_lock(&threads_lock); |
||
2030 | decky | 556 | |
2039 | decky | 557 | printf("tid name address state task ctx code stack cycles cpu kstack waitqueue\n"); |
2030 | decky | 558 | printf("------ ---------- ---------- -------- ---------- --- ---------- ---------- ---------- ---- ---------- ----------\n"); |
777 | palkovsky | 559 | |
1158 | jermar | 560 | for (cur = threads_btree.leaf_head.next; cur != &threads_btree.leaf_head; cur = cur->next) { |
561 | btree_node_t *node; |
||
562 | int i; |
||
563 | |||
564 | node = list_get_instance(cur, btree_node_t, leaf_link); |
||
565 | for (i = 0; i < node->keys; i++) { |
||
566 | thread_t *t; |
||
567 | |||
568 | t = (thread_t *) node->value[i]; |
||
2030 | decky | 569 | |
570 | uint64_t cycles; |
||
571 | char suffix; |
||
2050 | decky | 572 | order(t->cycles, &cycles, &suffix); |
2030 | decky | 573 | |
574 | 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); |
||
575 | |||
1158 | jermar | 576 | if (t->cpu) |
2030 | decky | 577 | printf("%-4zd", t->cpu->id); |
1158 | jermar | 578 | else |
579 | printf("none"); |
||
2030 | decky | 580 | |
581 | if (t->state == Sleeping) |
||
582 | printf(" %#10zx %#10zx", t->kstack, t->sleep_queue); |
||
583 | |||
1158 | jermar | 584 | printf("\n"); |
585 | } |
||
777 | palkovsky | 586 | } |
587 | |||
588 | spinlock_unlock(&threads_lock); |
||
1060 | palkovsky | 589 | interrupts_restore(ipl); |
777 | palkovsky | 590 | } |
1066 | jermar | 591 | |
1158 | jermar | 592 | /** Check whether thread exists. |
593 | * |
||
594 | * Note that threads_lock must be already held and |
||
595 | * interrupts must be already disabled. |
||
596 | * |
||
597 | * @param t Pointer to thread. |
||
598 | * |
||
599 | * @return True if thread t is known to the system, false otherwise. |
||
600 | */ |
||
601 | bool thread_exists(thread_t *t) |
||
602 | { |
||
603 | btree_node_t *leaf; |
||
604 | |||
1780 | jermar | 605 | return btree_search(&threads_btree, (btree_key_t) ((uintptr_t) t), &leaf) != NULL; |
1158 | jermar | 606 | } |
607 | |||
2030 | decky | 608 | |
609 | /** Update accounting of current thread. |
||
610 | * |
||
611 | * Note that thread_lock on THREAD must be already held and |
||
612 | * interrupts must be already disabled. |
||
613 | * |
||
614 | */ |
||
615 | void thread_update_accounting(void) |
||
616 | { |
||
617 | uint64_t time = get_cycle(); |
||
618 | THREAD->cycles += time - THREAD->last_cycle; |
||
619 | THREAD->last_cycle = time; |
||
620 | } |
||
621 | |||
1066 | jermar | 622 | /** Process syscall to create new thread. |
623 | * |
||
624 | */ |
||
1780 | jermar | 625 | unative_t sys_thread_create(uspace_arg_t *uspace_uarg, char *uspace_name) |
1066 | jermar | 626 | { |
1210 | vana | 627 | thread_t *t; |
628 | char namebuf[THREAD_NAME_BUFLEN]; |
||
1103 | jermar | 629 | uspace_arg_t *kernel_uarg; |
1780 | jermar | 630 | uint32_t tid; |
1288 | jermar | 631 | int rc; |
1066 | jermar | 632 | |
1288 | jermar | 633 | rc = copy_from_uspace(namebuf, uspace_name, THREAD_NAME_BUFLEN); |
634 | if (rc != 0) |
||
1780 | jermar | 635 | return (unative_t) rc; |
1066 | jermar | 636 | |
1078 | jermar | 637 | kernel_uarg = (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0); |
1288 | jermar | 638 | rc = copy_from_uspace(kernel_uarg, uspace_uarg, sizeof(uspace_arg_t)); |
639 | if (rc != 0) { |
||
640 | free(kernel_uarg); |
||
1780 | jermar | 641 | return (unative_t) rc; |
1288 | jermar | 642 | } |
1078 | jermar | 643 | |
2042 | decky | 644 | if ((t = thread_create(uinit, kernel_uarg, TASK, THREAD_FLAG_USPACE, namebuf, false))) { |
1066 | jermar | 645 | tid = t->tid; |
1210 | vana | 646 | thread_ready(t); |
1780 | jermar | 647 | return (unative_t) tid; |
1210 | vana | 648 | } else { |
1078 | jermar | 649 | free(kernel_uarg); |
1210 | vana | 650 | } |
1066 | jermar | 651 | |
1780 | jermar | 652 | return (unative_t) ENOMEM; |
1066 | jermar | 653 | } |
654 | |||
655 | /** Process syscall to terminate thread. |
||
656 | * |
||
657 | */ |
||
1780 | jermar | 658 | unative_t sys_thread_exit(int uspace_status) |
1066 | jermar | 659 | { |
1210 | vana | 660 | thread_exit(); |
661 | /* Unreachable */ |
||
662 | return 0; |
||
1066 | jermar | 663 | } |
1702 | cejka | 664 | |
1757 | jermar | 665 | /** @} |
1702 | cejka | 666 | */ |