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 <arch/context.h>
#include <print.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 <mm/frame.h>
#include <mm/page.h>
#include <mm/tlb.h>
#include <synch/waitq.h>
 
#include <arch.h>
 
char *project = "SPARTAN kernel";
char *copyright = "Copyright (C) 2001-2005 Jakub Jermar";
 
config_t config;
context_t ctx;
 
/*
 * These 'hardcoded' variables will be intialised by
 * the linker with appropriate sizes and addresses.
 */
__u32 hardcoded_load_address = 0;
__u32 hardcoded_ktext_size = 0;
__u32 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);
static void main_ap_separated_stack(void);
 
/*
 * Executed by the bootstrap processor. cpu_priority_high()'d
 */
void main_bsp(void)
{
    config.cpu_count = 1;
    config.cpu_active = 1;
 
    config.base = hardcoded_load_address;
    config.memory_size = CONFIG_MEMORY_SIZE;
    config.kernel_size = hardcoded_ktext_size + hardcoded_kdata_size + CONFIG_HEAP_SIZE + CONFIG_STACK_SIZE;
 
    context_save(&ctx);
    ctx.sp = config.base + config.kernel_size - 8;
    ctx.pc = (__address) main_bsp_separated_stack;
    context_restore(&ctx);
    /* not reached */
}
 
void main_bsp_separated_stack(void) {
    vm_t *m;
    task_t *k;
    thread_t *t;
 
    arch_pre_mm_init();
 
    heap_init(config.base + hardcoded_ktext_size + hardcoded_kdata_size, CONFIG_HEAP_SIZE);
    frame_init();
    page_init();
    tlb_init();
 
    arch_post_mm_init();
 
    printf("%s, %s\n", project, copyright);
 
    printf("%L: 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.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();
    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__
/*
 * Executed by application processors. cpu_priority_high()'d
 * Temporary stack is at ctx.sp which was set during BP boot.
 */
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++;
 
    arch_pre_mm_init();
    frame_init();
    page_init();
    arch_post_mm_init();
 
    cpu_init();
    calibrate_delay_loop();
 
    l_apic_init();
    l_apic_debug();
 
 
    /*
     * 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.
     */
    CPU->saved_context.sp = (__address) &CPU->stack[CPU_STACK_SIZE-8];
    CPU->saved_context.pc = (__address) main_ap_separated_stack;
    context_restore(&CPU->saved_context);
    /* not reached */
}
 
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 32	Rev 34
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 <arch/context.h>	30	#include <arch/context.h>
31	#include <print.h>	31	#include <print.h>
32	#include <config.h>	32	#include <config.h>
33	#include <time/clock.h>	33	#include <time/clock.h>
34	#include <proc/scheduler.h>	34	#include <proc/scheduler.h>
35	#include <proc/thread.h>	35	#include <proc/thread.h>
36	#include <proc/task.h>	36	#include <proc/task.h>
37	#include <mm/vm.h>	37	#include <mm/vm.h>
38	#include <main/kinit.h>	38	#include <main/kinit.h>
39	#include <cpu.h>	39	#include <cpu.h>
40	#include <mm/heap.h>	40	#include <mm/heap.h>
41		41
42	#ifdef __SMP__	42	#ifdef __SMP__
43	#include <arch/smp/apic.h>	43	#include <arch/smp/apic.h>
44	#include <arch/smp/mp.h>	44	#include <arch/smp/mps.h>
45	#endif /* __SMP__ */	45	#endif /* __SMP__ */
46		46
-		47	#include <smp/smp.h>
-		48
47	#include <mm/frame.h>	49	#include <mm/frame.h>
48	#include <mm/page.h>	50	#include <mm/page.h>
49	#include <mm/tlb.h>	51	#include <mm/tlb.h>
50	#include <synch/waitq.h>	52	#include <synch/waitq.h>
51		53
52	#include <arch.h>	54	#include <arch.h>
53		55
54	char *project = "SPARTAN kernel";	56	char *project = "SPARTAN kernel";
55	char *copyright = "Copyright (C) 2001-2005 Jakub Jermar";	57	char *copyright = "Copyright (C) 2001-2005 Jakub Jermar";
56		58
57	config_t config;	59	config_t config;
58	context_t ctx;	60	context_t ctx;
59		61
60	/*	62	/*
61	* These 'hardcoded' variables will be intialised by	63	* These 'hardcoded' variables will be intialised by
62	* the linker with appropriate sizes and addresses.	64	* the linker with appropriate sizes and addresses.
63	*/	65	*/
64	__u32 hardcoded_load_address = 0;	66	__u32 hardcoded_load_address = 0;
65	__u32 hardcoded_ktext_size = 0;	67	__u32 hardcoded_ktext_size = 0;
66	__u32 hardcoded_kdata_size = 0;	68	__u32 hardcoded_kdata_size = 0;
67		69
68	void main_bsp(void);	70	void main_bsp(void);
69	void main_ap(void);	71	void main_ap(void);
70		72
71	/*	73	/*
72	* These two functions prevent stack from underflowing during the	74	* These two functions prevent stack from underflowing during the
73	* kernel boot phase when SP is set to the very top of the reserved	75	* kernel boot phase when SP is set to the very top of the reserved
74	* space. The stack could get corrupted by a fooled compiler-generated	76	* space. The stack could get corrupted by a fooled compiler-generated
75	* pop sequence otherwise.	77	* pop sequence otherwise.
76	*/	78	*/
77	static void main_bsp_separated_stack(void);	79	static void main_bsp_separated_stack(void);
78	static void main_ap_separated_stack(void);	80	static void main_ap_separated_stack(void);
79		81
80	/*	82	/*
81	* Executed by the bootstrap processor. cpu_priority_high()'d	83	* Executed by the bootstrap processor. cpu_priority_high()'d
82	*/	84	*/
83	void main_bsp(void)	85	void main_bsp(void)
84	{	86	{
85	config.cpu_count = 1;	87	config.cpu_count = 1;
86	config.cpu_active = 1;	88	config.cpu_active = 1;
87		89
88	config.base = hardcoded_load_address;	90	config.base = hardcoded_load_address;
89	config.memory_size = CONFIG_MEMORY_SIZE;	91	config.memory_size = CONFIG_MEMORY_SIZE;
90	config.kernel_size = hardcoded_ktext_size + hardcoded_kdata_size + CONFIG_HEAP_SIZE + CONFIG_STACK_SIZE;	92	config.kernel_size = hardcoded_ktext_size + hardcoded_kdata_size + CONFIG_HEAP_SIZE + CONFIG_STACK_SIZE;
91		93
92	context_save(&ctx);	94	context_save(&ctx);
93	ctx.sp = config.base + config.kernel_size - 8;	95	ctx.sp = config.base + config.kernel_size - 8;
94	ctx.pc = (__address) main_bsp_separated_stack;	96	ctx.pc = (__address) main_bsp_separated_stack;
95	context_restore(&ctx);	97	context_restore(&ctx);
96	/* not reached */	98	/* not reached */
97	}	99	}
98		100
99	void main_bsp_separated_stack(void) {	101	void main_bsp_separated_stack(void) {
100	vm_t *m;	102	vm_t *m;
101	task_t *k;	103	task_t *k;
102	thread_t *t;	104	thread_t *t;
103		105
104	arch_pre_mm_init();	106	arch_pre_mm_init();
105		107
106	heap_init(config.base + hardcoded_ktext_size + hardcoded_kdata_size, CONFIG_HEAP_SIZE);	108	heap_init(config.base + hardcoded_ktext_size + hardcoded_kdata_size, CONFIG_HEAP_SIZE);
107	frame_init();	109	frame_init();
108	page_init();	110	page_init();
109	tlb_init();	111	tlb_init();
110		112
111	arch_post_mm_init();	113	arch_post_mm_init();
112		114
113	printf("%s, %s\n", project, copyright);	115	printf("%s, %s\n", project, copyright);
114		116
115	printf("%L: hardcoded_ktext_size=%dK, hardcoded_kdata_size=%dK\n",	117	printf("%L: hardcoded_ktext_size=%dK, hardcoded_kdata_size=%dK\n",
116	config.base, hardcoded_ktext_size/1024, hardcoded_kdata_size/1024);	118	config.base, hardcoded_ktext_size/1024, hardcoded_kdata_size/1024);
117		119
118	arch_late_init();	120	arch_late_init();
119		121
-		122	smp_init();
120	printf("config.cpu_count=%d\n", config.cpu_count);	123	printf("config.cpu_count=%d\n", config.cpu_count);
121		124
122	cpu_init();	125	cpu_init();
123	calibrate_delay_loop();	126	calibrate_delay_loop();
124		127
125	timeout_init();	128	timeout_init();
126	scheduler_init();	129	scheduler_init();
127	task_init();	130	task_init();
128	thread_init();	131	thread_init();
129		132
130	/*	133	/*
131	* Create kernel vm mapping.	134	* Create kernel vm mapping.
132	*/	135	*/
133	m = vm_create();	136	m = vm_create();
134	if (!m) panic("can't create kernel vm address space\n");	137	if (!m) panic("can't create kernel vm address space\n");
135		138
136	/*	139	/*
137	* Create kernel task.	140	* Create kernel task.
138	*/	141	*/
139	k = task_create(m);	142	k = task_create(m);
140	if (!k) panic("can't create kernel task\n");	143	if (!k) panic("can't create kernel task\n");
141		144
142	/*	145	/*
143	* Create the first thread.	146	* Create the first thread.
144	*/	147	*/
145	t = thread_create(kinit, NULL, k, 0);	148	t = thread_create(kinit, NULL, k, 0);
146	if (!t) panic("can't create kinit thread\n");	149	if (!t) panic("can't create kinit thread\n");
147		150
148	thread_ready(t);	151	thread_ready(t);
149		152
150	/*	153	/*
151	* This call to scheduler() will return to kinit,	154	* This call to scheduler() will return to kinit,
152	* starting the thread of kernel threads.	155	* starting the thread of kernel threads.
153	*/	156	*/
154	scheduler();	157	scheduler();
155	/* not reached */	158	/* not reached */
156	}	159	}
157		160
158	#ifdef __SMP__	161	#ifdef __SMP__
159	/*	162	/*
160	* Executed by application processors. cpu_priority_high()'d	163	* Executed by application processors. cpu_priority_high()'d
161	* Temporary stack is at ctx.sp which was set during BP boot.	164	* Temporary stack is at ctx.sp which was set during BP boot.
162	*/	165	*/
163	void main_ap(void)	166	void main_ap(void)
164	{	167	{
165	/*	168	/*
166	* Incrementing the active CPU counter will guarantee that the	169	* Incrementing the active CPU counter will guarantee that the
167	* pm_init() will not attempt to build GDT and IDT tables again.	170	* pm_init() will not attempt to build GDT and IDT tables again.
168	* Neither frame_init() will do the complete thing. Neither cpu_init()	171	* Neither frame_init() will do the complete thing. Neither cpu_init()
169	* will do.	172	* will do.
170	*/	173	*/
171	config.cpu_active++;	174	config.cpu_active++;
172		175
173	arch_pre_mm_init();	176	arch_pre_mm_init();
174	frame_init();	177	frame_init();
175	page_init();	178	page_init();
176	arch_post_mm_init();	179	arch_post_mm_init();
177		180
178	cpu_init();	181	cpu_init();
179	calibrate_delay_loop();	182	calibrate_delay_loop();
180		183
181	l_apic_init();	184	l_apic_init();
182	l_apic_debug();	185	l_apic_debug();
183		186
184		187
185	/*	188	/*
186	* If we woke kmp up before we left the kernel stack, we could	189	* If we woke kmp up before we left the kernel stack, we could
187	* collide with another CPU coming up. To prevent this, we	190	* collide with another CPU coming up. To prevent this, we
188	* switch to this cpu's private stack prior to waking kmp up.	191	* switch to this cpu's private stack prior to waking kmp up.
189	*/	192	*/
190	CPU->saved_context.sp = (__address) &CPU->stack[CPU_STACK_SIZE-8];	193	CPU->saved_context.sp = (__address) &CPU->stack[CPU_STACK_SIZE-8];
191	CPU->saved_context.pc = (__address) main_ap_separated_stack;	194	CPU->saved_context.pc = (__address) main_ap_separated_stack;
192	context_restore(&CPU->saved_context);	195	context_restore(&CPU->saved_context);
193	/* not reached */	196	/* not reached */
194	}	197	}
195		198
196	void main_ap_separated_stack(void)	199	void main_ap_separated_stack(void)
197	{	200	{
198	/*	201	/*
199	* Configure timeouts for this cpu.	202	* Configure timeouts for this cpu.
200	*/	203	*/
201	timeout_init();	204	timeout_init();
202		205
203	waitq_wakeup(&ap_completion_wq, WAKEUP_FIRST);	206	waitq_wakeup(&ap_completion_wq, WAKEUP_FIRST);
204	scheduler();	207	scheduler();
205	/* not reached */	208	/* not reached */
206	}	209	}
207	#endif /* __SMP__*/	210	#endif /* __SMP__*/
208		211

Subversion Repositories HelenOS-historic

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