2 * Copyright © 2009 Keith Packard <keithp@keithp.com>
4 * This program is free software; you can redistribute it and/or modify
5 * it under the terms of the GNU General Public License as published by
6 * the Free Software Foundation; version 2 of the License.
8 * This program is distributed in the hope that it will be useful, but
9 * WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 * General Public License for more details.
13 * You should have received a copy of the GNU General Public License along
14 * with this program; if not, write to the Free Software Foundation, Inc.,
15 * 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA.
20 #define AO_NO_TASK_INDEX 0xff
22 __xdata struct ao_task * __xdata ao_tasks[AO_NUM_TASKS];
23 __data uint8_t ao_num_tasks;
24 __data uint8_t ao_cur_task_index;
25 __xdata struct ao_task *__data ao_cur_task;
28 ao_add_task(__xdata struct ao_task * task, void (*start)(void), __code char *name) __reentrant
30 uint8_t __xdata *stack;
33 if (ao_num_tasks == AO_NUM_TASKS)
34 ao_panic(AO_PANIC_NO_TASK);
35 for (task_id = 1; task_id != 0; task_id++) {
36 for (t = 0; t < ao_num_tasks; t++)
37 if (ao_tasks[t]->task_id == task_id)
39 if (t == ao_num_tasks)
42 ao_tasks[ao_num_tasks++] = task;
43 task->task_id = task_id;
46 * Construct a stack frame so that it will 'return'
47 * to the start of the task
51 *stack++ = ((uint16_t) start); /* 0 */
52 *stack++ = ((uint16_t) start) >> 8; /* 1 */
54 /* and the stuff saved by ao_switch */
55 *stack++ = 0; /* 2 acc */
56 *stack++ = 0x80; /* 3 IE */
72 for (t = 0; t < 13; t++)
75 task->stack_count = 17;
79 /* Task switching function. This must not use any stack variables */
84 /* Save current context */
86 /* Push ACC first, as when restoring the context it must be restored
87 * last (it is used to set the IE register). */
89 /* Store the IE register then enable interrupts. */
110 if (ao_cur_task_index == AO_NO_TASK_INDEX)
111 ao_cur_task_index = ao_num_tasks-1;
115 __data uint8_t *stack_ptr;
116 __xdata uint8_t *save_ptr;
117 /* Save the current stack */
118 stack_len = SP - (AO_STACK_START - 1);
119 ao_cur_task->stack_count = stack_len;
120 stack_ptr = (uint8_t __data *) AO_STACK_START;
121 save_ptr = (uint8_t __xdata *) ao_cur_task->stack;
123 *save_ptr++ = *stack_ptr++;
127 /* Empty the stack; might as well let interrupts have the whole thing */
128 SP = AO_STACK_START - 1;
130 /* Find a task to run. If there isn't any runnable task,
131 * this loop will run forever, which is just fine
134 __pdata uint8_t ao_next_task_index = ao_cur_task_index;
136 ++ao_next_task_index;
137 if (ao_next_task_index == ao_num_tasks)
138 ao_next_task_index = 0;
140 ao_cur_task = ao_tasks[ao_next_task_index];
141 if (ao_cur_task->wchan == NULL) {
142 ao_cur_task_index = ao_next_task_index;
146 /* Check if the alarm is set for a time which has passed */
147 if (ao_cur_task->alarm &&
148 (int16_t) (ao_time() - ao_cur_task->alarm) >= 0) {
149 ao_cur_task_index = ao_next_task_index;
153 /* Enter lower power mode when there isn't anything to do */
154 if (ao_next_task_index == ao_cur_task_index)
161 __data uint8_t *stack_ptr;
162 __xdata uint8_t *save_ptr;
164 /* Restore the old stack */
165 stack_len = ao_cur_task->stack_count;
166 SP = AO_STACK_START - 1 + stack_len;
168 stack_ptr = (uint8_t __data *) AO_STACK_START;
169 save_ptr = (uint8_t __xdata *) ao_cur_task->stack;
171 *stack_ptr++ = *save_ptr++;
189 /* The next byte of the stack is the IE register. Only the global
190 enable bit forms part of the task context. Pop off the IE then set
191 the global enable bit to match that of the stored IE register. */
199 /* Finally pop off the ACC, which was the first register saved. */
206 ao_sleep(__xdata void *wchan)
209 ao_cur_task->wchan = wchan;
212 ao_cur_task->alarm = 0;
213 if (ao_cur_task->wchan) {
214 ao_cur_task->wchan = NULL;
221 ao_wakeup(__xdata void *wchan)
225 for (i = 0; i < ao_num_tasks; i++)
226 if (ao_tasks[i]->wchan == wchan)
227 ao_tasks[i]->wchan = NULL;
231 ao_alarm(uint16_t delay)
233 /* Make sure we sleep *at least* delay ticks, which means adding
234 * one to account for the fact that we may be close to the next tick
236 if (!(ao_cur_task->alarm = ao_time() + delay + 1))
237 ao_cur_task->alarm = 1;
241 ao_exit(void) __critical
245 for (i = ao_cur_task_index; i < ao_num_tasks; i++)
246 ao_tasks[i] = ao_tasks[i+1];
247 ao_cur_task_index = AO_NO_TASK_INDEX;
249 /* we'll never get back here */
257 __xdata struct ao_task *task;
259 for (i = 0; i < ao_num_tasks; i++) {
261 pc_loc = task->stack_count - 17;
262 printf("%12s: wchan %04x pc %04x\n",
264 (int16_t) task->wchan,
265 (task->stack[pc_loc]) | (task->stack[pc_loc+1] << 8));
270 ao_start_scheduler(void)
272 ao_cur_task_index = AO_NO_TASK_INDEX;