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

Subversion Repositories HelenOS

(root)/branches/dd/kernel/generic/src/main/main.c – Rev 4055 → 4156