WebSVN – HelenOS – Diff – /trunk/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 <proc/thread.h>
#include <proc/task.h>
#include <mm/as.h>
#include <mm/slab.h>
#include <atomic.h>
#include <synch/spinlock.h>
#include <synch/waitq.h>
#include <arch.h>
#include <arch/barrier.h>
#include <adt/avl.h>
#include <adt/btree.h>
#include <adt/list.h>
#include <ipc/ipc.h>
#include <ipc/ipcrsc.h>
#include <print.h>
#include <errno.h>
#include <func.h>
#include <string.h>
#include <syscall/copy.h>
 
/** 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 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 %" PRIu64 "\n", id);
#endif          
            task_kill(id);
            thread_usleep(10000);
        } else {
            spinlock_unlock(&tasks_lock);
            interrupts_restore(ipl);
        }
       
    } while (t != NULL);
}
 
/** Create new task with no threads.
 *
 * @param as        Task's address space.
 * @param name      Symbolic name (a copy is made).
 *
 * @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;
 
    memcpy(ta->name, name, TASK_NAME_BUFLEN);
    ta->name[TASK_NAME_BUFLEN - 1] = '\0';
 
    atomic_set(&ta->refcount, 0);
    atomic_set(&ta->lifecount, 0);
    ta->context = CONTEXT;
 
    ta->capabilities = 0;
    ta->cycles = 0;
 
#ifdef CONFIG_UDEBUG
    /* Init debugging stuff */
    udebug_task_init(&ta->udebug);
 
    /* Init kbox stuff */
    ipc_answerbox_init(&ta->kb.box, ta);
    ta->kb.thread = NULL;
    mutex_initialize(&ta->kb.cleanup_lock, MUTEX_PASSIVE);
    ta->kb.finished = false;
#endif
 
    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, MUTEX_PASSIVE);
    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;
}
 
/** Syscall for reading task ID from userspace.
 *
 * @param       uspace_task_id userspace address of 8-byte buffer
 *          where to store current task ID.
 *
 * @return      Zero 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));
}
 
/** Syscall for setting the task name.
 *
 * The name simplifies identifying the task in the task list.
 *
 * @param name  The new name for the task. (typically the same
 *      as the command used to execute it).
 *
 * @return 0 on success or an error code from @ref errno.h.
 */
unative_t sys_task_set_name(const char *uspace_name, size_t name_len)
{
    int rc;
    char namebuf[TASK_NAME_BUFLEN];
 
    /* Cap length of name and copy it from userspace. */
 
    if (name_len > TASK_NAME_BUFLEN - 1)
        name_len = TASK_NAME_BUFLEN - 1;
 
    rc = copy_from_uspace(namebuf, uspace_name, name_len);
    if (rc != 0)
        return (unative_t) rc;
 
    namebuf[name_len] = '\0';
    strncpy(TASK->name, namebuf, TASK_NAME_BUFLEN);
 
    return EOK;
}
 
/** 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.
 *
 * @return      Number of cycles used by the task and all its threads
 *          so far.
 */
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      Zero 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.
     */
    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);
 
#ifdef __32_BITS__  
    printf("%-6" PRIu64 " %-12s %-3" PRIu32 " %10p %10p %9" PRIu64
        "%c %7ld %6ld", t->taskid, t->name, t->context, t, t->as, cycles,
        suffix, atomic_get(&t->refcount), atomic_get(&t->active_calls));
#endif
 
#ifdef __64_BITS__
    printf("%-6" PRIu64 " %-12s %-3" PRIu32 " %18p %18p %9" PRIu64
        "%c %7ld %6ld", t->taskid, t->name, t->context, t, t->as, cycles,
        suffix, atomic_get(&t->refcount), atomic_get(&t->active_calls));
#endif
 
    for (j = 0; j < IPC_MAX_PHONES; j++) {
        if (t->phones[j].callee)
            printf(" %d:%p", 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);
 
#ifdef __32_BITS__  
    printf("taskid name         ctx address    as         "
        "cycles     threads calls  callee\n");
    printf("------ ------------ --- ---------- ---------- "
        "---------- ------- ------ ------>\n");
#endif
 
#ifdef __64_BITS__
    printf("taskid name         ctx address            as                 "
        "cycles     threads calls  callee\n");
    printf("------ ------------ --- ------------------ ------------------ "
        "---------- ------- ------ ------>\n");
#endif
 
    avltree_walk(&tasks_tree, task_print_walker, NULL);
 
    spinlock_unlock(&tasks_lock);
    interrupts_restore(ipl);
}
 
/** @}
 */
 

Rev 4011	Rev 4013
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 <proc/thread.h>	38	#include <proc/thread.h>
39	#include <proc/task.h>	39	#include <proc/task.h>
40	#include <mm/as.h>	40	#include <mm/as.h>
41	#include <mm/slab.h>	41	#include <mm/slab.h>
42	#include <atomic.h>	42	#include <atomic.h>
43	#include <synch/spinlock.h>	43	#include <synch/spinlock.h>
44	#include <synch/waitq.h>	44	#include <synch/waitq.h>
45	#include <arch.h>	45	#include <arch.h>
46	#include <arch/barrier.h>	46	#include <arch/barrier.h>
47	#include <adt/avl.h>	47	#include <adt/avl.h>
48	#include <adt/btree.h>	48	#include <adt/btree.h>
49	#include <adt/list.h>	49	#include <adt/list.h>
50	#include <ipc/ipc.h>	50	#include <ipc/ipc.h>
51	#include <ipc/ipcrsc.h>	51	#include <ipc/ipcrsc.h>
52	#include <print.h>	52	#include <print.h>
53	#include <errno.h>	53	#include <errno.h>
54	#include <func.h>	54	#include <func.h>
55	#include <string.h>	55	#include <string.h>
56	#include <syscall/copy.h>	56	#include <syscall/copy.h>
57		57
58	/** Spinlock protecting the tasks_tree AVL tree. */	58	/** Spinlock protecting the tasks_tree AVL tree. */
59	SPINLOCK_INITIALIZE(tasks_lock);	59	SPINLOCK_INITIALIZE(tasks_lock);
60		60
61	/** AVL tree of active tasks.	61	/** AVL tree of active tasks.
62	*	62	*
63	* The task is guaranteed to exist after it was found in the tasks_tree as	63	* The task is guaranteed to exist after it was found in the tasks_tree as
64	* long as:	64	* long as:
65	* @li the tasks_lock is held,	65	* @li the tasks_lock is held,
66	* @li the task's lock is held when task's lock is acquired before releasing	66	* @li the task's lock is held when task's lock is acquired before releasing
67	* tasks_lock or	67	* tasks_lock or
68	* @li the task's refcount is greater than 0	68	* @li the task's refcount is greater than 0
69	*	69	*
70	*/	70	*/
71	avltree_t tasks_tree;	71	avltree_t tasks_tree;
72		72
73	static task_id_t task_counter = 0;	73	static task_id_t task_counter = 0;
74		74
75	/** Initialize kernel tasks support. */	75	/** Initialize kernel tasks support. */
76	void task_init(void)	76	void task_init(void)
77	{	77	{
78	TASK = NULL;	78	TASK = NULL;
79	avltree_create(&tasks_tree);	79	avltree_create(&tasks_tree);
80	}	80	}
81		81
82	/*	82	/*
83	* The idea behind this walker is to remember a single task different from	83	* The idea behind this walker is to remember a single task different from
84	* TASK.	84	* TASK.
85	*/	85	*/
86	static bool task_done_walker(avltree_node_t node, void arg)	86	static bool task_done_walker(avltree_node_t node, void arg)
87	{	87	{
88	task_t *t = avltree_get_instance(node, task_t, tasks_tree_node);	88	task_t *t = avltree_get_instance(node, task_t, tasks_tree_node);
89	task_t tp = (task_t ) arg;	89	task_t tp = (task_t ) arg;
90		90
91	if (t != TASK) {	91	if (t != TASK) {
92	*tp = t;	92	*tp = t;
93	return false; /* stop walking */	93	return false; /* stop walking */
94	}	94	}
95		95
96	return true; /* continue the walk */	96	return true; /* continue the walk */
97	}	97	}
98		98
99	/** Kill all tasks except the current task. */	99	/** Kill all tasks except the current task. */
100	void task_done(void)	100	void task_done(void)
101	{	101	{
102	task_t *t;	102	task_t *t;
103	do { /* Repeat until there are any tasks except TASK */	103	do { /* Repeat until there are any tasks except TASK */
104		104
105	/* Messing with task structures, avoid deadlock */	105	/* Messing with task structures, avoid deadlock */
106	ipl_t ipl = interrupts_disable();	106	ipl_t ipl = interrupts_disable();
107	spinlock_lock(&tasks_lock);	107	spinlock_lock(&tasks_lock);
108		108
109	t = NULL;	109	t = NULL;
110	avltree_walk(&tasks_tree, task_done_walker, &t);	110	avltree_walk(&tasks_tree, task_done_walker, &t);
111		111
112	if (t != NULL) {	112	if (t != NULL) {
113	task_id_t id = t->taskid;	113	task_id_t id = t->taskid;
114		114
115	spinlock_unlock(&tasks_lock);	115	spinlock_unlock(&tasks_lock);
116	interrupts_restore(ipl);	116	interrupts_restore(ipl);
117		117
118	#ifdef CONFIG_DEBUG	118	#ifdef CONFIG_DEBUG
119	printf("Killing task %" PRIu64 "\n", id);	119	printf("Killing task %" PRIu64 "\n", id);
120	#endif	120	#endif
121	task_kill(id);	121	task_kill(id);
122	thread_usleep(10000);	122	thread_usleep(10000);
123	} else {	123	} else {
124	spinlock_unlock(&tasks_lock);	124	spinlock_unlock(&tasks_lock);
125	interrupts_restore(ipl);	125	interrupts_restore(ipl);
126	}	126	}
127		127
128	} while (t != NULL);	128	} while (t != NULL);
129	}	129	}
130		130
131	/** Create new task with no threads.	131	/** Create new task with no threads.
132	*	132	*
133	* @param as Task's address space.	133	* @param as Task's address space.
134	* @param name Symbolic name (a copy is made).	134	* @param name Symbolic name (a copy is made).
135	*	135	*
136	* @return New task's structure.	136	* @return New task's structure.
137	*	137	*
138	*/	138	*/
139	task_t task_create(as_t as, char *name)	139	task_t task_create(as_t as, char *name)
140	{	140	{
141	ipl_t ipl;	141	ipl_t ipl;
142	task_t *ta;	142	task_t *ta;
143	int i;	143	int i;
144		144
145	ta = (task_t *) malloc(sizeof(task_t), 0);	145	ta = (task_t *) malloc(sizeof(task_t), 0);
146		146
147	task_create_arch(ta);	147	task_create_arch(ta);
148		148
149	spinlock_initialize(&ta->lock, "task_ta_lock");	149	spinlock_initialize(&ta->lock, "task_ta_lock");
150	list_initialize(&ta->th_head);	150	list_initialize(&ta->th_head);
151	ta->as = as;	151	ta->as = as;
152		152
153	memcpy(ta->name, name, TASK_NAME_BUFLEN);	153	memcpy(ta->name, name, TASK_NAME_BUFLEN);
154	ta->name[TASK_NAME_BUFLEN - 1] = '\0';	154	ta->name[TASK_NAME_BUFLEN - 1] = '\0';
155		155
156	atomic_set(&ta->refcount, 0);	156	atomic_set(&ta->refcount, 0);
157	atomic_set(&ta->lifecount, 0);	157	atomic_set(&ta->lifecount, 0);
158	ta->context = CONTEXT;	158	ta->context = CONTEXT;
159		159
160	ta->capabilities = 0;	160	ta->capabilities = 0;
161	ta->cycles = 0;	161	ta->cycles = 0;
162		162
163	#ifdef CONFIG_UDEBUG	163	#ifdef CONFIG_UDEBUG
164	/* Init debugging stuff */	164	/* Init debugging stuff */
165	udebug_task_init(&ta->udebug);	165	udebug_task_init(&ta->udebug);
166		166
167	/* Init kbox stuff */	167	/* Init kbox stuff */
168	ipc_answerbox_init(&ta->kb.box, ta);	168	ipc_answerbox_init(&ta->kb.box, ta);
169	ta->kb.thread = NULL;	169	ta->kb.thread = NULL;
170	mutex_initialize(&ta->kb.cleanup_lock, MUTEX_PASSIVE);	170	mutex_initialize(&ta->kb.cleanup_lock, MUTEX_PASSIVE);
171	ta->kb.finished = false;	171	ta->kb.finished = false;
172	#endif	172	#endif
173		173
174	ipc_answerbox_init(&ta->answerbox, ta);	174	ipc_answerbox_init(&ta->answerbox, ta);
175	for (i = 0; i < IPC_MAX_PHONES; i++)	175	for (i = 0; i < IPC_MAX_PHONES; i++)
176	ipc_phone_init(&ta->phones[i]);	176	ipc_phone_init(&ta->phones[i]);
177	if ((ipc_phone_0) && (context_check(ipc_phone_0->task->context,	177	if ((ipc_phone_0) && (context_check(ipc_phone_0->task->context,
178	ta->context)))	178	ta->context)))
179	ipc_phone_connect(&ta->phones[0], ipc_phone_0);	179	ipc_phone_connect(&ta->phones[0], ipc_phone_0);
180	atomic_set(&ta->active_calls, 0);	180	atomic_set(&ta->active_calls, 0);
181		181
182	mutex_initialize(&ta->futexes_lock, MUTEX_PASSIVE);	182	mutex_initialize(&ta->futexes_lock, MUTEX_PASSIVE);
183	btree_create(&ta->futexes);	183	btree_create(&ta->futexes);
184		184
185	ipl = interrupts_disable();	185	ipl = interrupts_disable();
186		186
187	/*	187	/*
188	* Increment address space reference count.	188	* Increment address space reference count.
189	*/	189	*/
190	atomic_inc(&as->refcount);	190	atomic_inc(&as->refcount);
191		191
192	spinlock_lock(&tasks_lock);	192	spinlock_lock(&tasks_lock);
193	ta->taskid = ++task_counter;	193	ta->taskid = ++task_counter;
194	avltree_node_initialize(&ta->tasks_tree_node);	194	avltree_node_initialize(&ta->tasks_tree_node);
195	ta->tasks_tree_node.key = ta->taskid;	195	ta->tasks_tree_node.key = ta->taskid;
196	avltree_insert(&tasks_tree, &ta->tasks_tree_node);	196	avltree_insert(&tasks_tree, &ta->tasks_tree_node);
197	spinlock_unlock(&tasks_lock);	197	spinlock_unlock(&tasks_lock);
198	interrupts_restore(ipl);	198	interrupts_restore(ipl);
199		199
200	return ta;	200	return ta;
201	}	201	}
202		202
203	/** Destroy task.	203	/** Destroy task.
204	*	204	*
205	* @param t Task to be destroyed.	205	* @param t Task to be destroyed.
206	*/	206	*/
207	void task_destroy(task_t *t)	207	void task_destroy(task_t *t)
208	{	208	{
209	/*	209	/*
210	* Remove the task from the task B+tree.	210	* Remove the task from the task B+tree.
211	*/	211	*/
212	spinlock_lock(&tasks_lock);	212	spinlock_lock(&tasks_lock);
213	avltree_delete(&tasks_tree, &t->tasks_tree_node);	213	avltree_delete(&tasks_tree, &t->tasks_tree_node);
214	spinlock_unlock(&tasks_lock);	214	spinlock_unlock(&tasks_lock);
215		215
216	/*	216	/*
217	* Perform architecture specific task destruction.	217	* Perform architecture specific task destruction.
218	*/	218	*/
219	task_destroy_arch(t);	219	task_destroy_arch(t);
220		220
221	/*	221	/*
222	* Free up dynamically allocated state.	222	* Free up dynamically allocated state.
223	*/	223	*/
224	btree_destroy(&t->futexes);	224	btree_destroy(&t->futexes);
225		225
226	/*	226	/*
227	* Drop our reference to the address space.	227	* Drop our reference to the address space.
228	*/	228	*/
229	if (atomic_predec(&t->as->refcount) == 0)	229	if (atomic_predec(&t->as->refcount) == 0)
230	as_destroy(t->as);	230	as_destroy(t->as);
231		231
232	free(t);	232	free(t);
233	TASK = NULL;	233	TASK = NULL;
234	}	234	}
235		235
236	/** Syscall for reading task ID from userspace.	236	/** Syscall for reading task ID from userspace.
237	*	237	*
238	* @param uspace_task_id userspace address of 8-byte buffer	238	* @param uspace_task_id userspace address of 8-byte buffer
239	* where to store current task ID.	239	* where to store current task ID.
240	*	240	*
241	* @return Zero on success or an error code from @ref errno.h.	241	* @return Zero on success or an error code from @ref errno.h.
242	*/	242	*/
243	unative_t sys_task_get_id(task_id_t *uspace_task_id)	243	unative_t sys_task_get_id(task_id_t *uspace_task_id)
244	{	244	{
245	/*	245	/*
246	* No need to acquire lock on TASK because taskid remains constant for	246	* No need to acquire lock on TASK because taskid remains constant for
247	* the lifespan of the task.	247	* the lifespan of the task.
248	*/	248	*/
249	return (unative_t) copy_to_uspace(uspace_task_id, &TASK->taskid,	249	return (unative_t) copy_to_uspace(uspace_task_id, &TASK->taskid,
250	sizeof(TASK->taskid));	250	sizeof(TASK->taskid));
251	}	251	}
252		252
253	/** Syscall for setting the task name.	253	/** Syscall for setting the task name.
254	*	254	*
255	* The name simplifies identifying the task in the task list.	255	* The name simplifies identifying the task in the task list.
256	*	256	*
257	* @param name The new name for the task. (typically the same	257	* @param name The new name for the task. (typically the same
258	* as the command used to execute it).	258	* as the command used to execute it).
259	*	259	*
260	* @return 0 on success or an error code from @ref errno.h.	260	* @return 0 on success or an error code from @ref errno.h.
261	*/	261	*/
262	unative_t sys_task_set_name(const char *uspace_name, size_t name_len)	262	unative_t sys_task_set_name(const char *uspace_name, size_t name_len)
263	{	263	{
264	int rc;	264	int rc;
265	char namebuf[TASK_NAME_BUFLEN];	265	char namebuf[TASK_NAME_BUFLEN];
266		266
267	/* Cap length of name and copy it from userspace. */	267	/* Cap length of name and copy it from userspace. */
268		268
269	if (name_len > TASK_NAME_BUFLEN - 1)	269	if (name_len > TASK_NAME_BUFLEN - 1)
270	name_len = TASK_NAME_BUFLEN - 1;	270	name_len = TASK_NAME_BUFLEN - 1;
271		271
272	rc = copy_from_uspace(namebuf, uspace_name, name_len);	272	rc = copy_from_uspace(namebuf, uspace_name, name_len);
273	if (rc != 0)	273	if (rc != 0)
274	return (unative_t) rc;	274	return (unative_t) rc;
275		275
276	namebuf[name_len] = '\0';	276	namebuf[name_len] = '\0';
277	strcpy(TASK->name, namebuf);	277	strncpy(TASK->name, namebuf, TASK_NAME_BUFLEN);
278		278
279	return EOK;	279	return EOK;
280	}	280	}
281		281
282	/** Find task structure corresponding to task ID.	282	/** Find task structure corresponding to task ID.
283	*	283	*
284	* The tasks_lock must be already held by the caller of this function and	284	* The tasks_lock must be already held by the caller of this function and
285	* interrupts must be disabled.	285	* interrupts must be disabled.
286	*	286	*
287	* @param id Task ID.	287	* @param id Task ID.
288	*	288	*
289	* @return Task structure address or NULL if there is no such task	289	* @return Task structure address or NULL if there is no such task
290	* ID.	290	* ID.
291	*/	291	*/
292	task_t task_find_by_id(task_id_t id) { avltree_node_t node;	292	task_t task_find_by_id(task_id_t id) { avltree_node_t node;
293		293
294	node = avltree_search(&tasks_tree, (avltree_key_t) id);	294	node = avltree_search(&tasks_tree, (avltree_key_t) id);
295		295
296	if (node)	296	if (node)
297	return avltree_get_instance(node, task_t, tasks_tree_node);	297	return avltree_get_instance(node, task_t, tasks_tree_node);
298	return NULL;	298	return NULL;
299	}	299	}
300		300
301	/** Get accounting data of given task.	301	/** Get accounting data of given task.
302	*	302	*
303	* Note that task lock of 't' must be already held and interrupts must be	303	* Note that task lock of 't' must be already held and interrupts must be
304	* already disabled.	304	* already disabled.
305	*	305	*
306	* @param t Pointer to thread.	306	* @param t Pointer to thread.
307	*	307	*
308	* @return Number of cycles used by the task and all its threads	308	* @return Number of cycles used by the task and all its threads
309	* so far.	309	* so far.
310	*/	310	*/
311	uint64_t task_get_accounting(task_t *t)	311	uint64_t task_get_accounting(task_t *t)
312	{	312	{
313	/* Accumulated value of task */	313	/* Accumulated value of task */
314	uint64_t ret = t->cycles;	314	uint64_t ret = t->cycles;
315		315
316	/* Current values of threads */	316	/* Current values of threads */
317	link_t *cur;	317	link_t *cur;
318	for (cur = t->th_head.next; cur != &t->th_head; cur = cur->next) {	318	for (cur = t->th_head.next; cur != &t->th_head; cur = cur->next) {
319	thread_t *thr = list_get_instance(cur, thread_t, th_link);	319	thread_t *thr = list_get_instance(cur, thread_t, th_link);
320		320
321	spinlock_lock(&thr->lock);	321	spinlock_lock(&thr->lock);
322	/* Process only counted threads */	322	/* Process only counted threads */
323	if (!thr->uncounted) {	323	if (!thr->uncounted) {
324	if (thr == THREAD) {	324	if (thr == THREAD) {
325	/* Update accounting of current thread */	325	/* Update accounting of current thread */
326	thread_update_accounting();	326	thread_update_accounting();
327	}	327	}
328	ret += thr->cycles;	328	ret += thr->cycles;
329	}	329	}
330	spinlock_unlock(&thr->lock);	330	spinlock_unlock(&thr->lock);
331	}	331	}
332		332
333	return ret;	333	return ret;
334	}	334	}
335		335
336	/** Kill task.	336	/** Kill task.
337	*	337	*
338	* This function is idempotent.	338	* This function is idempotent.
339	* It signals all the task's threads to bail it out.	339	* It signals all the task's threads to bail it out.
340	*	340	*
341	* @param id ID of the task to be killed.	341	* @param id ID of the task to be killed.
342	*	342	*
343	* @return Zero on success or an error code from errno.h.	343	* @return Zero on success or an error code from errno.h.
344	*/	344	*/
345	int task_kill(task_id_t id)	345	int task_kill(task_id_t id)
346	{	346	{
347	ipl_t ipl;	347	ipl_t ipl;
348	task_t *ta;	348	task_t *ta;
349	link_t *cur;	349	link_t *cur;
350		350
351	if (id == 1)	351	if (id == 1)
352	return EPERM;	352	return EPERM;
353		353
354	ipl = interrupts_disable();	354	ipl = interrupts_disable();
355	spinlock_lock(&tasks_lock);	355	spinlock_lock(&tasks_lock);
356	if (!(ta = task_find_by_id(id))) {	356	if (!(ta = task_find_by_id(id))) {
357	spinlock_unlock(&tasks_lock);	357	spinlock_unlock(&tasks_lock);
358	interrupts_restore(ipl);	358	interrupts_restore(ipl);
359	return ENOENT;	359	return ENOENT;
360	}	360	}
361	spinlock_unlock(&tasks_lock);	361	spinlock_unlock(&tasks_lock);
362		362
363	/*	363	/*
364	* Interrupt all threads.	364	* Interrupt all threads.
365	*/	365	*/
366	spinlock_lock(&ta->lock);	366	spinlock_lock(&ta->lock);
367	for (cur = ta->th_head.next; cur != &ta->th_head; cur = cur->next) {	367	for (cur = ta->th_head.next; cur != &ta->th_head; cur = cur->next) {
368	thread_t *thr;	368	thread_t *thr;
369	bool sleeping = false;	369	bool sleeping = false;
370		370
371	thr = list_get_instance(cur, thread_t, th_link);	371	thr = list_get_instance(cur, thread_t, th_link);
372		372
373	spinlock_lock(&thr->lock);	373	spinlock_lock(&thr->lock);
374	thr->interrupted = true;	374	thr->interrupted = true;
375	if (thr->state == Sleeping)	375	if (thr->state == Sleeping)
376	sleeping = true;	376	sleeping = true;
377	spinlock_unlock(&thr->lock);	377	spinlock_unlock(&thr->lock);
378		378
379	if (sleeping)	379	if (sleeping)
380	waitq_interrupt_sleep(thr);	380	waitq_interrupt_sleep(thr);
381	}	381	}
382	spinlock_unlock(&ta->lock);	382	spinlock_unlock(&ta->lock);
383	interrupts_restore(ipl);	383	interrupts_restore(ipl);
384		384
385	return 0;	385	return 0;
386	}	386	}
387		387
388	static bool task_print_walker(avltree_node_t node, void arg)	388	static bool task_print_walker(avltree_node_t node, void arg)
389	{	389	{
390	task_t *t = avltree_get_instance(node, task_t, tasks_tree_node);	390	task_t *t = avltree_get_instance(node, task_t, tasks_tree_node);
391	int j;	391	int j;
392		392
393	spinlock_lock(&t->lock);	393	spinlock_lock(&t->lock);
394		394
395	uint64_t cycles;	395	uint64_t cycles;
396	char suffix;	396	char suffix;
397	order(task_get_accounting(t), &cycles, &suffix);	397	order(task_get_accounting(t), &cycles, &suffix);
398		398
399	#ifdef __32_BITS__	399	#ifdef __32_BITS__
400	printf("%-6" PRIu64 " %-12s %-3" PRIu32 " %10p %10p %9" PRIu64	400	printf("%-6" PRIu64 " %-12s %-3" PRIu32 " %10p %10p %9" PRIu64
401	"%c %7ld %6ld", t->taskid, t->name, t->context, t, t->as, cycles,	401	"%c %7ld %6ld", t->taskid, t->name, t->context, t, t->as, cycles,
402	suffix, atomic_get(&t->refcount), atomic_get(&t->active_calls));	402	suffix, atomic_get(&t->refcount), atomic_get(&t->active_calls));
403	#endif	403	#endif
404		404
405	#ifdef __64_BITS__	405	#ifdef __64_BITS__
406	printf("%-6" PRIu64 " %-12s %-3" PRIu32 " %18p %18p %9" PRIu64	406	printf("%-6" PRIu64 " %-12s %-3" PRIu32 " %18p %18p %9" PRIu64
407	"%c %7ld %6ld", t->taskid, t->name, t->context, t, t->as, cycles,	407	"%c %7ld %6ld", t->taskid, t->name, t->context, t, t->as, cycles,
408	suffix, atomic_get(&t->refcount), atomic_get(&t->active_calls));	408	suffix, atomic_get(&t->refcount), atomic_get(&t->active_calls));
409	#endif	409	#endif
410		410
411	for (j = 0; j < IPC_MAX_PHONES; j++) {	411	for (j = 0; j < IPC_MAX_PHONES; j++) {
412	if (t->phones[j].callee)	412	if (t->phones[j].callee)
413	printf(" %d:%p", j, t->phones[j].callee);	413	printf(" %d:%p", j, t->phones[j].callee);
414	}	414	}
415	printf("\n");	415	printf("\n");
416		416
417	spinlock_unlock(&t->lock);	417	spinlock_unlock(&t->lock);
418	return true;	418	return true;
419	}	419	}
420		420
421	/** Print task list */	421	/** Print task list */
422	void task_print_list(void)	422	void task_print_list(void)
423	{	423	{
424	ipl_t ipl;	424	ipl_t ipl;
425		425
426	/* Messing with task structures, avoid deadlock */	426	/* Messing with task structures, avoid deadlock */
427	ipl = interrupts_disable();	427	ipl = interrupts_disable();
428	spinlock_lock(&tasks_lock);	428	spinlock_lock(&tasks_lock);
429		429
430	#ifdef __32_BITS__	430	#ifdef __32_BITS__
431	printf("taskid name ctx address as "	431	printf("taskid name ctx address as "
432	"cycles threads calls callee\n");	432	"cycles threads calls callee\n");
433	printf("------ ------------ --- ---------- ---------- "	433	printf("------ ------------ --- ---------- ---------- "
434	"---------- ------- ------ ------>\n");	434	"---------- ------- ------ ------>\n");
435	#endif	435	#endif
436		436
437	#ifdef __64_BITS__	437	#ifdef __64_BITS__
438	printf("taskid name ctx address as "	438	printf("taskid name ctx address as "
439	"cycles threads calls callee\n");	439	"cycles threads calls callee\n");
440	printf("------ ------------ --- ------------------ ------------------ "	440	printf("------ ------------ --- ------------------ ------------------ "
441	"---------- ------- ------ ------>\n");	441	"---------- ------- ------ ------>\n");
442	#endif	442	#endif
443		443
444	avltree_walk(&tasks_tree, task_print_walker, NULL);	444	avltree_walk(&tasks_tree, task_print_walker, NULL);
445		445
446	spinlock_unlock(&tasks_lock);	446	spinlock_unlock(&tasks_lock);
447	interrupts_restore(ipl);	447	interrupts_restore(ipl);
448	}	448	}
449		449
450	/** @}	450	/** @}
451	*/	451	*/
452		452

Subversion Repositories HelenOS

(root)/trunk/kernel/generic/src/proc/task.c – Rev 4011 → 4013