Rev 756 | Rev 817 | Go to most recent revision | Only display areas with differences | Regard whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 756 | Rev 794 | ||
---|---|---|---|
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/as.h> |
42 | #include <mm/as.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 | as_t *as; |
72 | as_t *as; |
73 | as_area_t *a; |
73 | as_area_t *a; |
74 | __address frame; |
74 | __address frame; |
75 | count_t frames; |
75 | count_t frames; |
76 | int i; |
76 | int i; |
77 | task_t *u; |
77 | task_t *u; |
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 | cpu_list(); |
103 | cpu_list(); |
104 | 104 | ||
105 | #ifdef CONFIG_SMP |
105 | #ifdef CONFIG_SMP |
106 | if (config.cpu_count > 1) { |
106 | if (config.cpu_count > 1) { |
107 | int i; |
107 | int i; |
108 | 108 | ||
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, "kconsole", TASK, 0))) |
135 | if ((t = thread_create(kconsole, "kconsole", TASK, 0))) |
136 | thread_ready(t); |
136 | thread_ready(t); |
137 | else |
137 | else |
138 | panic("thread_create/kconsole\n"); |
138 | panic("thread_create/kconsole\n"); |
139 | 139 | ||
140 | interrupts_enable(); |
140 | interrupts_enable(); |
141 | 141 | ||
142 | if (config.init_size > 0) { |
142 | if (config.init_size > 0) { |
143 | /* |
143 | /* |
144 | * Create the first user task. |
144 | * Create the first user task. |
145 | */ |
145 | */ |
146 | 146 | ||
147 | if (KA2PA(config.init_addr) % FRAME_SIZE) |
147 | if (config.init_addr % FRAME_SIZE) |
148 | panic("config.init_addr is not frame aligned"); |
148 | panic("config.init_addr is not frame aligned"); |
149 | 149 | ||
150 | as = as_create(0); |
150 | as = as_create(0); |
151 | if (!as) |
151 | if (!as) |
152 | panic("as_create\n"); |
152 | panic("as_create\n"); |
153 | u = task_create(as); |
153 | u = task_create(as); |
154 | if (!u) |
154 | if (!u) |
155 | panic("task_create\n"); |
155 | panic("task_create\n"); |
156 | t = thread_create(uinit, NULL, u, THREAD_USER_STACK); |
156 | t = thread_create(uinit, NULL, u, THREAD_USER_STACK); |
157 | if (!t) |
157 | if (!t) |
158 | panic("thread_create\n"); |
158 | panic("thread_create\n"); |
159 | 159 | ||
160 | /* |
160 | /* |
161 | * Create the text as_area and initialize its mapping. |
161 | * Create the text as_area and initialize its mapping. |
162 | */ |
162 | */ |
163 | 163 | ||
164 | frame = KA2PA(config.init_addr); |
164 | frame = config.init_addr; |
- | 165 | if (IS_KA(frame)) |
|
- | 166 | frame = KA2PA(frame); |
|
- | 167 | ||
165 | frames = config.init_size / FRAME_SIZE; |
168 | frames = config.init_size / FRAME_SIZE; |
166 | if (config.init_size % FRAME_SIZE > 0) |
169 | if (config.init_size % FRAME_SIZE > 0) |
167 | frames++; |
170 | frames++; |
168 | 171 | ||
169 | a = as_area_create(as, AS_AREA_TEXT, frames, UTEXT_ADDRESS); |
172 | a = as_area_create(as, AS_AREA_TEXT, frames, UTEXT_ADDRESS); |
170 | if (!a) |
173 | if (!a) |
171 | panic("as_area_create: text\n"); |
174 | panic("as_area_create: text\n"); |
172 | 175 | ||
173 | for (i = 0; i < frames; i++) |
176 | for (i = 0; i < frames; i++) |
174 | as_set_mapping(as, UTEXT_ADDRESS + i * PAGE_SIZE, frame + i * FRAME_SIZE); |
177 | as_set_mapping(as, UTEXT_ADDRESS + i * PAGE_SIZE, frame + i * FRAME_SIZE); |
175 | 178 | ||
176 | /* |
179 | /* |
177 | * Create the data as_area. |
180 | * Create the data as_area. |
178 | */ |
181 | */ |
179 | a = as_area_create(as, AS_AREA_STACK, 1, USTACK_ADDRESS); |
182 | a = as_area_create(as, AS_AREA_STACK, 1, USTACK_ADDRESS); |
180 | if (!a) |
183 | if (!a) |
181 | panic("as_area_create: stack\n"); |
184 | panic("as_area_create: stack\n"); |
182 | 185 | ||
183 | thread_ready(t); |
186 | thread_ready(t); |
184 | } |
187 | } |
185 | 188 | ||
186 | #ifdef CONFIG_TEST |
189 | #ifdef CONFIG_TEST |
187 | test(); |
190 | test(); |
188 | #endif /* CONFIG_TEST */ |
191 | #endif /* CONFIG_TEST */ |
189 | 192 | ||
190 | if (!stdin) { |
193 | if (!stdin) { |
191 | while (1) { |
194 | while (1) { |
192 | thread_sleep(1); |
195 | thread_sleep(1); |
193 | printf("kinit... "); |
196 | printf("kinit... "); |
194 | } |
197 | } |
195 | } |
198 | } |
196 | 199 | ||
197 | } |
200 | } |
198 | 201 |