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

Subversion Repositories HelenOS

(root)/branches/sparc/kernel/generic/src/main/main.c @ 3798 – Rev 955 → 1037