Rev 506 | Rev 512 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 506 | Rev 510 | ||
---|---|---|---|
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 <arch/asm.h> |
29 | #include <arch/asm.h> |
30 | #include <context.h> |
30 | #include <context.h> |
31 | #include <print.h> |
31 | #include <print.h> |
32 | #include <panic.h> |
32 | #include <panic.h> |
33 | #include <config.h> |
33 | #include <config.h> |
34 | #include <time/clock.h> |
34 | #include <time/clock.h> |
35 | #include <proc/scheduler.h> |
35 | #include <proc/scheduler.h> |
36 | #include <proc/thread.h> |
36 | #include <proc/thread.h> |
37 | #include <proc/task.h> |
37 | #include <proc/task.h> |
38 | #include <main/kinit.h> |
38 | #include <main/kinit.h> |
39 | #include <cpu.h> |
39 | #include <cpu.h> |
40 | #include <align.h> |
40 | #include <align.h> |
41 | 41 | ||
42 | #ifdef CONFIG_SMP |
42 | #ifdef CONFIG_SMP |
43 | #include <arch/smp/apic.h> |
43 | #include <arch/smp/apic.h> |
44 | #include <arch/smp/mps.h> |
44 | #include <arch/smp/mps.h> |
45 | #endif /* CONFIG_SMP */ |
45 | #endif /* CONFIG_SMP */ |
46 | 46 | ||
47 | #include <smp/smp.h> |
47 | #include <smp/smp.h> |
48 | 48 | ||
49 | #include <arch/mm/memory_init.h> |
49 | #include <arch/mm/memory_init.h> |
50 | #include <mm/heap.h> |
50 | #include <mm/heap.h> |
51 | #include <mm/frame.h> |
51 | #include <mm/frame.h> |
52 | #include <mm/page.h> |
52 | #include <mm/page.h> |
53 | #include <mm/tlb.h> |
53 | #include <mm/tlb.h> |
54 | #include <mm/vm.h> |
54 | #include <mm/vm.h> |
55 | 55 | ||
56 | #include <synch/waitq.h> |
56 | #include <synch/waitq.h> |
57 | 57 | ||
58 | #include <arch/arch.h> |
58 | #include <arch/arch.h> |
59 | #include <arch.h> |
59 | #include <arch.h> |
60 | #include <arch/faddr.h> |
60 | #include <arch/faddr.h> |
61 | 61 | ||
62 | #include <typedefs.h> |
62 | #include <typedefs.h> |
63 | 63 | ||
64 | char *project = "SPARTAN kernel"; |
64 | char *project = "SPARTAN kernel"; |
65 | char *release = RELEASE " (" NAME ")"; |
65 | char *release = RELEASE " (" NAME ")"; |
66 | #ifdef TAG |
66 | #ifdef TAG |
67 | char *rr_delimiter = "\n"; |
67 | char *rr_delimiter = "\n"; |
68 | char *revision = TAG; |
68 | char *revision = TAG; |
69 | #else |
69 | #else |
70 | char *rr_delimiter = ""; |
70 | char *rr_delimiter = ""; |
71 | char *revision = ""; |
71 | char *revision = ""; |
72 | #endif |
72 | #endif |
73 | char *copyright = "Copyright (C) 2001-2005 Jakub Jermar\nCopyright (C) 2005 HelenOS project"; |
73 | char *copyright = "Copyright (C) 2001-2005 HelenOS project"; |
74 | 74 | ||
75 | config_t config; |
75 | config_t config; |
76 | context_t ctx; |
76 | context_t ctx; |
77 | 77 | ||
78 | /* |
78 | /* |
79 | * These 'hardcoded' variables will be intialised by |
79 | * These 'hardcoded' variables will be intialised by |
80 | * the linker or the low level assembler code with |
80 | * the linker or the low level assembler code with |
81 | * appropriate sizes and addresses. |
81 | * appropriate sizes and addresses. |
82 | */ |
82 | */ |
83 | __address hardcoded_load_address = 0; |
83 | __address hardcoded_load_address = 0; |
84 | size_t hardcoded_ktext_size = 0; |
84 | size_t hardcoded_ktext_size = 0; |
85 | size_t hardcoded_kdata_size = 0; |
85 | size_t hardcoded_kdata_size = 0; |
86 | 86 | ||
87 | __address init_addr = 0; |
87 | __address init_addr = 0; |
88 | size_t init_size = 0; |
88 | size_t init_size = 0; |
89 | 89 | ||
90 | /* |
90 | /* |
91 | * Size of memory in bytes taken by kernel and heap. |
91 | * Size of memory in bytes taken by kernel and heap. |
92 | */ |
92 | */ |
93 | static size_t kernel_size; |
93 | static size_t kernel_size; |
94 | 94 | ||
95 | /* |
95 | /* |
96 | * Size of heap. |
96 | * Size of heap. |
97 | */ |
97 | */ |
98 | static size_t heap_size; |
98 | static size_t heap_size; |
99 | 99 | ||
100 | 100 | ||
101 | /* |
101 | /* |
102 | * Extra space between heap and stack |
102 | * Extra space between heap and stack |
103 | * enforced by alignment requirements. |
103 | * enforced by alignment requirements. |
104 | */ |
104 | */ |
105 | static size_t heap_delta; |
105 | static size_t heap_delta; |
106 | 106 | ||
107 | void main_bsp(void); |
107 | void main_bsp(void); |
108 | void main_ap(void); |
108 | void main_ap(void); |
109 | 109 | ||
110 | /* |
110 | /* |
111 | * These two functions prevent stack from underflowing during the |
111 | * These two functions prevent stack from underflowing during the |
112 | * kernel boot phase when SP is set to the very top of the reserved |
112 | * kernel boot phase when SP is set to the very top of the reserved |
113 | * space. The stack could get corrupted by a fooled compiler-generated |
113 | * space. The stack could get corrupted by a fooled compiler-generated |
114 | * pop sequence otherwise. |
114 | * pop sequence otherwise. |
115 | */ |
115 | */ |
116 | static void main_bsp_separated_stack(void); |
116 | static void main_bsp_separated_stack(void); |
117 | static void main_ap_separated_stack(void); |
117 | static void main_ap_separated_stack(void); |
118 | 118 | ||
119 | /** Bootstrap CPU main kernel routine |
119 | /** Bootstrap CPU main kernel routine |
120 | * |
120 | * |
121 | * Initializes the kernel by bootstrap CPU. |
121 | * Initializes the kernel by bootstrap CPU. |
122 | * |
122 | * |
123 | * Assuming interrupts_disable(). |
123 | * Assuming interrupts_disable(). |
124 | * |
124 | * |
125 | */ |
125 | */ |
126 | void main_bsp(void) |
126 | void main_bsp(void) |
127 | { |
127 | { |
128 | config.cpu_count = 1; |
128 | config.cpu_count = 1; |
129 | config.cpu_active = 1; |
129 | config.cpu_active = 1; |
130 | config.base = hardcoded_load_address; |
130 | config.base = hardcoded_load_address; |
131 | config.memory_size = get_memory_size(); |
131 | config.memory_size = get_memory_size(); |
132 | 132 | ||
133 | heap_size = CONFIG_HEAP_SIZE + (config.memory_size/FRAME_SIZE)*sizeof(frame_t); |
133 | heap_size = CONFIG_HEAP_SIZE + (config.memory_size/FRAME_SIZE)*sizeof(frame_t); |
134 | kernel_size = ALIGN(hardcoded_ktext_size + hardcoded_kdata_size + heap_size, PAGE_SIZE); |
134 | kernel_size = ALIGN(hardcoded_ktext_size + hardcoded_kdata_size + heap_size, PAGE_SIZE); |
135 | heap_delta = kernel_size - (hardcoded_ktext_size + hardcoded_kdata_size + heap_size); |
135 | heap_delta = kernel_size - (hardcoded_ktext_size + hardcoded_kdata_size + heap_size); |
136 | 136 | ||
137 | config.kernel_size = kernel_size + CONFIG_STACK_SIZE; |
137 | config.kernel_size = kernel_size + CONFIG_STACK_SIZE; |
138 | 138 | ||
139 | context_save(&ctx); |
139 | context_save(&ctx); |
140 | early_mapping(config.base + hardcoded_ktext_size + hardcoded_kdata_size, CONFIG_STACK_SIZE + heap_size + heap_delta); |
140 | early_mapping(config.base + hardcoded_ktext_size + hardcoded_kdata_size, CONFIG_STACK_SIZE + heap_size + heap_delta); |
141 | context_set(&ctx, FADDR(main_bsp_separated_stack), config.base + kernel_size, CONFIG_STACK_SIZE); |
141 | context_set(&ctx, FADDR(main_bsp_separated_stack), config.base + kernel_size, CONFIG_STACK_SIZE); |
142 | context_restore(&ctx); |
142 | context_restore(&ctx); |
143 | /* not reached */ |
143 | /* not reached */ |
144 | } |
144 | } |
145 | 145 | ||
146 | 146 | ||
147 | /** Bootstrap CPU main kernel routine stack wrapper |
147 | /** Bootstrap CPU main kernel routine stack wrapper |
148 | * |
148 | * |
149 | * Second part of main_bsp(). |
149 | * Second part of main_bsp(). |
150 | * |
150 | * |
151 | */ |
151 | */ |
152 | void main_bsp_separated_stack(void) |
152 | void main_bsp_separated_stack(void) |
153 | { |
153 | { |
154 | vm_t *m; |
154 | vm_t *m; |
155 | task_t *k; |
155 | task_t *k; |
156 | thread_t *t; |
156 | thread_t *t; |
157 | 157 | ||
158 | the_initialize(THE); |
158 | the_initialize(THE); |
159 | 159 | ||
160 | arch_pre_mm_init(); |
160 | arch_pre_mm_init(); |
161 | early_heap_init(config.base + hardcoded_ktext_size + hardcoded_kdata_size, heap_size + heap_delta); |
161 | early_heap_init(config.base + hardcoded_ktext_size + hardcoded_kdata_size, heap_size + heap_delta); |
162 | frame_init(); |
162 | frame_init(); |
163 | page_init(); |
163 | page_init(); |
164 | tlb_init(); |
164 | tlb_init(); |
165 | arch_post_mm_init(); |
165 | arch_post_mm_init(); |
166 | 166 | ||
167 | printf("%s, release %s%s%s\n%s\n", project, release, rr_delimiter, revision, copyright); |
167 | printf("%s, release %s%s%s\n%s\n", project, release, rr_delimiter, revision, copyright); |
168 | printf("%P: hardcoded_ktext_size=%dK, hardcoded_kdata_size=%dK\n", |
168 | printf("%P: hardcoded_ktext_size=%dK, hardcoded_kdata_size=%dK\n", |
169 | config.base, hardcoded_ktext_size/1024, hardcoded_kdata_size/1024); |
169 | config.base, hardcoded_ktext_size/1024, hardcoded_kdata_size/1024); |
170 | 170 | ||
171 | arch_pre_smp_init(); |
171 | arch_pre_smp_init(); |
172 | smp_init(); |
172 | smp_init(); |
173 | arch_post_smp_init(); |
173 | arch_post_smp_init(); |
174 | printf("config.memory_size=%dM\n", config.memory_size/(1024*1024)); |
174 | printf("config.memory_size=%dM\n", config.memory_size/(1024*1024)); |
175 | printf("config.cpu_count=%d\n", config.cpu_count); |
175 | printf("config.cpu_count=%d\n", config.cpu_count); |
176 | 176 | ||
177 | cpu_init(); |
177 | cpu_init(); |
178 | 178 | ||
179 | calibrate_delay_loop(); |
179 | calibrate_delay_loop(); |
180 | 180 | ||
181 | timeout_init(); |
181 | timeout_init(); |
182 | scheduler_init(); |
182 | scheduler_init(); |
183 | task_init(); |
183 | task_init(); |
184 | thread_init(); |
184 | thread_init(); |
185 | 185 | ||
186 | /* |
186 | /* |
187 | * Create kernel vm mapping. |
187 | * Create kernel vm mapping. |
188 | */ |
188 | */ |
189 | m = vm_create(GET_PTL0_ADDRESS()); |
189 | m = vm_create(GET_PTL0_ADDRESS()); |
190 | if (!m) |
190 | if (!m) |
191 | panic("can't create kernel vm address space\n"); |
191 | panic("can't create kernel vm address space\n"); |
192 | 192 | ||
193 | /* |
193 | /* |
194 | * Create kernel task. |
194 | * Create kernel task. |
195 | */ |
195 | */ |
196 | k = task_create(m); |
196 | k = task_create(m); |
197 | if (!k) |
197 | if (!k) |
198 | panic("can't create kernel task\n"); |
198 | panic("can't create kernel task\n"); |
199 | 199 | ||
200 | /* |
200 | /* |
201 | * Create the first thread. |
201 | * Create the first thread. |
202 | */ |
202 | */ |
203 | t = thread_create(kinit, NULL, k, 0); |
203 | t = thread_create(kinit, NULL, k, 0); |
204 | if (!t) |
204 | if (!t) |
205 | panic("can't create kinit thread\n"); |
205 | panic("can't create kinit thread\n"); |
206 | thread_ready(t); |
206 | thread_ready(t); |
207 | /* |
207 | /* |
208 | * This call to scheduler() will return to kinit, |
208 | * This call to scheduler() will return to kinit, |
209 | * starting the thread of kernel threads. |
209 | * starting the thread of kernel threads. |
210 | */ |
210 | */ |
211 | scheduler(); |
211 | scheduler(); |
212 | /* not reached */ |
212 | /* not reached */ |
213 | } |
213 | } |
214 | 214 | ||
215 | 215 | ||
216 | #ifdef CONFIG_SMP |
216 | #ifdef CONFIG_SMP |
217 | /** Application CPUs main kernel routine |
217 | /** Application CPUs main kernel routine |
218 | * |
218 | * |
219 | * Executed by application processors, temporary stack |
219 | * Executed by application processors, temporary stack |
220 | * is at ctx.sp which was set during BP boot. |
220 | * is at ctx.sp which was set during BP boot. |
221 | * |
221 | * |
222 | * Assuming interrupts_disable()'d. |
222 | * Assuming interrupts_disable()'d. |
223 | * |
223 | * |
224 | */ |
224 | */ |
225 | void main_ap(void) |
225 | void main_ap(void) |
226 | { |
226 | { |
227 | /* |
227 | /* |
228 | * Incrementing the active CPU counter will guarantee that the |
228 | * Incrementing the active CPU counter will guarantee that the |
229 | * pm_init() will not attempt to build GDT and IDT tables again. |
229 | * pm_init() will not attempt to build GDT and IDT tables again. |
230 | * Neither frame_init() will do the complete thing. Neither cpu_init() |
230 | * Neither frame_init() will do the complete thing. Neither cpu_init() |
231 | * will do. |
231 | * will do. |
232 | */ |
232 | */ |
233 | config.cpu_active++; |
233 | config.cpu_active++; |
234 | 234 | ||
235 | /* |
235 | /* |
236 | * The THE structure is well defined because ctx.sp is used as stack. |
236 | * The THE structure is well defined because ctx.sp is used as stack. |
237 | */ |
237 | */ |
238 | the_initialize(THE); |
238 | the_initialize(THE); |
239 | 239 | ||
240 | arch_pre_mm_init(); |
240 | arch_pre_mm_init(); |
241 | frame_init(); |
241 | frame_init(); |
242 | page_init(); |
242 | page_init(); |
243 | tlb_init(); |
243 | tlb_init(); |
244 | arch_post_mm_init(); |
244 | arch_post_mm_init(); |
245 | 245 | ||
246 | cpu_init(); |
246 | cpu_init(); |
247 | 247 | ||
248 | calibrate_delay_loop(); |
248 | calibrate_delay_loop(); |
249 | 249 | ||
250 | l_apic_init(); |
250 | l_apic_init(); |
251 | l_apic_debug(); |
251 | l_apic_debug(); |
252 | 252 | ||
253 | the_copy(THE, (the_t *) CPU->stack); |
253 | the_copy(THE, (the_t *) CPU->stack); |
254 | 254 | ||
255 | /* |
255 | /* |
256 | * If we woke kmp up before we left the kernel stack, we could |
256 | * If we woke kmp up before we left the kernel stack, we could |
257 | * collide with another CPU coming up. To prevent this, we |
257 | * collide with another CPU coming up. To prevent this, we |
258 | * switch to this cpu's private stack prior to waking kmp up. |
258 | * switch to this cpu's private stack prior to waking kmp up. |
259 | */ |
259 | */ |
260 | context_set(&CPU->saved_context, FADDR(main_ap_separated_stack), (__address) CPU->stack, CPU_STACK_SIZE); |
260 | context_set(&CPU->saved_context, FADDR(main_ap_separated_stack), (__address) CPU->stack, CPU_STACK_SIZE); |
261 | context_restore(&CPU->saved_context); |
261 | context_restore(&CPU->saved_context); |
262 | /* not reached */ |
262 | /* not reached */ |
263 | } |
263 | } |
264 | 264 | ||
265 | 265 | ||
266 | /** Application CPUs main kernel routine stack wrapper |
266 | /** Application CPUs main kernel routine stack wrapper |
267 | * |
267 | * |
268 | * Second part of main_ap(). |
268 | * Second part of main_ap(). |
269 | * |
269 | * |
270 | */ |
270 | */ |
271 | void main_ap_separated_stack(void) |
271 | void main_ap_separated_stack(void) |
272 | { |
272 | { |
273 | /* |
273 | /* |
274 | * Configure timeouts for this cpu. |
274 | * Configure timeouts for this cpu. |
275 | */ |
275 | */ |
276 | timeout_init(); |
276 | timeout_init(); |
277 | 277 | ||
278 | waitq_wakeup(&ap_completion_wq, WAKEUP_FIRST); |
278 | waitq_wakeup(&ap_completion_wq, WAKEUP_FIRST); |
279 | scheduler(); |
279 | scheduler(); |
280 | /* not reached */ |
280 | /* not reached */ |
281 | } |
281 | } |
282 | #endif /* CONFIG_SMP */ |
282 | #endif /* CONFIG_SMP */ |
283 | 283 |