Rev 629 | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 629 | Rev 654 | ||
---|---|---|---|
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 <interrupt.h> |
47 | #include <interrupt.h> |
48 | #include <console/kconsole.h> |
48 | #include <console/kconsole.h> |
49 | 49 | ||
50 | #ifdef CONFIG_SMP |
50 | #ifdef CONFIG_SMP |
51 | #include <arch/smp/mps.h> |
51 | #include <arch/smp/mps.h> |
52 | #endif /* CONFIG_SMP */ |
52 | #endif /* CONFIG_SMP */ |
53 | 53 | ||
54 | #include <synch/waitq.h> |
54 | #include <synch/waitq.h> |
55 | #include <synch/spinlock.h> |
55 | #include <synch/spinlock.h> |
56 | 56 | ||
57 | #ifdef CONFIG_TEST |
57 | #ifdef CONFIG_TEST |
58 | #include <test.h> |
58 | #include <test.h> |
59 | #endif /* CONFIG_TEST */ |
59 | #endif /* CONFIG_TEST */ |
60 | 60 | ||
61 | /** Kernel initialization thread. |
61 | /** Kernel initialization thread. |
62 | * |
62 | * |
63 | * kinit takes care of higher level kernel |
63 | * kinit takes care of higher level kernel |
64 | * initialization (i.e. thread creation, |
64 | * initialization (i.e. thread creation, |
65 | * userspace initialization etc.). |
65 | * userspace initialization etc.). |
66 | * |
66 | * |
67 | * @param arg Not used. |
67 | * @param arg Not used. |
68 | */ |
68 | */ |
69 | void kinit(void *arg) |
69 | void kinit(void *arg) |
70 | { |
70 | { |
71 | thread_t *t; |
71 | thread_t *t; |
72 | int i; |
72 | int i; |
73 | #ifdef CONFIG_USERSPACE |
73 | #ifdef CONFIG_USERSPACE |
74 | vm_t *m; |
74 | vm_t *m; |
75 | vm_area_t *a; |
75 | vm_area_t *a; |
76 | task_t *u; |
76 | task_t *u; |
77 | #endif |
77 | #endif |
78 | 78 | ||
79 | interrupts_disable(); |
79 | interrupts_disable(); |
80 | 80 | ||
81 | #ifdef CONFIG_SMP |
81 | #ifdef CONFIG_SMP |
82 | if (config.cpu_count > 1) { |
82 | if (config.cpu_count > 1) { |
83 | /* |
83 | /* |
84 | * Create the kmp thread and wait for its completion. |
84 | * Create the kmp thread and wait for its completion. |
85 | * cpu1 through cpuN-1 will come up consecutively and |
85 | * cpu1 through cpuN-1 will come up consecutively and |
86 | * not mess together with kcpulb threads. |
86 | * not mess together with kcpulb threads. |
87 | * Just a beautification. |
87 | * Just a beautification. |
88 | */ |
88 | */ |
89 | if ((t = thread_create(kmp, NULL, TASK, 0))) { |
89 | if ((t = thread_create(kmp, NULL, TASK, 0))) { |
90 | spinlock_lock(&t->lock); |
90 | spinlock_lock(&t->lock); |
91 | t->flags |= X_WIRED; |
91 | t->flags |= X_WIRED; |
92 | t->cpu = &cpus[0]; |
92 | t->cpu = &cpus[0]; |
93 | spinlock_unlock(&t->lock); |
93 | spinlock_unlock(&t->lock); |
94 | thread_ready(t); |
94 | thread_ready(t); |
95 | waitq_sleep(&kmp_completion_wq); |
95 | waitq_sleep(&kmp_completion_wq); |
96 | } |
96 | } |
97 | else panic("thread_create/kmp\n"); |
97 | else panic("thread_create/kmp\n"); |
98 | } |
98 | } |
99 | #endif /* CONFIG_SMP */ |
99 | #endif /* CONFIG_SMP */ |
100 | /* |
100 | /* |
101 | * Now that all CPUs are up, we can report what we've found. |
101 | * Now that all CPUs are up, we can report what we've found. |
102 | */ |
102 | */ |
103 | for (i = 0; i < config.cpu_count; i++) { |
103 | for (i = 0; i < config.cpu_count; i++) { |
104 | if (cpus[i].active) |
104 | if (cpus[i].active) |
105 | cpu_print_report(&cpus[i]); |
105 | cpu_print_report(&cpus[i]); |
106 | else |
106 | else |
107 | printf("cpu%d: not active\n", i); |
107 | printf("cpu%d: not active\n", i); |
108 | } |
108 | } |
109 | 109 | ||
110 | #ifdef CONFIG_SMP |
110 | #ifdef CONFIG_SMP |
111 | if (config.cpu_count > 1) { |
111 | if (config.cpu_count > 1) { |
112 | /* |
112 | /* |
113 | * For each CPU, create its load balancing thread. |
113 | * For each CPU, create its load balancing thread. |
114 | */ |
114 | */ |
115 | for (i = 0; i < config.cpu_count; i++) { |
115 | for (i = 0; i < config.cpu_count; i++) { |
116 | 116 | ||
117 | if ((t = thread_create(kcpulb, NULL, TASK, 0))) { |
117 | if ((t = thread_create(kcpulb, NULL, TASK, 0))) { |
118 | spinlock_lock(&t->lock); |
118 | spinlock_lock(&t->lock); |
119 | t->flags |= X_WIRED; |
119 | t->flags |= X_WIRED; |
120 | t->cpu = &cpus[i]; |
120 | t->cpu = &cpus[i]; |
121 | spinlock_unlock(&t->lock); |
121 | spinlock_unlock(&t->lock); |
122 | thread_ready(t); |
122 | thread_ready(t); |
123 | } |
123 | } |
124 | else panic("thread_create/kcpulb\n"); |
124 | else panic("thread_create/kcpulb\n"); |
125 | 125 | ||
126 | } |
126 | } |
127 | } |
127 | } |
128 | #endif /* CONFIG_SMP */ |
128 | #endif /* CONFIG_SMP */ |
129 | 129 | ||
130 | /* |
130 | /* |
131 | * At this point SMP, if present, is configured. |
131 | * At this point SMP, if present, is configured. |
132 | */ |
132 | */ |
133 | arch_post_smp_init(); |
133 | arch_post_smp_init(); |
134 | 134 | ||
135 | /* |
135 | /* |
136 | * Create kernel console. |
136 | * Create kernel console. |
137 | */ |
137 | */ |
138 | if ((t = thread_create(kconsole, "kconsole", TASK, 0))) |
138 | if ((t = thread_create(kconsole, "kconsole", TASK, 0))) |
139 | thread_ready(t); |
139 | thread_ready(t); |
140 | else panic("thread_create/kconsole\n"); |
140 | else panic("thread_create/kconsole\n"); |
141 | 141 | ||
142 | interrupts_enable(); |
142 | interrupts_enable(); |
143 | 143 | ||
144 | #ifdef CONFIG_USERSPACE |
144 | #ifdef CONFIG_USERSPACE |
145 | /* |
145 | /* |
146 | * Create the first user task. |
146 | * Create the first user task. |
147 | */ |
147 | */ |
148 | m = vm_create(NULL); |
148 | m = vm_create(NULL); |
149 | if (!m) |
149 | if (!m) |
150 | panic("vm_create\n"); |
150 | panic("vm_create\n"); |
151 | u = task_create(m); |
151 | u = task_create(m); |
152 | if (!u) |
152 | if (!u) |
153 | panic("task_create\n"); |
153 | panic("task_create\n"); |
154 | t = thread_create(uinit, NULL, u, THREAD_USER_STACK); |
154 | t = thread_create(uinit, NULL, u, THREAD_USER_STACK); |
155 | if (!t) |
155 | if (!t) |
156 | panic("thread_create\n"); |
156 | panic("thread_create\n"); |
157 | 157 | ||
158 | /* |
158 | /* |
159 | * Create the text vm_area and copy the userspace code there. |
159 | * Create the text vm_area and copy the userspace code there. |
160 | */ |
160 | */ |
161 | a = vm_area_create(m, VMA_TEXT, 1, UTEXT_ADDRESS); |
161 | a = vm_area_create(m, VMA_TEXT, 1, UTEXT_ADDRESS); |
162 | if (!a) |
162 | if (!a) |
163 | panic("vm_area_create: vm_text\n"); |
163 | panic("vm_area_create: vm_text\n"); |
164 | vm_area_map(a, m); |
164 | vm_area_map(a, m); |
165 | if (config.init_size > 0) |
165 | if (config.init_size > 0) |
166 | memcpy((void *) PA2KA(a->mapping[0]), (void *) config.init_addr, config.init_size < PAGE_SIZE ? config.init_size : PAGE_SIZE); |
166 | memcpy((void *) PA2KA(a->mapping[0]), (void *) config.init_addr, config.init_size < PAGE_SIZE ? config.init_size : PAGE_SIZE); |
167 | else |
167 | else |
168 | memcpy((void *) PA2KA(a->mapping[0]), (void *) utext, utext_size < PAGE_SIZE ? utext_size : PAGE_SIZE); |
168 | memcpy((void *) PA2KA(a->mapping[0]), (void *) utext, utext_size < PAGE_SIZE ? utext_size : PAGE_SIZE); |
169 | 169 | ||
170 | /* |
170 | /* |
171 | * Create the data vm_area. |
171 | * Create the data vm_area. |
172 | */ |
172 | */ |
173 | a = vm_area_create(m, VMA_STACK, 1, USTACK_ADDRESS); |
173 | a = vm_area_create(m, VMA_STACK, 1, USTACK_ADDRESS); |
174 | if (!a) |
174 | if (!a) |
175 | panic("vm_area_create: vm_stack\n"); |
175 | panic("vm_area_create: vm_stack\n"); |
176 | vm_area_map(a, m); |
176 | vm_area_map(a, m); |
177 | 177 | ||
178 | thread_ready(t); |
178 | thread_ready(t); |
179 | #endif /* CONFIG_USERSPACE */ |
179 | #endif /* CONFIG_USERSPACE */ |
180 | 180 | ||
181 | #ifdef CONFIG_TEST |
181 | #ifdef CONFIG_TEST |
182 | test(); |
182 | test(); |
183 | #endif /* CONFIG_TEST */ |
183 | #endif /* CONFIG_TEST */ |
184 | 184 | ||
185 | if (!stdin) { |
185 | if (!stdin) { |
186 | while (1) { |
186 | while (1) { |
187 | thread_sleep(1); |
187 | thread_sleep(1); |
188 | printf("kinit... "); |
188 | printf("kinit... "); |
189 | } |
189 | } |
190 | } |
190 | } |
191 | 191 | ||
192 | } |
192 | } |
193 | 193 |