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 <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.
 *
 * @return New task's structure
 *
 */
task_t *task_create(as_t *as)
{
    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;
 
   
    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
 *
 * @return Task of the running program or NULL on error
 */
task_t * task_run_program(void *program_addr)
{
    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);
    t = thread_create(uinit, (void *)((elf_header_t *)program_addr)->e_entry,
              task, THREAD_USER_STACK);
   
    /*
     * Create the data as_area.
     */
    a = as_area_create(as, AS_AREA_READ | AS_AREA_WRITE, 1, USTACK_ADDRESS);
   
    thread_ready(t);
 
    return task;
}
 

Rev 1026	Rev 1040
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		41
42	#include <elf.h>	42	#include <elf.h>
43		43
44	SPINLOCK_INITIALIZE(tasks_lock);	44	SPINLOCK_INITIALIZE(tasks_lock);
45	LIST_INITIALIZE(tasks_head);	45	LIST_INITIALIZE(tasks_head);
46	static task_id_t task_counter = 0;	46	static task_id_t task_counter = 0;
47		47
48	/** Initialize tasks	48	/** Initialize tasks
49	*	49	*
50	* Initialize kernel tasks support.	50	* Initialize kernel tasks support.
51	*	51	*
52	*/	52	*/
53	void task_init(void)	53	void task_init(void)
54	{	54	{
55	TASK = NULL;	55	TASK = NULL;
56	}	56	}
57		57
58		58
59	/** Create new task	59	/** Create new task
60	*	60	*
61	* Create new task with no threads.	61	* Create new task with no threads.
62	*	62	*
63	* @param as Task's address space.	63	* @param as Task's address space.
64	*	64	*
65	* @return New task's structure	65	* @return New task's structure
66	*	66	*
67	*/	67	*/
68	task_t task_create(as_t as)	68	task_t task_create(as_t as)
69	{	69	{
70	ipl_t ipl;	70	ipl_t ipl;
71	task_t *ta;	71	task_t *ta;
-		72	int i;
72		73
73	ta = (task_t *) malloc(sizeof(task_t), 0);	74	ta = (task_t *) malloc(sizeof(task_t), 0);
74		75
75	spinlock_initialize(&ta->lock, "task_ta_lock");	76	spinlock_initialize(&ta->lock, "task_ta_lock");
76	list_initialize(&ta->th_head);	77	list_initialize(&ta->th_head);
77	list_initialize(&ta->tasks_link);	78	list_initialize(&ta->tasks_link);
78	ta->as = as;	79	ta->as = as;
79		80
-		81
80	ipc_answerbox_init(&ta->answerbox);	82	ipc_answerbox_init(&ta->answerbox);
-		83	for (i=0; i < IPC_MAX_PHONES;i++)
81	memsetb((__address)&ta->phones, sizeof(ta->phones[0])*IPC_MAX_PHONES, 0);	84	ipc_phone_init(&ta->phones[i]);
82	if (ipc_phone_0)	85	if (ipc_phone_0)
83	ipc_phone_init(&ta->phones[0], ipc_phone_0);	86	ipc_phone_connect(&ta->phones[0], ipc_phone_0);
84	atomic_set(&ta->active_calls, 0);	87	atomic_set(&ta->active_calls, 0);
85		88
86	ipl = interrupts_disable();	89	ipl = interrupts_disable();
87	spinlock_lock(&tasks_lock);	90	spinlock_lock(&tasks_lock);
88		91
89	ta->taskid = ++task_counter;	92	ta->taskid = ++task_counter;
90	list_append(&ta->tasks_link, &tasks_head);	93	list_append(&ta->tasks_link, &tasks_head);
91		94
92	spinlock_unlock(&tasks_lock);	95	spinlock_unlock(&tasks_lock);
93	interrupts_restore(ipl);	96	interrupts_restore(ipl);
94		97
95	return ta;	98	return ta;
96	}	99	}
97		100
98	/** Create new task with 1 thread and run it	101	/** Create new task with 1 thread and run it
99	*	102	*
100	* @return Task of the running program or NULL on error	103	* @return Task of the running program or NULL on error
101	*/	104	*/
102	task_t * task_run_program(void *program_addr)	105	task_t * task_run_program(void *program_addr)
103	{	106	{
104	as_t *as;	107	as_t *as;
105	as_area_t *a;	108	as_area_t *a;
106	int rc;	109	int rc;
107	thread_t *t;	110	thread_t *t;
108	task_t *task;	111	task_t *task;
109		112
110	as = as_create(0);	113	as = as_create(0);
111		114
112	rc = elf_load((elf_header_t *) program_addr, as);	115	rc = elf_load((elf_header_t *) program_addr, as);
113	if (rc != EE_OK) {	116	if (rc != EE_OK) {
114	as_free(as);	117	as_free(as);
115	return NULL;	118	return NULL;
116	}	119	}
117		120
118	task = task_create(as);	121	task = task_create(as);
119	t = thread_create(uinit, (void )((elf_header_t )program_addr)->e_entry,	122	t = thread_create(uinit, (void )((elf_header_t )program_addr)->e_entry,
120	task, THREAD_USER_STACK);	123	task, THREAD_USER_STACK);
121		124
122	/*	125	/*
123	* Create the data as_area.	126	* Create the data as_area.
124	*/	127	*/
125	a = as_area_create(as, AS_AREA_READ \| AS_AREA_WRITE, 1, USTACK_ADDRESS);	128	a = as_area_create(as, AS_AREA_READ \| AS_AREA_WRITE, 1, USTACK_ADDRESS);
126		129
127	thread_ready(t);	130	thread_ready(t);
128		131
129	return task;	132	return task;
130	}	133	}
131		134

Subversion Repositories HelenOS-historic

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