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 <mm/vm.h>
#include <main/kinit.h>
#include <cpu.h>
#include <mm/heap.h>
 
#ifdef __SMP__
#include <arch/smp/apic.h>
#include <arch/smp/mps.h>
#endif /* __SMP__ */
 
#include <smp/smp.h>
 
#include <arch/mm/memory_init.h>
#include <mm/frame.h>
#include <mm/page.h>
#include <mm/tlb.h>
#include <synch/waitq.h>
 
#include <arch/arch.h>
#include <arch.h>
#include <arch/faddr.h>
 
#include <typedefs.h>
 
char *project = "SPARTAN kernel";
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;
 
/*
 * 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 on heap to make the stack start on page boundary.
 */
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 cpu_priority_high().
 *
 */
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 = hardcoded_ktext_size + hardcoded_kdata_size + heap_size;
    heap_delta = PAGE_SIZE - ((hardcoded_load_address + kernel_size) % PAGE_SIZE);
    heap_delta = (heap_delta == PAGE_SIZE) ? 0 : heap_delta;
    kernel_size += heap_delta;
   
 
 
    config.kernel_size = kernel_size + CONFIG_STACK_SIZE;
   
    context_save(&ctx);
    early_mapping(config.base + hardcoded_ktext_size + hardcoded_kdata_size + heap_delta, CONFIG_STACK_SIZE + heap_size);
    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();
    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\n%s\n", project, copyright);
    printf("%P: hardcoded_ktext_size=%dK, hardcoded_kdata_size=%dK\n",
        config.base, hardcoded_ktext_size/1024, hardcoded_kdata_size/1024);
 
    arch_late_init();
   
    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 __SMP__
/** Application CPUs main kernel routine
 *
 * Executed by application processors, temporary stack
 * is at ctx.sp which was set during BP boot.
 *
 * Assuming  cpu_priority_high().
 *
 */
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();
    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), 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 /* __SMP__*/
 

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

Subversion Repositories HelenOS-historic

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