WebSVN – HelenOS – Diff – /trunk/kernel/generic/src/main/main.c


/*
 * Copyright (c) 2001-2004 Jakub Jermar
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * - Redistributions of source code must retain the above copyright
 *   notice, this list of conditions and the following disclaimer.
 * - Redistributions in binary form must reproduce the above copyright
 *   notice, this list of conditions and the following disclaimer in the
 *   documentation and/or other materials provided with the distribution.
 * - The name of the author may not be used to endorse or promote products
 *   derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
 
/** @addtogroup main
 * @{
 */
 
/**
 * @file
 * @brief   Main initialization kernel function for all processors.
 *
 * During kernel boot, all processors, after architecture dependent
 * initialization, start executing code found in this file. After
 * bringing up all subsystems, control is passed to scheduler().
 *
 * The bootstrap processor starts executing main_bsp() while
 * the application processors start executing main_ap().
 *
 * @see scheduler()
 * @see main_bsp()
 * @see main_ap()
 */
 
#include <arch/asm.h>
#include <context.h>
#include <print.h>
#include <panic.h>
#include <debug.h>
#include <config.h>
#include <time/clock.h>
#include <time/timeout.h>
#include <proc/scheduler.h>
#include <proc/thread.h>
#include <proc/task.h>
#include <proc/tasklet.h>
#include <main/kinit.h>
#include <main/version.h>
#include <console/kconsole.h>
#include <console/console.h>
#include <cpu.h>
#include <align.h>
#include <interrupt.h>
#include <mm/frame.h>
#include <mm/page.h>
#include <genarch/mm/page_pt.h>
#include <mm/tlb.h>
#include <mm/as.h>
#include <mm/slab.h>
#include <synch/waitq.h>
#include <synch/futex.h>
#include <arch/arch.h>
#include <arch.h>
#include <arch/faddr.h>
#include <ipc/ipc.h>
#include <macros.h>
#include <adt/btree.h>
#include <smp/smp.h>
#include <ddi/ddi.h>
 
 
 
/** Global configuration structure. */
config_t config;
 
/** Initial user-space tasks */
init_t init = {
    .cnt = 0
};
 
/** Boot allocations. */
ballocs_t ballocs = {
    .base = NULL,
    .size = 0
};
 
context_t ctx;
 
/*
 * These 'hardcoded' variables will be intialized by
 * the linker or the low level assembler code with
 * appropriate sizes and addresses.
 */
 
/**< Virtual address of where the kernel is loaded. */
uintptr_t hardcoded_load_address = 0;
/**< Size of the kernel code in bytes. */
size_t hardcoded_ktext_size = 0;
/**< Size of the kernel data in bytes. */
size_t hardcoded_kdata_size = 0;
/**< Lowest safe stack virtual address. */
uintptr_t stack_safe = 0;      
 
void main_bsp(void);
void main_ap(void);
 
/*
 * These two functions prevent stack from underflowing during the
 * kernel boot phase when SP is set to the very top of the reserved
 * space. The stack could get corrupted by a fooled compiler-generated
 * pop sequence otherwise.
 */
static void main_bsp_separated_stack(void);
#ifdef CONFIG_SMP
static void main_ap_separated_stack(void);
#endif
 
#define CONFIG_STACK_SIZE   ((1 << STACK_FRAMES) * STACK_SIZE)
 
/** Main kernel routine for bootstrap CPU.
 *
 * The code here still runs on the boot stack, which knows nothing about
 * preemption counts.  Because of that, this function cannot directly call
 * functions that disable or enable preemption (e.g. spinlock_lock()). The
 * primary task of this function is to calculate address of a new stack and
 * switch to it.
 *
 * Assuming interrupts_disable().
 *
 */
void main_bsp(void)
{
    config.cpu_count = 1;
    config.cpu_active = 1;
   
    config.base = hardcoded_load_address;
    config.kernel_size = ALIGN_UP(hardcoded_ktext_size +
        hardcoded_kdata_size, PAGE_SIZE);
    config.stack_size = CONFIG_STACK_SIZE;
   
    /* Initialy the stack is placed just after the kernel */
    config.stack_base = config.base + config.kernel_size;
   
    /* Avoid placing stack on top of init */
    count_t i;
    for (i = 0; i < init.cnt; i++) {
        if (PA_overlaps(config.stack_base, config.stack_size,
            init.tasks[i].addr, init.tasks[i].size))
            config.stack_base = ALIGN_UP(init.tasks[i].addr +
                init.tasks[i].size, config.stack_size);
    }
 
    /* Avoid placing stack on top of boot allocations. */
    if (ballocs.size) {
        if (PA_overlaps(config.stack_base, config.stack_size,
            ballocs.base, ballocs.size))
            config.stack_base = ALIGN_UP(ballocs.base +
                ballocs.size, PAGE_SIZE);
    }
   
    if (config.stack_base < stack_safe)
        config.stack_base = ALIGN_UP(stack_safe, PAGE_SIZE);
   
    context_save(&ctx);
    context_set(&ctx, FADDR(main_bsp_separated_stack), config.stack_base,
        THREAD_STACK_SIZE);
    context_restore(&ctx);
    /* not reached */
}
 
 
/** Main kernel routine for bootstrap CPU using new stack.
 *
 * Second part of main_bsp().
 *
 */
void main_bsp_separated_stack(void)
{
    /* Keep this the first thing. */
    the_initialize(THE);
 
    LOG();
   
    version_print();
   
    LOG("\nconfig.base=%#" PRIp " config.kernel_size=%" PRIs
        "\nconfig.stack_base=%#" PRIp " config.stack_size=%" PRIs,
        config.base, config.kernel_size, config.stack_base,
        config.stack_size);
   
 
    /*
     * kconsole data structures must be initialized very early
     * because other subsystems will register their respective
     * commands.
     */
    LOG_EXEC(kconsole_init());
   
    /*
     * Exception handler initialization, before architecture
     * starts adding its own handlers
     */
    LOG_EXEC(exc_init());
 
    /*
     * Memory management subsystems initialization.
     */
    LOG_EXEC(arch_pre_mm_init());
    LOG_EXEC(frame_init());
   
    /* Initialize at least 1 memory segment big enough for slab to work. */
    LOG_EXEC(slab_cache_init());
    LOG_EXEC(btree_init());
    LOG_EXEC(as_init());
    LOG_EXEC(page_init());
    LOG_EXEC(tlb_init());
    LOG_EXEC(ddi_init());
    LOG_EXEC(tasklet_init());
    LOG_EXEC(arch_post_mm_init());
    LOG_EXEC(arch_pre_smp_init());
    LOG_EXEC(smp_init());
   
    /* Slab must be initialized after we know the number of processors. */
    LOG_EXEC(slab_enable_cpucache());
   
    printf("Detected %" PRIc " CPU(s), %" PRIu64" MiB free memory\n",
        config.cpu_count, SIZE2MB(zone_total_size()));
   
    LOG_EXEC(cpu_init());
   
    LOG_EXEC(calibrate_delay_loop());
    LOG_EXEC(clock_counter_init());
    LOG_EXEC(timeout_init());
    LOG_EXEC(scheduler_init());
    LOG_EXEC(task_init());
    LOG_EXEC(thread_init());
    LOG_EXEC(futex_init());
   
    if (init.cnt > 0) {
        count_t i;
        for (i = 0; i < init.cnt; i++)
            printf("init[%" PRIc "].addr=%#" PRIp ", init[%" PRIc
                "].size=%#" PRIs "\n", i, init.tasks[i].addr, i,
                init.tasks[i].size);
    } else
        printf("No init binaries found\n");
   
    LOG_EXEC(ipc_init());
    LOG_EXEC(klog_init());
 
    /*
     * Create kernel task.
     */
    task_t *kernel = task_create(AS_KERNEL, "kernel");
    if (!kernel)
        panic("Can't create kernel task\n");
   
    /*
     * Create the first thread.
     */
    thread_t *kinit_thread = thread_create(kinit, NULL, kernel, 0, "kinit",
        true);
    if (!kinit_thread)
        panic("Can't create kinit thread\n");
    LOG_EXEC(thread_ready(kinit_thread));
   
    /*
     * This call to scheduler() will return to kinit,
     * starting the thread of kernel threads.
     */
    scheduler();
    /* not reached */
}
 
 
#ifdef CONFIG_SMP
/** Main kernel routine for application CPUs.
 *
 * Executed by application processors, temporary stack
 * is at ctx.sp which was set during BSP boot.
 * This function passes control directly to
 * main_ap_separated_stack().
 *
 * Assuming interrupts_disable()'d.
 *
 */
void main_ap(void)
{
    /*
     * Incrementing the active CPU counter will guarantee that the
     * *_init() functions can find out that they need to
     * do initialization for AP only.
     */
    config.cpu_active++;
 
    /*
     * The THE structure is well defined because ctx.sp is used as stack.
     */
    the_initialize(THE);
   
    arch_pre_mm_init();
    frame_init();
    page_init();
    tlb_init();
    arch_post_mm_init();
   
    cpu_init();
    calibrate_delay_loop();
    arch_post_cpu_init();
 
    the_copy(THE, (the_t *) CPU->stack);
 
    /*
     * If we woke kmp up before we left the kernel stack, we could
     * collide with another CPU coming up. To prevent this, we
     * switch to this cpu's private stack prior to waking kmp up.
     */
    context_set(&CPU->saved_context, FADDR(main_ap_separated_stack),
        (uintptr_t) CPU->stack, CPU_STACK_SIZE);
    context_restore(&CPU->saved_context);
    /* not reached */
}
 
 
/** Main kernel routine for application CPUs using new stack.
 *
 * Second part of main_ap().
 *
 */
void main_ap_separated_stack(void)
{
    /*
     * Configure timeouts for this cpu.
     */
    timeout_init();
 
    waitq_wakeup(&ap_completion_wq, WAKEUP_FIRST);
    scheduler();
    /* not reached */
}
#endif /* CONFIG_SMP */
 
/** @}
 */
 

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

Subversion Repositories HelenOS

(root)/trunk/kernel/generic/src/main/main.c @ 3422 – Rev 3175 → 3193