-
Notifications
You must be signed in to change notification settings - Fork 2
/
devio.c
437 lines (349 loc) · 8.16 KB
/
devio.c
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
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
/**************************************************
UZI (Unix Z80 Implementation) Kernel: devio.c
***************************************************/
int ok(), nogood();
#define DEVIO
#include "unix.h"
#include "extern.h"
/* Buffer pool management */
/********************************************************
The high-level interface is through bread() and bfree().
Bread() is given a device and block number, and a rewrite flag.
If rewrite is 0, the block is actually read if it is not already
in the buffer pool. If rewrite is set, it is assumed that the caller
plans to rewrite the entire contents of the block, and it will
not be read in, but only have a buffer named after it.
Bfree() is given a buffer pointer and a dirty flag.
If the dirty flag is 0, the buffer is made available for further
use. If the flag is 1, the buffer is marked "dirty", and
it will eventually be written out to disk. If the flag is 2,
it will be immediately written out.
Zerobuf() returns a buffer of zeroes not belonging to any
device. It must be bfree'd after use, and must not be
dirty. It is used when a read() wants to read an unallocated
block of a file.
Bufsync() write outs all dirty blocks.
Note that a pointer to a buffer structure is the same as a
pointer to the data. This is very important.
********************************************************/
unsigned bufclock = 0; /* Time-stamp counter for LRU */
char *
bread( dev, blk, rewrite)
int dev;
blkno_t blk;
int rewrite;
{
register bufptr bp;
bufptr bfind();
bufptr freebuf();
if (bp = bfind(dev, blk))
{
if (bp->bf_busy)
panic("want busy block");
goto done;
}
bp = freebuf();
bp->bf_dev = dev;
bp->bf_blk = blk;
/* If rewrite is set, we are about to write over the entire block,
so we don't need the previous contents */
ifnot (rewrite)
if (bdread(bp) == -1)
{
udata.u_error = EIO;
return (NULL);
}
if (rewrite == 2)
bzero(bp->bf_data, 512);
done:
bp->bf_busy = 1;
bp->bf_time = ++bufclock; /* Time stamp it */
return (bp->bf_data);
}
brelse(bp)
bufptr bp;
{
bfree(bp, 0);
}
bawrite(bp)
bufptr bp;
{
bfree(bp, 1);
}
bfree(bp, dirty)
register bufptr bp;
int dirty;
{
bp->bf_dirty |= dirty;
bp->bf_busy = 0;
if (dirty == 2) /* Extra dirty */
{
if (bdwrite(bp) == -1)
udata.u_error = EIO;
bp->bf_dirty = 0;
return (-1);
}
return (0);
}
char *
zerobuf()
{
bufptr bp;
bufptr freebuf();
bp = freebuf();
bp->bf_dev = -1;
bzero(bp->bf_data,512);
return(bp->bf_data);
}
bufsync()
{
register bufptr bp;
for (bp=bufpool; bp < bufpool+NBUFS; ++bp)
{
if (bp->bf_dev != -1 && bp->bf_dirty)
bdwrite(bp);
}
}
bufptr
bfind(dev, blk)
int dev;
blkno_t blk;
{
register bufptr bp;
for (bp=bufpool; bp < bufpool+NBUFS; ++bp)
{
if (bp->bf_dev == dev && bp->bf_blk == blk)
return (bp);
}
return (NULL);
}
bufptr
freebuf()
{
register bufptr bp;
register bufptr oldest;
register int oldtime;
/* Try to find a non-busy buffer
and write out the data if it is dirty */
oldest = NULL;
oldtime = 0;
for (bp=bufpool; bp < bufpool+NBUFS; ++bp)
{
if (bufclock - bp->bf_time >= oldtime && !bp->bf_busy)
{
oldest = bp;
oldtime = bufclock - bp->bf_time;
}
}
ifnot (oldest)
panic("no free buffers");
if (oldest->bf_dirty)
{
if (bdwrite(oldest) == -1)
udata.u_error = EIO;
oldest->bf_dirty = 0;
}
return (oldest);
}
bufinit()
{
register bufptr bp;
for (bp=bufpool; bp < bufpool+NBUFS; ++bp)
{
bp->bf_dev = -1;
}
}
bufdump()
{
register bufptr j;
kprintf("\ndev\tblock\tdirty\tbusy\ttime clock %d\n", bufclock);
for (j=bufpool; j < bufpool+NBUFS; ++j)
kprintf("%d\t%u\t%d\t%d\t%u\n",
j->bf_dev,j->bf_blk,j->bf_dirty,j->bf_busy,j->bf_time);
}
/***************************************************
Bdread() and bdwrite() are the block device interface routines.
they are given a buffer pointer, which contains the device, block number,
and data location.
They basically validate the device and vector the call.
Cdread() and cdwrite are the same for character (or "raw") devices,
and are handed a device number.
Udata.u_base, count, and offset have the rest of the data.
****************************************************/
bdread(bp)
bufptr bp;
{
ifnot (validdev(bp->bf_dev))
panic("bdread: invalid dev");
udata.u_buf = bp;
return ((*dev_tab[bp->bf_dev].dev_read)(dev_tab[bp->bf_dev].minor, 0));
}
bdwrite(bp)
bufptr bp;
{
ifnot (validdev(bp->bf_dev))
panic("bdwrite: invalid dev");
udata.u_buf = bp;
return ((*dev_tab[bp->bf_dev].dev_write)(dev_tab[bp->bf_dev].minor, 0));
}
cdread(dev)
int dev;
{
ifnot (validdev(dev))
panic("cdread: invalid dev");
return ((*dev_tab[dev].dev_read)(dev_tab[dev].minor, 1));
}
cdwrite(dev)
int dev;
{
ifnot (validdev(dev))
panic("cdwrite: invalid dev");
return ((*dev_tab[dev].dev_write)(dev_tab[dev].minor, 1));
}
swapread(dev, blkno, nbytes, buf)
int dev;
blkno_t blkno;
unsigned nbytes;
char *buf;
{
swapbase = buf;
swapcnt = nbytes;
swapblk = blkno;
return ((*dev_tab[dev].dev_read)(dev_tab[dev].minor, 2));
}
swapwrite(dev, blkno, nbytes, buf)
int dev;
blkno_t blkno;
unsigned nbytes;
char *buf;
{
swapbase = buf;
swapcnt = nbytes;
swapblk = blkno;
return ((*dev_tab[dev].dev_write)(dev_tab[dev].minor, 2));
}
/**************************************************
The device driver read and write routines now have
only two arguments, minor and rawflag. If rawflag is
zero, a single block is desired, and the necessary data
can be found in udata.u_buf.
Otherwise, a "raw" or character read is desired, and
udata.u_offset, udata.u_count, and udata.u_base
should be consulted instead.
Any device other than a disk will have only raw access.
*****************************************************/
d_open(dev)
int dev;
{
ifnot (validdev(dev))
return(-1);
return ((*dev_tab[dev].dev_open)(dev_tab[dev].minor));
}
d_close(dev)
int dev;
{
ifnot (validdev(dev))
panic("d_close: bad device");
(*dev_tab[dev].dev_close)(dev_tab[dev].minor);
}
d_ioctl(dev,request,data)
int dev;
int request;
char *data;
{
ifnot (validdev(dev))
{
udata.u_error = ENXIO;
return(-1);
}
if((*dev_tab[dev].dev_ioctl)(dev_tab[dev].minor,request,data))
{
udata.u_error = EINVAL;
return(-1);
}
return(0);
}
static
ok()
{
return(0);
}
static
nogood()
{
return(-1);
}
validdev(dev)
{
return(dev >= 0 && dev < (sizeof(dev_tab)/sizeof(struct devsw)));
}
/*************************************************************
Character queue management routines
************************************************************/
/* add something to the tail */
insq(q,c)
register struct s_queue *q;
char c;
{
di();
if (q->q_count == q->q_size)
{
ei();
return(0);
}
*(q->q_tail) = c;
++q->q_count;
if (++q->q_tail >= q->q_base + q->q_size)
q->q_tail = q->q_base;
ei();
return(1);
}
/* Remove something from the head. */
remq(q,cp)
register struct s_queue *q;
char *cp;
{
di();
ifnot (q->q_count)
{
ei();
return(0);
}
*cp = *(q->q_head);
--q->q_count;
if (++q->q_head >= q->q_base + q->q_size)
q->q_head = q->q_base;
ei();
return(1);
}
/* Remove something from the tail; the most recently added char. */
uninsq(q,cp)
register struct s_queue *q;
char *cp;
{
di();
ifnot (q->q_count)
{
ei();
return(0);
}
--q->q_count;
if (--q->q_tail <= q->q_base)
q->q_tail = q->q_base + q->q_size - 1;
*cp = *(q->q_tail);
ei();
return(1);
}
/* Returns true if the queue has more characters than its wakeup number */
fullq(q)
struct s_queue *q;
{
di();
if (q->q_count > q->q_wakeup)
{
ei();
return (1);
}
ei();
return (0);
}