diskpart.c revision 1.1 1 1.1 cgd /*
2 1.1 cgd * Copyright (c) 1983, 1988 Regents of the University of California.
3 1.1 cgd * All rights reserved.
4 1.1 cgd *
5 1.1 cgd * Redistribution and use in source and binary forms, with or without
6 1.1 cgd * modification, are permitted provided that the following conditions
7 1.1 cgd * are met:
8 1.1 cgd * 1. Redistributions of source code must retain the above copyright
9 1.1 cgd * notice, this list of conditions and the following disclaimer.
10 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer in the
12 1.1 cgd * documentation and/or other materials provided with the distribution.
13 1.1 cgd * 3. All advertising materials mentioning features or use of this software
14 1.1 cgd * must display the following acknowledgement:
15 1.1 cgd * This product includes software developed by the University of
16 1.1 cgd * California, Berkeley and its contributors.
17 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
18 1.1 cgd * may be used to endorse or promote products derived from this software
19 1.1 cgd * without specific prior written permission.
20 1.1 cgd *
21 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 1.1 cgd * SUCH DAMAGE.
32 1.1 cgd */
33 1.1 cgd
34 1.1 cgd #ifndef lint
35 1.1 cgd char copyright[] =
36 1.1 cgd "@(#) Copyright (c) 1983, 1988 Regents of the University of California.\n\
37 1.1 cgd All rights reserved.\n";
38 1.1 cgd #endif /* not lint */
39 1.1 cgd
40 1.1 cgd #ifndef lint
41 1.1 cgd static char sccsid[] = "@(#)diskpart.c 5.11 (Berkeley) 6/1/90";
42 1.1 cgd #endif /* not lint */
43 1.1 cgd
44 1.1 cgd /*
45 1.1 cgd * Program to calculate standard disk partition sizes.
46 1.1 cgd */
47 1.1 cgd #include <sys/param.h>
48 1.1 cgd #define DKTYPENAMES
49 1.1 cgd #include <sys/disklabel.h>
50 1.1 cgd
51 1.1 cgd #include <stdio.h>
52 1.1 cgd #include <ctype.h>
53 1.1 cgd
54 1.1 cgd #define for_now /* show all of `c' partition for disklabel */
55 1.1 cgd #define NPARTITIONS 8
56 1.1 cgd #define PART(x) (x - 'a')
57 1.1 cgd
58 1.1 cgd /*
59 1.1 cgd * Default partition sizes, where they exist.
60 1.1 cgd */
61 1.1 cgd #define NDEFAULTS 4
62 1.1 cgd int defpart[NDEFAULTS][NPARTITIONS] = {
63 1.1 cgd { 15884, 66880, 0, 15884, 307200, 0, 0, 291346 }, /* ~ 356+ Mbytes */
64 1.1 cgd { 15884, 33440, 0, 15884, 55936, 0, 0, 291346 }, /* ~ 206-355 Mbytes */
65 1.1 cgd { 15884, 33440, 0, 15884, 55936, 0, 0, 0 }, /* ~ 61-205 Mbytes */
66 1.1 cgd { 15884, 10032, 0, 15884, 0, 0, 0, 0 }, /* ~ 20-60 Mbytes */
67 1.1 cgd };
68 1.1 cgd
69 1.1 cgd /*
70 1.1 cgd * Each array defines a layout for a disk;
71 1.1 cgd * that is, the collection of partitions totally
72 1.1 cgd * covers the physical space on a disk.
73 1.1 cgd */
74 1.1 cgd #define NLAYOUTS 3
75 1.1 cgd char layouts[NLAYOUTS][NPARTITIONS] = {
76 1.1 cgd { 'a', 'b', 'h', 'g' },
77 1.1 cgd { 'a', 'b', 'h', 'd', 'e', 'f' },
78 1.1 cgd { 'c' },
79 1.1 cgd };
80 1.1 cgd
81 1.1 cgd /*
82 1.1 cgd * Default disk block and disk block fragment
83 1.1 cgd * sizes for each file system. Those file systems
84 1.1 cgd * with zero block and frag sizes are special cases
85 1.1 cgd * (e.g. swap areas or for access to the entire device).
86 1.1 cgd */
87 1.1 cgd struct partition defparam[NPARTITIONS] = {
88 1.1 cgd { 0, 0, 1024, FS_UNUSED, 8, 0 }, /* a */
89 1.1 cgd { 0, 0, 1024, FS_SWAP, 8, 0 }, /* b */
90 1.1 cgd { 0, 0, 1024, FS_UNUSED, 8, 0 }, /* c */
91 1.1 cgd { 0, 0, 512, FS_UNUSED, 8, 0 }, /* d */
92 1.1 cgd { 0, 0, 1024, FS_UNUSED, 8, 0 }, /* e */
93 1.1 cgd { 0, 0, 1024, FS_UNUSED, 8, 0 }, /* f */
94 1.1 cgd { 0, 0, 1024, FS_UNUSED, 8, 0 }, /* g */
95 1.1 cgd { 0, 0, 1024, FS_UNUSED, 8, 0 } /* h */
96 1.1 cgd };
97 1.1 cgd
98 1.1 cgd /*
99 1.1 cgd * Each disk has some space reserved for a bad sector
100 1.1 cgd * forwarding table. DEC standard 144 uses the first
101 1.1 cgd * 5 even numbered sectors in the last track of the
102 1.1 cgd * last cylinder for replicated storage of the bad sector
103 1.1 cgd * table; another 126 sectors past this is needed as a
104 1.1 cgd * pool of replacement sectors.
105 1.1 cgd */
106 1.1 cgd int badsecttable = 126; /* # sectors */
107 1.1 cgd
108 1.1 cgd int pflag; /* print device driver partition tables */
109 1.1 cgd int dflag; /* print disktab entry */
110 1.1 cgd
111 1.1 cgd struct disklabel *promptfordisk();
112 1.1 cgd
113 1.1 cgd main(argc, argv)
114 1.1 cgd int argc;
115 1.1 cgd char *argv[];
116 1.1 cgd {
117 1.1 cgd struct disklabel *dp;
118 1.1 cgd register int curcyl, spc, def, part, layout, j;
119 1.1 cgd int threshhold, numcyls[NPARTITIONS], startcyl[NPARTITIONS];
120 1.1 cgd int totsize = 0;
121 1.1 cgd char *lp, *tyname;
122 1.1 cgd
123 1.1 cgd argc--, argv++;
124 1.1 cgd if (argc < 1) {
125 1.1 cgd fprintf(stderr,
126 1.1 cgd "usage: disktab [ -p ] [ -d ] [ -s size ] disk-type\n");
127 1.1 cgd exit(1);
128 1.1 cgd }
129 1.1 cgd if (argc > 0 && strcmp(*argv, "-p") == 0) {
130 1.1 cgd pflag++;
131 1.1 cgd argc--, argv++;
132 1.1 cgd }
133 1.1 cgd if (argc > 0 && strcmp(*argv, "-d") == 0) {
134 1.1 cgd dflag++;
135 1.1 cgd argc--, argv++;
136 1.1 cgd }
137 1.1 cgd if (argc > 1 && strcmp(*argv, "-s") == 0) {
138 1.1 cgd totsize = atoi(argv[1]);
139 1.1 cgd argc += 2, argv += 2;
140 1.1 cgd }
141 1.1 cgd dp = getdiskbyname(*argv);
142 1.1 cgd if (dp == NULL) {
143 1.1 cgd if (isatty(0))
144 1.1 cgd dp = promptfordisk(*argv);
145 1.1 cgd if (dp == NULL) {
146 1.1 cgd fprintf(stderr, "%s: unknown disk type\n", *argv);
147 1.1 cgd exit(2);
148 1.1 cgd }
149 1.1 cgd } else {
150 1.1 cgd if (dp->d_flags & D_REMOVABLE)
151 1.1 cgd tyname = "removable";
152 1.1 cgd else if (dp->d_flags & D_RAMDISK)
153 1.1 cgd tyname = "simulated";
154 1.1 cgd else
155 1.1 cgd tyname = "winchester";
156 1.1 cgd }
157 1.1 cgd spc = dp->d_secpercyl;
158 1.1 cgd /*
159 1.1 cgd * Bad sector table contains one track for the replicated
160 1.1 cgd * copies of the table and enough full tracks preceding
161 1.1 cgd * the last track to hold the pool of free blocks to which
162 1.1 cgd * bad sectors are mapped.
163 1.1 cgd * If disk size was specified explicitly, use specified size.
164 1.1 cgd */
165 1.1 cgd if (dp->d_type == DTYPE_SMD && dp->d_flags & D_BADSECT &&
166 1.1 cgd totsize == 0) {
167 1.1 cgd badsecttable = dp->d_nsectors +
168 1.1 cgd roundup(badsecttable, dp->d_nsectors);
169 1.1 cgd threshhold = howmany(spc, badsecttable);
170 1.1 cgd } else {
171 1.1 cgd badsecttable = 0;
172 1.1 cgd threshhold = 0;
173 1.1 cgd }
174 1.1 cgd /*
175 1.1 cgd * If disk size was specified, recompute number of cylinders
176 1.1 cgd * that may be used, and set badsecttable to any remaining
177 1.1 cgd * fraction of the last cylinder.
178 1.1 cgd */
179 1.1 cgd if (totsize != 0) {
180 1.1 cgd dp->d_ncylinders = howmany(totsize, spc);
181 1.1 cgd badsecttable = spc * dp->d_ncylinders - totsize;
182 1.1 cgd }
183 1.1 cgd
184 1.1 cgd /*
185 1.1 cgd * Figure out if disk is large enough for
186 1.1 cgd * expanded swap area and 'd', 'e', and 'f'
187 1.1 cgd * partitions. Otherwise, use smaller defaults
188 1.1 cgd * based on RK07.
189 1.1 cgd */
190 1.1 cgd for (def = 0; def < NDEFAULTS; def++) {
191 1.1 cgd curcyl = 0;
192 1.1 cgd for (part = PART('a'); part < NPARTITIONS; part++)
193 1.1 cgd curcyl += howmany(defpart[def][part], spc);
194 1.1 cgd if (curcyl < dp->d_ncylinders - threshhold)
195 1.1 cgd break;
196 1.1 cgd }
197 1.1 cgd if (def >= NDEFAULTS) {
198 1.1 cgd fprintf(stderr, "%s: disk too small, calculate by hand\n",
199 1.1 cgd *argv);
200 1.1 cgd exit(3);
201 1.1 cgd }
202 1.1 cgd
203 1.1 cgd /*
204 1.1 cgd * Calculate number of cylinders allocated to each disk
205 1.1 cgd * partition. We may waste a bit of space here, but it's
206 1.1 cgd * in the interest of (very backward) compatibility
207 1.1 cgd * (for mixed disk systems).
208 1.1 cgd */
209 1.1 cgd for (curcyl = 0, part = PART('a'); part < NPARTITIONS; part++) {
210 1.1 cgd numcyls[part] = 0;
211 1.1 cgd if (defpart[def][part] != 0) {
212 1.1 cgd numcyls[part] = howmany(defpart[def][part], spc);
213 1.1 cgd curcyl += numcyls[part];
214 1.1 cgd }
215 1.1 cgd }
216 1.1 cgd numcyls[PART('f')] = dp->d_ncylinders - curcyl;
217 1.1 cgd numcyls[PART('g')] =
218 1.1 cgd numcyls[PART('d')] + numcyls[PART('e')] + numcyls[PART('f')];
219 1.1 cgd numcyls[PART('c')] = dp->d_ncylinders;
220 1.1 cgd defpart[def][PART('f')] = numcyls[PART('f')] * spc - badsecttable;
221 1.1 cgd defpart[def][PART('g')] = numcyls[PART('g')] * spc - badsecttable;
222 1.1 cgd defpart[def][PART('c')] = numcyls[PART('c')] * spc;
223 1.1 cgd #ifndef for_now
224 1.1 cgd if (totsize || !pflag)
225 1.1 cgd #else
226 1.1 cgd if (totsize)
227 1.1 cgd #endif
228 1.1 cgd defpart[def][PART('c')] -= badsecttable;
229 1.1 cgd
230 1.1 cgd /*
231 1.1 cgd * Calculate starting cylinder number for each partition.
232 1.1 cgd * Note the 'h' partition is physically located before the
233 1.1 cgd * 'g' or 'd' partition. This is reflected in the layout
234 1.1 cgd * arrays defined above.
235 1.1 cgd */
236 1.1 cgd for (layout = 0; layout < NLAYOUTS; layout++) {
237 1.1 cgd curcyl = 0;
238 1.1 cgd for (lp = layouts[layout]; *lp != 0; lp++) {
239 1.1 cgd startcyl[PART(*lp)] = curcyl;
240 1.1 cgd curcyl += numcyls[PART(*lp)];
241 1.1 cgd }
242 1.1 cgd }
243 1.1 cgd
244 1.1 cgd if (pflag) {
245 1.1 cgd printf("}, %s_sizes[%d] = {\n", dp->d_typename, NPARTITIONS);
246 1.1 cgd for (part = PART('a'); part < NPARTITIONS; part++) {
247 1.1 cgd if (numcyls[part] == 0) {
248 1.1 cgd printf("\t0,\t0,\n");
249 1.1 cgd continue;
250 1.1 cgd }
251 1.1 cgd if (dp->d_type != DTYPE_MSCP) {
252 1.1 cgd printf("\t%d,\t%d,\t\t/* %c=cyl %d thru %d */\n",
253 1.1 cgd defpart[def][part], startcyl[part],
254 1.1 cgd 'A' + part, startcyl[part],
255 1.1 cgd startcyl[part] + numcyls[part] - 1);
256 1.1 cgd continue;
257 1.1 cgd }
258 1.1 cgd printf("\t%d,\t%d,\t\t/* %c=sectors %d thru %d */\n",
259 1.1 cgd defpart[def][part], spc * startcyl[part],
260 1.1 cgd 'A' + part, spc * startcyl[part],
261 1.1 cgd spc * startcyl[part] + defpart[def][part] - 1);
262 1.1 cgd }
263 1.1 cgd exit(0);
264 1.1 cgd }
265 1.1 cgd if (dflag) {
266 1.1 cgd int nparts;
267 1.1 cgd
268 1.1 cgd /*
269 1.1 cgd * In case the disk is in the ``in-between'' range
270 1.1 cgd * where the 'g' partition is smaller than the 'h'
271 1.1 cgd * partition, reverse the frag sizes so the /usr partition
272 1.1 cgd * is always set up with a frag size larger than the
273 1.1 cgd * user's partition.
274 1.1 cgd */
275 1.1 cgd if (defpart[def][PART('g')] < defpart[def][PART('h')]) {
276 1.1 cgd int temp;
277 1.1 cgd
278 1.1 cgd temp = defparam[PART('h')].p_fsize;
279 1.1 cgd defparam[PART('h')].p_fsize =
280 1.1 cgd defparam[PART('g')].p_fsize;
281 1.1 cgd defparam[PART('g')].p_fsize = temp;
282 1.1 cgd }
283 1.1 cgd printf("%s:\\\n", dp->d_typename);
284 1.1 cgd printf("\t:ty=%s:ns#%d:nt#%d:nc#%d:", tyname,
285 1.1 cgd dp->d_nsectors, dp->d_ntracks, dp->d_ncylinders);
286 1.1 cgd if (dp->d_secpercyl != dp->d_nsectors * dp->d_ntracks)
287 1.1 cgd printf("sc#%d:", dp->d_secpercyl);
288 1.1 cgd if (dp->d_type == DTYPE_SMD && dp->d_flags & D_BADSECT)
289 1.1 cgd printf("sf:");
290 1.1 cgd printf("\\\n\t:dt=%s:", dktypenames[dp->d_type]);
291 1.1 cgd for (part = NDDATA - 1; part >= 0; part--)
292 1.1 cgd if (dp->d_drivedata[part])
293 1.1 cgd break;
294 1.1 cgd for (j = 0; j <= part; j++)
295 1.1 cgd printf("d%d#%d:", j, dp->d_drivedata[j]);
296 1.1 cgd printf("\\\n");
297 1.1 cgd for (nparts = 0, part = PART('a'); part < NPARTITIONS; part++)
298 1.1 cgd if (defpart[def][part] != 0)
299 1.1 cgd nparts++;
300 1.1 cgd for (part = PART('a'); part < NPARTITIONS; part++) {
301 1.1 cgd if (defpart[def][part] == 0)
302 1.1 cgd continue;
303 1.1 cgd printf("\t:p%c#%d:", 'a' + part, defpart[def][part]);
304 1.1 cgd printf("o%c#%d:b%c#%d:f%c#%d:",
305 1.1 cgd 'a' + part, spc * startcyl[part],
306 1.1 cgd 'a' + part,
307 1.1 cgd defparam[part].p_frag * defparam[part].p_fsize,
308 1.1 cgd 'a' + part, defparam[part].p_fsize);
309 1.1 cgd if (defparam[part].p_fstype == FS_SWAP)
310 1.1 cgd printf("t%c=swap:", 'a' + part);
311 1.1 cgd nparts--;
312 1.1 cgd printf("%s\n", nparts > 0 ? "\\" : "");
313 1.1 cgd }
314 1.1 cgd #ifdef for_now
315 1.1 cgd defpart[def][PART('c')] -= badsecttable;
316 1.1 cgd part = PART('c');
317 1.1 cgd printf("#\t:p%c#%d:", 'a' + part, defpart[def][part]);
318 1.1 cgd printf("o%c#%d:b%c#%d:f%c#%d:\n",
319 1.1 cgd 'a' + part, spc * startcyl[part],
320 1.1 cgd 'a' + part,
321 1.1 cgd defparam[part].p_frag * defparam[part].p_fsize,
322 1.1 cgd 'a' + part, defparam[part].p_fsize);
323 1.1 cgd #endif
324 1.1 cgd exit(0);
325 1.1 cgd }
326 1.1 cgd printf("%s: #sectors/track=%d, #tracks/cylinder=%d #cylinders=%d\n",
327 1.1 cgd dp->d_typename, dp->d_nsectors, dp->d_ntracks,
328 1.1 cgd dp->d_ncylinders);
329 1.1 cgd printf("\n Partition\t Size\t Offset\t Range\n");
330 1.1 cgd for (part = PART('a'); part < NPARTITIONS; part++) {
331 1.1 cgd printf("\t%c\t", 'a' + part);
332 1.1 cgd if (numcyls[part] == 0) {
333 1.1 cgd printf(" unused\n");
334 1.1 cgd continue;
335 1.1 cgd }
336 1.1 cgd printf("%7d\t%7d\t%4d - %d%s\n",
337 1.1 cgd defpart[def][part], startcyl[part] * spc,
338 1.1 cgd startcyl[part], startcyl[part] + numcyls[part] - 1,
339 1.1 cgd defpart[def][part] % spc ? "*" : "");
340 1.1 cgd }
341 1.1 cgd }
342 1.1 cgd
343 1.1 cgd struct disklabel disk;
344 1.1 cgd
345 1.1 cgd struct field {
346 1.1 cgd char *f_name;
347 1.1 cgd char *f_defaults;
348 1.1 cgd u_long *f_location;
349 1.1 cgd } fields[] = {
350 1.1 cgd { "sector size", "512", &disk.d_secsize },
351 1.1 cgd { "#sectors/track", 0, &disk.d_nsectors },
352 1.1 cgd { "#tracks/cylinder", 0, &disk.d_ntracks },
353 1.1 cgd { "#cylinders", 0, &disk.d_ncylinders },
354 1.1 cgd { 0, 0, 0 },
355 1.1 cgd };
356 1.1 cgd
357 1.1 cgd struct disklabel *
358 1.1 cgd promptfordisk(name)
359 1.1 cgd char *name;
360 1.1 cgd {
361 1.1 cgd register struct disklabel *dp = &disk;
362 1.1 cgd register struct field *fp;
363 1.1 cgd register i;
364 1.1 cgd char buf[BUFSIZ], **tp, *cp, *gets();
365 1.1 cgd
366 1.1 cgd strncpy(dp->d_typename, name, sizeof(dp->d_typename));
367 1.1 cgd fprintf(stderr,
368 1.1 cgd "%s: unknown disk type, want to supply parameters (y/n)? ",
369 1.1 cgd name);
370 1.1 cgd (void) gets(buf);
371 1.1 cgd if (*buf != 'y')
372 1.1 cgd return ((struct disklabel *)0);
373 1.1 cgd for (;;) {
374 1.1 cgd fprintf(stderr, "Disk/controller type (%s)? ", dktypenames[1]);
375 1.1 cgd (void) gets(buf);
376 1.1 cgd if (buf[0] == 0)
377 1.1 cgd dp->d_type = 1;
378 1.1 cgd else
379 1.1 cgd dp->d_type = gettype(buf, dktypenames);
380 1.1 cgd if (dp->d_type >= 0)
381 1.1 cgd break;
382 1.1 cgd fprintf(stderr, "%s: unrecognized controller type\n", buf);
383 1.1 cgd fprintf(stderr, "use one of:\n", buf);
384 1.1 cgd for (tp = dktypenames; *tp; tp++)
385 1.1 cgd if (index(*tp, ' ') == 0)
386 1.1 cgd fprintf(stderr, "\t%s\n", *tp);
387 1.1 cgd }
388 1.1 cgd gettype:
389 1.1 cgd dp->d_flags = 0;
390 1.1 cgd fprintf(stderr, "type (winchester|removable|simulated)? ");
391 1.1 cgd (void) gets(buf);
392 1.1 cgd if (strcmp(buf, "removable") == 0)
393 1.1 cgd dp->d_flags = D_REMOVABLE;
394 1.1 cgd else if (strcmp(buf, "simulated") == 0)
395 1.1 cgd dp->d_flags = D_RAMDISK;
396 1.1 cgd else if (strcmp(buf, "winchester")) {
397 1.1 cgd fprintf(stderr, "%s: bad disk type\n", buf);
398 1.1 cgd goto gettype;
399 1.1 cgd }
400 1.1 cgd strncpy(dp->d_typename, buf, sizeof(dp->d_typename));
401 1.1 cgd fprintf(stderr, "(type <cr> to get default value, if only one)\n");
402 1.1 cgd if (dp->d_type == DTYPE_SMD)
403 1.1 cgd fprintf(stderr, "Do %ss support bad144 bad block forwarding (yes)? ",
404 1.1 cgd dp->d_typename);
405 1.1 cgd (void) gets(buf);
406 1.1 cgd if (*buf != 'n')
407 1.1 cgd dp->d_flags |= D_BADSECT;
408 1.1 cgd for (fp = fields; fp->f_name != NULL; fp++) {
409 1.1 cgd again:
410 1.1 cgd fprintf(stderr, "%s ", fp->f_name);
411 1.1 cgd if (fp->f_defaults != NULL)
412 1.1 cgd fprintf(stderr, "(%s)", fp->f_defaults);
413 1.1 cgd fprintf(stderr, "? ");
414 1.1 cgd cp = gets(buf);
415 1.1 cgd if (*cp == '\0') {
416 1.1 cgd if (fp->f_defaults == NULL) {
417 1.1 cgd fprintf(stderr, "no default value\n");
418 1.1 cgd goto again;
419 1.1 cgd }
420 1.1 cgd cp = fp->f_defaults;
421 1.1 cgd }
422 1.1 cgd *fp->f_location = atol(cp);
423 1.1 cgd if (*fp->f_location == 0) {
424 1.1 cgd fprintf(stderr, "%s: bad value\n", cp);
425 1.1 cgd goto again;
426 1.1 cgd }
427 1.1 cgd }
428 1.1 cgd fprintf(stderr, "sectors/cylinder (%d)? ",
429 1.1 cgd dp->d_nsectors * dp->d_ntracks);
430 1.1 cgd (void) gets(buf);
431 1.1 cgd if (buf[0] == 0)
432 1.1 cgd dp->d_secpercyl = dp->d_nsectors * dp->d_ntracks;
433 1.1 cgd else
434 1.1 cgd dp->d_secpercyl = atol(buf);
435 1.1 cgd fprintf(stderr, "Drive-type-specific parameters, <cr> to terminate:\n");
436 1.1 cgd for (i = 0; i < NDDATA; i++) {
437 1.1 cgd fprintf(stderr, "d%d? ", i);
438 1.1 cgd (void) gets(buf);
439 1.1 cgd if (buf[0] == 0)
440 1.1 cgd break;
441 1.1 cgd dp->d_drivedata[i] = atol(buf);
442 1.1 cgd }
443 1.1 cgd return (dp);
444 1.1 cgd }
445 1.1 cgd
446 1.1 cgd gettype(t, names)
447 1.1 cgd char *t;
448 1.1 cgd char **names;
449 1.1 cgd {
450 1.1 cgd register char **nm;
451 1.1 cgd
452 1.1 cgd for (nm = names; *nm; nm++)
453 1.1 cgd if (ustrcmp(t, *nm) == 0)
454 1.1 cgd return (nm - names);
455 1.1 cgd if (isdigit(*t))
456 1.1 cgd return (atoi(t));
457 1.1 cgd return (-1);
458 1.1 cgd }
459 1.1 cgd
460 1.1 cgd ustrcmp(s1, s2)
461 1.1 cgd register char *s1, *s2;
462 1.1 cgd {
463 1.1 cgd #define lower(c) (islower(c) ? (c) : tolower(c))
464 1.1 cgd
465 1.1 cgd for (; *s1; s1++, s2++) {
466 1.1 cgd if (*s1 == *s2)
467 1.1 cgd continue;
468 1.1 cgd if (isalpha(*s1) && isalpha(*s2) &&
469 1.1 cgd lower(*s1) == lower(*s2))
470 1.1 cgd continue;
471 1.1 cgd return (*s2 - *s1);
472 1.1 cgd }
473 1.1 cgd return (0);
474 1.1 cgd }
475