Subversion Repositories HelenOS

Rev

Rev 1048 | Rev 1062 | 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>
703 jermar 32
#include <mm/as.h>
814 palkovsky 33
#include <mm/slab.h>
1 jermar 34
 
35
#include <synch/spinlock.h>
36
#include <arch.h>
37
#include <panic.h>
788 jermar 38
#include <adt/list.h>
955 palkovsky 39
#include <ipc/ipc.h>
40
#include <memstr.h>
1060 palkovsky 41
#include <print.h>
1 jermar 42
 
973 palkovsky 43
#include <elf.h>
44
 
623 jermar 45
SPINLOCK_INITIALIZE(tasks_lock);
624 jermar 46
LIST_INITIALIZE(tasks_head);
1005 palkovsky 47
static task_id_t task_counter = 0;
1 jermar 48
 
107 decky 49
/** Initialize tasks
50
 *
51
 * Initialize kernel tasks support.
52
 *
53
 */
1 jermar 54
void task_init(void)
55
{
15 jermar 56
    TASK = NULL;
1 jermar 57
}
58
 
107 decky 59
 
60
/** Create new task
61
 *
62
 * Create new task with no threads.
63
 *
703 jermar 64
 * @param as Task's address space.
107 decky 65
 *
973 palkovsky 66
 * @return New task's structure
107 decky 67
 *
68
 */
703 jermar 69
task_t *task_create(as_t *as)
1 jermar 70
{
413 jermar 71
    ipl_t ipl;
1 jermar 72
    task_t *ta;
1040 palkovsky 73
    int i;
1 jermar 74
 
822 palkovsky 75
    ta = (task_t *) malloc(sizeof(task_t), 0);
76
 
77
    spinlock_initialize(&ta->lock, "task_ta_lock");
78
    list_initialize(&ta->th_head);
79
    list_initialize(&ta->tasks_link);
80
    ta->as = as;
955 palkovsky 81
 
1040 palkovsky 82
 
955 palkovsky 83
    ipc_answerbox_init(&ta->answerbox);
1040 palkovsky 84
    for (i=0; i < IPC_MAX_PHONES;i++)
85
        ipc_phone_init(&ta->phones[i]);
965 palkovsky 86
    if (ipc_phone_0)
1040 palkovsky 87
        ipc_phone_connect(&ta->phones[0], ipc_phone_0);
998 palkovsky 88
    atomic_set(&ta->active_calls, 0);
822 palkovsky 89
 
90
    ipl = interrupts_disable();
91
    spinlock_lock(&tasks_lock);
1005 palkovsky 92
 
93
    ta->taskid = ++task_counter;
822 palkovsky 94
    list_append(&ta->tasks_link, &tasks_head);
1005 palkovsky 95
 
822 palkovsky 96
    spinlock_unlock(&tasks_lock);
97
    interrupts_restore(ipl);
98
 
1 jermar 99
    return ta;
100
}
101
 
973 palkovsky 102
/** Create new task with 1 thread and run it
103
 *
104
 * @return Task of the running program or NULL on error
105
 */
106
task_t * task_run_program(void *program_addr)
107
{
108
    as_t *as;
109
    as_area_t *a;
110
    int rc;
111
    thread_t *t;
112
    task_t *task;
113
 
114
    as = as_create(0);
115
 
1025 palkovsky 116
    rc = elf_load((elf_header_t *) program_addr, as);
973 palkovsky 117
    if (rc != EE_OK) {
118
        as_free(as);
119
        return NULL;
120
    }
121
 
122
    task = task_create(as);
1025 palkovsky 123
    t = thread_create(uinit, (void *)((elf_header_t *)program_addr)->e_entry,
973 palkovsky 124
              task, THREAD_USER_STACK);
125
 
126
    /*
127
     * Create the data as_area.
128
     */
1048 jermar 129
    a = as_area_create(as, AS_AREA_READ | AS_AREA_WRITE, PAGE_SIZE, USTACK_ADDRESS);
973 palkovsky 130
 
131
    thread_ready(t);
132
 
133
    return task;
134
}
1060 palkovsky 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
}