Subversion Repositories HelenOS

Rev

Rev 3153 | Rev 3588 | Go to most recent revision | Blame | Compare with Previous | Last modification | View Log | Download | RSS feed

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