Subversion Repositories shark

Compare Revisions

Ignore whitespace Rev 1099 → Rev 1100

/demos/trunk/cbs_ft/cbs_ft.c
15,11 → 15,11
 
/**
------------
CVS : $Id: cbs_ft.c,v 1.1.1.1 2002-09-02 09:37:41 pj Exp $
CVS : $Id: cbs_ft.c,v 1.2 2002-10-28 08:14:58 pj Exp $
 
File: $File$
Revision: $Revision: 1.1.1.1 $
Last update: $Date: 2002-09-02 09:37:41 $
Revision: $Revision: 1.2 $
Last update: $Date: 2002-10-28 08:14:58 $
------------
 
This file contains the server CBS_FT
141,7 → 141,7
new = (struct cap_queue *)kern_alloc(sizeof(struct cap_queue));
if (new == NULL) {
kern_printf("\nNew cash_queue element failed\n");
kern_raise(XUNVALID_TASK, p);
kern_raise(XINVALID_TASK, p);
return -1;
}
new->next = NULL;
242,7 → 242,7
/* If the budget is still less than 0, an exception is raised */
if (proc_table[p].avail_time <= 0) {
kern_printf("\nnegative value for the budget!\n");
kern_raise(XUNVALID_TASK, p);
kern_raise(XINVALID_TASK, p);
return;
}
 
352,7 → 352,7
else {
/* this situation cannot occur */
kern_printf("\nTrying to reactivate a primary task which is not IDLE!\n");
kern_raise(XUNVALID_TASK,p);
kern_raise(XINVALID_TASK,p);
}
}
 
653,7 → 653,7
/* The budget must be greater than 0! */
if (proc_table[p].avail_time <= 0) {
kern_printf("\nBackup task starting with exhausted budget\n");
kern_raise(XUNVALID_TASK, p);
kern_raise(XINVALID_TASK, p);
lev->CP[p] = 0;
/* we kill the current activation */
level_table[ lev->scheduling_level ]->
679,7 → 679,7
if (lev->P_or_B[p] == BACKUP) {
kern_printf("\nTrying to activate a BACKUP task!\n");
kern_raise(XUNVALID_TASK, p);
kern_raise(XINVALID_TASK, p);
}
else {
726,7 → 726,7
static void CBS_FT_task_insert(LEVEL l, PID p)
{
printk("CBS_FT_task_insert\n");
kern_raise(XUNVALID_TASK,p);
kern_raise(XINVALID_TASK,p);
}
 
 
733,7 → 733,7
static void CBS_FT_task_extract(LEVEL l, PID p)
{
printk("CBS_FT_task_extract\n");
kern_raise(XUNVALID_TASK,p);
kern_raise(XINVALID_TASK,p);
}
 
 
798,7 → 798,7
in a new release */
if (lev->P_or_B[p] == BACKUP) {
kern_printf("\nKilling a BACKUP task!\n");
kern_raise(XUNVALID_TASK, p);
kern_raise(XINVALID_TASK, p);
return;
}
 
832,7 → 832,7
static void CBS_FT_task_sleep(LEVEL l, PID p)
{
printk("CBS_FT_task_sleep\n");
kern_raise(XUNVALID_TASK,p);
kern_raise(XINVALID_TASK,p);
}
 
 
839,42 → 839,42
static void CBS_FT_task_delay(LEVEL l, PID p, TIME usdelay)
{
printk("CBS_FT_task_delay\n");
kern_raise(XUNVALID_TASK,p);
kern_raise(XINVALID_TASK,p);
}
 
 
static int CBS_FT_guest_create(LEVEL l, PID p, TASK_MODEL *m)
{ kern_raise(XUNVALID_GUEST,exec_shadow); return 0; }
{ kern_raise(XINVALID_GUEST,exec_shadow); return 0; }
 
static void CBS_FT_guest_detach(LEVEL l, PID p)
{ kern_raise(XUNVALID_GUEST,exec_shadow); }
{ kern_raise(XINVALID_GUEST,exec_shadow); }
 
static void CBS_FT_guest_dispatch(LEVEL l, PID p, int nostop)
{ kern_raise(XUNVALID_GUEST,exec_shadow); }
{ kern_raise(XINVALID_GUEST,exec_shadow); }
 
static void CBS_FT_guest_epilogue(LEVEL l, PID p)
{ kern_raise(XUNVALID_GUEST,exec_shadow); }
{ kern_raise(XINVALID_GUEST,exec_shadow); }
 
static void CBS_FT_guest_activate(LEVEL l, PID p)
{ kern_raise(XUNVALID_GUEST,exec_shadow); }
{ kern_raise(XINVALID_GUEST,exec_shadow); }
 
static void CBS_FT_guest_insert(LEVEL l, PID p)
{ kern_raise(XUNVALID_GUEST,exec_shadow); }
{ kern_raise(XINVALID_GUEST,exec_shadow); }
 
static void CBS_FT_guest_extract(LEVEL l, PID p)
{ kern_raise(XUNVALID_GUEST,exec_shadow); }
{ kern_raise(XINVALID_GUEST,exec_shadow); }
 
static void CBS_FT_guest_endcycle(LEVEL l, PID p)
{ kern_raise(XUNVALID_GUEST,exec_shadow); }
{ kern_raise(XINVALID_GUEST,exec_shadow); }
 
static void CBS_FT_guest_end(LEVEL l, PID p)
{ kern_raise(XUNVALID_GUEST,exec_shadow); }
{ kern_raise(XINVALID_GUEST,exec_shadow); }
 
static void CBS_FT_guest_sleep(LEVEL l, PID p)
{ kern_raise(XUNVALID_GUEST,exec_shadow); }
{ kern_raise(XINVALID_GUEST,exec_shadow); }
 
static void CBS_FT_guest_delay(LEVEL l, PID p,DWORD tickdelay)
{ kern_raise(XUNVALID_GUEST,exec_shadow); }
{ kern_raise(XINVALID_GUEST,exec_shadow); }