20,11 → 20,11 |
|
/** |
------------ |
CVS : $Id: ps.c,v 1.3 2002-11-11 08:32:06 pj Exp $ |
CVS : $Id: ps.c,v 1.4 2003-01-07 17:07:50 pj Exp $ |
|
File: $File$ |
Revision: $Revision: 1.3 $ |
Last update: $Date: 2002-11-11 08:32:06 $ |
Revision: $Revision: 1.4 $ |
Last update: $Date: 2003-01-07 17:07:50 $ |
------------ |
|
This file contains the aperiodic server PS (Polling Server) |
103,6 → 103,7 |
#include <kernel/descr.h> |
#include <kernel/var.h> |
#include <kernel/func.h> |
#include <kernel/trace.h> |
|
/*+ Status used in the level +*/ |
#define PS_WAIT APER_STATUS_BASE /*+ waiting the service +*/ |
145,8 → 146,7 |
m = lev->scheduling_level; |
job_task_default_model(j,lev->lastdline); |
job_task_def_period(j,lev->period); |
level_table[m]->guest_create(m,p,(TASK_MODEL *)&j); |
level_table[m]->guest_activate(m,p); |
level_table[m]->private_insert(m,p,(TASK_MODEL *)&j); |
// kern_printf("(%d %d)",lev->lastdline.tv_sec,lev->lastdline.tv_nsec); |
} |
|
180,80 → 180,8 |
// kern_printf("!"); |
} |
|
static char *PS_status_to_a(WORD status) |
static PID PS_public_schedulerbackground(LEVEL l) |
{ |
if (status < MODULE_STATUS_BASE) |
return status_to_a(status); |
|
switch (status) { |
case PS_WAIT : return "PS_Wait"; |
default : return "PS_Unknown"; |
} |
} |
|
|
static int PS_level_accept_task_model(LEVEL l, TASK_MODEL *m) |
{ |
if (m->pclass == SOFT_PCLASS || m->pclass == (SOFT_PCLASS | l) ) { |
SOFT_TASK_MODEL *s = (SOFT_TASK_MODEL *)m; |
|
if (s->periodicity == APERIODIC) |
return 0; |
} |
return -1; |
} |
|
static int PS_level_accept_guest_model(LEVEL l, TASK_MODEL *m) |
{ |
return -1; |
} |
|
static char *onoff(int i) |
{ |
if (i) |
return "On "; |
else |
return "Off"; |
} |
|
static void PS_level_status(LEVEL l) |
{ |
PS_level_des *lev = (PS_level_des *)(level_table[l]); |
PID p = iq_query_first(&lev->wait); |
|
kern_printf("On-line guarantee : %s\n", |
onoff(lev->flags & PS_ENABLE_GUARANTEE_EDF || |
lev->flags & PS_ENABLE_GUARANTEE_RM )); |
kern_printf("Used Bandwidth : %u/%u\n", |
lev->U, MAX_BANDWIDTH); |
|
if (lev->activated != -1) |
kern_printf("Activated: Pid: %2d Name: %10s Dl: %ld.%ld Nact: %d Stat: %s\n", |
lev->activated, |
proc_table[lev->activated].name, |
iq_query_timespec(lev->activated,&lev->wait)->tv_sec, |
iq_query_timespec(lev->activated,&lev->wait)->tv_nsec, |
lev->nact[lev->activated], |
PS_status_to_a(proc_table[lev->activated].status)); |
|
while (p != NIL) { |
kern_printf("Pid: %2d Name: %10s Stat: %s\n", |
p, |
proc_table[p].name, |
PS_status_to_a(proc_table[p].status)); |
p = iq_query_next(p, &lev->wait); |
} |
} |
|
static PID PS_level_scheduler(LEVEL l) |
{ |
/* the PS don't schedule anything... |
it's an EDF level or similar that do it! */ |
return NIL; |
} |
|
static PID PS_level_schedulerbackground(LEVEL l) |
{ |
/* the PS catch the background time to exec aperiodic activities */ |
PS_level_des *lev = (PS_level_des *)(level_table[l]); |
|
266,7 → 194,7 |
} |
|
/* The on-line guarantee is enabled only if the appropriate flag is set... */ |
static int PS_level_guaranteeEDF(LEVEL l, bandwidth_t *freebandwidth) |
static int PS_public_guaranteeEDF(LEVEL l, bandwidth_t *freebandwidth) |
{ |
PS_level_des *lev = (PS_level_des *)(level_table[l]); |
|
278,7 → 206,7 |
return 0; |
} |
|
static int PS_level_guaranteeRM(LEVEL l, bandwidth_t *freebandwidth) |
static int PS_public_guaranteeRM(LEVEL l, bandwidth_t *freebandwidth) |
{ |
PS_level_des *lev = (PS_level_des *)(level_table[l]); |
|
290,13 → 218,17 |
return 0; |
} |
|
static int PS_task_create(LEVEL l, PID p, TASK_MODEL *m) |
static int PS_public_create(LEVEL l, PID p, TASK_MODEL *m) |
{ |
PS_level_des *lev = (PS_level_des *)(level_table[l]); |
SOFT_TASK_MODEL *s; |
|
/* if the PS_task_create is called, then the pclass must be a |
valid pclass. */ |
SOFT_TASK_MODEL *s = (SOFT_TASK_MODEL *)m; |
if (m->pclass != SOFT_PCLASS) return -1; |
if (m->level != 0 && m->level != l) return -1; |
s = (SOFT_TASK_MODEL *)m; |
if (s->periodicity != APERIODIC) return -1; |
|
s = (SOFT_TASK_MODEL *)m; |
|
if (s->arrivals == SAVE_ARRIVALS) |
lev->nact[p] = 0; |
306,18 → 238,8 |
return 0; /* OK, also if the task cannot be guaranteed... */ |
} |
|
static void PS_task_detach(LEVEL l, PID p) |
static void PS_public_dispatch(LEVEL l, PID p, int nostop) |
{ |
/* the PS level doesn't introduce any dinamic allocated new field. */ |
} |
|
static int PS_task_eligible(LEVEL l, PID p) |
{ |
return 0; /* if the task p is chosen, it is always eligible */ |
} |
|
static void PS_task_dispatch(LEVEL l, PID p, int nostop) |
{ |
PS_level_des *lev = (PS_level_des *)(level_table[l]); |
struct timespec ty; |
|
333,7 → 255,7 |
else { |
//if (nostop) kern_printf("(gd status=%d)",proc_table[p].status); |
level_table[ lev->scheduling_level ]-> |
guest_dispatch(lev->scheduling_level,p,nostop); |
private_dispatch(lev->scheduling_level,p,nostop); |
} |
|
/* set the capacity timer */ |
346,7 → 268,7 |
// kern_printf("(disp %d %d)",ty.tv_sec, ty.tv_nsec); |
} |
|
static void PS_task_epilogue(LEVEL l, PID p) |
static void PS_public_epilogue(LEVEL l, PID p) |
{ |
PS_level_des *lev = (PS_level_des *)(level_table[l]); |
struct timespec ty; |
378,7 → 300,7 |
task point the shadow to it!!!*/ |
if (lev->activated == p) |
level_table[ lev->scheduling_level ]-> |
guest_end(lev->scheduling_level,p); |
private_extract(lev->scheduling_level,p); |
iq_insertfirst(p, &lev->wait); |
proc_table[p].status = PS_WAIT; |
lev->activated = NIL; |
388,7 → 310,7 |
wait queue by calling the guest_epilogue... */ |
if (lev->activated == p) {//kern_printf("Û1"); |
level_table[ lev->scheduling_level ]-> |
guest_epilogue(lev->scheduling_level,p); |
private_epilogue(lev->scheduling_level,p); |
} else { //kern_printf("Û2"); |
iq_insertfirst(p, &lev->wait); |
proc_table[p].status = PS_WAIT; |
395,7 → 317,7 |
} |
} |
|
static void PS_task_activate(LEVEL l, PID p) |
static void PS_public_activate(LEVEL l, PID p) |
{ |
PS_level_des *lev = (PS_level_des *)(level_table[l]); |
|
404,7 → 326,6 |
lev->nact[p]++; |
} |
else if (proc_table[p].status == SLEEP) { |
ll_gettime(TIME_EXACT, &proc_table[p].request_time); |
|
if (lev->activated == NIL && lev->availCs > 0) { |
lev->activated = p; |
421,7 → 342,7 |
|
} |
|
static void PS_task_insert(LEVEL l, PID p) |
static void PS_public_unblock(LEVEL l, PID p) |
{ |
PS_level_des *lev = (PS_level_des *)(level_table[l]); |
|
435,7 → 356,7 |
proc_table[p].status = PS_WAIT; |
} |
|
static void PS_task_extract(LEVEL l, PID p) |
static void PS_public_block(LEVEL l, PID p) |
{ |
PS_level_des *lev = (PS_level_des *)(level_table[l]); |
|
446,10 → 367,10 |
|
if (lev->activated == p) |
level_table[ lev->scheduling_level ]-> |
guest_end(lev->scheduling_level,p); |
private_extract(lev->scheduling_level,p); |
} |
|
static void PS_task_endcycle(LEVEL l, PID p) |
static int PS_public_message(LEVEL l, PID p, void *m) |
{ |
PS_level_des *lev = (PS_level_des *)(level_table[l]); |
struct timespec ty; |
466,7 → 387,7 |
|
if (lev->activated == p) |
level_table[ lev->scheduling_level ]-> |
guest_end(lev->scheduling_level,p); |
private_extract(lev->scheduling_level,p); |
else |
iq_extract(p, &lev->wait); |
|
484,9 → 405,14 |
lev->availCs = 0; /* see note (*) at the begin of the file */ |
else |
PS_activation(lev); |
|
jet_update_endcycle(); /* Update the Jet data... */ |
trc_logevent(TRC_ENDCYCLE,&exec_shadow); /* tracer stuff */ |
|
return 0; |
} |
|
static void PS_task_end(LEVEL l, PID p) |
static void PS_public_end(LEVEL l, PID p) |
{ |
PS_level_des *lev = (PS_level_des *)(level_table[l]); |
struct timespec ty; |
503,7 → 429,7 |
|
if (lev->activated == p) |
level_table[ lev->scheduling_level ]-> |
guest_end(lev->scheduling_level,p); |
private_extract(lev->scheduling_level,p); |
|
proc_table[p].status = FREE; |
iq_insertfirst(p,&freedesc); |
515,72 → 441,6 |
PS_activation(lev); |
} |
|
static void PS_task_sleep(LEVEL l, PID p) |
{ |
PS_level_des *lev = (PS_level_des *)(level_table[l]); |
struct timespec ty; |
TIME tx; |
|
/* update the server capacity */ |
if (lev->flags & PS_BACKGROUND) |
lev->flags &= ~PS_BACKGROUND; |
else { |
SUBTIMESPEC(&schedule_time, &cap_lasttime, &ty); |
tx = TIMESPEC2USEC(&ty); |
lev->availCs -= tx; |
} |
|
if (lev->nact[p] >= 0) lev->nact[p] = 0; |
|
if (lev->activated == p) |
level_table[ lev->scheduling_level ]-> |
guest_end(lev->scheduling_level,p); |
else |
iq_extract(p, &lev->wait); |
|
proc_table[p].status = SLEEP; |
|
lev->activated = iq_getfirst(&lev->wait); |
if (lev->activated == NIL) |
lev->availCs = 0; /* see note (*) at the begin of the file */ |
else |
PS_activation(lev); |
} |
|
|
static int PS_guest_create(LEVEL l, PID p, TASK_MODEL *m) |
{ kern_raise(XINVALID_GUEST,exec_shadow); return 0; } |
|
static void PS_guest_detach(LEVEL l, PID p) |
{ kern_raise(XINVALID_GUEST,exec_shadow); } |
|
static void PS_guest_dispatch(LEVEL l, PID p, int nostop) |
{ kern_raise(XINVALID_GUEST,exec_shadow); } |
|
static void PS_guest_epilogue(LEVEL l, PID p) |
{ kern_raise(XINVALID_GUEST,exec_shadow); } |
|
static void PS_guest_activate(LEVEL l, PID p) |
{ kern_raise(XINVALID_GUEST,exec_shadow); } |
|
static void PS_guest_insert(LEVEL l, PID p) |
{ kern_raise(XINVALID_GUEST,exec_shadow); } |
|
static void PS_guest_extract(LEVEL l, PID p) |
{ kern_raise(XINVALID_GUEST,exec_shadow); } |
|
static void PS_guest_endcycle(LEVEL l, PID p) |
{ kern_raise(XINVALID_GUEST,exec_shadow); } |
|
static void PS_guest_end(LEVEL l, PID p) |
{ kern_raise(XINVALID_GUEST,exec_shadow); } |
|
static void PS_guest_sleep(LEVEL l, PID p) |
{ kern_raise(XINVALID_GUEST,exec_shadow); } |
|
|
|
|
/* Registration functions */ |
|
|
590,7 → 450,7 |
{ |
PS_level_des *lev = (PS_level_des *)(level_table[(LEVEL)l]); |
|
ll_gettime(TIME_EXACT,&lev->lastdline); |
kern_gettime(&lev->lastdline); |
ADDUSEC2TIMESPEC(lev->period, &lev->lastdline); |
|
kern_event_post(&lev->lastdline, PS_deadline_timer, l); |
600,7 → 460,7 |
|
/*+ Registration function: |
int flags the init flags ... see PS.h +*/ |
void PS_register_level(int flags, LEVEL master, int Cs, int per) |
LEVEL PS_register_level(int flags, LEVEL master, int Cs, int per) |
{ |
LEVEL l; /* the level that we register */ |
PS_level_des *lev; /* for readableness only */ |
609,62 → 469,33 |
printk("PS_register_level\n"); |
|
/* request an entry in the level_table */ |
l = level_alloc_descriptor(); |
l = level_alloc_descriptor(sizeof(PS_level_des)); |
|
printk(" alloco descrittore %d %d\n",l,(int)sizeof(PS_level_des)); |
lev = (PS_level_des *)level_table[l]; |
|
/* alloc the space needed for the PS_level_des */ |
lev = (PS_level_des *)kern_alloc(sizeof(PS_level_des)); |
|
printk(" lev=%d\n",(int)lev); |
|
/* update the level_table with the new entry */ |
level_table[l] = (level_des *)lev; |
|
/* fill the standard descriptor */ |
strncpy(lev->l.level_name, PS_LEVELNAME, MAX_LEVELNAME); |
lev->l.level_code = PS_LEVEL_CODE; |
lev->l.level_version = PS_LEVEL_VERSION; |
|
lev->l.level_accept_task_model = PS_level_accept_task_model; |
lev->l.level_accept_guest_model = PS_level_accept_guest_model; |
lev->l.level_status = PS_level_status; |
|
if (flags & PS_ENABLE_BACKGROUND) |
lev->l.level_scheduler = PS_level_schedulerbackground; |
else |
lev->l.level_scheduler = PS_level_scheduler; |
lev->l.public_scheduler = PS_public_schedulerbackground; |
|
if (flags & PS_ENABLE_GUARANTEE_EDF) |
lev->l.level_guarantee = PS_level_guaranteeEDF; |
lev->l.public_guarantee = PS_public_guaranteeEDF; |
else if (flags & PS_ENABLE_GUARANTEE_RM) |
lev->l.level_guarantee = PS_level_guaranteeRM; |
lev->l.public_guarantee = PS_public_guaranteeRM; |
else |
lev->l.level_guarantee = NULL; |
lev->l.public_guarantee = NULL; |
|
lev->l.task_create = PS_task_create; |
lev->l.task_detach = PS_task_detach; |
lev->l.task_eligible = PS_task_eligible; |
lev->l.task_dispatch = PS_task_dispatch; |
lev->l.task_epilogue = PS_task_epilogue; |
lev->l.task_activate = PS_task_activate; |
lev->l.task_insert = PS_task_insert; |
lev->l.task_extract = PS_task_extract; |
lev->l.task_endcycle = PS_task_endcycle; |
lev->l.task_end = PS_task_end; |
lev->l.task_sleep = PS_task_sleep; |
lev->l.public_create = PS_public_create; |
lev->l.public_end = PS_public_end; |
lev->l.public_dispatch = PS_public_dispatch; |
lev->l.public_epilogue = PS_public_epilogue; |
lev->l.public_activate = PS_public_activate; |
lev->l.public_unblock = PS_public_unblock; |
lev->l.public_block = PS_public_block; |
lev->l.public_message = PS_public_message; |
|
lev->l.guest_create = PS_guest_create; |
lev->l.guest_detach = PS_guest_detach; |
lev->l.guest_dispatch = PS_guest_dispatch; |
lev->l.guest_epilogue = PS_guest_epilogue; |
lev->l.guest_activate = PS_guest_activate; |
lev->l.guest_insert = PS_guest_insert; |
lev->l.guest_extract = PS_guest_extract; |
lev->l.guest_endcycle = PS_guest_endcycle; |
lev->l.guest_end = PS_guest_end; |
lev->l.guest_sleep = PS_guest_sleep; |
|
/* fill the PS descriptor part */ |
|
for (i=0; i<MAX_PROC; i++) |
685,15 → 516,14 |
lev->flags = flags & 0x07; |
|
sys_atrunlevel(PS_dline_install,(void *) l, RUNLEVEL_INIT); |
|
return l; |
} |
|
bandwidth_t PS_usedbandwidth(LEVEL l) |
{ |
PS_level_des *lev = (PS_level_des *)(level_table[l]); |
if (lev->l.level_code == PS_LEVEL_CODE && |
lev->l.level_version == PS_LEVEL_VERSION) |
return lev->U; |
else |
return 0; |
|
return lev->U; |
} |
|