WebSVN – HelenOS-historic – Diff – /kernel/trunk/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.
 */
 
/**
 * @file    task.c
 * @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 <synch/spinlock.h>
#include <arch.h>
#include <panic.h>
#include <adt/btree.h>
#include <adt/list.h>
#include <ipc/ipc.h>
#include <security/cap.h>
#include <memstr.h>
#include <print.h>
#include <elf.h>
#include <syscall/copy.h>
 
#ifndef LOADED_PROG_STACK_PAGES_NO
#define LOADED_PROG_STACK_PAGES_NO 1
#endif
 
SPINLOCK_INITIALIZE(tasks_lock);
btree_t tasks_btree;
static task_id_t task_counter = 0;
 
/** Initialize tasks
 *
 * Initialize kernel tasks support.
 *
 */
void task_init(void)
{
    TASK = NULL;
    btree_create(&tasks_btree);
}
 
 
/** 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;
 
    ta->capabilities = 0;
   
    ipc_answerbox_init(&ta->answerbox);
    for (i=0; i < IPC_MAX_PHONES;i++)
        ipc_phone_init(&ta->phones[i]);
    if (ipc_phone_0)
        ipc_phone_connect(&ta->phones[0], ipc_phone_0);
    atomic_set(&ta->active_calls, 0);
   
 
 
    ipl = interrupts_disable();
    spinlock_lock(&tasks_lock);
 
    ta->taskid = ++task_counter;
    btree_insert(&tasks_btree, (btree_key_t) ta->taskid, (void *) ta, NULL);
 
    spinlock_unlock(&tasks_lock);
    interrupts_restore(ipl);
 
    return ta;
}
 
/** 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;
    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_free(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, LOADED_PROG_STACK_PAGES_NO*PAGE_SIZE,
        USTACK_ADDRESS, AS_AREA_ATTR_NONE);
 
    t = thread_create(uinit, kernel_uarg, task, 0, "uinit");
    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.
 */
__native 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 (__native) 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)
{
    btree_node_t *leaf;
   
    return (task_t *) btree_search(&tasks_btree, (btree_key_t) id, &leaf);
}
 
/** Print task list */
void task_print_list(void)
{
    link_t *cur;
    ipl_t ipl;
   
    /* Messing with thread structures, avoid deadlock */
    ipl = interrupts_disable();
    spinlock_lock(&tasks_lock);
 
    for (cur = tasks_btree.leaf_head.next; cur != &tasks_btree.leaf_head; cur = cur->next) {
        btree_node_t *node;
        int i;
       
        node = list_get_instance(cur, btree_node_t, leaf_link);
        for (i = 0; i < node->keys; i++) {
            task_t *t;
            int j;
 
            t = (task_t *) node->value[i];
       
            spinlock_lock(&t->lock);
            printf("%s: address=%#zX, taskid=%#llX, as=%#zX, ActiveCalls: %zd",
                t->name, t, t->taskid, t->as, atomic_get(&t->active_calls));
            for (j=0; j < IPC_MAX_PHONES; j++) {
                if (t->phones[j].callee)
                    printf(" Ph(%zd): %#zX ", j, t->phones[j].callee);
            }
            printf("\n");
            spinlock_unlock(&t->lock);
        }
    }
 
    spinlock_unlock(&tasks_lock);
    interrupts_restore(ipl);
}
 

Rev 1288	Rev 1358
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	/**	29	/**
30	* @file task.c	30	* @file task.c
31	* @brief Task management.	31	* @brief Task management.
32	*/	32	*/
33		33
34	#include <main/uinit.h>	34	#include <main/uinit.h>
35	#include <proc/thread.h>	35	#include <proc/thread.h>
36	#include <proc/task.h>	36	#include <proc/task.h>
37	#include <proc/uarg.h>	37	#include <proc/uarg.h>
38	#include <mm/as.h>	38	#include <mm/as.h>
39	#include <mm/as_arg.h>	-
40	#include <mm/slab.h>	39	#include <mm/slab.h>
41	#include <synch/spinlock.h>	40	#include <synch/spinlock.h>
42	#include <arch.h>	41	#include <arch.h>
43	#include <panic.h>	42	#include <panic.h>
44	#include <adt/btree.h>	43	#include <adt/btree.h>
45	#include <adt/list.h>	44	#include <adt/list.h>
46	#include <ipc/ipc.h>	45	#include <ipc/ipc.h>
47	#include <security/cap.h>	46	#include <security/cap.h>
48	#include <memstr.h>	47	#include <memstr.h>
49	#include <print.h>	48	#include <print.h>
50	#include <elf.h>	49	#include <elf.h>
51	#include <syscall/copy.h>	50	#include <syscall/copy.h>
52		51
53	#ifndef LOADED_PROG_STACK_PAGES_NO	52	#ifndef LOADED_PROG_STACK_PAGES_NO
54	#define LOADED_PROG_STACK_PAGES_NO 1	53	#define LOADED_PROG_STACK_PAGES_NO 1
55	#endif	54	#endif
56		55
57	SPINLOCK_INITIALIZE(tasks_lock);	56	SPINLOCK_INITIALIZE(tasks_lock);
58	btree_t tasks_btree;	57	btree_t tasks_btree;
59	static task_id_t task_counter = 0;	58	static task_id_t task_counter = 0;
60		59
61	/** Initialize tasks	60	/** Initialize tasks
62	*	61	*
63	* Initialize kernel tasks support.	62	* Initialize kernel tasks support.
64	*	63	*
65	*/	64	*/
66	void task_init(void)	65	void task_init(void)
67	{	66	{
68	TASK = NULL;	67	TASK = NULL;
69	btree_create(&tasks_btree);	68	btree_create(&tasks_btree);
70	}	69	}
71		70
72		71
73	/** Create new task	72	/** Create new task
74	*	73	*
75	* Create new task with no threads.	74	* Create new task with no threads.
76	*	75	*
77	* @param as Task's address space.	76	* @param as Task's address space.
78	* @param name Symbolic name.	77	* @param name Symbolic name.
79	*	78	*
80	* @return New task's structure	79	* @return New task's structure
81	*	80	*
82	*/	81	*/
83	task_t task_create(as_t as, char *name)	82	task_t task_create(as_t as, char *name)
84	{	83	{
85	ipl_t ipl;	84	ipl_t ipl;
86	task_t *ta;	85	task_t *ta;
87	int i;	86	int i;
88		87
89	ta = (task_t *) malloc(sizeof(task_t), 0);	88	ta = (task_t *) malloc(sizeof(task_t), 0);
90		89
91	task_create_arch(ta);	90	task_create_arch(ta);
92		91
93	spinlock_initialize(&ta->lock, "task_ta_lock");	92	spinlock_initialize(&ta->lock, "task_ta_lock");
94	list_initialize(&ta->th_head);	93	list_initialize(&ta->th_head);
95	ta->as = as;	94	ta->as = as;
96	ta->name = name;	95	ta->name = name;
97		96
98	ta->capabilities = 0;	97	ta->capabilities = 0;
99		98
100	ipc_answerbox_init(&ta->answerbox);	99	ipc_answerbox_init(&ta->answerbox);
101	for (i=0; i < IPC_MAX_PHONES;i++)	100	for (i=0; i < IPC_MAX_PHONES;i++)
102	ipc_phone_init(&ta->phones[i]);	101	ipc_phone_init(&ta->phones[i]);
103	if (ipc_phone_0)	102	if (ipc_phone_0)
104	ipc_phone_connect(&ta->phones[0], ipc_phone_0);	103	ipc_phone_connect(&ta->phones[0], ipc_phone_0);
105	atomic_set(&ta->active_calls, 0);	104	atomic_set(&ta->active_calls, 0);
106		105
107	memsetb((__address) &ta->accept_arg, sizeof(as_area_acptsnd_arg_t), 0);	-
108		-
109	ipl = interrupts_disable();	106	ipl = interrupts_disable();
110	spinlock_lock(&tasks_lock);	107	spinlock_lock(&tasks_lock);
111		108
112	ta->taskid = ++task_counter;	109	ta->taskid = ++task_counter;
113	btree_insert(&tasks_btree, (btree_key_t) ta->taskid, (void *) ta, NULL);	110	btree_insert(&tasks_btree, (btree_key_t) ta->taskid, (void *) ta, NULL);
114		111
115	spinlock_unlock(&tasks_lock);	112	spinlock_unlock(&tasks_lock);
116	interrupts_restore(ipl);	113	interrupts_restore(ipl);
117		114
118	return ta;	115	return ta;
119	}	116	}
120		117
121	/** Create new task with 1 thread and run it	118	/** Create new task with 1 thread and run it
122	*	119	*
123	* @param program_addr Address of program executable image.	120	* @param program_addr Address of program executable image.
124	* @param name Program name.	121	* @param name Program name.
125	*	122	*
126	* @return Task of the running program or NULL on error.	123	* @return Task of the running program or NULL on error.
127	*/	124	*/
128	task_t * task_run_program(void program_addr, char name)	125	task_t * task_run_program(void program_addr, char name)
129	{	126	{
130	as_t *as;	127	as_t *as;
131	as_area_t *a;	128	as_area_t *a;
132	int rc;	129	int rc;
133	thread_t *t;	130	thread_t *t;
134	task_t *task;	131	task_t *task;
135	uspace_arg_t *kernel_uarg;	132	uspace_arg_t *kernel_uarg;
136		133
137	as = as_create(0);	134	as = as_create(0);
138	ASSERT(as);	135	ASSERT(as);
139		136
140	rc = elf_load((elf_header_t *) program_addr, as);	137	rc = elf_load((elf_header_t *) program_addr, as);
141	if (rc != EE_OK) {	138	if (rc != EE_OK) {
142	as_free(as);	139	as_free(as);
143	return NULL;	140	return NULL;
144	}	141	}
145		142
146	kernel_uarg = (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0);	143	kernel_uarg = (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0);
147	kernel_uarg->uspace_entry = (void ) ((elf_header_t ) program_addr)->e_entry;	144	kernel_uarg->uspace_entry = (void ) ((elf_header_t ) program_addr)->e_entry;
148	kernel_uarg->uspace_stack = (void *) USTACK_ADDRESS;	145	kernel_uarg->uspace_stack = (void *) USTACK_ADDRESS;
149	kernel_uarg->uspace_thread_function = NULL;	146	kernel_uarg->uspace_thread_function = NULL;
150	kernel_uarg->uspace_thread_arg = NULL;	147	kernel_uarg->uspace_thread_arg = NULL;
151	kernel_uarg->uspace_uarg = NULL;	148	kernel_uarg->uspace_uarg = NULL;
152		149
153	task = task_create(as, name);	150	task = task_create(as, name);
154	ASSERT(task);	151	ASSERT(task);
155		152
156	/*	153	/*
157	* Create the data as_area.	154	* Create the data as_area.
158	*/	155	*/
159	a = as_area_create(as, AS_AREA_READ \| AS_AREA_WRITE, LOADED_PROG_STACK_PAGES_NO*PAGE_SIZE,	156	a = as_area_create(as, AS_AREA_READ \| AS_AREA_WRITE, LOADED_PROG_STACK_PAGES_NO*PAGE_SIZE,
160	USTACK_ADDRESS, AS_AREA_ATTR_NONE);	157	USTACK_ADDRESS, AS_AREA_ATTR_NONE);
161		158
162	t = thread_create(uinit, kernel_uarg, task, 0, "uinit");	159	t = thread_create(uinit, kernel_uarg, task, 0, "uinit");
163	ASSERT(t);	160	ASSERT(t);
164	thread_ready(t);	161	thread_ready(t);
165		162
166	return task;	163	return task;
167	}	164	}
168		165
169	/** Syscall for reading task ID from userspace.	166	/** Syscall for reading task ID from userspace.
170	*	167	*
171	* @param uspace_task_id Userspace address of 8-byte buffer where to store current task ID.	168	* @param uspace_task_id Userspace address of 8-byte buffer where to store current task ID.
172	*	169	*
173	* @return 0 on success or an error code from @ref errno.h.	170	* @return 0 on success or an error code from @ref errno.h.
174	*/	171	*/
175	__native sys_task_get_id(task_id_t *uspace_task_id)	172	__native sys_task_get_id(task_id_t *uspace_task_id)
176	{	173	{
177	/*	174	/*
178	* No need to acquire lock on TASK because taskid	175	* No need to acquire lock on TASK because taskid
179	* remains constant for the lifespan of the task.	176	* remains constant for the lifespan of the task.
180	*/	177	*/
181	return (__native) copy_to_uspace(uspace_task_id, &TASK->taskid, sizeof(TASK->taskid));	178	return (__native) copy_to_uspace(uspace_task_id, &TASK->taskid, sizeof(TASK->taskid));
182	}	179	}
183		180
184	/** Find task structure corresponding to task ID.	181	/** Find task structure corresponding to task ID.
185	*	182	*
186	* The tasks_lock must be already held by the caller of this function	183	* The tasks_lock must be already held by the caller of this function
187	* and interrupts must be disabled.	184	* and interrupts must be disabled.
188	*	185	*
189	* @param id Task ID.	186	* @param id Task ID.
190	*	187	*
191	* @return Task structure address or NULL if there is no such task ID.	188	* @return Task structure address or NULL if there is no such task ID.
192	*/	189	*/
193	task_t *task_find_by_id(task_id_t id)	190	task_t *task_find_by_id(task_id_t id)
194	{	191	{
195	btree_node_t *leaf;	192	btree_node_t *leaf;
196		193
197	return (task_t *) btree_search(&tasks_btree, (btree_key_t) id, &leaf);	194	return (task_t *) btree_search(&tasks_btree, (btree_key_t) id, &leaf);
198	}	195	}
199		196
200	/** Print task list */	197	/** Print task list */
201	void task_print_list(void)	198	void task_print_list(void)
202	{	199	{
203	link_t *cur;	200	link_t *cur;
204	ipl_t ipl;	201	ipl_t ipl;
205		202
206	/* Messing with thread structures, avoid deadlock */	203	/* Messing with thread structures, avoid deadlock */
207	ipl = interrupts_disable();	204	ipl = interrupts_disable();
208	spinlock_lock(&tasks_lock);	205	spinlock_lock(&tasks_lock);
209		206
210	for (cur = tasks_btree.leaf_head.next; cur != &tasks_btree.leaf_head; cur = cur->next) {	207	for (cur = tasks_btree.leaf_head.next; cur != &tasks_btree.leaf_head; cur = cur->next) {
211	btree_node_t *node;	208	btree_node_t *node;
212	int i;	209	int i;
213		210
214	node = list_get_instance(cur, btree_node_t, leaf_link);	211	node = list_get_instance(cur, btree_node_t, leaf_link);
215	for (i = 0; i < node->keys; i++) {	212	for (i = 0; i < node->keys; i++) {
216	task_t *t;	213	task_t *t;
217	int j;	214	int j;
218		215
219	t = (task_t *) node->value[i];	216	t = (task_t *) node->value[i];
220		217
221	spinlock_lock(&t->lock);	218	spinlock_lock(&t->lock);
222	printf("%s: address=%#zX, taskid=%#llX, as=%#zX, ActiveCalls: %zd",	219	printf("%s: address=%#zX, taskid=%#llX, as=%#zX, ActiveCalls: %zd",
223	t->name, t, t->taskid, t->as, atomic_get(&t->active_calls));	220	t->name, t, t->taskid, t->as, atomic_get(&t->active_calls));
224	for (j=0; j < IPC_MAX_PHONES; j++) {	221	for (j=0; j < IPC_MAX_PHONES; j++) {
225	if (t->phones[j].callee)	222	if (t->phones[j].callee)
226	printf(" Ph(%zd): %#zX ", j, t->phones[j].callee);	223	printf(" Ph(%zd): %#zX ", j, t->phones[j].callee);
227	}	224	}
228	printf("\n");	225	printf("\n");
229	spinlock_unlock(&t->lock);	226	spinlock_unlock(&t->lock);
230	}	227	}
231	}	228	}
232		229
233	spinlock_unlock(&tasks_lock);	230	spinlock_unlock(&tasks_lock);
234	interrupts_restore(ipl);	231	interrupts_restore(ipl);
235	}	232	}
236		233

Subversion Repositories HelenOS-historic

(root)/kernel/trunk/generic/src/proc/task.c – Rev 1288 → 1358