Subversion Repositories HelenOS

Rev

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

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