Subversion Repositories shark

Compare Revisions

Ignore whitespace Rev 1122 → Rev 1123

/demos/trunk/first/edfstar.c
18,11 → 18,11
 
/**
------------
CVS : $Id: edfstar.c,v 1.3 2002-11-11 08:17:59 pj Exp $
CVS : $Id: edfstar.c,v 1.4 2003-01-07 17:10:16 pj Exp $
 
File: $File$
Revision: $Revision: 1.3 $
Last update: $Date: 2002-11-11 08:17:59 $
Revision: $Revision: 1.4 $
Last update: $Date: 2003-01-07 17:10:16 $
------------
**/
 
133,7 → 133,7
if ((first = iq_query_first(&lev->ready)) != lev->activated) {
if (lev->activated != NIL)
level_table[ lev->scheduling_level ]->
guest_end(lev->scheduling_level, lev->activated);
private_extract(lev->scheduling_level, lev->activated);
 
lev->activated = first;
 
142,7 → 142,7
budget_task_default_model(b, lev->budget);
 
level_table[ lev->scheduling_level ]->
guest_create(lev->scheduling_level, first, (TASK_MODEL *)&b);
private_insert(lev->scheduling_level, first, (TASK_MODEL *)&b);
}
}
}
149,19 → 149,17
 
static void EDFSTAR_timer_deadline(void *par);
 
static void EDFSTAR_internal_activate(EDFSTAR_level_des *lev, PID p)
static void EDFSTAR_internal_activate(EDFSTAR_level_des *lev, PID p,
struct timespec *t)
{
struct timespec temp;
 
#ifdef EDFSTAR_DEBUG
edfstar_printf("(E:iact)");
#endif
 
TIMESPEC_ASSIGN(&temp, &proc_table[p].request_time);
ADDUSEC2TIMESPEC(lev->period[p], &temp);
ADDUSEC2TIMESPEC(lev->period[p], t);
 
*iq_query_timespec(p, &lev->ready) = temp;
lev->deadline_timespec[p] = temp;
*iq_query_timespec(p, &lev->ready) = *t;
lev->deadline_timespec[p] = *t;
 
/* Insert task in the correct position */
proc_table[p].status = EDFSTAR_READY;
174,18 → 172,6
EDFSTAR_check_preemption(lev);
}
 
static char *EDFSTAR_status_to_a(WORD status)
{
if (status < MODULE_STATUS_BASE)
return status_to_a(status);
 
switch (status) {
case EDFSTAR_READY : return "EDFSTAR_Ready";
case EDFSTAR_IDLE : return "EDFSTAR_Idle";
default : return "EDFSTAR_Unknown";
}
}
 
static void EDFSTAR_timer_deadline(void *par)
{
PID p = (PID) par;
203,10 → 189,8
// edfstar_printf2("I%d",p);
#endif
/* set the request time */
proc_table[p].request_time = *iq_query_timespec(p, &lev->ready);
EDFSTAR_internal_activate(lev,p,iq_query_timespec(p, &lev->ready));
 
EDFSTAR_internal_activate(lev,p);
 
event_need_reschedule();
break;
 
245,104 → 229,21
kern_raise(XDEADLINE_MISS,p);
}
 
static int EDFSTAR_level_accept_task_model(LEVEL l, TASK_MODEL *m)
static int EDFSTAR_public_create(LEVEL l, PID p, TASK_MODEL *m)
{
#ifdef EDFSTAR_DEBUG
edfstar_printf("(E:lacct)");
#endif
 
if (m->pclass == HARD_PCLASS || m->pclass == (HARD_PCLASS | l)) {
HARD_TASK_MODEL *h = (HARD_TASK_MODEL *)m;
 
if (h->wcet && h->mit && h->periodicity == PERIODIC)
return 0;
}
 
return -1;
}
 
static int EDFSTAR_level_accept_guest_model(LEVEL l, TASK_MODEL *m)
{
#ifdef EDFSTAR_DEBUG
edfstar_printf("(E:laccg)");
#endif
 
if (m->pclass == JOB_PCLASS || m->pclass == (JOB_PCLASS | l))
return 0;
else
return -1;
}
 
 
static char *onoff(int i)
{
if (i)
return "On ";
else
return "Off";
}
 
static void EDFSTAR_level_status(LEVEL l)
{
EDFSTAR_level_des *lev = (EDFSTAR_level_des *)(level_table[l]);
PID p = iq_query_first(&lev->ready);
struct timespec temp;
kern_printf("Budget number : %u\n", lev->budget);
kern_printf("Master level : %u\n", lev->scheduling_level);
kern_printf("Active PID : %u\n", lev->activated);
while (p != NIL) {
if ((proc_table[p].pclass) == JOB_PCLASS)
kern_printf("Pid: %2d (GUEST)\n", p);
else {
temp = *iq_query_timespec(p, &lev->ready);
kern_printf("Pid: %2d Name: %10s %s: %9ld Dline: %9ld.%6ld Stat: %s\n",
p,
proc_table[p].name,
"Period ",
lev->period[p],
temp.tv_sec,
temp.tv_nsec/1000,
EDFSTAR_status_to_a(proc_table[p].status));
p = iq_query_next(p, &lev->ready);
}
}
for (p=0; p<MAX_PROC; p++)
if (proc_table[p].task_level == l
&& proc_table[p].status != EDFSTAR_READY
&& proc_table[p].status != FREE ) {
temp = *iq_query_timespec(p, &lev->ready);
kern_printf("Pid: %2d Name: %10s %s: %9ld Dline: %9ld.%6ld Stat: %s\n",
p,
proc_table[p].name,
"Period ",
lev->period[p],
temp.tv_sec,
temp.tv_nsec/1000,
EDFSTAR_status_to_a(proc_table[p].status));
}
}
 
/* The scheduler only gets the first task in the queue */
static PID EDFSTAR_level_scheduler(LEVEL l)
{
//EDFSTAR_level_des *lev = (EDFSTAR_level_des *)(level_table[l]);
/* if the EDFSTAR_task_create is called, then the pclass must be a
valid pclass. */
HARD_TASK_MODEL *h;
 
return NIL;
}
if (m->pclass != HARD_PCLASS) return -1;
if (m->level != 0 && m->level != l) return -1;
h = (HARD_TASK_MODEL *)m;
if (!h->wcet || !h->mit || h->periodicity != PERIODIC) return -1;
/* now we know that m is a valid model */
 
static int EDFSTAR_task_create(LEVEL l, PID p, TASK_MODEL *m)
{
EDFSTAR_level_des *lev = (EDFSTAR_level_des *)(level_table[l]);
 
/* if the EDFSTAR_task_create is called, then the pclass must be a
valid pclass. */
HARD_TASK_MODEL *h = (HARD_TASK_MODEL *)m;
 
#ifdef EDFSTAR_DEBUG
edfstar_printf("(E:tcr)");
#endif
363,23 → 264,19
return 0; /* OK, also if the task cannot be guaranteed... */
}
 
static void EDFSTAR_task_detach(LEVEL l, PID p)
static int EDFSTAR_task_eligible(LEVEL l, PID p)
{
#ifdef EDFSTAR_DEBUG
edfstar_printf2("(E:tdt)");
#endif
}
EDFSTAR_level_des *lev = (EDFSTAR_level_des *)(level_table[l]);
 
static int EDFSTAR_task_eligible(LEVEL l, PID p)
{
#ifdef EDFSTAR_DEBUG
edfstar_printf2("(E:eli)");
#endif
 
return 0; /* if the task p is chosen, it is always eligible */
return level_table[ lev->scheduling_level ]->
private_eligible(lev->scheduling_level,p);
}
 
static void EDFSTAR_task_dispatch(LEVEL l, PID p, int nostop)
static void EDFSTAR_public_dispatch(LEVEL l, PID p, int nostop)
{
EDFSTAR_level_des *lev = (EDFSTAR_level_des *)(level_table[l]);
 
392,10 → 289,10
#endif
 
level_table[ lev->scheduling_level ]->
guest_dispatch(lev->scheduling_level,p,nostop);
private_dispatch(lev->scheduling_level,p,nostop);
}
 
static void EDFSTAR_task_epilogue(LEVEL l, PID p)
static void EDFSTAR_public_epilogue(LEVEL l, PID p)
{
EDFSTAR_level_des *lev = (EDFSTAR_level_des *)(level_table[l]);
 
417,14 → 314,15
#endif
 
level_table[ lev->scheduling_level ]->
guest_epilogue(lev->scheduling_level,p);
private_epilogue(lev->scheduling_level,p);
 
proc_table[p].status = EDFSTAR_READY;
}
 
static void EDFSTAR_task_activate(LEVEL l, PID p)
static void EDFSTAR_public_activate(LEVEL l, PID p)
{
EDFSTAR_level_des *lev = (EDFSTAR_level_des *)(level_table[l]);
struct timespec t;
 
#ifdef EDFSTAR_DEBUG
edfstar_printf("(E:act)");
438,9 → 336,9
return;
}
 
ll_gettime(TIME_EXACT, &proc_table[p].request_time);
kern_gettime(&t);
 
EDFSTAR_internal_activate(lev,p);
EDFSTAR_internal_activate(lev,p, &t);
 
/* Set the deadline timer */
lev->deadline_timer[p] = kern_event_post(&lev->deadline_timespec[p],
449,7 → 347,7
 
}
 
static void EDFSTAR_task_insert(LEVEL l, PID p)
static void EDFSTAR_public_unblock(LEVEL l, PID p)
{
EDFSTAR_level_des *lev = (EDFSTAR_level_des *)(level_table[l]);
 
465,7 → 363,7
EDFSTAR_check_preemption(lev);
}
 
static void EDFSTAR_task_extract(LEVEL l, PID p)
static void EDFSTAR_public_block(LEVEL l, PID p)
{
EDFSTAR_level_des *lev = (EDFSTAR_level_des *)(level_table[l]);
 
481,7 → 379,7
EDFSTAR_check_preemption(lev);
}
 
static void EDFSTAR_task_endcycle(LEVEL l, PID p)
static int EDFSTAR_public_message(LEVEL l, PID p, void *m)
{
EDFSTAR_level_des *lev = (EDFSTAR_level_des *)(level_table[l]);
struct timespec temp;
493,7 → 391,7
/* we call guest_end directly here because the same task may
be reinserted in the queue before calling the preemption check! */
level_table[ lev->scheduling_level ]->
guest_end(lev->scheduling_level,p);
private_extract(lev->scheduling_level,p);
lev->activated = NIL;
 
iq_extract(p,&lev->ready);
510,9 → 408,9
lev->nact[p]--;
 
/* see also EDFSTAR_timer_deadline */
ll_gettime(TIME_EXACT, &proc_table[p].request_time);
kern_gettime(&temp);
 
EDFSTAR_internal_activate(lev,p);
EDFSTAR_internal_activate(lev,p, &temp);
 
/* check if the deadline has already expired */
temp = *iq_query_timespec(p, &lev->ready);
519,7 → 417,7
if (TIMESPEC_A_LT_B(&temp, &schedule_time)) {
/* count the deadline miss */
lev->dline_miss[p]++;
event_delete(lev->deadline_timer[p]);
kern_event_delete(lev->deadline_timer[p]);
}
 
}
535,14 → 433,19
EDFSTAR_check_preemption(lev);
 
/* when the deadline timer fire, it recognize the situation and set
correctly all the stuffs (like reactivation, request_time, etc... ) */
correctly all the stuffs (like reactivation, etc... ) */
}
#ifdef EDFSTAR_DEBUG
edfstar_printf(")");
#endif
 
jet_update_endcycle(); /* Update the Jet data... */
trc_logevent(TRC_ENDCYCLE,&exec_shadow); /* tracer stuff */
 
return 0;
}
 
static void EDFSTAR_task_end(LEVEL l, PID p)
static void EDFSTAR_public_end(LEVEL l, PID p)
{
EDFSTAR_level_des *lev = (EDFSTAR_level_des *)(level_table[l]);
 
558,7 → 461,7
iq_insertfirst(p,&freedesc);
if (lev->deadline_timer[p] != -1) {
event_delete(lev->deadline_timer[p]);
kern_event_delete(lev->deadline_timer[p]);
}
 
/* and finally, a preemption check! (it will also call guest_end) */
565,18 → 468,22
EDFSTAR_check_preemption(lev);
}
 
static void EDFSTAR_task_sleep(LEVEL l, PID p)
{ kern_raise(XINVALID_TASK,exec_shadow); }
 
/* Guest Functions
These functions manages a JOB_TASK_MODEL, that is used to put
a guest task in the EDFSTAR ready queue. */
 
static int EDFSTAR_guest_create(LEVEL l, PID p, TASK_MODEL *m)
static void EDFSTAR_private_insert(LEVEL l, PID p, TASK_MODEL *m)
{
EDFSTAR_level_des *lev = (EDFSTAR_level_des *)(level_table[l]);
JOB_TASK_MODEL *job = (JOB_TASK_MODEL *)m;
JOB_TASK_MODEL *job;
 
if (m->pclass != JOB_PCLASS || (m->level != 0 && m->level != l) ) {
kern_raise(XINVALID_TASK, p);
return;
}
 
job = (JOB_TASK_MODEL *)m;
 
/* if the EDFSTAR_guest_create is called, then the pclass must be a
valid pclass. */
 
589,47 → 496,15
 
if (job->noraiseexc)
lev->flag[p] = EDFSTAR_FLAG_NORAISEEXC;
else
else {
lev->flag[p] = 0;
lev->deadline_timer[p] = kern_event_post(iq_query_timespec(p, &lev->ready),
EDFSTAR_timer_guest_deadline,
(void *)p);
}
 
lev->period[p] = job->period;
 
/* there is no bandwidth guarantee at this level, it is performed
by the level that inserts guest tasks... */
 
return 0; /* OK, also if the task cannot be guaranteed... */
}
 
static void EDFSTAR_guest_detach(LEVEL l, PID p)
{
/* the EDFSTAR level doesn't introduce any dinamic allocated new field.
No guarantee is performed on guest tasks... so we don't have to reset
the NO_GUARANTEE FIELD */
}
 
static void EDFSTAR_guest_dispatch(LEVEL l, PID p, int nostop)
{
EDFSTAR_level_des *lev = (EDFSTAR_level_des *)(level_table[l]);
 
level_table[ lev->scheduling_level ]->
guest_dispatch(lev->scheduling_level,p,nostop);
}
 
static void EDFSTAR_guest_epilogue(LEVEL l, PID p)
{
EDFSTAR_level_des *lev = (EDFSTAR_level_des *)(level_table[l]);
 
/* the task has been preempted. it returns into the ready queue... */
level_table[ lev->scheduling_level ]->
guest_epilogue(lev->scheduling_level,p);
 
proc_table[p].status = EDFSTAR_READY;
}
 
static void EDFSTAR_guest_activate(LEVEL l, PID p)
{
EDFSTAR_level_des *lev = (EDFSTAR_level_des *)(level_table[l]);
 
/* Insert task in the correct position */
iq_timespec_insert(p,&lev->ready);
proc_table[p].status = EDFSTAR_READY;
637,39 → 512,30
/* check for preemption */
EDFSTAR_check_preemption(lev);
 
/* Set the deadline timer */
if (!(lev->flag[p] & EDFSTAR_FLAG_NORAISEEXC))
lev->deadline_timer[p] = kern_event_post(iq_query_timespec(p, &lev->ready),
EDFSTAR_timer_guest_deadline,
(void *)p);
 
/* there is no bandwidth guarantee at this level, it is performed
by the level that inserts guest tasks... */
}
 
static void EDFSTAR_guest_insert(LEVEL l, PID p)
static void EDFSTAR_private_dispatch(LEVEL l, PID p, int nostop)
{
EDFSTAR_level_des *lev = (EDFSTAR_level_des *)(level_table[l]);
 
/* Insert task in the correct position */
iq_timespec_insert(p,&lev->ready);
proc_table[p].status = EDFSTAR_READY;
 
/* and check for preemption! */
EDFSTAR_check_preemption(lev);
level_table[ lev->scheduling_level ]->
private_dispatch(lev->scheduling_level,p,nostop);
}
 
static void EDFSTAR_guest_extract(LEVEL l, PID p)
static void EDFSTAR_private_epilogue(LEVEL l, PID p)
{
EDFSTAR_level_des *lev = (EDFSTAR_level_des *)(level_table[l]);
 
/* the task is blocked on a synchronization primitive. we have to
remove it from the master module -and- from the local queue! */
iq_extract(p,&lev->ready);
/* the task has been preempted. it returns into the ready queue... */
level_table[ lev->scheduling_level ]->
private_epilogue(lev->scheduling_level,p);
 
/* and finally, a preemption check! (it will also call guest_end() */
EDFSTAR_check_preemption(lev);
proc_table[p].status = EDFSTAR_READY;
}
 
static void EDFSTAR_guest_end(LEVEL l, PID p)
static void EDFSTAR_private_extract(LEVEL l, PID p)
{
EDFSTAR_level_des *lev = (EDFSTAR_level_des *)(level_table[l]);
 
684,7 → 550,7
#ifdef EDFSTAR_DEBUG
// kern_printf("EDFSTAR_guest_end: dline timer %d\n",lev->deadline_timer[p]);
#endif
event_delete(lev->deadline_timer[p]);
kern_event_delete(lev->deadline_timer[p]);
lev->deadline_timer[p] = NIL;
}
 
692,12 → 558,6
EDFSTAR_check_preemption(lev);
}
 
static void EDFSTAR_guest_endcycle(LEVEL l, PID p)
{ kern_raise(XINVALID_GUEST,exec_shadow); }
 
static void EDFSTAR_guest_sleep(LEVEL l, PID p)
{ kern_raise(XINVALID_GUEST,exec_shadow); }
 
/* Registration functions */
 
/* Registration function:
713,55 → 573,28
#endif
 
/* request an entry in the level_table */
l = level_alloc_descriptor();
l = level_alloc_descriptor(sizeof(EDFSTAR_level_des));
 
#ifdef EDFSTAR_DEBUG
printk(" alloco descrittore %d %d\n",l,(int)sizeof(EDFSTAR_level_des));
#endif
lev = (EDFSTAR_level_des *)level_table[l];
 
/* alloc the space needed for the EDFSTAR_level_des */
lev = (EDFSTAR_level_des *)kern_alloc(sizeof(EDFSTAR_level_des));
 
#ifdef EDFSTAR_DEBUG
printk(" lev=%d\n",(int)lev);
#endif
 
/* update the level_table with the new entry */
level_table[l] = (level_des *)lev;
 
/* fill the standard descriptor */
strncpy(lev->l.level_name, EDFSTAR_LEVELNAME, MAX_LEVELNAME);
lev->l.level_code = EDFSTAR_LEVEL_CODE;
lev->l.level_version = EDFSTAR_LEVEL_VERSION;
lev->l.private_insert = EDFSTAR_private_insert;
lev->l.private_extract = EDFSTAR_private_extract;
lev->l.private_dispatch = EDFSTAR_private_dispatch;
lev->l.private_epilogue = EDFSTAR_private_epilogue;
 
lev->l.level_accept_task_model = EDFSTAR_level_accept_task_model;
lev->l.level_accept_guest_model = EDFSTAR_level_accept_guest_model;
lev->l.level_status = EDFSTAR_level_status;
lev->l.level_scheduler = EDFSTAR_level_scheduler;
lev->l.level_guarantee = NULL;
lev->l.task_create = EDFSTAR_task_create;
lev->l.task_detach = EDFSTAR_task_detach;
lev->l.task_eligible = EDFSTAR_task_eligible;
lev->l.task_dispatch = EDFSTAR_task_dispatch;
lev->l.task_epilogue = EDFSTAR_task_epilogue;
lev->l.task_activate = EDFSTAR_task_activate;
lev->l.task_insert = EDFSTAR_task_insert;
lev->l.task_extract = EDFSTAR_task_extract;
lev->l.task_endcycle = EDFSTAR_task_endcycle;
lev->l.task_end = EDFSTAR_task_end;
lev->l.task_sleep = EDFSTAR_task_sleep;
lev->l.public_guarantee = NULL;
lev->l.public_create = EDFSTAR_public_create;
lev->l.public_end = EDFSTAR_public_end;
lev->l.public_dispatch = EDFSTAR_public_dispatch;
lev->l.public_epilogue = EDFSTAR_public_epilogue;
lev->l.public_activate = EDFSTAR_public_activate;
lev->l.public_unblock = EDFSTAR_public_unblock;
lev->l.public_block = EDFSTAR_public_block;
lev->l.public_message = EDFSTAR_public_message;
 
lev->l.guest_create = EDFSTAR_guest_create;
lev->l.guest_detach = EDFSTAR_guest_detach;
lev->l.guest_dispatch = EDFSTAR_guest_dispatch;
lev->l.guest_epilogue = EDFSTAR_guest_epilogue;
lev->l.guest_activate = EDFSTAR_guest_activate;
lev->l.guest_insert = EDFSTAR_guest_insert;
lev->l.guest_extract = EDFSTAR_guest_extract;
lev->l.guest_endcycle = EDFSTAR_guest_endcycle;
lev->l.guest_end = EDFSTAR_guest_end;
lev->l.guest_sleep = EDFSTAR_guest_sleep;
 
/* fill the EDFSTAR descriptor part */
for(i=0; i<MAX_PROC; i++) {
lev->period[i] = 0;
785,11 → 618,8
{
LEVEL l = proc_table[p].task_level;
EDFSTAR_level_des *lev = (EDFSTAR_level_des *)(level_table[l]);
if (lev->l.level_code == EDFSTAR_LEVEL_CODE &&
lev->l.level_version == EDFSTAR_LEVEL_VERSION)
return lev->dline_miss[p];
else
return -1;
return lev->dline_miss[p];
}
 
int EDFSTAR_get_wcet_miss(PID p)
796,11 → 626,8
{
LEVEL l = proc_table[p].task_level;
EDFSTAR_level_des *lev = (EDFSTAR_level_des *)(level_table[l]);
if (lev->l.level_code == EDFSTAR_LEVEL_CODE &&
lev->l.level_version == EDFSTAR_LEVEL_VERSION)
return lev->wcet_miss[p];
else
return -1;
 
return lev->wcet_miss[p];
}
 
int EDFSTAR_get_nact(PID p)
807,11 → 634,8
{
LEVEL l = proc_table[p].task_level;
EDFSTAR_level_des *lev = (EDFSTAR_level_des *)(level_table[l]);
if (lev->l.level_code == EDFSTAR_LEVEL_CODE &&
lev->l.level_version == EDFSTAR_LEVEL_VERSION)
return lev->nact[p];
else
return -1;
 
return lev->nact[p];
}
 
int EDFSTAR_reset_dline_miss(PID p)
818,14 → 642,9
{
LEVEL l = proc_table[p].task_level;
EDFSTAR_level_des *lev = (EDFSTAR_level_des *)(level_table[l]);
if (lev->l.level_code == EDFSTAR_LEVEL_CODE &&
lev->l.level_version == EDFSTAR_LEVEL_VERSION)
{
lev->dline_miss[p] = 0;
return 0;
}
else
return -1;
 
lev->dline_miss[p] = 0;
return 0;
}
 
int EDFSTAR_reset_wcet_miss(PID p)
832,13 → 651,8
{
LEVEL l = proc_table[p].task_level;
EDFSTAR_level_des *lev = (EDFSTAR_level_des *)(level_table[l]);
if (lev->l.level_code == EDFSTAR_LEVEL_CODE &&
lev->l.level_version == EDFSTAR_LEVEL_VERSION)
{
lev->wcet_miss[p] = 0;
return 0;
}
else
return -1;
 
lev->wcet_miss[p] = 0;
return 0;
}