|
|
1.1 root 1: /*
2: * Copyright (c) 1991 The Regents of the University of California.
3: * All rights reserved.
4: *
5: * This code is derived from software contributed to Berkeley by
6: * Rick Macklem at The University of Guelph.
7: *
8: * Redistribution and use in source and binary forms, with or without
9: * modification, are permitted provided that the following conditions
10: * are met:
11: * 1. Redistributions of source code must retain the above copyright
12: * notice, this list of conditions and the following disclaimer.
13: * 2. Redistributions in binary form must reproduce the above copyright
14: * notice, this list of conditions and the following disclaimer in the
15: * documentation and/or other materials provided with the distribution.
16: * 3. All advertising materials mentioning features or use of this software
17: * must display the following acknowledgement:
18: * This product includes software developed by the University of
19: * California, Berkeley and its contributors.
20: * 4. Neither the name of the University nor the names of its contributors
21: * may be used to endorse or promote products derived from this software
22: * without specific prior written permission.
23: *
24: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34: * SUCH DAMAGE.
35: *
36: * @(#)nfsswapvmunix.c 7.1 (Berkeley) 3/4/91
37: */
38:
39: /*
40: * Sample NFS swapvmunix configuration file.
41: * This should be filled in by the bootstrap program.
42: * See /sys/nfs/nfsdiskless.h for details of the fields.
43: */
44:
45: #include "../sys/param.h"
46: #include "../sys/conf.h"
47: #include "../sys/socket.h"
48: #include "../sys/mount.h"
49: #include "../net/if.h"
50: #include "../nfs/nfsv2.h"
51: #include "../nfs/nfsdiskless.h"
52:
53: extern int nfs_mountroot();
54: int (*mountroot)() = nfs_mountroot;
55:
56: dev_t rootdev = NODEV;
57: dev_t argdev = NODEV;
58: dev_t dumpdev = NODEV;
59:
60: struct swdevt swdevt[] = {
61: { NODEV, 0, 5000 }, /* happy:/u/swap.dopey */
62: { 0, 0, 0 }
63: };
64: struct nfs_diskless nfs_diskless = {
65: { { 'q', 'e', '0', '\0' },
66: { 0x10, 0x2, { 0x0, 0x0, 0x83, 0x68, 0x30, 0x2, } },
67: { 0x10, 0x2, { 0x0, 0x0, 0x83, 0x68, 0x30, 0xff, } },
68: { 0x10, 0x0, { 0x0, 0x0, 0xff, 0xff, 0xff, 0x0, } },
69: },
70: { 0x10, 0x2, { 0x0, 0x0, 0x83, 0x68, 0x30, 0x12, } },
71: {
72: (struct sockaddr *)0, SOCK_DGRAM, 0, (nfsv2fh_t *)0,
73: 0, 8192, 8192, 10, 100, (char *)0,
74: },
75: {
76: 0xf,
77: 0x9,
78: 0x0,
79: 0x0,
80: 0x1,
81: 0x0,
82: 0x0,
83: 0x0,
84: 0xc,
85: 0x0,
86: 0x0,
87: 0x0,
88: 0x6,
89: 0x0,
90: 0x0,
91: 0x0,
92: 0x27,
93: 0x18,
94: 0x79,
95: 0x27,
96: 0x0,
97: 0x0,
98: 0x0,
99: 0x0,
100: 0x0,
101: 0x0,
102: 0x0,
103: 0x0,
104: 0x0,
105: 0x0,
106: 0x0,
107: 0x0,
108: },
109: { 0x10, 0x2, { 0x8, 0x1, 0x83, 0x68, 0x30, 0x5, } },
110: "happy",
111: {
112: (struct sockaddr *)0, SOCK_DGRAM, 0, (nfsv2fh_t *)0,
113: 0, 8192, 8192, 10, 100, (char *)0,
114: },
115: {
116: 0x0,
117: 0x9,
118: 0x0,
119: 0x0,
120: 0x1,
121: 0x0,
122: 0x0,
123: 0x0,
124: 0xc,
125: 0x0,
126: 0x0,
127: 0x0,
128: 0x2,
129: 0x0,
130: 0x0,
131: 0x0,
132: 0xd0,
133: 0x48,
134: 0x42,
135: 0x25,
136: 0x0,
137: 0x0,
138: 0x0,
139: 0x0,
140: 0x0,
141: 0x0,
142: 0x0,
143: 0x0,
144: 0x0,
145: 0x0,
146: 0x0,
147: 0x0,
148: },
149: { 0x10, 0x2, { 0x8, 0x1, 0x83, 0x68, 0x30, 0x5, } },
150: "happy",
151: };
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.