Subversion Repositories HelenOS-historic

Rev

Rev 1239 | Rev 1358 | 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
 
1248 jermar 29
/**
30
 * @file    task.c
31
 * @brief   Task management.
32
 */
33
 
973 palkovsky 34
#include <main/uinit.h>
1 jermar 35
#include <proc/thread.h>
36
#include <proc/task.h>
1078 jermar 37
#include <proc/uarg.h>
703 jermar 38
#include <mm/as.h>
1235 jermar 39
#include <mm/as_arg.h>
814 palkovsky 40
#include <mm/slab.h>
1 jermar 41
#include <synch/spinlock.h>
42
#include <arch.h>
43
#include <panic.h>
1159 jermar 44
#include <adt/btree.h>
788 jermar 45
#include <adt/list.h>
955 palkovsky 46
#include <ipc/ipc.h>
1174 jermar 47
#include <security/cap.h>
955 palkovsky 48
#include <memstr.h>
1060 palkovsky 49
#include <print.h>
973 palkovsky 50
#include <elf.h>
51
 
1168 vana 52
 
1170 vana 53
#ifndef LOADED_PROG_STACK_PAGES_NO
54
#define LOADED_PROG_STACK_PAGES_NO 1
55
#endif
1168 vana 56
 
623 jermar 57
SPINLOCK_INITIALIZE(tasks_lock);
1159 jermar 58
btree_t tasks_btree;
1005 palkovsky 59
static task_id_t task_counter = 0;
1 jermar 60
 
107 decky 61
/** Initialize tasks
62
 *
63
 * Initialize kernel tasks support.
64
 *
65
 */
1 jermar 66
void task_init(void)
67
{
15 jermar 68
    TASK = NULL;
1159 jermar 69
    btree_create(&tasks_btree);
1 jermar 70
}
71
 
107 decky 72
 
73
/** Create new task
74
 *
75
 * Create new task with no threads.
76
 *
703 jermar 77
 * @param as Task's address space.
1062 jermar 78
 * @param name Symbolic name.
107 decky 79
 *
973 palkovsky 80
 * @return New task's structure
107 decky 81
 *
82
 */
1062 jermar 83
task_t *task_create(as_t *as, char *name)
1 jermar 84
{
413 jermar 85
    ipl_t ipl;
1 jermar 86
    task_t *ta;
1040 palkovsky 87
    int i;
1 jermar 88
 
822 palkovsky 89
    ta = (task_t *) malloc(sizeof(task_t), 0);
90
 
1185 jermar 91
    task_create_arch(ta);
92
 
822 palkovsky 93
    spinlock_initialize(&ta->lock, "task_ta_lock");
94
    list_initialize(&ta->th_head);
95
    ta->as = as;
1062 jermar 96
    ta->name = name;
955 palkovsky 97
 
1174 jermar 98
    ta->capabilities = 0;
1040 palkovsky 99
 
955 palkovsky 100
    ipc_answerbox_init(&ta->answerbox);
1040 palkovsky 101
    for (i=0; i < IPC_MAX_PHONES;i++)
102
        ipc_phone_init(&ta->phones[i]);
965 palkovsky 103
    if (ipc_phone_0)
1040 palkovsky 104
        ipc_phone_connect(&ta->phones[0], ipc_phone_0);
998 palkovsky 105
    atomic_set(&ta->active_calls, 0);
822 palkovsky 106
 
1235 jermar 107
    memsetb((__address) &ta->accept_arg, sizeof(as_area_acptsnd_arg_t), 0);
108
 
822 palkovsky 109
    ipl = interrupts_disable();
110
    spinlock_lock(&tasks_lock);
1005 palkovsky 111
 
112
    ta->taskid = ++task_counter;
1177 jermar 113
    btree_insert(&tasks_btree, (btree_key_t) ta->taskid, (void *) ta, NULL);
1005 palkovsky 114
 
822 palkovsky 115
    spinlock_unlock(&tasks_lock);
116
    interrupts_restore(ipl);
117
 
1 jermar 118
    return ta;
119
}
120
 
973 palkovsky 121
/** Create new task with 1 thread and run it
122
 *
1248 jermar 123
 * @param program_addr Address of program executable image.
1062 jermar 124
 * @param name Program name.
125
 *
1229 jermar 126
 * @return Task of the running program or NULL on error.
973 palkovsky 127
 */
1062 jermar 128
task_t * task_run_program(void *program_addr, char *name)
973 palkovsky 129
{
130
    as_t *as;
131
    as_area_t *a;
132
    int rc;
133
    thread_t *t;
134
    task_t *task;
1078 jermar 135
    uspace_arg_t *kernel_uarg;
973 palkovsky 136
 
137
    as = as_create(0);
1115 jermar 138
    ASSERT(as);
973 palkovsky 139
 
1025 palkovsky 140
    rc = elf_load((elf_header_t *) program_addr, as);
973 palkovsky 141
    if (rc != EE_OK) {
142
        as_free(as);
143
        return NULL;
144
    }
145
 
1078 jermar 146
    kernel_uarg = (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0);
147
    kernel_uarg->uspace_entry = (void *) ((elf_header_t *) program_addr)->e_entry;
148
    kernel_uarg->uspace_stack = (void *) USTACK_ADDRESS;
149
    kernel_uarg->uspace_thread_function = NULL;
150
    kernel_uarg->uspace_thread_arg = NULL;
151
    kernel_uarg->uspace_uarg = NULL;
1066 jermar 152
 
1062 jermar 153
    task = task_create(as, name);
1115 jermar 154
    ASSERT(task);
155
 
973 palkovsky 156
    /*
157
     * Create the data as_area.
158
     */
1239 jermar 159
    a = as_area_create(as, AS_AREA_READ | AS_AREA_WRITE, LOADED_PROG_STACK_PAGES_NO*PAGE_SIZE,
160
        USTACK_ADDRESS, AS_AREA_ATTR_NONE);
1115 jermar 161
 
162
    t = thread_create(uinit, kernel_uarg, task, 0, "uinit");
163
    ASSERT(t);
164
    thread_ready(t);
973 palkovsky 165
 
166
    return task;
167
}
1060 palkovsky 168
 
1176 jermar 169
/** Syscall for reading task ID from userspace.
170
 *
1248 jermar 171
 * @param uspace_task_id Userspace address of 8-byte buffer where to store current task ID.
1176 jermar 172
 *
173
 * @return Always returns 0.
174
 */
1227 jermar 175
__native sys_task_get_id(task_id_t *uspace_task_id)
1176 jermar 176
{
177
    /*
178
     * No need to acquire lock on TASK because taskid
179
     * remains constant for the lifespan of the task.
180
     */
181
    copy_to_uspace(uspace_task_id, &TASK->taskid, sizeof(TASK->taskid));
182
 
183
    return 0;
184
}
185
 
1178 jermar 186
/** Find task structure corresponding to task ID.
187
 *
188
 * The tasks_lock must be already held by the caller of this function
189
 * and interrupts must be disabled.
190
 *
191
 * @param id Task ID.
192
 *
193
 * @return Task structure address or NULL if there is no such task ID.
194
 */
195
task_t *task_find_by_id(task_id_t id)
196
{
197
    btree_node_t *leaf;
198
 
199
    return (task_t *) btree_search(&tasks_btree, (btree_key_t) id, &leaf);
200
}
201
 
1060 palkovsky 202
/** Print task list */
203
void task_print_list(void)
204
{
205
    link_t *cur;
206
    ipl_t ipl;
207
 
208
    /* Messing with thread structures, avoid deadlock */
209
    ipl = interrupts_disable();
210
    spinlock_lock(&tasks_lock);
211
 
1159 jermar 212
    for (cur = tasks_btree.leaf_head.next; cur != &tasks_btree.leaf_head; cur = cur->next) {
213
        btree_node_t *node;
214
        int i;
215
 
216
        node = list_get_instance(cur, btree_node_t, leaf_link);
217
        for (i = 0; i < node->keys; i++) {
218
            task_t *t;
219
            int j;
220
 
221
            t = (task_t *) node->value[i];
222
 
223
            spinlock_lock(&t->lock);
1196 cejka 224
            printf("%s: address=%#zX, taskid=%#llX, as=%#zX, ActiveCalls: %zd",
1159 jermar 225
                t->name, t, t->taskid, t->as, atomic_get(&t->active_calls));
226
            for (j=0; j < IPC_MAX_PHONES; j++) {
227
                if (t->phones[j].callee)
1196 cejka 228
                    printf(" Ph(%zd): %#zX ", j, t->phones[j].callee);
1159 jermar 229
            }
230
            printf("\n");
231
            spinlock_unlock(&t->lock);
1060 palkovsky 232
        }
233
    }
234
 
235
    spinlock_unlock(&tasks_lock);
236
    interrupts_restore(ipl);
237
}