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

Subversion Repositories HelenOS

(root)/trunk/kernel/generic/src/proc/task.c @ 1820 – Rev 3063 → 3137