1 /* 2 * Task handling. 3 * 4 * Copyright (C) 2015, 2016 Paul Boddie <paul@boddie.org.uk> 5 * 6 * This program is free software: you can redistribute it and/or modify 7 * it under the terms of the GNU General Public License as published by 8 * the Free Software Foundation, either version 3 of the License, or 9 * (at your option) any later version. 10 * 11 * This program is distributed in the hope that it will be useful, 12 * but WITHOUT ANY WARRANTY; without even the implied warranty of 13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 * GNU General Public License for more details. 15 * 16 * You should have received a copy of the GNU General Public License 17 * along with this program. If not, see <http://www.gnu.org/licenses/>. 18 */ 19 20 #include "cpu.h" 21 #include "paging.h" 22 #include "tasks.h" 23 24 /* Task tables and data. */ 25 26 static u32 stack_pointers[max_tasks]; 27 static u32 registers[max_tasks][32]; 28 29 u8 current_task; 30 u32 *current_stack_pointer; 31 u32 *current_registers; 32 33 /* Address locations and paging configuration. */ 34 35 const u32 stack_start = 0x00080000; 36 const u32 stack_size = 0x00002000; 37 const u32 pagesize = 4 * 1024; 38 39 /* A reference to locations for the symbol tables. */ 40 41 extern u32 _got_start, _got_copy_start, _got_copy_end; 42 43 /* A reference to the start of the payload. */ 44 45 extern u32 _payload_start; 46 47 /* Task management functions. */ 48 49 void init_tasks() 50 { 51 current_task = 1; 52 init_task(); 53 } 54 55 void init_task() 56 { 57 current_stack_pointer = &stack_pointers[current_task]; 58 current_registers = registers[current_task]; 59 } 60 61 void start_task(unsigned short task, void (*function)(), u32 args[], u8 nargs) 62 { 63 u32 virtual, physical, address; 64 65 /* 66 Each task employs a stack at a multiple of the given start address in 67 physical memory, but at the same address in virtual memory. 68 */ 69 70 virtual = stack_start; 71 physical = stack_start - stack_size * task; 72 73 init_page_table(page_table_start, virtual - pagesize * 2, physical - pagesize * 2, pagesize, 0x1e, task); 74 75 /* 76 Subtract from the stack pointer to prevent the called function from 77 reaching into unmapped memory. 78 */ 79 80 stack_pointers[task] = virtual - 12; 81 82 /* 83 Set the registers for the new task, initialising the global pointer and 84 return address. 85 */ 86 87 init_registers(registers[task], (u32) &_got_copy_start, function, args, nargs); 88 89 /* Map the global object table for the task. */ 90 91 init_page_table(page_table_start, (u32) &_got_start & 0x7fffffff, (u32) &_got_copy_start & 0x7fffffff, pagesize, 0x1e, task); 92 93 /* Map all shared pages for the task. */ 94 95 for (address = (u32) &_payload_start; address < (u32) &_got_start; address += pagesize * 2) 96 { 97 init_page_table(page_table_start, address & 0x7fffffff, address & 0x7fffffff, pagesize, 0x1e, task); 98 } 99 100 for (address = (u32) &_got_copy_end + pagesize * 2; address < 0x82000000; address += pagesize * 2) 101 { 102 init_page_table(page_table_start, address & 0x7fffffff, address & 0x7fffffff, pagesize, 0x1e, task); 103 } 104 } 105 106 void start_task_now() 107 { 108 invoke_task(current_task, current_registers, current_stack_pointer); 109 } 110 111 void switch_task() 112 { 113 /* Switch the current task. */ 114 115 current_task++; 116 if (current_task == max_tasks) current_task = 1; 117 init_task(); 118 }