Lines Matching defs:frags
676 * Here we convert ms of delay to frags as:
677 * (frags) = (ms) * (rev/sec) * (sect/rev) /
760 int frags, bbase;
771 frags = numfrags(fs, nsize); /* number of fragments needed */
773 if (bbase > fragnum(fs, (bprev + frags - 1))) {
802 for (i = numfrags(fs, osize); i < frags; i++)
817 for (i = frags; i < fs->fs_frag - bbase; i++)
821 if (i != frags)
822 cgp->cg_frsum[i - frags]++;
823 for (i = numfrags(fs, osize); i < frags; i++) {
856 int error, bno, frags, allocsiz;
902 frags = numfrags(fs, size);
903 for (allocsiz = frags; allocsiz < fs->fs_frag; allocsiz++)
921 for (i = frags; i < fs->fs_frag; i++)
923 i = fs->fs_frag - frags;
945 for (i = 0; i < frags; i++)
947 cgp->cg_cs.cs_nffree -= frags;
948 fs->fs_cstotal.cs_nffree -= frags;
949 fs->fs_cs(fs, cg).cs_nffree -= frags;
952 if (frags != allocsiz)
953 cgp->cg_frsum[allocsiz - frags]++;
1333 int i, error, cg, blk, frags, bbase;
1392 * decrement the counts associated with the old frags
1399 frags = numfrags(fs, size);
1400 for (i = 0; i < frags; i++) {
1412 * add back in counts associated with the new frags
1454 int i, error, frags, free;
1492 frags = numfrags(fs, size);
1493 for (free = 0, i = 0; i < frags; i++)
1496 if (free != 0 && free != frags)