Subversion Repositories HelenOS-historic

Rev

Go to most recent revision | Blame | 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 <config.h>
  30. #include <arch.h>
  31. #include <main/kinit.h>
  32. #include <main/uinit.h>
  33. #include <proc/scheduler.h>
  34. #include <proc/task.h>
  35. #include <proc/thread.h>
  36. #include <panic.h>
  37. #include <func.h>
  38. #include <cpu.h>
  39. #include <arch/asm.h>
  40. #include <mm/page.h>
  41. #include <arch/mm/page.h>
  42. #include <mm/vm.h>
  43.  
  44. #ifdef __SMP__
  45. #include <arch/mp.h>
  46. #endif /* __SMP__ */
  47.  
  48. #include <synch/waitq.h>
  49. #include <synch/spinlock.h>
  50.  
  51. #ifdef __TEST__
  52. #include <test.h>
  53. #endif /* __TEST__ */
  54.  
  55. void kinit(void *arg)
  56. {
  57.     vm_t *m;
  58.     vm_area_t *a;
  59.     task_t *u;
  60.     thread_t *t;
  61.     int i;
  62.  
  63.     cpu_priority_high();
  64.  
  65. #ifdef __SMP__         
  66.     if (config.cpu_count > 1) {
  67.         /*
  68.          * Create the kmp thread and wait for its completion.
  69.          * cpu1 through cpuN-1 will come up consecutively and
  70.          * not mess together with kcpulb and klwtm threads.
  71.          * Just a beautification.
  72.          */
  73.         if (t = thread_create(kmp, NULL, the->task, 0)) {
  74.             spinlock_lock(&t->lock);
  75.             t->flags |= X_WIRED;
  76.             t->cpu = &cpus[0];
  77.             spinlock_unlock(&t->lock);
  78.             thread_ready(t);
  79.             waitq_sleep(&kmp_completion_wq);
  80.             cpu_priority_high();
  81.         }
  82.         else panic("thread_create/kmp");
  83.     }
  84. #endif /* __SMP__ */
  85.     /*
  86.      * Now that all CPUs are up, we can report what we've found.
  87.      */
  88.     for (i = 0; i < config.cpu_count; i++)
  89.         cpu_print_report(&cpus[i]);
  90.  
  91. #ifdef __SMP__
  92.     if (config.cpu_count > 1) {
  93.             /*
  94.          * For each CPU, create its load balancing thread.
  95.          */
  96.         for (i = 0; i < config.cpu_count; i++) {
  97.  
  98.             if (t = thread_create(kcpulb, NULL, the->task, 0)) {
  99.                 spinlock_lock(&t->lock);           
  100.                 t->flags |= X_WIRED;
  101.                 t->cpu = &cpus[i];
  102.                 spinlock_unlock(&t->lock);
  103.                 thread_ready(t);
  104.             }
  105.             else panic("thread_create/kcpulb");
  106.  
  107.         }
  108.     }
  109. #endif /* __SMP__ */
  110.  
  111.     cpu_priority_low();
  112.  
  113.     /*
  114.      * Create the first user task.
  115.      */
  116.     m = vm_create();
  117.     if (!m) panic(PANIC "vm_create");
  118.     u = task_create(m);
  119.     if (!u) panic(PANIC "task_create");
  120.     t = thread_create(uinit, NULL, u, THREAD_USER_STACK);
  121.     if (!t) panic(PANIC "thread_create");
  122.  
  123.     /*
  124.      * Create the text vm_area and copy the userspace code there.
  125.      */
  126.     a = vm_area_create(m, VMA_TEXT, 1, UTEXT_ADDRESS);
  127.     if (!a) panic(PANIC "vm_area_create: vm_text");
  128.     memcopy((__address) utext, PA2KA(a->mapping[0]), utext_size < PAGE_SIZE ? utext_size : PAGE_SIZE);     
  129.  
  130.     /*
  131.      * Create the data vm_area.
  132.      */
  133.     a = vm_area_create(m, VMA_STACK, 1, USTACK_ADDRESS);
  134.     if (!a) panic(PANIC "vm_area_create: vm_stack");
  135.    
  136.     thread_ready(t);
  137.  
  138. #ifdef __TEST__
  139.     test();
  140. #endif /* __TEST__ */
  141.  
  142.  
  143.     while (1) {
  144.         thread_usleep(1000000);
  145.         printf("kinit... ");
  146.     }
  147.  
  148. }
  149.