BSD 3 development
[unix-history] / usr / src / cmd / icheck.c
index b488390..6c1b632 100644 (file)
@@ -128,12 +128,12 @@ char *file;
        sync();
 #endif
        bread((daddr_t)1, (char *)&sblock, sizeof(sblock));
        sync();
 #endif
        bread((daddr_t)1, (char *)&sblock, sizeof(sblock));
-       mino = (sblock.s_isize-2) * INOPB;
+       mino = ((int)sblock.s_isize-2) * INOPB;
        ino = 0;
        ino = 0;
-       n = (sblock.s_fsize - sblock.s_isize + BITS-1) / BITS;
+       n = (sblock.s_fsize - (int)sblock.s_isize + BITS-1) / BITS;
        if (n != (unsigned)n) {
                printf("Check fsize and isize: %ld, %u\n",
        if (n != (unsigned)n) {
                printf("Check fsize and isize: %ld, %u\n",
-                  sblock.s_fsize, sblock.s_isize);
+                  sblock.s_fsize, (int)sblock.s_isize);
        }
 #ifdef STANDALONE
        bmap = NULL;
        }
 #ifdef STANDALONE
        bmap = NULL;
@@ -205,7 +205,7 @@ char *file;
 #endif
        if(!dflg) {
                n = 0;
 #endif
        if(!dflg) {
                n = 0;
-               for(d=sblock.s_isize; d<sblock.s_fsize; d++)
+               for(d=(int)sblock.s_isize; d<sblock.s_fsize; d++)
                        if(!duped(d)) {
                                if(mflg)
                                        printf("%ld missing\n", d);
                        if(!duped(d)) {
                                if(mflg)
                                        printf("%ld missing\n", d);
@@ -298,7 +298,7 @@ char *s;
 {
        register n;
 
 {
        register n;
 
-       if (bno<sblock.s_isize || bno>=sblock.s_fsize) {
+       if (bno<(int)sblock.s_isize || bno>=sblock.s_fsize) {
                printf("%ld bad; inode=%u, class=%s\n", bno, ino, s);
                return(1);
        }
                printf("%ld bad; inode=%u, class=%s\n", bno, ino, s);
                return(1);
        }
@@ -320,7 +320,7 @@ daddr_t bno;
 
        if(dflg)
                return(0);
 
        if(dflg)
                return(0);
-       d = bno - sblock.s_isize;
+       d = bno - (int)sblock.s_isize;
        m = 1 << (d%BITS);
        n = (d/BITS);
        if(bmap[n] & m)
        m = 1 << (d%BITS);
        n = (d/BITS);
        if(bmap[n] & m)
@@ -463,7 +463,7 @@ makefree()
        for(; d > 0; d -= sblock.s_n)
        for(i=0; i<sblock.s_n; i++) {
                f = d - adr[i];
        for(; d > 0; d -= sblock.s_n)
        for(i=0; i<sblock.s_n; i++) {
                f = d - adr[i];
-               if(f < sblock.s_fsize && f >= sblock.s_isize)
+               if(f < sblock.s_fsize && f >= (int)sblock.s_isize)
                        if(!duped(f))
                                bfree(f);
        }
                        if(!duped(f))
                                bfree(f);
        }