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;
- 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",
- sblock.s_fsize, sblock.s_isize);
+ sblock.s_fsize, (int)sblock.s_isize);
}
#ifdef STANDALONE
bmap = NULL;
#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);
{
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);
}
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)
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);
}