Subversion Repositories HelenOS

Rev

Rev 1115 | Rev 1168 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed

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