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.
 */
 
/** @addtogroup main
 * @{
 */
 
/**
 * @file
 * @brief   Main initialization kernel function for all processors.
 *
 * During kernel boot, all processors, after architecture dependent
 * initialization, start executing code found in this file. After
 * bringing up all subsystems, control is passed to scheduler().
 *
 * The bootstrap processor starts executing main_bsp() while
 * the application processors start executing main_ap().
 *
 * @see scheduler()
 * @see main_bsp()
 * @see main_ap()
 */
 
#include <arch/asm.h>
#include <context.h>
#include <print.h>
#include <panic.h>
#include <debug.h>
#include <config.h>
#include <time/clock.h>
#include <time/timeout.h>
#include <proc/scheduler.h>
#include <proc/thread.h>
#include <proc/task.h>
#include <proc/tasklet.h>
#include <main/kinit.h>
#include <main/version.h>
#include <console/kconsole.h>
#include <cpu.h>
#include <align.h>
#include <interrupt.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 <ipc/ipc.h>
#include <macros.h>
#include <adt/btree.h>
 
#include <smp/smp.h>
#include <ddi/ddi.h>
 
/** Global configuration structure. */
config_t config;
 
/** Initial user-space tasks */
init_t init = {
    .cnt = 0
};
 
/** Boot allocations. */
ballocs_t ballocs = {
    .base = NULL,
    .size = 0
};
 
context_t ctx;
 
/*
 * These 'hardcoded' variables will be intialized by
 * the linker or the low level assembler code with
 * appropriate sizes and addresses.
 */
 
/**< Virtual address of where the kernel is loaded. */
uintptr_t hardcoded_load_address = 0;
/**< Size of the kernel code in bytes. */
size_t hardcoded_ktext_size = 0;
/**< Size of the kernel data in bytes. */
size_t hardcoded_kdata_size = 0;
/**< Lowest safe stack virtual address. */
uintptr_t stack_safe = 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)
{
    LOG();
   
    config.cpu_count = 1;
    config.cpu_active = 1;
   
    config.base = hardcoded_load_address;
    config.kernel_size = ALIGN_UP(hardcoded_ktext_size +
        hardcoded_kdata_size, PAGE_SIZE);
    config.stack_size = CONFIG_STACK_SIZE;
   
    /* Initialy the stack is placed just after the kernel */
    config.stack_base = config.base + config.kernel_size;
   
    /* Avoid placing stack on top of init */
    count_t i;
    for (i = 0; i < init.cnt; i++) {
        if (PA_overlaps(config.stack_base, config.stack_size,
            init.tasks[i].addr, init.tasks[i].size))
            config.stack_base = ALIGN_UP(init.tasks[i].addr +
                init.tasks[i].size, config.stack_size);
    }
 
    /* Avoid placing stack on top of boot allocations. */
    if (ballocs.size) {
        if (PA_overlaps(config.stack_base, config.stack_size,
            ballocs.base, ballocs.size))
            config.stack_base = ALIGN_UP(ballocs.base +
                ballocs.size, PAGE_SIZE);
    }
   
    if (config.stack_base < stack_safe)
        config.stack_base = ALIGN_UP(stack_safe, PAGE_SIZE);
   
    version_print();
   
    LOG("\nconfig.base=%#" PRIp " config.kernel_size=%" PRIs
        "\nconfig.stack_base=%#" PRIp " config.stack_size=%" PRIs,
        config.base, config.kernel_size,
        config.stack_base, config.stack_size);
   
    context_save(&ctx);
    context_set(&ctx, FADDR(main_bsp_separated_stack), config.stack_base,
        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)
{
 
 
    LOG();
   
    the_initialize(THE);
 
    /*
     * kconsole data structures must be initialized very early
     * because other subsystems will register their respective
     * commands.
     */
    LOG_EXEC(kconsole_init());
   
    /*
     * Exception handler initialization, before architecture
     * starts adding its own handlers
     */
    LOG_EXEC(exc_init());
 
    /*
     * Memory management subsystems initialization.
     */
    LOG_EXEC(arch_pre_mm_init());
    LOG_EXEC(frame_init());
 
 
 
 
 
 
 
 
 
   
    /* Initialize at least 1 memory segment big enough for slab to work. */
    LOG_EXEC(slab_cache_init());
    LOG_EXEC(btree_init());
    LOG_EXEC(as_init());
    LOG_EXEC(page_init());
    LOG_EXEC(tlb_init());
    LOG_EXEC(ddi_init());
    LOG_EXEC(tasklet_init());
    LOG_EXEC(arch_post_mm_init());
    LOG_EXEC(arch_pre_smp_init());
    LOG_EXEC(smp_init());
   
 
 
    /* Slab must be initialized after we know the number of processors. */
    LOG_EXEC(slab_enable_cpucache());
   
    printf("Detected %" PRIc " CPU(s), %" PRIu64" MB free memory\n",
        config.cpu_count, SIZE2MB(zone_total_size()));
 
   
    LOG_EXEC(cpu_init());
   
    LOG_EXEC(calibrate_delay_loop());
    LOG_EXEC(clock_counter_init());
    LOG_EXEC(timeout_init());
    LOG_EXEC(scheduler_init());
    LOG_EXEC(task_init());
    LOG_EXEC(thread_init());
    LOG_EXEC(futex_init());
 
   
    if (init.cnt > 0) {
        count_t i;
        for (i = 0; i < init.cnt; i++)
            printf("init[%" PRIc "].addr=%#" PRIp
                ", init[%" PRIc "].size=%#" PRIs "\n",
                i, init.tasks[i].addr,
                i, init.tasks[i].size);
    } else
        printf("No init binaries found\n");
   
    LOG_EXEC(ipc_init());
 
    /*
     * Create kernel task.
     */
    task_t *kernel = task_create(AS_KERNEL, "kernel");
    if (!kernel)
        panic("Can't create kernel task\n");
   
    /*
     * Create the first thread.
     */
    thread_t *kinit_thread = thread_create(kinit, NULL, kernel, 0, "kinit", true);
    if (!kinit_thread)
        panic("Can't create kinit thread\n");
    LOG_EXEC(thread_ready(kinit_thread));
   
    /*
     * 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 BSP 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
     * *_init() functions can find out that they need to
     * do initialization for AP only.
     */
    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();
    arch_post_cpu_init();
 
    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),
        (uintptr_t) 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 2746	Rev 3061
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	/** @addtogroup main	29	/** @addtogroup main
30	* @{	30	* @{
31	*/	31	*/
32		32
33	/**	33	/**
34	* @file	34	* @file
35	* @brief Main initialization kernel function for all processors.	35	* @brief Main initialization kernel function for all processors.
36	*	36	*
37	* During kernel boot, all processors, after architecture dependent	37	* During kernel boot, all processors, after architecture dependent
38	* initialization, start executing code found in this file. After	38	* initialization, start executing code found in this file. After
39	* bringing up all subsystems, control is passed to scheduler().	39	* bringing up all subsystems, control is passed to scheduler().
40	*	40	*
41	* The bootstrap processor starts executing main_bsp() while	41	* The bootstrap processor starts executing main_bsp() while
42	* the application processors start executing main_ap().	42	* the application processors start executing main_ap().
43	*	43	*
44	* @see scheduler()	44	* @see scheduler()
45	* @see main_bsp()	45	* @see main_bsp()
46	* @see main_ap()	46	* @see main_ap()
47	*/	47	*/
48		48
49	#include <arch/asm.h>	49	#include <arch/asm.h>
50	#include <context.h>	50	#include <context.h>
51	#include <print.h>	51	#include <print.h>
52	#include <panic.h>	52	#include <panic.h>
53	#include <debug.h>	53	#include <debug.h>
54	#include <config.h>	54	#include <config.h>
55	#include <time/clock.h>	55	#include <time/clock.h>
56	#include <time/timeout.h>	56	#include <time/timeout.h>
57	#include <proc/scheduler.h>	57	#include <proc/scheduler.h>
58	#include <proc/thread.h>	58	#include <proc/thread.h>
59	#include <proc/task.h>	59	#include <proc/task.h>
60	#include <proc/tasklet.h>	60	#include <proc/tasklet.h>
61	#include <main/kinit.h>	61	#include <main/kinit.h>
62	#include <main/version.h>	62	#include <main/version.h>
63	#include <console/kconsole.h>	63	#include <console/kconsole.h>
64	#include <cpu.h>	64	#include <cpu.h>
65	#include <align.h>	65	#include <align.h>
66	#include <interrupt.h>	66	#include <interrupt.h>
67	#include <mm/frame.h>	67	#include <mm/frame.h>
68	#include <mm/page.h>	68	#include <mm/page.h>
69	#include <genarch/mm/page_pt.h>	69	#include <genarch/mm/page_pt.h>
70	#include <mm/tlb.h>	70	#include <mm/tlb.h>
71	#include <mm/as.h>	71	#include <mm/as.h>
72	#include <mm/slab.h>	72	#include <mm/slab.h>
73	#include <synch/waitq.h>	73	#include <synch/waitq.h>
74	#include <synch/futex.h>	74	#include <synch/futex.h>
75	#include <arch/arch.h>	75	#include <arch/arch.h>
76	#include <arch.h>	76	#include <arch.h>
77	#include <arch/faddr.h>	77	#include <arch/faddr.h>
78	#include <ipc/ipc.h>	78	#include <ipc/ipc.h>
79	#include <macros.h>	79	#include <macros.h>
80	#include <adt/btree.h>	80	#include <adt/btree.h>
81	#include <console/klog.h>	-
82	#include <smp/smp.h>	81	#include <smp/smp.h>
83	#include <ddi/ddi.h>	82	#include <ddi/ddi.h>
84		83
85	/** Global configuration structure. */	84	/** Global configuration structure. */
86	config_t config;	85	config_t config;
87		86
88	/** Initial user-space tasks */	87	/** Initial user-space tasks */
89	init_t init = {	88	init_t init = {
90	.cnt = 0	89	.cnt = 0
91	};	90	};
92		91
93	/** Boot allocations. */	92	/** Boot allocations. */
94	ballocs_t ballocs = {	93	ballocs_t ballocs = {
95	.base = NULL,	94	.base = NULL,
96	.size = 0	95	.size = 0
97	};	96	};
98		97
99	context_t ctx;	98	context_t ctx;
100		99
101	/*	100	/*
102	* These 'hardcoded' variables will be intialized by	101	* These 'hardcoded' variables will be intialized by
103	* the linker or the low level assembler code with	102	* the linker or the low level assembler code with
104	* appropriate sizes and addresses.	103	* appropriate sizes and addresses.
105	*/	104	*/
106		105
107	/*< Virtual address of where the kernel is loaded. /	106	/*< Virtual address of where the kernel is loaded. /
108	uintptr_t hardcoded_load_address = 0;	107	uintptr_t hardcoded_load_address = 0;
109	/*< Size of the kernel code in bytes. /	108	/*< Size of the kernel code in bytes. /
110	size_t hardcoded_ktext_size = 0;	109	size_t hardcoded_ktext_size = 0;
111	/*< Size of the kernel data in bytes. /	110	/*< Size of the kernel data in bytes. /
112	size_t hardcoded_kdata_size = 0;	111	size_t hardcoded_kdata_size = 0;
113	/*< Lowest safe stack virtual address. /	112	/*< Lowest safe stack virtual address. /
114	uintptr_t stack_safe = 0;	113	uintptr_t stack_safe = 0;
115		114
116	void main_bsp(void);	115	void main_bsp(void);
117	void main_ap(void);	116	void main_ap(void);
118		117
119	/*	118	/*
120	* These two functions prevent stack from underflowing during the	119	* These two functions prevent stack from underflowing during the
121	* kernel boot phase when SP is set to the very top of the reserved	120	* kernel boot phase when SP is set to the very top of the reserved
122	* space. The stack could get corrupted by a fooled compiler-generated	121	* space. The stack could get corrupted by a fooled compiler-generated
123	* pop sequence otherwise.	122	* pop sequence otherwise.
124	*/	123	*/
125	static void main_bsp_separated_stack(void);	124	static void main_bsp_separated_stack(void);
126	#ifdef CONFIG_SMP	125	#ifdef CONFIG_SMP
127	static void main_ap_separated_stack(void);	126	static void main_ap_separated_stack(void);
128	#endif	127	#endif
129		128
130	#define CONFIG_STACK_SIZE ((1 << STACK_FRAMES) * STACK_SIZE)	129	#define CONFIG_STACK_SIZE ((1 << STACK_FRAMES) * STACK_SIZE)
131		130
132	/** Main kernel routine for bootstrap CPU.	131	/** Main kernel routine for bootstrap CPU.
133	*	132	*
134	* Initializes the kernel by bootstrap CPU.	133	* Initializes the kernel by bootstrap CPU.
135	* This function passes control directly to	134	* This function passes control directly to
136	* main_bsp_separated_stack().	135	* main_bsp_separated_stack().
137	*	136	*
138	* Assuming interrupts_disable().	137	* Assuming interrupts_disable().
139	*	138	*
140	*/	139	*/
141	void main_bsp(void)	140	void main_bsp(void)
142	{	141	{
-		142	LOG();
-		143
143	config.cpu_count = 1;	144	config.cpu_count = 1;
144	config.cpu_active = 1;	145	config.cpu_active = 1;
145		146
146	config.base = hardcoded_load_address;	147	config.base = hardcoded_load_address;
147	config.kernel_size = ALIGN_UP(hardcoded_ktext_size +	148	config.kernel_size = ALIGN_UP(hardcoded_ktext_size +
148	hardcoded_kdata_size, PAGE_SIZE);	149	hardcoded_kdata_size, PAGE_SIZE);
149	config.stack_size = CONFIG_STACK_SIZE;	150	config.stack_size = CONFIG_STACK_SIZE;
150		151
151	/* Initialy the stack is placed just after the kernel */	152	/* Initialy the stack is placed just after the kernel */
152	config.stack_base = config.base + config.kernel_size;	153	config.stack_base = config.base + config.kernel_size;
153		154
154	/* Avoid placing stack on top of init */	155	/* Avoid placing stack on top of init */
155	count_t i;	156	count_t i;
156	for (i = 0; i < init.cnt; i++) {	157	for (i = 0; i < init.cnt; i++) {
157	if (PA_overlaps(config.stack_base, config.stack_size,	158	if (PA_overlaps(config.stack_base, config.stack_size,
158	init.tasks[i].addr, init.tasks[i].size))	159	init.tasks[i].addr, init.tasks[i].size))
159	config.stack_base = ALIGN_UP(init.tasks[i].addr +	160	config.stack_base = ALIGN_UP(init.tasks[i].addr +
160	init.tasks[i].size, config.stack_size);	161	init.tasks[i].size, config.stack_size);
161	}	162	}
162		163
163	/* Avoid placing stack on top of boot allocations. */	164	/* Avoid placing stack on top of boot allocations. */
164	if (ballocs.size) {	165	if (ballocs.size) {
165	if (PA_overlaps(config.stack_base, config.stack_size,	166	if (PA_overlaps(config.stack_base, config.stack_size,
166	ballocs.base, ballocs.size))	167	ballocs.base, ballocs.size))
167	config.stack_base = ALIGN_UP(ballocs.base +	168	config.stack_base = ALIGN_UP(ballocs.base +
168	ballocs.size, PAGE_SIZE);	169	ballocs.size, PAGE_SIZE);
169	}	170	}
170		171
171	if (config.stack_base < stack_safe)	172	if (config.stack_base < stack_safe)
172	config.stack_base = ALIGN_UP(stack_safe, PAGE_SIZE);	173	config.stack_base = ALIGN_UP(stack_safe, PAGE_SIZE);
173		174
-		175	version_print();
-		176
-		177	LOG("\nconfig.base=%#" PRIp " config.kernel_size=%" PRIs
-		178	"\nconfig.stack_base=%#" PRIp " config.stack_size=%" PRIs,
-		179	config.base, config.kernel_size,
-		180	config.stack_base, config.stack_size);
-		181
174	context_save(&ctx);	182	context_save(&ctx);
175	context_set(&ctx, FADDR(main_bsp_separated_stack), config.stack_base,	183	context_set(&ctx, FADDR(main_bsp_separated_stack), config.stack_base,
176	THREAD_STACK_SIZE);	184	THREAD_STACK_SIZE);
177	context_restore(&ctx);	185	context_restore(&ctx);
178	/* not reached */	186	/* not reached */
179	}	187	}
180		188
181		189
182	/** Main kernel routine for bootstrap CPU using new stack.	190	/** Main kernel routine for bootstrap CPU using new stack.
183	*	191	*
184	* Second part of main_bsp().	192	* Second part of main_bsp().
185	*	193	*
186	*/	194	*/
187	void main_bsp_separated_stack(void)	195	void main_bsp_separated_stack(void)
188	{	196	{
189	task_t *k;	-
190	thread_t *t;	-
191	count_t i;	197	LOG();
192		198
193	the_initialize(THE);	199	the_initialize(THE);
194		200
195	/*	201	/*
196	* kconsole data structures must be initialized very early	202	* kconsole data structures must be initialized very early
197	* because other subsystems will register their respective	203	* because other subsystems will register their respective
198	* commands.	204	* commands.
199	*/	205	*/
200	kconsole_init();	206	LOG_EXEC(kconsole_init());
201		207
202	/*	208	/*
203	* Exception handler initialization, before architecture	209	* Exception handler initialization, before architecture
204	* starts adding its own handlers	210	* starts adding its own handlers
205	*/	211	*/
206	exc_init();	212	LOG_EXEC(exc_init());
207		213
208	/*	214	/*
209	* Memory management subsystems initialization.	215	* Memory management subsystems initialization.
210	*/	216	*/
211	arch_pre_mm_init();	217	LOG_EXEC(arch_pre_mm_init());
212	frame_init();	218	LOG_EXEC(frame_init());
213	/* Initialize at least 1 memory segment big enough for slab to work. */	-
214	slab_cache_init();	-
215	btree_init();	-
216	as_init();	-
217	page_init();	-
218	tlb_init();	-
219	ddi_init();	-
220	tasklet_init();	-
221	arch_post_mm_init();	-
222		219
-		220	/* Initialize at least 1 memory segment big enough for slab to work. */
-		221	LOG_EXEC(slab_cache_init());
-		222	LOG_EXEC(btree_init());
223	version_print();	223	LOG_EXEC(as_init());
224	printf("kernel: %.*p hardcoded_ktext_size=%zd KB, "	224	LOG_EXEC(page_init());
-		225	LOG_EXEC(tlb_init());
225	"hardcoded_kdata_size=%zd KB\n", sizeof(uintptr_t) * 2,	226	LOG_EXEC(ddi_init());
226	config.base, SIZE2KB(hardcoded_ktext_size),	227	LOG_EXEC(tasklet_init());
227	SIZE2KB(hardcoded_kdata_size));	228	LOG_EXEC(arch_post_mm_init());
228	printf("stack: %.p size=%zd KB\n", sizeof(uintptr_t) 2,	229	LOG_EXEC(arch_pre_smp_init());
229	config.stack_base, SIZE2KB(config.stack_size));	230	LOG_EXEC(smp_init());
230		231
231	arch_pre_smp_init();	-
232	smp_init();	-
233	/* Slab must be initialized after we know the number of processors. */	232	/* Slab must be initialized after we know the number of processors. */
234	slab_enable_cpucache();	233	LOG_EXEC(slab_enable_cpucache());
235		234
236	printf("Detected %zu CPU(s), %llu MB free memory\n",	235	printf("Detected %" PRIc " CPU(s), %" PRIu64" MB free memory\n",
237	config.cpu_count, SIZE2MB(zone_total_size()));	236	config.cpu_count, SIZE2MB(zone_total_size()));
238	cpu_init();	-
239		237
-		238	LOG_EXEC(cpu_init());
-		239
240	calibrate_delay_loop();	240	LOG_EXEC(calibrate_delay_loop());
241	clock_counter_init();	241	LOG_EXEC(clock_counter_init());
242	timeout_init();	242	LOG_EXEC(timeout_init());
243	scheduler_init();	243	LOG_EXEC(scheduler_init());
244	task_init();	244	LOG_EXEC(task_init());
245	thread_init();	245	LOG_EXEC(thread_init());
246	futex_init();	246	LOG_EXEC(futex_init());
247	klog_init();	-
248		247
249	if (init.cnt > 0) {	248	if (init.cnt > 0) {
-		249	count_t i;
250	for (i = 0; i < init.cnt; i++)	250	for (i = 0; i < init.cnt; i++)
251	printf("init[%zd].addr=%.*p, init[%zd].size=%zd\n", i,	251	printf("init[%" PRIc "].addr=%#" PRIp
-		252	", init[%" PRIc "].size=%#" PRIs "\n",
252	sizeof(uintptr_t) * 2, init.tasks[i].addr, i,	253	i, init.tasks[i].addr,
253	init.tasks[i].size);	254	i, init.tasks[i].size);
254	} else	255	} else
255	printf("No init binaries found\n");	256	printf("No init binaries found\n");
256		257
257	ipc_init();	258	LOG_EXEC(ipc_init());
258		259
259	/*	260	/*
260	* Create kernel task.	261	* Create kernel task.
261	*/	262	*/
262	k = task_create(AS_KERNEL, "kernel");	263	task_t *kernel = task_create(AS_KERNEL, "kernel");
263	if (!k)	264	if (!kernel)
264	panic("can't create kernel task\n");	265	panic("Can't create kernel task\n");
265		266
266	/*	267	/*
267	* Create the first thread.	268	* Create the first thread.
268	*/	269	*/
269	t = thread_create(kinit, NULL, k, 0, "kinit", true);	270	thread_t *kinit_thread = thread_create(kinit, NULL, kernel, 0, "kinit", true);
270	if (!t)	271	if (!kinit_thread)
271	panic("can't create kinit thread\n");	272	panic("Can't create kinit thread\n");
272	thread_ready(t);	273	LOG_EXEC(thread_ready(kinit_thread));
273		274
274	/*	275	/*
275	* This call to scheduler() will return to kinit,	276	* This call to scheduler() will return to kinit,
276	* starting the thread of kernel threads.	277	* starting the thread of kernel threads.
277	*/	278	*/
278	scheduler();	279	scheduler();
279	/* not reached */	280	/* not reached */
280	}	281	}
281		282
282		283
283	#ifdef CONFIG_SMP	284	#ifdef CONFIG_SMP
284	/** Main kernel routine for application CPUs.	285	/** Main kernel routine for application CPUs.
285	*	286	*
286	* Executed by application processors, temporary stack	287	* Executed by application processors, temporary stack
287	* is at ctx.sp which was set during BSP boot.	288	* is at ctx.sp which was set during BSP boot.
288	* This function passes control directly to	289	* This function passes control directly to
289	* main_ap_separated_stack().	290	* main_ap_separated_stack().
290	*	291	*
291	* Assuming interrupts_disable()'d.	292	* Assuming interrupts_disable()'d.
292	*	293	*
293	*/	294	*/
294	void main_ap(void)	295	void main_ap(void)
295	{	296	{
296	/*	297	/*
297	* Incrementing the active CPU counter will guarantee that the	298	* Incrementing the active CPU counter will guarantee that the
298	* *_init() functions can find out that they need to	299	* *_init() functions can find out that they need to
299	* do initialization for AP only.	300	* do initialization for AP only.
300	*/	301	*/
301	config.cpu_active++;	302	config.cpu_active++;
302		303
303	/*	304	/*
304	* The THE structure is well defined because ctx.sp is used as stack.	305	* The THE structure is well defined because ctx.sp is used as stack.
305	*/	306	*/
306	the_initialize(THE);	307	the_initialize(THE);
307		308
308	arch_pre_mm_init();	309	arch_pre_mm_init();
309	frame_init();	310	frame_init();
310	page_init();	311	page_init();
311	tlb_init();	312	tlb_init();
312	arch_post_mm_init();	313	arch_post_mm_init();
313		314
314	cpu_init();	315	cpu_init();
315	calibrate_delay_loop();	316	calibrate_delay_loop();
316	arch_post_cpu_init();	317	arch_post_cpu_init();
317		318
318	the_copy(THE, (the_t *) CPU->stack);	319	the_copy(THE, (the_t *) CPU->stack);
319		320
320	/*	321	/*
321	* If we woke kmp up before we left the kernel stack, we could	322	* If we woke kmp up before we left the kernel stack, we could
322	* collide with another CPU coming up. To prevent this, we	323	* collide with another CPU coming up. To prevent this, we
323	* switch to this cpu's private stack prior to waking kmp up.	324	* switch to this cpu's private stack prior to waking kmp up.
324	*/	325	*/
325	context_set(&CPU->saved_context, FADDR(main_ap_separated_stack),	326	context_set(&CPU->saved_context, FADDR(main_ap_separated_stack),
326	(uintptr_t) CPU->stack, CPU_STACK_SIZE);	327	(uintptr_t) CPU->stack, CPU_STACK_SIZE);
327	context_restore(&CPU->saved_context);	328	context_restore(&CPU->saved_context);
328	/* not reached */	329	/* not reached */
329	}	330	}
330		331
331		332
332	/** Main kernel routine for application CPUs using new stack.	333	/** Main kernel routine for application CPUs using new stack.
333	*	334	*
334	* Second part of main_ap().	335	* Second part of main_ap().
335	*	336	*
336	*/	337	*/
337	void main_ap_separated_stack(void)	338	void main_ap_separated_stack(void)
338	{	339	{
339	/*	340	/*
340	* Configure timeouts for this cpu.	341	* Configure timeouts for this cpu.
341	*/	342	*/
342	timeout_init();	343	timeout_init();
343		344
344	waitq_wakeup(&ap_completion_wq, WAKEUP_FIRST);	345	waitq_wakeup(&ap_completion_wq, WAKEUP_FIRST);
345	scheduler();	346	scheduler();
346	/* not reached */	347	/* not reached */
347	}	348	}
348	#endif /* CONFIG_SMP */	349	#endif /* CONFIG_SMP */
349		350
350	/** @}	351	/** @}
351	*/	352	*/
352		353

Subversion Repositories HelenOS

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