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 <config.h>
#include <time/clock.h>
#include <proc/scheduler.h>
#include <proc/thread.h>
#include <proc/task.h>
#include <main/kinit.h>
#include <cpu.h>
#include <align.h>
 
#ifdef CONFIG_SMP
#include <arch/smp/apic.h>
#include <arch/smp/mps.h>
#endif /* CONFIG_SMP */
 
#include <smp/smp.h>
 
#include <arch/mm/memory_init.h>
#include <mm/heap.h>
#include <mm/frame.h>
#include <mm/page.h>
#include <mm/tlb.h>
#include <mm/vm.h>
 
#include <synch/waitq.h>
 
#include <arch/arch.h>
#include <arch.h>
#include <arch/faddr.h>
 
#include <typedefs.h>
 
char *project = "SPARTAN kernel";
char *release = RELEASE " (" NAME ")";
#ifdef TAG
    char *rr_delimiter = "\n";
    char *revision = TAG;
#else
    char *rr_delimiter = "";
    char *revision = "";
#endif
char *copyright = "Copyright (C) 2001-2005 Jakub Jermar\nCopyright (C) 2005 HelenOS project";
 
config_t config;
context_t ctx;
 
/*
 * These 'hardcoded' variables will be intialised 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;
 
__address init_addr = 0;
size_t init_size = 0;
 
/*
 * Size of memory in bytes taken by kernel and heap.
 */
static size_t kernel_size;
 
/*
 * Size of heap.
 */
static size_t heap_size;
 
 
/*
 * Extra space between heap and stack
 * enforced by alignment requirements.
 */
static size_t heap_delta;
 
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);
static void main_ap_separated_stack(void);
 
/** Bootstrap CPU main kernel routine
 *
 * Initializes the kernel by bootstrap CPU.
 *
 * Assuming interrupts_disable().
 *
 */
void main_bsp(void)
{
    config.cpu_count = 1;
    config.cpu_active = 1;
    config.base = hardcoded_load_address;
    config.memory_size = get_memory_size();
 
    heap_size = CONFIG_HEAP_SIZE + (config.memory_size/FRAME_SIZE)*sizeof(frame_t);
    kernel_size = ALIGN(hardcoded_ktext_size + hardcoded_kdata_size + heap_size, PAGE_SIZE);
    heap_delta = kernel_size - (hardcoded_ktext_size + hardcoded_kdata_size + heap_size);
   
    config.kernel_size = kernel_size + CONFIG_STACK_SIZE;
   
    context_save(&ctx);
    early_mapping(config.base + hardcoded_ktext_size + hardcoded_kdata_size, CONFIG_STACK_SIZE + heap_size + heap_delta);
    context_set(&ctx, FADDR(main_bsp_separated_stack), config.base + kernel_size, 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)
{
    vm_t *m;
    task_t *k;
    thread_t *t;
   
    the_initialize(THE);
   
    arch_pre_mm_init();
    early_heap_init(config.base + hardcoded_ktext_size + hardcoded_kdata_size, heap_size + heap_delta);
    frame_init();
    page_init();
    tlb_init();
    arch_post_mm_init();
 
    printf("%s, release %s%s%s\n%s\n", project, release, rr_delimiter, revision, copyright);
    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();
    arch_post_smp_init();
    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();
 
    /*
     * Create kernel vm mapping.
     */
    m = vm_create(GET_PTL0_ADDRESS());
    if (!m)
        panic("can't create kernel vm address space\n");
 
    /*
     * Create kernel task.
     */
    k = task_create(m);
    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.
 *
 * 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 503	Rev 506
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 <config.h>	33	#include <config.h>
34	#include <time/clock.h>	34	#include <time/clock.h>
35	#include <proc/scheduler.h>	35	#include <proc/scheduler.h>
36	#include <proc/thread.h>	36	#include <proc/thread.h>
37	#include <proc/task.h>	37	#include <proc/task.h>
38	#include <main/kinit.h>	38	#include <main/kinit.h>
39	#include <cpu.h>	39	#include <cpu.h>
40	#include <align.h>	40	#include <align.h>
41		41
42	#ifdef CONFIG_SMP	42	#ifdef CONFIG_SMP
43	#include <arch/smp/apic.h>	43	#include <arch/smp/apic.h>
44	#include <arch/smp/mps.h>	44	#include <arch/smp/mps.h>
45	#endif /* CONFIG_SMP */	45	#endif /* CONFIG_SMP */
46		46
47	#include <smp/smp.h>	47	#include <smp/smp.h>
48		48
49	#include <arch/mm/memory_init.h>	49	#include <arch/mm/memory_init.h>
50	#include <mm/heap.h>	50	#include <mm/heap.h>
51	#include <mm/frame.h>	51	#include <mm/frame.h>
52	#include <mm/page.h>	52	#include <mm/page.h>
53	#include <mm/tlb.h>	53	#include <mm/tlb.h>
54	#include <mm/vm.h>	54	#include <mm/vm.h>
55		55
56	#include <synch/waitq.h>	56	#include <synch/waitq.h>
57		57
58	#include <arch/arch.h>	58	#include <arch/arch.h>
59	#include <arch.h>	59	#include <arch.h>
60	#include <arch/faddr.h>	60	#include <arch/faddr.h>
61		61
62	#include <typedefs.h>	62	#include <typedefs.h>
63		63
64	char *project = "SPARTAN kernel";	64	char *project = "SPARTAN kernel";
65	char *release = RELEASE " (" NAME ")";	65	char *release = RELEASE " (" NAME ")";
66	#ifdef TAG	66	#ifdef TAG
67	char *rr_delimiter = "\n";	67	char *rr_delimiter = "\n";
68	char *revision = TAG;	68	char *revision = TAG;
69	#else	69	#else
70	char *rr_delimiter = "";	70	char *rr_delimiter = "";
71	char *revision = "";	71	char *revision = "";
72	#endif	72	#endif
73	char *copyright = "Copyright (C) 2001-2005 Jakub Jermar\nCopyright (C) 2005 HelenOS project";	73	char *copyright = "Copyright (C) 2001-2005 Jakub Jermar\nCopyright (C) 2005 HelenOS project";
74		74
75	config_t config;	75	config_t config;
76	context_t ctx;	76	context_t ctx;
77		77
78	/*	78	/*
79	* These 'hardcoded' variables will be intialised by	79	* These 'hardcoded' variables will be intialised by
80	* the linker or the low level assembler code with	80	* the linker or the low level assembler code with
81	* appropriate sizes and addresses.	81	* appropriate sizes and addresses.
82	*/	82	*/
83	__address hardcoded_load_address = 0;	83	__address hardcoded_load_address = 0;
84	size_t hardcoded_ktext_size = 0;	84	size_t hardcoded_ktext_size = 0;
85	size_t hardcoded_kdata_size = 0;	85	size_t hardcoded_kdata_size = 0;
86		86
-		87	__address init_addr = 0;
-		88	size_t init_size = 0;
-		89
87	/*	90	/*
88	* Size of memory in bytes taken by kernel and heap.	91	* Size of memory in bytes taken by kernel and heap.
89	*/	92	*/
90	static size_t kernel_size;	93	static size_t kernel_size;
91		94
92	/*	95	/*
93	* Size of heap.	96	* Size of heap.
94	*/	97	*/
95	static size_t heap_size;	98	static size_t heap_size;
96		99
97		100
98	/*	101	/*
99	* Extra space between heap and stack	102	* Extra space between heap and stack
100	* enforced by alignment requirements.	103	* enforced by alignment requirements.
101	*/	104	*/
102	static size_t heap_delta;	105	static size_t heap_delta;
103		106
104	void main_bsp(void);	107	void main_bsp(void);
105	void main_ap(void);	108	void main_ap(void);
106		109
107	/*	110	/*
108	* These two functions prevent stack from underflowing during the	111	* These two functions prevent stack from underflowing during the
109	* kernel boot phase when SP is set to the very top of the reserved	112	* kernel boot phase when SP is set to the very top of the reserved
110	* space. The stack could get corrupted by a fooled compiler-generated	113	* space. The stack could get corrupted by a fooled compiler-generated
111	* pop sequence otherwise.	114	* pop sequence otherwise.
112	*/	115	*/
113	static void main_bsp_separated_stack(void);	116	static void main_bsp_separated_stack(void);
114	static void main_ap_separated_stack(void);	117	static void main_ap_separated_stack(void);
115		118
116	/** Bootstrap CPU main kernel routine	119	/** Bootstrap CPU main kernel routine
117	*	120	*
118	* Initializes the kernel by bootstrap CPU.	121	* Initializes the kernel by bootstrap CPU.
119	*	122	*
120	* Assuming interrupts_disable().	123	* Assuming interrupts_disable().
121	*	124	*
122	*/	125	*/
123	void main_bsp(void)	126	void main_bsp(void)
124	{	127	{
125	config.cpu_count = 1;	128	config.cpu_count = 1;
126	config.cpu_active = 1;	129	config.cpu_active = 1;
127	config.base = hardcoded_load_address;	130	config.base = hardcoded_load_address;
128	config.memory_size = get_memory_size();	131	config.memory_size = get_memory_size();
129		132
130	heap_size = CONFIG_HEAP_SIZE + (config.memory_size/FRAME_SIZE)*sizeof(frame_t);	133	heap_size = CONFIG_HEAP_SIZE + (config.memory_size/FRAME_SIZE)*sizeof(frame_t);
131	kernel_size = ALIGN(hardcoded_ktext_size + hardcoded_kdata_size + heap_size, PAGE_SIZE);	134	kernel_size = ALIGN(hardcoded_ktext_size + hardcoded_kdata_size + heap_size, PAGE_SIZE);
132	heap_delta = kernel_size - (hardcoded_ktext_size + hardcoded_kdata_size + heap_size);	135	heap_delta = kernel_size - (hardcoded_ktext_size + hardcoded_kdata_size + heap_size);
133		136
134	config.kernel_size = kernel_size + CONFIG_STACK_SIZE;	137	config.kernel_size = kernel_size + CONFIG_STACK_SIZE;
135		138
136	context_save(&ctx);	139	context_save(&ctx);
137	early_mapping(config.base + hardcoded_ktext_size + hardcoded_kdata_size, CONFIG_STACK_SIZE + heap_size + heap_delta);	140	early_mapping(config.base + hardcoded_ktext_size + hardcoded_kdata_size, CONFIG_STACK_SIZE + heap_size + heap_delta);
138	context_set(&ctx, FADDR(main_bsp_separated_stack), config.base + kernel_size, CONFIG_STACK_SIZE);	141	context_set(&ctx, FADDR(main_bsp_separated_stack), config.base + kernel_size, CONFIG_STACK_SIZE);
139	context_restore(&ctx);	142	context_restore(&ctx);
140	/* not reached */	143	/* not reached */
141	}	144	}
142		145
143		146
144	/** Bootstrap CPU main kernel routine stack wrapper	147	/** Bootstrap CPU main kernel routine stack wrapper
145	*	148	*
146	* Second part of main_bsp().	149	* Second part of main_bsp().
147	*	150	*
148	*/	151	*/
149	void main_bsp_separated_stack(void)	152	void main_bsp_separated_stack(void)
150	{	153	{
151	vm_t *m;	154	vm_t *m;
152	task_t *k;	155	task_t *k;
153	thread_t *t;	156	thread_t *t;
154		157
155	the_initialize(THE);	158	the_initialize(THE);
156		159
157	arch_pre_mm_init();	160	arch_pre_mm_init();
158	early_heap_init(config.base + hardcoded_ktext_size + hardcoded_kdata_size, heap_size + heap_delta);	161	early_heap_init(config.base + hardcoded_ktext_size + hardcoded_kdata_size, heap_size + heap_delta);
159	frame_init();	162	frame_init();
160	page_init();	163	page_init();
161	tlb_init();	164	tlb_init();
162	arch_post_mm_init();	165	arch_post_mm_init();
163		166
164	printf("%s, release %s%s%s\n%s\n", project, release, rr_delimiter, revision, copyright);	167	printf("%s, release %s%s%s\n%s\n", project, release, rr_delimiter, revision, copyright);
165	printf("%P: hardcoded_ktext_size=%dK, hardcoded_kdata_size=%dK\n",	168	printf("%P: hardcoded_ktext_size=%dK, hardcoded_kdata_size=%dK\n",
166	config.base, hardcoded_ktext_size/1024, hardcoded_kdata_size/1024);	169	config.base, hardcoded_ktext_size/1024, hardcoded_kdata_size/1024);
167		170
168	arch_pre_smp_init();	171	arch_pre_smp_init();
169	smp_init();	172	smp_init();
170	arch_post_smp_init();	173	arch_post_smp_init();
171	printf("config.memory_size=%dM\n", config.memory_size/(1024*1024));	174	printf("config.memory_size=%dM\n", config.memory_size/(1024*1024));
172	printf("config.cpu_count=%d\n", config.cpu_count);	175	printf("config.cpu_count=%d\n", config.cpu_count);
173		176
174	cpu_init();	177	cpu_init();
175		178
176	calibrate_delay_loop();	179	calibrate_delay_loop();
177		180
178	timeout_init();	181	timeout_init();
179	scheduler_init();	182	scheduler_init();
180	task_init();	183	task_init();
181	thread_init();	184	thread_init();
182		185
183	/*	186	/*
184	* Create kernel vm mapping.	187	* Create kernel vm mapping.
185	*/	188	*/
186	m = vm_create(GET_PTL0_ADDRESS());	189	m = vm_create(GET_PTL0_ADDRESS());
187	if (!m)	190	if (!m)
188	panic("can't create kernel vm address space\n");	191	panic("can't create kernel vm address space\n");
189		192
190	/*	193	/*
191	* Create kernel task.	194	* Create kernel task.
192	*/	195	*/
193	k = task_create(m);	196	k = task_create(m);
194	if (!k)	197	if (!k)
195	panic("can't create kernel task\n");	198	panic("can't create kernel task\n");
196		199
197	/*	200	/*
198	* Create the first thread.	201	* Create the first thread.
199	*/	202	*/
200	t = thread_create(kinit, NULL, k, 0);	203	t = thread_create(kinit, NULL, k, 0);
201	if (!t)	204	if (!t)
202	panic("can't create kinit thread\n");	205	panic("can't create kinit thread\n");
203	thread_ready(t);	206	thread_ready(t);
204	/*	207	/*
205	* This call to scheduler() will return to kinit,	208	* This call to scheduler() will return to kinit,
206	* starting the thread of kernel threads.	209	* starting the thread of kernel threads.
207	*/	210	*/
208	scheduler();	211	scheduler();
209	/* not reached */	212	/* not reached */
210	}	213	}
211		214
212		215
213	#ifdef CONFIG_SMP	216	#ifdef CONFIG_SMP
214	/** Application CPUs main kernel routine	217	/** Application CPUs main kernel routine
215	*	218	*
216	* Executed by application processors, temporary stack	219	* Executed by application processors, temporary stack
217	* is at ctx.sp which was set during BP boot.	220	* is at ctx.sp which was set during BP boot.
218	*	221	*
219	* Assuming interrupts_disable()'d.	222	* Assuming interrupts_disable()'d.
220	*	223	*
221	*/	224	*/
222	void main_ap(void)	225	void main_ap(void)
223	{	226	{
224	/*	227	/*
225	* Incrementing the active CPU counter will guarantee that the	228	* Incrementing the active CPU counter will guarantee that the
226	* pm_init() will not attempt to build GDT and IDT tables again.	229	* pm_init() will not attempt to build GDT and IDT tables again.
227	* Neither frame_init() will do the complete thing. Neither cpu_init()	230	* Neither frame_init() will do the complete thing. Neither cpu_init()
228	* will do.	231	* will do.
229	*/	232	*/
230	config.cpu_active++;	233	config.cpu_active++;
231		234
232	/*	235	/*
233	* The THE structure is well defined because ctx.sp is used as stack.	236	* The THE structure is well defined because ctx.sp is used as stack.
234	*/	237	*/
235	the_initialize(THE);	238	the_initialize(THE);
236		239
237	arch_pre_mm_init();	240	arch_pre_mm_init();
238	frame_init();	241	frame_init();
239	page_init();	242	page_init();
240	tlb_init();	243	tlb_init();
241	arch_post_mm_init();	244	arch_post_mm_init();
242		245
243	cpu_init();	246	cpu_init();
244		247
245	calibrate_delay_loop();	248	calibrate_delay_loop();
246		249
247	l_apic_init();	250	l_apic_init();
248	l_apic_debug();	251	l_apic_debug();
249		252
250	the_copy(THE, (the_t *) CPU->stack);	253	the_copy(THE, (the_t *) CPU->stack);
251		254
252	/*	255	/*
253	* If we woke kmp up before we left the kernel stack, we could	256	* If we woke kmp up before we left the kernel stack, we could
254	* collide with another CPU coming up. To prevent this, we	257	* collide with another CPU coming up. To prevent this, we
255	* switch to this cpu's private stack prior to waking kmp up.	258	* switch to this cpu's private stack prior to waking kmp up.
256	*/	259	*/
257	context_set(&CPU->saved_context, FADDR(main_ap_separated_stack), (__address) CPU->stack, CPU_STACK_SIZE);	260	context_set(&CPU->saved_context, FADDR(main_ap_separated_stack), (__address) CPU->stack, CPU_STACK_SIZE);
258	context_restore(&CPU->saved_context);	261	context_restore(&CPU->saved_context);
259	/* not reached */	262	/* not reached */
260	}	263	}
261		264
262		265
263	/** Application CPUs main kernel routine stack wrapper	266	/** Application CPUs main kernel routine stack wrapper
264	*	267	*
265	* Second part of main_ap().	268	* Second part of main_ap().
266	*	269	*
267	*/	270	*/
268	void main_ap_separated_stack(void)	271	void main_ap_separated_stack(void)
269	{	272	{
270	/*	273	/*
271	* Configure timeouts for this cpu.	274	* Configure timeouts for this cpu.
272	*/	275	*/
273	timeout_init();	276	timeout_init();
274		277
275	waitq_wakeup(&ap_completion_wq, WAKEUP_FIRST);	278	waitq_wakeup(&ap_completion_wq, WAKEUP_FIRST);
276	scheduler();	279	scheduler();
277	/* not reached */	280	/* not reached */
278	}	281	}
279	#endif /* CONFIG_SMP */	282	#endif /* CONFIG_SMP */
280		283

Subversion Repositories HelenOS-historic

(root)/kernel/trunk/generic/src/main/main.c @ 503 – Rev 503 → 506