source: mainline/src/main/kinit.c@ 22f7769

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since 22f7769 was 22f7769, checked in by Jakub Jermar <jakub@…>, 20 years ago

Rename cpu_priority_{high|low|restore|read} functions to interrupts_{disable|enable|restore|read}.
Rename pri_t to ipl_t (Interrupt Priority Level).
Rename thread_t::pri to thread_t::priority.

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