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 <ipc/ns.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;
   
    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);
    memsetb((__address)&ta->phones, sizeof(ta->phones[0])*IPC_MAX_PHONES, 0);
    if (ipc_phone_0)
        ipc_phone_init(&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 *) config.init_addr, as);
    if (rc != EE_OK) {
        as_free(as);
        return NULL;
    }
   
    task = task_create(as);
    t = thread_create(uinit, (void *)((elf_header_t *) config.init_addr)->e_entry,
              task, THREAD_USER_STACK);
   
    /*
     * Create the data as_area.
     */
    a = as_area_create(as, AS_AREA_STACK, 1, USTACK_ADDRESS);
   
    thread_ready(t);
 
    return task;
}
 

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

Subversion Repositories HelenOS-historic

(root)/kernel/trunk/generic/src/proc/task.c – Rev 998 → 1005