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;
 
    ta->being_debugged = false;
    ta->stop_request = false;
    ta->debug_begin_call = NULL;
    ta->debug_go_call = NULL;
    ta->not_stoppable_count = 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);
    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 2803	Rev 2804
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	ta->being_debugged = false;	174	ta->being_debugged = false;
175	ta->stop_request = false;	175	ta->stop_request = false;
176	ta->debug_begin_call = NULL;	176	ta->debug_begin_call = NULL;
177	ta->debug_go_call = NULL;	177	ta->debug_go_call = NULL;
-		178	ta->not_stoppable_count = 0;
178		179
179	ipc_answerbox_init(&ta->answerbox, ta);	180	ipc_answerbox_init(&ta->answerbox, ta);
180	for (i = 0; i < IPC_MAX_PHONES; i++)	181	for (i = 0; i < IPC_MAX_PHONES; i++)
181	ipc_phone_init(&ta->phones[i]);	182	ipc_phone_init(&ta->phones[i]);
182	if ((ipc_phone_0) && (context_check(ipc_phone_0->task->context,	183	if ((ipc_phone_0) && (context_check(ipc_phone_0->task->context,
183	ta->context)))	184	ta->context)))
184	ipc_phone_connect(&ta->phones[0], ipc_phone_0);	185	ipc_phone_connect(&ta->phones[0], ipc_phone_0);
185	atomic_set(&ta->active_calls, 0);	186	atomic_set(&ta->active_calls, 0);
186		187
187	mutex_initialize(&ta->futexes_lock);	188	mutex_initialize(&ta->futexes_lock);
188	btree_create(&ta->futexes);	189	btree_create(&ta->futexes);
189		190
190	ipl = interrupts_disable();	191	ipl = interrupts_disable();
191		192
192	/*	193	/*
193	* Increment address space reference count.	194	* Increment address space reference count.
194	*/	195	*/
195	atomic_inc(&as->refcount);	196	atomic_inc(&as->refcount);
196		197
197	spinlock_lock(&tasks_lock);	198	spinlock_lock(&tasks_lock);
198	ta->taskid = ++task_counter;	199	ta->taskid = ++task_counter;
199	avltree_node_initialize(&ta->tasks_tree_node);	200	avltree_node_initialize(&ta->tasks_tree_node);
200	ta->tasks_tree_node.key = ta->taskid;	201	ta->tasks_tree_node.key = ta->taskid;
201	avltree_insert(&tasks_tree, &ta->tasks_tree_node);	202	avltree_insert(&tasks_tree, &ta->tasks_tree_node);
202	spinlock_unlock(&tasks_lock);	203	spinlock_unlock(&tasks_lock);
203	interrupts_restore(ipl);	204	interrupts_restore(ipl);
204		205
205	return ta;	206	return ta;
206	}	207	}
207		208
208	/** Destroy task.	209	/** Destroy task.
209	*	210	*
210	* @param t Task to be destroyed.	211	* @param t Task to be destroyed.
211	*/	212	*/
212	void task_destroy(task_t *t)	213	void task_destroy(task_t *t)
213	{	214	{
214	/*	215	/*
215	* Remove the task from the task B+tree.	216	* Remove the task from the task B+tree.
216	*/	217	*/
217	spinlock_lock(&tasks_lock);	218	spinlock_lock(&tasks_lock);
218	avltree_delete(&tasks_tree, &t->tasks_tree_node);	219	avltree_delete(&tasks_tree, &t->tasks_tree_node);
219	spinlock_unlock(&tasks_lock);	220	spinlock_unlock(&tasks_lock);
220		221
221	/*	222	/*
222	* Perform architecture specific task destruction.	223	* Perform architecture specific task destruction.
223	*/	224	*/
224	task_destroy_arch(t);	225	task_destroy_arch(t);
225		226
226	/*	227	/*
227	* Free up dynamically allocated state.	228	* Free up dynamically allocated state.
228	*/	229	*/
229	btree_destroy(&t->futexes);	230	btree_destroy(&t->futexes);
230		231
231	/*	232	/*
232	* Drop our reference to the address space.	233	* Drop our reference to the address space.
233	*/	234	*/
234	if (atomic_predec(&t->as->refcount) == 0)	235	if (atomic_predec(&t->as->refcount) == 0)
235	as_destroy(t->as);	236	as_destroy(t->as);
236		237
237	free(t);	238	free(t);
238	TASK = NULL;	239	TASK = NULL;
239	}	240	}
240		241
241	/** Create new task with 1 thread and run it	242	/** Create new task with 1 thread and run it
242	*	243	*
243	* @param program_addr Address of program executable image.	244	* @param program_addr Address of program executable image.
244	* @param name Program name.	245	* @param name Program name.
245	*	246	*
246	* @return Task of the running program or NULL on error.	247	* @return Task of the running program or NULL on error.
247	*/	248	*/
248	task_t task_run_program(void program_addr, char *name)	249	task_t task_run_program(void program_addr, char *name)
249	{	250	{
250	as_t *as;	251	as_t *as;
251	as_area_t *a;	252	as_area_t *a;
252	unsigned int rc;	253	unsigned int rc;
253	thread_t *t;	254	thread_t *t;
254	task_t *task;	255	task_t *task;
255	uspace_arg_t *kernel_uarg;	256	uspace_arg_t *kernel_uarg;
256		257
257	as = as_create(0);	258	as = as_create(0);
258	ASSERT(as);	259	ASSERT(as);
259		260
260	rc = elf_load((elf_header_t *) program_addr, as);	261	rc = elf_load((elf_header_t *) program_addr, as);
261	if (rc != EE_OK) {	262	if (rc != EE_OK) {
262	as_destroy(as);	263	as_destroy(as);
263	return NULL;	264	return NULL;
264	}	265	}
265		266
266	kernel_uarg = (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0);	267	kernel_uarg = (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0);
267	kernel_uarg->uspace_entry =	268	kernel_uarg->uspace_entry =
268	(void ) ((elf_header_t ) program_addr)->e_entry;	269	(void ) ((elf_header_t ) program_addr)->e_entry;
269	kernel_uarg->uspace_stack = (void *) USTACK_ADDRESS;	270	kernel_uarg->uspace_stack = (void *) USTACK_ADDRESS;
270	kernel_uarg->uspace_thread_function = NULL;	271	kernel_uarg->uspace_thread_function = NULL;
271	kernel_uarg->uspace_thread_arg = NULL;	272	kernel_uarg->uspace_thread_arg = NULL;
272	kernel_uarg->uspace_uarg = NULL;	273	kernel_uarg->uspace_uarg = NULL;
273		274
274	task = task_create(as, name);	275	task = task_create(as, name);
275	ASSERT(task);	276	ASSERT(task);
276		277
277	/*	278	/*
278	* Create the data as_area.	279	* Create the data as_area.
279	*/	280	*/
280	a = as_area_create(as, AS_AREA_READ \| AS_AREA_WRITE \| AS_AREA_CACHEABLE,	281	a = as_area_create(as, AS_AREA_READ \| AS_AREA_WRITE \| AS_AREA_CACHEABLE,
281	LOADED_PROG_STACK_PAGES_NO * PAGE_SIZE, USTACK_ADDRESS,	282	LOADED_PROG_STACK_PAGES_NO * PAGE_SIZE, USTACK_ADDRESS,
282	AS_AREA_ATTR_NONE, &anon_backend, NULL);	283	AS_AREA_ATTR_NONE, &anon_backend, NULL);
283		284
284	/*	285	/*
285	* Create the main thread.	286	* Create the main thread.
286	*/	287	*/
287	t = thread_create(uinit, kernel_uarg, task, THREAD_FLAG_USPACE,	288	t = thread_create(uinit, kernel_uarg, task, THREAD_FLAG_USPACE,
288	"uinit", false);	289	"uinit", false);
289	ASSERT(t);	290	ASSERT(t);
290		291
291	thread_ready(t);	292	thread_ready(t);
292		293
293	return task;	294	return task;
294	}	295	}
295		296
296	/** Syscall for reading task ID from userspace.	297	/** Syscall for reading task ID from userspace.
297	*	298	*
298	* @param uspace_task_id Userspace address of 8-byte buffer where to store	299	* @param uspace_task_id Userspace address of 8-byte buffer where to store
299	* current task ID.	300	* current task ID.
300	*	301	*
301	* @return 0 on success or an error code from @ref errno.h.	302	* @return 0 on success or an error code from @ref errno.h.
302	*/	303	*/
303	unative_t sys_task_get_id(task_id_t *uspace_task_id)	304	unative_t sys_task_get_id(task_id_t *uspace_task_id)
304	{	305	{
305	/*	306	/*
306	* No need to acquire lock on TASK because taskid	307	* No need to acquire lock on TASK because taskid
307	* remains constant for the lifespan of the task.	308	* remains constant for the lifespan of the task.
308	*/	309	*/
309	return (unative_t) copy_to_uspace(uspace_task_id, &TASK->taskid,	310	return (unative_t) copy_to_uspace(uspace_task_id, &TASK->taskid,
310	sizeof(TASK->taskid));	311	sizeof(TASK->taskid));
311	}	312	}
312		313
313	/** Find task structure corresponding to task ID.	314	/** Find task structure corresponding to task ID.
314	*	315	*
315	* The tasks_lock must be already held by the caller of this function	316	* The tasks_lock must be already held by the caller of this function
316	* and interrupts must be disabled.	317	* and interrupts must be disabled.
317	*	318	*
318	* @param id Task ID.	319	* @param id Task ID.
319	*	320	*
320	* @return Task structure address or NULL if there is no such task ID.	321	* @return Task structure address or NULL if there is no such task ID.
321	*/	322	*/
322	task_t *task_find_by_id(task_id_t id)	323	task_t *task_find_by_id(task_id_t id)
323	{	324	{
324	avltree_node_t *node;	325	avltree_node_t *node;
325		326
326	node = avltree_search(&tasks_tree, (avltree_key_t) id);	327	node = avltree_search(&tasks_tree, (avltree_key_t) id);
327		328
328	if (node)	329	if (node)
329	return avltree_get_instance(node, task_t, tasks_tree_node);	330	return avltree_get_instance(node, task_t, tasks_tree_node);
330	return NULL;	331	return NULL;
331	}	332	}
332		333
333	/** Get accounting data of given task.	334	/** Get accounting data of given task.
334	*	335	*
335	* Note that task lock of 't' must be already held and	336	* Note that task lock of 't' must be already held and
336	* interrupts must be already disabled.	337	* interrupts must be already disabled.
337	*	338	*
338	* @param t Pointer to thread.	339	* @param t Pointer to thread.
339	*	340	*
340	*/	341	*/
341	uint64_t task_get_accounting(task_t *t)	342	uint64_t task_get_accounting(task_t *t)
342	{	343	{
343	/* Accumulated value of task */	344	/* Accumulated value of task */
344	uint64_t ret = t->cycles;	345	uint64_t ret = t->cycles;
345		346
346	/* Current values of threads */	347	/* Current values of threads */
347	link_t *cur;	348	link_t *cur;
348	for (cur = t->th_head.next; cur != &t->th_head; cur = cur->next) {	349	for (cur = t->th_head.next; cur != &t->th_head; cur = cur->next) {
349	thread_t *thr = list_get_instance(cur, thread_t, th_link);	350	thread_t *thr = list_get_instance(cur, thread_t, th_link);
350		351
351	spinlock_lock(&thr->lock);	352	spinlock_lock(&thr->lock);
352	/* Process only counted threads */	353	/* Process only counted threads */
353	if (!thr->uncounted) {	354	if (!thr->uncounted) {
354	if (thr == THREAD) {	355	if (thr == THREAD) {
355	/* Update accounting of current thread */	356	/* Update accounting of current thread */
356	thread_update_accounting();	357	thread_update_accounting();
357	}	358	}
358	ret += thr->cycles;	359	ret += thr->cycles;
359	}	360	}
360	spinlock_unlock(&thr->lock);	361	spinlock_unlock(&thr->lock);
361	}	362	}
362		363
363	return ret;	364	return ret;
364	}	365	}
365		366
366	/** Kill task.	367	/** Kill task.
367	*	368	*
368	* This function is idempotent.	369	* This function is idempotent.
369	* It signals all the task's threads to bail it out.	370	* It signals all the task's threads to bail it out.
370	*	371	*
371	* @param id ID of the task to be killed.	372	* @param id ID of the task to be killed.
372	*	373	*
373	* @return 0 on success or an error code from errno.h	374	* @return 0 on success or an error code from errno.h
374	*/	375	*/
375	int task_kill(task_id_t id)	376	int task_kill(task_id_t id)
376	{	377	{
377	ipl_t ipl;	378	ipl_t ipl;
378	task_t *ta;	379	task_t *ta;
379	link_t *cur;	380	link_t *cur;
380		381
381	if (id == 1)	382	if (id == 1)
382	return EPERM;	383	return EPERM;
383		384
384	ipl = interrupts_disable();	385	ipl = interrupts_disable();
385	spinlock_lock(&tasks_lock);	386	spinlock_lock(&tasks_lock);
386	if (!(ta = task_find_by_id(id))) {	387	if (!(ta = task_find_by_id(id))) {
387	spinlock_unlock(&tasks_lock);	388	spinlock_unlock(&tasks_lock);
388	interrupts_restore(ipl);	389	interrupts_restore(ipl);
389	return ENOENT;	390	return ENOENT;
390	}	391	}
391	spinlock_unlock(&tasks_lock);	392	spinlock_unlock(&tasks_lock);
392		393
393	/*	394	/*
394	* Interrupt all threads except ktaskclnp.	395	* Interrupt all threads except ktaskclnp.
395	*/	396	*/
396	spinlock_lock(&ta->lock);	397	spinlock_lock(&ta->lock);
397	for (cur = ta->th_head.next; cur != &ta->th_head; cur = cur->next) {	398	for (cur = ta->th_head.next; cur != &ta->th_head; cur = cur->next) {
398	thread_t *thr;	399	thread_t *thr;
399	bool sleeping = false;	400	bool sleeping = false;
400		401
401	thr = list_get_instance(cur, thread_t, th_link);	402	thr = list_get_instance(cur, thread_t, th_link);
402		403
403	spinlock_lock(&thr->lock);	404	spinlock_lock(&thr->lock);
404	thr->interrupted = true;	405	thr->interrupted = true;
405	if (thr->state == Sleeping)	406	if (thr->state == Sleeping)
406	sleeping = true;	407	sleeping = true;
407	spinlock_unlock(&thr->lock);	408	spinlock_unlock(&thr->lock);
408		409
409	if (sleeping)	410	if (sleeping)
410	waitq_interrupt_sleep(thr);	411	waitq_interrupt_sleep(thr);
411	}	412	}
412	spinlock_unlock(&ta->lock);	413	spinlock_unlock(&ta->lock);
413	interrupts_restore(ipl);	414	interrupts_restore(ipl);
414		415
415	return 0;	416	return 0;
416	}	417	}
417		418
418	static bool task_print_walker(avltree_node_t node, void arg)	419	static bool task_print_walker(avltree_node_t node, void arg)
419	{	420	{
420	task_t *t = avltree_get_instance(node, task_t, tasks_tree_node);	421	task_t *t = avltree_get_instance(node, task_t, tasks_tree_node);
421	int j;	422	int j;
422		423
423	spinlock_lock(&t->lock);	424	spinlock_lock(&t->lock);
424		425
425	uint64_t cycles;	426	uint64_t cycles;
426	char suffix;	427	char suffix;
427	order(task_get_accounting(t), &cycles, &suffix);	428	order(task_get_accounting(t), &cycles, &suffix);
428		429
429	if (sizeof(void *) == 4)	430	if (sizeof(void *) == 4)
430	printf("%-6llu %-10s %-3ld %#10zx %#10zx %9llu%c %7zd %6zd",	431	printf("%-6llu %-10s %-3ld %#10zx %#10zx %9llu%c %7zd %6zd",
431	t->taskid, t->name, t->context, t, t->as, cycles, suffix,	432	t->taskid, t->name, t->context, t, t->as, cycles, suffix,
432	t->refcount, atomic_get(&t->active_calls));	433	t->refcount, atomic_get(&t->active_calls));
433	else	434	else
434	printf("%-6llu %-10s %-3ld %#18zx %#18zx %9llu%c %7zd %6zd",	435	printf("%-6llu %-10s %-3ld %#18zx %#18zx %9llu%c %7zd %6zd",
435	t->taskid, t->name, t->context, t, t->as, cycles, suffix,	436	t->taskid, t->name, t->context, t, t->as, cycles, suffix,
436	t->refcount, atomic_get(&t->active_calls));	437	t->refcount, atomic_get(&t->active_calls));
437	for (j = 0; j < IPC_MAX_PHONES; j++) {	438	for (j = 0; j < IPC_MAX_PHONES; j++) {
438	if (t->phones[j].callee)	439	if (t->phones[j].callee)
439	printf(" %zd:%#zx", j, t->phones[j].callee);	440	printf(" %zd:%#zx", j, t->phones[j].callee);
440	}	441	}
441	printf("\n");	442	printf("\n");
442		443
443	spinlock_unlock(&t->lock);	444	spinlock_unlock(&t->lock);
444	return true;	445	return true;
445	}	446	}
446		447
447	/** Print task list */	448	/** Print task list */
448	void task_print_list(void)	449	void task_print_list(void)
449	{	450	{
450	ipl_t ipl;	451	ipl_t ipl;
451		452
452	/* Messing with task structures, avoid deadlock */	453	/* Messing with task structures, avoid deadlock */
453	ipl = interrupts_disable();	454	ipl = interrupts_disable();
454	spinlock_lock(&tasks_lock);	455	spinlock_lock(&tasks_lock);
455		456
456	if (sizeof(void *) == 4) {	457	if (sizeof(void *) == 4) {
457	printf("taskid name ctx address as "	458	printf("taskid name ctx address as "
458	"cycles threads calls callee\n");	459	"cycles threads calls callee\n");
459	printf("------ ---------- --- ---------- ---------- "	460	printf("------ ---------- --- ---------- ---------- "
460	"---------- ------- ------ ------>\n");	461	"---------- ------- ------ ------>\n");
461	} else {	462	} else {
462	printf("taskid name ctx address as "	463	printf("taskid name ctx address as "
463	"cycles threads calls callee\n");	464	"cycles threads calls callee\n");
464	printf("------ ---------- --- ------------------ ------------------ "	465	printf("------ ---------- --- ------------------ ------------------ "
465	"---------- ------- ------ ------>\n");	466	"---------- ------- ------ ------>\n");
466	}	467	}
467		468
468	avltree_walk(&tasks_tree, task_print_walker, NULL);	469	avltree_walk(&tasks_tree, task_print_walker, NULL);
469		470
470	spinlock_unlock(&tasks_lock);	471	spinlock_unlock(&tasks_lock);
471	interrupts_restore(ipl);	472	interrupts_restore(ipl);
472	}	473	}
473		474
474	/** @}	475	/** @}
475	*/	476	*/
476		477

Subversion Repositories HelenOS

(root)/branches/tracing/kernel/generic/src/proc/task.c @ 2936 – Rev 2803 → 2804