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

Subversion Repositories HelenOS-historic

(root)/kernel/trunk/generic/src/proc/task.c – Rev 1235 → 1239