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 <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 3186	Rev 3222
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>	-
39	#include <proc/thread.h>	38	#include <proc/thread.h>
40	#include <proc/task.h>	39	#include <proc/task.h>
41	#include <proc/uarg.h>	-
42	#include <mm/as.h>	40	#include <mm/as.h>
43	#include <mm/slab.h>	41	#include <mm/slab.h>
44	#include <atomic.h>	42	#include <atomic.h>
45	#include <synch/spinlock.h>	43	#include <synch/spinlock.h>
46	#include <synch/waitq.h>	44	#include <synch/waitq.h>
47	#include <arch.h>	45	#include <arch.h>
48	#include <arch/barrier.h>	46	#include <arch/barrier.h>
49	#include <panic.h>	-
50	#include <adt/avl.h>	47	#include <adt/avl.h>
51	#include <adt/btree.h>	48	#include <adt/btree.h>
52	#include <adt/list.h>	49	#include <adt/list.h>
53	#include <ipc/ipc.h>	50	#include <ipc/ipc.h>
54	#include <security/cap.h>	51	#include <ipc/ipcrsc.h>
55	#include <memstr.h>	-
56	#include <print.h>	52	#include <print.h>
57	#include <lib/elf.h>	-
58	#include <errno.h>	53	#include <errno.h>
59	#include <func.h>	54	#include <func.h>
60	#include <syscall/copy.h>	55	#include <syscall/copy.h>
61		56
62	#ifndef LOADED_PROG_STACK_PAGES_NO	-
63	#define LOADED_PROG_STACK_PAGES_NO 1	-
64	#endif	-
65		-
66	/** Spinlock protecting the tasks_tree AVL tree. */	57	/** Spinlock protecting the tasks_tree AVL tree. */
67	SPINLOCK_INITIALIZE(tasks_lock);	58	SPINLOCK_INITIALIZE(tasks_lock);
68		59
69	/** AVL tree of active tasks.	60	/** AVL tree of active tasks.
70	*	61	*
71	* 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
72	* long as:	63	* long as:
73	* @li the tasks_lock is held,	64	* @li the tasks_lock is held,
74	* @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
75	* tasks_lock or	66	* tasks_lock or
76	* @li the task's refcount is greater than 0	67	* @li the task's refcount is greater than 0
77	*	68	*
78	*/	69	*/
79	avltree_t tasks_tree;	70	avltree_t tasks_tree;
80		71
81	static task_id_t task_counter = 0;	72	static task_id_t task_counter = 0;
82		73
83	/** Initialize tasks	74	/** Initialize tasks
84	*	75	*
85	* Initialize kernel tasks support.	76	* Initialize kernel tasks support.
86	*	77	*
87	*/	78	*/
88	void task_init(void)	79	void task_init(void)
89	{	80	{
90	TASK = NULL;	81	TASK = NULL;
91	avltree_create(&tasks_tree);	82	avltree_create(&tasks_tree);
92	}	83	}
93		84
94	/*	85	/*
95	* 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.
96	*/	87	*/
97	static bool task_done_walker(avltree_node_t node, void arg)	88	static bool task_done_walker(avltree_node_t node, void arg)
98	{	89	{
99	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);
100	task_t tp = (task_t ) arg;	91	task_t tp = (task_t ) arg;
101		92
102	if (t != TASK) {	93	if (t != TASK) {
103	*tp = t;	94	*tp = t;
104	return false; /* stop walking */	95	return false; /* stop walking */
105	}	96	}
106		97
107	return true; /* continue the walk */	98	return true; /* continue the walk */
108	}	99	}
109		100
110	/** Kill all tasks except the current task.	101	/** Kill all tasks except the current task.
111	*	102	*
112	*/	103	*/
113	void task_done(void)	104	void task_done(void)
114	{	105	{
115	task_t *t;	106	task_t *t;
116	do { /* Repeat until there are any tasks except TASK */	107	do { /* Repeat until there are any tasks except TASK */
117		108
118	/* Messing with task structures, avoid deadlock */	109	/* Messing with task structures, avoid deadlock */
119	ipl_t ipl = interrupts_disable();	110	ipl_t ipl = interrupts_disable();
120	spinlock_lock(&tasks_lock);	111	spinlock_lock(&tasks_lock);
121		112
122	t = NULL;	113	t = NULL;
123	avltree_walk(&tasks_tree, task_done_walker, &t);	114	avltree_walk(&tasks_tree, task_done_walker, &t);
124		115
125	if (t != NULL) {	116	if (t != NULL) {
126	task_id_t id = t->taskid;	117	task_id_t id = t->taskid;
127		118
128	spinlock_unlock(&tasks_lock);	119	spinlock_unlock(&tasks_lock);
129	interrupts_restore(ipl);	120	interrupts_restore(ipl);
130		121
131	#ifdef CONFIG_DEBUG	122	#ifdef CONFIG_DEBUG
132	printf("Killing task %" PRIu64 "\n", id);	123	printf("Killing task %" PRIu64 "\n", id);
133	#endif	124	#endif
134	task_kill(id);	125	task_kill(id);
135	thread_usleep(10000);	126	thread_usleep(10000);
136	} else {	127	} else {
137	spinlock_unlock(&tasks_lock);	128	spinlock_unlock(&tasks_lock);
138	interrupts_restore(ipl);	129	interrupts_restore(ipl);
139	}	130	}
140		131
141	} while (t != NULL);	132	} while (t != NULL);
142	}	133	}
143		134
144	/** Create new task	135	/** Create new task
145	*	136	*
146	* Create new task with no threads.	137	* Create new task with no threads.
147	*	138	*
148	* @param as Task's address space.	139	* @param as Task's address space.
149	* @param name Symbolic name.	140	* @param name Symbolic name.
150	*	141	*
151	* @return New task's structure	142	* @return New task's structure
152	*	143	*
153	*/	144	*/
154	task_t task_create(as_t as, char *name)	145	task_t task_create(as_t as, char *name)
155	{	146	{
156	ipl_t ipl;	147	ipl_t ipl;
157	task_t *ta;	148	task_t *ta;
158	int i;	149	int i;
159		150
160	ta = (task_t *) malloc(sizeof(task_t), 0);	151	ta = (task_t *) malloc(sizeof(task_t), 0);
161		152
162	task_create_arch(ta);	153	task_create_arch(ta);
163		154
164	spinlock_initialize(&ta->lock, "task_ta_lock");	155	spinlock_initialize(&ta->lock, "task_ta_lock");
165	list_initialize(&ta->th_head);	156	list_initialize(&ta->th_head);
166	ta->as = as;	157	ta->as = as;
167	ta->name = name;	158	ta->name = name;
168	atomic_set(&ta->refcount, 0);	159	atomic_set(&ta->refcount, 0);
169	atomic_set(&ta->lifecount, 0);	160	atomic_set(&ta->lifecount, 0);
170	ta->context = CONTEXT;	161	ta->context = CONTEXT;
171		162
172	ta->capabilities = 0;	163	ta->capabilities = 0;
173	ta->cycles = 0;	164	ta->cycles = 0;
174		165
175	ipc_answerbox_init(&ta->answerbox, ta);	166	ipc_answerbox_init(&ta->answerbox, ta);
176	for (i = 0; i < IPC_MAX_PHONES; i++)	167	for (i = 0; i < IPC_MAX_PHONES; i++)
177	ipc_phone_init(&ta->phones[i]);	168	ipc_phone_init(&ta->phones[i]);
178	if ((ipc_phone_0) && (context_check(ipc_phone_0->task->context,	169	if ((ipc_phone_0) && (context_check(ipc_phone_0->task->context,
179	ta->context)))	170	ta->context)))
180	ipc_phone_connect(&ta->phones[0], ipc_phone_0);	171	ipc_phone_connect(&ta->phones[0], ipc_phone_0);
181	atomic_set(&ta->active_calls, 0);	172	atomic_set(&ta->active_calls, 0);
182		173
183	mutex_initialize(&ta->futexes_lock, MUTEX_PASSIVE);	174	mutex_initialize(&ta->futexes_lock, MUTEX_PASSIVE);
184	btree_create(&ta->futexes);	175	btree_create(&ta->futexes);
185		176
186	ipl = interrupts_disable();	177	ipl = interrupts_disable();
187		178
188	/*	179	/*
189	* Increment address space reference count.	180	* Increment address space reference count.
190	*/	181	*/
191	atomic_inc(&as->refcount);	182	atomic_inc(&as->refcount);
192		183
193	spinlock_lock(&tasks_lock);	184	spinlock_lock(&tasks_lock);
194	ta->taskid = ++task_counter;	185	ta->taskid = ++task_counter;
195	avltree_node_initialize(&ta->tasks_tree_node);	186	avltree_node_initialize(&ta->tasks_tree_node);
196	ta->tasks_tree_node.key = ta->taskid;	187	ta->tasks_tree_node.key = ta->taskid;
197	avltree_insert(&tasks_tree, &ta->tasks_tree_node);	188	avltree_insert(&tasks_tree, &ta->tasks_tree_node);
198	spinlock_unlock(&tasks_lock);	189	spinlock_unlock(&tasks_lock);
199	interrupts_restore(ipl);	190	interrupts_restore(ipl);
200		191
201	return ta;	192	return ta;
202	}	193	}
203		194
204	/** Destroy task.	195	/** Destroy task.
205	*	196	*
206	* @param t Task to be destroyed.	197	* @param t Task to be destroyed.
207	*/	198	*/
208	void task_destroy(task_t *t)	199	void task_destroy(task_t *t)
209	{	200	{
210	/*	201	/*
211	* Remove the task from the task B+tree.	202	* Remove the task from the task B+tree.
212	*/	203	*/
213	spinlock_lock(&tasks_lock);	204	spinlock_lock(&tasks_lock);
214	avltree_delete(&tasks_tree, &t->tasks_tree_node);	205	avltree_delete(&tasks_tree, &t->tasks_tree_node);
215	spinlock_unlock(&tasks_lock);	206	spinlock_unlock(&tasks_lock);
216		207
217	/*	208	/*
218	* Perform architecture specific task destruction.	209	* Perform architecture specific task destruction.
219	*/	210	*/
220	task_destroy_arch(t);	211	task_destroy_arch(t);
221		212
222	/*	213	/*
223	* Free up dynamically allocated state.	214	* Free up dynamically allocated state.
224	*/	215	*/
225	btree_destroy(&t->futexes);	216	btree_destroy(&t->futexes);
226		217
227	/*	218	/*
228	* Drop our reference to the address space.	219	* Drop our reference to the address space.
229	*/	220	*/
230	if (atomic_predec(&t->as->refcount) == 0)	221	if (atomic_predec(&t->as->refcount) == 0)
231	as_destroy(t->as);	222	as_destroy(t->as);
232		223
233	free(t);	224	free(t);
234	TASK = NULL;	225	TASK = NULL;
235	}	226	}
236		227
237	/** Syscall for reading task ID from userspace.	228	/** Syscall for reading task ID from userspace.
238	*	229	*
239	* @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
240	* current task ID.	231	* current task ID.
241	*	232	*
242	* @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.
243	*/	234	*/
244	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)
245	{	236	{
246	/*	237	/*
247	* No need to acquire lock on TASK because taskid	238	* No need to acquire lock on TASK because taskid
248	* remains constant for the lifespan of the task.	239	* remains constant for the lifespan of the task.
249	*/	240	*/
250	return (unative_t) copy_to_uspace(uspace_task_id, &TASK->taskid,	241	return (unative_t) copy_to_uspace(uspace_task_id, &TASK->taskid,
251	sizeof(TASK->taskid));	242	sizeof(TASK->taskid));
252	}	243	}
253		-
254	unative_t sys_task_spawn(void *image, size_t size)	-
255	{	-
256	void *kimage = malloc(size, 0);	-
257	if (kimage == NULL)	-
258	return ENOMEM;	-
259		-
260	int rc = copy_from_uspace(kimage, image, size);	-
261	if (rc != EOK)	-
262	return rc;	-
263		-
264	/*	-
265	* Not very efficient and it would be better to call it on code only,	-
266	* but this whole function is a temporary hack anyway and one day it	-
267	* will go in favor of the userspace dynamic loader.	-
268	*/	-
269	smc_coherence_block(kimage, size);	-
270		-
271	uspace_arg_t *kernel_uarg;	-
272	kernel_uarg = (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0);	-
273	if (kernel_uarg == NULL) {	-
274	free(kimage);	-
275	return ENOMEM;	-
276	}	-
277		-
278	kernel_uarg->uspace_entry =	-
279	(void ) ((elf_header_t ) kimage)->e_entry;	-
280	kernel_uarg->uspace_stack = (void *) USTACK_ADDRESS;	-
281	kernel_uarg->uspace_thread_function = NULL;	-
282	kernel_uarg->uspace_thread_arg = NULL;	-
283	kernel_uarg->uspace_uarg = NULL;	-
284		-
285	as_t *as = as_create(0);	-
286	if (as == NULL) {	-
287	free(kernel_uarg);	-
288	free(kimage);	-
289	return ENOMEM;	-
290	}	-
291		-
292	unsigned int erc = elf_load((elf_header_t *) kimage, as);	-
293	if (erc != EE_OK) {	-
294	as_destroy(as);	-
295	free(kernel_uarg);	-
296	free(kimage);	-
297	return ENOENT;	-
298	}	-
299		-
300	as_area_t *area = as_area_create(as,	-
301	AS_AREA_READ \| AS_AREA_WRITE \| AS_AREA_CACHEABLE,	-
302	LOADED_PROG_STACK_PAGES_NO * PAGE_SIZE, USTACK_ADDRESS,	-
303	AS_AREA_ATTR_NONE, &anon_backend, NULL);	-
304	if (area == NULL) {	-
305	as_destroy(as);	-
306	free(kernel_uarg);	-
307	free(kimage);	-
308	return ENOMEM;	-
309	}	-
310		-
311	task_t *task = task_create(as, "app");	-
312	if (task == NULL) {	-
313	as_destroy(as);	-
314	free(kernel_uarg);	-
315	free(kimage);	-
316	return ENOENT;	-
317	}	-
318		-
319	// FIXME: control the capabilities	-
320	cap_set(task, cap_get(TASK));	-
321		-
322	thread_t *thread = thread_create(uinit, kernel_uarg, task,	-
323	THREAD_FLAG_USPACE, "user", false);	-
324	if (thread == NULL) {	-
325	task_destroy(task);	-
326	as_destroy(as);	-
327	free(kernel_uarg);	-
328	free(kimage);	-
329	return ENOENT;	-
330	}	-
331		-
332	thread_ready(thread);	-
333		-
334	return EOK;	-
335	}	-
336		244
337	/** Find task structure corresponding to task ID.	245	/** Find task structure corresponding to task ID.
338	*	246	*
339	* 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
340	* and interrupts must be disabled.	248	* and interrupts must be disabled.
341	*	249	*
342	* @param id Task ID.	250	* @param id Task ID.
343	*	251	*
344	* @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.
345	*/	253	*/
346	task_t *task_find_by_id(task_id_t id)	254	task_t *task_find_by_id(task_id_t id)
347	{	255	{
348	avltree_node_t *node;	256	avltree_node_t *node;
349		257
350	node = avltree_search(&tasks_tree, (avltree_key_t) id);	258	node = avltree_search(&tasks_tree, (avltree_key_t) id);
351		259
352	if (node)	260	if (node)
353	return avltree_get_instance(node, task_t, tasks_tree_node);	261	return avltree_get_instance(node, task_t, tasks_tree_node);
354	return NULL;	262	return NULL;
355	}	263	}
356		264
357	/** Get accounting data of given task.	265	/** Get accounting data of given task.
358	*	266	*
359	* Note that task lock of 't' must be already held and	267	* Note that task lock of 't' must be already held and
360	* interrupts must be already disabled.	268	* interrupts must be already disabled.
361	*	269	*
362	* @param t Pointer to thread.	270	* @param t Pointer to thread.
363	*	271	*
364	*/	272	*/
365	uint64_t task_get_accounting(task_t *t)	273	uint64_t task_get_accounting(task_t *t)
366	{	274	{
367	/* Accumulated value of task */	275	/* Accumulated value of task */
368	uint64_t ret = t->cycles;	276	uint64_t ret = t->cycles;
369		277
370	/* Current values of threads */	278	/* Current values of threads */
371	link_t *cur;	279	link_t *cur;
372	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) {
373	thread_t *thr = list_get_instance(cur, thread_t, th_link);	281	thread_t *thr = list_get_instance(cur, thread_t, th_link);
374		282
375	spinlock_lock(&thr->lock);	283	spinlock_lock(&thr->lock);
376	/* Process only counted threads */	284	/* Process only counted threads */
377	if (!thr->uncounted) {	285	if (!thr->uncounted) {
378	if (thr == THREAD) {	286	if (thr == THREAD) {
379	/* Update accounting of current thread */	287	/* Update accounting of current thread */
380	thread_update_accounting();	288	thread_update_accounting();
381	}	289	}
382	ret += thr->cycles;	290	ret += thr->cycles;
383	}	291	}
384	spinlock_unlock(&thr->lock);	292	spinlock_unlock(&thr->lock);
385	}	293	}
386		294
387	return ret;	295	return ret;
388	}	296	}
389		297
390	/** Kill task.	298	/** Kill task.
391	*	299	*
392	* This function is idempotent.	300	* This function is idempotent.
393	* It signals all the task's threads to bail it out.	301	* It signals all the task's threads to bail it out.
394	*	302	*
395	* @param id ID of the task to be killed.	303	* @param id ID of the task to be killed.
396	*	304	*
397	* @return 0 on success or an error code from errno.h	305	* @return 0 on success or an error code from errno.h
398	*/	306	*/
399	int task_kill(task_id_t id)	307	int task_kill(task_id_t id)
400	{	308	{
401	ipl_t ipl;	309	ipl_t ipl;
402	task_t *ta;	310	task_t *ta;
403	link_t *cur;	311	link_t *cur;
404		312
405	if (id == 1)	313	if (id == 1)
406	return EPERM;	314	return EPERM;
407		315
408	ipl = interrupts_disable();	316	ipl = interrupts_disable();
409	spinlock_lock(&tasks_lock);	317	spinlock_lock(&tasks_lock);
410	if (!(ta = task_find_by_id(id))) {	318	if (!(ta = task_find_by_id(id))) {
411	spinlock_unlock(&tasks_lock);	319	spinlock_unlock(&tasks_lock);
412	interrupts_restore(ipl);	320	interrupts_restore(ipl);
413	return ENOENT;	321	return ENOENT;
414	}	322	}
415	spinlock_unlock(&tasks_lock);	323	spinlock_unlock(&tasks_lock);
416		324
417	/*	325	/*
418	* Interrupt all threads except ktaskclnp.	326	* Interrupt all threads except ktaskclnp.
419	*/	327	*/
420	spinlock_lock(&ta->lock);	328	spinlock_lock(&ta->lock);
421	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) {
422	thread_t *thr;	330	thread_t *thr;
423	bool sleeping = false;	331	bool sleeping = false;
424		332
425	thr = list_get_instance(cur, thread_t, th_link);	333	thr = list_get_instance(cur, thread_t, th_link);
426		334
427	spinlock_lock(&thr->lock);	335	spinlock_lock(&thr->lock);
428	thr->interrupted = true;	336	thr->interrupted = true;
429	if (thr->state == Sleeping)	337	if (thr->state == Sleeping)
430	sleeping = true;	338	sleeping = true;
431	spinlock_unlock(&thr->lock);	339	spinlock_unlock(&thr->lock);
432		340
433	if (sleeping)	341	if (sleeping)
434	waitq_interrupt_sleep(thr);	342	waitq_interrupt_sleep(thr);
435	}	343	}
436	spinlock_unlock(&ta->lock);	344	spinlock_unlock(&ta->lock);
437	interrupts_restore(ipl);	345	interrupts_restore(ipl);
438		346
439	return 0;	347	return 0;
440	}	348	}
441		349
442	static bool task_print_walker(avltree_node_t node, void arg)	350	static bool task_print_walker(avltree_node_t node, void arg)
443	{	351	{
444	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);
445	int j;	353	int j;
446		354
447	spinlock_lock(&t->lock);	355	spinlock_lock(&t->lock);
448		356
449	uint64_t cycles;	357	uint64_t cycles;
450	char suffix;	358	char suffix;
451	order(task_get_accounting(t), &cycles, &suffix);	359	order(task_get_accounting(t), &cycles, &suffix);
452		360
453	#ifdef __32_BITS__	361	#ifdef __32_BITS__
454	printf("%-6" PRIu64 " %-10s %-3" PRIu32 " %10p %10p %9" PRIu64	362	printf("%-6" PRIu64 " %-10s %-3" PRIu32 " %10p %10p %9" PRIu64
455	"%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,
456	suffix, atomic_get(&t->refcount), atomic_get(&t->active_calls));	364	suffix, atomic_get(&t->refcount), atomic_get(&t->active_calls));
457	#endif	365	#endif
458		366
459	#ifdef __64_BITS__	367	#ifdef __64_BITS__
460	printf("%-6" PRIu64 " %-10s %-3" PRIu32 " %18p %18p %9" PRIu64	368	printf("%-6" PRIu64 " %-10s %-3" PRIu32 " %18p %18p %9" PRIu64
461	"%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,
462	suffix, atomic_get(&t->refcount), atomic_get(&t->active_calls));	370	suffix, atomic_get(&t->refcount), atomic_get(&t->active_calls));
463	#endif	371	#endif
464		372
465	for (j = 0; j < IPC_MAX_PHONES; j++) {	373	for (j = 0; j < IPC_MAX_PHONES; j++) {
466	if (t->phones[j].callee)	374	if (t->phones[j].callee)
467	printf(" %d:%p", j, t->phones[j].callee);	375	printf(" %d:%p", j, t->phones[j].callee);
468	}	376	}
469	printf("\n");	377	printf("\n");
470		378
471	spinlock_unlock(&t->lock);	379	spinlock_unlock(&t->lock);
472	return true;	380	return true;
473	}	381	}
474		382
475	/** Print task list */	383	/** Print task list */
476	void task_print_list(void)	384	void task_print_list(void)
477	{	385	{
478	ipl_t ipl;	386	ipl_t ipl;
479		387
480	/* Messing with task structures, avoid deadlock */	388	/* Messing with task structures, avoid deadlock */
481	ipl = interrupts_disable();	389	ipl = interrupts_disable();
482	spinlock_lock(&tasks_lock);	390	spinlock_lock(&tasks_lock);
483		391
484	#ifdef __32_BITS__	392	#ifdef __32_BITS__
485	printf("taskid name ctx address as "	393	printf("taskid name ctx address as "
486	"cycles threads calls callee\n");	394	"cycles threads calls callee\n");
487	printf("------ ---------- --- ---------- ---------- "	395	printf("------ ---------- --- ---------- ---------- "
488	"---------- ------- ------ ------>\n");	396	"---------- ------- ------ ------>\n");
489	#endif	397	#endif
490		398
491	#ifdef __64_BITS__	399	#ifdef __64_BITS__
492	printf("taskid name ctx address as "	400	printf("taskid name ctx address as "
493	"cycles threads calls callee\n");	401	"cycles threads calls callee\n");
494	printf("------ ---------- --- ------------------ ------------------ "	402	printf("------ ---------- --- ------------------ ------------------ "
495	"---------- ------- ------ ------>\n");	403	"---------- ------- ------ ------>\n");
496	#endif	404	#endif
497		405
498	avltree_walk(&tasks_tree, task_print_walker, NULL);	406	avltree_walk(&tasks_tree, task_print_walker, NULL);
499		407
500	spinlock_unlock(&tasks_lock);	408	spinlock_unlock(&tasks_lock);

Subversion Repositories HelenOS

(root)/trunk/kernel/generic/src/proc/task.c – Rev 3186 → 3222