1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
|
/*-
* Copyright (c) 1999,2000 Jonathan Lemon
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR 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 AUTHOR 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.
*
* $FreeBSD$
*/
/*
* Disk driver for Compaq SMART RAID adapters.
*/
#include <sys/param.h>
#include <sys/systm.h>
#include <sys/kernel.h>
#include <sys/bio.h>
#include <sys/bus.h>
#include <sys/conf.h>
#include <sys/cons.h>
#include <machine/bus_memio.h>
#include <machine/bus_pio.h>
#include <machine/bus.h>
#include <sys/rman.h>
#include <vm/vm.h>
#include <vm/pmap.h>
#include <machine/md_var.h>
#include <geom/geom_disk.h>
#include <dev/ida/idareg.h>
#include <dev/ida/idavar.h>
/* prototypes */
static int idad_probe(device_t dev);
static int idad_attach(device_t dev);
static int idad_detach(device_t dev);
static d_strategy_t idad_strategy;
static dumper_t idad_dump;
static devclass_t idad_devclass;
static device_method_t idad_methods[] = {
DEVMETHOD(device_probe, idad_probe),
DEVMETHOD(device_attach, idad_attach),
DEVMETHOD(device_detach, idad_detach),
{ 0, 0 }
};
static driver_t idad_driver = {
"idad",
idad_methods,
sizeof(struct idad_softc)
};
DRIVER_MODULE(idad, ida, idad_driver, idad_devclass, 0, 0);
/*
* Read/write routine for a buffer. Finds the proper unit, range checks
* arguments, and schedules the transfer. Does not wait for the transfer
* to complete. Multi-page transfers are supported. All I/O requests must
* be a multiple of a sector in length.
*/
static void
idad_strategy(struct bio *bp)
{
struct idad_softc *drv;
int s;
drv = bp->bio_disk->d_drv1;
if (drv == NULL) {
bp->bio_error = EINVAL;
goto bad;
}
/*
* software write protect check
*/
if (drv->flags & DRV_WRITEPROT && (bp->bio_cmd == BIO_WRITE)) {
bp->bio_error = EROFS;
goto bad;
}
bp->bio_driver1 = drv;
s = splbio();
ida_submit_buf(drv->controller, bp);
splx(s);
return;
bad:
bp->bio_flags |= BIO_ERROR;
/*
* Correctly set the buf to indicate a completed transfer
*/
bp->bio_resid = bp->bio_bcount;
biodone(bp);
return;
}
static int
idad_dump(void *arg, void *virtual, vm_offset_t physical, off_t offset, size_t length)
{
struct idad_softc *drv;
int error = 0;
struct disk *dp;
dp = arg;
drv = dp->d_drv1;
if (drv == NULL)
return (ENXIO);
drv->controller->flags &= ~IDA_INTERRUPTS;
if (length > 0) {
error = ida_command(drv->controller, CMD_WRITE, virtual,
length, drv->drive, offset / DEV_BSIZE, DMA_DATA_OUT);
}
drv->controller->flags |= IDA_INTERRUPTS;
return (error);
}
void
idad_intr(struct bio *bp)
{
struct idad_softc *drv;
drv = bp->bio_disk->d_drv1;
if (bp->bio_flags & BIO_ERROR)
bp->bio_error = EIO;
else
bp->bio_resid = 0;
biodone(bp);
}
static int
idad_probe(device_t dev)
{
device_set_desc(dev, "Compaq Logical Drive");
return (0);
}
static int
idad_attach(device_t dev)
{
struct ida_drive_info dinfo;
struct idad_softc *drv;
device_t parent;
int error;
drv = (struct idad_softc *)device_get_softc(dev);
parent = device_get_parent(dev);
drv->controller = (struct ida_softc *)device_get_softc(parent);
drv->unit = device_get_unit(dev);
drv->drive = drv->controller->num_drives;
drv->controller->num_drives++;
error = ida_command(drv->controller, CMD_GET_LOG_DRV_INFO,
&dinfo, sizeof(dinfo), drv->drive, 0, DMA_DATA_IN);
if (error) {
device_printf(dev, "CMD_GET_LOG_DRV_INFO failed\n");
return (ENXIO);
}
drv->cylinders = dinfo.ncylinders;
drv->heads = dinfo.nheads;
drv->sectors = dinfo.nsectors;
drv->secsize = dinfo.secsize == 0 ? 512 : dinfo.secsize;
drv->secperunit = dinfo.secperunit;
/* XXX
* other initialization
*/
device_printf(dev, "%uMB (%u sectors), blocksize=%d\n",
drv->secperunit / ((1024 * 1024) / drv->secsize),
drv->secperunit, drv->secsize);
drv->disk.d_strategy = idad_strategy;
drv->disk.d_name = "idad";
drv->disk.d_dump = idad_dump;
drv->disk.d_sectorsize = drv->secsize;
drv->disk.d_mediasize = (off_t)drv->secperunit * drv->secsize;
drv->disk.d_fwsectors = drv->sectors;
drv->disk.d_fwheads = drv->heads;
drv->disk.d_drv1 = drv;
drv->disk.d_maxsize = DFLTPHYS; /* XXX guess? */
disk_create(drv->unit, &drv->disk, 0, NULL, NULL);
return (0);
}
static int
idad_detach(device_t dev)
{
struct idad_softc *drv;
drv = (struct idad_softc *)device_get_softc(dev);
disk_destroy(&drv->disk);
return (0);
}
|