Subversion Repositories shark

/*
 * Project: S.Ha.R.K.
 *
 * Coordinators:
 *   Giorgio Buttazzo    <giorgio@sssup.it>
 *   Paolo Gai           <pj@gandalf.sssup.it>
 *
 * Authors     :
 *   Paolo Gai           <pj@gandalf.sssup.it>
 *   (see the web pages for full authors list)
 *
 * ReTiS Lab (Scuola Superiore S.Anna - Pisa - Italy)
 *
 * http://www.sssup.it
 * http://retis.sssup.it
 * http://shark.sssup.it
 */

/**
 ------------
 CVS :        $Id: rmstar.c,v 1.3 2002-11-11 08:17:59 pj Exp $

 File:        $File$
 Revision:    $Revision: 1.3 $
 Last update: $Date: 2002-11-11 08:17:59 $
 ------------
**/

/*
 * Copyright (C) 2001 Paolo Gai
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 *
 */

#include "rmstar.h"
#include <ll/stdio.h>
#include <ll/string.h>
#include <kernel/model.h>
#include <kernel/descr.h>
#include <kernel/var.h>
#include <kernel/func.h>
#include <kernel/trace.h>

/* for iqueues */
/* #include "iqueue.h" Now iqueues are the only queue type into the kernel */

/* for BUDGET_TASK_MODEL */
#include "cbsstar.h"

/*
 * DEBUG stuffs begin
 */

//#define RMSTAR_DEBUG

#ifdef RMSTAR_DEBUF

static __inline__ fake_printf(char *fmt, ...) {}

#define rmstar_printf fake_printf
#define rmstar_printf2 fake_printf
#define rmstar_printf3 fake_printf

//#define rmstar_printf kern_printf
//#define rmstar_printf2 kern_printf
//#define rmstar_printf3 kern_printf
#endif

/*
 * DEBUG stuffs end
 */

/* Status used in the level */
#define RMSTAR_READY         MODULE_STATUS_BASE    /* - Ready status        */
#define RMSTAR_IDLE          MODULE_STATUS_BASE+4  /* to wait the deadline  */

/* flags */
#define RMSTAR_FLAG_NORAISEEXC  2

/* the level redefinition for the Earliest Deadline First level */
typedef struct {
  level_des l;     /* the standard level descriptor          */

  TIME period[MAX_PROC]; /* The task periods; the deadlines are
                       stored in the priority field           */
  int deadline_timer[MAX_PROC];
                   /* The task deadline timers               */

  struct timespec deadline_timespec[MAX_PROC];

  int dline_miss[MAX_PROC]; /* Deadline miss counter */
  int wcet_miss[MAX_PROC];  /* Wcet miss counter */

  int nact[MAX_PROC];       /* Wcet miss counter */

  int flag[MAX_PROC];
                   /* used to manage the JOB_TASK_MODEL and the
                       periodicity                            */

  IQUEUE ready;     /* the ready queue                        */

  PID activated;   /* the task that has been inserted into the
                       master module */

  int budget;

  int scheduling_level;
} RMSTAR_level_des;

static void RMSTAR_check_preemption(RMSTAR_level_des *lev)
{
  PID first;

#ifdef RMSTAR_DEBUG
  rmstar_printf("(E:chk)");
#endif

  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);

    lev->activated = first;

    if (first != NIL) {
      BUDGET_TASK_MODEL b;
      budget_task_default_model(b, lev->budget);

      level_table[ lev->scheduling_level ]->
        guest_create(lev->scheduling_level, first, (TASK_MODEL *)&b);
    }
  }
}

static void RMSTAR_timer_deadline(void *par);

static void RMSTAR_internal_activate(RMSTAR_level_des *lev, PID p)
{
  struct timespec temp;

#ifdef RMSTAR_DEBUG
  rmstar_printf("(E:iact)");
#endif

  TIMESPEC_ASSIGN(&temp, &proc_table[p].request_time);
  ADDUSEC2TIMESPEC(lev->period[p], &temp);

  *iq_query_timespec(p, &lev->ready) = temp;
  lev->deadline_timespec[p] = temp;

  /* Insert task in the correct position */
  proc_table[p].status = RMSTAR_READY;
  iq_priority_insert(p,&lev->ready);

  /* needed because when there is a wcet miss I disable CONTROL_CAP */
  proc_table[p].control |= CONTROL_CAP;

  /* check for preemption */
  RMSTAR_check_preemption(lev);
}

static char *RMSTAR_status_to_a(WORD status)
{
  if (status < MODULE_STATUS_BASE)
    return status_to_a(status);

  switch (status) {
    case RMSTAR_READY    : return "RMSTAR_Ready";
    case RMSTAR_IDLE     : return "RMSTAR_Idle";
    default               : return "RMSTAR_Unknown";
  }
}

static void RMSTAR_timer_deadline(void *par)
{
  PID p = (PID) par;
  RMSTAR_level_des *lev;

#ifdef RMSTAR_DEBUG
//  rmstar_printf("(E:tdl ");
#endif

  lev = (RMSTAR_level_des *)level_table[proc_table[p].task_level];

  switch (proc_table[p].status) {
    case RMSTAR_IDLE:
#ifdef RMSTAR_DEBUG
//      rmstar_printf2("I%d",p);
#endif
      /* set the request time */
      proc_table[p].request_time = *iq_query_timespec(p, &lev->ready);

      RMSTAR_internal_activate(lev,p);

      event_need_reschedule();
      break;

    default:
#ifdef RMSTAR_DEBUG
//      rmstar_printf2("D%d",p);
#endif
      /* else, a deadline miss occurred!!! */
      lev->dline_miss[p]++;

      /* the task is into another state */
      lev->nact[p]++;

      /* Set the deadline timer */
      ADDUSEC2TIMESPEC(lev->period[p], &lev->deadline_timespec[p]);
  }

  /* Set the deadline timer */
  lev->deadline_timer[p] = kern_event_post(&lev->deadline_timespec[p],
                                           RMSTAR_timer_deadline,
                                           (void *)p);

#ifdef RMSTAR_DEBUG
//  rmstar_printf(")");
#endif
}

static void RMSTAR_timer_guest_deadline(void *par)
{
  PID p = (PID) par;

#ifdef RMSTAR_DEBUG
  rmstar_printf("(E:gdl)");
#endif

  kern_raise(XDEADLINE_MISS,p);
}

static int RMSTAR_level_accept_task_model(LEVEL l, TASK_MODEL *m)
{
#ifdef RMSTAR_DEBUG
  rmstar_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 RMSTAR_level_accept_guest_model(LEVEL l, TASK_MODEL *m)
{
#ifdef RMSTAR_DEBUG
  rmstar_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 RMSTAR_level_status(LEVEL l)
{
  RMSTAR_level_des *lev = (RMSTAR_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,
                  RMSTAR_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 != RMSTAR_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,
                  RMSTAR_status_to_a(proc_table[p].status));
    }
}

/* The scheduler only gets the first task in the queue */
static PID RMSTAR_level_scheduler(LEVEL l)
{
  //RMSTAR_level_des *lev = (RMSTAR_level_des *)(level_table[l]);

  return NIL;
}

static int RMSTAR_task_create(LEVEL l, PID p, TASK_MODEL *m)
{
  RMSTAR_level_des *lev = (RMSTAR_level_des *)(level_table[l]);

  /* if the RMSTAR_task_create is called, then the pclass must be a
     valid pclass. */
  HARD_TASK_MODEL *h = (HARD_TASK_MODEL *)m;

#ifdef RMSTAR_DEBUG
  rmstar_printf("(E:tcr)");
#endif

  lev->period[p] = h->mit;
  *iq_query_priority(p, &lev->ready) = h->mit;

  lev->flag[p] = 0;
  lev->deadline_timer[p] = -1;
  lev->dline_miss[p]     = 0;
  lev->wcet_miss[p]      = 0;
  lev->nact[p]           = 0;

  /* Enable wcet check */
  proc_table[p].avail_time = h->wcet;
  proc_table[p].wcet       = h->wcet;
  proc_table[p].control |= CONTROL_CAP;

  return 0; /* OK, also if the task cannot be guaranteed... */
}

static void RMSTAR_task_detach(LEVEL l, PID p)
{
#ifdef RMSTAR_DEBUG
  rmstar_printf2("(E:tdt)");
#endif
}

static int RMSTAR_task_eligible(LEVEL l, PID p)
{
#ifdef RMSTAR_DEBUG
  rmstar_printf2("(E:eli)");
#endif

  return 0; /* if the task p is chosen, it is always eligible */
}

static void RMSTAR_task_dispatch(LEVEL l, PID p, int nostop)
{
  RMSTAR_level_des *lev = (RMSTAR_level_des *)(level_table[l]);

#ifdef RMSTAR_DEBUG
  rmstar_printf("(E:dis)");

  rmstar_printf3("(%d %d)",
                  iq_query_timespec(p, &lev->ready)->tv_nsec/1000000,
                  schedule_time.tv_nsec/1000000);
#endif

  level_table[ lev->scheduling_level ]->
    guest_dispatch(lev->scheduling_level,p,nostop);
}

static void RMSTAR_task_epilogue(LEVEL l, PID p)
{
  RMSTAR_level_des *lev = (RMSTAR_level_des *)(level_table[l]);

#ifdef RMSTAR_DEBUG
  rmstar_printf("(E:epi ");
#endif

  /* check if the wcet is finished... */
  if (proc_table[p].avail_time <= 0 && proc_table[p].control&CONTROL_CAP) {
    /* wcet finished: disable wcet event and count wcet miss */
#ifdef RMSTAR_DEBUG
    rmstar_printf2("W%d",p);
#endif
    proc_table[p].control &= ~CONTROL_CAP;
    lev->wcet_miss[p]++;
  }
#ifdef RMSTAR_DEBUG
  rmstar_printf(")");
#endif

  level_table[ lev->scheduling_level ]->
    guest_epilogue(lev->scheduling_level,p);

  proc_table[p].status = RMSTAR_READY;
}

static void RMSTAR_task_activate(LEVEL l, PID p)
{
  RMSTAR_level_des *lev = (RMSTAR_level_des *)(level_table[l]);

#ifdef RMSTAR_DEBUG
  rmstar_printf("(E:act)");
#endif

  /* Test if we are trying to activate a non sleeping task    */
  /* save activation (only if needed... */
  if (proc_table[p].status != SLEEP) {
    /* a periodic task cannot be activated when it is already active */
    kern_raise(XACTIVATION,p);
    return;
  }

  ll_gettime(TIME_EXACT, &proc_table[p].request_time);

  RMSTAR_internal_activate(lev,p);

  /* Set the deadline timer */
  lev->deadline_timer[p] = kern_event_post(&lev->deadline_timespec[p],
                                           RMSTAR_timer_deadline,
                                           (void *)p);

}

static void RMSTAR_task_insert(LEVEL l, PID p)
{
  RMSTAR_level_des *lev = (RMSTAR_level_des *)(level_table[l]);

#ifdef RMSTAR_DEBUG
  rmstar_printf("(E:ins)");
#endif

  /* Insert task in the correct position */
  proc_table[p].status = RMSTAR_READY;
  iq_priority_insert(p,&lev->ready);

  /* and check for preemption! */
  RMSTAR_check_preemption(lev);
}

static void RMSTAR_task_extract(LEVEL l, PID p)
{
  RMSTAR_level_des *lev = (RMSTAR_level_des *)(level_table[l]);

#ifdef RMSTAR_DEBUG
  rmstar_printf("(E:ext)");
#endif

  /* 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);

  /* and finally, a preemption check! (it will also call guest_end) */
  RMSTAR_check_preemption(lev);
}

static void RMSTAR_task_endcycle(LEVEL l, PID p)
{
  RMSTAR_level_des *lev = (RMSTAR_level_des *)(level_table[l]);
  struct timespec temp;

#ifdef RMSTAR_DEBUG
  rmstar_printf("(E:ecy ");
#endif

  /* 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);
  lev->activated = NIL;

  iq_extract(p,&lev->ready);

  /* we reset the capacity counters... */
  proc_table[p].avail_time = proc_table[p].wcet;

  if (lev->nact[p] > 0) {
#ifdef RMSTAR_DEBUG
    rmstar_printf2("E%d",p);
#endif

    /* Pending activation: reactivate the thread!!! */
    lev->nact[p]--;

    /* see also RMSTAR_timer_deadline */
    ll_gettime(TIME_EXACT, &proc_table[p].request_time);

    RMSTAR_internal_activate(lev,p);

    /* check if the deadline has already expired */
    temp = *iq_query_timespec(p, &lev->ready);
    if (TIMESPEC_A_LT_B(&temp, &schedule_time)) {
      /* count the deadline miss */
      lev->dline_miss[p]++;
      event_delete(lev->deadline_timer[p]);
    }

  }
  else {
#ifdef RMSTAR_DEBUG
    rmstar_printf("e%d",p);
#endif

    /* the task has terminated his job before it consume the wcet. All OK! */
    proc_table[p].status = RMSTAR_IDLE;

    /* and finally, a preemption check! */
    RMSTAR_check_preemption(lev);

    /* when the deadline timer fire, it recognize the situation and set
       correctly all the stuffs (like reactivation, request_time, etc... ) */
  }
#ifdef RMSTAR_DEBUG
  rmstar_printf(")");
#endif
}

static void RMSTAR_task_end(LEVEL l, PID p)
{
  RMSTAR_level_des *lev = (RMSTAR_level_des *)(level_table[l]);

#ifdef RMSTAR_DEBUG
  rmstar_printf("(E:end)");
#endif

  iq_extract(p,&lev->ready);

  /* we finally put the task in the ready queue */
  proc_table[p].status = FREE;
 
  iq_insertfirst(p,&freedesc);
 
  if (lev->deadline_timer[p] != -1) {
    event_delete(lev->deadline_timer[p]);
  }

  /* and finally, a preemption check! (it will also call guest_end) */
  RMSTAR_check_preemption(lev);
}

static void RMSTAR_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 RMSTAR ready queue. */

static int RMSTAR_guest_create(LEVEL l, PID p, TASK_MODEL *m)
{
  RMSTAR_level_des *lev = (RMSTAR_level_des *)(level_table[l]);
  JOB_TASK_MODEL *job = (JOB_TASK_MODEL *)m;

  /* if the RMSTAR_guest_create is called, then the pclass must be a
     valid pclass. */

  *iq_query_timespec(p, &lev->ready) = job->deadline;
 
  lev->deadline_timer[p] = -1;
  lev->dline_miss[p]     = 0;
  lev->wcet_miss[p]      = 0;
  lev->nact[p]           = 0;

  if (job->noraiseexc)
    lev->flag[p] = RMSTAR_FLAG_NORAISEEXC;
  else
    lev->flag[p] = 0;

  lev->period[p] = job->period;
  *iq_query_priority(p, &lev->ready) = 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 RMSTAR_guest_detach(LEVEL l, PID p)
{
  /* the RMSTAR 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 RMSTAR_guest_dispatch(LEVEL l, PID p, int nostop)
{
  RMSTAR_level_des *lev = (RMSTAR_level_des *)(level_table[l]);

  level_table[ lev->scheduling_level ]->
    guest_dispatch(lev->scheduling_level,p,nostop);
}

static void RMSTAR_guest_epilogue(LEVEL l, PID p)
{
  RMSTAR_level_des *lev = (RMSTAR_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 = RMSTAR_READY;
}

static void RMSTAR_guest_activate(LEVEL l, PID p)
{
  RMSTAR_level_des *lev = (RMSTAR_level_des *)(level_table[l]);

  /* Insert task in the correct position */
  iq_priority_insert(p,&lev->ready);
  proc_table[p].status = RMSTAR_READY;

  /* check for preemption */
  RMSTAR_check_preemption(lev);

  /* Set the deadline timer */
  if (!(lev->flag[p] & RMSTAR_FLAG_NORAISEEXC))
    lev->deadline_timer[p] = kern_event_post(iq_query_timespec(p, &lev->ready),
                                             RMSTAR_timer_guest_deadline,
                                             (void *)p);

}

static void RMSTAR_guest_insert(LEVEL l, PID p)
{
  RMSTAR_level_des *lev = (RMSTAR_level_des *)(level_table[l]);

  /* Insert task in the correct position */
  iq_priority_insert(p,&lev->ready);
  proc_table[p].status = RMSTAR_READY;

  /* and check for preemption! */
  RMSTAR_check_preemption(lev);
}

static void RMSTAR_guest_extract(LEVEL l, PID p)
{
  RMSTAR_level_des *lev = (RMSTAR_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);

  /* and finally, a preemption check! (it will also call guest_end() */
  RMSTAR_check_preemption(lev);
}

static void RMSTAR_guest_end(LEVEL l, PID p)
{
  RMSTAR_level_des *lev = (RMSTAR_level_des *)(level_table[l]);

#ifdef RMSTAR_DEBUG
  //kern_printf("RMSTAR_guest_end: dline timer %d\n",lev->deadline_timer[p]);
#endif

  iq_extract(p, &lev->ready);

  /* we remove the deadline timer, because the slice is finished */
  if (lev->deadline_timer[p] != NIL) {
#ifdef RMSTAR_DEBUG
//    kern_printf("RMSTAR_guest_end: dline timer %d\n",lev->deadline_timer[p]);
#endif
    event_delete(lev->deadline_timer[p]);
    lev->deadline_timer[p] = NIL;
  }

  /* and finally, a preemption check! (it will also call guest_end() */
  RMSTAR_check_preemption(lev);
}

static void RMSTAR_guest_endcycle(LEVEL l, PID p)
{ kern_raise(XINVALID_GUEST,exec_shadow); }

static void RMSTAR_guest_sleep(LEVEL l, PID p)
{ kern_raise(XINVALID_GUEST,exec_shadow); }

/* Registration functions */

/* Registration function:
    int flags                 the init flags ... see RMSTAR.h */
LEVEL RMSTAR_register_level(int budget, int master)
{
  LEVEL l;            /* the level that we register */
  RMSTAR_level_des *lev;  /* for readableness only */
  PID i;              /* a counter */

#ifdef RMSTAR_DEBUG
  printk("RMSTAR_register_level\n");
#endif

  /* request an entry in the level_table */
  l = level_alloc_descriptor();

#ifdef RMSTAR_DEBUG
  printk("    alloco descrittore %d %d\n",l,(int)sizeof(RMSTAR_level_des));
#endif

  /* alloc the space needed for the RMSTAR_level_des */
  lev = (RMSTAR_level_des *)kern_alloc(sizeof(RMSTAR_level_des));

#ifdef RMSTAR_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,  RMSTAR_LEVELNAME, MAX_LEVELNAME);
  lev->l.level_code               = RMSTAR_LEVEL_CODE;
  lev->l.level_version            = RMSTAR_LEVEL_VERSION;

  lev->l.level_accept_task_model  = RMSTAR_level_accept_task_model;
  lev->l.level_accept_guest_model = RMSTAR_level_accept_guest_model;
  lev->l.level_status             = RMSTAR_level_status;
  lev->l.level_scheduler          = RMSTAR_level_scheduler;
  lev->l.level_guarantee          = NULL;
  lev->l.task_create              = RMSTAR_task_create;
  lev->l.task_detach              = RMSTAR_task_detach;
  lev->l.task_eligible            = RMSTAR_task_eligible;
  lev->l.task_dispatch            = RMSTAR_task_dispatch;
  lev->l.task_epilogue            = RMSTAR_task_epilogue;
  lev->l.task_activate            = RMSTAR_task_activate;
  lev->l.task_insert              = RMSTAR_task_insert;
  lev->l.task_extract             = RMSTAR_task_extract;
  lev->l.task_endcycle            = RMSTAR_task_endcycle;
  lev->l.task_end                 = RMSTAR_task_end;
  lev->l.task_sleep               = RMSTAR_task_sleep;

  lev->l.guest_create             = RMSTAR_guest_create;
  lev->l.guest_detach             = RMSTAR_guest_detach;
  lev->l.guest_dispatch           = RMSTAR_guest_dispatch;
  lev->l.guest_epilogue           = RMSTAR_guest_epilogue;
  lev->l.guest_activate           = RMSTAR_guest_activate;
  lev->l.guest_insert             = RMSTAR_guest_insert;
  lev->l.guest_extract            = RMSTAR_guest_extract;
  lev->l.guest_endcycle           = RMSTAR_guest_endcycle;
  lev->l.guest_end                = RMSTAR_guest_end;
  lev->l.guest_sleep              = RMSTAR_guest_sleep;

  /* fill the RMSTAR descriptor part */
  for(i=0; i<MAX_PROC; i++) {
    lev->period[i]         = 0;
    lev->deadline_timer[i] = -1;
    lev->flag[i]           = 0;
    lev->dline_miss[i]     = 0;
    lev->wcet_miss[i]      = 0;
    lev->nact[i]           = 0;
  }

  iq_init(&lev->ready, NULL, 0);
  lev->activated = NIL;

  lev->budget = budget;
  lev->scheduling_level = master;

  return l;
}

int RMSTAR_get_dline_miss(PID p)
{
  LEVEL l = proc_table[p].task_level;
  RMSTAR_level_des *lev = (RMSTAR_level_des *)(level_table[l]);
  if (lev->l.level_code    == RMSTAR_LEVEL_CODE &&
      lev->l.level_version == RMSTAR_LEVEL_VERSION)
    return lev->dline_miss[p];
  else
    return -1;
}

int RMSTAR_get_wcet_miss(PID p)
{
  LEVEL l = proc_table[p].task_level;
  RMSTAR_level_des *lev = (RMSTAR_level_des *)(level_table[l]);
  if (lev->l.level_code    == RMSTAR_LEVEL_CODE &&
      lev->l.level_version == RMSTAR_LEVEL_VERSION)
    return lev->wcet_miss[p];
  else
    return -1;
}

int RMSTAR_get_nact(PID p)
{
  LEVEL l = proc_table[p].task_level;
  RMSTAR_level_des *lev = (RMSTAR_level_des *)(level_table[l]);
  if (lev->l.level_code    == RMSTAR_LEVEL_CODE &&
      lev->l.level_version == RMSTAR_LEVEL_VERSION)
    return lev->nact[p];
  else
    return -1;
}

int RMSTAR_reset_dline_miss(PID p)
{
  LEVEL l = proc_table[p].task_level;
  RMSTAR_level_des *lev = (RMSTAR_level_des *)(level_table[l]);
  if (lev->l.level_code    == RMSTAR_LEVEL_CODE &&
      lev->l.level_version == RMSTAR_LEVEL_VERSION)
  {
    lev->dline_miss[p] = 0;
    return 0;
  }
  else
    return -1;
}

int RMSTAR_reset_wcet_miss(PID p)
{
  LEVEL l = proc_table[p].task_level;
  RMSTAR_level_des *lev = (RMSTAR_level_des *)(level_table[l]);
  if (lev->l.level_code    == RMSTAR_LEVEL_CODE &&
      lev->l.level_version == RMSTAR_LEVEL_VERSION)
  {
    lev->wcet_miss[p] = 0;
    return 0;
  }
  else
    return -1;
}