WebSVN – HelenOS – Diff – /branches/tracing/kernel/generic/src/proc/task.c


/*
 * Copyright (c) 2001-2004 Jakub Jermar
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * - Redistributions of source code must retain the above copyright
 *   notice, this list of conditions and the following disclaimer.
 * - Redistributions in binary form must reproduce the above copyright
 *   notice, this list of conditions and the following disclaimer in the
 *   documentation and/or other materials provided with the distribution.
 * - The name of the author may not be used to endorse or promote products
 *   derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
 
/** @addtogroup genericproc
 * @{
 */
 
/**
 * @file
 * @brief   Task management.
 */
 
#include <main/uinit.h>
#include <proc/thread.h>
#include <proc/task.h>
#include <proc/uarg.h>
#include <mm/as.h>
#include <mm/slab.h>
#include <atomic.h>
#include <synch/spinlock.h>
#include <synch/waitq.h>
#include <arch.h>
#include <panic.h>
#include <adt/avl.h>
#include <adt/btree.h>
#include <adt/list.h>
#include <ipc/ipc.h>
#include <security/cap.h>
#include <memstr.h>
#include <print.h>
#include <lib/elf.h>
#include <errno.h>
#include <func.h>
#include <syscall/copy.h>
 
#ifndef LOADED_PROG_STACK_PAGES_NO
#define LOADED_PROG_STACK_PAGES_NO 1
#endif
 
/** Spinlock protecting the tasks_tree AVL tree. */
SPINLOCK_INITIALIZE(tasks_lock);
 
/** AVL tree of active tasks.
 *
 * The task is guaranteed to exist after it was found in the tasks_tree as
 * long as:
 * @li the tasks_lock is held,
 * @li the task's lock is held when task's lock is acquired before releasing
 *     tasks_lock or
 * @li the task's refcount is greater than 0
 *
 */
avltree_t tasks_tree;
 
static task_id_t task_counter = 0;
 
/** Initialize tasks
 *
 * Initialize kernel tasks support.
 *
 */
void task_init(void)
{
    TASK = NULL;
    avltree_create(&tasks_tree);
}
 
/*
 * The idea behind this walker is to remember a single task different from TASK.
 */
static bool task_done_walker(avltree_node_t *node, void *arg)
{
    task_t *t = avltree_get_instance(node, task_t, tasks_tree_node);
    task_t **tp = (task_t **) arg;
 
    if (t != TASK) {
        *tp = t;
        return false;   /* stop walking */
    }
 
    return true;    /* continue the walk */
}
 
/** Kill all tasks except the current task.
 *
 */
void task_done(void)
{
    task_t *t;
    do { /* Repeat until there are any tasks except TASK */
       
        /* Messing with task structures, avoid deadlock */
        ipl_t ipl = interrupts_disable();
        spinlock_lock(&tasks_lock);
       
        t = NULL;
        avltree_walk(&tasks_tree, task_done_walker, &t);
       
        if (t != NULL) {
            task_id_t id = t->taskid;
           
            spinlock_unlock(&tasks_lock);
            interrupts_restore(ipl);
           
#ifdef CONFIG_DEBUG
            printf("Killing task %llu\n", id);
#endif          
            task_kill(id);
            thread_usleep(10000);
        } else {
            spinlock_unlock(&tasks_lock);
            interrupts_restore(ipl);
        }
       
    } while (t != NULL);
}
 
/** Create new task
 *
 * Create new task with no threads.
 *
 * @param as Task's address space.
 * @param name Symbolic name.
 *
 * @return New task's structure
 *
 */
task_t *task_create(as_t *as, char *name)
{
    ipl_t ipl;
    task_t *ta;
    int i;
   
    ta = (task_t *) malloc(sizeof(task_t), 0);
 
    task_create_arch(ta);
 
    spinlock_initialize(&ta->lock, "task_ta_lock");
    list_initialize(&ta->th_head);
    ta->as = as;
    ta->name = name;
    atomic_set(&ta->refcount, 0);
    atomic_set(&ta->lifecount, 0);
    ta->context = CONTEXT;
 
    ta->capabilities = 0;
    ta->cycles = 0;
 
    /* Init debugging stuff */
    udebug_task_init(&ta->udebug);
 
    /* Init kbox stuff */
    ipc_answerbox_init(&ta->kernel_box, ta);
    ta->kb_thread = NULL;
    mutex_initialize(&ta->kb_cleanup_lock);
    ta->kb_finished = false;
 
 
    ipc_answerbox_init(&ta->answerbox, ta);
    for (i = 0; i < IPC_MAX_PHONES; i++)
        ipc_phone_init(&ta->phones[i]);
    if ((ipc_phone_0) && (context_check(ipc_phone_0->task->context,
        ta->context)))
        ipc_phone_connect(&ta->phones[0], ipc_phone_0);
    atomic_set(&ta->active_calls, 0);
 
    mutex_initialize(&ta->futexes_lock);
    btree_create(&ta->futexes);
   
    ipl = interrupts_disable();
 
    /*
     * Increment address space reference count.
     */
    atomic_inc(&as->refcount);
 
    spinlock_lock(&tasks_lock);
    ta->taskid = ++task_counter;
    avltree_node_initialize(&ta->tasks_tree_node);
    ta->tasks_tree_node.key = ta->taskid;
    avltree_insert(&tasks_tree, &ta->tasks_tree_node);
    spinlock_unlock(&tasks_lock);
    interrupts_restore(ipl);
 
    return ta;
}
 
/** Destroy task.
 *
 * @param t Task to be destroyed.
 */
void task_destroy(task_t *t)
{
    /*
     * Remove the task from the task B+tree.
     */
    spinlock_lock(&tasks_lock);
    avltree_delete(&tasks_tree, &t->tasks_tree_node);
    spinlock_unlock(&tasks_lock);
 
    /*
     * Perform architecture specific task destruction.
     */
    task_destroy_arch(t);
 
    /*
     * Free up dynamically allocated state.
     */
    btree_destroy(&t->futexes);
 
    /*
     * Drop our reference to the address space.
     */
    if (atomic_predec(&t->as->refcount) == 0)
        as_destroy(t->as);
   
    free(t);
    TASK = NULL;
}
 
/** Create new task with 1 thread and run it
 *
 * @param program_addr Address of program executable image.
 * @param name Program name.
 *
 * @return Task of the running program or NULL on error.
 */
task_t *task_run_program(void *program_addr, char *name)
{
    as_t *as;
    as_area_t *a;
    unsigned int rc;
    thread_t *t;
    task_t *task;
    uspace_arg_t *kernel_uarg;
 
    as = as_create(0);
    ASSERT(as);
 
    rc = elf_load((elf_header_t *) program_addr, as);
    if (rc != EE_OK) {
        as_destroy(as);
        return NULL;
    }
   
    kernel_uarg = (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0);
    kernel_uarg->uspace_entry =
        (void *) ((elf_header_t *) program_addr)->e_entry;
    kernel_uarg->uspace_stack = (void *) USTACK_ADDRESS;
    kernel_uarg->uspace_thread_function = NULL;
    kernel_uarg->uspace_thread_arg = NULL;
    kernel_uarg->uspace_uarg = NULL;
   
    task = task_create(as, name);
    ASSERT(task);
 
    /*
     * Create the data as_area.
     */
    a = as_area_create(as, AS_AREA_READ | AS_AREA_WRITE | AS_AREA_CACHEABLE,
        LOADED_PROG_STACK_PAGES_NO * PAGE_SIZE, USTACK_ADDRESS,
        AS_AREA_ATTR_NONE, &anon_backend, NULL);
 
    /*
     * Create the main thread.
     */
    t = thread_create(uinit, kernel_uarg, task, THREAD_FLAG_USPACE,
        "uinit", false);
    ASSERT(t);
   
    thread_ready(t);
 
    return task;
}
 
/** Syscall for reading task ID from userspace.
 *
 * @param uspace_task_id Userspace address of 8-byte buffer where to store
 * current task ID.
 *
 * @return 0 on success or an error code from @ref errno.h.
 */
unative_t sys_task_get_id(task_id_t *uspace_task_id)
{
    /*
     * No need to acquire lock on TASK because taskid
     * remains constant for the lifespan of the task.
     */
    return (unative_t) copy_to_uspace(uspace_task_id, &TASK->taskid,
        sizeof(TASK->taskid));
}
 
/** Find task structure corresponding to task ID.
 *
 * The tasks_lock must be already held by the caller of this function
 * and interrupts must be disabled.
 *
 * @param id Task ID.
 *
 * @return Task structure address or NULL if there is no such task ID.
 */
task_t *task_find_by_id(task_id_t id)
{
    avltree_node_t *node;
   
    node = avltree_search(&tasks_tree, (avltree_key_t) id);
 
    if (node)
        return avltree_get_instance(node, task_t, tasks_tree_node);
    return NULL;
}
 
/** Get accounting data of given task.
 *
 * Note that task lock of 't' must be already held and
 * interrupts must be already disabled.
 *
 * @param t Pointer to thread.
 *
 */
uint64_t task_get_accounting(task_t *t)
{
    /* Accumulated value of task */
    uint64_t ret = t->cycles;
   
    /* Current values of threads */
    link_t *cur;
    for (cur = t->th_head.next; cur != &t->th_head; cur = cur->next) {
        thread_t *thr = list_get_instance(cur, thread_t, th_link);
       
        spinlock_lock(&thr->lock);
        /* Process only counted threads */
        if (!thr->uncounted) {
            if (thr == THREAD) {
                /* Update accounting of current thread */
                thread_update_accounting();
            }
            ret += thr->cycles;
        }
        spinlock_unlock(&thr->lock);
    }
   
    return ret;
}
 
/** Kill task.
 *
 * This function is idempotent.
 * It signals all the task's threads to bail it out.
 *
 * @param id ID of the task to be killed.
 *
 * @return 0 on success or an error code from errno.h
 */
int task_kill(task_id_t id)
{
    ipl_t ipl;
    task_t *ta;
    link_t *cur;
 
    if (id == 1)
        return EPERM;
   
    ipl = interrupts_disable();
    spinlock_lock(&tasks_lock);
    if (!(ta = task_find_by_id(id))) {
        spinlock_unlock(&tasks_lock);
        interrupts_restore(ipl);
        return ENOENT;
    }
    spinlock_unlock(&tasks_lock);
   
    /*
     * Interrupt all threads except ktaskclnp.
     */
    spinlock_lock(&ta->lock);
    for (cur = ta->th_head.next; cur != &ta->th_head; cur = cur->next) {
        thread_t *thr;
        bool sleeping = false;
       
        thr = list_get_instance(cur, thread_t, th_link);
           
        spinlock_lock(&thr->lock);
        thr->interrupted = true;
        if (thr->state == Sleeping)
            sleeping = true;
        spinlock_unlock(&thr->lock);
       
        if (sleeping)
            waitq_interrupt_sleep(thr);
    }
    spinlock_unlock(&ta->lock);
    interrupts_restore(ipl);
   
    return 0;
}
 
static bool task_print_walker(avltree_node_t *node, void *arg)
{
    task_t *t = avltree_get_instance(node, task_t, tasks_tree_node);
    int j;
       
    spinlock_lock(&t->lock);
           
    uint64_t cycles;
    char suffix;
    order(task_get_accounting(t), &cycles, &suffix);
   
    if (sizeof(void *) == 4)
        printf("%-6llu %-10s %-3ld %#10zx %#10zx %9llu%c %7zd %6zd",
            t->taskid, t->name, t->context, t, t->as, cycles, suffix,
            t->refcount, atomic_get(&t->active_calls));
    else
        printf("%-6llu %-10s %-3ld %#18zx %#18zx %9llu%c %7zd %6zd",
            t->taskid, t->name, t->context, t, t->as, cycles, suffix,
            t->refcount, atomic_get(&t->active_calls));
    for (j = 0; j < IPC_MAX_PHONES; j++) {
        if (t->phones[j].callee)
            printf(" %zd:%#zx", j, t->phones[j].callee);
    }
    printf("\n");
           
    spinlock_unlock(&t->lock);
    return true;
}
 
/** Print task list */
void task_print_list(void)
{
    ipl_t ipl;
   
    /* Messing with task structures, avoid deadlock */
    ipl = interrupts_disable();
    spinlock_lock(&tasks_lock);
   
    if (sizeof(void *) == 4) {
        printf("taskid name       ctx address    as         "
            "cycles     threads calls  callee\n");
        printf("------ ---------- --- ---------- ---------- "
            "---------- ------- ------ ------>\n");
    } else {
        printf("taskid name       ctx address            as                 "
            "cycles     threads calls  callee\n");
        printf("------ ---------- --- ------------------ ------------------ "
            "---------- ------- ------ ------>\n");
    }
 
    avltree_walk(&tasks_tree, task_print_walker, NULL);
 
    spinlock_unlock(&tasks_lock);
    interrupts_restore(ipl);
}
 
/** @}
 */
 

Rev 3034	Rev 3035
1	/*	1	/*
2	* Copyright (c) 2001-2004 Jakub Jermar	2	* Copyright (c) 2001-2004 Jakub Jermar
3	* All rights reserved.	3	* All rights reserved.
4	*	4	*
5	* Redistribution and use in source and binary forms, with or without	5	* Redistribution and use in source and binary forms, with or without
6	* modification, are permitted provided that the following conditions	6	* modification, are permitted provided that the following conditions
7	* are met:	7	* are met:
8	*	8	*
9	* - Redistributions of source code must retain the above copyright	9	* - Redistributions of source code must retain the above copyright
10	* notice, this list of conditions and the following disclaimer.	10	* notice, this list of conditions and the following disclaimer.
11	* - Redistributions in binary form must reproduce the above copyright	11	* - Redistributions in binary form must reproduce the above copyright
12	* notice, this list of conditions and the following disclaimer in the	12	* notice, this list of conditions and the following disclaimer in the
13	* documentation and/or other materials provided with the distribution.	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	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.	15	* derived from this software without specific prior written permission.
16	*	16	*
17	* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR	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	18	* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19	* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.	19	* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20	* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,	20	* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21	* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT	21	* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22	* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,	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	23	* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24	* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT	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	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.	26	* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27	*/	27	*/
28		28
29	/** @addtogroup genericproc	29	/** @addtogroup genericproc
30	* @{	30	* @{
31	*/	31	*/
32		32
33	/**	33	/**
34	* @file	34	* @file
35	* @brief Task management.	35	* @brief Task management.
36	*/	36	*/
37		37
38	#include <main/uinit.h>	38	#include <main/uinit.h>
39	#include <proc/thread.h>	39	#include <proc/thread.h>
40	#include <proc/task.h>	40	#include <proc/task.h>
41	#include <proc/uarg.h>	41	#include <proc/uarg.h>
42	#include <mm/as.h>	42	#include <mm/as.h>
43	#include <mm/slab.h>	43	#include <mm/slab.h>
44	#include <atomic.h>	44	#include <atomic.h>
45	#include <synch/spinlock.h>	45	#include <synch/spinlock.h>
46	#include <synch/waitq.h>	46	#include <synch/waitq.h>
47	#include <arch.h>	47	#include <arch.h>
48	#include <panic.h>	48	#include <panic.h>
49	#include <adt/avl.h>	49	#include <adt/avl.h>
50	#include <adt/btree.h>	50	#include <adt/btree.h>
51	#include <adt/list.h>	51	#include <adt/list.h>
52	#include <ipc/ipc.h>	52	#include <ipc/ipc.h>
53	#include <security/cap.h>	53	#include <security/cap.h>
54	#include <memstr.h>	54	#include <memstr.h>
55	#include <print.h>	55	#include <print.h>
56	#include <lib/elf.h>	56	#include <lib/elf.h>
57	#include <errno.h>	57	#include <errno.h>
58	#include <func.h>	58	#include <func.h>
59	#include <syscall/copy.h>	59	#include <syscall/copy.h>
60		60
61	#ifndef LOADED_PROG_STACK_PAGES_NO	61	#ifndef LOADED_PROG_STACK_PAGES_NO
62	#define LOADED_PROG_STACK_PAGES_NO 1	62	#define LOADED_PROG_STACK_PAGES_NO 1
63	#endif	63	#endif
64		64
65	/** Spinlock protecting the tasks_tree AVL tree. */	65	/** Spinlock protecting the tasks_tree AVL tree. */
66	SPINLOCK_INITIALIZE(tasks_lock);	66	SPINLOCK_INITIALIZE(tasks_lock);
67		67
68	/** AVL tree of active tasks.	68	/** AVL tree of active tasks.
69	*	69	*
70	* The task is guaranteed to exist after it was found in the tasks_tree as	70	* The task is guaranteed to exist after it was found in the tasks_tree as
71	* long as:	71	* long as:
72	* @li the tasks_lock is held,	72	* @li the tasks_lock is held,
73	* @li the task's lock is held when task's lock is acquired before releasing	73	* @li the task's lock is held when task's lock is acquired before releasing
74	* tasks_lock or	74	* tasks_lock or
75	* @li the task's refcount is greater than 0	75	* @li the task's refcount is greater than 0
76	*	76	*
77	*/	77	*/
78	avltree_t tasks_tree;	78	avltree_t tasks_tree;
79		79
80	static task_id_t task_counter = 0;	80	static task_id_t task_counter = 0;
81		81
82	/** Initialize tasks	82	/** Initialize tasks
83	*	83	*
84	* Initialize kernel tasks support.	84	* Initialize kernel tasks support.
85	*	85	*
86	*/	86	*/
87	void task_init(void)	87	void task_init(void)
88	{	88	{
89	TASK = NULL;	89	TASK = NULL;
90	avltree_create(&tasks_tree);	90	avltree_create(&tasks_tree);
91	}	91	}
92		92
93	/*	93	/*
94	* The idea behind this walker is to remember a single task different from TASK.	94	* The idea behind this walker is to remember a single task different from TASK.
95	*/	95	*/
96	static bool task_done_walker(avltree_node_t node, void arg)	96	static bool task_done_walker(avltree_node_t node, void arg)
97	{	97	{
98	task_t *t = avltree_get_instance(node, task_t, tasks_tree_node);	98	task_t *t = avltree_get_instance(node, task_t, tasks_tree_node);
99	task_t tp = (task_t ) arg;	99	task_t tp = (task_t ) arg;
100		100
101	if (t != TASK) {	101	if (t != TASK) {
102	*tp = t;	102	*tp = t;
103	return false; /* stop walking */	103	return false; /* stop walking */
104	}	104	}
105		105
106	return true; /* continue the walk */	106	return true; /* continue the walk */
107	}	107	}
108		108
109	/** Kill all tasks except the current task.	109	/** Kill all tasks except the current task.
110	*	110	*
111	*/	111	*/
112	void task_done(void)	112	void task_done(void)
113	{	113	{
114	task_t *t;	114	task_t *t;
115	do { /* Repeat until there are any tasks except TASK */	115	do { /* Repeat until there are any tasks except TASK */
116		116
117	/* Messing with task structures, avoid deadlock */	117	/* Messing with task structures, avoid deadlock */
118	ipl_t ipl = interrupts_disable();	118	ipl_t ipl = interrupts_disable();
119	spinlock_lock(&tasks_lock);	119	spinlock_lock(&tasks_lock);
120		120
121	t = NULL;	121	t = NULL;
122	avltree_walk(&tasks_tree, task_done_walker, &t);	122	avltree_walk(&tasks_tree, task_done_walker, &t);
123		123
124	if (t != NULL) {	124	if (t != NULL) {
125	task_id_t id = t->taskid;	125	task_id_t id = t->taskid;
126		126
127	spinlock_unlock(&tasks_lock);	127	spinlock_unlock(&tasks_lock);
128	interrupts_restore(ipl);	128	interrupts_restore(ipl);
129		129
130	#ifdef CONFIG_DEBUG	130	#ifdef CONFIG_DEBUG
131	printf("Killing task %llu\n", id);	131	printf("Killing task %llu\n", id);
132	#endif	132	#endif
133	task_kill(id);	133	task_kill(id);
134	thread_usleep(10000);	134	thread_usleep(10000);
135	} else {	135	} else {
136	spinlock_unlock(&tasks_lock);	136	spinlock_unlock(&tasks_lock);
137	interrupts_restore(ipl);	137	interrupts_restore(ipl);
138	}	138	}
139		139
140	} while (t != NULL);	140	} while (t != NULL);
141	}	141	}
142		142
143	/** Create new task	143	/** Create new task
144	*	144	*
145	* Create new task with no threads.	145	* Create new task with no threads.
146	*	146	*
147	* @param as Task's address space.	147	* @param as Task's address space.
148	* @param name Symbolic name.	148	* @param name Symbolic name.
149	*	149	*
150	* @return New task's structure	150	* @return New task's structure
151	*	151	*
152	*/	152	*/
153	task_t task_create(as_t as, char *name)	153	task_t task_create(as_t as, char *name)
154	{	154	{
155	ipl_t ipl;	155	ipl_t ipl;
156	task_t *ta;	156	task_t *ta;
157	int i;	157	int i;
158		158
159	ta = (task_t *) malloc(sizeof(task_t), 0);	159	ta = (task_t *) malloc(sizeof(task_t), 0);
160		160
161	task_create_arch(ta);	161	task_create_arch(ta);
162		162
163	spinlock_initialize(&ta->lock, "task_ta_lock");	163	spinlock_initialize(&ta->lock, "task_ta_lock");
164	list_initialize(&ta->th_head);	164	list_initialize(&ta->th_head);
165	ta->as = as;	165	ta->as = as;
166	ta->name = name;	166	ta->name = name;
167	atomic_set(&ta->refcount, 0);	167	atomic_set(&ta->refcount, 0);
168	atomic_set(&ta->lifecount, 0);	168	atomic_set(&ta->lifecount, 0);
169	ta->context = CONTEXT;	169	ta->context = CONTEXT;
170		170
171	ta->capabilities = 0;	171	ta->capabilities = 0;
172	ta->cycles = 0;	172	ta->cycles = 0;
173		173
174	/* Init debugging stuff */	174	/* Init debugging stuff */
175	udebug_task_init(&ta->udebug);	175	udebug_task_init(&ta->udebug);
176		176
177	/* Init kbox stuff */	177	/* Init kbox stuff */
178	ipc_answerbox_init(&ta->kernel_box, ta);	178	ipc_answerbox_init(&ta->kernel_box, ta);
179	ta->kb_thread = NULL;	179	ta->kb_thread = NULL;
180	mutex_initialize(&ta->kb_cleanup_lock);	180	mutex_initialize(&ta->kb_cleanup_lock);
181	ta->kb_finished = false;	181	ta->kb_finished = false;
182	waitq_initialize(&ta->kb_thread_shutdown_wq);	-
183		182
184	ipc_answerbox_init(&ta->answerbox, ta);	183	ipc_answerbox_init(&ta->answerbox, ta);
185	for (i = 0; i < IPC_MAX_PHONES; i++)	184	for (i = 0; i < IPC_MAX_PHONES; i++)
186	ipc_phone_init(&ta->phones[i]);	185	ipc_phone_init(&ta->phones[i]);
187	if ((ipc_phone_0) && (context_check(ipc_phone_0->task->context,	186	if ((ipc_phone_0) && (context_check(ipc_phone_0->task->context,
188	ta->context)))	187	ta->context)))
189	ipc_phone_connect(&ta->phones[0], ipc_phone_0);	188	ipc_phone_connect(&ta->phones[0], ipc_phone_0);
190	atomic_set(&ta->active_calls, 0);	189	atomic_set(&ta->active_calls, 0);
191		190
192	mutex_initialize(&ta->futexes_lock);	191	mutex_initialize(&ta->futexes_lock);
193	btree_create(&ta->futexes);	192	btree_create(&ta->futexes);
194		193
195	ipl = interrupts_disable();	194	ipl = interrupts_disable();
196		195
197	/*	196	/*
198	* Increment address space reference count.	197	* Increment address space reference count.
199	*/	198	*/
200	atomic_inc(&as->refcount);	199	atomic_inc(&as->refcount);
201		200
202	spinlock_lock(&tasks_lock);	201	spinlock_lock(&tasks_lock);
203	ta->taskid = ++task_counter;	202	ta->taskid = ++task_counter;
204	avltree_node_initialize(&ta->tasks_tree_node);	203	avltree_node_initialize(&ta->tasks_tree_node);
205	ta->tasks_tree_node.key = ta->taskid;	204	ta->tasks_tree_node.key = ta->taskid;
206	avltree_insert(&tasks_tree, &ta->tasks_tree_node);	205	avltree_insert(&tasks_tree, &ta->tasks_tree_node);
207	spinlock_unlock(&tasks_lock);	206	spinlock_unlock(&tasks_lock);
208	interrupts_restore(ipl);	207	interrupts_restore(ipl);
209		208
210	return ta;	209	return ta;
211	}	210	}
212		211
213	/** Destroy task.	212	/** Destroy task.
214	*	213	*
215	* @param t Task to be destroyed.	214	* @param t Task to be destroyed.
216	*/	215	*/
217	void task_destroy(task_t *t)	216	void task_destroy(task_t *t)
218	{	217	{
219	/*	218	/*
220	* Remove the task from the task B+tree.	219	* Remove the task from the task B+tree.
221	*/	220	*/
222	spinlock_lock(&tasks_lock);	221	spinlock_lock(&tasks_lock);
223	avltree_delete(&tasks_tree, &t->tasks_tree_node);	222	avltree_delete(&tasks_tree, &t->tasks_tree_node);
224	spinlock_unlock(&tasks_lock);	223	spinlock_unlock(&tasks_lock);
225		224
226	/*	225	/*
227	* Perform architecture specific task destruction.	226	* Perform architecture specific task destruction.
228	*/	227	*/
229	task_destroy_arch(t);	228	task_destroy_arch(t);
230		229
231	/*	230	/*
232	* Free up dynamically allocated state.	231	* Free up dynamically allocated state.
233	*/	232	*/
234	btree_destroy(&t->futexes);	233	btree_destroy(&t->futexes);
235		234
236	/*	235	/*
237	* Drop our reference to the address space.	236	* Drop our reference to the address space.
238	*/	237	*/
239	if (atomic_predec(&t->as->refcount) == 0)	238	if (atomic_predec(&t->as->refcount) == 0)
240	as_destroy(t->as);	239	as_destroy(t->as);
241		240
242	free(t);	241	free(t);
243	TASK = NULL;	242	TASK = NULL;
244	}	243	}
245		244
246	/** Create new task with 1 thread and run it	245	/** Create new task with 1 thread and run it
247	*	246	*
248	* @param program_addr Address of program executable image.	247	* @param program_addr Address of program executable image.
249	* @param name Program name.	248	* @param name Program name.
250	*	249	*
251	* @return Task of the running program or NULL on error.	250	* @return Task of the running program or NULL on error.
252	*/	251	*/
253	task_t task_run_program(void program_addr, char *name)	252	task_t task_run_program(void program_addr, char *name)
254	{	253	{
255	as_t *as;	254	as_t *as;
256	as_area_t *a;	255	as_area_t *a;
257	unsigned int rc;	256	unsigned int rc;
258	thread_t *t;	257	thread_t *t;
259	task_t *task;	258	task_t *task;
260	uspace_arg_t *kernel_uarg;	259	uspace_arg_t *kernel_uarg;
261		260
262	as = as_create(0);	261	as = as_create(0);
263	ASSERT(as);	262	ASSERT(as);
264		263
265	rc = elf_load((elf_header_t *) program_addr, as);	264	rc = elf_load((elf_header_t *) program_addr, as);
266	if (rc != EE_OK) {	265	if (rc != EE_OK) {
267	as_destroy(as);	266	as_destroy(as);
268	return NULL;	267	return NULL;
269	}	268	}
270		269
271	kernel_uarg = (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0);	270	kernel_uarg = (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0);
272	kernel_uarg->uspace_entry =	271	kernel_uarg->uspace_entry =
273	(void ) ((elf_header_t ) program_addr)->e_entry;	272	(void ) ((elf_header_t ) program_addr)->e_entry;
274	kernel_uarg->uspace_stack = (void *) USTACK_ADDRESS;	273	kernel_uarg->uspace_stack = (void *) USTACK_ADDRESS;
275	kernel_uarg->uspace_thread_function = NULL;	274	kernel_uarg->uspace_thread_function = NULL;
276	kernel_uarg->uspace_thread_arg = NULL;	275	kernel_uarg->uspace_thread_arg = NULL;
277	kernel_uarg->uspace_uarg = NULL;	276	kernel_uarg->uspace_uarg = NULL;
278		277
279	task = task_create(as, name);	278	task = task_create(as, name);
280	ASSERT(task);	279	ASSERT(task);
281		280
282	/*	281	/*
283	* Create the data as_area.	282	* Create the data as_area.
284	*/	283	*/
285	a = as_area_create(as, AS_AREA_READ \| AS_AREA_WRITE \| AS_AREA_CACHEABLE,	284	a = as_area_create(as, AS_AREA_READ \| AS_AREA_WRITE \| AS_AREA_CACHEABLE,
286	LOADED_PROG_STACK_PAGES_NO * PAGE_SIZE, USTACK_ADDRESS,	285	LOADED_PROG_STACK_PAGES_NO * PAGE_SIZE, USTACK_ADDRESS,
287	AS_AREA_ATTR_NONE, &anon_backend, NULL);	286	AS_AREA_ATTR_NONE, &anon_backend, NULL);
288		287
289	/*	288	/*
290	* Create the main thread.	289	* Create the main thread.
291	*/	290	*/
292	t = thread_create(uinit, kernel_uarg, task, THREAD_FLAG_USPACE,	291	t = thread_create(uinit, kernel_uarg, task, THREAD_FLAG_USPACE,
293	"uinit", false);	292	"uinit", false);
294	ASSERT(t);	293	ASSERT(t);
295		294
296	thread_ready(t);	295	thread_ready(t);
297		296
298	return task;	297	return task;
299	}	298	}
300		299
301	/** Syscall for reading task ID from userspace.	300	/** Syscall for reading task ID from userspace.
302	*	301	*
303	* @param uspace_task_id Userspace address of 8-byte buffer where to store	302	* @param uspace_task_id Userspace address of 8-byte buffer where to store
304	* current task ID.	303	* current task ID.
305	*	304	*
306	* @return 0 on success or an error code from @ref errno.h.	305	* @return 0 on success or an error code from @ref errno.h.
307	*/	306	*/
308	unative_t sys_task_get_id(task_id_t *uspace_task_id)	307	unative_t sys_task_get_id(task_id_t *uspace_task_id)
309	{	308	{
310	/*	309	/*
311	* No need to acquire lock on TASK because taskid	310	* No need to acquire lock on TASK because taskid
312	* remains constant for the lifespan of the task.	311	* remains constant for the lifespan of the task.
313	*/	312	*/
314	return (unative_t) copy_to_uspace(uspace_task_id, &TASK->taskid,	313	return (unative_t) copy_to_uspace(uspace_task_id, &TASK->taskid,
315	sizeof(TASK->taskid));	314	sizeof(TASK->taskid));
316	}	315	}
317		316
318	/** Find task structure corresponding to task ID.	317	/** Find task structure corresponding to task ID.
319	*	318	*
320	* The tasks_lock must be already held by the caller of this function	319	* The tasks_lock must be already held by the caller of this function
321	* and interrupts must be disabled.	320	* and interrupts must be disabled.
322	*	321	*
323	* @param id Task ID.	322	* @param id Task ID.
324	*	323	*
325	* @return Task structure address or NULL if there is no such task ID.	324	* @return Task structure address or NULL if there is no such task ID.
326	*/	325	*/
327	task_t *task_find_by_id(task_id_t id)	326	task_t *task_find_by_id(task_id_t id)
328	{	327	{
329	avltree_node_t *node;	328	avltree_node_t *node;
330		329
331	node = avltree_search(&tasks_tree, (avltree_key_t) id);	330	node = avltree_search(&tasks_tree, (avltree_key_t) id);
332		331
333	if (node)	332	if (node)
334	return avltree_get_instance(node, task_t, tasks_tree_node);	333	return avltree_get_instance(node, task_t, tasks_tree_node);
335	return NULL;	334	return NULL;
336	}	335	}
337		336
338	/** Get accounting data of given task.	337	/** Get accounting data of given task.
339	*	338	*
340	* Note that task lock of 't' must be already held and	339	* Note that task lock of 't' must be already held and
341	* interrupts must be already disabled.	340	* interrupts must be already disabled.
342	*	341	*
343	* @param t Pointer to thread.	342	* @param t Pointer to thread.
344	*	343	*
345	*/	344	*/
346	uint64_t task_get_accounting(task_t *t)	345	uint64_t task_get_accounting(task_t *t)
347	{	346	{
348	/* Accumulated value of task */	347	/* Accumulated value of task */
349	uint64_t ret = t->cycles;	348	uint64_t ret = t->cycles;
350		349
351	/* Current values of threads */	350	/* Current values of threads */
352	link_t *cur;	351	link_t *cur;
353	for (cur = t->th_head.next; cur != &t->th_head; cur = cur->next) {	352	for (cur = t->th_head.next; cur != &t->th_head; cur = cur->next) {
354	thread_t *thr = list_get_instance(cur, thread_t, th_link);	353	thread_t *thr = list_get_instance(cur, thread_t, th_link);
355		354
356	spinlock_lock(&thr->lock);	355	spinlock_lock(&thr->lock);
357	/* Process only counted threads */	356	/* Process only counted threads */
358	if (!thr->uncounted) {	357	if (!thr->uncounted) {
359	if (thr == THREAD) {	358	if (thr == THREAD) {
360	/* Update accounting of current thread */	359	/* Update accounting of current thread */
361	thread_update_accounting();	360	thread_update_accounting();
362	}	361	}
363	ret += thr->cycles;	362	ret += thr->cycles;
364	}	363	}
365	spinlock_unlock(&thr->lock);	364	spinlock_unlock(&thr->lock);
366	}	365	}
367		366
368	return ret;	367	return ret;
369	}	368	}
370		369
371	/** Kill task.	370	/** Kill task.
372	*	371	*
373	* This function is idempotent.	372	* This function is idempotent.
374	* It signals all the task's threads to bail it out.	373	* It signals all the task's threads to bail it out.
375	*	374	*
376	* @param id ID of the task to be killed.	375	* @param id ID of the task to be killed.
377	*	376	*
378	* @return 0 on success or an error code from errno.h	377	* @return 0 on success or an error code from errno.h
379	*/	378	*/
380	int task_kill(task_id_t id)	379	int task_kill(task_id_t id)
381	{	380	{
382	ipl_t ipl;	381	ipl_t ipl;
383	task_t *ta;	382	task_t *ta;
384	link_t *cur;	383	link_t *cur;
385		384
386	if (id == 1)	385	if (id == 1)
387	return EPERM;	386	return EPERM;
388		387
389	ipl = interrupts_disable();	388	ipl = interrupts_disable();
390	spinlock_lock(&tasks_lock);	389	spinlock_lock(&tasks_lock);
391	if (!(ta = task_find_by_id(id))) {	390	if (!(ta = task_find_by_id(id))) {
392	spinlock_unlock(&tasks_lock);	391	spinlock_unlock(&tasks_lock);
393	interrupts_restore(ipl);	392	interrupts_restore(ipl);
394	return ENOENT;	393	return ENOENT;
395	}	394	}
396	spinlock_unlock(&tasks_lock);	395	spinlock_unlock(&tasks_lock);
397		396
398	/*	397	/*
399	* Interrupt all threads except ktaskclnp.	398	* Interrupt all threads except ktaskclnp.
400	*/	399	*/
401	spinlock_lock(&ta->lock);	400	spinlock_lock(&ta->lock);
402	for (cur = ta->th_head.next; cur != &ta->th_head; cur = cur->next) {	401	for (cur = ta->th_head.next; cur != &ta->th_head; cur = cur->next) {
403	thread_t *thr;	402	thread_t *thr;
404	bool sleeping = false;	403	bool sleeping = false;
405		404
406	thr = list_get_instance(cur, thread_t, th_link);	405	thr = list_get_instance(cur, thread_t, th_link);
407		406
408	spinlock_lock(&thr->lock);	407	spinlock_lock(&thr->lock);
409	thr->interrupted = true;	408	thr->interrupted = true;
410	if (thr->state == Sleeping)	409	if (thr->state == Sleeping)
411	sleeping = true;	410	sleeping = true;
412	spinlock_unlock(&thr->lock);	411	spinlock_unlock(&thr->lock);
413		412
414	if (sleeping)	413	if (sleeping)
415	waitq_interrupt_sleep(thr);	414	waitq_interrupt_sleep(thr);
416	}	415	}
417	spinlock_unlock(&ta->lock);	416	spinlock_unlock(&ta->lock);
418	interrupts_restore(ipl);	417	interrupts_restore(ipl);
419		418
420	return 0;	419	return 0;
421	}	420	}
422		421
423	static bool task_print_walker(avltree_node_t node, void arg)	422	static bool task_print_walker(avltree_node_t node, void arg)
424	{	423	{
425	task_t *t = avltree_get_instance(node, task_t, tasks_tree_node);	424	task_t *t = avltree_get_instance(node, task_t, tasks_tree_node);
426	int j;	425	int j;
427		426
428	spinlock_lock(&t->lock);	427	spinlock_lock(&t->lock);
429		428
430	uint64_t cycles;	429	uint64_t cycles;
431	char suffix;	430	char suffix;
432	order(task_get_accounting(t), &cycles, &suffix);	431	order(task_get_accounting(t), &cycles, &suffix);
433		432
434	if (sizeof(void *) == 4)	433	if (sizeof(void *) == 4)
435	printf("%-6llu %-10s %-3ld %#10zx %#10zx %9llu%c %7zd %6zd",	434	printf("%-6llu %-10s %-3ld %#10zx %#10zx %9llu%c %7zd %6zd",
436	t->taskid, t->name, t->context, t, t->as, cycles, suffix,	435	t->taskid, t->name, t->context, t, t->as, cycles, suffix,
437	t->refcount, atomic_get(&t->active_calls));	436	t->refcount, atomic_get(&t->active_calls));
438	else	437	else
439	printf("%-6llu %-10s %-3ld %#18zx %#18zx %9llu%c %7zd %6zd",	438	printf("%-6llu %-10s %-3ld %#18zx %#18zx %9llu%c %7zd %6zd",
440	t->taskid, t->name, t->context, t, t->as, cycles, suffix,	439	t->taskid, t->name, t->context, t, t->as, cycles, suffix,
441	t->refcount, atomic_get(&t->active_calls));	440	t->refcount, atomic_get(&t->active_calls));
442	for (j = 0; j < IPC_MAX_PHONES; j++) {	441	for (j = 0; j < IPC_MAX_PHONES; j++) {
443	if (t->phones[j].callee)	442	if (t->phones[j].callee)
444	printf(" %zd:%#zx", j, t->phones[j].callee);	443	printf(" %zd:%#zx", j, t->phones[j].callee);
445	}	444	}
446	printf("\n");	445	printf("\n");
447		446
448	spinlock_unlock(&t->lock);	447	spinlock_unlock(&t->lock);
449	return true;	448	return true;
450	}	449	}
451		450
452	/** Print task list */	451	/** Print task list */
453	void task_print_list(void)	452	void task_print_list(void)
454	{	453	{
455	ipl_t ipl;	454	ipl_t ipl;
456		455
457	/* Messing with task structures, avoid deadlock */	456	/* Messing with task structures, avoid deadlock */
458	ipl = interrupts_disable();	457	ipl = interrupts_disable();
459	spinlock_lock(&tasks_lock);	458	spinlock_lock(&tasks_lock);
460		459
461	if (sizeof(void *) == 4) {	460	if (sizeof(void *) == 4) {
462	printf("taskid name ctx address as "	461	printf("taskid name ctx address as "
463	"cycles threads calls callee\n");	462	"cycles threads calls callee\n");
464	printf("------ ---------- --- ---------- ---------- "	463	printf("------ ---------- --- ---------- ---------- "
465	"---------- ------- ------ ------>\n");	464	"---------- ------- ------ ------>\n");
466	} else {	465	} else {
467	printf("taskid name ctx address as "	466	printf("taskid name ctx address as "
468	"cycles threads calls callee\n");	467	"cycles threads calls callee\n");
469	printf("------ ---------- --- ------------------ ------------------ "	468	printf("------ ---------- --- ------------------ ------------------ "
470	"---------- ------- ------ ------>\n");	469	"---------- ------- ------ ------>\n");
471	}	470	}
472		471
473	avltree_walk(&tasks_tree, task_print_walker, NULL);	472	avltree_walk(&tasks_tree, task_print_walker, NULL);
474		473
475	spinlock_unlock(&tasks_lock);	474	spinlock_unlock(&tasks_lock);
476	interrupts_restore(ipl);	475	interrupts_restore(ipl);
477	}	476	}
478		477
479	/** @}	478	/** @}
480	*/	479	*/
481		480

Subversion Repositories HelenOS

(root)/branches/tracing/kernel/generic/src/proc/task.c – Rev 3034 → 3035