19,30 → 19,21 |
struct loader_task *l = (struct loader_task *)(arg); |
char tmp[20]; |
|
while((l->act_number) > act) { |
#ifdef TASK_OUTPUT |
sprintf(tmp,"X[%06d]",act); |
printf_xy((get_current_exec_task() % 5) * 9 + 34,get_current_exec_task() / 5 + 5, GREEN, tmp); |
#endif |
|
#ifdef TASK_OUTPUT |
sprintf(tmp,"X[%06d]",act); |
printf_xy((get_current_exec_task() % 5) * 9 + 34,get_current_exec_task() / 5 + 5, GREEN, tmp); |
#endif |
if (l->act_number > act+1) generic_set_next_activation(&l->act[act+1]); |
|
if (l->act_number > act+1) generic_set_next_activation(&l->act[act+1]); |
|
exec_cycles = (long long)(TIMESPEC2USEC(&l->exec[act])) * CALIBRATION_DELTA / cal_cycles; |
exec_cycles = (long long)(TIMESPEC2USEC(&l->exec[act])) * CALIBRATION_DELTA / cal_cycles; |
|
#ifdef TASK_OUTPUT |
sprintf(tmp,"X[%06d]",act); |
printf_xy((get_current_exec_task() % 5) * 9 + 34, get_current_exec_task() / 5 + 5, GREEN, tmp); |
#endif |
|
for (i=0;i<exec_cycles;i++) calibration_func(); |
for (i=0;i<exec_cycles;i++) calibration_func(); |
|
generic_task_endcycle(); |
generic_task_endcycle(); |
|
act++; |
act++; |
|
} |
|
return NULL; |
|
} |