Subversion Repositories HelenOS

Rev

Rev 1177 | Rev 1185 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed

Rev Author Line No. Line
1 jermar 1
/*
2
 * Copyright (C) 2001-2004 Jakub Jermar
3
 * All rights reserved.
4
 *
5
 * Redistribution and use in source and binary forms, with or without
6
 * modification, are permitted provided that the following conditions
7
 * are met:
8
 *
9
 * - Redistributions of source code must retain the above copyright
10
 *   notice, this list of conditions and the following disclaimer.
11
 * - Redistributions in binary form must reproduce the above copyright
12
 *   notice, this list of conditions and the following disclaimer in the
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
15
 *   derived from this software without specific prior written permission.
16
 *
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
19
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
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
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
26
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27
 */
28
 
973 palkovsky 29
#include <main/uinit.h>
1 jermar 30
#include <proc/thread.h>
31
#include <proc/task.h>
1078 jermar 32
#include <proc/uarg.h>
703 jermar 33
#include <mm/as.h>
814 palkovsky 34
#include <mm/slab.h>
1 jermar 35
#include <synch/spinlock.h>
36
#include <arch.h>
37
#include <panic.h>
1159 jermar 38
#include <adt/btree.h>
788 jermar 39
#include <adt/list.h>
955 palkovsky 40
#include <ipc/ipc.h>
1174 jermar 41
#include <security/cap.h>
955 palkovsky 42
#include <memstr.h>
1060 palkovsky 43
#include <print.h>
973 palkovsky 44
#include <elf.h>
45
 
1168 vana 46
 
1170 vana 47
#ifndef LOADED_PROG_STACK_PAGES_NO
48
#define LOADED_PROG_STACK_PAGES_NO 1
49
#endif
1168 vana 50
 
623 jermar 51
SPINLOCK_INITIALIZE(tasks_lock);
1159 jermar 52
btree_t tasks_btree;
1005 palkovsky 53
static task_id_t task_counter = 0;
1 jermar 54
 
107 decky 55
/** Initialize tasks
56
 *
57
 * Initialize kernel tasks support.
58
 *
59
 */
1 jermar 60
void task_init(void)
61
{
15 jermar 62
    TASK = NULL;
1159 jermar 63
    btree_create(&tasks_btree);
1 jermar 64
}
65
 
107 decky 66
 
67
/** Create new task
68
 *
69
 * Create new task with no threads.
70
 *
703 jermar 71
 * @param as Task's address space.
1062 jermar 72
 * @param name Symbolic name.
107 decky 73
 *
973 palkovsky 74
 * @return New task's structure
107 decky 75
 *
76
 */
1062 jermar 77
task_t *task_create(as_t *as, char *name)
1 jermar 78
{
413 jermar 79
    ipl_t ipl;
1 jermar 80
    task_t *ta;
1040 palkovsky 81
    int i;
1 jermar 82
 
822 palkovsky 83
    ta = (task_t *) malloc(sizeof(task_t), 0);
84
 
85
    spinlock_initialize(&ta->lock, "task_ta_lock");
86
    list_initialize(&ta->th_head);
87
    ta->as = as;
1062 jermar 88
    ta->name = name;
955 palkovsky 89
 
1174 jermar 90
    ta->capabilities = 0;
1040 palkovsky 91
 
955 palkovsky 92
    ipc_answerbox_init(&ta->answerbox);
1040 palkovsky 93
    for (i=0; i < IPC_MAX_PHONES;i++)
94
        ipc_phone_init(&ta->phones[i]);
965 palkovsky 95
    if (ipc_phone_0)
1040 palkovsky 96
        ipc_phone_connect(&ta->phones[0], ipc_phone_0);
998 palkovsky 97
    atomic_set(&ta->active_calls, 0);
822 palkovsky 98
 
99
    ipl = interrupts_disable();
100
    spinlock_lock(&tasks_lock);
1005 palkovsky 101
 
102
    ta->taskid = ++task_counter;
1177 jermar 103
    btree_insert(&tasks_btree, (btree_key_t) ta->taskid, (void *) ta, NULL);
1005 palkovsky 104
 
822 palkovsky 105
    spinlock_unlock(&tasks_lock);
106
    interrupts_restore(ipl);
107
 
1 jermar 108
    return ta;
109
}
110
 
973 palkovsky 111
/** Create new task with 1 thread and run it
112
 *
1062 jermar 113
 * @param programe_addr Address of program executable image.
114
 * @param name Program name.
115
 *
973 palkovsky 116
 * @return Task of the running program or NULL on error
117
 */
1062 jermar 118
task_t * task_run_program(void *program_addr, char *name)
973 palkovsky 119
{
120
    as_t *as;
121
    as_area_t *a;
122
    int rc;
123
    thread_t *t;
124
    task_t *task;
1078 jermar 125
    uspace_arg_t *kernel_uarg;
973 palkovsky 126
 
127
    as = as_create(0);
1115 jermar 128
    ASSERT(as);
973 palkovsky 129
 
1025 palkovsky 130
    rc = elf_load((elf_header_t *) program_addr, as);
973 palkovsky 131
    if (rc != EE_OK) {
132
        as_free(as);
133
        return NULL;
134
    }
135
 
1078 jermar 136
    kernel_uarg = (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0);
137
    kernel_uarg->uspace_entry = (void *) ((elf_header_t *) program_addr)->e_entry;
138
    kernel_uarg->uspace_stack = (void *) USTACK_ADDRESS;
139
    kernel_uarg->uspace_thread_function = NULL;
140
    kernel_uarg->uspace_thread_arg = NULL;
141
    kernel_uarg->uspace_uarg = NULL;
1066 jermar 142
 
1062 jermar 143
    task = task_create(as, name);
1115 jermar 144
    ASSERT(task);
145
 
973 palkovsky 146
    /*
147
     * Create the data as_area.
148
     */
1168 vana 149
    a = as_area_create(as, AS_AREA_READ | AS_AREA_WRITE, LOADED_PROG_STACK_PAGES_NO*PAGE_SIZE, USTACK_ADDRESS);
1115 jermar 150
 
151
    t = thread_create(uinit, kernel_uarg, task, 0, "uinit");
152
    ASSERT(t);
153
    thread_ready(t);
973 palkovsky 154
 
155
    return task;
156
}
1060 palkovsky 157
 
1176 jermar 158
/** Syscall for reading task ID from userspace.
159
 *
160
 * @param uaddr Userspace address of 8-byte buffer where to store current task ID.
161
 *
162
 * @return Always returns 0.
163
 */
164
__native sys_get_task_id(task_id_t *uspace_task_id)
165
{
166
    /*
167
     * No need to acquire lock on TASK because taskid
168
     * remains constant for the lifespan of the task.
169
     */
170
    copy_to_uspace(uspace_task_id, &TASK->taskid, sizeof(TASK->taskid));
171
 
172
    return 0;
173
}
174
 
1178 jermar 175
/** Find task structure corresponding to task ID.
176
 *
177
 * The tasks_lock must be already held by the caller of this function
178
 * and interrupts must be disabled.
179
 *
180
 * @param id Task ID.
181
 *
182
 * @return Task structure address or NULL if there is no such task ID.
183
 */
184
task_t *task_find_by_id(task_id_t id)
185
{
186
    btree_node_t *leaf;
187
 
188
    return (task_t *) btree_search(&tasks_btree, (btree_key_t) id, &leaf);
189
}
190
 
1060 palkovsky 191
/** Print task list */
192
void task_print_list(void)
193
{
194
    link_t *cur;
195
    ipl_t ipl;
196
 
197
    /* Messing with thread structures, avoid deadlock */
198
    ipl = interrupts_disable();
199
    spinlock_lock(&tasks_lock);
200
 
1159 jermar 201
    for (cur = tasks_btree.leaf_head.next; cur != &tasks_btree.leaf_head; cur = cur->next) {
202
        btree_node_t *node;
203
        int i;
204
 
205
        node = list_get_instance(cur, btree_node_t, leaf_link);
206
        for (i = 0; i < node->keys; i++) {
207
            task_t *t;
208
            int j;
209
 
210
            t = (task_t *) node->value[i];
211
 
212
            spinlock_lock(&t->lock);
213
            printf("%s: address=%P, taskid=%Q, as=%P, ActiveCalls: %d",
214
                t->name, t, t->taskid, t->as, atomic_get(&t->active_calls));
215
            for (j=0; j < IPC_MAX_PHONES; j++) {
216
                if (t->phones[j].callee)
217
                    printf(" Ph(%d): %P ", j, t->phones[j].callee);
218
            }
219
            printf("\n");
220
            spinlock_unlock(&t->lock);
1060 palkovsky 221
        }
222
    }
223
 
224
    spinlock_unlock(&tasks_lock);
225
    interrupts_restore(ipl);
226
 
227
}