Navigation
- Accueil
- Présentation :
- FAQ
- Bugs et errata
- Contributions de lecteurs
- Téléchargements
- LXR (référencement des sources)
- Mailing-list
- Liens et Projets reliés
Site hébergé par :
Site hébergé par :
|
[ source navigation ] [ diff markup ] [ identifier search ] [ general search ] |
|||
|
||||
001 /* Copyright (C) 2004 The SOS Team 001 /* Copyright (C) 2004 The SOS Team 002 Copyright (C) 1999 Free Software Foundatio << 003 002 004 This program is free software; you can redi 003 This program is free software; you can redistribute it and/or 005 modify it under the terms of the GNU Genera 004 modify it under the terms of the GNU General Public License 006 as published by the Free Software Foundatio 005 as published by the Free Software Foundation; either version 2 007 of the License, or (at your option) any lat 006 of the License, or (at your option) any later version. 008 007 009 This program is distributed in the hope tha 008 This program is distributed in the hope that it will be useful, 010 but WITHOUT ANY WARRANTY; without even the 009 but WITHOUT ANY WARRANTY; without even the implied warranty of 011 MERCHANTABILITY or FITNESS FOR A PARTICULAR 010 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 012 GNU General Public License for more details 011 GNU General Public License for more details. 013 012 014 You should have received a copy of the GNU 013 You should have received a copy of the GNU General Public License 015 along with this program; if not, write to t 014 along with this program; if not, write to the Free Software 016 Foundation, Inc., 59 Temple Place - Suite 3 015 Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, 017 USA. 016 USA. 018 */ 017 */ 019 018 020 /* Include definitions of the multiboot standa 019 /* Include definitions of the multiboot standard */ 021 #include <bootstrap/multiboot.h> 020 #include <bootstrap/multiboot.h> 022 #include <hwcore/idt.h> 021 #include <hwcore/idt.h> 023 #include <hwcore/gdt.h> 022 #include <hwcore/gdt.h> 024 #include <hwcore/irq.h> 023 #include <hwcore/irq.h> 025 #include <hwcore/exception.h> 024 #include <hwcore/exception.h> 026 #include <hwcore/i8254.h> 025 #include <hwcore/i8254.h> 027 #include <sos/list.h> 026 #include <sos/list.h> 028 #include <sos/physmem.h> 027 #include <sos/physmem.h> 029 #include <hwcore/paging.h> 028 #include <hwcore/paging.h> 030 #include <sos/kmem_vmm.h> 029 #include <sos/kmem_vmm.h> 031 #include <sos/kmalloc.h> 030 #include <sos/kmalloc.h> >> 031 #include <sos/time.h> >> 032 #include <sos/thread.h> 032 #include <sos/klibc.h> 033 #include <sos/klibc.h> 033 #include <sos/assert.h> 034 #include <sos/assert.h> 034 #include <drivers/x86_videomem.h> 035 #include <drivers/x86_videomem.h> 035 #include <drivers/bochs.h> 036 #include <drivers/bochs.h> 036 037 037 038 038 /* Helper function to display each bits of a 3 039 /* Helper function to display each bits of a 32bits integer on the 039 screen as dark or light carrets */ 040 screen as dark or light carrets */ 040 void display_bits(unsigned char row, unsigned 041 void display_bits(unsigned char row, unsigned char col, 041 unsigned char attribute, 042 unsigned char attribute, 042 sos_ui32_t integer) 043 sos_ui32_t integer) 043 { 044 { 044 int i; 045 int i; 045 /* Scan each bit of the integer, MSb first * 046 /* Scan each bit of the integer, MSb first */ 046 for (i = 31 ; i >= 0 ; i--) 047 for (i = 31 ; i >= 0 ; i--) 047 { 048 { 048 /* Test if bit i of 'integer' is set */ 049 /* Test if bit i of 'integer' is set */ 049 int bit_i = (integer & (1 << i)); 050 int bit_i = (integer & (1 << i)); 050 /* Ascii 219 => dark carret, Ascii 177 = 051 /* Ascii 219 => dark carret, Ascii 177 => light carret */ 051 unsigned char ascii_code = bit_i?219:177 052 unsigned char ascii_code = bit_i?219:177; 052 sos_x86_videomem_putchar(row, col++, 053 sos_x86_videomem_putchar(row, col++, 053 attribute, 054 attribute, 054 ascii_code); 055 ascii_code); 055 } 056 } 056 } 057 } 057 058 058 059 059 /* Clock IRQ handler */ 060 /* Clock IRQ handler */ 060 static void clk_it(int intid, !! 061 static void clk_it(int intid) 061 const struct sos_cpu_kstate << 062 { 062 { 063 static sos_ui32_t clock_count = 0; 063 static sos_ui32_t clock_count = 0; 064 064 065 display_bits(0, 48, 065 display_bits(0, 48, 066 SOS_X86_VIDEO_FG_LTGREEN | SOS_ 066 SOS_X86_VIDEO_FG_LTGREEN | SOS_X86_VIDEO_BG_BLUE, 067 clock_count); 067 clock_count); 068 clock_count++; 068 clock_count++; >> 069 >> 070 /* Execute the expired timeout actions (if any) */ >> 071 sos_time_do_tick(); 069 } 072 } 070 073 071 074 072 /* =========================================== 075 /* ====================================================================== 073 * Page fault exception handling 076 * Page fault exception handling 074 */ 077 */ 075 078 076 /* Helper function to dump a backtrace on boch 079 /* Helper function to dump a backtrace on bochs and/or the console */ 077 static void dump_backtrace(const struct sos_cp !! 080 static void dump_backtrace(const struct sos_cpu_state *cpu_state, 078 sos_vaddr_t stack_b 081 sos_vaddr_t stack_bottom, 079 sos_size_t stack_s 082 sos_size_t stack_size, 080 sos_bool_t on_conso 083 sos_bool_t on_console, 081 sos_bool_t on_bochs 084 sos_bool_t on_bochs) 082 { 085 { 083 static void backtracer(sos_vaddr_t PC, 086 static void backtracer(sos_vaddr_t PC, 084 sos_vaddr_t params, 087 sos_vaddr_t params, 085 sos_ui32_t depth, 088 sos_ui32_t depth, 086 void *custom_arg) 089 void *custom_arg) 087 { 090 { 088 sos_ui32_t invalid = 0xffffffff, *arg1, 091 sos_ui32_t invalid = 0xffffffff, *arg1, *arg2, *arg3, *arg4; 089 092 090 /* Get the address of the first 3 argume 093 /* Get the address of the first 3 arguments from the 091 frame. Among these arguments, 0, 1, 2 094 frame. Among these arguments, 0, 1, 2, 3 arguments might be 092 meaningful (depending on how many arg 095 meaningful (depending on how many arguments the function may 093 take). */ 096 take). */ 094 arg1 = (sos_ui32_t*)params; 097 arg1 = (sos_ui32_t*)params; 095 arg2 = (sos_ui32_t*)(params+4); 098 arg2 = (sos_ui32_t*)(params+4); 096 arg3 = (sos_ui32_t*)(params+8); 099 arg3 = (sos_ui32_t*)(params+8); 097 arg4 = (sos_ui32_t*)(params+12); 100 arg4 = (sos_ui32_t*)(params+12); 098 101 099 /* Make sure the addresses of these argu 102 /* Make sure the addresses of these arguments fit inside the 100 stack boundaries */ 103 stack boundaries */ 101 #define INTERVAL_OK(b,v,u) ( ((b) <= (sos_vadd 104 #define INTERVAL_OK(b,v,u) ( ((b) <= (sos_vaddr_t)(v)) \ 102 && ((sos_vaddr_t) 105 && ((sos_vaddr_t)(v) < (u)) ) 103 if (!INTERVAL_OK(stack_bottom, arg1, sta 106 if (!INTERVAL_OK(stack_bottom, arg1, stack_bottom + stack_size)) 104 arg1 = &invalid; 107 arg1 = &invalid; 105 if (!INTERVAL_OK(stack_bottom, arg2, sta 108 if (!INTERVAL_OK(stack_bottom, arg2, stack_bottom + stack_size)) 106 arg2 = &invalid; 109 arg2 = &invalid; 107 if (!INTERVAL_OK(stack_bottom, arg3, sta 110 if (!INTERVAL_OK(stack_bottom, arg3, stack_bottom + stack_size)) 108 arg3 = &invalid; 111 arg3 = &invalid; 109 if (!INTERVAL_OK(stack_bottom, arg4, sta 112 if (!INTERVAL_OK(stack_bottom, arg4, stack_bottom + stack_size)) 110 arg4 = &invalid; 113 arg4 = &invalid; 111 114 112 /* Print the function context for this f 115 /* Print the function context for this frame */ 113 if (on_bochs) 116 if (on_bochs) 114 sos_bochs_printf("[%d] PC=0x%x arg1=0x 117 sos_bochs_printf("[%d] PC=0x%x arg1=0x%x arg2=0x%x arg3=0x%x\n", 115 (unsigned)depth, (uns 118 (unsigned)depth, (unsigned)PC, 116 (unsigned)*arg1, (uns 119 (unsigned)*arg1, (unsigned)*arg2, 117 (unsigned)*arg3); 120 (unsigned)*arg3); 118 121 119 if (on_console) 122 if (on_console) 120 sos_x86_videomem_printf(23-depth, 3, 123 sos_x86_videomem_printf(23-depth, 3, 121 SOS_X86_VIDEO_ 124 SOS_X86_VIDEO_BG_BLUE 122 | SOS_X86_VI 125 | SOS_X86_VIDEO_FG_LTGREEN, 123 "[%d] PC=0x%x 126 "[%d] PC=0x%x arg1=0x%x arg2=0x%x arg3=0x%x arg4=0x%x", 124 (unsigned)dept 127 (unsigned)depth, PC, 125 (unsigned)*arg 128 (unsigned)*arg1, (unsigned)*arg2, 126 (unsigned)*arg 129 (unsigned)*arg3, (unsigned)*arg4); 127 130 128 } 131 } 129 132 130 sos_backtrace(cpu_kstate, 15, stack_bottom, !! 133 sos_backtrace(cpu_state, 15, stack_bottom, stack_size, backtracer, NULL); 131 } 134 } 132 135 133 136 134 /* Page fault exception handler with demand pa 137 /* Page fault exception handler with demand paging for the kernel */ 135 static void pgflt_ex(int intid, const struct s !! 138 static void pgflt_ex(int intid, const struct sos_cpu_state *ctxt) 136 { 139 { 137 static sos_ui32_t demand_paging_count = 0; 140 static sos_ui32_t demand_paging_count = 0; 138 sos_vaddr_t faulting_vaddr = sos_cpu_kstate_ !! 141 sos_vaddr_t faulting_vaddr = sos_cpu_context_get_EX_faulting_vaddr(ctxt); 139 sos_paddr_t ppage_paddr; 142 sos_paddr_t ppage_paddr; 140 143 141 /* Check if address is covered by any VMM ra 144 /* Check if address is covered by any VMM range */ 142 if (! sos_kmem_vmm_is_valid_vaddr(faulting_v 145 if (! sos_kmem_vmm_is_valid_vaddr(faulting_vaddr)) 143 { 146 { 144 /* No: The page fault is out of any kern 147 /* No: The page fault is out of any kernel virtual region. For 145 the moment, we don't handle this. */ 148 the moment, we don't handle this. */ 146 dump_backtrace(ctxt, 149 dump_backtrace(ctxt, 147 bootstrap_stack_bottom, 150 bootstrap_stack_bottom, 148 bootstrap_stack_size, 151 bootstrap_stack_size, 149 TRUE, TRUE); 152 TRUE, TRUE); 150 sos_display_fatal_error("Unresolved page !! 153 sos_display_fatal_error("Unresolved page Fault at instruction 0x%x on access to address 0x%x (info=%x)!", >> 154 sos_cpu_context_get_PC(ctxt), 151 (unsigned)faulti 155 (unsigned)faulting_vaddr, 152 (unsigned)sos_cp !! 156 (unsigned)sos_cpu_context_get_EX_info(ctxt)); 153 SOS_ASSERT_FATAL(! "Got page fault (note 157 SOS_ASSERT_FATAL(! "Got page fault (note: demand paging is disabled)"); 154 } 158 } 155 159 156 160 157 /* 161 /* 158 * Demand paging 162 * Demand paging 159 */ 163 */ 160 164 161 /* Update the number of demand paging reques 165 /* Update the number of demand paging requests handled */ 162 demand_paging_count ++; 166 demand_paging_count ++; 163 display_bits(0, 0, 167 display_bits(0, 0, 164 SOS_X86_VIDEO_FG_LTRED | SOS_X8 168 SOS_X86_VIDEO_FG_LTRED | SOS_X86_VIDEO_BG_BLUE, 165 demand_paging_count); 169 demand_paging_count); 166 170 167 /* Allocate a new page for the virtual addre 171 /* Allocate a new page for the virtual address */ 168 ppage_paddr = sos_physmem_ref_physpage_new(F 172 ppage_paddr = sos_physmem_ref_physpage_new(FALSE); 169 if (! ppage_paddr) 173 if (! ppage_paddr) 170 SOS_ASSERT_FATAL(! "TODO: implement swap. 174 SOS_ASSERT_FATAL(! "TODO: implement swap. (Out of mem in demand paging because no swap for kernel yet !)"); 171 SOS_ASSERT_FATAL(SOS_OK == sos_paging_map(pp 175 SOS_ASSERT_FATAL(SOS_OK == sos_paging_map(ppage_paddr, 172 SO 176 SOS_PAGE_ALIGN_INF(faulting_vaddr), 173 FA 177 FALSE, 174 SO 178 SOS_VM_MAP_PROT_READ 175 | 179 | SOS_VM_MAP_PROT_WRITE 176 | 180 | SOS_VM_MAP_ATOMIC)); 177 sos_physmem_unref_physpage(ppage_paddr); 181 sos_physmem_unref_physpage(ppage_paddr); 178 182 179 /* Ok, we can now return to interrupted cont 183 /* Ok, we can now return to interrupted context */ 180 } 184 } 181 185 182 186 183 << 184 /* =========================================== 187 /* ====================================================================== 185 * Demonstrate the use of the CPU kernet conte !! 188 * Demonstrate the use of SOS kernel threads 186 * - A coroutine prints "Hlowrd" and switches !! 189 * - Kernel Threads are created with various priorities and their 187 * letter !! 190 * state is printed on both the console and the bochs' 0xe9 port 188 * - A coroutine prints "el ol\n" and switche !! 191 * - For tests regarding threads' synchronization, see mouse_sim.c 189 * each letter. << 190 * The first to reach the '\n' returns back to << 191 */ 192 */ 192 struct sos_cpu_kstate *ctxt_hello1; << 193 struct sos_cpu_kstate *ctxt_hello2; << 194 struct sos_cpu_kstate *ctxt_main; << 195 sos_vaddr_t hello1_stack, hello2_stack; << 196 193 197 static void reclaim_stack(sos_vaddr_t stack_va !! 194 struct thr_arg 198 { 195 { 199 sos_kfree(stack_vaddr); !! 196 char character; 200 } !! 197 int color; 201 << 202 << 203 static void exit_hello12(sos_vaddr_t stack_vad << 204 { << 205 sos_cpu_kstate_exit_to(ctxt_main, << 206 (sos_cpu_kstate_funct << 207 stack_vaddr); << 208 } << 209 << 210 << 211 static void hello1 (char *str) << 212 { << 213 for ( ; *str != '\n' ; str++) << 214 { << 215 sos_bochs_printf("hello1: %c\n", *str); << 216 sos_cpu_kstate_switch(& ctxt_hello1, ctx << 217 } << 218 << 219 /* You can uncomment this in case you explic << 220 now. But returning from the function will << 221 /* sos_cpu_kstate_exit_to(ctxt_main, << 222 (sos_cpu_kstate_funct << 223 hello1_stack); */ << 224 } << 225 << 226 << 227 static void hello2 (char *str) << 228 { << 229 for ( ; *str != '\n' ; str++) << 230 { << 231 sos_bochs_printf("hello2: %c\n", *str); << 232 sos_cpu_kstate_switch(& ctxt_hello2, ctx << 233 } << 234 << 235 /* You can uncomment this in case you explic << 236 now. But returning from the function will << 237 /* sos_cpu_kstate_exit_to(ctxt_main, << 238 (sos_cpu_kstate_funct << 239 hello2_stack); */ << 240 } << 241 << 242 << 243 void print_hello_world () << 244 { << 245 #define DEMO_STACK_SIZE 1024 << 246 /* Allocate the stacks */ << 247 hello1_stack = sos_kmalloc(DEMO_STACK_SIZE, << 248 hello2_stack = sos_kmalloc(DEMO_STACK_SIZE, << 249 << 250 /* Initialize the coroutines' contexts */ << 251 sos_cpu_kstate_init(&ctxt_hello1, << 252 (sos_cpu_kstate_function << 253 (sos_ui32_t) "Hlowrd", << 254 (sos_vaddr_t) hello1_sta << 255 (sos_cpu_kstate_function << 256 (sos_ui32_t) hello1_stac << 257 sos_cpu_kstate_init(&ctxt_hello2, << 258 (sos_cpu_kstate_function << 259 (sos_ui32_t) "el ol\n", << 260 (sos_vaddr_t) hello2_sta << 261 (sos_cpu_kstate_function << 262 (sos_ui32_t) hello2_stac << 263 << 264 /* Go to first coroutine */ << 265 sos_bochs_printf("Printing Hello World\\n... << 266 sos_cpu_kstate_switch(& ctxt_main, ctxt_hell << 267 << 268 /* The first coroutine to reach the '\n' swi << 269 sos_bochs_printf("Back in main !\n"); << 270 } << 271 << 272 << 273 /* =========================================== << 274 * Generate page faults on an unmapped but all << 275 * region, which results in a series of physic << 276 * faulted pages. << 277 */ << 278 static void test_demand_paging(int nb_alloc_vp << 279 { << 280 int i; << 281 sos_vaddr_t base_vaddr; << 282 << 283 sos_x86_videomem_printf(10, 0, << 284 SOS_X86_VIDEO_BG_BLU << 285 "Demand paging test << 286 nb_alloc_vpages >> 8 << 287 << 288 /* Allocate virtual memory */ << 289 base_vaddr = sos_kmem_vmm_alloc(nb_alloc_vpa << 290 << 291 SOS_ASSERT_FATAL(base_vaddr != (sos_vaddr_t) << 292 sos_x86_videomem_printf(11, 0, << 293 SOS_X86_VIDEO_BG_BLU << 294 "Allocated virtual r << 295 base_vaddr, << 296 base_vaddr + nb_allo << 297 << 298 /* Now use part of it in physical memory */ << 299 for (i = 0 ; (i < nb_alloc_ppages) && (i < n << 300 { << 301 /* Compute an address inside the range * << 302 sos_ui32_t *value, j; << 303 sos_vaddr_t vaddr = base_vaddr; << 304 vaddr += (nb_alloc_vpages - (i + 1))*SOS << 305 vaddr += 2345; << 306 << 307 sos_x86_videomem_printf(12, 0, << 308 SOS_X86_VIDEO_BG << 309 "Writing %d at v << 310 i, vaddr); << 311 << 312 /* Write at this address */ << 313 value = (sos_ui32_t*)vaddr; << 314 *value = i; << 315 << 316 /* Yep ! A new page should normally have << 317 sos_x86_videomem_printf(13, 0, << 318 SOS_X86_VIDEO_BG << 319 "Value read at a << 320 vaddr, (unsigned << 321 } << 322 << 323 SOS_ASSERT_FATAL(SOS_OK == sos_kmem_vmm_free << 324 /* Yep ! A new page should normally have bee << 325 sos_x86_videomem_printf(14, 0, << 326 SOS_X86_VIDEO_BG_BLU << 327 "Done (area un-alloc << 328 } << 329 << 330 << 331 << 332 /* =========================================== << 333 * Shows how the backtrace stuff works << 334 */ << 335 << 336 /* Recursive function. Print the backtrace fro << 337 static void test_backtrace(int i, int magic, s << 338 sos_size_t stack_s << 339 { << 340 if (i <= 0) << 341 { << 342 /* The page fault exception handler will << 343 this function, because address 0x42 i << 344 *((char*)0x42) = 12; << 345 << 346 /* More direct variant: */ << 347 /* dump_backtrace(NULL, stack_bottom, st << 348 } << 349 else << 350 test_backtrace(i-1, magic, stack_bottom, s << 351 } << 352 << 353 << 354 /* =========================================== << 355 * Parsing of Mathematical expressions << 356 * << 357 * This is a recursive lexer/parser/evaluator << 358 * expressions. Supports both binary +/-* and << 359 * well as parentheses. << 360 * << 361 * Terminal tokens (Lexer): << 362 * - Number: positive integer number << 363 * - Variable: ascii name (regexp: [a-zA-Z]+) << 364 * - Operator: +*-/ << 365 * - Opening/closing parentheses << 366 * << 367 * Grammar (Parser): << 368 * Expression ::= Term E' << 369 * Expr_lr ::= + Term Expr_lr | - Term Exp << 370 * Term ::= Factor Term_lr << 371 * Term_lr ::= * Factor Term_lr | / Factor << 372 * Factor ::= - Factor | + Factor | Scala << 373 * Scalar ::= Number | Variable << 374 * << 375 * Note. This is the left-recursive equivalent << 376 * Expression ::= Expression + Term | Express << 377 * Term ::= Term * Factor | Term / Fact << 378 * factor ::= - Factor | + Factor | Scala << 379 * Scalar ::= Number | Variable << 380 * << 381 * The parsing is composed of a 3 stages pipel << 382 * - The reader: reads a string 1 character a << 383 * the control back to lexer after each cha << 384 * interest in using coroutines, because it << 385 * implicitely stored in the stack between << 386 * - The lexer: consumes the characters from << 387 * the terminal tokens, 1 token at a time, << 388 * to the parser after each token. This fun << 389 * in using coroutines, because its state ( << 390 * implicitely stored in the stack between << 391 * - The parser: consumes the tokens from the << 392 * syntax tree of the expression. There is << 393 * interest in defining a coroutine devoted << 394 * do use one for that because this allows << 395 * deeper stack. Actually, the parser is hi << 396 * the default 16kB stack of the sos_main() << 397 * enough. Here, we switch to a 64kB stack, << 398 * recursive functions. The Parser uses int << 399 * are defined and implemented as internal << 400 * just for the sake of clarity, and is abs << 401 * the algorithm: one can transfer these fu << 402 * function without restriction. << 403 * << 404 * The evaluator is another recursive function << 405 * parser's stack to evaluate the parsed expre << 406 * values for the variables present in the exp << 407 * parser function, this function defines and << 408 * which can be extracted from the main evalua << 409 * << 410 * All these functions support a kind of "exce << 411 * something goes wrong, control is transferre << 412 * sos_main() context, without unrolling the r << 413 * how exceptions basically work, but one shou << 414 * a reference exceptions implementation. Real << 415 * (such as that in the C++ language) call the << 416 * objects allocated on the stack during the " << 417 * upon exception handling, which complicates << 418 * don't have real Objects here (in the OOP se << 419 * destructors), so we don't have to complicat << 420 * << 421 * After this little coroutine demo, one shoul << 422 * a low-level manual direct manipulation of s << 423 * probably mess up the whole kernel to do wha << 424 * resources such as mutex/semaphore won't be << 425 * ...). Higher level "kernel thread" primitiv << 426 * presented, which provide a higher-level set << 427 * contexts. You'll have to use EXCLUSIVELY th << 428 * need a huge stack to do recursion for examp << 429 * think of changing manually the stack for so << 430 * rethink your algorithm, making it non-recur << 431 */ << 432 198 433 !! 199 int col; 434 /* The stacks involved */ !! 200 int row; 435 static char stack_reader[1024]; !! 201 }; 436 static char stack_lexer[1024]; << 437 static char deep_stack[65536]; /* For the pars << 438 << 439 /* The CPU states for the various coroutines * << 440 static struct sos_cpu_kstate *st_reader, *st_l << 441 *st_eval, *st_free, *st_main; << 442 202 443 203 444 /* !! 204 static void demo_thread(void *arg) 445 * Default exit/reclaim functions: return cont << 446 * context << 447 */ << 448 static void reclaim(int unused) << 449 { 205 { 450 } !! 206 struct thr_arg *thr_arg = (struct thr_arg*)arg; 451 static void func_exit(sos_ui32_t unused) !! 207 int progress = 0; 452 { << 453 sos_cpu_kstate_exit_to(st_main, (sos_cpu_kst << 454 } << 455 208 456 !! 209 sos_bochs_printf("start %c", thr_arg->character); 457 /* !! 210 while (1) 458 * The reader coroutine and associated variabl << 459 * have been a normal function, except that th << 460 * character would have to be stored somewhere << 461 */ << 462 static char data_reader_to_lexer; << 463 << 464 static void func_reader(const char *str) << 465 { << 466 for ( ; str && (*str != '\0') ; str++) << 467 { 211 { 468 data_reader_to_lexer = *str; !! 212 progress ++; 469 sos_cpu_kstate_switch(& st_reader, st_le !! 213 display_bits(thr_arg->row, thr_arg->col+1, thr_arg->color, progress); 470 } << 471 << 472 data_reader_to_lexer = '\0'; << 473 sos_cpu_kstate_switch(& st_reader, st_lexer) << 474 } << 475 << 476 214 477 /* !! 215 sos_bochs_putchar(thr_arg->character); 478 * The Lexer coroutine and associated types/va << 479 * could have been a normal function, except t << 480 * character, token and previous token would h << 481 * somewhere. << 482 */ << 483 #define STR_VAR_MAXLEN 16 << 484 static struct lex_elem << 485 { << 486 enum { LEX_IS_NUMBER, LEX_IS_OPER, LEX_IS_VA << 487 LEX_IS_OPENPAR, LEX_IS_CLOSEPAR, LEX_ << 488 union { << 489 int number; << 490 char operator; << 491 char var[STR_VAR_MAXLEN]; << 492 }; << 493 } data_lexer_to_parser; << 494 216 495 static void func_lexer(sos_ui32_t unused) !! 217 /* Yield the CPU to another thread sometimes... */ 496 { !! 218 if ((random() % 100) == 0) 497 char c; << 498 enum { GOT_SPACE, GOT_NUM, GOT_OP, GOT_STR, << 499 GOT_OPENPAR, GOT_CLOSEPAR } got_what, << 500 << 501 data_lexer_to_parser.number = 0; << 502 got_what_before = GOT_SPACE; << 503 do << 504 { << 505 /* Consume one character from the reader << 506 sos_cpu_kstate_switch(& st_lexer, st_rea << 507 c = data_reader_to_lexer; << 508 << 509 /* Classify the consumed character */ << 510 if ( (c >= '0') && (c <= '9') ) << 511 got_what = GOT_NUM; << 512 else if ( (c == '+') || (c == '-') || (c << 513 got_what = GOT_OP; << 514 else if ( ( (c >= 'a') && (c <= 'z') ) << 515 || ( (c >= 'A') && (c <= 'Z') << 516 got_what = GOT_STR; << 517 else if (c == '(') << 518 got_what = GOT_OPENPAR; << 519 else if (c == ')') << 520 got_what = GOT_CLOSEPAR; << 521 else << 522 got_what = GOT_SPACE; << 523 << 524 /* Determine whether the current token i << 525 if ( (got_what != got_what_before) << 526 || (got_what_before == GOT_OP) << 527 || (got_what_before == GOT_OPENPAR) << 528 || (got_what_before == GOT_CLOSEPAR << 529 { 219 { 530 /* return control back to the parser !! 220 sos_bochs_printf("[37myield(%c)[m\n", thr_arg->character); 531 has been recognized */ !! 221 sos_x86_videomem_putchar(thr_arg->row, thr_arg->col, 0x1e, 'Y'); 532 if ( (got_what_before != GOT_SPACE) !! 222 SOS_ASSERT_FATAL(SOS_OK == sos_thread_yield()); 533 sos_cpu_kstate_switch(& st_lexer, !! 223 sos_x86_videomem_putchar(thr_arg->row, thr_arg->col, 0x1e, 'R'); 534 << 535 data_lexer_to_parser.number = 0; << 536 } 224 } 537 225 538 /* Update the token being currently reco !! 226 /* Go to sleep some other times... */ 539 if (got_what == GOT_OP) !! 227 else if ((random() % 200) == 0) 540 { << 541 data_lexer_to_parser.type = LEX_IS_O << 542 data_lexer_to_parser.operator = c; << 543 } << 544 else if (got_what == GOT_NUM) << 545 { 228 { 546 data_lexer_to_parser.type = LEX_IS_N !! 229 struct sos_time t = (struct sos_time){ .sec=0, .nanosec=50000000 }; 547 data_lexer_to_parser.number *= 10; !! 230 sos_bochs_printf("[37msleep1(%c)[m\n", thr_arg->character); 548 data_lexer_to_parser.number += (c - !! 231 sos_x86_videomem_putchar(thr_arg->row, thr_arg->col, 0x1e, 's'); >> 232 SOS_ASSERT_FATAL(SOS_OK == sos_thread_sleep(& t)); >> 233 SOS_ASSERT_FATAL(sos_time_is_zero(& t)); >> 234 sos_x86_videomem_putchar(thr_arg->row, thr_arg->col, 0x1e, 'R'); 549 } 235 } 550 else if (got_what == GOT_STR) !! 236 >> 237 /* Go to sleep for a longer time some other times... */ >> 238 else if ((random() % 300) == 0) 551 { 239 { 552 char to_cat[] = { c, '\0' }; !! 240 struct sos_time t = (struct sos_time){ .sec=0, .nanosec=300000000 }; 553 data_lexer_to_parser.type = LEX_IS_V !! 241 sos_bochs_printf("[37msleep2(%c)[m\n", thr_arg->character); 554 strzcat(data_lexer_to_parser.var, to !! 242 sos_x86_videomem_putchar(thr_arg->row, thr_arg->col, 0x1e, 'S'); >> 243 SOS_ASSERT_FATAL(SOS_OK == sos_thread_sleep(& t)); >> 244 SOS_ASSERT_FATAL(sos_time_is_zero(& t)); >> 245 sos_x86_videomem_putchar(thr_arg->row, thr_arg->col, 0x1e, 'R'); 555 } 246 } 556 else if (got_what == GOT_OPENPAR) << 557 data_lexer_to_parser.type = LEX_IS_OPE << 558 else if (got_what == GOT_CLOSEPAR) << 559 data_lexer_to_parser.type = LEX_IS_CLO << 560 247 561 got_what_before = got_what; !! 248 /* Infinite loop otherwise */ 562 } 249 } 563 while (c != '\0'); << 564 << 565 /* Transfer last recognized token to the par << 566 if ( (got_what_before != GOT_SPACE) ) << 567 sos_cpu_kstate_switch(& st_lexer, st_parse << 568 << 569 /* Signal that no more token are available * << 570 data_lexer_to_parser.type = LEX_END; << 571 sos_cpu_kstate_switch(& st_lexer, st_parser) << 572 << 573 /* Exception: parser asks for a token AFTER << 574 one */ << 575 sos_bochs_printf("Error: end of string alrea << 576 sos_cpu_kstate_switch(& st_lexer, st_main); << 577 } 250 } 578 251 579 252 580 /* !! 253 static void test_thread() 581 * The Parser coroutine and associated types/v << 582 */ << 583 struct syntax_node << 584 { 254 { 585 enum { YY_IS_BINOP, YY_IS_UNAROP, YY_IS_NUM, !! 255 /* "static" variables because we want them to remain even when the 586 union !! 256 function returns */ 587 { !! 257 static struct thr_arg arg_b, arg_c, arg_d, arg_e, arg_R, arg_S; 588 int number; !! 258 sos_ui32_t flags; 589 char var[STR_VAR_MAXLEN]; << 590 struct << 591 { << 592 char op; << 593 struct syntax_node *parm_left, *parm_rig << 594 } binop; << 595 struct << 596 { << 597 char op; << 598 struct syntax_node *parm; << 599 } unarop; << 600 }; << 601 }; << 602 259 603 static void func_parser(struct syntax_node ** !! 260 sos_disable_IRQs(flags); 604 { << 605 static struct syntax_node *alloc_node_num(in << 606 static struct syntax_node *alloc_node_var(co << 607 static struct syntax_node *alloc_node_binop( << 608 << 609 << 610 static struct syntax_node *alloc_node_unarop << 611 << 612 static struct syntax_node * get_expr(); << 613 static struct syntax_node * get_expr_lr(stru << 614 static struct syntax_node * get_term(); << 615 static struct syntax_node * get_term_lr(stru << 616 static struct syntax_node * get_factor(); << 617 static struct syntax_node * get_scalar(); << 618 261 619 /* Create a new node to store a number */ !! 262 arg_b = (struct thr_arg) { .character='b', .col=0, .row=21, .color=0x14 }; 620 static struct syntax_node *alloc_node_num(in !! 263 sos_create_kernel_thread("YO[b]", demo_thread, (void*)&arg_b); 621 { << 622 struct syntax_node *n << 623 = (struct syntax_node*) sos_kmalloc(si << 624 n->type = YY_IS_NUM; << 625 n->number = val; << 626 return n; << 627 } << 628 /* Create a new node to store a variable */ << 629 static struct syntax_node *alloc_node_var(co << 630 { << 631 struct syntax_node *n << 632 = (struct syntax_node*) sos_kmalloc(si << 633 n->type = YY_IS_VAR; << 634 strzcpy(n->var, name, STR_VAR_MAXLEN); << 635 return n; << 636 } << 637 /* Create a new node to store a binary opera << 638 static struct syntax_node *alloc_node_binop( << 639 << 640 << 641 { << 642 struct syntax_node *n << 643 = (struct syntax_node*) sos_kmalloc(si << 644 n->type = YY_IS_BINOP; << 645 n->binop.op = op; << 646 n->binop.parm_left = parm_left; << 647 n->binop.parm_right = parm_right; << 648 return n; << 649 } << 650 /* Create a new node to store a unary operat << 651 static struct syntax_node *alloc_node_unarop << 652 << 653 { << 654 struct syntax_node *n << 655 = (struct syntax_node*) sos_kmalloc(si << 656 n->type = YY_IS_UNAROP; << 657 n->unarop.op = op; << 658 n->unarop.parm = parm; << 659 return n; << 660 } << 661 264 662 /* Raise an exception: transfer control back !! 265 arg_c = (struct thr_arg) { .character='c', .col=46, .row=21, .color=0x14 }; 663 without unrolling the whole recursion */ !! 266 sos_create_kernel_thread("YO[c]", demo_thread, (void*)&arg_c); 664 static void parser_exception(const char *str << 665 { << 666 sos_bochs_printf("Parser exception: %s\n << 667 sos_cpu_kstate_switch(& st_parser, st_ma << 668 } << 669 267 670 /* Consume the current terminal "number" tok !! 268 arg_d = (struct thr_arg) { .character='d', .col=0, .row=20, .color=0x14 }; 671 token */ !! 269 sos_create_kernel_thread("YO[d]", demo_thread, (void*)&arg_d); 672 static int get_number() << 673 { << 674 int v; << 675 if (data_lexer_to_parser.type != LEX_IS_ << 676 parser_exception("Expected number"); << 677 v = data_lexer_to_parser.number; << 678 sos_cpu_kstate_switch(& st_parser, st_le << 679 return v; << 680 } << 681 /* Consume the current terminal "variable" t << 682 token */ << 683 static void get_str(char name[STR_VAR_MAXLEN << 684 { << 685 if (data_lexer_to_parser.type != LEX_IS_ << 686 parser_exception("Expected variable"); << 687 strzcpy(name, data_lexer_to_parser.var, << 688 sos_cpu_kstate_switch(& st_parser, st_le << 689 } << 690 /* Consume the current terminal "operator" t << 691 token */ << 692 static char get_op() << 693 { << 694 char op; << 695 if (data_lexer_to_parser.type != LEX_IS_ << 696 parser_exception("Expected operator"); << 697 op = data_lexer_to_parser.operator; << 698 sos_cpu_kstate_switch(& st_parser, st_le << 699 return op; << 700 } << 701 /* Consume the current terminal "parenthese" << 702 token */ << 703 static void get_par() << 704 { << 705 if ( (data_lexer_to_parser.type != LEX_I << 706 && (data_lexer_to_parser.type != LE << 707 parser_exception("Expected parenthese" << 708 sos_cpu_kstate_switch(& st_parser, st_le << 709 } << 710 270 711 /* Parse an Expression */ !! 271 arg_e = (struct thr_arg) { .character='e', .col=0, .row=19, .color=0x14 }; 712 static struct syntax_node * get_expr() !! 272 sos_create_kernel_thread("YO[e]", demo_thread, (void*)&arg_e); 713 { << 714 struct syntax_node *t = get_term(); << 715 return get_expr_lr(t); << 716 } << 717 /* Parse an Expr_lr */ << 718 static struct syntax_node * get_expr_lr(stru << 719 { << 720 if ( (data_lexer_to_parser.type == LEX_I << 721 && ( (data_lexer_to_parser.operator << 722 || (data_lexer_to_parser.opera << 723 { << 724 char op = get_op(); << 725 struct syntax_node *term = get_term( << 726 struct syntax_node *node_op = alloc_ << 727 return get_expr_lr(node_op); << 728 } << 729 return n; << 730 } << 731 /* Parse a Term */ << 732 static struct syntax_node * get_term() << 733 { << 734 struct syntax_node *f1 = get_factor(); << 735 return get_term_lr(f1); << 736 } << 737 /* Parse a Term_lr */ << 738 static struct syntax_node * get_term_lr(stru << 739 { << 740 if ( (data_lexer_to_parser.type == LEX_I << 741 && ( (data_lexer_to_parser.operator << 742 || (data_lexer_to_parser.opera << 743 { << 744 char op = get_op(); << 745 struct syntax_node *factor = get_fac << 746 struct syntax_node *node_op = alloc_ << 747 return get_term_lr(node_op); << 748 } << 749 return n; << 750 } << 751 /* Parse a Factor */ << 752 static struct syntax_node * get_factor() << 753 { << 754 if ( (data_lexer_to_parser.type == LEX_I << 755 && ( (data_lexer_to_parser.operator << 756 || (data_lexer_to_parser.opera << 757 { char op = data_lexer_to_parser.opera << 758 get_op(); return alloc_node_unarop(op, << 759 else if (data_lexer_to_parser.type == LE << 760 { << 761 struct syntax_node *expr; << 762 get_par(); << 763 expr = get_expr(); << 764 if (data_lexer_to_parser.type != LEX << 765 parser_exception("Mismatched paren << 766 get_par(); << 767 return expr; << 768 } << 769 << 770 return get_scalar(); << 771 } << 772 /* Parse a Scalar */ << 773 static struct syntax_node * get_scalar() << 774 { << 775 if (data_lexer_to_parser.type != LEX_IS_ << 776 { << 777 char var[STR_VAR_MAXLEN]; << 778 get_str(var); << 779 return alloc_node_var(var); << 780 } << 781 return alloc_node_num(get_number()); << 782 } << 783 273 >> 274 arg_R = (struct thr_arg) { .character='R', .col=0, .row=17, .color=0x1c }; >> 275 sos_create_kernel_thread("YO[R]", demo_thread, (void*)&arg_R); 784 276 785 /* !! 277 arg_S = (struct thr_arg) { .character='S', .col=0, .row=16, .color=0x1c }; 786 * Body of the function !! 278 sos_create_kernel_thread("YO[S]", demo_thread, (void*)&arg_S); 787 */ << 788 << 789 /* Get the first token */ << 790 sos_cpu_kstate_switch(& st_parser, st_lexer) << 791 << 792 /* Begin the parsing ! */ << 793 *syntax_tree = get_expr(); << 794 /* The result is returned in the syntax_tree << 795 } << 796 << 797 279 798 /* !! 280 sos_restore_IRQs(flags); 799 * Setup the parser's pipeline << 800 */ << 801 static struct syntax_node * parse_expression(c << 802 { << 803 struct syntax_node *retval = NULL; << 804 << 805 /* Build the context of the functions in the << 806 sos_cpu_kstate_init(& st_reader, << 807 (sos_cpu_kstate_function << 808 (sos_ui32_t)expr, << 809 (sos_vaddr_t)stack_reade << 810 (sos_cpu_kstate_function << 811 sos_cpu_kstate_init(& st_lexer, << 812 (sos_cpu_kstate_function << 813 0, << 814 (sos_vaddr_t)stack_lexer << 815 (sos_cpu_kstate_function << 816 sos_cpu_kstate_init(& st_parser, << 817 (sos_cpu_kstate_function << 818 (sos_ui32_t) /* syntax t << 819 (sos_vaddr_t)deep_stack, << 820 (sos_cpu_kstate_function << 821 << 822 /* Parse the expression */ << 823 sos_cpu_kstate_switch(& st_main, st_parser); << 824 return retval; << 825 } 281 } 826 282 827 283 828 /* !! 284 /* ====================================================================== 829 * The Evaluator coroutine and associated type !! 285 * An operating system MUST always have a ready thread ! Otherwise: >> 286 * what would the CPU have to execute ?! 830 */ 287 */ 831 struct func_eval_params !! 288 static void idle_thread() 832 { 289 { 833 const struct syntax_node *e; !! 290 sos_ui32_t idle_twiddle = 0; 834 const char **var_name; << 835 int *var_val; << 836 int nb_vars; << 837 << 838 int result; << 839 }; << 840 291 841 static void func_eval(struct func_eval_params !! 292 while (1) 842 { << 843 /* The internal (recursive) nested function << 844 the syntax tree */ << 845 static int rec_eval(const struct syntax_node << 846 const char* var_name[], << 847 { 293 { 848 switch (n->type) !! 294 /* Remove this instruction if you get an "Invalid opcode" CPU 849 { !! 295 exception (old 80386 CPU) */ 850 case YY_IS_NUM: !! 296 asm("hlt\n"); 851 return n->number; << 852 << 853 case YY_IS_VAR: << 854 { << 855 int i; << 856 for (i = 0 ; i < nb_vars ; i++) << 857 if (0 == strcmp(var_name[i], n-> << 858 return var_val[i]; << 859 << 860 /* Exception: no variable with tha << 861 sos_bochs_printf("ERROR: unknown v << 862 sos_cpu_kstate_switch(& st_eval, s << 863 } << 864 << 865 case YY_IS_BINOP: << 866 { << 867 int left = rec_eval(n->binop.parm_ << 868 var_name, var_ << 869 int right = rec_eval(n->binop.parm << 870 var_name, var << 871 switch (n->binop.op) << 872 { << 873 case '+': return left + right; << 874 case '-': return left - right; << 875 case '*': return left * right; << 876 case '/': return left / right; << 877 default: << 878 /* Exception: no such operator << 879 sos_bochs_printf("ERROR: unkno << 880 sos_cpu_kstate_switch(& st_eva << 881 } << 882 } << 883 << 884 case YY_IS_UNAROP: << 885 { << 886 int arg = rec_eval(n->unarop.parm, << 887 switch (n->unarop.op) << 888 { << 889 case '-': return -arg; << 890 case '+': return arg; << 891 default: << 892 /* Exception: no such operator << 893 sos_bochs_printf("ERROR: unkno << 894 sos_cpu_kstate_switch(& st_eva << 895 } << 896 } << 897 } << 898 << 899 /* Exception: no such syntax node (INTER << 900 sos_bochs_printf("ERROR: invalid node ty << 901 sos_cpu_kstate_switch(& st_eval, st_main << 902 return -1; /* let's make gcc happy */ << 903 } << 904 << 905 << 906 /* << 907 * Function BODY << 908 */ << 909 /* Update p.result returned back to calling << 910 parms->result << 911 = rec_eval(parms->e, parms->var_name, parm << 912 } << 913 << 914 /* << 915 * Change the stack for something larger in or << 916 * recursive function above in a safe way << 917 */ << 918 static int eval_expression(const struct syntax << 919 const char* var_nam << 920 { << 921 struct func_eval_params p << 922 = (struct func_eval_params){ .e=e, << 923 .var_name=var << 924 .var_val=var_ << 925 .nb_vars=nb_v << 926 .result = 0 } << 927 << 928 sos_cpu_kstate_init(& st_eval, << 929 (sos_cpu_kstate_function << 930 (sos_ui32_t)/* p.result << 931 (sos_vaddr_t)deep_stack, << 932 (sos_cpu_kstate_function << 933 << 934 /* Go ! */ << 935 sos_cpu_kstate_switch(& st_main, st_eval); << 936 return p.result; << 937 } << 938 << 939 297 940 /* !! 298 idle_twiddle ++; 941 * Function to free the syntax tree !! 299 display_bits(0, 0, SOS_X86_VIDEO_FG_GREEN | SOS_X86_VIDEO_BG_BLUE, 942 */ !! 300 idle_twiddle); 943 static void func_free(struct syntax_node *n) << 944 { << 945 switch (n->type) << 946 { << 947 case YY_IS_NUM: << 948 case YY_IS_VAR: << 949 break; << 950 << 951 case YY_IS_BINOP: << 952 func_free(n->binop.parm_left); << 953 func_free(n->binop.parm_right); << 954 break; << 955 301 956 case YY_IS_UNAROP: !! 302 /* Lend the CPU to some other thread */ 957 func_free(n->unarop.parm); !! 303 sos_thread_yield(); 958 break; << 959 } 304 } 960 << 961 sos_kfree((sos_vaddr_t)n); << 962 } << 963 << 964 /* << 965 * Change the stack for something larger in or << 966 * recursive function above in a safe way << 967 */ << 968 static void free_syntax_tree(struct syntax_nod << 969 { << 970 sos_cpu_kstate_init(& st_free, << 971 (sos_cpu_kstate_function << 972 (sos_ui32_t)tree, << 973 (sos_vaddr_t)deep_stack, << 974 (sos_cpu_kstate_function << 975 << 976 /* Go ! */ << 977 sos_cpu_kstate_switch(& st_main, st_free); << 978 } 305 } 979 306 980 307 981 /* =========================================== 308 /* ====================================================================== 982 * The C entry point of our operating system 309 * The C entry point of our operating system 983 */ 310 */ 984 void sos_main(unsigned long magic, unsigned lo 311 void sos_main(unsigned long magic, unsigned long addr) 985 { 312 { 986 unsigned i; 313 unsigned i; 987 sos_paddr_t sos_kernel_core_base_paddr, sos_ 314 sos_paddr_t sos_kernel_core_base_paddr, sos_kernel_core_top_paddr; 988 struct syntax_node *syntax_tree; !! 315 struct sos_time tick_resolution; 989 316 990 /* Grub sends us a structure, called multibo 317 /* Grub sends us a structure, called multiboot_info_t with a lot of 991 precious informations about the system, s 318 precious informations about the system, see the multiboot 992 documentation for more information. */ 319 documentation for more information. */ 993 multiboot_info_t *mbi; 320 multiboot_info_t *mbi; 994 mbi = (multiboot_info_t *) addr; 321 mbi = (multiboot_info_t *) addr; 995 322 996 /* Setup bochs and console, and clear the co 323 /* Setup bochs and console, and clear the console */ 997 sos_bochs_setup(); 324 sos_bochs_setup(); 998 325 999 sos_x86_videomem_setup(); 326 sos_x86_videomem_setup(); 1000 sos_x86_videomem_cls(SOS_X86_VIDEO_BG_BLUE) 327 sos_x86_videomem_cls(SOS_X86_VIDEO_BG_BLUE); 1001 328 1002 /* Greetings from SOS */ 329 /* Greetings from SOS */ 1003 if (magic == MULTIBOOT_BOOTLOADER_MAGIC) 330 if (magic == MULTIBOOT_BOOTLOADER_MAGIC) 1004 /* Loaded with Grub */ 331 /* Loaded with Grub */ 1005 sos_x86_videomem_printf(1, 0, 332 sos_x86_videomem_printf(1, 0, 1006 SOS_X86_VIDEO_FG_ 333 SOS_X86_VIDEO_FG_YELLOW | SOS_X86_VIDEO_BG_BLUE, 1007 "Welcome From GRU 334 "Welcome From GRUB to %s%c RAM is %dMB (upper mem = 0x%x kB)", 1008 "SOS", ',', !! 335 "SOS article 6.5", ',', 1009 (unsigned)(mbi->m 336 (unsigned)(mbi->mem_upper >> 10) + 1, 1010 (unsigned)mbi->me 337 (unsigned)mbi->mem_upper); 1011 else 338 else 1012 /* Not loaded with grub */ 339 /* Not loaded with grub */ 1013 sos_x86_videomem_printf(1, 0, 340 sos_x86_videomem_printf(1, 0, 1014 SOS_X86_VIDEO_FG_ 341 SOS_X86_VIDEO_FG_YELLOW | SOS_X86_VIDEO_BG_BLUE, 1015 "Welcome to SOS") !! 342 "Welcome to SOS article 6.5"); 1016 343 1017 sos_bochs_putstring("Message in a bochs\n") !! 344 sos_bochs_putstring("Message in a bochs: This is SOS article 6.5.\n"); 1018 345 1019 /* Setup CPU segmentation and IRQ subsystem 346 /* Setup CPU segmentation and IRQ subsystem */ 1020 sos_gdt_subsystem_setup(); 347 sos_gdt_subsystem_setup(); 1021 sos_idt_subsystem_setup(); 348 sos_idt_subsystem_setup(); 1022 349 1023 /* Setup SOS IRQs and exceptions subsystem 350 /* Setup SOS IRQs and exceptions subsystem */ 1024 sos_exception_subsystem_setup(); 351 sos_exception_subsystem_setup(); 1025 sos_irq_subsystem_setup(); 352 sos_irq_subsystem_setup(); 1026 353 1027 /* Configure the timer so as to raise the I 354 /* Configure the timer so as to raise the IRQ0 at a 100Hz rate */ 1028 sos_i8254_set_frequency(100); 355 sos_i8254_set_frequency(100); 1029 356 >> 357 /* Setup the kernel time subsystem to get prepared to take the timer >> 358 ticks into account */ >> 359 tick_resolution = (struct sos_time) { .sec=0, .nanosec=10000000UL }; >> 360 sos_time_subsysem_setup(& tick_resolution); >> 361 1030 /* We need a multiboot-compliant boot loade 362 /* We need a multiboot-compliant boot loader to get the size of the RAM */ 1031 if (magic != MULTIBOOT_BOOTLOADER_MAGIC) 363 if (magic != MULTIBOOT_BOOTLOADER_MAGIC) 1032 { 364 { 1033 sos_x86_videomem_putstring(20, 0, 365 sos_x86_videomem_putstring(20, 0, 1034 SOS_X86_VIDE 366 SOS_X86_VIDEO_FG_LTRED 1035 | SOS_X86_ 367 | SOS_X86_VIDEO_BG_BLUE 1036 | SOS_X86_ 368 | SOS_X86_VIDEO_FG_BLINKING, 1037 "I'm not loa 369 "I'm not loaded with Grub !"); 1038 /* STOP ! */ 370 /* STOP ! */ 1039 for (;;) 371 for (;;) 1040 continue; 372 continue; 1041 } 373 } 1042 374 1043 /* 375 /* 1044 * Some interrupt handlers 376 * Some interrupt handlers 1045 */ 377 */ 1046 378 1047 /* Binding some HW interrupts and exception 379 /* Binding some HW interrupts and exceptions to software routines */ 1048 sos_irq_set_routine(SOS_IRQ_TIMER, 380 sos_irq_set_routine(SOS_IRQ_TIMER, 1049 clk_it); 381 clk_it); 1050 382 1051 /* 383 /* 1052 * Setup physical memory management 384 * Setup physical memory management 1053 */ 385 */ 1054 386 1055 /* Multiboot says: "The value returned for 387 /* Multiboot says: "The value returned for upper memory is maximally 1056 the address of the first upper memory ho 388 the address of the first upper memory hole minus 1 megabyte.". It 1057 also adds: "It is not guaranteed to be t 389 also adds: "It is not guaranteed to be this value." aka "YMMV" ;) */ 1058 sos_physmem_subsystem_setup((mbi->mem_upper 390 sos_physmem_subsystem_setup((mbi->mem_upper<<10) + (1<<20), 1059 & sos_kernel_co 391 & sos_kernel_core_base_paddr, 1060 & sos_kernel_co 392 & sos_kernel_core_top_paddr); 1061 393 1062 /* 394 /* 1063 * Switch to paged-memory mode 395 * Switch to paged-memory mode 1064 */ 396 */ 1065 397 1066 /* Disabling interrupts should seem more co 398 /* Disabling interrupts should seem more correct, but it's not really 1067 necessary at this stage */ 399 necessary at this stage */ 1068 SOS_ASSERT_FATAL(SOS_OK == 400 SOS_ASSERT_FATAL(SOS_OK == 1069 sos_paging_subsystem_setup 401 sos_paging_subsystem_setup(sos_kernel_core_base_paddr, 1070 402 sos_kernel_core_top_paddr)); 1071 403 1072 /* Bind the page fault exception */ 404 /* Bind the page fault exception */ 1073 sos_exception_set_routine(SOS_EXCEPT_PAGE_F 405 sos_exception_set_routine(SOS_EXCEPT_PAGE_FAULT, 1074 pgflt_ex); 406 pgflt_ex); 1075 407 1076 /* 408 /* 1077 * Setup kernel virtual memory allocator 409 * Setup kernel virtual memory allocator 1078 */ !! 410 */ 1079 411 1080 if (sos_kmem_vmm_subsystem_setup(sos_kernel 412 if (sos_kmem_vmm_subsystem_setup(sos_kernel_core_base_paddr, 1081 sos_kernel 413 sos_kernel_core_top_paddr, 1082 bootstrap_ 414 bootstrap_stack_bottom, 1083 bootstrap_ 415 bootstrap_stack_bottom 1084 + bootstra 416 + bootstrap_stack_size)) 1085 sos_bochs_printf("Could not setup the Ker 417 sos_bochs_printf("Could not setup the Kernel virtual space allocator\n"); 1086 418 1087 if (sos_kmalloc_subsystem_setup()) 419 if (sos_kmalloc_subsystem_setup()) 1088 sos_bochs_printf("Could not setup the Kma 420 sos_bochs_printf("Could not setup the Kmalloc subsystem\n"); 1089 421 1090 /* 422 /* 1091 * Enabling the HW interrupts here, this wi !! 423 * Initialize the Kernel thread and scheduler subsystems 1092 * interrupt call our clk_it handler << 1093 */ << 1094 asm volatile ("sti\n"); << 1095 << 1096 /* << 1097 * Print hello world using coroutines << 1098 */ << 1099 print_hello_world(); << 1100 << 1101 << 1102 /* << 1103 * Run coroutine tests << 1104 */ << 1105 sos_x86_videomem_printf(4, 0, << 1106 SOS_X86_VIDEO_BG_BL << 1107 "Coroutine test"); << 1108 sos_x86_videomem_printf(5, 0, << 1109 SOS_X86_VIDEO_BG_BL << 1110 "Parsing..."); << 1111 syntax_tree = parse_expression(" - ( (69/ << 1112 << 1113 if (syntax_tree != NULL) << 1114 { << 1115 sos_x86_videomem_printf(6, 0, << 1116 SOS_X86_VIDEO_B << 1117 "Evaluating..." << 1118 sos_x86_videomem_printf(7, 0, << 1119 SOS_X86_VIDEO_B << 1120 "Result=%d (if << 1121 eval_expression << 1122 << 1123 << 1124 << 1125 free_syntax_tree(syntax_tree); << 1126 sos_x86_videomem_printf(8, 0, << 1127 SOS_X86_VIDEO_B << 1128 "Done (un-alloc << 1129 } << 1130 else << 1131 { << 1132 sos_x86_videomem_printf(6, 0, << 1133 SOS_X86_VIDEO_B << 1134 "Error in parsi << 1135 } << 1136 << 1137 /* << 1138 * Run some demand-paging tests << 1139 */ 424 */ 1140 test_demand_paging(234567, 500); !! 425 1141 !! 426 /* Initialize kernel thread subsystem */ >> 427 sos_thread_subsystem_setup(bootstrap_stack_bottom, >> 428 bootstrap_stack_size); 1142 429 1143 /* !! 430 /* Initialize the scheduler */ 1144 * Create an un-resolved page fault, which !! 431 sos_sched_subsystem_setup(); 1145 * handler print the backtrace. << 1146 */ << 1147 test_backtrace(6, 0xdeadbeef, bootstrap_sta << 1148 432 1149 /* !! 433 /* Declare the IDLE thread */ 1150 * System should be halted BEFORE here ! !! 434 SOS_ASSERT_FATAL(sos_create_kernel_thread("idle", idle_thread, NULL) != NULL); 1151 */ << 1152 435 >> 436 /* Enabling the HW interrupts here, this will make the timer HW >> 437 interrupt call the scheduler */ >> 438 asm volatile ("sti\n"); 1153 439 1154 /* An operatig system never ends */ << 1155 for (;;) << 1156 { << 1157 /* Remove this instruction if you get a << 1158 exception (old 80386 CPU) */ << 1159 asm("hlt\n"); << 1160 440 1161 continue; !! 441 /* Now run some Kernel threads just for fun ! */ 1162 } !! 442 extern void MouseSim(); >> 443 MouseSim(); >> 444 test_thread(); >> 445 >> 446 /* >> 447 * We can safely exit from this function now, for there is already >> 448 * an idle Kernel thread ready to make the CPU busy working... >> 449 * >> 450 * However, we must EXPLICITELY call sos_thread_exit() because a >> 451 * simple "return" will return nowhere ! Actually this first thread >> 452 * was initialized by the Grub bootstrap stage, at a time when the >> 453 * word "thread" did not exist. This means that the stack was not >> 454 * setup in order for a return here to call sos_thread_exit() >> 455 * automagically. Hence we must call it manually. This is the ONLY >> 456 * kernel thread where we must do this manually. >> 457 */ >> 458 sos_bochs_printf("Bye from primary thread !\n"); >> 459 sos_thread_exit(); >> 460 SOS_FATAL_ERROR("No trespassing !"); 1163 } 461 }
| [ source navigation ] | [ diff markup ] | [ identifier search ] | [ general search ] |