Rev 2071 | Rev 2089 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 2071 | Rev 2087 | ||
---|---|---|---|
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 | /** @addtogroup main |
29 | /** @addtogroup main |
30 | * @{ |
30 | * @{ |
31 | */ |
31 | */ |
32 | 32 | ||
33 | /** |
33 | /** |
34 | * @file |
34 | * @file |
35 | * @brief Kernel initialization thread. |
35 | * @brief Kernel initialization thread. |
36 | * |
36 | * |
37 | * This file contains kinit kernel thread which carries out |
37 | * This file contains kinit kernel thread which carries out |
38 | * high level system initialization. |
38 | * high level system initialization. |
39 | * |
39 | * |
40 | * This file is responsible for finishing SMP configuration |
40 | * This file is responsible for finishing SMP configuration |
41 | * and creation of userspace init tasks. |
41 | * and creation of userspace init tasks. |
42 | */ |
42 | */ |
43 | 43 | ||
44 | #include <main/kinit.h> |
44 | #include <main/kinit.h> |
45 | #include <config.h> |
45 | #include <config.h> |
46 | #include <arch.h> |
46 | #include <arch.h> |
47 | #include <proc/scheduler.h> |
47 | #include <proc/scheduler.h> |
48 | #include <proc/task.h> |
48 | #include <proc/task.h> |
49 | #include <proc/thread.h> |
49 | #include <proc/thread.h> |
50 | #include <panic.h> |
50 | #include <panic.h> |
51 | #include <func.h> |
51 | #include <func.h> |
52 | #include <cpu.h> |
52 | #include <cpu.h> |
53 | #include <arch/asm.h> |
53 | #include <arch/asm.h> |
54 | #include <mm/page.h> |
54 | #include <mm/page.h> |
55 | #include <arch/mm/page.h> |
55 | #include <arch/mm/page.h> |
56 | #include <mm/as.h> |
56 | #include <mm/as.h> |
57 | #include <mm/frame.h> |
57 | #include <mm/frame.h> |
58 | #include <print.h> |
58 | #include <print.h> |
59 | #include <memstr.h> |
59 | #include <memstr.h> |
60 | #include <console/console.h> |
60 | #include <console/console.h> |
61 | #include <interrupt.h> |
61 | #include <interrupt.h> |
62 | #include <console/kconsole.h> |
62 | #include <console/kconsole.h> |
63 | #include <security/cap.h> |
63 | #include <security/cap.h> |
64 | #include <lib/rd.h> |
64 | #include <lib/rd.h> |
65 | 65 | ||
66 | #ifdef CONFIG_SMP |
66 | #ifdef CONFIG_SMP |
67 | #include <smp/smp.h> |
67 | #include <smp/smp.h> |
68 | #endif /* CONFIG_SMP */ |
68 | #endif /* CONFIG_SMP */ |
69 | 69 | ||
70 | #include <synch/waitq.h> |
70 | #include <synch/waitq.h> |
71 | #include <synch/spinlock.h> |
71 | #include <synch/spinlock.h> |
72 | 72 | ||
73 | /** Kernel initialization thread. |
73 | /** Kernel initialization thread. |
74 | * |
74 | * |
75 | * kinit takes care of higher level kernel |
75 | * kinit takes care of higher level kernel |
76 | * initialization (i.e. thread creation, |
76 | * initialization (i.e. thread creation, |
77 | * userspace initialization etc.). |
77 | * userspace initialization etc.). |
78 | * |
78 | * |
79 | * @param arg Not used. |
79 | * @param arg Not used. |
80 | */ |
80 | */ |
81 | void kinit(void *arg) |
81 | void kinit(void *arg) |
82 | { |
82 | { |
83 | thread_t *t; |
83 | thread_t *t; |
84 | 84 | ||
85 | /* |
85 | /* |
86 | * Detach kinit as nobody will call thread_join_timeout() on it. |
86 | * Detach kinit as nobody will call thread_join_timeout() on it. |
87 | */ |
87 | */ |
88 | thread_detach(THREAD); |
88 | thread_detach(THREAD); |
89 | 89 | ||
90 | interrupts_disable(); |
90 | interrupts_disable(); |
91 | 91 | ||
92 | #ifdef CONFIG_SMP |
92 | #ifdef CONFIG_SMP |
93 | if (config.cpu_count > 1) { |
93 | if (config.cpu_count > 1) { |
94 | waitq_initialize(&ap_completion_wq); |
94 | waitq_initialize(&ap_completion_wq); |
95 | /* |
95 | /* |
96 | * Create the kmp thread and wait for its completion. |
96 | * Create the kmp thread and wait for its completion. |
97 | * cpu1 through cpuN-1 will come up consecutively and |
97 | * cpu1 through cpuN-1 will come up consecutively and |
98 | * not mess together with kcpulb threads. |
98 | * not mess together with kcpulb threads. |
99 | * Just a beautification. |
99 | * Just a beautification. |
100 | */ |
100 | */ |
101 | if ((t = thread_create(kmp, NULL, TASK, THREAD_FLAG_WIRED, "kmp", true))) { |
101 | if ((t = thread_create(kmp, NULL, TASK, THREAD_FLAG_WIRED, |
- | 102 | "kmp", true))) { |
|
102 | spinlock_lock(&t->lock); |
103 | spinlock_lock(&t->lock); |
103 | t->cpu = &cpus[0]; |
104 | t->cpu = &cpus[0]; |
104 | spinlock_unlock(&t->lock); |
105 | spinlock_unlock(&t->lock); |
105 | thread_ready(t); |
106 | thread_ready(t); |
106 | } else |
107 | } else |
107 | panic("thread_create/kmp\n"); |
108 | panic("thread_create/kmp\n"); |
108 | thread_join(t); |
109 | thread_join(t); |
109 | thread_detach(t); |
110 | thread_detach(t); |
110 | } |
111 | } |
111 | #endif /* CONFIG_SMP */ |
112 | #endif /* CONFIG_SMP */ |
112 | /* |
113 | /* |
113 | * Now that all CPUs are up, we can report what we've found. |
114 | * Now that all CPUs are up, we can report what we've found. |
114 | */ |
115 | */ |
115 | cpu_list(); |
116 | cpu_list(); |
116 | 117 | ||
117 | #ifdef CONFIG_SMP |
118 | #ifdef CONFIG_SMP |
118 | if (config.cpu_count > 1) { |
119 | if (config.cpu_count > 1) { |
119 | int i; |
120 | int i; |
120 | 121 | ||
121 | /* |
122 | /* |
122 | * For each CPU, create its load balancing thread. |
123 | * For each CPU, create its load balancing thread. |
123 | */ |
124 | */ |
124 | for (i = 0; i < config.cpu_count; i++) { |
125 | for (i = 0; i < config.cpu_count; i++) { |
125 | 126 | ||
- | 127 | if ((t = thread_create(kcpulb, NULL, TASK, |
|
126 | if ((t = thread_create(kcpulb, NULL, TASK, THREAD_FLAG_WIRED, "kcpulb", true))) { |
128 | THREAD_FLAG_WIRED, "kcpulb", true))) { |
127 | spinlock_lock(&t->lock); |
129 | spinlock_lock(&t->lock); |
128 | t->cpu = &cpus[i]; |
130 | t->cpu = &cpus[i]; |
129 | spinlock_unlock(&t->lock); |
131 | spinlock_unlock(&t->lock); |
130 | thread_ready(t); |
132 | thread_ready(t); |
131 | } else |
133 | } else |
132 | panic("thread_create/kcpulb\n"); |
134 | panic("thread_create/kcpulb\n"); |
133 | 135 | ||
134 | } |
136 | } |
135 | } |
137 | } |
136 | #endif /* CONFIG_SMP */ |
138 | #endif /* CONFIG_SMP */ |
137 | 139 | ||
138 | /* |
140 | /* |
139 | * At this point SMP, if present, is configured. |
141 | * At this point SMP, if present, is configured. |
140 | */ |
142 | */ |
141 | arch_post_smp_init(); |
143 | arch_post_smp_init(); |
142 | 144 | ||
143 | /* |
145 | /* |
144 | * Create kernel console. |
146 | * Create kernel console. |
145 | */ |
147 | */ |
146 | if ((t = thread_create(kconsole, "kconsole", TASK, 0, "kconsole", false))) |
148 | t = thread_create(kconsole, "kconsole", TASK, 0, "kconsole", false); |
- | 149 | if (t) |
|
147 | thread_ready(t); |
150 | thread_ready(t); |
148 | else |
151 | else |
149 | panic("thread_create/kconsole\n"); |
152 | panic("thread_create/kconsole\n"); |
150 | 153 | ||
151 | interrupts_enable(); |
154 | interrupts_enable(); |
152 | 155 | ||
153 | count_t i; |
156 | count_t i; |
154 | for (i = 0; i < init.cnt; i++) { |
157 | for (i = 0; i < init.cnt; i++) { |
155 | /* |
158 | /* |
156 | * Run user tasks, load RAM disk images. |
159 | * Run user tasks, load RAM disk images. |
157 | */ |
160 | */ |
158 | 161 | ||
159 | if (init.tasks[i].addr % FRAME_SIZE) { |
162 | if (init.tasks[i].addr % FRAME_SIZE) { |
160 | printf("init[%d].addr is not frame aligned", i); |
163 | printf("init[%d].addr is not frame aligned", i); |
161 | continue; |
164 | continue; |
162 | } |
165 | } |
163 | 166 | ||
164 | task_t *utask = task_run_program((void *) init.tasks[i].addr, "uspace"); |
167 | task_t *utask = task_run_program((void *) init.tasks[i].addr, |
- | 168 | "uspace"); |
|
165 | if (utask) { |
169 | if (utask) { |
166 | /* |
170 | /* |
167 | * Set capabilities to init userspace tasks. |
171 | * Set capabilities to init userspace tasks. |
168 | */ |
172 | */ |
- | 173 | cap_set(utask, CAP_CAP | CAP_MEM_MANAGER | |
|
169 | cap_set(utask, CAP_CAP | CAP_MEM_MANAGER | CAP_IO_MANAGER | CAP_PREEMPT_CONTROL | CAP_IRQ_REG); |
174 | CAP_IO_MANAGER | CAP_PREEMPT_CONTROL | CAP_IRQ_REG); |
170 | 175 | ||
171 | if (!ipc_phone_0) |
176 | if (!ipc_phone_0) |
172 | ipc_phone_0 = &utask->answerbox; |
177 | ipc_phone_0 = &utask->answerbox; |
173 | } else { |
178 | } else { |
174 | int rd = init_rd((rd_header *) init.tasks[i].addr, init.tasks[i].size); |
179 | int rd = init_rd((rd_header *) init.tasks[i].addr, |
- | 180 | init.tasks[i].size); |
|
175 | 181 | ||
176 | if (rd != RE_OK) |
182 | if (rd != RE_OK) |
177 | printf("Init binary %zd not used.\n", i); |
183 | printf("Init binary %zd not used.\n", i); |
178 | } |
184 | } |
179 | } |
185 | } |
180 | 186 | ||
181 | 187 | ||
182 | if (!stdin) { |
188 | if (!stdin) { |
183 | while (1) { |
189 | while (1) { |
184 | thread_sleep(1); |
190 | thread_sleep(1); |
185 | printf("kinit... "); |
191 | printf("kinit... "); |
186 | } |
192 | } |
187 | } |
193 | } |
188 | } |
194 | } |
189 | 195 | ||
190 | /** @} |
196 | /** @} |
191 | */ |
197 | */ |
192 | 198 |