source: mainline/src/main/main.c@ ba18512

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since ba18512 was 7ce9284, checked in by Jakub Jermar <jakub@…>, 21 years ago

Dump implementation of THREAD, TASK and CPU.
Implement preemption-safe versions of THREAD, TASK and CPU using THE.
Get rid of CPU_ID_ARCH on all architectures.
Get rid of write_dr0() and read_dr0() on IA-32.
Get rid of cpu_private_data and cpu_private_data_t.

  • Property mode set to 100644
File size: 6.4 KB
Line 
1/*
2 * Copyright (C) 2001-2004 Jakub Jermar
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 *
9 * - Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * - Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
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
15 * derived from this software without specific prior written permission.
16 *
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
19 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
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
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
26 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 */
28
29#include <arch/asm.h>
30#include <context.h>
31#include <print.h>
32#include <panic.h>
33#include <config.h>
34#include <time/clock.h>
35#include <proc/scheduler.h>
36#include <proc/thread.h>
37#include <proc/task.h>
38#include <mm/vm.h>
39#include <main/kinit.h>
40#include <cpu.h>
41#include <mm/heap.h>
42
43#ifdef __SMP__
44#include <arch/smp/apic.h>
45#include <arch/smp/mps.h>
46#endif /* __SMP__ */
47
48#include <smp/smp.h>
49
50#include <arch/mm/memory_init.h>
51#include <mm/frame.h>
52#include <mm/page.h>
53#include <mm/tlb.h>
54#include <synch/waitq.h>
55
56#include <arch.h>
57#include <arch/faddr.h>
58
59#include <typedefs.h>
60
61char *project = "SPARTAN kernel";
62char *copyright = "Copyright (C) 2001-2005 Jakub Jermar\nCopyright (C) 2005 HelenOS project";
63
64config_t config;
65context_t ctx;
66
67/*
68 * These 'hardcoded' variables will be intialised by
69 * the linker or the low level assembler code with
70 * appropriate sizes and addresses.
71 */
72__address hardcoded_load_address = 0;
73size_t hardcoded_ktext_size = 0;
74size_t hardcoded_kdata_size = 0;
75
76/*
77 * Size of memory in bytes taken by kernel and heap.
78 */
79static size_t kernel_size;
80
81/*
82 * Extra space on heap to make the stack start on page boundary.
83 */
84static size_t heap_delta;
85
86void main_bsp(void);
87void main_ap(void);
88
89/*
90 * These two functions prevent stack from underflowing during the
91 * kernel boot phase when SP is set to the very top of the reserved
92 * space. The stack could get corrupted by a fooled compiler-generated
93 * pop sequence otherwise.
94 */
95static void main_bsp_separated_stack(void);
96static void main_ap_separated_stack(void);
97
98/** Bootstrap CPU main kernel routine
99 *
100 * Initializes the kernel by bootstrap CPU.
101 *
102 * Assuming cpu_priority_high().
103 *
104 */
105void main_bsp(void)
106{
107 config.cpu_count = 1;
108 config.cpu_active = 1;
109
110 kernel_size = hardcoded_ktext_size + hardcoded_kdata_size + CONFIG_HEAP_SIZE;
111 heap_delta = PAGE_SIZE - ((hardcoded_load_address + kernel_size) % PAGE_SIZE);
112 heap_delta = (heap_delta == PAGE_SIZE) ? 0 : heap_delta;
113 kernel_size += heap_delta;
114
115 config.base = hardcoded_load_address;
116 config.memory_size = get_memory_size();
117 config.kernel_size = kernel_size + CONFIG_STACK_SIZE;
118
119 context_save(&ctx);
120 context_set(&ctx, FADDR(main_bsp_separated_stack), config.base + kernel_size, CONFIG_STACK_SIZE);
121 context_restore(&ctx);
122 /* not reached */
123}
124
125
126/** Bootstrap CPU main kernel routine stack wrapper
127 *
128 * Second part of main_bsp().
129 *
130 */
131void main_bsp_separated_stack(void)
132{
133 vm_t *m;
134 task_t *k;
135 thread_t *t;
136
137 the_initialize(THE);
138
139 arch_pre_mm_init();
140 heap_init(config.base + hardcoded_ktext_size + hardcoded_kdata_size, CONFIG_HEAP_SIZE + heap_delta);
141 frame_init();
142 page_init();
143 tlb_init();
144
145 arch_post_mm_init();
146
147 printf("%s\n%s\n", project, copyright);
148 printf("%P: hardcoded_ktext_size=%dK, hardcoded_kdata_size=%dK\n",
149 config.base, hardcoded_ktext_size/1024, hardcoded_kdata_size/1024);
150
151 arch_late_init();
152
153 smp_init();
154 printf("config.memory_size=%dM\n", config.memory_size/(1024*1024));
155 printf("config.cpu_count=%d\n", config.cpu_count);
156
157 cpu_init();
158 calibrate_delay_loop();
159
160 timeout_init();
161 scheduler_init();
162 task_init();
163 thread_init();
164
165 /*
166 * Create kernel vm mapping.
167 */
168 m = vm_create(GET_PTL0_ADDRESS());
169 if (!m) panic("can't create kernel vm address space\n");
170
171 /*
172 * Create kernel task.
173 */
174 k = task_create(m);
175 if (!k) panic("can't create kernel task\n");
176
177 /*
178 * Create the first thread.
179 */
180 t = thread_create(kinit, NULL, k, 0);
181 if (!t) panic("can't create kinit thread\n");
182 thread_ready(t);
183
184 /*
185 * This call to scheduler() will return to kinit,
186 * starting the thread of kernel threads.
187 */
188 scheduler();
189 /* not reached */
190}
191
192
193#ifdef __SMP__
194/** Application CPUs main kernel routine
195 *
196 * Executed by application processors, temporary stack
197 * is at ctx.sp which was set during BP boot.
198 *
199 * Assuming cpu_priority_high().
200 *
201 */
202void main_ap(void)
203{
204 /*
205 * Incrementing the active CPU counter will guarantee that the
206 * pm_init() will not attempt to build GDT and IDT tables again.
207 * Neither frame_init() will do the complete thing. Neither cpu_init()
208 * will do.
209 */
210 config.cpu_active++;
211
212 /*
213 * The THE structure is well defined because ctx.sp is used as stack.
214 */
215 the_initialize(THE);
216
217 arch_pre_mm_init();
218 frame_init();
219 page_init();
220 arch_post_mm_init();
221
222 cpu_init();
223 calibrate_delay_loop();
224
225 l_apic_init();
226 l_apic_debug();
227
228 the_copy(THE, (the_t *) CPU->stack);
229
230 /*
231 * If we woke kmp up before we left the kernel stack, we could
232 * collide with another CPU coming up. To prevent this, we
233 * switch to this cpu's private stack prior to waking kmp up.
234 */
235 context_set(&CPU->saved_context, FADDR(main_ap_separated_stack), CPU->stack, CPU_STACK_SIZE);
236 context_restore(&CPU->saved_context);
237 /* not reached */
238}
239
240
241/** Application CPUs main kernel routine stack wrapper
242 *
243 * Second part of main_ap().
244 *
245 */
246void main_ap_separated_stack(void)
247{
248 /*
249 * Configure timeouts for this cpu.
250 */
251 timeout_init();
252
253 waitq_wakeup(&ap_completion_wq, WAKEUP_FIRST);
254 scheduler();
255 /* not reached */
256}
257#endif /* __SMP__*/
Note: See TracBrowser for help on using the repository browser.