/**************************************************************************************
 Copyright (c) 2002 The UbixOS Project
 All rights reserved.

Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:

Redistributions of source code must retain the above copyright notice, this list of conditions, the following disclaimer and the list of authors.
Redistributions in binary form must reproduce the above copyright notice, this list of conditions, the following disclaimer and the list of authors
in the documentation and/or other materials provided with the distribution. Neither the name of the UbixOS Project nor the names of its
contributors may be used to endorse or promote products derived from this software without specific prior written permission.

THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED
WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

 $Id$

**************************************************************************************/

#ifndef _SCHEDULE_H
#define _SCHEDULE_H

#include <ubixos/types.h>

#define numTasks  1024
#define RUNABLE   3
#define ACTIVE    2
#define INACTIVE  1
#define AVAILABLE 0

struct tssStruct {
  short back_link;
  short back_link_reserved;
  long  esp0;
  short ss0;
  short ss0_reserved;
  long  esp1;
  short ss1;
  short ss1_reserved;
  long  esp2;
  short ss2;
  short ss2_reserved;
  long  cr3;
  long  eip;
  long  eflags;
  long  eax,ecx,edx,ebx;
  long  esp;
  long  ebp;
  long  esi;
  long  edi;
  short es;
  short es_reserved;
  short cs;
  short cs_reserved;
  short ss;
  short ss_reserved;
  short ds;
  short ds_reserved;
  short fs;
  short fs_reserved;
  short gs;
  short gs_reserved;
  short ldt;
  short ldt_reserved;
  long  trace_bitmap;   /* bits: trace 0, bitmap 16-31 */
  };

struct i387Struct {
  long cwd;
  long swd;
  long twd;
  long fip;
  long fcs;
  long foo;
  long fos;
  long st_space[20];   /* 8*10 bytes for each FP-reg = 80 bytes */
  };

struct taskStruct {
  struct tssStruct tss;
  struct i387Struct i387;
  uLong id;
  uShort status;
  uShort usedMath;
  uShort cpuTime;
  uShort uid;
  uShort gid;
  uLong pageDirectory;
  char fileImage[256];
  };

extern struct taskStruct *taskList;
extern struct taskStruct *_current,*_usedMath;
extern int currentProc;

void initScheduler();
int findTask();
void timerInt();
void schedule();

/* Stuff for queues...commenting out until I get a chance to test (so I don't break stuff).

const uint32_t schedMagicNumber = 0x253B9CF9;

struct waitQueueNode
{
	uint32_t id;
	
	void * data;
	
	struct waitQueueNode * next;
	struct waitQueueNode * prev;

};

struct waitQueue
{
	uint32_t magic_number;
	uint32_t type;
	
	struct waitQueueNode * first;
	struct waitQueueNode * last;		
	
} waitQueue_t;	

waitQueue_t * waitQueueCreate(int);
void waitQueueInit(waitQueue_t &, int);
void waitQueueDelete(waitQueue_t *);
void waitQueueUnInit(waitQueue_t &);

void waitQueueInsert(waitQueue_t *, void *, int);
void * waitQueueRemove(waitQueue_t *, int &);

*/

#endif