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>
#include <adt/btree.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)
 
/** Main kernel routine for bootstrap CPU.
 *
 * 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 */
}
 
 
/** Main kernel routine for bootstrap CPU using new stack.
 *
 * 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();
    btree_init();
    as_init();
    page_init();
    tlb_init();
    arch_post_mm_init();   
 
    version_print();
    printf("%.*p: hardcoded_ktext_size=%zdK, hardcoded_kdata_size=%zdK\n", sizeof(__address) * 2, 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=%zdM\n", config.memory_size/(1024*1024));
    printf("config.cpu_count=%zd\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[%zd].addr=%.*p, init[%zd].size=%zd\n", i, sizeof(__address)*2, 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
/** Main kernel routine for application CPUs.
 *
 * 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 */
}
 
 
/** Main kernel routine for application CPUs using new stack.
 *
 * Second part of main_ap().
 *
 */
void main_ap_separated_stack(void)
{
    /*
     * Configure timeouts for this cpu.
     */
    timeout_init();
 
    waitq_wakeup(&ap_completion_wq, WAKEUP_FIRST);
    scheduler();
    /* not reached */
}
#endif /* CONFIG_SMP */
 

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

Subversion Repositories HelenOS-historic

(root)/kernel/trunk/generic/src/main/main.c – Rev 1224 → 1229