INOPB
minino = inum - (inum % INOPB(sblock));
maxino = minino + INOPB(sblock);
inumber < startinum || inumber >= startinum + INOPB(&sblock)) {
startinum = (inumber / INOPB(&sblock)) * INOPB(&sblock);
&pbp->b_un.b_dinode1[inumber % INOPB(&sblock)]);
return ((union dinode *)&pbp->b_un.b_dinode2[inumber % INOPB(&sblock)]);
if (INOPB(&sblock) != inopb) {
pwarn("INCONSISTENT INOPB=%u\n", INOPB(&sblock));
inumber < startinum || inumber >= startinum + INOPB(&sblock)) {
startinum = (inumber / INOPB(&sblock)) * INOPB(&sblock);
(inumber % INOPB(&sblock)) * sizeof(struct ufs1_dinode));
(inumber % INOPB(&sblock)) * sizeof(struct ufs2_dinode));
acg.cg_initediblk = MINIMUM(sblock.fs_ipg, 2 * INOPB(&sblock));
for (i = MINIMUM(sblock.fs_ipg, 2 * INOPB(&sblock)); i != 0; i--) {
for (j = 0; j < INOPB(&sblock); j++) {
minfpg = fragsperinode * INOPB(&sblock);
sblock.fs_ipg = INOPB(&sblock);
INOPB(&sblock));
INOPB(&sblock));
INOPB(&sblock));
INOPB(&sblock));
INOPB(&sblock));
acg.cg_initediblk = MINIMUM(sblock.fs_ipg, 2 * INOPB(&sblock));
for (i = MINIMUM(sblock.fs_ipg, 2 * INOPB(&sblock)); i != 0; i--) {
for (j = 0; j < INOPB(&sblock); j++) {
ipref + INOPB(fs) > cgp->cg_initediblk &&
for (i = 0; i < INOPB(fs); i++) {
cgp->cg_initediblk += INOPB(fs);
(blkstofrags((fs), (((x) % (fs)->fs_ipg) / INOPB(fs))))))
#define ino_to_fsbo(fs, x) ((x) % INOPB(fs))
(uint32_t)(cgino + INOPB(fs)) > initediblk &&
for (i = 0; i < INOPB(fs); i++) {
initediblk += INOPB(fs);
minfpg = fragsperinode * INOPB(&sblock);
sblock.fs_ipg = INOPB(&sblock);
INOPB(&sblock));
INOPB(&sblock));
INOPB(&sblock));
INOPB(&sblock));
INOPB(&sblock));
acg.cg_initediblk = sblock.fs_ipg < 2 * INOPB(&sblock) ?
sblock.fs_ipg : 2 * INOPB(&sblock);
for (j = 0; j < INOPB(&sblock); j++) {