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.
 *
 * @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, 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("Task: %Q ActiveCalls: %d", t->taskid,
               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 1048	Rev 1060
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		42
42	#include <elf.h>	43	#include <elf.h>
43		44
44	SPINLOCK_INITIALIZE(tasks_lock);	45	SPINLOCK_INITIALIZE(tasks_lock);
45	LIST_INITIALIZE(tasks_head);	46	LIST_INITIALIZE(tasks_head);
46	static task_id_t task_counter = 0;	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	int i;	73	int i;
73		74
74	ta = (task_t *) malloc(sizeof(task_t), 0);	75	ta = (task_t *) malloc(sizeof(task_t), 0);
75		76
76	spinlock_initialize(&ta->lock, "task_ta_lock");	77	spinlock_initialize(&ta->lock, "task_ta_lock");
77	list_initialize(&ta->th_head);	78	list_initialize(&ta->th_head);
78	list_initialize(&ta->tasks_link);	79	list_initialize(&ta->tasks_link);
79	ta->as = as;	80	ta->as = as;
80		81
81		82
82	ipc_answerbox_init(&ta->answerbox);	83	ipc_answerbox_init(&ta->answerbox);
83	for (i=0; i < IPC_MAX_PHONES;i++)	84	for (i=0; i < IPC_MAX_PHONES;i++)
84	ipc_phone_init(&ta->phones[i]);	85	ipc_phone_init(&ta->phones[i]);
85	if (ipc_phone_0)	86	if (ipc_phone_0)
86	ipc_phone_connect(&ta->phones[0], ipc_phone_0);	87	ipc_phone_connect(&ta->phones[0], ipc_phone_0);
87	atomic_set(&ta->active_calls, 0);	88	atomic_set(&ta->active_calls, 0);
88		89
89	ipl = interrupts_disable();	90	ipl = interrupts_disable();
90	spinlock_lock(&tasks_lock);	91	spinlock_lock(&tasks_lock);
91		92
92	ta->taskid = ++task_counter;	93	ta->taskid = ++task_counter;
93	list_append(&ta->tasks_link, &tasks_head);	94	list_append(&ta->tasks_link, &tasks_head);
94		95
95	spinlock_unlock(&tasks_lock);	96	spinlock_unlock(&tasks_lock);
96	interrupts_restore(ipl);	97	interrupts_restore(ipl);
97		98
98	return ta;	99	return ta;
99	}	100	}
100		101
101	/** Create new task with 1 thread and run it	102	/** Create new task with 1 thread and run it
102	*	103	*
103	* @return Task of the running program or NULL on error	104	* @return Task of the running program or NULL on error
104	*/	105	*/
105	task_t * task_run_program(void *program_addr)	106	task_t * task_run_program(void *program_addr)
106	{	107	{
107	as_t *as;	108	as_t *as;
108	as_area_t *a;	109	as_area_t *a;
109	int rc;	110	int rc;
110	thread_t *t;	111	thread_t *t;
111	task_t *task;	112	task_t *task;
112		113
113	as = as_create(0);	114	as = as_create(0);
114		115
115	rc = elf_load((elf_header_t *) program_addr, as);	116	rc = elf_load((elf_header_t *) program_addr, as);
116	if (rc != EE_OK) {	117	if (rc != EE_OK) {
117	as_free(as);	118	as_free(as);
118	return NULL;	119	return NULL;
119	}	120	}
120		121
121	task = task_create(as);	122	task = task_create(as);
122	t = thread_create(uinit, (void )((elf_header_t )program_addr)->e_entry,	123	t = thread_create(uinit, (void )((elf_header_t )program_addr)->e_entry,
123	task, THREAD_USER_STACK);	124	task, THREAD_USER_STACK);
124		125
125	/*	126	/*
126	* Create the data as_area.	127	* Create the data as_area.
127	*/	128	*/
128	a = as_area_create(as, AS_AREA_READ \| AS_AREA_WRITE, PAGE_SIZE, USTACK_ADDRESS);	129	a = as_area_create(as, AS_AREA_READ \| AS_AREA_WRITE, PAGE_SIZE, USTACK_ADDRESS);
129		130
130	thread_ready(t);	131	thread_ready(t);
131		132
132	return task;	133	return task;
133	}	134	}
-		135
-		136	/** Print task list */
-		137	void task_print_list(void)
-		138	{
-		139	link_t *cur;
-		140	task_t *t;
-		141	ipl_t ipl;
-		142	int i;
-		143
-		144	/* Messing with thread structures, avoid deadlock */
-		145	ipl = interrupts_disable();
-		146	spinlock_lock(&tasks_lock);
-		147
-		148	for (cur=tasks_head.next; cur!=&tasks_head; cur=cur->next) {
-		149	t = list_get_instance(cur, task_t, tasks_link);
-		150	spinlock_lock(&t->lock);
-		151	printf("Task: %Q ActiveCalls: %d", t->taskid,
-		152	atomic_get(&t->active_calls));
-		153	for (i=0; i < IPC_MAX_PHONES; i++) {
-		154	if (t->phones[i].callee)
-		155	printf(" Ph(%d): %P ", i,t->phones[i].callee);
-		156	}
-		157	printf("\n");
-		158	spinlock_unlock(&t->lock);
-		159	}
-		160
-		161	spinlock_unlock(&tasks_lock);
-		162	interrupts_restore(ipl);
-		163
-		164	}
134		165

Subversion Repositories HelenOS-historic

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