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