ide: use u8 for xfer modes in ide-timing.h
[linux-2.6/linux-loongson.git] / drivers / ide / ide-timing.h
blobebe884d768811d28a60b5160972b834e8efbf03f
1 #ifndef _IDE_TIMING_H
2 #define _IDE_TIMING_H
4 /*
5 * Copyright (c) 1999-2001 Vojtech Pavlik
6 */
8 /*
9 * This program is free software; you can redistribute it and/or modify
10 * it under the terms of the GNU General Public License as published by
11 * the Free Software Foundation; either version 2 of the License, or
12 * (at your option) any later version.
14 * This program is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 * GNU General Public License for more details.
19 * You should have received a copy of the GNU General Public License
20 * along with this program; if not, write to the Free Software
21 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
23 * Should you need to contact me, the author, you can do so either by
24 * e-mail - mail your message to <vojtech@ucw.cz>, or by paper mail:
25 * Vojtech Pavlik, Simunkova 1594, Prague 8, 182 00 Czech Republic
28 #include <linux/kernel.h>
29 #include <linux/hdreg.h>
31 struct ide_timing {
32 u8 mode;
33 short setup; /* t1 */
34 short act8b; /* t2 for 8-bit io */
35 short rec8b; /* t2i for 8-bit io */
36 short cyc8b; /* t0 for 8-bit io */
37 short active; /* t2 or tD */
38 short recover; /* t2i or tK */
39 short cycle; /* t0 */
40 short udma; /* t2CYCTYP/2 */
44 * PIO 0-5, MWDMA 0-2 and UDMA 0-6 timings (in nanoseconds).
45 * These were taken from ATA/ATAPI-6 standard, rev 0a, except
46 * for PIO 5, which is a nonstandard extension and UDMA6, which
47 * is currently supported only by Maxtor drives.
50 static struct ide_timing ide_timing[] = {
52 { XFER_UDMA_6, 0, 0, 0, 0, 0, 0, 0, 15 },
53 { XFER_UDMA_5, 0, 0, 0, 0, 0, 0, 0, 20 },
54 { XFER_UDMA_4, 0, 0, 0, 0, 0, 0, 0, 30 },
55 { XFER_UDMA_3, 0, 0, 0, 0, 0, 0, 0, 45 },
57 { XFER_UDMA_2, 0, 0, 0, 0, 0, 0, 0, 60 },
58 { XFER_UDMA_1, 0, 0, 0, 0, 0, 0, 0, 80 },
59 { XFER_UDMA_0, 0, 0, 0, 0, 0, 0, 0, 120 },
61 { XFER_MW_DMA_2, 25, 0, 0, 0, 70, 25, 120, 0 },
62 { XFER_MW_DMA_1, 45, 0, 0, 0, 80, 50, 150, 0 },
63 { XFER_MW_DMA_0, 60, 0, 0, 0, 215, 215, 480, 0 },
65 { XFER_SW_DMA_2, 60, 0, 0, 0, 120, 120, 240, 0 },
66 { XFER_SW_DMA_1, 90, 0, 0, 0, 240, 240, 480, 0 },
67 { XFER_SW_DMA_0, 120, 0, 0, 0, 480, 480, 960, 0 },
69 { XFER_PIO_5, 20, 50, 30, 100, 50, 30, 100, 0 },
70 { XFER_PIO_4, 25, 70, 25, 120, 70, 25, 120, 0 },
71 { XFER_PIO_3, 30, 80, 70, 180, 80, 70, 180, 0 },
73 { XFER_PIO_2, 30, 290, 40, 330, 100, 90, 240, 0 },
74 { XFER_PIO_1, 50, 290, 93, 383, 125, 100, 383, 0 },
75 { XFER_PIO_0, 70, 290, 240, 600, 165, 150, 600, 0 },
77 { XFER_PIO_SLOW, 120, 290, 240, 960, 290, 240, 960, 0 },
79 { 0xff }
82 #define IDE_TIMING_SETUP 0x01
83 #define IDE_TIMING_ACT8B 0x02
84 #define IDE_TIMING_REC8B 0x04
85 #define IDE_TIMING_CYC8B 0x08
86 #define IDE_TIMING_8BIT 0x0e
87 #define IDE_TIMING_ACTIVE 0x10
88 #define IDE_TIMING_RECOVER 0x20
89 #define IDE_TIMING_CYCLE 0x40
90 #define IDE_TIMING_UDMA 0x80
91 #define IDE_TIMING_ALL 0xff
93 #define ENOUGH(v,unit) (((v)-1)/(unit)+1)
94 #define EZ(v,unit) ((v)?ENOUGH(v,unit):0)
96 #define XFER_MODE 0xf0
97 #define XFER_MWDMA 0x20
98 #define XFER_EPIO 0x01
99 #define XFER_PIO 0x00
101 static void ide_timing_quantize(struct ide_timing *t, struct ide_timing *q, int T, int UT)
103 q->setup = EZ(t->setup * 1000, T);
104 q->act8b = EZ(t->act8b * 1000, T);
105 q->rec8b = EZ(t->rec8b * 1000, T);
106 q->cyc8b = EZ(t->cyc8b * 1000, T);
107 q->active = EZ(t->active * 1000, T);
108 q->recover = EZ(t->recover * 1000, T);
109 q->cycle = EZ(t->cycle * 1000, T);
110 q->udma = EZ(t->udma * 1000, UT);
113 static void ide_timing_merge(struct ide_timing *a, struct ide_timing *b, struct ide_timing *m, unsigned int what)
115 if (what & IDE_TIMING_SETUP ) m->setup = max(a->setup, b->setup);
116 if (what & IDE_TIMING_ACT8B ) m->act8b = max(a->act8b, b->act8b);
117 if (what & IDE_TIMING_REC8B ) m->rec8b = max(a->rec8b, b->rec8b);
118 if (what & IDE_TIMING_CYC8B ) m->cyc8b = max(a->cyc8b, b->cyc8b);
119 if (what & IDE_TIMING_ACTIVE ) m->active = max(a->active, b->active);
120 if (what & IDE_TIMING_RECOVER) m->recover = max(a->recover, b->recover);
121 if (what & IDE_TIMING_CYCLE ) m->cycle = max(a->cycle, b->cycle);
122 if (what & IDE_TIMING_UDMA ) m->udma = max(a->udma, b->udma);
125 static struct ide_timing *ide_timing_find_mode(u8 speed)
127 struct ide_timing *t;
129 for (t = ide_timing; t->mode != speed; t++)
130 if (t->mode == 0xff)
131 return NULL;
132 return t;
135 static int ide_timing_compute(ide_drive_t *drive, u8 speed,
136 struct ide_timing *t, int T, int UT)
138 struct hd_driveid *id = drive->id;
139 struct ide_timing *s, p;
142 * Find the mode.
145 if (!(s = ide_timing_find_mode(speed)))
146 return -EINVAL;
149 * Copy the timing from the table.
152 *t = *s;
155 * If the drive is an EIDE drive, it can tell us it needs extended
156 * PIO/MWDMA cycle timing.
159 if (id && id->field_valid & 2) { /* EIDE drive */
161 memset(&p, 0, sizeof(p));
163 switch (speed & XFER_MODE) {
165 case XFER_PIO:
166 if (speed <= XFER_PIO_2) p.cycle = p.cyc8b = id->eide_pio;
167 else p.cycle = p.cyc8b = id->eide_pio_iordy;
168 break;
170 case XFER_MWDMA:
171 p.cycle = id->eide_dma_min;
172 break;
175 ide_timing_merge(&p, t, t, IDE_TIMING_CYCLE | IDE_TIMING_CYC8B);
179 * Convert the timing to bus clock counts.
182 ide_timing_quantize(t, t, T, UT);
185 * Even in DMA/UDMA modes we still use PIO access for IDENTIFY, S.M.A.R.T
186 * and some other commands. We have to ensure that the DMA cycle timing is
187 * slower/equal than the fastest PIO timing.
190 if ((speed & XFER_MODE) != XFER_PIO) {
191 u8 pio = ide_get_best_pio_mode(drive, 255, 5);
192 ide_timing_compute(drive, XFER_PIO_0 + pio, &p, T, UT);
193 ide_timing_merge(&p, t, t, IDE_TIMING_ALL);
197 * Lengthen active & recovery time so that cycle time is correct.
200 if (t->act8b + t->rec8b < t->cyc8b) {
201 t->act8b += (t->cyc8b - (t->act8b + t->rec8b)) / 2;
202 t->rec8b = t->cyc8b - t->act8b;
205 if (t->active + t->recover < t->cycle) {
206 t->active += (t->cycle - (t->active + t->recover)) / 2;
207 t->recover = t->cycle - t->active;
210 return 0;
213 #endif