| 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 | /** @addtogroup main
|
|---|
| 30 | * @{
|
|---|
| 31 | */
|
|---|
| 32 |
|
|---|
| 33 | /**
|
|---|
| 34 | * @file
|
|---|
| 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 |
|
|---|
| 49 | #include <arch/asm.h>
|
|---|
| 50 | #include <context.h>
|
|---|
| 51 | #include <print.h>
|
|---|
| 52 | #include <panic.h>
|
|---|
| 53 | #include <debug.h>
|
|---|
| 54 | #include <config.h>
|
|---|
| 55 | #include <time/clock.h>
|
|---|
| 56 | #include <time/timeout.h>
|
|---|
| 57 | #include <proc/scheduler.h>
|
|---|
| 58 | #include <proc/thread.h>
|
|---|
| 59 | #include <proc/task.h>
|
|---|
| 60 | #include <proc/tasklet.h>
|
|---|
| 61 | #include <main/kinit.h>
|
|---|
| 62 | #include <main/version.h>
|
|---|
| 63 | #include <console/kconsole.h>
|
|---|
| 64 | #include <console/console.h>
|
|---|
| 65 | #include <cpu.h>
|
|---|
| 66 | #include <align.h>
|
|---|
| 67 | #include <interrupt.h>
|
|---|
| 68 | #include <mm/frame.h>
|
|---|
| 69 | #include <mm/page.h>
|
|---|
| 70 | #include <genarch/mm/page_pt.h>
|
|---|
| 71 | #include <mm/tlb.h>
|
|---|
| 72 | #include <mm/as.h>
|
|---|
| 73 | #include <mm/slab.h>
|
|---|
| 74 | #include <synch/waitq.h>
|
|---|
| 75 | #include <synch/futex.h>
|
|---|
| 76 | #include <arch/arch.h>
|
|---|
| 77 | #include <arch.h>
|
|---|
| 78 | #include <arch/faddr.h>
|
|---|
| 79 | #include <ipc/ipc.h>
|
|---|
| 80 | #include <macros.h>
|
|---|
| 81 | #include <adt/btree.h>
|
|---|
| 82 | #include <smp/smp.h>
|
|---|
| 83 | #include <ddi/ddi.h>
|
|---|
| 84 | #include <main/main.h>
|
|---|
| 85 | #include <ipc/event.h>
|
|---|
| 86 |
|
|---|
| 87 | /** Global configuration structure. */
|
|---|
| 88 | config_t config;
|
|---|
| 89 |
|
|---|
| 90 | /** Initial user-space tasks */
|
|---|
| 91 | init_t init = {
|
|---|
| 92 | .cnt = 0
|
|---|
| 93 | };
|
|---|
| 94 |
|
|---|
| 95 | /** Boot allocations. */
|
|---|
| 96 | ballocs_t ballocs = {
|
|---|
| 97 | .base = NULL,
|
|---|
| 98 | .size = 0
|
|---|
| 99 | };
|
|---|
| 100 |
|
|---|
| 101 | context_t ctx;
|
|---|
| 102 |
|
|---|
| 103 | /** Lowest safe stack virtual address. */
|
|---|
| 104 | uintptr_t stack_safe = 0;
|
|---|
| 105 |
|
|---|
| 106 | /*
|
|---|
| 107 | * These two functions prevent stack from underflowing during the
|
|---|
| 108 | * kernel boot phase when SP is set to the very top of the reserved
|
|---|
| 109 | * space. The stack could get corrupted by a fooled compiler-generated
|
|---|
| 110 | * pop sequence otherwise.
|
|---|
| 111 | */
|
|---|
| 112 | static void main_bsp_separated_stack(void);
|
|---|
| 113 | #ifdef CONFIG_SMP
|
|---|
| 114 | static void main_ap_separated_stack(void);
|
|---|
| 115 | #endif
|
|---|
| 116 |
|
|---|
| 117 | #define CONFIG_STACK_SIZE ((1 << STACK_FRAMES) * STACK_SIZE)
|
|---|
| 118 |
|
|---|
| 119 | /** Main kernel routine for bootstrap CPU.
|
|---|
| 120 | *
|
|---|
| 121 | * The code here still runs on the boot stack, which knows nothing about
|
|---|
| 122 | * preemption counts. Because of that, this function cannot directly call
|
|---|
| 123 | * functions that disable or enable preemption (e.g. spinlock_lock()). The
|
|---|
| 124 | * primary task of this function is to calculate address of a new stack and
|
|---|
| 125 | * switch to it.
|
|---|
| 126 | *
|
|---|
| 127 | * Assuming interrupts_disable().
|
|---|
| 128 | *
|
|---|
| 129 | */
|
|---|
| 130 | void main_bsp(void)
|
|---|
| 131 | {
|
|---|
| 132 | config.cpu_count = 1;
|
|---|
| 133 | config.cpu_active = 1;
|
|---|
| 134 |
|
|---|
| 135 | config.base = hardcoded_load_address;
|
|---|
| 136 | config.kernel_size = ALIGN_UP(hardcoded_ktext_size +
|
|---|
| 137 | hardcoded_kdata_size, PAGE_SIZE);
|
|---|
| 138 | config.stack_size = CONFIG_STACK_SIZE;
|
|---|
| 139 |
|
|---|
| 140 | /* Initialy the stack is placed just after the kernel */
|
|---|
| 141 | config.stack_base = config.base + config.kernel_size;
|
|---|
| 142 |
|
|---|
| 143 | /* Avoid placing stack on top of init */
|
|---|
| 144 | size_t i;
|
|---|
| 145 | for (i = 0; i < init.cnt; i++) {
|
|---|
| 146 | if (PA_overlaps(config.stack_base, config.stack_size,
|
|---|
| 147 | init.tasks[i].addr, init.tasks[i].size))
|
|---|
| 148 | config.stack_base = ALIGN_UP(init.tasks[i].addr +
|
|---|
| 149 | init.tasks[i].size, config.stack_size);
|
|---|
| 150 | }
|
|---|
| 151 |
|
|---|
| 152 | /* Avoid placing stack on top of boot allocations. */
|
|---|
| 153 | if (ballocs.size) {
|
|---|
| 154 | if (PA_overlaps(config.stack_base, config.stack_size,
|
|---|
| 155 | ballocs.base, ballocs.size))
|
|---|
| 156 | config.stack_base = ALIGN_UP(ballocs.base +
|
|---|
| 157 | ballocs.size, PAGE_SIZE);
|
|---|
| 158 | }
|
|---|
| 159 |
|
|---|
| 160 | if (config.stack_base < stack_safe)
|
|---|
| 161 | config.stack_base = ALIGN_UP(stack_safe, PAGE_SIZE);
|
|---|
| 162 |
|
|---|
| 163 | context_save(&ctx);
|
|---|
| 164 | context_set(&ctx, FADDR(main_bsp_separated_stack), config.stack_base,
|
|---|
| 165 | THREAD_STACK_SIZE);
|
|---|
| 166 | context_restore(&ctx);
|
|---|
| 167 | /* not reached */
|
|---|
| 168 | }
|
|---|
| 169 |
|
|---|
| 170 |
|
|---|
| 171 | /** Main kernel routine for bootstrap CPU using new stack.
|
|---|
| 172 | *
|
|---|
| 173 | * Second part of main_bsp().
|
|---|
| 174 | *
|
|---|
| 175 | */
|
|---|
| 176 | void main_bsp_separated_stack(void)
|
|---|
| 177 | {
|
|---|
| 178 | /* Keep this the first thing. */
|
|---|
| 179 | the_initialize(THE);
|
|---|
| 180 |
|
|---|
| 181 | version_print();
|
|---|
| 182 |
|
|---|
| 183 | LOG("\nconfig.base=%#" PRIp " config.kernel_size=%" PRIs
|
|---|
| 184 | "\nconfig.stack_base=%#" PRIp " config.stack_size=%" PRIs,
|
|---|
| 185 | config.base, config.kernel_size, config.stack_base,
|
|---|
| 186 | config.stack_size);
|
|---|
| 187 |
|
|---|
| 188 | #ifdef CONFIG_KCONSOLE
|
|---|
| 189 | /*
|
|---|
| 190 | * kconsole data structures must be initialized very early
|
|---|
| 191 | * because other subsystems will register their respective
|
|---|
| 192 | * commands.
|
|---|
| 193 | */
|
|---|
| 194 | LOG_EXEC(kconsole_init());
|
|---|
| 195 | #endif
|
|---|
| 196 |
|
|---|
| 197 | /*
|
|---|
| 198 | * Exception handler initialization, before architecture
|
|---|
| 199 | * starts adding its own handlers
|
|---|
| 200 | */
|
|---|
| 201 | LOG_EXEC(exc_init());
|
|---|
| 202 |
|
|---|
| 203 | /*
|
|---|
| 204 | * Memory management subsystems initialization.
|
|---|
| 205 | */
|
|---|
| 206 | LOG_EXEC(arch_pre_mm_init());
|
|---|
| 207 | LOG_EXEC(frame_init());
|
|---|
| 208 |
|
|---|
| 209 | /* Initialize at least 1 memory segment big enough for slab to work. */
|
|---|
| 210 | LOG_EXEC(slab_cache_init());
|
|---|
| 211 | LOG_EXEC(btree_init());
|
|---|
| 212 | LOG_EXEC(as_init());
|
|---|
| 213 | LOG_EXEC(page_init());
|
|---|
| 214 | LOG_EXEC(tlb_init());
|
|---|
| 215 | LOG_EXEC(ddi_init());
|
|---|
| 216 | LOG_EXEC(tasklet_init());
|
|---|
| 217 | LOG_EXEC(arch_post_mm_init());
|
|---|
| 218 | LOG_EXEC(arch_pre_smp_init());
|
|---|
| 219 | LOG_EXEC(smp_init());
|
|---|
| 220 |
|
|---|
| 221 | /* Slab must be initialized after we know the number of processors. */
|
|---|
| 222 | LOG_EXEC(slab_enable_cpucache());
|
|---|
| 223 |
|
|---|
| 224 | printf("Detected %" PRIs " CPU(s), %" PRIu64" MiB free memory\n",
|
|---|
| 225 | config.cpu_count, SIZE2MB(zone_total_size()));
|
|---|
| 226 |
|
|---|
| 227 | LOG_EXEC(cpu_init());
|
|---|
| 228 |
|
|---|
| 229 | LOG_EXEC(calibrate_delay_loop());
|
|---|
| 230 | LOG_EXEC(clock_counter_init());
|
|---|
| 231 | LOG_EXEC(timeout_init());
|
|---|
| 232 | LOG_EXEC(scheduler_init());
|
|---|
| 233 | LOG_EXEC(task_init());
|
|---|
| 234 | LOG_EXEC(thread_init());
|
|---|
| 235 | LOG_EXEC(futex_init());
|
|---|
| 236 |
|
|---|
| 237 | if (init.cnt > 0) {
|
|---|
| 238 | size_t i;
|
|---|
| 239 | for (i = 0; i < init.cnt; i++)
|
|---|
| 240 | LOG("init[%" PRIs "].addr=%#" PRIp ", init[%" PRIs
|
|---|
| 241 | "].size=%#" PRIs, i, init.tasks[i].addr, i,
|
|---|
| 242 | init.tasks[i].size);
|
|---|
| 243 | } else
|
|---|
| 244 | printf("No init binaries found.\n");
|
|---|
| 245 |
|
|---|
| 246 | LOG_EXEC(ipc_init());
|
|---|
| 247 | LOG_EXEC(event_init());
|
|---|
| 248 | LOG_EXEC(klog_init());
|
|---|
| 249 |
|
|---|
| 250 | /*
|
|---|
| 251 | * Create kernel task.
|
|---|
| 252 | */
|
|---|
| 253 | task_t *kernel = task_create(AS_KERNEL, "kernel");
|
|---|
| 254 | if (!kernel)
|
|---|
| 255 | panic("Cannot create kernel task.");
|
|---|
| 256 |
|
|---|
| 257 | /*
|
|---|
| 258 | * Create the first thread.
|
|---|
| 259 | */
|
|---|
| 260 | thread_t *kinit_thread
|
|---|
| 261 | = thread_create(kinit, NULL, kernel, 0, "kinit", true);
|
|---|
| 262 | if (!kinit_thread)
|
|---|
| 263 | panic("Cannot create kinit thread.");
|
|---|
| 264 | LOG_EXEC(thread_ready(kinit_thread));
|
|---|
| 265 |
|
|---|
| 266 | /*
|
|---|
| 267 | * This call to scheduler() will return to kinit,
|
|---|
| 268 | * starting the thread of kernel threads.
|
|---|
| 269 | */
|
|---|
| 270 | scheduler();
|
|---|
| 271 | /* not reached */
|
|---|
| 272 | }
|
|---|
| 273 |
|
|---|
| 274 |
|
|---|
| 275 | #ifdef CONFIG_SMP
|
|---|
| 276 | /** Main kernel routine for application CPUs.
|
|---|
| 277 | *
|
|---|
| 278 | * Executed by application processors, temporary stack
|
|---|
| 279 | * is at ctx.sp which was set during BSP boot.
|
|---|
| 280 | * This function passes control directly to
|
|---|
| 281 | * main_ap_separated_stack().
|
|---|
| 282 | *
|
|---|
| 283 | * Assuming interrupts_disable()'d.
|
|---|
| 284 | *
|
|---|
| 285 | */
|
|---|
| 286 | void main_ap(void)
|
|---|
| 287 | {
|
|---|
| 288 | /*
|
|---|
| 289 | * Incrementing the active CPU counter will guarantee that the
|
|---|
| 290 | * *_init() functions can find out that they need to
|
|---|
| 291 | * do initialization for AP only.
|
|---|
| 292 | */
|
|---|
| 293 | config.cpu_active++;
|
|---|
| 294 |
|
|---|
| 295 | /*
|
|---|
| 296 | * The THE structure is well defined because ctx.sp is used as stack.
|
|---|
| 297 | */
|
|---|
| 298 | the_initialize(THE);
|
|---|
| 299 |
|
|---|
| 300 | arch_pre_mm_init();
|
|---|
| 301 | frame_init();
|
|---|
| 302 | page_init();
|
|---|
| 303 | tlb_init();
|
|---|
| 304 | arch_post_mm_init();
|
|---|
| 305 |
|
|---|
| 306 | cpu_init();
|
|---|
| 307 | calibrate_delay_loop();
|
|---|
| 308 | arch_post_cpu_init();
|
|---|
| 309 |
|
|---|
| 310 | the_copy(THE, (the_t *) CPU->stack);
|
|---|
| 311 |
|
|---|
| 312 | /*
|
|---|
| 313 | * If we woke kmp up before we left the kernel stack, we could
|
|---|
| 314 | * collide with another CPU coming up. To prevent this, we
|
|---|
| 315 | * switch to this cpu's private stack prior to waking kmp up.
|
|---|
| 316 | */
|
|---|
| 317 | context_save(&CPU->saved_context);
|
|---|
| 318 | context_set(&CPU->saved_context, FADDR(main_ap_separated_stack),
|
|---|
| 319 | (uintptr_t) CPU->stack, CPU_STACK_SIZE);
|
|---|
| 320 | context_restore(&CPU->saved_context);
|
|---|
| 321 | /* not reached */
|
|---|
| 322 | }
|
|---|
| 323 |
|
|---|
| 324 |
|
|---|
| 325 | /** Main kernel routine for application CPUs using new stack.
|
|---|
| 326 | *
|
|---|
| 327 | * Second part of main_ap().
|
|---|
| 328 | *
|
|---|
| 329 | */
|
|---|
| 330 | void main_ap_separated_stack(void)
|
|---|
| 331 | {
|
|---|
| 332 | /*
|
|---|
| 333 | * Configure timeouts for this cpu.
|
|---|
| 334 | */
|
|---|
| 335 | timeout_init();
|
|---|
| 336 |
|
|---|
| 337 | waitq_wakeup(&ap_completion_wq, WAKEUP_FIRST);
|
|---|
| 338 | scheduler();
|
|---|
| 339 | /* not reached */
|
|---|
| 340 | }
|
|---|
| 341 | #endif /* CONFIG_SMP */
|
|---|
| 342 |
|
|---|
| 343 | /** @}
|
|---|
| 344 | */
|
|---|
