Rev 1901 | Rev 2015 | 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 | |||
1729 | decky | 29 | /** @addtogroup main |
1702 | cejka | 30 | * @{ |
31 | */ |
||
32 | |||
1248 | jermar | 33 | /** |
1702 | cejka | 34 | * @file |
1248 | jermar | 35 | * @brief Main initialization kernel function for all processors. |
36 | * |
||
37 | * During kernel boot, all processors, after architecture dependent |
||
38 | * initialization, start executing code found in this file. After |
||
39 | * bringing up all subsystems, control is passed to scheduler(). |
||
40 | * |
||
41 | * The bootstrap processor starts executing main_bsp() while |
||
42 | * the application processors start executing main_ap(). |
||
43 | * |
||
44 | * @see scheduler() |
||
45 | * @see main_bsp() |
||
46 | * @see main_ap() |
||
47 | */ |
||
48 | |||
1 | jermar | 49 | #include <arch/asm.h> |
97 | jermar | 50 | #include <context.h> |
1 | jermar | 51 | #include <print.h> |
68 | decky | 52 | #include <panic.h> |
561 | decky | 53 | #include <debug.h> |
1 | jermar | 54 | #include <config.h> |
55 | #include <time/clock.h> |
||
56 | #include <proc/scheduler.h> |
||
57 | #include <proc/thread.h> |
||
58 | #include <proc/task.h> |
||
59 | #include <main/kinit.h> |
||
675 | jermar | 60 | #include <main/version.h> |
518 | jermar | 61 | #include <console/kconsole.h> |
1 | jermar | 62 | #include <cpu.h> |
402 | jermar | 63 | #include <align.h> |
578 | palkovsky | 64 | #include <interrupt.h> |
146 | cejka | 65 | #include <arch/mm/memory_init.h> |
1 | jermar | 66 | #include <mm/frame.h> |
67 | #include <mm/page.h> |
||
684 | jermar | 68 | #include <genarch/mm/page_pt.h> |
5 | jermar | 69 | #include <mm/tlb.h> |
703 | jermar | 70 | #include <mm/as.h> |
759 | palkovsky | 71 | #include <mm/slab.h> |
1 | jermar | 72 | #include <synch/waitq.h> |
1109 | jermar | 73 | #include <synch/futex.h> |
210 | decky | 74 | #include <arch/arch.h> |
1 | jermar | 75 | #include <arch.h> |
76 | jermar | 76 | #include <arch/faddr.h> |
106 | jermar | 77 | #include <typedefs.h> |
955 | palkovsky | 78 | #include <ipc/ipc.h> |
1063 | palkovsky | 79 | #include <macros.h> |
1164 | jermar | 80 | #include <adt/btree.h> |
1595 | palkovsky | 81 | #include <console/klog.h> |
675 | jermar | 82 | #include <smp/smp.h> |
83 | |||
1315 | jermar | 84 | /** Global configuration structure. */ |
1757 | jermar | 85 | config_t config; |
675 | jermar | 86 | |
1315 | jermar | 87 | /** Initial user-space tasks */ |
88 | init_t init = { |
||
89 | |||
90 | }; |
||
91 | |||
1894 | jermar | 92 | /** Boot allocations. */ |
93 | ballocs_t ballocs = { |
||
94 | .base = NULL, |
||
95 | .size = 0 |
||
96 | }; |
||
97 | |||
1 | jermar | 98 | context_t ctx; |
99 | |||
1757 | jermar | 100 | /* |
523 | jermar | 101 | * These 'hardcoded' variables will be intialized by |
105 | jermar | 102 | * the linker or the low level assembler code with |
103 | * appropriate sizes and addresses. |
||
1 | jermar | 104 | */ |
1780 | jermar | 105 | uintptr_t hardcoded_load_address = 0; /**< Virtual address of where the kernel is loaded. */ |
1757 | jermar | 106 | size_t hardcoded_ktext_size = 0; /**< Size of the kernel code in bytes. */ |
107 | size_t hardcoded_kdata_size = 0; /**< Size of the kernel data in bytes. */ |
||
1 | jermar | 108 | |
1894 | jermar | 109 | uintptr_t stack_safe = 0; /**< Lowest safe stack virtual address */ |
1833 | decky | 110 | |
1 | jermar | 111 | void main_bsp(void); |
112 | void main_ap(void); |
||
113 | |||
114 | /* |
||
115 | * These two functions prevent stack from underflowing during the |
||
116 | * kernel boot phase when SP is set to the very top of the reserved |
||
117 | * space. The stack could get corrupted by a fooled compiler-generated |
||
118 | * pop sequence otherwise. |
||
119 | */ |
||
120 | static void main_bsp_separated_stack(void); |
||
625 | palkovsky | 121 | #ifdef CONFIG_SMP |
1 | jermar | 122 | static void main_ap_separated_stack(void); |
625 | palkovsky | 123 | #endif |
1 | jermar | 124 | |
1138 | jermar | 125 | #define CONFIG_STACK_SIZE ((1<<STACK_FRAMES)*STACK_SIZE) |
126 | |||
1229 | jermar | 127 | /** Main kernel routine for bootstrap CPU. |
108 | decky | 128 | * |
129 | * Initializes the kernel by bootstrap CPU. |
||
675 | jermar | 130 | * This function passes control directly to |
131 | * main_bsp_separated_stack(). |
||
108 | decky | 132 | * |
413 | jermar | 133 | * Assuming interrupts_disable(). |
108 | decky | 134 | * |
1 | jermar | 135 | */ |
136 | void main_bsp(void) |
||
137 | { |
||
138 | config.cpu_count = 1; |
||
139 | config.cpu_active = 1; |
||
651 | decky | 140 | |
369 | jermar | 141 | config.base = hardcoded_load_address; |
142 | config.memory_size = get_memory_size(); |
||
210 | decky | 143 | |
814 | palkovsky | 144 | config.kernel_size = ALIGN_UP(hardcoded_ktext_size + hardcoded_kdata_size, PAGE_SIZE); |
1833 | decky | 145 | config.stack_size = CONFIG_STACK_SIZE; |
1037 | decky | 146 | |
1833 | decky | 147 | /* Initialy the stack is placed just after the kernel */ |
148 | config.stack_base = config.base + config.kernel_size; |
||
149 | |||
150 | /* Avoid placing stack on top of init */ |
||
1037 | decky | 151 | count_t i; |
1833 | decky | 152 | for (i = 0; i < init.cnt; i++) { |
153 | if (PA_overlaps(config.stack_base, config.stack_size, init.tasks[i].addr, init.tasks[i].size)) |
||
154 | config.stack_base = ALIGN_UP(init.tasks[i].addr + init.tasks[i].size, config.stack_size); |
||
155 | } |
||
1894 | jermar | 156 | |
157 | /* Avoid placing stack on top of boot allocations. */ |
||
158 | if (ballocs.size) { |
||
159 | if (PA_overlaps(config.stack_base, config.stack_size, ballocs.base, ballocs.size)) |
||
160 | config.stack_base = ALIGN_UP(ballocs.base + ballocs.size, PAGE_SIZE); |
||
161 | } |
||
1037 | decky | 162 | |
1833 | decky | 163 | if (config.stack_base < stack_safe) |
164 | config.stack_base = ALIGN_UP(stack_safe, PAGE_SIZE); |
||
210 | decky | 165 | |
47 | jermar | 166 | context_save(&ctx); |
1833 | decky | 167 | context_set(&ctx, FADDR(main_bsp_separated_stack), config.stack_base, THREAD_STACK_SIZE); |
47 | jermar | 168 | context_restore(&ctx); |
1 | jermar | 169 | /* not reached */ |
170 | } |
||
171 | |||
108 | decky | 172 | |
1229 | jermar | 173 | /** Main kernel routine for bootstrap CPU using new stack. |
108 | decky | 174 | * |
175 | * Second part of main_bsp(). |
||
176 | * |
||
177 | */ |
||
174 | jermar | 178 | void main_bsp_separated_stack(void) |
179 | { |
||
1 | jermar | 180 | task_t *k; |
181 | thread_t *t; |
||
1109 | jermar | 182 | count_t i; |
207 | decky | 183 | |
184 | jermar | 184 | the_initialize(THE); |
1109 | jermar | 185 | |
517 | jermar | 186 | /* |
187 | * kconsole data structures must be initialized very early |
||
188 | * because other subsystems will register their respective |
||
189 | * commands. |
||
190 | */ |
||
191 | kconsole_init(); |
||
1037 | decky | 192 | |
756 | jermar | 193 | /* |
194 | * Exception handler initialization, before architecture |
||
673 | jermar | 195 | * starts adding its own handlers |
578 | palkovsky | 196 | */ |
197 | exc_init(); |
||
755 | jermar | 198 | |
199 | /* |
||
200 | * Memory management subsystems initialization. |
||
201 | */ |
||
26 | jermar | 202 | arch_pre_mm_init(); |
1101 | jermar | 203 | frame_init(); /* Initialize at least 1 memory segment big enough for slab to work */ |
789 | palkovsky | 204 | slab_cache_init(); |
1164 | jermar | 205 | btree_init(); |
756 | jermar | 206 | as_init(); |
23 | jermar | 207 | page_init(); |
208 | tlb_init(); |
||
1434 | palkovsky | 209 | arch_post_mm_init(); |
1101 | jermar | 210 | |
673 | jermar | 211 | version_print(); |
1833 | decky | 212 | printf("kernel: %.*p hardcoded_ktext_size=%zdK, hardcoded_kdata_size=%zdK\n", sizeof(uintptr_t) * 2, config.base, hardcoded_ktext_size >> 10, hardcoded_kdata_size >> 10); |
213 | printf("stack: %.*p size=%zdK\n", sizeof(uintptr_t) * 2, config.stack_base, config.stack_size >> 10); |
||
1 | jermar | 214 | |
503 | jermar | 215 | arch_pre_smp_init(); |
34 | jermar | 216 | smp_init(); |
1101 | jermar | 217 | |
218 | slab_enable_cpucache(); /* Slab must be initialized AFTER we know the number of processors */ |
||
773 | palkovsky | 219 | |
1389 | decky | 220 | printf("config.memory_size=%zdM\n", config.memory_size >> 20); |
1196 | cejka | 221 | printf("config.cpu_count=%zd\n", config.cpu_count); |
1 | jermar | 222 | cpu_init(); |
860 | decky | 223 | |
1 | jermar | 224 | calibrate_delay_loop(); |
1434 | palkovsky | 225 | clock_counter_init(); |
1 | jermar | 226 | timeout_init(); |
227 | scheduler_init(); |
||
228 | task_init(); |
||
229 | thread_init(); |
||
1109 | jermar | 230 | futex_init(); |
1595 | palkovsky | 231 | klog_init(); |
628 | decky | 232 | |
1826 | decky | 233 | if (init.cnt > 0) { |
234 | for (i = 0; i < init.cnt; i++) |
||
235 | printf("init[%zd].addr=%.*p, init[%zd].size=%zd\n", i, sizeof(uintptr_t) * 2, init.tasks[i].addr, i, init.tasks[i].size); |
||
236 | } else |
||
1999 | decky | 237 | printf("No init binaries found\n"); |
955 | palkovsky | 238 | |
239 | ipc_init(); |
||
1109 | jermar | 240 | |
1 | jermar | 241 | /* |
242 | * Create kernel task. |
||
243 | */ |
||
1062 | jermar | 244 | k = task_create(AS_KERNEL, "KERNEL"); |
210 | decky | 245 | if (!k) |
246 | panic("can't create kernel task\n"); |
||
860 | decky | 247 | |
1 | jermar | 248 | /* |
249 | * Create the first thread. |
||
250 | */ |
||
1062 | jermar | 251 | t = thread_create(kinit, NULL, k, 0, "kinit"); |
210 | decky | 252 | if (!t) |
253 | panic("can't create kinit thread\n"); |
||
1 | jermar | 254 | thread_ready(t); |
860 | decky | 255 | |
1 | jermar | 256 | /* |
257 | * This call to scheduler() will return to kinit, |
||
258 | * starting the thread of kernel threads. |
||
259 | */ |
||
260 | scheduler(); |
||
261 | /* not reached */ |
||
262 | } |
||
263 | |||
108 | decky | 264 | |
458 | decky | 265 | #ifdef CONFIG_SMP |
1229 | jermar | 266 | /** Main kernel routine for application CPUs. |
108 | decky | 267 | * |
268 | * Executed by application processors, temporary stack |
||
1901 | jermar | 269 | * is at ctx.sp which was set during BSP boot. |
675 | jermar | 270 | * This function passes control directly to |
271 | * main_ap_separated_stack(). |
||
108 | decky | 272 | * |
413 | jermar | 273 | * Assuming interrupts_disable()'d. |
108 | decky | 274 | * |
1 | jermar | 275 | */ |
276 | void main_ap(void) |
||
277 | { |
||
278 | /* |
||
279 | * Incrementing the active CPU counter will guarantee that the |
||
1901 | jermar | 280 | * *_init() functions can find out that they need to |
281 | * do initialization for AP only. |
||
1 | jermar | 282 | */ |
283 | config.cpu_active++; |
||
284 | |||
192 | jermar | 285 | /* |
286 | * The THE structure is well defined because ctx.sp is used as stack. |
||
287 | */ |
||
288 | the_initialize(THE); |
||
298 | decky | 289 | |
26 | jermar | 290 | arch_pre_mm_init(); |
1 | jermar | 291 | frame_init(); |
292 | page_init(); |
||
389 | jermar | 293 | tlb_init(); |
26 | jermar | 294 | arch_post_mm_init(); |
298 | decky | 295 | |
1 | jermar | 296 | cpu_init(); |
297 | calibrate_delay_loop(); |
||
1901 | jermar | 298 | arch_post_cpu_init(); |
1 | jermar | 299 | |
192 | jermar | 300 | the_copy(THE, (the_t *) CPU->stack); |
1 | jermar | 301 | |
302 | /* |
||
303 | * If we woke kmp up before we left the kernel stack, we could |
||
304 | * collide with another CPU coming up. To prevent this, we |
||
305 | * switch to this cpu's private stack prior to waking kmp up. |
||
306 | */ |
||
1780 | jermar | 307 | context_set(&CPU->saved_context, FADDR(main_ap_separated_stack), (uintptr_t) CPU->stack, CPU_STACK_SIZE); |
47 | jermar | 308 | context_restore(&CPU->saved_context); |
1 | jermar | 309 | /* not reached */ |
310 | } |
||
311 | |||
108 | decky | 312 | |
1229 | jermar | 313 | /** Main kernel routine for application CPUs using new stack. |
108 | decky | 314 | * |
315 | * Second part of main_ap(). |
||
316 | * |
||
317 | */ |
||
1 | jermar | 318 | void main_ap_separated_stack(void) |
319 | { |
||
320 | /* |
||
321 | * Configure timeouts for this cpu. |
||
322 | */ |
||
323 | timeout_init(); |
||
324 | |||
325 | waitq_wakeup(&ap_completion_wq, WAKEUP_FIRST); |
||
326 | scheduler(); |
||
327 | /* not reached */ |
||
328 | } |
||
458 | decky | 329 | #endif /* CONFIG_SMP */ |
1702 | cejka | 330 | |
1729 | decky | 331 | /** @} |
1702 | cejka | 332 | */ |