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

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since 9a1b20c was 9a1b20c, checked in by Jiri Svoboda <jirik.svoboda@…>, 17 years ago

Merge syscall tracer (trace) and relevant part of udebug interface from tracing to trunk.

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