Subversion Repositories HelenOS-historic

Rev

Rev 1101 | Rev 1138 | 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. #include <arch/asm.h>
  30. #include <context.h>
  31. #include <print.h>
  32. #include <panic.h>
  33. #include <debug.h>
  34. #include <config.h>
  35. #include <time/clock.h>
  36. #include <proc/scheduler.h>
  37. #include <proc/thread.h>
  38. #include <proc/task.h>
  39. #include <main/kinit.h>
  40. #include <main/version.h>
  41. #include <console/kconsole.h>
  42. #include <cpu.h>
  43. #include <align.h>
  44. #include <interrupt.h>
  45. #include <arch/mm/memory_init.h>
  46. #include <mm/frame.h>
  47. #include <mm/page.h>
  48. #include <genarch/mm/page_pt.h>
  49. #include <mm/tlb.h>
  50. #include <mm/as.h>
  51. #include <mm/slab.h>
  52. #include <synch/waitq.h>
  53. #include <synch/futex.h>
  54. #include <arch/arch.h>
  55. #include <arch.h>
  56. #include <arch/faddr.h>
  57. #include <typedefs.h>
  58. #include <ipc/ipc.h>
  59. #include <macros.h>
  60.  
  61. #ifdef CONFIG_SMP
  62. #include <arch/smp/apic.h>
  63. #include <arch/smp/mps.h>
  64. #endif /* CONFIG_SMP */
  65. #include <smp/smp.h>
  66.  
  67. config_t config;    /**< Global configuration structure. */
  68. init_t init = {0};      /**< Initial user-space tasks */
  69.  
  70. context_t ctx;
  71.  
  72. /**
  73.  * These 'hardcoded' variables will be intialized by
  74.  * the linker or the low level assembler code with
  75.  * appropriate sizes and addresses.
  76.  */
  77. __address hardcoded_load_address = 0;
  78. size_t hardcoded_ktext_size = 0;
  79. size_t hardcoded_kdata_size = 0;
  80.  
  81. void main_bsp(void);
  82. void main_ap(void);
  83.  
  84. /*
  85.  * These two functions prevent stack from underflowing during the
  86.  * kernel boot phase when SP is set to the very top of the reserved
  87.  * space. The stack could get corrupted by a fooled compiler-generated
  88.  * pop sequence otherwise.
  89.  */
  90. static void main_bsp_separated_stack(void);
  91. #ifdef CONFIG_SMP
  92. static void main_ap_separated_stack(void);
  93. #endif
  94.  
  95. /** Bootstrap CPU main kernel routine
  96.  *
  97.  * Initializes the kernel by bootstrap CPU.
  98.  * This function passes control directly to
  99.  * main_bsp_separated_stack().
  100.  *
  101.  * Assuming interrupts_disable().
  102.  *
  103.  */
  104. void main_bsp(void)
  105. {
  106.     __address stackaddr;
  107.  
  108.     config.cpu_count = 1;
  109.     config.cpu_active = 1;
  110.    
  111.     config.base = hardcoded_load_address;
  112.     config.memory_size = get_memory_size();
  113.    
  114.     config.kernel_size = ALIGN_UP(hardcoded_ktext_size + hardcoded_kdata_size, PAGE_SIZE);
  115.     stackaddr = config.base + config.kernel_size;
  116.    
  117.     /* Avoid placing kernel on top of init */
  118.     count_t i;
  119.     bool overlap = false;
  120.     for (i = 0; i < init.cnt; i++)
  121.         if (PA_overlaps(stackaddr, CONFIG_STACK_SIZE, init.tasks[i].addr, init.tasks[i].size)) {
  122.             stackaddr = ALIGN_UP(init.tasks[i].addr + init.tasks[i].size, CONFIG_STACK_SIZE);
  123.             init.tasks[i].size = ALIGN_UP(init.tasks[i].size, CONFIG_STACK_SIZE) + CONFIG_STACK_SIZE;
  124.             overlap = true;
  125.         }
  126.    
  127.     if (!overlap)
  128.         config.kernel_size += CONFIG_STACK_SIZE;
  129.    
  130.     context_save(&ctx);
  131.     context_set(&ctx, FADDR(main_bsp_separated_stack),
  132.             stackaddr, CONFIG_STACK_SIZE);
  133.     context_restore(&ctx);
  134.     /* not reached */
  135. }
  136.  
  137.  
  138. /** Bootstrap CPU main kernel routine stack wrapper
  139.  *
  140.  * Second part of main_bsp().
  141.  *
  142.  */
  143. void main_bsp_separated_stack(void)
  144. {
  145.     task_t *k;
  146.     thread_t *t;
  147.     count_t i;
  148.    
  149.     the_initialize(THE);
  150.  
  151.     /*
  152.      * kconsole data structures must be initialized very early
  153.      * because other subsystems will register their respective
  154.      * commands.
  155.      */
  156.     kconsole_init();
  157.    
  158.     /*
  159.      * Exception handler initialization, before architecture
  160.      * starts adding its own handlers
  161.      */
  162.     exc_init();
  163.  
  164.     /*
  165.      * Memory management subsystems initialization.
  166.      */
  167.     arch_pre_mm_init();
  168.     frame_init();       /* Initialize at least 1 memory segment big enough for slab to work */
  169.     slab_cache_init();
  170.     as_init();
  171.     page_init();
  172.     tlb_init();
  173.     arch_post_mm_init();   
  174.  
  175.     version_print();
  176.     printf("%P: hardcoded_ktext_size=%dK, hardcoded_kdata_size=%dK\n",
  177.         config.base, hardcoded_ktext_size/1024, hardcoded_kdata_size/1024);
  178.  
  179.     arch_pre_smp_init();
  180.     smp_init();
  181.    
  182.     slab_enable_cpucache(); /* Slab must be initialized AFTER we know the number of processors */
  183.  
  184.     printf("config.memory_size=%dM\n", config.memory_size/(1024*1024));
  185.     printf("config.cpu_count=%d\n", config.cpu_count);
  186.     cpu_init();
  187.    
  188.     calibrate_delay_loop();
  189.     timeout_init();
  190.     scheduler_init();
  191.     task_init();
  192.     thread_init();
  193.     futex_init();
  194.    
  195.     for (i = 0; i < init.cnt; i++)
  196.         printf("init[%d].addr=%P, init[%d].size=%d\n", i, init.tasks[i].addr, i, init.tasks[i].size);
  197.    
  198.     ipc_init();
  199.  
  200.     /*
  201.      * Create kernel task.
  202.      */
  203.     k = task_create(AS_KERNEL, "KERNEL");
  204.     if (!k)
  205.         panic("can't create kernel task\n");
  206.    
  207.     /*
  208.      * Create the first thread.
  209.      */
  210.     t = thread_create(kinit, NULL, k, 0, "kinit");
  211.     if (!t)
  212.         panic("can't create kinit thread\n");
  213.     thread_ready(t);
  214.    
  215.     /*
  216.      * This call to scheduler() will return to kinit,
  217.      * starting the thread of kernel threads.
  218.      */
  219.     scheduler();
  220.     /* not reached */
  221. }
  222.  
  223.  
  224. #ifdef CONFIG_SMP
  225. /** Application CPUs main kernel routine
  226.  *
  227.  * Executed by application processors, temporary stack
  228.  * is at ctx.sp which was set during BP boot.
  229.  * This function passes control directly to
  230.  * main_ap_separated_stack().
  231.  *
  232.  * Assuming interrupts_disable()'d.
  233.  *
  234.  */
  235. void main_ap(void)
  236. {
  237.     /*
  238.      * Incrementing the active CPU counter will guarantee that the
  239.      * pm_init() will not attempt to build GDT and IDT tables again.
  240.      * Neither frame_init() will do the complete thing. Neither cpu_init()
  241.      * will do.
  242.      */
  243.     config.cpu_active++;
  244.  
  245.     /*
  246.      * The THE structure is well defined because ctx.sp is used as stack.
  247.      */
  248.     the_initialize(THE);
  249.    
  250.     arch_pre_mm_init();
  251.     frame_init();
  252.     page_init();
  253.     tlb_init();
  254.     arch_post_mm_init();
  255.    
  256.     cpu_init();
  257.    
  258.     calibrate_delay_loop();
  259.  
  260.     l_apic_init();
  261.     l_apic_debug();
  262.  
  263.     the_copy(THE, (the_t *) CPU->stack);
  264.  
  265.     /*
  266.      * If we woke kmp up before we left the kernel stack, we could
  267.      * collide with another CPU coming up. To prevent this, we
  268.      * switch to this cpu's private stack prior to waking kmp up.
  269.      */
  270.     context_set(&CPU->saved_context, FADDR(main_ap_separated_stack), (__address) CPU->stack, CPU_STACK_SIZE);
  271.     context_restore(&CPU->saved_context);
  272.     /* not reached */
  273. }
  274.  
  275.  
  276. /** Application CPUs main kernel routine stack wrapper
  277.  *
  278.  * Second part of main_ap().
  279.  *
  280.  */
  281. void main_ap_separated_stack(void)
  282. {
  283.     /*
  284.      * Configure timeouts for this cpu.
  285.      */
  286.     timeout_init();
  287.  
  288.     waitq_wakeup(&ap_completion_wq, WAKEUP_FIRST);
  289.     scheduler();
  290.     /* not reached */
  291. }
  292. #endif /* CONFIG_SMP */
  293.