WebSVN – HelenOS-historic – Diff – /kernel/trunk/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.
 */
 
#include <arch/asm.h>
#include <context.h>
#include <print.h>
#include <panic.h>
#include <debug.h>
#include <config.h>
#include <time/clock.h>
#include <proc/scheduler.h>
#include <proc/thread.h>
#include <proc/task.h>
#include <main/kinit.h>
#include <main/version.h>
#include <console/kconsole.h>
#include <cpu.h>
#include <align.h>
#include <interrupt.h>
#include <arch/mm/memory_init.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 <typedefs.h>
#include <ipc/ipc.h>
#include <macros.h>
 
#ifdef CONFIG_SMP
#include <arch/smp/apic.h>
#include <arch/smp/mps.h>
#endif /* CONFIG_SMP */
#include <smp/smp.h>
 
config_t config;    /**< Global configuration structure. */
init_t init = {0};      /**< Initial user-space tasks */
 
context_t ctx;
 
/**
 * These 'hardcoded' variables will be intialized by
 * the linker or the low level assembler code with
 * appropriate sizes and addresses.
 */
__address hardcoded_load_address = 0;
size_t hardcoded_ktext_size = 0;
size_t hardcoded_kdata_size = 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)
 
/** Bootstrap CPU main kernel routine
 *
 * Initializes the kernel by bootstrap CPU.
 * This function passes control directly to
 * main_bsp_separated_stack().
 *
 * Assuming interrupts_disable().
 *
 */
void main_bsp(void)
{
    __address stackaddr;
 
    config.cpu_count = 1;
    config.cpu_active = 1;
   
    config.base = hardcoded_load_address;
    config.memory_size = get_memory_size();
   
    config.kernel_size = ALIGN_UP(hardcoded_ktext_size + hardcoded_kdata_size, PAGE_SIZE);
    stackaddr = config.base + config.kernel_size;
   
    /* Avoid placing kernel on top of init */
    count_t i;
    bool overlap = false;
    for (i = 0; i < init.cnt; i++)
        if (PA_overlaps(stackaddr, CONFIG_STACK_SIZE, init.tasks[i].addr, init.tasks[i].size)) {
            stackaddr = ALIGN_UP(init.tasks[i].addr + init.tasks[i].size, CONFIG_STACK_SIZE);
            init.tasks[i].size = ALIGN_UP(init.tasks[i].size, CONFIG_STACK_SIZE) + CONFIG_STACK_SIZE;
            overlap = true;
        }
   
    if (!overlap)
        config.kernel_size += CONFIG_STACK_SIZE;
   
    context_save(&ctx);
    context_set(&ctx, FADDR(main_bsp_separated_stack), stackaddr, THREAD_STACK_SIZE);
 
    context_restore(&ctx);
    /* not reached */
}
 
 
/** Bootstrap CPU main kernel routine stack wrapper
 *
 * Second part of main_bsp().
 *
 */
void main_bsp_separated_stack(void)
{
    task_t *k;
    thread_t *t;
    count_t i;
   
    the_initialize(THE);
 
    /*
     * kconsole data structures must be initialized very early
     * because other subsystems will register their respective
     * commands.
     */
    kconsole_init();
   
    /*
     * Exception handler initialization, before architecture
     * starts adding its own handlers
     */
    exc_init();
 
    /*
     * Memory management subsystems initialization.
     */
    arch_pre_mm_init();
    frame_init();       /* Initialize at least 1 memory segment big enough for slab to work */
    slab_cache_init();
    as_init();
    page_init();
    tlb_init();
    arch_post_mm_init();   
 
    version_print();
    printf("%P: hardcoded_ktext_size=%dK, hardcoded_kdata_size=%dK\n",
        config.base, hardcoded_ktext_size/1024, hardcoded_kdata_size/1024);
 
    arch_pre_smp_init();
    smp_init();
   
    slab_enable_cpucache(); /* Slab must be initialized AFTER we know the number of processors */
 
    printf("config.memory_size=%dM\n", config.memory_size/(1024*1024));
    printf("config.cpu_count=%d\n", config.cpu_count);
    cpu_init();
   
    calibrate_delay_loop();
    timeout_init();
    scheduler_init();
    task_init();
    thread_init();
    futex_init();
   
    for (i = 0; i < init.cnt; i++)
        printf("init[%d].addr=%P, init[%d].size=%d\n", i, init.tasks[i].addr, i, init.tasks[i].size);
   
    ipc_init();
 
    /*
     * Create kernel task.
     */
    k = task_create(AS_KERNEL, "KERNEL");
    if (!k)
        panic("can't create kernel task\n");
   
    /*
     * Create the first thread.
     */
    t = thread_create(kinit, NULL, k, 0, "kinit");
    if (!t)
        panic("can't create kinit thread\n");
    thread_ready(t);
   
    /*
     * This call to scheduler() will return to kinit,
     * starting the thread of kernel threads.
     */
    scheduler();
    /* not reached */
}
 
 
#ifdef CONFIG_SMP
/** Application CPUs main kernel routine
 *
 * Executed by application processors, temporary stack
 * is at ctx.sp which was set during BP 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
     * pm_init() will not attempt to build GDT and IDT tables again.
     * Neither frame_init() will do the complete thing. Neither cpu_init()
     * will do.
     */
    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();
 
    l_apic_init();
    l_apic_debug();
 
    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), (__address) CPU->stack, CPU_STACK_SIZE);
    context_restore(&CPU->saved_context);
    /* not reached */
}
 
 
/** Application CPUs main kernel routine stack wrapper
 *
 * 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 1109	Rev 1138
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 <arch/asm.h>	29	#include <arch/asm.h>
30	#include <context.h>	30	#include <context.h>
31	#include <print.h>	31	#include <print.h>
32	#include <panic.h>	32	#include <panic.h>
33	#include <debug.h>	33	#include <debug.h>
34	#include <config.h>	34	#include <config.h>
35	#include <time/clock.h>	35	#include <time/clock.h>
36	#include <proc/scheduler.h>	36	#include <proc/scheduler.h>
37	#include <proc/thread.h>	37	#include <proc/thread.h>
38	#include <proc/task.h>	38	#include <proc/task.h>
39	#include <main/kinit.h>	39	#include <main/kinit.h>
40	#include <main/version.h>	40	#include <main/version.h>
41	#include <console/kconsole.h>	41	#include <console/kconsole.h>
42	#include <cpu.h>	42	#include <cpu.h>
43	#include <align.h>	43	#include <align.h>
44	#include <interrupt.h>	44	#include <interrupt.h>
45	#include <arch/mm/memory_init.h>	45	#include <arch/mm/memory_init.h>
46	#include <mm/frame.h>	46	#include <mm/frame.h>
47	#include <mm/page.h>	47	#include <mm/page.h>
48	#include <genarch/mm/page_pt.h>	48	#include <genarch/mm/page_pt.h>
49	#include <mm/tlb.h>	49	#include <mm/tlb.h>
50	#include <mm/as.h>	50	#include <mm/as.h>
51	#include <mm/slab.h>	51	#include <mm/slab.h>
52	#include <synch/waitq.h>	52	#include <synch/waitq.h>
53	#include <synch/futex.h>	53	#include <synch/futex.h>
54	#include <arch/arch.h>	54	#include <arch/arch.h>
55	#include <arch.h>	55	#include <arch.h>
56	#include <arch/faddr.h>	56	#include <arch/faddr.h>
57	#include <typedefs.h>	57	#include <typedefs.h>
58	#include <ipc/ipc.h>	58	#include <ipc/ipc.h>
59	#include <macros.h>	59	#include <macros.h>
60		60
61	#ifdef CONFIG_SMP	61	#ifdef CONFIG_SMP
62	#include <arch/smp/apic.h>	62	#include <arch/smp/apic.h>
63	#include <arch/smp/mps.h>	63	#include <arch/smp/mps.h>
64	#endif /* CONFIG_SMP */	64	#endif /* CONFIG_SMP */
65	#include <smp/smp.h>	65	#include <smp/smp.h>
66		66
67	config_t config; /*< Global configuration structure. /	67	config_t config; /*< Global configuration structure. /
68	init_t init = {0}; /*< Initial user-space tasks /	68	init_t init = {0}; /*< Initial user-space tasks /
69		69
70	context_t ctx;	70	context_t ctx;
71		71
72	/**	72	/**
73	* These 'hardcoded' variables will be intialized by	73	* These 'hardcoded' variables will be intialized by
74	* the linker or the low level assembler code with	74	* the linker or the low level assembler code with
75	* appropriate sizes and addresses.	75	* appropriate sizes and addresses.
76	*/	76	*/
77	__address hardcoded_load_address = 0;	77	__address hardcoded_load_address = 0;
78	size_t hardcoded_ktext_size = 0;	78	size_t hardcoded_ktext_size = 0;
79	size_t hardcoded_kdata_size = 0;	79	size_t hardcoded_kdata_size = 0;
80		80
81	void main_bsp(void);	81	void main_bsp(void);
82	void main_ap(void);	82	void main_ap(void);
83		83
84	/*	84	/*
85	* These two functions prevent stack from underflowing during the	85	* These two functions prevent stack from underflowing during the
86	* kernel boot phase when SP is set to the very top of the reserved	86	* kernel boot phase when SP is set to the very top of the reserved
87	* space. The stack could get corrupted by a fooled compiler-generated	87	* space. The stack could get corrupted by a fooled compiler-generated
88	* pop sequence otherwise.	88	* pop sequence otherwise.
89	*/	89	*/
90	static void main_bsp_separated_stack(void);	90	static void main_bsp_separated_stack(void);
91	#ifdef CONFIG_SMP	91	#ifdef CONFIG_SMP
92	static void main_ap_separated_stack(void);	92	static void main_ap_separated_stack(void);
93	#endif	93	#endif
94		94
-		95	#define CONFIG_STACK_SIZE ((1<<STACK_FRAMES)*STACK_SIZE)
-		96
95	/** Bootstrap CPU main kernel routine	97	/** Bootstrap CPU main kernel routine
96	*	98	*
97	* Initializes the kernel by bootstrap CPU.	99	* Initializes the kernel by bootstrap CPU.
98	* This function passes control directly to	100	* This function passes control directly to
99	* main_bsp_separated_stack().	101	* main_bsp_separated_stack().
100	*	102	*
101	* Assuming interrupts_disable().	103	* Assuming interrupts_disable().
102	*	104	*
103	*/	105	*/
104	void main_bsp(void)	106	void main_bsp(void)
105	{	107	{
106	__address stackaddr;	108	__address stackaddr;
107		109
108	config.cpu_count = 1;	110	config.cpu_count = 1;
109	config.cpu_active = 1;	111	config.cpu_active = 1;
110		112
111	config.base = hardcoded_load_address;	113	config.base = hardcoded_load_address;
112	config.memory_size = get_memory_size();	114	config.memory_size = get_memory_size();
113		115
114	config.kernel_size = ALIGN_UP(hardcoded_ktext_size + hardcoded_kdata_size, PAGE_SIZE);	116	config.kernel_size = ALIGN_UP(hardcoded_ktext_size + hardcoded_kdata_size, PAGE_SIZE);
115	stackaddr = config.base + config.kernel_size;	117	stackaddr = config.base + config.kernel_size;
116		118
117	/* Avoid placing kernel on top of init */	119	/* Avoid placing kernel on top of init */
118	count_t i;	120	count_t i;
119	bool overlap = false;	121	bool overlap = false;
120	for (i = 0; i < init.cnt; i++)	122	for (i = 0; i < init.cnt; i++)
121	if (PA_overlaps(stackaddr, CONFIG_STACK_SIZE, init.tasks[i].addr, init.tasks[i].size)) {	123	if (PA_overlaps(stackaddr, CONFIG_STACK_SIZE, init.tasks[i].addr, init.tasks[i].size)) {
122	stackaddr = ALIGN_UP(init.tasks[i].addr + init.tasks[i].size, CONFIG_STACK_SIZE);	124	stackaddr = ALIGN_UP(init.tasks[i].addr + init.tasks[i].size, CONFIG_STACK_SIZE);
123	init.tasks[i].size = ALIGN_UP(init.tasks[i].size, CONFIG_STACK_SIZE) + CONFIG_STACK_SIZE;	125	init.tasks[i].size = ALIGN_UP(init.tasks[i].size, CONFIG_STACK_SIZE) + CONFIG_STACK_SIZE;
124	overlap = true;	126	overlap = true;
125	}	127	}
126		128
127	if (!overlap)	129	if (!overlap)
128	config.kernel_size += CONFIG_STACK_SIZE;	130	config.kernel_size += CONFIG_STACK_SIZE;
129		131
130	context_save(&ctx);	132	context_save(&ctx);
131	context_set(&ctx, FADDR(main_bsp_separated_stack),	133	context_set(&ctx, FADDR(main_bsp_separated_stack), stackaddr, THREAD_STACK_SIZE);
132	stackaddr, CONFIG_STACK_SIZE);	-
133	context_restore(&ctx);	134	context_restore(&ctx);
134	/* not reached */	135	/* not reached */
135	}	136	}
136		137
137		138
138	/** Bootstrap CPU main kernel routine stack wrapper	139	/** Bootstrap CPU main kernel routine stack wrapper
139	*	140	*
140	* Second part of main_bsp().	141	* Second part of main_bsp().
141	*	142	*
142	*/	143	*/
143	void main_bsp_separated_stack(void)	144	void main_bsp_separated_stack(void)
144	{	145	{
145	task_t *k;	146	task_t *k;
146	thread_t *t;	147	thread_t *t;
147	count_t i;	148	count_t i;
148		149
149	the_initialize(THE);	150	the_initialize(THE);
150		151
151	/*	152	/*
152	* kconsole data structures must be initialized very early	153	* kconsole data structures must be initialized very early
153	* because other subsystems will register their respective	154	* because other subsystems will register their respective
154	* commands.	155	* commands.
155	*/	156	*/
156	kconsole_init();	157	kconsole_init();
157		158
158	/*	159	/*
159	* Exception handler initialization, before architecture	160	* Exception handler initialization, before architecture
160	* starts adding its own handlers	161	* starts adding its own handlers
161	*/	162	*/
162	exc_init();	163	exc_init();
163		164
164	/*	165	/*
165	* Memory management subsystems initialization.	166	* Memory management subsystems initialization.
166	*/	167	*/
167	arch_pre_mm_init();	168	arch_pre_mm_init();
168	frame_init(); /* Initialize at least 1 memory segment big enough for slab to work */	169	frame_init(); /* Initialize at least 1 memory segment big enough for slab to work */
169	slab_cache_init();	170	slab_cache_init();
170	as_init();	171	as_init();
171	page_init();	172	page_init();
172	tlb_init();	173	tlb_init();
173	arch_post_mm_init();	174	arch_post_mm_init();
174		175
175	version_print();	176	version_print();
176	printf("%P: hardcoded_ktext_size=%dK, hardcoded_kdata_size=%dK\n",	177	printf("%P: hardcoded_ktext_size=%dK, hardcoded_kdata_size=%dK\n",
177	config.base, hardcoded_ktext_size/1024, hardcoded_kdata_size/1024);	178	config.base, hardcoded_ktext_size/1024, hardcoded_kdata_size/1024);
178		179
179	arch_pre_smp_init();	180	arch_pre_smp_init();
180	smp_init();	181	smp_init();
181		182
182	slab_enable_cpucache(); /* Slab must be initialized AFTER we know the number of processors */	183	slab_enable_cpucache(); /* Slab must be initialized AFTER we know the number of processors */
183		184
184	printf("config.memory_size=%dM\n", config.memory_size/(1024*1024));	185	printf("config.memory_size=%dM\n", config.memory_size/(1024*1024));
185	printf("config.cpu_count=%d\n", config.cpu_count);	186	printf("config.cpu_count=%d\n", config.cpu_count);
186	cpu_init();	187	cpu_init();
187		188
188	calibrate_delay_loop();	189	calibrate_delay_loop();
189	timeout_init();	190	timeout_init();
190	scheduler_init();	191	scheduler_init();
191	task_init();	192	task_init();
192	thread_init();	193	thread_init();
193	futex_init();	194	futex_init();
194		195
195	for (i = 0; i < init.cnt; i++)	196	for (i = 0; i < init.cnt; i++)
196	printf("init[%d].addr=%P, init[%d].size=%d\n", i, init.tasks[i].addr, i, init.tasks[i].size);	197	printf("init[%d].addr=%P, init[%d].size=%d\n", i, init.tasks[i].addr, i, init.tasks[i].size);
197		198
198	ipc_init();	199	ipc_init();
199		200
200	/*	201	/*
201	* Create kernel task.	202	* Create kernel task.
202	*/	203	*/
203	k = task_create(AS_KERNEL, "KERNEL");	204	k = task_create(AS_KERNEL, "KERNEL");
204	if (!k)	205	if (!k)
205	panic("can't create kernel task\n");	206	panic("can't create kernel task\n");
206		207
207	/*	208	/*
208	* Create the first thread.	209	* Create the first thread.
209	*/	210	*/
210	t = thread_create(kinit, NULL, k, 0, "kinit");	211	t = thread_create(kinit, NULL, k, 0, "kinit");
211	if (!t)	212	if (!t)
212	panic("can't create kinit thread\n");	213	panic("can't create kinit thread\n");
213	thread_ready(t);	214	thread_ready(t);
214		215
215	/*	216	/*
216	* This call to scheduler() will return to kinit,	217	* This call to scheduler() will return to kinit,
217	* starting the thread of kernel threads.	218	* starting the thread of kernel threads.
218	*/	219	*/
219	scheduler();	220	scheduler();
220	/* not reached */	221	/* not reached */
221	}	222	}
222		223
223		224
224	#ifdef CONFIG_SMP	225	#ifdef CONFIG_SMP
225	/** Application CPUs main kernel routine	226	/** Application CPUs main kernel routine
226	*	227	*
227	* Executed by application processors, temporary stack	228	* Executed by application processors, temporary stack
228	* is at ctx.sp which was set during BP boot.	229	* is at ctx.sp which was set during BP boot.
229	* This function passes control directly to	230	* This function passes control directly to
230	* main_ap_separated_stack().	231	* main_ap_separated_stack().
231	*	232	*
232	* Assuming interrupts_disable()'d.	233	* Assuming interrupts_disable()'d.
233	*	234	*
234	*/	235	*/
235	void main_ap(void)	236	void main_ap(void)
236	{	237	{
237	/*	238	/*
238	* Incrementing the active CPU counter will guarantee that the	239	* Incrementing the active CPU counter will guarantee that the
239	* pm_init() will not attempt to build GDT and IDT tables again.	240	* pm_init() will not attempt to build GDT and IDT tables again.
240	* Neither frame_init() will do the complete thing. Neither cpu_init()	241	* Neither frame_init() will do the complete thing. Neither cpu_init()
241	* will do.	242	* will do.
242	*/	243	*/
243	config.cpu_active++;	244	config.cpu_active++;
244		245
245	/*	246	/*
246	* The THE structure is well defined because ctx.sp is used as stack.	247	* The THE structure is well defined because ctx.sp is used as stack.
247	*/	248	*/
248	the_initialize(THE);	249	the_initialize(THE);
249		250
250	arch_pre_mm_init();	251	arch_pre_mm_init();
251	frame_init();	252	frame_init();
252	page_init();	253	page_init();
253	tlb_init();	254	tlb_init();
254	arch_post_mm_init();	255	arch_post_mm_init();
255		256
256	cpu_init();	257	cpu_init();
257		258
258	calibrate_delay_loop();	259	calibrate_delay_loop();
259		260
260	l_apic_init();	261	l_apic_init();
261	l_apic_debug();	262	l_apic_debug();
262		263
263	the_copy(THE, (the_t *) CPU->stack);	264	the_copy(THE, (the_t *) CPU->stack);
264		265
265	/*	266	/*
266	* If we woke kmp up before we left the kernel stack, we could	267	* If we woke kmp up before we left the kernel stack, we could
267	* collide with another CPU coming up. To prevent this, we	268	* collide with another CPU coming up. To prevent this, we
268	* switch to this cpu's private stack prior to waking kmp up.	269	* switch to this cpu's private stack prior to waking kmp up.
269	*/	270	*/
270	context_set(&CPU->saved_context, FADDR(main_ap_separated_stack), (__address) CPU->stack, CPU_STACK_SIZE);	271	context_set(&CPU->saved_context, FADDR(main_ap_separated_stack), (__address) CPU->stack, CPU_STACK_SIZE);
271	context_restore(&CPU->saved_context);	272	context_restore(&CPU->saved_context);
272	/* not reached */	273	/* not reached */
273	}	274	}
274		275
275		276
276	/** Application CPUs main kernel routine stack wrapper	277	/** Application CPUs main kernel routine stack wrapper
277	*	278	*
278	* Second part of main_ap().	279	* Second part of main_ap().
279	*	280	*
280	*/	281	*/
281	void main_ap_separated_stack(void)	282	void main_ap_separated_stack(void)
282	{	283	{
283	/*	284	/*
284	* Configure timeouts for this cpu.	285	* Configure timeouts for this cpu.
285	*/	286	*/
286	timeout_init();	287	timeout_init();
287		288
288	waitq_wakeup(&ap_completion_wq, WAKEUP_FIRST);	289	waitq_wakeup(&ap_completion_wq, WAKEUP_FIRST);
289	scheduler();	290	scheduler();
290	/* not reached */	291	/* not reached */
291	}	292	}
292	#endif /* CONFIG_SMP */	293	#endif /* CONFIG_SMP */
293		294

Subversion Repositories HelenOS-historic

(root)/kernel/trunk/generic/src/main/main.c @ 1780 – Rev 1109 → 1138