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

Subversion Repositories HelenOS-historic

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