9 struct task tasks
[MAXTASKS
] = {0};
12 int task_register(int fd
)
16 for(ct
= 0; ct
<MAXTASKS
; ct
++)
20 die("Trying to add too much tasks...\n");
22 memset(&tasks
[ct
], 0, sizeof(struct task
));
25 tasks
[ct
].interval
= 256*c
;
27 tasks
[ct
].interval
+= c
;
30 tasks
[ct
].tlen
= 256*c
;
33 if(tasks
[ct
].tlen
> MAXTASKSIZE
)
34 die("Task is too long: %d\n", tasks
[ct
].tlen
);
36 for(int i
= 0; i
<tasks
[ct
].tlen
; i
++){
37 debug("Read %d\n", i
);
38 read(fd
, tasks
[ct
].bc
+i
, 1);
39 debug("t[][%i]: %d\n", i
,
42 //Return the task number for later removal
43 debug("Received a task of length %d\n", tasks
[ct
].tlen
);
44 tasks
[ct
].used
= true;
48 void task_delete(int fd
)
51 tasks
[c
].used
= false;
54 struct task
*task_get(int num
)
56 return tasks
[num
].used
? &tasks
[num
] : NULL
;