Subversion Repositories HelenOS-historic

Rev

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

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