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
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
|
/*
* Copyright (c) 1993, 198019861988
* The Regents of the University of California. 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.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS 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 REGENTS 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.
*/
#ifndef lint
static const char copyright[] =
"@(#) Copyright (c) 1993, 198019861988\n\
The Regents of the University of California. All rights reserved.\n";
#endif /* not lint */
#ifndef lint
static const char sccsid[] = "@(#)bad144.c 8.1 (Berkeley) 6/6/93";
#endif /* not lint */
/*
* bad144
*
* This program prints and/or initializes a bad block record for a pack,
* in the format used by the DEC standard 144.
* It can also add bad sector(s) to the record, moving the sector
* replacements as necessary.
*
* It is preferable to write the bad information with a standard formatter,
* but this program will do.
*
* RP06 sectors are marked as bad by inverting the format bit in the
* header; on other drives the valid-sector bit is cleared.
*/
#include <sys/param.h>
#include <sys/dkbad.h>
#include <sys/ioctl.h>
#include <sys/file.h>
#include <sys/disklabel.h>
#include <ufs/ffs/fs.h>
#include <errno.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <paths.h>
#define RETRIES 10 /* number of retries on reading old sectors */
int fflag, add, copy, verbose, nflag, sflag;
int dups;
int badfile = -1; /* copy of badsector table to use, -1 if any */
#define MAXSECSIZE 1024
struct dkbad curbad, oldbad;
#define DKBAD_MAGIC 0x4321
char *buf;
char label[BBSIZE];
daddr_t size;
struct disklabel *dp;
char name[BUFSIZ];
u_short dkcksum __P((struct disklabel *lp));
int main __P((int argc, char *argv[]));
void blkzero __P((int f, daddr_t sn));
int compare __P((const void *cvb1, const void *cvb2));
daddr_t badsn __P((struct bt_bad *bt));
daddr_t getold __P((int f, struct dkbad *bad));
int blkcopy __P((int f, daddr_t s1, daddr_t s2));
void Perror __P((char *op));
void shift __P((int f, int new, int old));
int checkold __P((struct dkbad *oldbad));
void
bad_scan(argc, argv, dp, f, bstart, bend)
int *argc;
char ***argv;
struct disklabel *dp;
int f;
daddr_t bstart,bend;
{
int curr_sec, n;
int spc = dp->d_secpercyl;
int ss = dp->d_secsize;
int trk = dp->d_nsectors;
int i;
static char *nargv[DKBAD_MAXBAD];
static int nargc;
setbuf(stdout, NULL);
setbuf(stderr, NULL);
i = 1;
n = ioctl(f,DIOCSBADSCAN,&i);
if (n < 0)
perror("Couldn't set disk in \"badscan\" mode");
nargc = *argc;
memcpy(nargv,*argv,nargc * sizeof nargv[0]);
if (buf == (char *)NULL) {
buf = malloc((unsigned)(trk*ss));
if (buf == (char *)NULL) {
fprintf(stderr, "Out of memory\n");
exit(20);
}
}
/* scan the entire disk a sector at a time. Because of all the
* clustering in the kernel, we cannot scan a track at a time,
* If we do, we may have to read twice over the block to find
* exactly which one failed, and it may not fail second time.
*/
for (curr_sec = bstart; curr_sec < bend; curr_sec++) {
if (verbose) {
if ((curr_sec % spc) == 0)
printf("\r%7d of %7lu blocks (%3lu%%)",
curr_sec,bend,(curr_sec*100/bend));
}
lseek(f, curr_sec * ss, L_SET);
if ((n = read(f, buf, ss)) != ss) {
if (verbose)
printf("\rBlock: %7d will be marked BAD.\n",
curr_sec);
else
fprintf(stderr, "found bad sector: %d\n",
curr_sec);
sprintf(buf,"%d",curr_sec);
nargv[nargc++] = strdup(buf);
}
}
fprintf(stderr, "\n");
nargv[nargc] = 0;
*argc = nargc;
*argv = &nargv[0];
i = 0;
n = ioctl(f,DIOCSBADSCAN,&i);
if (n < 0)
perror("Couldn't reset disk from \"badscan\" mode");
}
int
main(argc, argv)
int argc;
char *argv[];
{
register struct bt_bad *bt;
daddr_t sn, bn[DKBAD_MAXBAD];
int i, f, nbad, new, bad, errs;
daddr_t bstart, bend;
argc--, argv++;
while (argc > 0 && **argv == '-') {
(*argv)++;
while (**argv) {
switch (**argv) {
#if vax
case 'f':
fflag++;
break;
#endif
case 'a':
add++;
break;
case 'c':
copy++;
break;
case 'v':
verbose++;
break;
case 'n':
nflag++;
verbose++;
break;
case 's': /* scan partition */
sflag++;
add++;
break;
default:
if (**argv >= '0' && **argv <= '4') {
badfile = **argv - '0';
break;
}
goto usage;
}
(*argv)++;
}
argc--, argv++;
}
if (argc < 1) {
usage:
fprintf(stderr,
"usage: bad144 [ -f ] disk [ snum [ bn ... ] ]\n");
fprintf(stderr,
"to read or overwrite bad-sector table, e.g.: bad144 hp0\n");
fprintf(stderr,
"or bad144 -a [ -f ] [ -c ] disk bn ...\n");
fprintf(stderr, "or bad144 -s [ -v ] disk\n");
fprintf(stderr, "where options are:\n");
fprintf(stderr, "\t-a add new bad sectors to the table\n");
fprintf(stderr, "\t-f reformat listed sectors as bad\n");
fprintf(stderr, "\t-c copy original sector to replacement\n");
fprintf(stderr, "\t-s scan entire slice for bad sectors\n");
exit(1);
}
if (argv[0][0] != '/')
(void)sprintf(name, "%sr%s%c", _PATH_DEV, argv[0],
'a' + RAW_PART);
else
strcpy(name, argv[0]);
f = open(name, !sflag && argc == 1? O_RDONLY : O_RDWR);
if (f < 0)
Perror(name);
if (read(f, label, sizeof(label)) < 0)
Perror("read");
for (dp = (struct disklabel *)(label + LABELOFFSET);
dp < (struct disklabel *)
(label + sizeof(label) - sizeof(struct disklabel));
dp = (struct disklabel *)((char *)dp + 64))
if (dp->d_magic == DISKMAGIC && dp->d_magic2 == DISKMAGIC)
break;
if (dp->d_magic != DISKMAGIC || dp->d_magic2 != DISKMAGIC) {
fprintf(stderr, "Bad pack magic number (pack is unlabeled)\n");
exit(1);
}
if (dp->d_secsize > MAXSECSIZE || dp->d_secsize <= 0) {
fprintf(stderr, "Disk sector size too large/small (%lu)\n",
dp->d_secsize);
exit(7);
}
size = dp->d_secperunit;
/*
* bstart is 0 since we should always be doing partition c of a slice
* bend is the size of the slice, less the bad block map track
* and the DKBAD_MAXBAD replacement blocks
*/
bstart = 0;
bend = size - (dp->d_nsectors + DKBAD_MAXBAD);
if (verbose) {
printf("cyl: %ld, tracks: %ld, secs: %ld, "
"sec/cyl: %ld, start: %ld, end: %ld\n",
dp->d_ncylinders, dp->d_ntracks, dp->d_nsectors,
dp->d_secpercyl, bstart, bend);
}
argc--;
argv++;
if (sflag)
bad_scan(&argc,&argv,dp,f,bstart,bend);
if (argc == 0) {
sn = getold(f, &oldbad);
printf("bad block information at sector %ld in %s:\n",
sn, name);
printf("cartridge serial number: %ld(10)\n", oldbad.bt_csn);
switch (oldbad.bt_flag) {
case (u_short)-1:
printf("alignment cartridge\n");
break;
case DKBAD_MAGIC:
break;
default:
printf("bt_flag=%x(16)?\n", oldbad.bt_flag);
break;
}
bt = oldbad.bt_bad;
for (i = 0; i < DKBAD_MAXBAD; i++) {
bad = (bt->bt_cyl<<16) + bt->bt_trksec;
if (bad < 0)
break;
printf("sn=%ld, cn=%d, tn=%d, sn=%d\n", badsn(bt),
bt->bt_cyl, bt->bt_trksec>>8, bt->bt_trksec&0xff);
bt++;
}
(void) checkold(&oldbad);
exit(0);
}
if (add) {
/*
* Read in the old badsector table.
* Verify that it makes sense, and the bad sectors
* are in order. Copy the old table to the new one.
*/
(void) getold(f, &oldbad);
i = checkold(&oldbad);
if (verbose)
printf("Had %d bad sectors, adding %d\n", i, argc);
if (i + argc > DKBAD_MAXBAD) {
printf("bad144: not enough room for %d more sectors\n",
argc);
printf("limited to %d by information format\n",
DKBAD_MAXBAD);
exit(1);
}
curbad = oldbad;
} else {
curbad.bt_csn = atoi(*argv++);
argc--;
curbad.bt_mbz = 0;
curbad.bt_flag = DKBAD_MAGIC;
if (argc > DKBAD_MAXBAD) {
printf("bad144: too many bad sectors specified\n");
printf("limited to %d by information format\n",
DKBAD_MAXBAD);
exit(1);
}
i = 0;
}
errs = 0;
new = argc;
while (argc > 0) {
sn = atoi(*argv++);
argc--;
if (sn < 0 || sn >= size) {
printf("%ld: out of range [0,%ld) for disk %s\n",
sn, size, dp->d_typename);
errs++;
continue;
}
bn[i] = sn;
curbad.bt_bad[i].bt_cyl = sn / (dp->d_nsectors*dp->d_ntracks);
sn %= (dp->d_nsectors*dp->d_ntracks);
curbad.bt_bad[i].bt_trksec =
((sn/dp->d_nsectors) << 8) + (sn%dp->d_nsectors);
i++;
}
if (errs)
exit(1);
nbad = i;
while (i < DKBAD_MAXBAD) {
curbad.bt_bad[i].bt_trksec = DKBAD_NOTRKSEC;
curbad.bt_bad[i].bt_cyl = DKBAD_NOCYL;
i++;
}
if (add) {
/*
* Sort the new bad sectors into the list.
* Then shuffle the replacement sectors so that
* the previous bad sectors get the same replacement data.
*/
qsort(curbad.bt_bad, nbad, sizeof (struct bt_bad), compare);
if (dups) {
fprintf(stderr,
"bad144: bad sectors have been duplicated; can't add existing sectors\n");
exit(3);
}
shift(f, nbad, nbad-new);
}
if (badfile == -1)
i = 0;
else
i = badfile * 2;
for (; i < 10 && i < dp->d_nsectors; i += 2) {
if (lseek(f, (off_t)dp->d_secsize * (size - dp->d_nsectors + i),
SEEK_SET) < 0)
Perror("lseek");
if (verbose)
printf("write badsect file at %lu\n",
size - dp->d_nsectors + i);
if (nflag == 0 && write(f, (caddr_t)&curbad, sizeof(curbad)) !=
sizeof(curbad)) {
char msg[80];
(void)sprintf(msg, "bad144: write bad sector file %d",
i/2);
perror(msg);
}
if (badfile != -1)
break;
}
#ifdef vax
if (nflag == 0 && fflag)
for (i = nbad - new; i < nbad; i++)
format(f, bn[i]);
#endif
if (nflag == 0 && (dp->d_flags & D_BADSECT) == 0) {
dp->d_flags |= D_BADSECT;
dp->d_checksum = 0;
dp->d_checksum = dkcksum(dp);
if (ioctl(f, DIOCWDINFO, dp) < 0) {
fprintf(stderr,
"Can't write disklabel to enable bad sector handling: %s\n",
strerror(errno));
exit(1);
}
}
#ifdef DIOCSBAD
if (nflag == 0 && ioctl(f, DIOCSBAD, (caddr_t)&curbad) < 0)
fprintf(stderr,
"Can't sync bad-sector file; reboot for changes to take effect\n");
#endif
exit(0);
}
daddr_t
getold(f, bad)
int f;
struct dkbad *bad;
{
register int i;
daddr_t sn;
char msg[80];
if (badfile == -1)
i = 0;
else
i = badfile * 2;
for (; i < 10 && i < dp->d_nsectors; i += 2) {
sn = size - dp->d_nsectors + i;
if (lseek(f, dp->d_secsize * (off_t)sn, SEEK_SET) < 0)
Perror("lseek");
if (read(f, (char *) bad, dp->d_secsize) == dp->d_secsize) {
if (i > 0)
printf("Using bad-sector file %d\n", i/2);
return(sn);
}
(void)sprintf(msg, "bad144: read bad sector file at sn %ld", sn);
perror(msg);
if (badfile != -1)
break;
}
fprintf(stderr, "bad144: %s: can't read bad block info\n", name);
exit(1);
/*NOTREACHED*/
}
int
checkold(oldbad)
struct dkbad *oldbad;
{
register int i;
register struct bt_bad *bt;
daddr_t sn, lsn=0;
int errors = 0, warned = 0;
if (oldbad->bt_flag != DKBAD_MAGIC) {
fprintf(stderr, "bad144: %s: bad flag in bad-sector table\n",
name);
errors++;
}
if (oldbad->bt_mbz != 0) {
fprintf(stderr, "bad144: %s: bad magic number\n", name);
errors++;
}
bt = oldbad->bt_bad;
for (i = 0; i < DKBAD_MAXBAD; i++, bt++) {
if (bt->bt_cyl == DKBAD_NOCYL &&
bt->bt_trksec == DKBAD_NOTRKSEC)
break;
if ((bt->bt_cyl >= dp->d_ncylinders) ||
((bt->bt_trksec >> 8) >= dp->d_ntracks) ||
((bt->bt_trksec & 0xff) >= dp->d_nsectors)) {
fprintf(stderr,
"bad144: cyl/trk/sect out of range in existing entry: ");
fprintf(stderr, "sn=%ld, cn=%d, tn=%d, sn=%d\n",
badsn(bt), bt->bt_cyl, bt->bt_trksec>>8,
bt->bt_trksec & 0xff);
errors++;
}
sn = (bt->bt_cyl * dp->d_ntracks +
(bt->bt_trksec >> 8)) *
dp->d_nsectors + (bt->bt_trksec & 0xff);
if (i > 0 && sn < lsn && !warned) {
fprintf(stderr,
"bad144: bad sector file is out of order\n");
errors++;
warned++;
}
if (i > 0 && sn == lsn) {
fprintf(stderr,
"bad144: bad sector file contains duplicates (sn %ld)\n",
sn);
errors++;
}
lsn = sn;
}
if (errors)
exit(1);
return (i);
}
/*
* Move the bad sector replacements
* to make room for the new bad sectors.
* new is the new number of bad sectors, old is the previous count.
*/
void
shift(f, new, old)
int f, new, old;
{
daddr_t repl;
/*
* First replacement is last sector of second-to-last track.
*/
repl = size - dp->d_nsectors - 1;
new--; old--;
while (new >= 0 && new != old) {
if (old < 0 ||
compare(&curbad.bt_bad[new], &oldbad.bt_bad[old]) > 0) {
/*
* Insert new replacement here-- copy original
* sector if requested and possible,
* otherwise write a zero block.
*/
if (!copy ||
!blkcopy(f, badsn(&curbad.bt_bad[new]), repl - new))
blkzero(f, repl - new);
} else {
if (blkcopy(f, repl - old, repl - new) == 0)
fprintf(stderr,
"Can't copy replacement sector %ld to %ld\n",
repl-old, repl-new);
old--;
}
new--;
}
}
/*
* Copy disk sector s1 to s2.
*/
int
blkcopy(f, s1, s2)
int f;
daddr_t s1, s2;
{
register tries, n;
if (buf == (char *)NULL) {
buf = malloc((unsigned)dp->d_secsize);
if (buf == (char *)NULL) {
fprintf(stderr, "Out of memory\n");
exit(20);
}
}
for (tries = 0; tries < RETRIES; tries++) {
if (lseek(f, (off_t)dp->d_secsize * s1, SEEK_SET) < 0)
Perror("lseek");
if ((n = read(f, buf, dp->d_secsize)) == dp->d_secsize)
break;
}
if (n != dp->d_secsize) {
fprintf(stderr, "bad144: can't read sector, %ld: ", s1);
if (n < 0)
perror((char *)0);
return(0);
}
if (lseek(f, (off_t)dp->d_secsize * s2, SEEK_SET) < 0)
Perror("lseek");
if (verbose)
printf("copying %ld to %ld\n", s1, s2);
if (nflag == 0 && write(f, buf, dp->d_secsize) != dp->d_secsize) {
fprintf(stderr,
"bad144: can't write replacement sector, %ld: ", s2);
perror((char *)0);
return(0);
}
return(1);
}
char *zbuf;
void
blkzero(f, sn)
int f;
daddr_t sn;
{
if (zbuf == (char *)NULL) {
zbuf = malloc((unsigned)dp->d_secsize);
if (zbuf == (char *)NULL) {
fprintf(stderr, "Out of memory\n");
exit(20);
}
}
if (lseek(f, (off_t)dp->d_secsize * sn, SEEK_SET) < 0)
Perror("lseek");
if (verbose)
printf("zeroing %ld\n", sn);
if (nflag == 0 && write(f, zbuf, dp->d_secsize) != dp->d_secsize) {
fprintf(stderr,
"bad144: can't write replacement sector, %ld: ", sn);
perror((char *)0);
}
}
int
compare(cvb1, cvb2)
const void *cvb1, *cvb2;
{
const struct bt_bad *b1 = cvb1, *b2 = cvb2;
if (b1->bt_cyl > b2->bt_cyl)
return(1);
if (b1->bt_cyl < b2->bt_cyl)
return(-1);
if (b1->bt_trksec == b2->bt_trksec)
dups++;
return (b1->bt_trksec - b2->bt_trksec);
}
daddr_t
badsn(bt)
register struct bt_bad *bt;
{
return ((bt->bt_cyl*dp->d_ntracks + (bt->bt_trksec>>8)) * dp->d_nsectors
+ (bt->bt_trksec&0xff));
}
#ifdef vax
struct rp06hdr {
short h_cyl;
short h_trksec;
short h_key1;
short h_key2;
char h_data[512];
#define RP06_FMT 010000 /* 1 == 16 bit, 0 == 18 bit */
};
/*
* Most massbus and unibus drives
* have headers of this form
*/
struct hpuphdr {
u_short hpup_cyl;
u_char hpup_sect;
u_char hpup_track;
char hpup_data[512];
#define HPUP_OKSECT 0xc000 /* this normally means sector is good */
#define HPUP_16BIT 0x1000 /* 1 == 16 bit format */
};
int rp06format(), hpupformat();
struct formats {
char *f_name; /* disk name */
int f_bufsize; /* size of sector + header */
int f_bic; /* value to bic in hpup_cyl */
int (*f_routine)(); /* routine for special handling */
} formats[] = {
{ "rp06", sizeof (struct rp06hdr), RP06_FMT, rp06format },
{ "eagle", sizeof (struct hpuphdr), HPUP_OKSECT, hpupformat },
{ "capricorn", sizeof (struct hpuphdr), HPUP_OKSECT, hpupformat },
{ "rm03", sizeof (struct hpuphdr), HPUP_OKSECT, hpupformat },
{ "rm05", sizeof (struct hpuphdr), HPUP_OKSECT, hpupformat },
{ "9300", sizeof (struct hpuphdr), HPUP_OKSECT, hpupformat },
{ "9766", sizeof (struct hpuphdr), HPUP_OKSECT, hpupformat },
{ 0, 0, 0, 0 }
};
/*ARGSUSED*/
hpupformat(fp, dp, blk, buf, count)
struct formats *fp;
struct disklabel *dp;
daddr_t blk;
char *buf;
int count;
{
struct hpuphdr *hdr = (struct hpuphdr *)buf;
int sect;
if (count < sizeof(struct hpuphdr)) {
hdr->hpup_cyl = (HPUP_OKSECT | HPUP_16BIT) |
(blk / (dp->d_nsectors * dp->d_ntracks));
sect = blk % (dp->d_nsectors * dp->d_ntracks);
hdr->hpup_track = (u_char)(sect / dp->d_nsectors);
hdr->hpup_sect = (u_char)(sect % dp->d_nsectors);
}
return (0);
}
/*ARGSUSED*/
rp06format(fp, dp, blk, buf, count)
struct formats *fp;
struct disklabel *dp;
daddr_t blk;
char *buf;
int count;
{
if (count < sizeof(struct rp06hdr)) {
fprintf(stderr, "Can't read header on blk %ld, can't reformat\n",
blk);
return (-1);
}
return (0);
}
format(fd, blk)
int fd;
daddr_t blk;
{
register struct formats *fp;
static char *buf;
static char bufsize;
struct format_op fop;
int n;
for (fp = formats; fp->f_name; fp++)
if (strcmp(dp->d_typename, fp->f_name) == 0)
break;
if (fp->f_name == 0) {
fprintf(stderr, "bad144: don't know how to format %s disks\n",
dp->d_typename);
exit(2);
}
if (buf && bufsize < fp->f_bufsize) {
free(buf);
buf = NULL;
}
if (buf == NULL)
buf = malloc((unsigned)fp->f_bufsize);
if (buf == NULL) {
fprintf(stderr, "bad144: can't allocate sector buffer\n");
exit(3);
}
bufsize = fp->f_bufsize;
/*
* Here we do the actual formatting. All we really
* do is rewrite the sector header and flag the bad sector
* according to the format table description. If a special
* purpose format routine is specified, we allow it to
* process the sector as well.
*/
if (verbose)
printf("format blk %ld\n", blk);
bzero((char *)&fop, sizeof(fop));
fop.df_buf = buf;
fop.df_count = fp->f_bufsize;
fop.df_startblk = blk;
bzero(buf, fp->f_bufsize);
if (ioctl(fd, DIOCRFORMAT, &fop) < 0)
perror("bad144: read format");
if (fp->f_routine &&
(*fp->f_routine)(fp, dp, blk, buf, fop.df_count) != 0)
return;
if (fp->f_bic) {
struct hpuphdr *xp = (struct hpuphdr *)buf;
xp->hpup_cyl &= ~fp->f_bic;
}
if (nflag)
return;
bzero((char *)&fop, sizeof(fop));
fop.df_buf = buf;
fop.df_count = fp->f_bufsize;
fop.df_startblk = blk;
if (ioctl(fd, DIOCWFORMAT, &fop) < 0)
Perror("write format");
if (fop.df_count != fp->f_bufsize) {
char msg[80];
(void)sprintf(msg, "bad144: write format %ld", blk);
perror(msg);
}
}
#endif
void
Perror(op)
char *op;
{
fprintf(stderr, "bad144: "); perror(op);
exit(4);
}
|