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/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);
   
    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);
 
    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_get_task_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=%P, taskid=%Q, as=%P, ActiveCalls: %d",
                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(%d): %P ", j, t->phones[j].callee);
            }
            printf("\n");
            spinlock_unlock(&t->lock);
        }
    }
 
    spinlock_unlock(&tasks_lock);
    interrupts_restore(ipl);
   
}
 

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

Subversion Repositories HelenOS-historic

(root)/kernel/trunk/generic/src/proc/task.c @ 1757 – Rev 1178 → 1185