| 20,11 → 20,11 |
|---|
| |
| /** |
| ------------ |
| CVS : $Id: cbs.c,v 1.3 2002-11-11 08:32:06 pj Exp $ |
| CVS : $Id: cbs.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 CBS (Total Bandwidth Server) |
| 172,25 → 172,9 |
|---|
| job_task_default_model(job, lev->cbs_dline[p]); |
| job_task_def_noexc(job); |
| level_table[ lev->scheduling_level ]-> |
| guest_create(lev->scheduling_level, p, (TASK_MODEL *)&job); |
| level_table[ lev->scheduling_level ]-> |
| guest_activate(lev->scheduling_level, p); |
| |
| private_insert(lev->scheduling_level, p, (TASK_MODEL *)&job); |
| } |
| |
| |
| static char *CBS_status_to_a(WORD status) |
| { |
| if (status < MODULE_STATUS_BASE) |
| return status_to_a(status); |
| |
| switch (status) { |
| case CBS_IDLE : return "CBS_Idle"; |
| case CBS_ZOMBIE : return "CBS_Zombie"; |
| default : return "CBS_Unknown"; |
| } |
| } |
| |
| static void CBS_avail_time_check(CBS_level_des *lev, PID p) |
| { |
| /* there is a while because if the wcet is << than the system tick |
| 270,60 → 254,8 |
|---|
| } |
| |
| |
| static int CBS_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->met && s->period) |
| return 0; |
| } |
| |
| return -1; |
| } |
| |
| static int CBS_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 CBS_level_status(LEVEL l) |
| { |
| CBS_level_des *lev = (CBS_level_des *)(level_table[l]); |
| PID p; |
| |
| kern_printf("On-line guarantee : %s\n", |
| onoff(lev->flags & CBS_ENABLE_GUARANTEE)); |
| kern_printf("Used Bandwidth : %u/%u\n", |
| lev->U, MAX_BANDWIDTH); |
| |
| for (p=0; p<MAX_PROC; p++) |
| if (proc_table[p].task_level == l && proc_table[p].status != FREE ) |
| kern_printf("Pid: %2d Name: %10s Period: %9ld Dline: %9ld.%6ld Stat: %s\n", |
| p, |
| proc_table[p].name, |
| lev->period[p], |
| lev->cbs_dline[p].tv_sec, |
| lev->cbs_dline[p].tv_nsec/1000, |
| CBS_status_to_a(proc_table[p].status)); |
| } |
| |
| static PID CBS_level_scheduler(LEVEL l) |
| { |
| /* the CBS don't schedule anything... |
| it's an EDF level or similar that do it! */ |
| return NIL; |
| } |
| |
| /* The on-line guarantee is enabled only if the appropriate flag is set... */ |
| static int CBS_level_guarantee(LEVEL l, bandwidth_t *freebandwidth) |
| static int CBS_public_guarantee(LEVEL l, bandwidth_t *freebandwidth) |
| { |
| CBS_level_des *lev = (CBS_level_des *)(level_table[l]); |
| |
| 340,14 → 272,18 |
|---|
| return 0; |
| } |
| |
| static int CBS_task_create(LEVEL l, PID p, TASK_MODEL *m) |
| static int CBS_public_create(LEVEL l, PID p, TASK_MODEL *m) |
| { |
| CBS_level_des *lev = (CBS_level_des *)(level_table[l]); |
| SOFT_TASK_MODEL *soft; |
| |
| /* if the CBS_task_create is called, then the pclass must be a |
| valid pclass. */ |
| SOFT_TASK_MODEL *soft = (SOFT_TASK_MODEL *)m; |
| if (m->pclass != SOFT_PCLASS) return -1; |
| if (m->level != 0 && m->level != l) return -1; |
| soft = (SOFT_TASK_MODEL *)m; |
| if (!(soft->met && soft->period)) return -1; |
| |
| soft = (SOFT_TASK_MODEL *)m; |
| |
| /* Enable wcet check */ |
| proc_table[p].avail_time = soft->met; |
| proc_table[p].wcet = soft->met; |
| 383,7 → 319,7 |
|---|
| return 0; /* OK, also if the task cannot be guaranteed... */ |
| } |
| |
| static void CBS_task_detach(LEVEL l, PID p) |
| static void CBS_public_detach(LEVEL l, PID p) |
| { |
| /* the CBS level doesn't introduce any dinamic allocated new field. |
| we have only to reset the NO_GUARANTEE FIELD and decrement the allocated |
| 397,7 → 333,7 |
|---|
| lev->U -= (MAX_BANDWIDTH / lev->period[p]) * proc_table[p].wcet; |
| } |
| |
| static int CBS_task_eligible(LEVEL l, PID p) |
| static int CBS_public_eligible(LEVEL l, PID p) |
| { |
| CBS_level_des *lev = (CBS_level_des *)(level_table[l]); |
| JOB_TASK_MODEL job; |
| 412,7 → 348,7 |
|---|
| if ( TIMESPEC_A_LT_B(&lev->cbs_dline[p], &schedule_time) ) { |
| /* we kill the current activation */ |
| level_table[ lev->scheduling_level ]-> |
| guest_end(lev->scheduling_level, p); |
| private_extract(lev->scheduling_level, p); |
| |
| /* we modify the deadline ... */ |
| TIMESPEC_ASSIGN(&lev->cbs_dline[p], &schedule_time); |
| 425,9 → 361,7 |
|---|
| job_task_default_model(job, lev->cbs_dline[p]); |
| job_task_def_noexc(job); |
| level_table[ lev->scheduling_level ]-> |
| guest_create(lev->scheduling_level, p, (TASK_MODEL *)&job); |
| level_table[ lev->scheduling_level ]-> |
| guest_activate(lev->scheduling_level, p); |
| private_insert(lev->scheduling_level, p, (TASK_MODEL *)&job); |
| |
| return -1; |
| } |
| 435,14 → 369,14 |
|---|
| return 0; |
| } |
| |
| static void CBS_task_dispatch(LEVEL l, PID p, int nostop) |
| static void CBS_public_dispatch(LEVEL l, PID p, int nostop) |
| { |
| CBS_level_des *lev = (CBS_level_des *)(level_table[l]); |
| level_table[ lev->scheduling_level ]-> |
| guest_dispatch(lev->scheduling_level,p,nostop); |
| private_dispatch(lev->scheduling_level,p,nostop); |
| } |
| |
| static void CBS_task_epilogue(LEVEL l, PID p) |
| static void CBS_public_epilogue(LEVEL l, PID p) |
| { |
| CBS_level_des *lev = (CBS_level_des *)(level_table[l]); |
| JOB_TASK_MODEL job; |
| 451,7 → 385,7 |
|---|
| if ( proc_table[p].avail_time <= 0) { |
| /* we kill the current activation */ |
| level_table[ lev->scheduling_level ]-> |
| guest_end(lev->scheduling_level, p); |
| private_extract(lev->scheduling_level, p); |
| |
| /* we modify the deadline according to rule 4 ... */ |
| CBS_avail_time_check(lev, p); |
| 460,9 → 394,7 |
|---|
| job_task_default_model(job, lev->cbs_dline[p]); |
| job_task_def_noexc(job); |
| level_table[ lev->scheduling_level ]-> |
| guest_create(lev->scheduling_level, p, (TASK_MODEL *)&job); |
| level_table[ lev->scheduling_level ]-> |
| guest_activate(lev->scheduling_level, p); |
| private_insert(lev->scheduling_level, p, (TASK_MODEL *)&job); |
| // kern_printf("epil : dl %d per %d p %d |\n", |
| // lev->cbs_dline[p].tv_nsec/1000,lev->period[p],p); |
| |
| 471,12 → 403,13 |
|---|
| /* the task has been preempted. it returns into the ready queue by |
| calling the guest_epilogue... */ |
| level_table[ lev->scheduling_level ]-> |
| guest_epilogue(lev->scheduling_level,p); |
| private_epilogue(lev->scheduling_level,p); |
| } |
| |
| static void CBS_task_activate(LEVEL l, PID p) |
| static void CBS_public_activate(LEVEL l, PID p) |
| { |
| CBS_level_des *lev = (CBS_level_des *)(level_table[l]); |
| struct timespec t; |
| |
| /* save activation (only if needed... */ |
| if (proc_table[p].status != SLEEP) { |
| 485,9 → 418,9 |
|---|
| return; |
| } |
| |
| ll_gettime(TIME_EXACT, &proc_table[p].request_time); |
| kern_gettime(&t); |
| |
| CBS_activation(lev, p, &proc_table[p].request_time); |
| CBS_activation(lev, p, &t); |
| |
| /* Set the reactivation timer */ |
| if (!(lev->flag[p] & CBS_APERIODIC)) |
| 496,7 → 429,7 |
|---|
| the deadline may be != from actual_time + period |
| (if we call the task_activate after a task_sleep, and the |
| deadline was postponed a lot...) */ |
| TIMESPEC_ASSIGN(&lev->reactivation_time[p], &proc_table[p].request_time); |
| TIMESPEC_ASSIGN(&lev->reactivation_time[p], &t); |
| ADDUSEC2TIMESPEC(lev->period[p], &lev->reactivation_time[p]); |
| // TIMESPEC_ASSIGN(&lev->reactivation_time[p], &lev->cbs_dline[p]); |
| lev->reactivation_timer[p] = kern_event_post(&lev->reactivation_time[p], |
| 509,17 → 442,17 |
|---|
| // kern_printf("act : %d %d |",lev->cbs_dline[p].tv_nsec/1000,p); |
| } |
| |
| static void CBS_task_insert(LEVEL l, PID p) |
| static void CBS_public_unblock(LEVEL l, PID p) |
| { |
| CBS_level_des *lev = (CBS_level_des *)(level_table[l]); |
| struct timespec acttime; |
| |
| ll_gettime(TIME_EXACT, &acttime); |
| kern_gettime(&acttime); |
| |
| CBS_activation(lev,p,&acttime); |
| } |
| |
| static void CBS_task_extract(LEVEL l, PID p) |
| static void CBS_public_block(LEVEL l, PID p) |
| { |
| CBS_level_des *lev = (CBS_level_des *)(level_table[l]); |
| |
| 527,10 → 460,10 |
|---|
| CBS_avail_time_check(lev, p); |
| |
| level_table[ lev->scheduling_level ]-> |
| guest_end(lev->scheduling_level,p); |
| private_extract(lev->scheduling_level,p); |
| } |
| |
| static void CBS_task_endcycle(LEVEL l, PID p) |
| static int CBS_public_message(LEVEL l, PID p, void *m) |
| { |
| CBS_level_des *lev = (CBS_level_des *)(level_table[l]); |
| |
| 539,24 → 472,27 |
|---|
| |
| if (lev->nact[p]) { |
| /* continue!!!! */ |
| ll_gettime(TIME_EXACT, &proc_table[p].request_time); |
| lev->nact[p]--; |
| level_table[ lev->scheduling_level ]-> |
| guest_epilogue(lev->scheduling_level,p); |
| private_epilogue(lev->scheduling_level,p); |
| } |
| else { |
| level_table[ lev->scheduling_level ]-> |
| guest_end(lev->scheduling_level,p); |
| private_extract(lev->scheduling_level,p); |
| |
| if (lev->flag[p] & CBS_APERIODIC) |
| proc_table[p].status = SLEEP; |
| else /* the task is soft_periodic */ |
| proc_table[p].status = CBS_IDLE; |
| } |
| |
| } |
| jet_update_endcycle(); /* Update the Jet data... */ |
| trc_logevent(TRC_ENDCYCLE,&exec_shadow); /* tracer stuff */ |
| |
| return 0; |
| } |
| |
| static void CBS_task_end(LEVEL l, PID p) |
| static void CBS_public_end(LEVEL l, PID p) |
| { |
| CBS_level_des *lev = (CBS_level_des *)(level_table[l]); |
| |
| 564,11 → 500,11 |
|---|
| CBS_avail_time_check(lev, p); |
| |
| level_table[ lev->scheduling_level ]-> |
| guest_end(lev->scheduling_level,p); |
| private_extract(lev->scheduling_level,p); |
| |
| /* we delete the reactivation timer */ |
| if (!(lev->flag[p] & CBS_APERIODIC)) { |
| event_delete(lev->reactivation_timer[p]); |
| kern_event_delete(lev->reactivation_timer[p]); |
| lev->reactivation_timer[p] = -1; |
| } |
| |
| 580,67 → 516,11 |
|---|
| (void *)p); |
| } |
| |
| static void CBS_task_sleep(LEVEL l, PID p) |
| { |
| CBS_level_des *lev = (CBS_level_des *)(level_table[l]); |
| |
| /* check if the wcet is finished... */ |
| CBS_avail_time_check(lev, p); |
| |
| /* a task activation is finished, but we are using a JOB_TASK_MODEL |
| that implements a single activation, so we have to call |
| the guest_end, that representsa single activation... */ |
| level_table[ lev->scheduling_level ]-> |
| guest_end(lev->scheduling_level,p); |
| |
| /* we delete the reactivation timer */ |
| if (!(lev->flag[p] & CBS_APERIODIC)) { |
| event_delete(lev->reactivation_timer[p]); |
| lev->reactivation_timer[p] = -1; |
| } |
| |
| proc_table[p].status = SLEEP; |
| |
| /* the sleep forgets pending activations... */ |
| lev->nact[p] = 0; |
| } |
| |
| static int CBS_guest_create(LEVEL l, PID p, TASK_MODEL *m) |
| { kern_raise(XINVALID_GUEST,exec_shadow); return 0; } |
| |
| static void CBS_guest_detach(LEVEL l, PID p) |
| { kern_raise(XINVALID_GUEST,exec_shadow); } |
| |
| static void CBS_guest_dispatch(LEVEL l, PID p, int nostop) |
| { kern_raise(XINVALID_GUEST,exec_shadow); } |
| |
| static void CBS_guest_epilogue(LEVEL l, PID p) |
| { kern_raise(XINVALID_GUEST,exec_shadow); } |
| |
| static void CBS_guest_activate(LEVEL l, PID p) |
| { kern_raise(XINVALID_GUEST,exec_shadow); } |
| |
| static void CBS_guest_insert(LEVEL l, PID p) |
| { kern_raise(XINVALID_GUEST,exec_shadow); } |
| |
| static void CBS_guest_extract(LEVEL l, PID p) |
| { kern_raise(XINVALID_GUEST,exec_shadow); } |
| |
| static void CBS_guest_endcycle(LEVEL l, PID p) |
| { kern_raise(XINVALID_GUEST,exec_shadow); } |
| |
| static void CBS_guest_end(LEVEL l, PID p) |
| { kern_raise(XINVALID_GUEST,exec_shadow); } |
| |
| static void CBS_guest_sleep(LEVEL l, PID p) |
| { kern_raise(XINVALID_GUEST,exec_shadow); } |
| |
| |
| /* Registration functions */ |
| |
| /*+ Registration function: |
| int flags the init flags ... see CBS.h +*/ |
| void CBS_register_level(int flags, LEVEL master) |
| LEVEL CBS_register_level(int flags, LEVEL master) |
| { |
| LEVEL l; /* the level that we register */ |
| CBS_level_des *lev; /* for readableness only */ |
| 649,56 → 529,28 |
|---|
| printk("CBS_register_level\n"); |
| |
| /* request an entry in the level_table */ |
| l = level_alloc_descriptor(); |
| l = level_alloc_descriptor(sizeof(CBS_level_des)); |
| |
| printk(" alloco descrittore %d %d\n",l,(int)sizeof(CBS_level_des)); |
| lev = (CBS_level_des *)level_table[l]; |
| |
| /* alloc the space needed for the CBS_level_des */ |
| lev = (CBS_level_des *)kern_alloc(sizeof(CBS_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, CBS_LEVELNAME, MAX_LEVELNAME); |
| lev->l.level_code = CBS_LEVEL_CODE; |
| lev->l.level_version = CBS_LEVEL_VERSION; |
| |
| lev->l.level_accept_task_model = CBS_level_accept_task_model; |
| lev->l.level_accept_guest_model = CBS_level_accept_guest_model; |
| lev->l.level_status = CBS_level_status; |
| lev->l.level_scheduler = CBS_level_scheduler; |
| |
| if (flags & CBS_ENABLE_GUARANTEE) |
| lev->l.level_guarantee = CBS_level_guarantee; |
| lev->l.public_guarantee = CBS_public_guarantee; |
| else |
| lev->l.level_guarantee = NULL; |
| lev->l.public_guarantee = NULL; |
| lev->l.public_create = CBS_public_create; |
| lev->l.public_detach = CBS_public_detach; |
| lev->l.public_end = CBS_public_end; |
| lev->l.public_eligible = CBS_public_eligible; |
| lev->l.public_dispatch = CBS_public_dispatch; |
| lev->l.public_epilogue = CBS_public_epilogue; |
| lev->l.public_activate = CBS_public_activate; |
| lev->l.public_unblock = CBS_public_unblock; |
| lev->l.public_block = CBS_public_block; |
| lev->l.public_message = CBS_public_message; |
| |
| lev->l.task_create = CBS_task_create; |
| lev->l.task_detach = CBS_task_detach; |
| lev->l.task_eligible = CBS_task_eligible; |
| lev->l.task_dispatch = CBS_task_dispatch; |
| lev->l.task_epilogue = CBS_task_epilogue; |
| lev->l.task_activate = CBS_task_activate; |
| lev->l.task_insert = CBS_task_insert; |
| lev->l.task_extract = CBS_task_extract; |
| lev->l.task_endcycle = CBS_task_endcycle; |
| lev->l.task_end = CBS_task_end; |
| lev->l.task_sleep = CBS_task_sleep; |
| |
| lev->l.guest_create = CBS_guest_create; |
| lev->l.guest_detach = CBS_guest_detach; |
| lev->l.guest_dispatch = CBS_guest_dispatch; |
| lev->l.guest_epilogue = CBS_guest_epilogue; |
| lev->l.guest_activate = CBS_guest_activate; |
| lev->l.guest_insert = CBS_guest_insert; |
| lev->l.guest_extract = CBS_guest_extract; |
| lev->l.guest_endcycle = CBS_guest_endcycle; |
| lev->l.guest_end = CBS_guest_end; |
| lev->l.guest_sleep = CBS_guest_sleep; |
| |
| /* fill the CBS descriptor part */ |
| for (i=0; i<MAX_PROC; i++) { |
| NULL_TIMESPEC(&lev->cbs_dline[i]); |
| 715,16 → 567,15 |
|---|
| lev->scheduling_level = master; |
| |
| lev->flags = flags & 0x01; |
| |
| return l; |
| } |
| |
| bandwidth_t CBS_usedbandwidth(LEVEL l) |
| { |
| CBS_level_des *lev = (CBS_level_des *)(level_table[l]); |
| if (lev->l.level_code == CBS_LEVEL_CODE && |
| lev->l.level_version == CBS_LEVEL_VERSION) |
| return lev->U; |
| else |
| return 0; |
| |
| return lev->U; |
| } |
| |
| int CBS_get_nact(LEVEL l, PID p) |