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


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

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

Subversion Repositories HelenOS

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