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

Subversion Repositories HelenOS-historic

(root)/kernel/trunk/generic/src/proc/task.c – Rev 1060 → 1062