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
137
|
/*
* Copyright (C) 2012 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#define ADK_INTERNAL
#include "fwk.h"
#include "coop.h"
#include "dbg.h"
#define NUM_REGS 10 //r4-r11,sp,pc
typedef struct CoopTask{
uint32_t regs[NUM_REGS];
void* stackPtr;
struct CoopTask* next;
struct CoopTask* prev;
}CoopTask;
CoopTask* cur = 0;
static CoopTask* __attribute__((noinline)) coopSchedule(char taskDied){
CoopTask* next = cur->next;
if(taskDied){ //delete task
if(next == cur){
dbgPrintf("Last task died. Halting.\n");
while(1);
}
if(cur->stackPtr) free(cur->stackPtr);
cur->next->prev = cur->prev;
cur->prev->next = cur->next;
free(cur);
}
cur = next;
return next;
}
static void __attribute__((naked)) __attribute__((noinline)) coopTaskStart(void){
asm(
"mov r0, r5;"
"blx r4;"
"mov r0, #1;"
"bl coopSchedule;"
"ldmia r0, {r4-r12,lr};"
"mov sp, r12;"
"bx lr;"
);
}
static void __attribute__((naked)) __attribute__((noinline)) coopDoYield(CoopTask* curTask){
asm(
"mov r12, sp;"
"stmia r0, {r4-r12,lr};"
"mov r0, #0;"
"bl coopSchedule;"
"ldmia r0, {r4-r12,lr};"
"mov sp, r12;"
"bx lr;"
);
}
int coopInit(void){
CoopTask* task;
task = malloc(sizeof(CoopTask));
if(!task) return 0;
task->next = task;
task->prev = task;
task->stackPtr = 0;
cur = task;
return 1;
}
int coopSpawn(CoopTaskF taskF, void* taskData, uint32_t stackSz){
uint8_t* stack;
CoopTask* task;
stack = malloc(stackSz);
if(!stack) return 0;
task = malloc(sizeof(CoopTask));
if(!task){
free(stack);
return 0;
}
task->stackPtr = stack;
task->regs[0] = (uint32_t)taskF;
task->regs[1] = (uint32_t)taskData;
task->regs[8] = ((uint32_t)(stack + stackSz)) &~ 7;
task->regs[9] = (uint32_t)&coopTaskStart;
task->prev = cur;
task->next = cur->next;
cur->next->prev = task;
cur->next = task;
//these are here so compiler is sure that function is referenced in both variants (cancels a warning)
if(stackSz == 0xFFFFFFFF) coopSchedule(0);
if(stackSz == 0xFFFFFFFE) coopSchedule(1);
return 1;
}
void coopYield(void){
coopDoYield(cur);
}
void sleep(uint32_t ms)
{
uint64_t a = fwkGetUptime();
while (fwkGetUptime() - a < ms)
coopYield();
}
|
