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