|
|
1.1 root 1: /*
2: * Copyright (c) 1988 Regents of the University of California.
3: * All rights reserved.
4: *
5: * Redistribution is only permitted until one year after the first shipment
6: * of 4.4BSD by the Regents. Otherwise, redistribution and use in source and
7: * binary forms are permitted provided that: (1) source distributions retain
8: * this entire copyright notice and comment, and (2) distributions including
9: * binaries display the following acknowledgement: This product includes
10: * software developed by the University of California, Berkeley and its
11: * contributors'' in the documentation or other materials provided with the
12: * distribution and in all advertising materials mentioning features or use
13: * of this software. Neither the name of the University nor the names of
14: * its contributors may be used to endorse or promote products derived from
15: * this software without specific prior written permission.
16: * THIS SOFTWARE IS PROVIDED AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED
17: * WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF
18: * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
19: *
20: * @(#)conf.c 1.10 (Berkeley) 6/30/90
21: */
22:
23: #include "sys/param.h"
24: #include "sys/time.h"
25: #include "saio.h"
26:
27: extern int nullsys(), nodev(), noioctl();
28:
29: int vdstrategy(), vdopen();
30: int hdstrategy(), hdopen();
31: int cystrategy(), cyopen(), cyclose();
32:
33: struct devsw devsw[] = {
34: { "ud", nodev, nodev, nullsys, noioctl }, /* 0 = ud */
35: { "dk", vdstrategy, vdopen, nullsys, noioctl }, /* 1 = ht */
36: { "hd", hdstrategy, hdopen, nullsys, noioctl }, /* 2 = hd */
37: #ifdef notdef
38: { "xp", xpstrategy, xpopen, nullsys, noioctl }, /* 3 = xp */
39: #else
40: { "xp", nodev, nodev, nullsys, noioctl },
41: #endif
42: { "cy", cystrategy, cyopen, cyclose, noioctl }, /* 4 = cy */
43: { 0 }
44: };
45: int ndevs = (sizeof(devsw)/sizeof(devsw[0]));
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.