Subversion Repositories HelenOS

Rev

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