-
Notifications
You must be signed in to change notification settings - Fork 345
/
Copy pathscheduler.c
380 lines (349 loc) · 12.5 KB
/
scheduler.c
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
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
/*
* This file is part of the MicroPython ESP32 project, https://github.com/loboris/MicroPython_ESP32_psRAM_LoBo
*
* The MIT License (MIT)
*
* Copyright (c) 2017 Damien P. George
* Copyright (c) 2018 LoBo (https://github.com/loboris)
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
* THE SOFTWARE.
*/
#include <stdio.h>
#include <string.h>
#include "py/runtime.h"
#include "py/objstr.h"
#if MICROPY_ENABLE_SCHEDULER
#define FREE_CBOBJECT_AFTER 0
#define MAX_CB_OBJECTS 64
#if FREE_CBOBJECT_AFTER
static mp_obj_t cb_objects[MAX_CB_OBJECTS];
#endif
// A variant of this is inlined in the VM at the pending exception check
void mp_handle_pending(void) {
if (MP_STATE_VM(sched_state) == MP_SCHED_PENDING) {
mp_uint_t atomic_state = MICROPY_BEGIN_ATOMIC_SECTION();
mp_obj_t obj = MP_STATE_VM(mp_pending_exception);
if (obj != MP_OBJ_NULL) {
MP_STATE_VM(mp_pending_exception) = MP_OBJ_NULL;
if (!mp_sched_num_pending()) {
MP_STATE_VM(sched_state) = MP_SCHED_IDLE;
}
MICROPY_END_ATOMIC_SECTION(atomic_state);
nlr_raise(obj);
}
mp_handle_pending_tail(atomic_state);
}
}
//-----------------------------------
void free_carg(mp_sched_carg_t *carg)
{
for (int i=0; i<MP_SCHED_CTYPE_MAX_ITEMS; i++) {
if (carg->entry[i]) {
if (carg->type == MP_SCHED_ENTRY_TYPE_CARG) {
free_carg((mp_sched_carg_t *)carg->entry[i]);
}
else {
mp_sched_carg_entry_t *entry = (mp_sched_carg_entry_t *)carg->entry[i];
if (entry->sval) {
free(entry->sval);
entry->sval = NULL;
}
}
free(carg->entry[i]);
carg->entry[i] = NULL;
}
}
free(carg);
carg = NULL;
}
//---------------------------------------------------------------------------------------------------------------------------
mp_sched_carg_t *make_carg_entry(mp_sched_carg_t *carg, int idx, uint8_t type, int val, const uint8_t *sval, const char *key)
{
if (idx >= MP_SCHED_CTYPE_MAX_ITEMS) {
free_carg(carg);
return NULL;
}
if (carg->entry[idx]) {
free_carg(carg);
return NULL;
}
carg->entry[idx] = calloc(sizeof(mp_sched_carg_entry_t), 1);
if (carg->entry[idx] == NULL) {
free_carg(carg);
return NULL;
}
mp_sched_carg_entry_t *entry = (mp_sched_carg_entry_t *)carg->entry[idx];
entry->type = type;
if (key) sprintf(entry->key, key);
if (sval) {
entry->ival = val;
entry->sval = malloc(val);
if (entry->sval == NULL) {
free_carg(carg);
return NULL;
}
memcpy(entry->sval, sval, val);
}
else {
entry->ival = val;
}
carg->n++;
return carg;
}
//------------------------------------------------------------------------------------------
mp_sched_carg_t *make_carg_entry_carg(mp_sched_carg_t *carg, int idx, mp_sched_carg_t *darg)
{
carg->entry[idx] = calloc(sizeof(mp_sched_carg_entry_t), 1);
if (carg->entry[idx] == NULL) {
free_carg(carg);
return NULL;
}
mp_sched_carg_entry_t *entry = (mp_sched_carg_entry_t *)carg->entry[idx];
entry->type = MP_SCHED_ENTRY_TYPE_CARG;
entry->carg = darg;
carg->n++;
return carg;
}
//-----------------------------------
mp_sched_carg_t *make_cargs(int type)
{
// Create scheduler function arguments
mp_sched_carg_t *carg = calloc(sizeof(mp_sched_carg_t), 1);
if (carg == NULL) return NULL;
carg->type = type;
carg->n = 0;
return carg;
}
//----------------------------------------------------------------------------------
static mp_obj_t make_arg_from_carg(mp_sched_carg_t *carg, int level, int *n_cbitems)
{
mp_obj_t arg = mp_const_none;
if (carg->type == MP_SCHED_CTYPE_DICT) {
//dictionary
mp_obj_dict_t *dct = mp_obj_new_dict(0);
for (int i = 0; i < carg->n; i++) {
mp_obj_t val;
mp_sched_carg_entry_t *entry = (mp_sched_carg_entry_t *)carg->entry[i];
if (entry->type == MP_SCHED_ENTRY_TYPE_INT) {
mp_obj_dict_store(dct, mp_obj_new_str_copy(&mp_type_str, (const byte*)entry->key, strlen(entry->key)), mp_obj_new_int(entry->ival));
}
else if (entry->type == MP_SCHED_ENTRY_TYPE_BOOL) {
mp_obj_dict_store(dct, mp_obj_new_str_copy(&mp_type_str, (const byte*)entry->key, strlen(entry->key)), mp_obj_new_bool(entry->ival));
}
else if (entry->type == MP_SCHED_ENTRY_TYPE_FLOAT) {
val = mp_obj_new_float(entry->fval);
mp_obj_dict_store(dct, mp_obj_new_str_copy(&mp_type_str, (const byte*)entry->key, strlen(entry->key)), val);
#if FREE_CBOBJECT_AFTER
if (*n_cbitems < (MAX_CB_OBJECTS-1)) cb_objects[(*n_cbitems)++] = val;
#endif
}
else if (entry->type == MP_SCHED_ENTRY_TYPE_STR) {
val = mp_obj_new_str_copy(&mp_type_str, (const byte*)entry->sval, entry->ival);
mp_obj_dict_store(dct, mp_obj_new_str_copy(&mp_type_str, (const byte*)entry->key, strlen(entry->key)), val);
#if FREE_CBOBJECT_AFTER
if (*n_cbitems < (MAX_CB_OBJECTS-1)) cb_objects[(*n_cbitems)++] = val;
#endif
}
else if (entry->type == MP_SCHED_ENTRY_TYPE_BYTES) {
val = mp_obj_new_bytes((const byte*)entry->sval, entry->ival);
mp_obj_dict_store(dct, mp_obj_new_str_copy(&mp_type_str, (const byte*)entry->key, strlen(entry->key)), val);
#if FREE_CBOBJECT_AFTER
if (*n_cbitems < (MAX_CB_OBJECTS-1)) cb_objects[(*n_cbitems)++] = val;
#endif
}
else if ((level == 0) && (entry->type == MP_SCHED_ENTRY_TYPE_CARG) && (strlen(entry->key) > 0) && (entry->carg)) {
mp_obj_t darg = make_arg_from_carg(entry->carg, 1, n_cbitems);
mp_obj_dict_store(dct, mp_obj_new_str_copy(&mp_type_str, (const byte*)entry->key, strlen(entry->key)), darg);
#if FREE_CBOBJECT_AFTER
if (*n_cbitems < (MAX_CB_OBJECTS-1)) cb_objects[(*n_cbitems)++] = darg;
#endif
}
}
arg = dct;
#if FREE_CBOBJECT_AFTER
cb_objects[(*n_cbitems)++] = arg;
#endif
}
else if (carg->type == MP_SCHED_CTYPE_TUPLE) {
//tuple
mp_obj_t tuple[carg->n];
for (int i = 0; i < carg->n; i++) {
mp_sched_carg_entry_t *entry = (mp_sched_carg_entry_t *)carg->entry[i];
if (entry->type == MP_SCHED_ENTRY_TYPE_INT) {
tuple[i] = mp_obj_new_int(entry->ival);
}
else if (entry->type == MP_SCHED_ENTRY_TYPE_BOOL) {
tuple[i] = mp_obj_new_bool(entry->ival);
}
else if (entry->type == MP_SCHED_ENTRY_TYPE_FLOAT) {
tuple[i] = mp_obj_new_float(entry->fval);
#if FREE_CBOBJECT_AFTER
if (*n_cbitems < (MAX_CB_OBJECTS-1)) cb_objects[(*n_cbitems)++] = tuple[i];
#endif
}
else if (entry->type == MP_SCHED_ENTRY_TYPE_STR) {
tuple[i] = mp_obj_new_str_copy(&mp_type_str, (const byte*)entry->sval, entry->ival);
#if FREE_CBOBJECT_AFTER
if (*n_cbitems < (MAX_CB_OBJECTS-1)) cb_objects[(*n_cbitems)++] = tuple[i];
#endif
}
else if (entry->type == MP_SCHED_ENTRY_TYPE_BYTES) {
tuple[i] = mp_obj_new_bytes((const byte*)entry->sval, entry->ival);
#if FREE_CBOBJECT_AFTER
if (*n_cbitems < (MAX_CB_OBJECTS-1)) cb_objects[(*n_cbitems)++] = tuple[i];
#endif
}
else if ((level == 0) && (entry->type == MP_SCHED_ENTRY_TYPE_CARG) && (entry->carg)) {
mp_obj_t darg = make_arg_from_carg(entry->carg, 1, n_cbitems);
tuple[i] = darg;
#if FREE_CBOBJECT_AFTER
if (*n_cbitems < (MAX_CB_OBJECTS-1)) cb_objects[(*n_cbitems)++] = tuple[i];
#endif
}
else tuple[i] = mp_const_none;
}
arg = mp_obj_new_tuple(carg->n, tuple);
#if FREE_CBOBJECT_AFTER
cb_objects[(*n_cbitems)++] = arg;
#endif
}
else {
// Simple type, single entry
mp_sched_carg_entry_t *entry = (mp_sched_carg_entry_t *)carg->entry[0];
if (entry->type == MP_SCHED_ENTRY_TYPE_INT) {
arg = mp_obj_new_int(entry->ival);
}
else if (entry->type == MP_SCHED_ENTRY_TYPE_BOOL) {
arg = mp_obj_new_bool(entry->ival);
}
else if (entry->type == MP_SCHED_ENTRY_TYPE_FLOAT) {
arg = mp_obj_new_float(entry->fval);
#if FREE_CBOBJECT_AFTER
cb_objects[(*n_cbitems)++] = arg;
#endif
}
else if (entry->type == MP_SCHED_ENTRY_TYPE_STR) {
arg = mp_obj_new_str_copy(&mp_type_str, (const byte*)entry->sval, entry->ival);
#if FREE_CBOBJECT_AFTER
cb_objects[(*n_cbitems)++] = arg;
#endif
}
else if (entry->type == MP_SCHED_ENTRY_TYPE_BYTES) {
arg = mp_obj_new_bytes((const byte*)entry->sval, entry->ival);
#if FREE_CBOBJECT_AFTER
cb_objects[(*n_cbitems)++] = arg;
#endif
}
}
// Free C-argument structure
free_carg(carg);
return arg;
}
// This function should only be called by mp_sched_handle_pending,
// or by the VM's inlined version of that function.
//---------------------------------------------------
void mp_handle_pending_tail(mp_uint_t atomic_state) {
MP_STATE_VM(sched_state) = MP_SCHED_LOCKED;
if (MP_STATE_VM(sched_sp) > 0) {
int n_cbitems = 0;
// get the first scheduled item from stack
mp_sched_item_t item = MP_STATE_VM(sched_stack)[0];
// Move other items down on stack
MP_STATE_VM(sched_sp)--;
int i = 0;
while (i < MP_STATE_VM(sched_sp)) {
memcpy(&(MP_STATE_VM(sched_stack)[i]), &(MP_STATE_VM(sched_stack)[i+1]), sizeof(mp_sched_item_t));
i++;
}
mp_obj_t arg = mp_const_none;
if (item.carg != NULL) {
// === C argument is present, create the MicroPython object argument from it ===
arg = make_arg_from_carg((mp_sched_carg_t *)item.carg, 0, &n_cbitems);
}
else arg = item.arg;
MICROPY_END_ATOMIC_SECTION(atomic_state);
// Execute callback function
mp_call_function_1_protected(item.func, arg);
#if FREE_CBOBJECT_AFTER
if (n_cbitems) {
// Free all allocated objects
for (int i=0; i < n_cbitems; i++) {
m_free(cb_objects[i]);
}
}
#endif
} else {
MICROPY_END_ATOMIC_SECTION(atomic_state);
}
mp_sched_unlock();
}
//------------------------
void mp_sched_lock(void) {
mp_uint_t atomic_state = MICROPY_BEGIN_ATOMIC_SECTION();
if (MP_STATE_VM(sched_state) < 0) {
--MP_STATE_VM(sched_state);
} else {
MP_STATE_VM(sched_state) = MP_SCHED_LOCKED;
}
MICROPY_END_ATOMIC_SECTION(atomic_state);
}
//--------------------------
void mp_sched_unlock(void) {
mp_uint_t atomic_state = MICROPY_BEGIN_ATOMIC_SECTION();
if (++MP_STATE_VM(sched_state) == 0) {
// vm became unlocked
if (MP_STATE_VM(mp_pending_exception) != MP_OBJ_NULL || mp_sched_num_pending()) {
MP_STATE_VM(sched_state) = MP_SCHED_PENDING;
} else {
MP_STATE_VM(sched_state) = MP_SCHED_IDLE;
}
}
MICROPY_END_ATOMIC_SECTION(atomic_state);
}
//-------------------------------------------------------------------
bool mp_sched_schedule_ex(mp_obj_t function, mp_obj_t arg, void *carg) {
mp_uint_t atomic_state = MICROPY_BEGIN_ATOMIC_SECTION();
bool ret;
if (MP_STATE_VM(sched_sp) < MICROPY_SCHEDULER_DEPTH) {
if (MP_STATE_VM(sched_state) == MP_SCHED_IDLE) {
MP_STATE_VM(sched_state) = MP_SCHED_PENDING;
}
MP_STATE_VM(sched_stack)[MP_STATE_VM(sched_sp)].func = function;
MP_STATE_VM(sched_stack)[MP_STATE_VM(sched_sp)].arg = arg;
MP_STATE_VM(sched_stack)[MP_STATE_VM(sched_sp)].carg = carg;
++MP_STATE_VM(sched_sp);
ret = true;
} else {
// schedule stack is full
ret = false;
}
MICROPY_END_ATOMIC_SECTION(atomic_state);
return ret;
}
#else // MICROPY_ENABLE_SCHEDULER
// A variant of this is inlined in the VM at the pending exception check
//----------------------------
void mp_handle_pending(void) {
if (MP_STATE_VM(mp_pending_exception) != MP_OBJ_NULL) {
mp_obj_t obj = MP_STATE_VM(mp_pending_exception);
MP_STATE_VM(mp_pending_exception) = MP_OBJ_NULL;
nlr_raise(obj);
}
}
#endif // MICROPY_ENABLE_SCHEDULER