1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
|
/**
* @file task.c
* Provides multitasking functionality
*
* Copyright (C) 2018 Clyne Sullivan
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
#include <task.h>
#include <heap.h>
#include <stm32l476xx.h>
#include <string.h>
task_t *current;
static uint8_t task_disable = 0;
void task_hold(uint8_t hold)
{
if (hold != 0)
task_disable++;
else if (task_disable > 0)
task_disable--;
}
void task_exit(void)
{
free(current->stack);
// TODO remove from chain?
// hopefully this is fine...
while (1); // bye
}
task_t *task_create(void (*code)(void), uint32_t stackSize)
{
task_t *t = (task_t *)malloc(sizeof(task_t));
t->next = 0;
t->stack = (uint32_t *)malloc(stackSize);
void *sp = (uint8_t *)t->stack + stackSize - 68; // excep. stack + regs
t->sp = sp;
for (uint8_t i = 0; i < 14; i++)
t->sp[i] = 0;
t->sp[8] = 0xFFFFFFFD;
t->sp[14] = 0xFFFFFFFD;
t->sp[15] = (uint32_t)code;
t->sp[16] = 0x01000000;
return t;
}
void task_init(void (*init)(void))
{
current = task_create(init, 4096);
current->next = current;
task_disable = 0;
// bit 0 - priv, bit 1 - psp/msp
asm("\
msr psp, %0; \
mrs r0, control; \
orr r0, r0, #2; \
cpsie i; \
msr control, r0; \
isb; \
bx %1; \
" :: "r" (current->sp), "r" (init));
}
void task_start(void (*task)(void), uint16_t stackSize)
{
task_hold(1);
task_t *t = task_create(task, stackSize);
t->next = current->next;
current->next = t;
task_hold(0);
}
/*int fork_ret(void)
{
return 1;
}
int fork(void)
{
void (*pc)(void) = (void (*)(void))((uint32_t)fork_ret & ~(3));
task_hold(1);
// duplicate task info
alloc_t *heapInfo = (alloc_t *)(current->stack - 2);
task_t *t = task_create(pc, heapInfo->size);
memcpy(t->stack, current->stack, heapInfo->size);
uint32_t *sp;
asm("mov %0, sp" : "=r" (sp));
t->sp = t->stack + (sp - current->stack);
t->next = current->next;
current->next = t;
current = t;
task_hold(0);
SCB->ICSR |= SCB_ICSR_PENDSVSET_Msk;
return 0;
}*/
__attribute__ ((naked))
void PendSV_Handler(void)
{
if (task_disable != 0)
asm("bx lr");
asm("\
mrs r0, psp; \
isb; \
ldr r1, =current; \
ldr r2, [r1]; \
stmdb r0!, {r4-r11, r14}; \
str r0, [r2, #8]; \
ldr r0, [r2, #0]; \
str r0, [r1]; \
ldr r2, [r1]; \
ldr r0, [r2, #8]; \
ldmia r0!, {r4-r11, r14}; \
msr psp, r0; \
bx lr; \
");
}
|
