Rev 3 | Go to most recent revision | Details | Last modification | View Log | RSS feed
| Rev | Author | Line No. | Line |
|---|---|---|---|
| 2 | pj | 1 | /* |
| 2 | * Project: S.Ha.R.K. |
||
| 3 | * |
||
| 4 | * Coordinators: |
||
| 5 | * Giorgio Buttazzo <giorgio@sssup.it> |
||
| 6 | * Paolo Gai <pj@gandalf.sssup.it> |
||
| 7 | * |
||
| 8 | * Authors : |
||
| 9 | * Paolo Gai <pj@gandalf.sssup.it> |
||
| 10 | * Massimiliano Giorgi <massy@gandalf.sssup.it> |
||
| 11 | * Luca Abeni <luca@gandalf.sssup.it> |
||
| 12 | * (see the web pages for full authors list) |
||
| 13 | * |
||
| 14 | * ReTiS Lab (Scuola Superiore S.Anna - Pisa - Italy) |
||
| 15 | * |
||
| 16 | * http://www.sssup.it |
||
| 17 | * http://retis.sssup.it |
||
| 18 | * http://shark.sssup.it |
||
| 19 | */ |
||
| 20 | |||
| 21 | /* |
||
| 22 | * Copyright (C) 1999,2000 Massimiliano Giorgi |
||
| 23 | * |
||
| 24 | * This program is free software; you can redistribute it and/or modify |
||
| 25 | * it under the terms of the GNU General Public License as published by |
||
| 26 | * the Free Software Foundation; either version 2 of the License, or |
||
| 27 | * (at your option) any later version. |
||
| 28 | * |
||
| 29 | * This program is distributed in the hope that it will be useful, |
||
| 30 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
||
| 31 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
||
| 32 | * GNU General Public License for more details. |
||
| 33 | * |
||
| 34 | * You should have received a copy of the GNU General Public License |
||
| 35 | * along with this program; if not, write to the Free Software |
||
| 36 | * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
||
| 37 | * |
||
| 38 | */ |
||
| 39 | |||
| 40 | #ifndef __SSTF_H |
||
| 41 | #define __SSTF_H |
||
| 42 | |||
| 43 | #include "phdsk.h" |
||
| 44 | #include "glue.h" |
||
| 45 | |||
| 46 | typedef struct TAGsstf_queue_t { |
||
| 47 | struct phdskinfo *disk; |
||
| 48 | /**/ |
||
| 49 | __b_fastmutex_t mutex; |
||
| 50 | struct request_prologue *actual; |
||
| 51 | struct request_prologue *lqueue; |
||
| 52 | struct request_prologue *hqueue; |
||
| 53 | int counter; |
||
| 54 | } sstf_queue_t; |
||
| 55 | |||
| 56 | struct request_specific { |
||
| 57 | void *next; |
||
| 58 | }; |
||
| 59 | |||
| 60 | #define bqueue_t sstf_queue_t |
||
| 61 | |||
| 62 | #define bqueue_init sstf_init |
||
| 63 | #define bqueue_numelements sstf_numelements |
||
| 64 | #define bqueue_insertrequest sstf_insertrequest |
||
| 65 | #define bqueue_getrequest sstf_getrequest |
||
| 66 | #define bqueue_removerequest sstf_removerequest |
||
| 67 | |||
| 68 | #endif |