source: mainline/kernel/generic/src/main/main.c@ 26678e5

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

Make SMP related parts of main.c more generic.
Move initialization of local APIC to architecture specific code.
Add arch_post_cpu_init() to support the above.

  • Property mode set to 100644
File size: 8.6 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/** @addtogroup main
30 * @{
31 */
32
33/**
34 * @file
35 * @brief Main initialization kernel function for all processors.
36 *
37 * During kernel boot, all processors, after architecture dependent
38 * initialization, start executing code found in this file. After
39 * bringing up all subsystems, control is passed to scheduler().
40 *
41 * The bootstrap processor starts executing main_bsp() while
42 * the application processors start executing main_ap().
43 *
44 * @see scheduler()
45 * @see main_bsp()
46 * @see main_ap()
47 */
48
49#include <arch/asm.h>
50#include <context.h>
51#include <print.h>
52#include <panic.h>
53#include <debug.h>
54#include <config.h>
55#include <time/clock.h>
56#include <proc/scheduler.h>
57#include <proc/thread.h>
58#include <proc/task.h>
59#include <main/kinit.h>
60#include <main/version.h>
61#include <console/kconsole.h>
62#include <cpu.h>
63#include <align.h>
64#include <interrupt.h>
65#include <arch/mm/memory_init.h>
66#include <mm/frame.h>
67#include <mm/page.h>
68#include <genarch/mm/page_pt.h>
69#include <mm/tlb.h>
70#include <mm/as.h>
71#include <mm/slab.h>
72#include <synch/waitq.h>
73#include <synch/futex.h>
74#include <arch/arch.h>
75#include <arch.h>
76#include <arch/faddr.h>
77#include <typedefs.h>
78#include <ipc/ipc.h>
79#include <macros.h>
80#include <adt/btree.h>
81#include <console/klog.h>
82#include <smp/smp.h>
83
84/** Global configuration structure. */
85config_t config;
86
87/** Initial user-space tasks */
88init_t init = {
89 0
90};
91
92/** Boot allocations. */
93ballocs_t ballocs = {
94 .base = NULL,
95 .size = 0
96};
97
98context_t ctx;
99
100/*
101 * These 'hardcoded' variables will be intialized by
102 * the linker or the low level assembler code with
103 * appropriate sizes and addresses.
104 */
105uintptr_t hardcoded_load_address = 0; /**< Virtual address of where the kernel is loaded. */
106size_t hardcoded_ktext_size = 0; /**< Size of the kernel code in bytes. */
107size_t hardcoded_kdata_size = 0; /**< Size of the kernel data in bytes. */
108
109uintptr_t stack_safe = 0; /**< Lowest safe stack virtual address */
110
111void main_bsp(void);
112void main_ap(void);
113
114/*
115 * These two functions prevent stack from underflowing during the
116 * kernel boot phase when SP is set to the very top of the reserved
117 * space. The stack could get corrupted by a fooled compiler-generated
118 * pop sequence otherwise.
119 */
120static void main_bsp_separated_stack(void);
121#ifdef CONFIG_SMP
122static void main_ap_separated_stack(void);
123#endif
124
125#define CONFIG_STACK_SIZE ((1<<STACK_FRAMES)*STACK_SIZE)
126
127/** Main kernel routine for bootstrap CPU.
128 *
129 * Initializes the kernel by bootstrap CPU.
130 * This function passes control directly to
131 * main_bsp_separated_stack().
132 *
133 * Assuming interrupts_disable().
134 *
135 */
136void main_bsp(void)
137{
138 config.cpu_count = 1;
139 config.cpu_active = 1;
140
141 config.base = hardcoded_load_address;
142 config.memory_size = get_memory_size();
143
144 config.kernel_size = ALIGN_UP(hardcoded_ktext_size + hardcoded_kdata_size, PAGE_SIZE);
145 config.stack_size = CONFIG_STACK_SIZE;
146
147 /* Initialy the stack is placed just after the kernel */
148 config.stack_base = config.base + config.kernel_size;
149
150 /* Avoid placing stack on top of init */
151 count_t i;
152 for (i = 0; i < init.cnt; i++) {
153 if (PA_overlaps(config.stack_base, config.stack_size, init.tasks[i].addr, init.tasks[i].size))
154 config.stack_base = ALIGN_UP(init.tasks[i].addr + init.tasks[i].size, config.stack_size);
155 }
156
157 /* Avoid placing stack on top of boot allocations. */
158 if (ballocs.size) {
159 if (PA_overlaps(config.stack_base, config.stack_size, ballocs.base, ballocs.size))
160 config.stack_base = ALIGN_UP(ballocs.base + ballocs.size, PAGE_SIZE);
161 }
162
163 if (config.stack_base < stack_safe)
164 config.stack_base = ALIGN_UP(stack_safe, PAGE_SIZE);
165
166 context_save(&ctx);
167 context_set(&ctx, FADDR(main_bsp_separated_stack), config.stack_base, THREAD_STACK_SIZE);
168 context_restore(&ctx);
169 /* not reached */
170}
171
172
173/** Main kernel routine for bootstrap CPU using new stack.
174 *
175 * Second part of main_bsp().
176 *
177 */
178void main_bsp_separated_stack(void)
179{
180 task_t *k;
181 thread_t *t;
182 count_t i;
183
184 the_initialize(THE);
185
186 /*
187 * kconsole data structures must be initialized very early
188 * because other subsystems will register their respective
189 * commands.
190 */
191 kconsole_init();
192
193 /*
194 * Exception handler initialization, before architecture
195 * starts adding its own handlers
196 */
197 exc_init();
198
199 /*
200 * Memory management subsystems initialization.
201 */
202 arch_pre_mm_init();
203 frame_init(); /* Initialize at least 1 memory segment big enough for slab to work */
204 slab_cache_init();
205 btree_init();
206 as_init();
207 page_init();
208 tlb_init();
209 arch_post_mm_init();
210
211 version_print();
212 printf("kernel: %.*p hardcoded_ktext_size=%zdK, hardcoded_kdata_size=%zdK\n", sizeof(uintptr_t) * 2, config.base, hardcoded_ktext_size >> 10, hardcoded_kdata_size >> 10);
213 printf("stack: %.*p size=%zdK\n", sizeof(uintptr_t) * 2, config.stack_base, config.stack_size >> 10);
214
215 arch_pre_smp_init();
216 smp_init();
217
218 slab_enable_cpucache(); /* Slab must be initialized AFTER we know the number of processors */
219
220 printf("config.memory_size=%zdM\n", config.memory_size >> 20);
221 printf("config.cpu_count=%zd\n", config.cpu_count);
222 cpu_init();
223
224 calibrate_delay_loop();
225 clock_counter_init();
226 timeout_init();
227 scheduler_init();
228 task_init();
229 thread_init();
230 futex_init();
231 klog_init();
232
233 if (init.cnt > 0) {
234 for (i = 0; i < init.cnt; i++)
235 printf("init[%zd].addr=%.*p, init[%zd].size=%zd\n", i, sizeof(uintptr_t) * 2, init.tasks[i].addr, i, init.tasks[i].size);
236 } else
237 printf("No init tasks found\n");
238
239 ipc_init();
240
241 /*
242 * Create kernel task.
243 */
244 k = task_create(AS_KERNEL, "KERNEL");
245 if (!k)
246 panic("can't create kernel task\n");
247
248 /*
249 * Create the first thread.
250 */
251 t = thread_create(kinit, NULL, k, 0, "kinit");
252 if (!t)
253 panic("can't create kinit thread\n");
254 thread_ready(t);
255
256 /*
257 * This call to scheduler() will return to kinit,
258 * starting the thread of kernel threads.
259 */
260 scheduler();
261 /* not reached */
262}
263
264
265#ifdef CONFIG_SMP
266/** Main kernel routine for application CPUs.
267 *
268 * Executed by application processors, temporary stack
269 * is at ctx.sp which was set during BSP boot.
270 * This function passes control directly to
271 * main_ap_separated_stack().
272 *
273 * Assuming interrupts_disable()'d.
274 *
275 */
276void main_ap(void)
277{
278 /*
279 * Incrementing the active CPU counter will guarantee that the
280 * *_init() functions can find out that they need to
281 * do initialization for AP only.
282 */
283 config.cpu_active++;
284
285 /*
286 * The THE structure is well defined because ctx.sp is used as stack.
287 */
288 the_initialize(THE);
289
290 arch_pre_mm_init();
291 frame_init();
292 page_init();
293 tlb_init();
294 arch_post_mm_init();
295
296 cpu_init();
297 calibrate_delay_loop();
298 arch_post_cpu_init();
299
300 the_copy(THE, (the_t *) CPU->stack);
301
302 /*
303 * If we woke kmp up before we left the kernel stack, we could
304 * collide with another CPU coming up. To prevent this, we
305 * switch to this cpu's private stack prior to waking kmp up.
306 */
307 context_set(&CPU->saved_context, FADDR(main_ap_separated_stack), (uintptr_t) CPU->stack, CPU_STACK_SIZE);
308 context_restore(&CPU->saved_context);
309 /* not reached */
310}
311
312
313/** Main kernel routine for application CPUs using new stack.
314 *
315 * Second part of main_ap().
316 *
317 */
318void main_ap_separated_stack(void)
319{
320 /*
321 * Configure timeouts for this cpu.
322 */
323 timeout_init();
324
325 waitq_wakeup(&ap_completion_wq, WAKEUP_FIRST);
326 scheduler();
327 /* not reached */
328}
329#endif /* CONFIG_SMP */
330
331/** @}
332 */
Note: See TracBrowser for help on using the repository browser.