Rev 523 | Rev 534 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 523 | Rev 532 | ||
---|---|---|---|
1 | /* |
1 | /* |
2 | * Copyright (C) 2001-2004 Jakub Jermar |
2 | * Copyright (C) 2001-2004 Jakub Jermar |
3 | * All rights reserved. |
3 | * All rights reserved. |
4 | * |
4 | * |
5 | * Redistribution and use in source and binary forms, with or without |
5 | * Redistribution and use in source and binary forms, with or without |
6 | * modification, are permitted provided that the following conditions |
6 | * modification, are permitted provided that the following conditions |
7 | * are met: |
7 | * are met: |
8 | * |
8 | * |
9 | * - Redistributions of source code must retain the above copyright |
9 | * - Redistributions of source code must retain the above copyright |
10 | * notice, this list of conditions and the following disclaimer. |
10 | * notice, this list of conditions and the following disclaimer. |
11 | * - Redistributions in binary form must reproduce the above copyright |
11 | * - Redistributions in binary form must reproduce the above copyright |
12 | * notice, this list of conditions and the following disclaimer in the |
12 | * notice, this list of conditions and the following disclaimer in the |
13 | * documentation and/or other materials provided with the distribution. |
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 |
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. |
15 | * derived from this software without specific prior written permission. |
16 | * |
16 | * |
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
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 |
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
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 |
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
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 |
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. |
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | */ |
27 | */ |
28 | 28 | ||
29 | #include <main/kinit.h> |
29 | #include <main/kinit.h> |
30 | #include <main/uinit.h> |
30 | #include <main/uinit.h> |
31 | #include <config.h> |
31 | #include <config.h> |
32 | #include <arch.h> |
32 | #include <arch.h> |
33 | #include <proc/scheduler.h> |
33 | #include <proc/scheduler.h> |
34 | #include <proc/task.h> |
34 | #include <proc/task.h> |
35 | #include <proc/thread.h> |
35 | #include <proc/thread.h> |
36 | #include <panic.h> |
36 | #include <panic.h> |
37 | #include <func.h> |
37 | #include <func.h> |
38 | #include <cpu.h> |
38 | #include <cpu.h> |
39 | #include <arch/asm.h> |
39 | #include <arch/asm.h> |
40 | #include <mm/page.h> |
40 | #include <mm/page.h> |
41 | #include <arch/mm/page.h> |
41 | #include <arch/mm/page.h> |
42 | #include <mm/vm.h> |
42 | #include <mm/vm.h> |
43 | #include <mm/frame.h> |
43 | #include <mm/frame.h> |
44 | #include <print.h> |
44 | #include <print.h> |
45 | #include <memstr.h> |
45 | #include <memstr.h> |
46 | #include <console/console.h> |
46 | #include <console/console.h> |
47 | #include <console/kconsole.h> |
47 | #include <console/kconsole.h> |
48 | 48 | ||
49 | #ifdef CONFIG_SMP |
49 | #ifdef CONFIG_SMP |
50 | #include <arch/smp/mps.h> |
50 | #include <arch/smp/mps.h> |
51 | #endif /* CONFIG_SMP */ |
51 | #endif /* CONFIG_SMP */ |
52 | 52 | ||
53 | #include <synch/waitq.h> |
53 | #include <synch/waitq.h> |
54 | #include <synch/spinlock.h> |
54 | #include <synch/spinlock.h> |
55 | 55 | ||
56 | #ifdef CONFIG_TEST |
56 | #ifdef CONFIG_TEST |
57 | #include <test.h> |
57 | #include <test.h> |
58 | #endif /* CONFIG_TEST */ |
58 | #endif /* CONFIG_TEST */ |
59 | 59 | ||
60 | /** Kernel initialization thread. |
60 | /** Kernel initialization thread. |
61 | * |
61 | * |
62 | * kinit takes care of higher level kernel |
62 | * kinit takes care of higher level kernel |
63 | * initialization (i.e. thread creation, |
63 | * initialization (i.e. thread creation, |
64 | * userspace initialization etc.). |
64 | * userspace initialization etc.). |
65 | * |
65 | * |
66 | * @param arg Not used. |
66 | * @param arg Not used. |
67 | */ |
67 | */ |
68 | void kinit(void *arg) |
68 | void kinit(void *arg) |
69 | { |
69 | { |
70 | vm_t *m; |
70 | vm_t *m; |
71 | vm_area_t *a; |
71 | vm_area_t *a; |
72 | task_t *u; |
72 | task_t *u; |
73 | thread_t *t; |
73 | thread_t *t; |
74 | int i; |
74 | int i; |
75 | 75 | ||
76 | interrupts_disable(); |
76 | interrupts_disable(); |
77 | 77 | ||
78 | #ifdef CONFIG_SMP |
78 | #ifdef CONFIG_SMP |
79 | if (config.cpu_count > 1) { |
79 | if (config.cpu_count > 1) { |
80 | /* |
80 | /* |
81 | * Create the kmp thread and wait for its completion. |
81 | * Create the kmp thread and wait for its completion. |
82 | * cpu1 through cpuN-1 will come up consecutively and |
82 | * cpu1 through cpuN-1 will come up consecutively and |
83 | * not mess together with kcpulb threads. |
83 | * not mess together with kcpulb threads. |
84 | * Just a beautification. |
84 | * Just a beautification. |
85 | */ |
85 | */ |
86 | if (t = thread_create(kmp, NULL, TASK, 0)) { |
86 | if (t = thread_create(kmp, NULL, TASK, 0)) { |
87 | spinlock_lock(&t->lock); |
87 | spinlock_lock(&t->lock); |
88 | t->flags |= X_WIRED; |
88 | t->flags |= X_WIRED; |
89 | t->cpu = &cpus[0]; |
89 | t->cpu = &cpus[0]; |
90 | spinlock_unlock(&t->lock); |
90 | spinlock_unlock(&t->lock); |
91 | thread_ready(t); |
91 | thread_ready(t); |
92 | waitq_sleep(&kmp_completion_wq); |
92 | waitq_sleep(&kmp_completion_wq); |
93 | } |
93 | } |
94 | else panic("thread_create/kmp\n"); |
94 | else panic("thread_create/kmp\n"); |
95 | } |
95 | } |
96 | #endif /* CONFIG_SMP */ |
96 | #endif /* CONFIG_SMP */ |
97 | /* |
97 | /* |
98 | * Now that all CPUs are up, we can report what we've found. |
98 | * Now that all CPUs are up, we can report what we've found. |
99 | */ |
99 | */ |
100 | for (i = 0; i < config.cpu_count; i++) { |
100 | for (i = 0; i < config.cpu_count; i++) { |
101 | if (cpus[i].active) |
101 | if (cpus[i].active) |
102 | cpu_print_report(&cpus[i]); |
102 | cpu_print_report(&cpus[i]); |
103 | else |
103 | else |
104 | printf("cpu%d: not active\n", i); |
104 | printf("cpu%d: not active\n", i); |
105 | } |
105 | } |
106 | 106 | ||
107 | #ifdef CONFIG_SMP |
107 | #ifdef CONFIG_SMP |
108 | if (config.cpu_count > 1) { |
108 | if (config.cpu_count > 1) { |
109 | /* |
109 | /* |
110 | * For each CPU, create its load balancing thread. |
110 | * For each CPU, create its load balancing thread. |
111 | */ |
111 | */ |
112 | for (i = 0; i < config.cpu_count; i++) { |
112 | for (i = 0; i < config.cpu_count; i++) { |
113 | 113 | ||
114 | if (t = thread_create(kcpulb, NULL, TASK, 0)) { |
114 | if (t = thread_create(kcpulb, NULL, TASK, 0)) { |
115 | spinlock_lock(&t->lock); |
115 | spinlock_lock(&t->lock); |
116 | t->flags |= X_WIRED; |
116 | t->flags |= X_WIRED; |
117 | t->cpu = &cpus[i]; |
117 | t->cpu = &cpus[i]; |
118 | spinlock_unlock(&t->lock); |
118 | spinlock_unlock(&t->lock); |
119 | thread_ready(t); |
119 | thread_ready(t); |
120 | } |
120 | } |
121 | else panic("thread_create/kcpulb\n"); |
121 | else panic("thread_create/kcpulb\n"); |
122 | 122 | ||
123 | } |
123 | } |
124 | } |
124 | } |
125 | #endif /* CONFIG_SMP */ |
125 | #endif /* CONFIG_SMP */ |
126 | 126 | ||
127 | /* |
127 | /* |
128 | * At this point SMP, if present, is configured. |
128 | * At this point SMP, if present, is configured. |
129 | */ |
129 | */ |
130 | arch_post_smp_init(); |
130 | arch_post_smp_init(); |
131 | 131 | ||
132 | /* |
132 | /* |
133 | * Create kernel console. |
133 | * Create kernel console. |
134 | */ |
134 | */ |
135 | if (t = thread_create(kconsole, NULL, TASK, 0)) |
135 | if (t = thread_create(kconsole, NULL, TASK, 0)) |
136 | thread_ready(t); |
136 | thread_ready(t); |
137 | else panic("thread_create/kconsole\n"); |
137 | else panic("thread_create/kconsole\n"); |
138 | 138 | ||
139 | interrupts_enable(); |
139 | interrupts_enable(); |
140 | 140 | ||
141 | #ifdef CONFIG_USERSPACE |
141 | #ifdef CONFIG_USERSPACE |
142 | /* |
142 | /* |
143 | * Create the first user task. |
143 | * Create the first user task. |
144 | */ |
144 | */ |
145 | m = vm_create(NULL); |
145 | m = vm_create(NULL); |
146 | if (!m) |
146 | if (!m) |
147 | panic("vm_create\n"); |
147 | panic("vm_create\n"); |
148 | u = task_create(m); |
148 | u = task_create(m); |
149 | if (!u) |
149 | if (!u) |
150 | panic("task_create\n"); |
150 | panic("task_create\n"); |
151 | t = thread_create(uinit, NULL, u, THREAD_USER_STACK); |
151 | t = thread_create(uinit, NULL, u, THREAD_USER_STACK); |
152 | if (!t) |
152 | if (!t) |
153 | panic("thread_create\n"); |
153 | panic("thread_create\n"); |
154 | 154 | ||
155 | /* |
155 | /* |
156 | * Create the text vm_area and copy the userspace code there. |
156 | * Create the text vm_area and copy the userspace code there. |
157 | */ |
157 | */ |
158 | a = vm_area_create(m, VMA_TEXT, 1, UTEXT_ADDRESS); |
158 | a = vm_area_create(m, VMA_TEXT, 1, UTEXT_ADDRESS); |
159 | if (!a) |
159 | if (!a) |
160 | panic("vm_area_create: vm_text\n"); |
160 | panic("vm_area_create: vm_text\n"); |
161 | vm_area_map(a, m); |
161 | vm_area_map(a, m); |
162 | memcpy((void *) PA2KA(a->mapping[0]), (void *) utext, utext_size < PAGE_SIZE ? utext_size : PAGE_SIZE); |
162 | memcpy((void *) PA2KA(a->mapping[0]), (void *) utext, utext_size < PAGE_SIZE ? utext_size : PAGE_SIZE); |
163 | 163 | ||
164 | /* |
164 | /* |
165 | * Create the data vm_area. |
165 | * Create the data vm_area. |
166 | */ |
166 | */ |
167 | a = vm_area_create(m, VMA_STACK, 1, USTACK_ADDRESS); |
167 | a = vm_area_create(m, VMA_STACK, 1, USTACK_ADDRESS); |
168 | if (!a) |
168 | if (!a) |
169 | panic("vm_area_create: vm_stack\n"); |
169 | panic("vm_area_create: vm_stack\n"); |
170 | vm_area_map(a, m); |
170 | vm_area_map(a, m); |
171 | 171 | ||
172 | thread_ready(t); |
172 | thread_ready(t); |
173 | #endif /* CONFIG_USERSPACE */ |
173 | #endif /* CONFIG_USERSPACE */ |
174 | 174 | ||
175 | #ifdef CONFIG_TEST |
175 | #ifdef CONFIG_TEST |
176 | test(); |
176 | test(); |
177 | #endif /* CONFIG_TEST */ |
177 | #endif /* CONFIG_TEST */ |
178 | 178 | ||
179 | if (!stdin) { |
179 | if (!stdin) { |
180 | while (1) { |
180 | while (1) { |
181 | thread_sleep(1); |
181 | thread_sleep(1); |
182 | printf("kinit... "); |
182 | printf("kinit... "); |
183 | } |
183 | } |
184 | } |
184 | } |
185 | 185 | ||
186 | } |
186 | } |
187 | 187 |