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

Subversion Repositories HelenOS

(root)/branches/sparc/kernel/generic/src/proc/task.c @ 3397 – Rev 3222 → 3343