Repository navigation
Expand file tree
/
Copy pathfsck.c
More file actions
1672 lines (1518 loc) · 42.7 KB
/
Copy pathfsck.c
File metadata and controls
1672 lines (1518 loc) · 42.7 KB
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
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/* Hacks for version 1.6 */
#define INODES_PER_BLOCK V2_INODES_PER_BLOCK(block_size)
#define INODE_SIZE ((int) V2_INODE_SIZE)
#define WORDS_PER_BLOCK (block_size / (int) sizeof(bitchunk_t))
#define MAX_ZONES (V2_NR_DZONES+V2_INDIRECTS(block_size)+(long)V2_INDIRECTS(block_size)*V2_INDIRECTS(block_size))
#define NR_DZONE_NUM V2_NR_DZONES
#define NR_INDIRECTS V2_INDIRECTS(block_size)
#define NR_ZONE_NUMS V2_NR_TZONES
#define ZONE_NUM_SIZE V2_ZONE_NUM_SIZE
#define bit_nr bit_t
#define block_nr block_t
#define d_inode d2_inode
#define d_inum mfs_d_ino
#define dir_struct struct direct
#define i_mode d2_mode
#define i_nlinks d2_nlinks
#define i_size d2_size
#define i_zone d2_zone
#define zone_nr zone_t
/* fsck - file system checker Author: Robbert van Renesse */
/* Modified by Norbert Schlenker
* Removed vestiges of standalone/DOS versions:
* - various unused variables and buffers removed
* - now uses library functions rather than private internal routines
* - bytewise structure copies replaced by structure assignment
* - fixed one bug with 14 character file names
* - other small tweaks for speed
*
* Modified by Lars Fredriksen at the request of Andy Tanenbaum, 90-03-10.
* Removed -m option, by which fsck could be told to make a file
* system on a 360K floppy. The code had limited utility, was buggy,
* and failed due to a bug in the ACK C compiler. Use mkfs instead!
*/
#include <sys/types.h>
#include <ctype.h>
#include <errno.h>
#include <fcntl.h>
#include <limits.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <minix/config.h>
#include <minix/const.h>
#include <minix/type.h>
#include <minix/ipc.h>
#include "mfs/const.h"
#include "mfs/inode.h"
#include "mfs/type.h"
#include "mfs/mfsdir.h"
#include <minix/fslib.h>
#include <stdio.h>
#include <sys/stat.h>
#include <dirent.h>
#include "exitvalues.h"
#undef N_DATA
unsigned int fs_version = 2, block_size = 0;
#define BITSHIFT 5 /* = log2(#bits(int)) */
#define MAXPRINT 80 /* max. number of error lines in chkmap */
#define CINDIR 128 /* number of indirect zno's read at a time */
#define CDIRECT 1 /* number of dir entries read at a time */
/* Macros for handling bitmaps. Now bit_t is long, these are bulky and the
* type demotions produce a lot of lint. The explicit demotion in POWEROFBIT
* is for efficiency and assumes 2's complement ints. Lint should be clever
* enough not to warn about it since BITMASK is small, but isn't. (It would
* be easier to get right if bit_t was was unsigned (long) since then there
* would be no danger from wierd sign representations. Lint doesn't know
* we only use non-negative bit numbers.) There will usually be an implicit
* demotion when WORDOFBIT is used as an array index. This should be safe
* since memory for bitmaps will run out first.
*/
#define BITMASK ((1 << BITSHIFT) - 1)
#define WORDOFBIT(b) ((b) >> BITSHIFT)
#define POWEROFBIT(b) (1 << ((int) (b) & BITMASK))
#define setbit(w, b) (w[WORDOFBIT(b)] |= POWEROFBIT(b))
#define clrbit(w, b) (w[WORDOFBIT(b)] &= ~POWEROFBIT(b))
#define bitset(w, b) (w[WORDOFBIT(b)] & POWEROFBIT(b))
#define ZONE_CT 360 /* default zones (when making file system) */
#define INODE_CT 95 /* default inodes (when making file system) */
#include "mfs/super.h"
static struct super_block sb;
#define STICKY_BIT 01000 /* not defined anywhere else */
/* Ztob gives the block address of a zone
* btoa64 gives the byte address of a block
*/
#define ztob(z) ((block_nr) (z) << sb.s_log_zone_size)
#define btoa64(b) ((u64_t)(b) * block_size)
#define SCALE ((int) ztob(1)) /* # blocks in a zone */
#define FIRST ((zone_nr) sb.s_firstdatazone) /* as the name says */
/* # blocks of each type */
#define N_IMAP (sb.s_imap_blocks)
#define N_ZMAP (sb.s_zmap_blocks)
#define N_ILIST ((sb.s_ninodes+INODES_PER_BLOCK-1) / INODES_PER_BLOCK)
#define N_DATA (sb.s_zones - FIRST)
/* Block address of each type */
#define OFFSET_SUPER_BLOCK SUPER_BLOCK_BYTES
#define BLK_IMAP 2
#define BLK_ZMAP (BLK_IMAP + N_IMAP)
#define BLK_ILIST (BLK_ZMAP + N_ZMAP)
#define BLK_FIRST ztob(FIRST)
#define ZONE_SIZE ((int) ztob(block_size))
#define NLEVEL (NR_ZONE_NUMS - NR_DZONE_NUM + 1)
/* Byte address of a zone */
#define INDCHUNK ((int) (CINDIR * ZONE_NUM_SIZE))
#define DIRCHUNK ((int) (CDIRECT * DIR_ENTRY_SIZE))
char *prog, *fsck_device; /* program name (fsck), device name */
int firstcnterr; /* is this the first inode ref cnt error? */
bitchunk_t *imap, *spec_imap; /* inode bit maps */
bitchunk_t *zmap, *spec_zmap; /* zone bit maps */
bitchunk_t *dirmap; /* directory (inode) bit map */
char *rwbuf; /* one block buffer cache */
block_nr thisblk; /* block in buffer cache */
char *nullbuf; /* null buffer */
nlink_t *count; /* inode count */
int changed; /* has the diskette been written to? */
struct stack {
dir_struct *st_dir;
struct stack *st_next;
char st_presence;
} *ftop;
int dev; /* file descriptor of the device */
#define DOT 1
#define DOTDOT 2
/* Counters for each type of inode/zone. */
int nfreeinode, nregular, ndirectory, nblkspec, ncharspec, nbadinode;
int nsock, npipe, nsyml, ztype[NLEVEL];
long nfreezone;
int repair, notrepaired = 0, automatic, listing, listsuper; /* flags */
int preen = 0, markdirty = 0;
int firstlist; /* has the listing header been printed? */
unsigned part_offset; /* sector offset for this partition */
char answer[] = "Answer questions with y or n. Then hit RETURN";
int main(int argc, char **argv);
void initvars(void);
void fatal(char *s);
int eoln(int c);
int yes(char *question);
int atoo(char *s);
int input(char *buf, int size);
char *alloc(unsigned nelem, unsigned elsize);
void printname(char *s);
void printrec(struct stack *sp);
void printpath(int mode, int nlcr);
void devopen(void);
void devclose(void);
void devio(block_nr bno, int dir);
void devread(long block, long offset, char *buf, int size);
void devwrite(long block, long offset, char *buf, int size);
void pr(char *fmt, int cnt, char *s, char *p);
void lpr(char *fmt, long cnt, char *s, char *p);
bit_nr getnumber(char *s);
char **getlist(char ***argv, char *type);
void lsuper(void);
#define SUPER_GET 0
#define SUPER_PUT 1
void rw_super(int mode);
void chksuper(void);
void lsi(char **clist);
bitchunk_t *allocbitmap(int nblk);
void loadbitmap(bitchunk_t *bitmap, block_nr bno, int nblk);
void dumpbitmap(bitchunk_t *bitmap, block_nr bno, int nblk);
void fillbitmap(bitchunk_t *bitmap, bit_nr lwb, bit_nr upb, char
**list);
void freebitmap(bitchunk_t *p);
void getbitmaps(void);
void putbitmaps(void);
void chkword(unsigned w1, unsigned w2, bit_nr bit, char *type, int *n,
int *report, bit_t);
void chkmap(bitchunk_t *cmap, bitchunk_t *dmap, bit_nr bit, block_nr
blkno, int nblk, char *type);
void chkilist(void);
void getcount(void);
void counterror(ino_t ino);
void chkcount(void);
void freecount(void);
void printperm(mode_t mode, int shift, int special, int overlay);
void list(ino_t ino, d_inode *ip);
int Remove(dir_struct *dp);
void make_printable_name(char *dst, char *src, int n);
int chkdots(ino_t ino, off_t pos, dir_struct *dp, ino_t exp);
int chkname(ino_t ino, dir_struct *dp);
int chkentry(ino_t ino, off_t pos, dir_struct *dp);
int chkdirzone(ino_t ino, d_inode *ip, off_t pos, zone_nr zno);
int chksymlinkzone(ino_t ino, d_inode *ip, off_t pos, zone_nr zno);
void errzone(char *mess, zone_nr zno, int level, off_t pos);
int markzone(zone_nr zno, int level, off_t pos);
int chkindzone(ino_t ino, d_inode *ip, off_t *pos, zone_nr zno, int
level);
off_t jump(int level);
int zonechk(ino_t ino, d_inode *ip, off_t *pos, zone_nr zno, int level);
int chkzones(ino_t ino, d_inode *ip, off_t *pos, zone_nr *zlist, int
len, int level);
int chkfile(ino_t ino, d_inode *ip);
int chkdirectory(ino_t ino, d_inode *ip);
int chklink(ino_t ino, d_inode *ip);
int chkspecial(ino_t ino, d_inode *ip);
int chkmode(ino_t ino, d_inode *ip);
int chkinode(ino_t ino, d_inode *ip);
int descendtree(dir_struct *dp);
void chktree(void);
void printtotal(void);
void chkdev(char *f, char **clist, char **ilist, char **zlist);
/* Initialize the variables used by this program. */
void initvars()
{
register int level;
nregular = ndirectory = nblkspec = ncharspec =
nbadinode = nsock = npipe = nsyml = 0;
for (level = 0; level < NLEVEL; level++) ztype[level] = 0;
changed = 0;
thisblk = NO_BLOCK;
firstlist = 1;
firstcnterr = 1;
}
/* Print the string `s' and exit. */
void fatal(s)
char *s;
{
printf("%s\nfatal\n", s);
exit(FSCK_EXIT_CHECK_FAILED);
}
/* Test for end of line. */
int eoln(c)
int c;
{
return(c == EOF || c == '\n' || c == '\r');
}
/* Ask a question and get the answer unless automatic is set. */
int yes(question)
char *question;
{
register int c, answerchar;
static int note = 0;
int yes;
if (!repair) {
printf("\n");
return(0);
}
printf("%s? ", question);
if(!note) { printf("(y=yes, n=no, q=quit, A=for yes to all) "); note = 1; }
if (automatic) {
printf("yes\n");
return(1);
}
fflush(stdout);
if ((c = answerchar = getchar()) == 'q' || c == 'Q') exit(FSCK_EXIT_CHECK_FAILED);
if(c == 'A') { automatic = 1; c = 'y'; }
while (!eoln(c)) c = getchar();
yes = !(answerchar == 'n' || answerchar == 'N');
if(!yes) notrepaired = 1;
return yes;
}
/* Convert string to integer. Representation is octal. */
int atoo(s)
register char *s;
{
register int n = 0;
while ('0' <= *s && *s < '8') {
n <<= 3;
n += *s++ - '0';
}
return n;
}
/* If repairing the file system, print a prompt and get a string from user. */
int input(buf, size)
char *buf;
int size;
{
register char *p = buf;
printf("\n");
if (repair) {
printf("--> ");
fflush(stdout);
while (--size) {
*p = getchar();
if (eoln(*p)) {
*p = 0;
return(p > buf);
}
p++;
}
*p = 0;
while (!eoln(getchar()));
return(1);
}
return(0);
}
/* Allocate some memory and zero it. */
char *alloc(nelem, elsize)
unsigned nelem, elsize;
{
char *p;
if ((p = (char *)malloc((size_t)nelem * elsize)) == 0) {
fprintf(stderr, "Tried to allocate %dkB\n",
nelem*elsize/1024);
fatal("out of memory");
}
memset((void *) p, 0, (size_t)nelem * elsize);
return(p);
}
/* Print the name in a directory entry. */
void printname(s)
char *s;
{
register int n = MFS_NAME_MAX;
int c;
do {
if ((c = *s) == 0) break;
if (!isprint(c)) c = '?';
putchar(c);
s++;
} while (--n);
}
/* Print the pathname given by a linked list pointed to by `sp'. The
* names are in reverse order.
*/
void printrec(struct stack *sp)
{
if (sp->st_next != 0) {
printrec(sp->st_next);
putchar('/');
printname(sp->st_dir->mfs_d_name);
}
}
/* Print the current pathname. */
void printpath(mode, nlcr)
int mode;
int nlcr;
{
if (ftop->st_next == 0)
putchar('/');
else
printrec(ftop);
switch (mode) {
case 1:
printf(" (ino = %u, ", ftop->st_dir->d_inum);
break;
case 2:
printf(" (ino = %u)", ftop->st_dir->d_inum);
break;
}
if (nlcr) printf("\n");
}
/* Open the device. */
void devopen()
{
if ((dev = open(fsck_device,
(repair || markdirty) ? O_RDWR : O_RDONLY)) < 0) {
perror(fsck_device);
fatal("couldn't open device to fsck");
}
}
/* Close the device. */
void devclose()
{
if (close(dev) != 0) {
perror("close");
fatal("");
}
}
/* Read or write a block. */
void devio(bno, dir)
block_nr bno;
int dir;
{
off_t r;
if(!block_size) fatal("devio() with unknown block size");
if (dir == READI
BD0
NG && bno == thisblk) return;
thisblk = bno;
#if 0
printf("%s at block %5d\n", dir == READING ? "reading " : "writing", bno);
#endif
r= lseek(dev, btoa64(bno), SEEK_SET);
if (r == (off_t)-1)
fatal("lseek failed");
if (dir == READING) {
if (read(dev, rwbuf, block_size) == block_size)
return;
} el
10000
se {
if (write(dev, rwbuf, block_size) == block_size)
return;
}
printf("%s: can't %s block %ld (error = 0x%x)\n", prog,
dir == READING ? "read" : "write", (long) bno, errno);
if (dir == READING) {
printf("Continuing with a zero-filled block.\n");
memset(rwbuf, 0, block_size);
return;
}
fatal("");
}
/* Read `size' bytes from the disk starting at block 'block' and
* byte `offset'.
*/
void devread(block, offset, buf, size)
long block;
long offset;
char *buf;
int size;
{
if(!block_size) fatal("devread() with unknown block size");
if (offset >= block_size)
{
block += offset/block_size;
offset %= block_size;
}
devio(block, READING);
memmove(buf, &rwbuf[offset], size);
}
/* Write `size' bytes to the disk starting at block 'block' and
* byte `offset'.
*/
void devwrite(block, offset, buf, size)
long block;
long offset;
char *buf;
int size;
{
if(!block_size) fatal("devwrite() with unknown block size");
if (!repair) fatal("internal error (devwrite)");
if (offset >= block_size)
{
block += offset/block_size;
offset %= block_size;
}
if (size != block_size) devio(block, READING);
memmove(&rwbuf[offset], buf, size);
devio(block, WRITING);
changed = 1;
}
/* Print a string with either a singular or a plural pronoun. */
void pr(fmt, cnt, s, p)
char *fmt, *s, *p;
int cnt;
{
printf(fmt, cnt, cnt == 1 ? s : p);
}
/* Same as above, but with a long argument */
void lpr(fmt, cnt, s, p)
char *fmt, *s, *p;
long cnt;
{
printf(fmt, cnt, cnt == 1 ? s : p);
}
/* Convert string to number. */
bit_nr getnumber(s)
register char *s;
{
register bit_nr n = 0;
if (s == NULL)
return NO_BIT;
while (isdigit(*s))
n = (n << 1) + (n << 3) + *s++ - '0';
return (*s == '\0') ? n : NO_BIT;
}
/* See if the list pointed to by `argv' contains numbers. */
char **getlist(argv, type)
char ***argv, *type;
{
register char **list = *argv;
register int empty = 1;
while (getnumber(**argv) != NO_BIT) {
(*argv)++;
empty = 0;
}
if (empty) {
printf("warning: no %s numbers given\n", type);
return(NULL);
}
return(list);
}
/* Make a listing of the super block. If `repair' is set, ask the user
* for changes.
*/
void lsuper()
{
char buf[80];
do {
/* Most of the following atol's enrage lint, for good reason. */
printf("ninodes = %u", sb.s_ninodes);
if (input(buf, 80)) sb.s_ninodes = atol(buf);
printf("nzones = %d", sb.s_zones);
if (input(buf, 80)) sb.s_zones = atol(buf);
printf("imap_blocks = %u", sb.s_imap_blocks);
if (input(buf, 80)) sb.s_imap_blocks = atol(buf);
printf("zmap_blocks = %u", sb.s_zmap_blocks);
if (input(buf, 80)) sb.s_zmap_blocks = atol(buf);
printf("firstdatazone = %u", sb.s_firstdatazone_old);
if (input(buf, 80)) sb.s_firstdatazone_old = atol(buf);
printf("log_zone_size = %u", sb.s_log_zone_size);
if (input(buf, 80)) sb.s_log_zone_size = atol(buf);
printf("maxsize = %d", sb.s_max_size);
if (input(buf, 80)) sb.s_max_size = atol(buf);
printf("block size = %d", sb.s_block_size);
if (input(buf, 80)) sb.s_block_size = atol(buf);
if (yes("ok now")) {
devwrite(0, OFFSET_SUPER_BLOCK, (char *) &sb, sizeof(sb));
return;
}
printf("flags = ");
if(sb.s_flags & MFSFLAG_CLEAN) printf("CLEAN "); else printf("DIRTY ");
printf("\n");
} while (yes("Do you want to try again"));
if (repair) exit(FSCK_EXIT_OK);
}
/* Get the super block from either disk or user. Do some initial checks. */
void rw_super(int put)
{
if(lseek(dev, OFFSET_SUPER_BLOCK, SEEK_SET) < 0) {
perror("lseek");
fatal("couldn't seek to super block.");
}
if(put == SUPER_PUT) {
if(write(dev, &sb, sizeof(sb)) != sizeof(sb)) {
fatal("couldn't write super block.");
}
return;
}
if(read(dev, &sb, sizeof(sb)) != sizeof(sb)) {
fatal("couldn't read super block.");
}
if (listsuper) lsuper();
if (sb.s_magic == SUPER_MAGIC) fatal("Cannot handle V1 file systems");
if (sb.s_magic == SUPER_V2) {
fs_version = 2;
block_size = /* STATIC_BLOCK_SIZE */ 8192;
} else if(sb.s_magic == SUPER_V3) {
fs_version = 3;
block_size = sb.s_block_size;
} else {
fatal("bad magic number in super block");
}
if (sb.s_ninodes <= 0) fatal("no inodes");
if (sb.s_zones <= 0) fatal("no zones");
if (sb.s_imap_blocks <= 0) fatal("no imap");
if (sb.s_zmap_blocks <= 0) fatal("no zmap");
if (sb.s_firstdatazone != 0 && sb.s_firstdatazone <= 4)
fatal("first data zone too small");
if (sb.s_log_zone_size < 0) fatal("zone size < block size");
if (sb.s_max_size <= 0) {
printf("warning: invalid max file size %d\n", sb.s_max_size);
sb.s_max_size = LONG_MAX;
}
}
/* Check the super block for reasonable contents. */
void chksuper()
{
register int n;
register off_t maxsize;
n = bitmapsize((bit_t) sb.s_ninodes + 1, block_size);
if (sb.s_magic != SUPER_V2 && sb.s_magic != SUPER_V3)
fatal("bad magic number in super block");
if (sb.s_imap_blocks < n) {
printf("need %d bocks for inode bitmap; only have %d\n",
n, sb.s_imap_blocks);
fatal("too few imap blocks");
}
if (sb.s_imap_blocks != n) {
pr("warning: expected %d imap_block%s", n, "", "s");
printf(" instead of %d\n", sb.s_imap_blocks);
}
n = bitmapsize((bit_t) sb.s_zones, block_size);
if (sb.s_zmap_blocks < n) fatal("too few zmap blocks");
if (sb.s_zmap_blocks != n) {
pr("warning: expected %d zmap_block%s", n, "", "s");
printf(" instead of %d\n", sb.s_zmap_blocks);
}
if (sb.s_log_zone_size >= 8 * sizeof(block_nr))
fatal("log_zone_size too large");
if (sb.s_log_zone_size > 8) printf("warning: large log_zone_size (%d)\n",
sb.s_log_zone_size);
sb.s_firstdatazone = (BLK_ILIST + N_ILIST + SCALE - 1) >> sb.s_log_zone_size;
if (sb.s_firstdatazone_old != 0) {
if (sb.s_firstdatazone_old >= sb.s_zones)
fatal("first data zone too large");
if (sb.s_firstdatazone_old < sb.s_firstdatazone)
fatal("first data zone too small");
if (sb.s_firstdatazone_old != sb.s_firstdatazone) {
printf("warning: expected first data zone to be %u ",
sb.s_firstdatazone);
printf("instead of %u\n", sb.s_firstdatazone_old);
sb.s_firstdatazone = sb.s_firstdatazone_old;
}
}
maxsize = MAX_FILE_POS;
if (((maxsize - 1) >> sb.s_log_zone_size) / block_size >= MAX_ZONES)
maxsize = ((long) MAX_ZONES * block_size) << sb.s_log_zone_size;
if(maxsize <= 0)
maxsize = LONG_MAX;
if (sb.s_max_size != maxsize) {
printf("warning: expected max size to be %d ", maxsize);
printf("instead of %d\n", sb.s_max_size);
}
if(sb.s_flags & MFSFLAG_MANDATORY_MASK) {
fatal("unsupported feature bits - newer fsck needed");
}
}
int inoblock(int inn)
{
return (int)(((u64_t)(inn - 1) * INODE_SIZE) / block_size) + BLK_ILIST;
}
int inooff(int inn)
{
return (int)(((u64_t)(inn - 1) * INODE_SIZE) % block_size);
}
/* Make a listing of the inodes given by `clist'. If `repair' is set, ask
* the user for changes.
*/
void lsi(clist)
char **clist;
{
register bit_nr bit;
register ino_t ino;
d_inode inode, *ip = &inode;
char buf[80];
if (clist == 0) return;
while ((bit = getnumber(*clist++)) != NO_BIT) {
setbit(spec_imap, bit);
ino = bit;
do {
devread(inoblock(ino), inooff(ino), (char *) ip, INODE_SIZE);
printf("inode %u:\n", ino);
printf(" mode = %6o", ip->i_mode);
if (input(buf, 80)) ip->i_mode = atoo(buf);
printf(" nlinks = %6u", ip->i_nlinks);
if (input(buf, 80)) ip->i_nlinks = atol(buf);
printf(" size = %6d", ip->i_size);
if (input(buf, 80)) ip->i_size = atol(buf);
if (yes("Write this back")) {
devwrite(inoblock(ino), inooff(ino), (char *) ip,
INODE_SIZE);
break;
}
} while (yes("Do you want to change it again"));
}
}
/* Allocate `nblk' blocks worth of bitmap. */
bitchunk_t *allocbitmap(nblk)
int nblk;
{
register bitchunk_t *bitmap;
bitmap = (bitchunk_t *) alloc((unsigned) nblk, block_size);
*bitmap |= 1;
return(bitmap);
}
/* Load the bitmap starting at block `bno' from disk. */
void loadbitmap(bitmap, bno, nblk)
bitchunk_t *bitmap;
block_nr bno;
int nblk;
{
register int i;
register bitchunk_t *p;
p = bitmap;
for (i = 0; i < nblk; i++, bno++, p += WORDS_PER_BLOCK)
devread(bno, 0, (char *) p, block_size);
*bitmap |= 1;
}
/* Write the bitmap starting at block `bno' to disk. */
void dumpbitmap(bitmap, bno, nblk)
bitchunk_t *bitmap;
block_nr bno;
int nblk;
{
register int i;
register bitchunk_t *p = bitmap;
for (i = 0; i < nblk; i++, bno++, p += WORDS_PER_BLOCK)
devwrite(bno, 0, (char *) p, block_size);
}
/* Set the bits given by `list' in the bitmap. */
void fillbitmap(bitmap, lwb, upb, list)
bitchunk_t *bitmap;
bit_nr lwb, upb;
char **list;
{
register bit_nr bit;
if (list == 0) return;
while ((bit = getnumber(*list++)) != NO_BIT)
if (bit < lwb || bit >= upb) {
if (bitmap == spec_imap)
printf("inode number %d ", bit);
else
printf("zone number %d ", bit);
printf("out of range (ignored)\n");
} else
setbit(bitmap, bit - lwb + 1);
}
/* Deallocate the bitmap `p'. */
void freebitmap(p)
bitchunk_t *p;
{
free((char *) p);
}
/* Get all the bitmaps used by this program. */
void getbitmaps()
{
imap = allocbitmap(N_IMAP);
zmap = allocbitmap(N_ZMAP);
spec_imap = allocbitmap(N_IMAP);
spec_zmap = allocbitmap(N_ZMAP);
dirmap = allocbitmap(N_IMAP);
}
/* Release all the space taken by the bitmaps. */
void putbitmaps()
{
freebitmap(imap);
freebitmap(zmap);
freebitmap(spec_imap);
freebitmap(spec_zmap);
freebitmap(dirmap);
}
/* `w1' and `w2' are differing words from two bitmaps that should be
* identical. Print what's the matter with them.
*/
void chkword(w1, w2, bit, type, n, report, phys)
unsigned w1, w2;
char *type;
bit_nr bit;
int *n, *report;
bit_nr phys;
{
for (; (w1 | w2); w1 >>= 1, w2 >>= 1, bit++, phys++)
if ((w1 ^ w2) & 1 && ++(*n) % MAXPRINT == 0 && *report &&
(!repair || automatic || yes("stop this listing")))
*report = 0;
else {
if (*report)
if ((w1 & 1) && !(w2 & 1))
printf("%s %d is missing\n", type, bit);
else if (!(w1 & 1) && (w2 & 1))
printf("%s %d is not free\n", type, bit);
}
}
/* Check if the given (correct) bitmap is identical with the one that is
* on the disk. If not, ask if the disk should be repaired.
*/
void chkmap(cmap, dmap, bit, blkno, nblk, type)
bitchunk_t *cmap, *dmap;
bit_nr bit;
block_nr blkno;
int nblk;
char *type;
{
register bitchunk_t *p = dmap, *q = cmap;
int report = 1, nerr = 0;
int w = nblk * WORDS_PER_BLOCK;
bit_nr phys = 0;
printf("Checking %s map. ", type);
if(!preen) printf("\n");
fflush(stdout);
loadbitmap(dmap, blkno, nblk);
do {
if (*p != *q) chkword(*p, *q, bit, type, &nerr, &report, phys);
p++;
q++;
bit += 8 * sizeof(bitchunk_t);
phys += 8 * sizeof(bitchunk_t);
} while (--w > 0);
if ((!repair || automatic) && !report) printf("etc. ");
if (nerr > MAXPRINT || nerr > 10) printf("%d errors found. ", nerr);
if (nerr != 0 && yes("install a new map")) dumpbitmap(cmap, blkno, nblk);
if (nerr > 0) printf("\n");
}
/* See if the inodes that aren't allocated are cleared. */
void chkilist()
{
register ino_t ino = 1;
mode_t mode;
printf("Checking inode list. ");
if(!preen) printf("\n");
fflush(stdout);
do
if (!bitset(imap, (bit_nr) ino)) {
devread(inoblock(ino), inooff(ino), (char *) &mode,
sizeof(mode));
if (mode != I_NOT_ALLOC) {
printf("mode inode %u not cleared", ino);
if (yes(". clear")) devwrite(inoblock(ino),
inooff(ino), nullbuf, INODE_SIZE);
}
}
while (++ino <= sb.s_ninodes && ino != 0);
if(!preen) printf("\n");
}
/* Allocate an array to maintain the inode reference counts in. */
void getcount()
{
count = (nlink_t *) alloc((unsigned) (sb.s_ninodes + 1), sizeof(nlink_t));
}
/* The reference count for inode `ino' is wrong. Ask if it should be adjusted. */
void counterror(ino_t ino)
{
d_inode inode;
if (firstcnterr) {
printf("INODE NLINK COUNT\n");
firstcnterr = 0;
}
devread(inoblock(ino), inooff(ino), (char *) &inode, INODE_SIZE);
count[ino] += inode.i_nlinks; /* it was already subtracted; add it back */
printf("%5u %5u %5u", ino, (unsigned) inode.i_nlinks, count[ino]);
if (yes(" adjust")) {
if ((inode.i_nlinks = count[ino]) == 0) {
fatal("internal error (counterror)");
inode.i_mode = I_NOT_ALLOC;
clrbit(imap, (bit_nr) ino);
}
devwrite(inoblock(ino), inooff(ino), (char *) &inode, INODE_SIZE);
}
}
/* Check if the reference count of the inodes are correct. The array `count'
* is maintained as follows: an entry indexed by the inode number is
* incremented each time a link is found; when the inode is read the link
* count in there is substracted from the corresponding entry in `count'.
* Thus, when the whole file system has been traversed, all the entries
* should be zero.
*/
void chkcount()
{
register ino_t ino;
for (ino = 1; ino <= sb.s_ninodes && ino != 0; ino++)
if (count[ino] != 0) counterror(ino);
if (!firstcnterr) printf("\n");
}
/* Deallocate the `count' array. */
void freecount()
{
free((char *) count);
}
/* Print the inode permission bits given by mode and shift. */
void printperm(mode_t mode, int shift, int special, int overlay)
{
if (mode >> shift & R_BIT)
putchar('r');
else
putchar('-');
if (mode >> shift & W_BIT)
putchar('w');
else
putchar('-');
if (mode & special)
putchar(overlay);
else
if (mode >> shift & X_BIT)
putchar('x');
else
putchar('-');
}
/* List the given inode. */
void list(ino_t ino, d_inode *ip)
{
if (firstlist) {
firstlist = 0;
printf(" inode permission link size name\n");
}
printf("%6u ", ino);
switch (ip->i_mode & I_TYPE) {
case I_REGULAR: putchar('-'); break;
case I_DIRECTORY: putchar('d'); break;
case I_CHAR_SPECIAL: putchar('c'); break;
case I_BLOCK_SPECIAL: putchar('b'); break;
case I_NAMED_PIPE: putchar('p'); break;
case I_UNIX_SOCKET: putchar('s'); break;
#ifdef I_SYMBOLIC_LINK
case I_SYMBOLIC_LINK: putchar('l'); break;
#endif
default: putchar('?');
}
printperm(ip->i_mode, 6, I_SET_UID_BIT, 's');
printperm(ip->i_mode, 0, STICKY_BIT, 't');
printf(" %3u ", ip->i_nlinks);
switch (ip->i_mode & I_TYPE) {
case I_CHAR_SPECIAL:
case I_BLOCK_SPECIAL:
printf(" %2x,%2x ", major(ip->i_zone[0]), minor(ip->i_zone[0]));
break;
default: printf("%7d ", ip->i_size);
}
printpath(0, 1);
}
/* Remove an entry from a directory if ok with the user.
* Don't name the function remove() - that is owned by ANSI, and chaos results
* when it is a macro.
*/
int Remove(dir_struct *dp)
{
setbit(spec_imap, (bit_nr) dp->d_inum);
if (yes(". remove entry")) {
count[dp->d_inum]--;
memset((void *) dp, 0, sizeof(dir_struct));
return(1);
}
return(0);
}
/* Convert string so that embedded control characters are printable. */
void make_printable_name(dst, src, n)
register char *dst;
register char *src;
register int n;
{
register int c;
while (--n >= 0 && (c = *src++) != '\0') {
if (isprint(c) && c != '\\')
*dst++ = c;
else {
*dst++ = '\\';
switch (c) {
case '\\':
*dst++ = '\\'; break;
case '\b':