8 struct task tasks
[MAXTASKS
];
12 memset(&tasks
, 0, sizeof(struct task
)*MAXTASKS
);
15 void task_register(void)
20 for(ct
= 0; ct
<MAXTASKS
; ct
++)
24 die("Trying to add too much tasks...");
26 memset(&tasks
[ct
], 0, sizeof(struct task
));
28 tasks
[ct
].interval
= read16();
29 debug("interval: %d\n", tasks
[ct
].interval
);
32 if(is_interrupt_task(&tasks
[ct
])) {
37 tasks
[ct
].tlen
= read16();
38 debug("task interval: %d, length: %d\n",
39 tasks
[ct
].interval
, tasks
[ct
].tlen
);
41 if(tasks
[ct
].tlen
> MAXTASKSIZE
)
42 die("Task is too long: %d", tasks
[ct
].tlen
);
44 for(i
= 0; i
<tasks
[ct
].tlen
; i
++){
45 tasks
[ct
].bc
[i
] = read_byte();
47 //Return the task number for later removal
48 debug("Received a task of length %d", tasks
[ct
].tlen
);
49 tasks
[ct
].used
= true;
50 tasks
[ct
].lastrun
= 0L;
57 bool is_interrupt_task(struct task
*t
)
59 return t
->interval
& (2 <<14);
62 bool had_interrupt(struct task
* t
)
64 //Not implemented yet...
69 void task_delete(void)
72 tasks
[c
].used
= false;
78 struct task
*task_get(int num
)
80 return tasks
[num
].used
? &tasks
[num
] : NULL
;