Rev 80 | Blame | Compare with Previous | Last modification | View Log | RSS feed
/*
* Project: S.Ha.R.K.
*
* Coordinators:
* Giorgio Buttazzo <giorgio@sssup.it>
* Paolo Gai <pj@gandalf.sssup.it>
*
* Authors :
* Paolo Gai <pj@gandalf.sssup.it>
* Massimiliano Giorgi <massy@gandalf.sssup.it>
* Luca Abeni <luca@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
*/
/*
* Copyright (C) 1999,2000 Massimiliano Giorgi
*
* 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
*
*/
#ifndef __FCFS_H
#define __FCFS_H
#include "phdsk.h"
#include "glue.h"
#include <arch/sys/cdefs.h>
__BEGIN_DECLS
typedef struct TAGfcfs_queue_t {
struct phdskinfo *disk;
/**/
__b_fastmutex_t mutex;
struct request_prologue *head;
struct request_prologue *tail;
int counter;
} fcfs_queue_t;
struct request_specific {
void *next;
};
#define bqueue_t fcfs_queue_t
#define bqueue_init fcfs_init
#define bqueue_numelements fcfs_numelements
#define bqueue_insertrequest fcfs_insertrequest
#define bqueue_getrequest fcfs_getrequest
#define bqueue_removerequest fcfs_removerequest
__END_DECLS
#endif