source: mainline/kernel/generic/src/main/main.c@ 83789ea2

ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since 83789ea2 was 7c5320c, checked in by Jiří Zárevúcky <zarevucky.jiri@…>, 3 years ago

Use the semaphore interface instead of waitq in some places

Since we already have an underused semaphore API in the kernel,
it would be worthwhile to use it in places where the baseline
semaphore semantics are needed. It makes the function of the
calls obvious even to people unfamiliar with the details of
waitq API.

  • Property mode set to 100644
File size: 9.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 kernel_generic
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 <debug.h>
51#include <context.h>
52#include <stdio.h>
53#include <panic.h>
54#include <assert.h>
55#include <config.h>
56#include <time/clock.h>
57#include <time/timeout.h>
58#include <proc/scheduler.h>
59#include <proc/thread.h>
60#include <proc/task.h>
61#include <main/kinit.h>
62#include <main/version.h>
63#include <console/kconsole.h>
64#include <console/console.h>
65#include <log.h>
66#include <cpu.h>
67#include <align.h>
68#include <interrupt.h>
69#include <str.h>
70#include <mm/frame.h>
71#include <mm/page.h>
72#include <genarch/mm/page_pt.h>
73#include <mm/km.h>
74#include <mm/tlb.h>
75#include <mm/as.h>
76#include <mm/slab.h>
77#include <mm/reserve.h>
78#include <synch/waitq.h>
79#include <synch/syswaitq.h>
80#include <arch/arch.h>
81#include <arch.h>
82#include <arch/faddr.h>
83#include <ipc/ipc.h>
84#include <macros.h>
85#include <smp/smp.h>
86#include <ddi/ddi.h>
87#include <main/main.h>
88#include <ipc/event.h>
89#include <sysinfo/sysinfo.h>
90#include <sysinfo/stats.h>
91#include <lib/ra.h>
92#include <cap/cap.h>
93
94/*
95 * Ensure [u]int*_t types are of correct size.
96 *
97 * Probably, this is not the best place for such tests
98 * but this file is compiled on all architectures.
99 */
100#define CHECK_INT_TYPE_(signness, size) \
101 static_assert(sizeof(signness##size##_t) * 8 == size, \
102 #signness #size "_t does not have " #size " bits");
103
104#define CHECK_INT_TYPE(size) \
105 CHECK_INT_TYPE_(int, size); \
106 CHECK_INT_TYPE_(uint, size)
107
108CHECK_INT_TYPE(8);
109CHECK_INT_TYPE(16);
110CHECK_INT_TYPE(32);
111CHECK_INT_TYPE(64);
112
113/** Global configuration structure. */
114config_t config = {
115 .identity_configured = false,
116 .non_identity_configured = false,
117 .physmem_end = 0
118};
119
120/** Boot arguments. */
121char bargs[CONFIG_BOOT_ARGUMENTS_BUFLEN] = { };
122
123/** Initial user-space tasks */
124init_t init = {
125 .cnt = 0
126};
127
128/** Boot allocations. */
129ballocs_t ballocs = {
130 .base = (uintptr_t) NULL,
131 .size = 0
132};
133
134context_t ctx;
135
136/** Lowest safe stack virtual address. */
137uintptr_t stack_safe = 0;
138
139/*
140 * These two functions prevent stack from underflowing during the
141 * kernel boot phase when SP is set to the very top of the reserved
142 * space. The stack could get corrupted by a fooled compiler-generated
143 * pop sequence otherwise.
144 */
145static void main_bsp_separated_stack(void);
146
147#ifdef CONFIG_SMP
148static void main_ap_separated_stack(void);
149#endif
150
151/** Main kernel routine for bootstrap CPU.
152 *
153 * The code here still runs on the boot stack, which knows nothing about
154 * preemption counts. Because of that, this function cannot directly call
155 * functions that disable or enable preemption (e.g. spinlock_lock()). The
156 * primary task of this function is to calculate address of a new stack and
157 * switch to it.
158 *
159 * Assuming interrupts_disable().
160 *
161 */
162_NO_TRACE void main_bsp(void)
163{
164 config.cpu_count = 1;
165 config.cpu_active = 1;
166
167 config.base = (uintptr_t) kernel_load_address;
168
169 config.kernel_size =
170 ALIGN_UP((uintptr_t) kdata_end - config.base, PAGE_SIZE);
171
172 /*
173 * NOTE: All kernel stacks must be aligned to STACK_SIZE,
174 * see CURRENT.
175 */
176
177 /* Place the stack after the kernel, init and ballocs. */
178 config.stack_base =
179 ALIGN_UP(config.base + config.kernel_size, STACK_SIZE);
180 config.stack_size = STACK_SIZE;
181
182 /* Avoid placing stack on top of init */
183 size_t i;
184 for (i = 0; i < init.cnt; i++) {
185 uintptr_t p = init.tasks[i].paddr + init.tasks[i].size;
186 uintptr_t bottom = PA2KA(ALIGN_UP(p, STACK_SIZE));
187
188 if (config.stack_base < bottom)
189 config.stack_base = bottom;
190 }
191
192 /* Avoid placing stack on top of boot allocations. */
193 if (ballocs.size) {
194 uintptr_t bottom =
195 ALIGN_UP(ballocs.base + ballocs.size, STACK_SIZE);
196 if (config.stack_base < bottom)
197 config.stack_base = bottom;
198 }
199
200 if (config.stack_base < stack_safe)
201 config.stack_base = ALIGN_UP(stack_safe, STACK_SIZE);
202
203 context_save(&ctx);
204 context_set(&ctx, FADDR(main_bsp_separated_stack),
205 config.stack_base, STACK_SIZE);
206 context_restore(&ctx);
207 /* not reached */
208}
209
210/** Main kernel routine for bootstrap CPU using new stack.
211 *
212 * Second part of main_bsp().
213 *
214 */
215void main_bsp_separated_stack(void)
216{
217 /* Keep this the first thing. */
218 current_initialize(CURRENT);
219
220 version_print();
221
222 LOG("\nconfig.base=%p config.kernel_size=%zu"
223 "\nconfig.stack_base=%p config.stack_size=%zu",
224 (void *) config.base, config.kernel_size,
225 (void *) config.stack_base, config.stack_size);
226
227#ifdef CONFIG_KCONSOLE
228 /*
229 * kconsole data structures must be initialized very early
230 * because other subsystems will register their respective
231 * commands.
232 */
233 kconsole_init();
234#endif
235
236 /*
237 * Exception handler initialization, before architecture
238 * starts adding its own handlers
239 */
240 exc_init();
241
242 /*
243 * Memory management subsystems initialization.
244 */
245 ARCH_OP(pre_mm_init);
246 km_identity_init();
247 frame_init();
248 slab_cache_init();
249 malloc_init();
250 ra_init();
251 sysinfo_init();
252 as_init();
253 page_init();
254 tlb_init();
255 km_non_identity_init();
256 ddi_init();
257 ARCH_OP(post_mm_init);
258 reserve_init();
259 ARCH_OP(pre_smp_init);
260 smp_init();
261
262 /* Slab must be initialized after we know the number of processors. */
263 slab_enable_cpucache();
264
265 uint64_t size;
266 const char *size_suffix;
267 bin_order_suffix(zones_total_size(), &size, &size_suffix, false);
268 printf("Detected %u CPU(s), %" PRIu64 " %s free memory\n",
269 config.cpu_count, size, size_suffix);
270
271 cpu_init();
272 calibrate_delay_loop();
273 ARCH_OP(post_cpu_init);
274
275 clock_counter_init();
276 timeout_init();
277 scheduler_init();
278 caps_init();
279 task_init();
280 thread_init();
281 sys_waitq_init();
282
283 sysinfo_set_item_data("boot_args", NULL, bargs, str_size(bargs) + 1);
284
285 if (init.cnt > 0) {
286 size_t i;
287 for (i = 0; i < init.cnt; i++)
288 LOG("init[%zu].addr=%p, init[%zu].size=%zu",
289 i, (void *) init.tasks[i].paddr, i, init.tasks[i].size);
290 } else
291 printf("No init binaries found.\n");
292
293 ipc_init();
294 event_init();
295 kio_init();
296 log_init();
297 stats_init();
298
299 /*
300 * Create kernel task.
301 */
302 task_t *kernel = task_create(AS_KERNEL, "kernel");
303 if (!kernel)
304 panic("Cannot create kernel task.");
305
306 /*
307 * Create the first thread.
308 */
309 thread_t *kinit_thread = thread_create(kinit, NULL, kernel,
310 THREAD_FLAG_UNCOUNTED, "kinit");
311 if (!kinit_thread)
312 panic("Cannot create kinit thread.");
313 thread_ready(kinit_thread);
314
315 /*
316 * This call to scheduler() will return to kinit,
317 * starting the thread of kernel threads.
318 */
319 scheduler();
320 /* not reached */
321}
322
323#ifdef CONFIG_SMP
324
325/** Main kernel routine for application CPUs.
326 *
327 * Executed by application processors, temporary stack
328 * is at ctx.sp which was set during BSP boot.
329 * This function passes control directly to
330 * main_ap_separated_stack().
331 *
332 * Assuming interrupts_disable()'d.
333 *
334 */
335void main_ap(void)
336{
337 /*
338 * Incrementing the active CPU counter will guarantee that the
339 * *_init() functions can find out that they need to
340 * do initialization for AP only.
341 */
342 config.cpu_active++;
343
344 /*
345 * The CURRENT structure is well defined because ctx.sp is used as stack.
346 */
347 current_initialize(CURRENT);
348
349 ARCH_OP(pre_mm_init);
350 frame_init();
351 page_init();
352 tlb_init();
353 ARCH_OP(post_mm_init);
354
355 cpu_init();
356 calibrate_delay_loop();
357 ARCH_OP(post_cpu_init);
358
359 current_copy(CURRENT, (current_t *) CPU->stack);
360
361 /*
362 * If we woke kmp up before we left the kernel stack, we could
363 * collide with another CPU coming up. To prevent this, we
364 * switch to this cpu's private stack prior to waking kmp up.
365 */
366 context_save(&CPU->saved_context);
367 context_set(&CPU->saved_context, FADDR(main_ap_separated_stack),
368 (uintptr_t) CPU->stack, STACK_SIZE);
369 context_restore(&CPU->saved_context);
370 /* not reached */
371}
372
373/** Main kernel routine for application CPUs using new stack.
374 *
375 * Second part of main_ap().
376 *
377 */
378void main_ap_separated_stack(void)
379{
380 /*
381 * Configure timeouts for this cpu.
382 */
383 timeout_init();
384
385 semaphore_up(&ap_completion_semaphore);
386 scheduler();
387 /* not reached */
388}
389
390#endif /* CONFIG_SMP */
391
392/** @}
393 */
Note: See TracBrowser for help on using the repository browser.