fs_ipg
maxino = sblock->fs_ipg * sblock->fs_ncg;
afs.fs_cpg, afs.fs_fpg / afs.fs_frag, afs.fs_fpg, afs.fs_ipg);
pbits(cg_inosused(&acg), afs.fs_ipg);
for(in=cg_start*sblock.fs_ipg; in<(ino_t)cg_stop*sblock.fs_ipg;
if (inum % sblock.fs_ipg != 0)
readpercg = sblock.fs_ipg / fullcnt;
partialcnt = sblock.fs_ipg % fullcnt;
setbit(cg_inosused(cgp), ino % sblock.fs_ipg);
cp = &cg_inosused(&cgrp)[(sblock.fs_ipg - 1) / NBBY];
if (inosused < sblock.fs_ipg || inumber == lastino)
inosused = lastino - (c * sblock.fs_ipg);
inumber = c * sblock.fs_ipg;
inosused = sblock.fs_ipg;
for (i = 0; i < sblock.fs_ipg; i++, inumber++) {
inumber = cg * sblock.fs_ipg;
newcg->cg_iusedoff + howmany(fs->fs_ipg, NBBY);
newcg->cg_cs.cs_nifree = fs->fs_ipg;
j = fs->fs_ipg * c;
c * fs->fs_ipg + i * NBBY + k);
newcg->cg_niblk = fs->fs_ipg;
maxino = sblock.fs_ncg * sblock.fs_ipg;
altsblock.fs_ipg != sblock.fs_ipg ||
ilp = &inostathead[inum / sblock.fs_ipg];
iloff = inum % sblock.fs_ipg;
ibufsize = sizeof(struct ufs1_dinode) * sblock->fs_ipg;
for (n = 0; n < sblock->fs_ipg; n++, inumber++) {
sb->fs_ipg);
e=sb->fs_ipg/8;
for(inc=osblock.fs_ipg-1 ; inc>=0 ; inc--) {
inumber+=(cg * sblock.fs_ipg);
sblock.fs_ipg);
acg.cg_niblk = sblock.fs_ipg;
acg.cg_freeoff = acg.cg_iusedoff + howmany(sblock.fs_ipg, NBBY);
acg.cg_cs.cs_nifree += sblock.fs_ipg;
for (i = 0; i < sblock.fs_ipg / INOPF(&sblock); i += sblock.fs_frag) {
if (ino >= (uint32_t)sblock.fs_ipg * (uint32_t)sblock.fs_ncg) {
sblock.fs_ipg = inospercg;
sblock.fs_ipg = inospercg;
sblock.fs_ipg = inospercg;
sblock.fs_ipg = calcipg(sblock.fs_cpg, bpcg, &usedb);
while (sblock.fs_ipg > MAXIPG(&sblock)) {
sblock.fs_ipg = calcipg(sblock.fs_cpg, bpcg, &usedb);
sblock.fs_ipg = calcipg(sblock.fs_cpg, bpcg, &usedb);
sblock.fs_dblkno = sblock.fs_iblkno + sblock.fs_ipg / INOPF(&sblock);
sblock.fs_ipg,
acg.cg_niblk = sblock.fs_ipg;
acg.cg_freeoff = acg.cg_iusedoff + howmany(sblock.fs_ipg, NBBY);
acg.cg_cs.cs_nifree += sblock.fs_ipg;
for (i = 0; i < sblock.fs_ipg / INOPF(&sblock); i += sblock.fs_frag) {
quotamaxino = sblock.fs_ncg * sblock.fs_ipg;
for (i = 0; i < sblock.fs_ipg; i++, ino++) {
readpercg = sblock.fs_ipg / fullcnt;
partialcnt = sblock.fs_ipg % fullcnt;
int32_t fs_ipg; /* inodes per group */
/* inode map */ howmany((fs)->fs_ipg, NBBY) + \
#define ino_to_cg(fs, x) ((x) / (fs)->fs_ipg)
(blkstofrags((fs), (((x) % (fs)->fs_ipg) / INOPB(fs))))))
(((x) % (fs)->fs_ipg) / (ipervblk) * DBPERVBLK))
#define ino_to_bgo(fs, ino) (((ino) - 1) % (fs)->fs_ipg)
#define ino_to_bg(fs, ino) (((ino) - 1) / (fs)->fs_ipg)
ibase = cg * fs->fs_ipg;
ipref %= fs->fs_ipg;
ipref = (cgp->cg_irotor % fs->fs_ipg) >> 3; /* byte index */
len = (fs->fs_ipg + 7) >> 3; /* byte size */
cgp->cg_irotor = (ipref + 1) % fs->fs_ipg;
KKASSERT(ipref >= 0 && ipref < fs->fs_ipg);
if ((uint)ino >= fs->fs_ipg * fs->fs_ncg)
ino %= fs->fs_ipg;
if (ipref >= fs->fs_ncg * fs->fs_ipg)
minndir = fs->fs_ipg;
return ((ino_t)(fs->fs_ipg * mincg));
maxndir = min(avgndir + fs->fs_ipg / 16, fs->fs_ipg);
fs->fs_ipg / fs->fs_avgfpdir);
return ((ino_t)(fs->fs_ipg * cg));
return ((ino_t)(fs->fs_ipg * cg));
return ((ino_t)(fs->fs_ipg * cg));
return ((ino_t)(fs->fs_ipg * cg));
ufhp->ufid_ino >= fs->fs_ncg * fs->fs_ipg)
sbp->f_files = fs->fs_ncg * fs->fs_ipg - UFS_ROOTINO;
int32_t fs_ipg; /* inodes per group */
/* inode map */ howmany((fs)->fs_ipg, NBBY) + \
#define ino_to_cg(fs, x) ((x) / (fs)->fs_ipg)
(blkstofrags((fs), (((x) % (fs)->fs_ipg) / INOPB(fs))))))
cgino = ino % fs->fs_ipg;
cg * fs->fs_ipg + initediblk)),
/* inode map */ howmany((fs)->fs_ipg, NBBY) + \
sblock.fs_ipg = INOPB(&sblock);
sblock.fs_ipg / INOPF(&sblock), sblock.fs_frag);
sblock.fs_ipg = roundup(howmany(sblock.fs_fpg, fragsperinode),
sblock.fs_ipg / INOPF(&sblock), sblock.fs_frag);
sblock.fs_ipg = roundup(howmany(sblock.fs_fpg, fragsperinode),
sblock.fs_ipg = roundup(howmany(sblock.fs_fpg, fragsperinode),
sblock.fs_ipg = roundup(howmany(sblock.fs_fpg, fragsperinode),
sblock.fs_ipg / INOPF(&sblock), sblock.fs_frag);
sblock.fs_ipg = roundup(howmany(sblock.fs_fpg, fragsperinode),
sblock.fs_dblkno = sblock.fs_iblkno + sblock.fs_ipg / INOPF(&sblock);
sblock.fs_ncg * sblock.fs_ipg - UFS_ROOTINO;
sblock.fs_fpg / sblock.fs_frag, sblock.fs_ipg);
acg.cg_niblk = sblock.fs_ipg;
acg.cg_initediblk = MIN(sblock.fs_ipg, 2 * INOPB(&sblock));
acg.cg_freeoff = acg.cg_iusedoff + howmany(sblock.fs_ipg, CHAR_BIT);
acg.cg_cs.cs_nifree += sblock.fs_ipg;
i < sblock.fs_ipg / INOPF(&sblock);
maxino = super->fs_ncg * super->fs_ipg - 1;
maxino = super->fs_ncg * super->fs_ipg - 1;
maxino = super->fs_ncg * super->fs_ipg - 1;
#define INOCNT(fs) ((fs)->fs_ipg)