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/list.h>
#include <ipc/ipc.h>
#include <memstr.h>
#include <print.h>
 
#include <elf.h>
 
SPINLOCK_INITIALIZE(tasks_lock);
LIST_INITIALIZE(tasks_head);
static task_id_t task_counter = 0;
 
/** Initialize tasks
 *
 * Initialize kernel tasks support.
 *
 */
void task_init(void)
{
    TASK = 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);
 
    spinlock_initialize(&ta->lock, "task_ta_lock");
    list_initialize(&ta->th_head);
    list_initialize(&ta->tasks_link);
    ta->as = as;
    ta->name = name;
 
   
    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;
    list_append(&ta->tasks_link, &tasks_head);
 
    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);
 
    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);
    t = thread_create(uinit, kernel_uarg, task, 0, "uinit");
   
    /*
     * Create the data as_area.
     */
    a = as_area_create(as, AS_AREA_READ | AS_AREA_WRITE, PAGE_SIZE, USTACK_ADDRESS);
   
    thread_ready(t);
 
    return task;
}
 
/** Print task list */
void task_print_list(void)
{
    link_t *cur;
    task_t *t;
    ipl_t ipl;
    int i;
   
    /* Messing with thread structures, avoid deadlock */
    ipl = interrupts_disable();
    spinlock_lock(&tasks_lock);
 
    for (cur=tasks_head.next; cur!=&tasks_head; cur=cur->next) {
        t = list_get_instance(cur, task_t, tasks_link);
        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 (i=0; i < IPC_MAX_PHONES; i++) {
            if (t->phones[i].callee)
                printf(" Ph(%d): %P ", i,t->phones[i].callee);
        }
        printf("\n");
        spinlock_unlock(&t->lock);
    }
 
    spinlock_unlock(&tasks_lock);
    interrupts_restore(ipl);
   
}
 

Rev 1066	Rev 1078
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 <mm/as.h>	33	#include <mm/as.h>
33	#include <mm/slab.h>	34	#include <mm/slab.h>
34		-
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/list.h>	38	#include <adt/list.h>
39	#include <ipc/ipc.h>	39	#include <ipc/ipc.h>
40	#include <memstr.h>	40	#include <memstr.h>
41	#include <print.h>	41	#include <print.h>
42		-
43	#include <elf.h>	42	#include <elf.h>
44		43
45	SPINLOCK_INITIALIZE(tasks_lock);	44	SPINLOCK_INITIALIZE(tasks_lock);
46	LIST_INITIALIZE(tasks_head);	45	LIST_INITIALIZE(tasks_head);
47	static task_id_t task_counter = 0;	46	static task_id_t task_counter = 0;
48		47
49	/** Initialize tasks	48	/** Initialize tasks
50	*	49	*
51	* Initialize kernel tasks support.	50	* Initialize kernel tasks support.
52	*	51	*
53	*/	52	*/
54	void task_init(void)	53	void task_init(void)
55	{	54	{
56	TASK = NULL;	55	TASK = NULL;
57	}	56	}
58		57
59		58
60	/** Create new task	59	/** Create new task
61	*	60	*
62	* Create new task with no threads.	61	* Create new task with no threads.
63	*	62	*
64	* @param as Task's address space.	63	* @param as Task's address space.
65	* @param name Symbolic name.	64	* @param name Symbolic name.
66	*	65	*
67	* @return New task's structure	66	* @return New task's structure
68	*	67	*
69	*/	68	*/
70	task_t task_create(as_t as, char *name)	69	task_t task_create(as_t as, char *name)
71	{	70	{
72	ipl_t ipl;	71	ipl_t ipl;
73	task_t *ta;	72	task_t *ta;
74	int i;	73	int i;
75		74
76	ta = (task_t *) malloc(sizeof(task_t), 0);	75	ta = (task_t *) malloc(sizeof(task_t), 0);
77		76
78	spinlock_initialize(&ta->lock, "task_ta_lock");	77	spinlock_initialize(&ta->lock, "task_ta_lock");
79	list_initialize(&ta->th_head);	78	list_initialize(&ta->th_head);
80	list_initialize(&ta->tasks_link);	79	list_initialize(&ta->tasks_link);
81	ta->as = as;	80	ta->as = as;
82	ta->name = name;	81	ta->name = name;
83		82
84		83
85	ipc_answerbox_init(&ta->answerbox);	84	ipc_answerbox_init(&ta->answerbox);
86	for (i=0; i < IPC_MAX_PHONES;i++)	85	for (i=0; i < IPC_MAX_PHONES;i++)
87	ipc_phone_init(&ta->phones[i]);	86	ipc_phone_init(&ta->phones[i]);
88	if (ipc_phone_0)	87	if (ipc_phone_0)
89	ipc_phone_connect(&ta->phones[0], ipc_phone_0);	88	ipc_phone_connect(&ta->phones[0], ipc_phone_0);
90	atomic_set(&ta->active_calls, 0);	89	atomic_set(&ta->active_calls, 0);
91		90
92	ipl = interrupts_disable();	91	ipl = interrupts_disable();
93	spinlock_lock(&tasks_lock);	92	spinlock_lock(&tasks_lock);
94		93
95	ta->taskid = ++task_counter;	94	ta->taskid = ++task_counter;
96	list_append(&ta->tasks_link, &tasks_head);	95	list_append(&ta->tasks_link, &tasks_head);
97		96
98	spinlock_unlock(&tasks_lock);	97	spinlock_unlock(&tasks_lock);
99	interrupts_restore(ipl);	98	interrupts_restore(ipl);
100		99
101	return ta;	100	return ta;
102	}	101	}
103		102
104	/** Create new task with 1 thread and run it	103	/** Create new task with 1 thread and run it
105	*	104	*
106	* @param programe_addr Address of program executable image.	105	* @param programe_addr Address of program executable image.
107	* @param name Program name.	106	* @param name Program name.
108	*	107	*
109	* @return Task of the running program or NULL on error	108	* @return Task of the running program or NULL on error
110	*/	109	*/
111	task_t * task_run_program(void program_addr, char name)	110	task_t * task_run_program(void program_addr, char name)
112	{	111	{
113	as_t *as;	112	as_t *as;
114	as_area_t *a;	113	as_area_t *a;
115	int rc;	114	int rc;
116	thread_t *t;	115	thread_t *t;
117	task_t *task;	116	task_t *task;
118	uspace_arg_t *uarg;	117	uspace_arg_t *kernel_uarg;
119		118
120	as = as_create(0);	119	as = as_create(0);
121		120
122	rc = elf_load((elf_header_t *) program_addr, as);	121	rc = elf_load((elf_header_t *) program_addr, as);
123	if (rc != EE_OK) {	122	if (rc != EE_OK) {
124	as_free(as);	123	as_free(as);
125	return NULL;	124	return NULL;
126	}	125	}
127		126
128	uarg = (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0);	127	kernel_uarg = (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0);
129	uarg->uspace_entry = (__address) ((elf_header_t *) program_addr)->e_entry;	128	kernel_uarg->uspace_entry = (void ) ((elf_header_t ) program_addr)->e_entry;
130	uarg->uspace_stack = USTACK_ADDRESS;	129	kernel_uarg->uspace_stack = (void *) USTACK_ADDRESS;
-		130	kernel_uarg->uspace_thread_function = NULL;
-		131	kernel_uarg->uspace_thread_arg = NULL;
-		132	kernel_uarg->uspace_uarg = NULL;
131		133
132	task = task_create(as, name);	134	task = task_create(as, name);
133	t = thread_create(uinit, uarg, task, 0, "uinit");	135	t = thread_create(uinit, kernel_uarg, task, 0, "uinit");
134		136
135	/*	137	/*
136	* Create the data as_area.	138	* Create the data as_area.
137	*/	139	*/
138	a = as_area_create(as, AS_AREA_READ \| AS_AREA_WRITE, PAGE_SIZE, USTACK_ADDRESS);	140	a = as_area_create(as, AS_AREA_READ \| AS_AREA_WRITE, PAGE_SIZE, USTACK_ADDRESS);
139		141
140	thread_ready(t);	142	thread_ready(t);
141		143
142	return task;	144	return task;
143	}	145	}
144		146
145	/** Print task list */	147	/** Print task list */
146	void task_print_list(void)	148	void task_print_list(void)
147	{	149	{
148	link_t *cur;	150	link_t *cur;
149	task_t *t;	151	task_t *t;
150	ipl_t ipl;	152	ipl_t ipl;
151	int i;	153	int i;
152		154
153	/* Messing with thread structures, avoid deadlock */	155	/* Messing with thread structures, avoid deadlock */
154	ipl = interrupts_disable();	156	ipl = interrupts_disable();
155	spinlock_lock(&tasks_lock);	157	spinlock_lock(&tasks_lock);
156		158
157	for (cur=tasks_head.next; cur!=&tasks_head; cur=cur->next) {	159	for (cur=tasks_head.next; cur!=&tasks_head; cur=cur->next) {
158	t = list_get_instance(cur, task_t, tasks_link);	160	t = list_get_instance(cur, task_t, tasks_link);
159	spinlock_lock(&t->lock);	161	spinlock_lock(&t->lock);
160	printf("%s: address=%P, taskid=%Q, as=%P, ActiveCalls: %d",	162	printf("%s: address=%P, taskid=%Q, as=%P, ActiveCalls: %d",
161	t->name, t, t->taskid, t->as, atomic_get(&t->active_calls));	163	t->name, t, t->taskid, t->as, atomic_get(&t->active_calls));
162	for (i=0; i < IPC_MAX_PHONES; i++) {	164	for (i=0; i < IPC_MAX_PHONES; i++) {
163	if (t->phones[i].callee)	165	if (t->phones[i].callee)
164	printf(" Ph(%d): %P ", i,t->phones[i].callee);	166	printf(" Ph(%d): %P ", i,t->phones[i].callee);
165	}	167	}
166	printf("\n");	168	printf("\n");
167	spinlock_unlock(&t->lock);	169	spinlock_unlock(&t->lock);
168	}	170	}
169		171
170	spinlock_unlock(&tasks_lock);	172	spinlock_unlock(&tasks_lock);
171	interrupts_restore(ipl);	173	interrupts_restore(ipl);
172		174
173	}	175	}
174		176

Subversion Repositories HelenOS-historic

(root)/kernel/trunk/generic/src/proc/task.c – Rev 1066 → 1078