ROOTINO
sfsp->f_files = sblock.fs_ncg * sblock.fs_ipg - ROOTINO;
sfsp->f_files = sblock.fs_ncg * sblock.fs_ipg - ROOTINO;
if (ino < ROOTINO)
mapfileino(ROOTINO, tapesize, &anydirskipped);
SETINO(ROOTINO, dumpinomap);
if (ino < ROOTINO || ino > maxino) {
dp = ginode(ROOTINO);
idesc.id_number = ROOTINO;
lfdir = allocdir(ROOTINO, 0, lfmode);
if (makeentry(ROOTINO, lfdir, lfname) != 0) {
freedir(lfdir, ROOTINO);
if ((lfdir = allocdir(ROOTINO, 0, lfmode)) == 0) {
if ((changeino(ROOTINO, lfname, lfdir) & ALTERED) == 0) {
if (parent < ROOTINO || parent >= maxino ||
ino < ROOTINO || ino >= maxino)
if (ino == ROOTINO) {
if (inumber < ROOTINO || inumber > maxino)
if (inumber == ROOTINO)
inp->i_parent = ROOTINO;
dirp->d_ino >= ROOTINO && dirp->d_ino <= maxino) {
if (ino < ROOTINO || ino > maxino)
request = ROOTINO;
(n_files -= maxino - ROOTINO - sblock.fs_cstotal.cs_nifree))
if (inumber < ROOTINO) {
if (inumber < ROOTINO)
freeino(ROOTINO);
if (allocdir(ROOTINO, ROOTINO, 0755) != ROOTINO)
dp = ginode(ROOTINO);
errexit("BAD STATE %d FOR ROOT INODE\n", GET_ISTATE(ROOTINO));
SET_ISTATE(ROOTINO, DFOUND);
inp->i_number == ROOTINO)
propagate(ROOTINO);
switch (GET_ISTATE(ROOTINO)) {
if (allocdir(ROOTINO, ROOTINO, 0755) != ROOTINO)
freeino(ROOTINO);
if (allocdir(ROOTINO, ROOTINO, 0755) != ROOTINO)
if (inp->i_number == ROOTINO ||
if (inumber < ROOTINO)
if (j < ROOTINO)
for (i = 0; i < ROOTINO; i++) {
if (curdir == ino && ino == ROOTINO) {
while (ino != ROOTINO) {
if (ino != ROOTINO)
curinode = ginode(ROOTINO);
curinum = ROOTINO;
if (inum < ROOTINO || inum > maxino || cp == argv[ac] || *cp != '\0' ) { \
(unsigned long long)inum, (unsigned long long)ROOTINO, \
curinum = ROOTINO;
curinode = ginode(ROOTINO);
if (inumber >= ROOTINO) {
if (inumber < ROOTINO) {
for (i = 0; i < ROOTINO; i++) {
for (ino = ROOTINO; ino < maxino; ino++) {
if (inum < ROOTINO || inum >= sblock->fs_ncg * sblock->fs_ipg)
scanonedir(ROOTINO, "");
sblock.fs_cstotal.cs_nifree = sblock.fs_ncg * sblock.fs_ipg - ROOTINO;
for (i = 0; i < ROOTINO; i++) {
{ ROOTINO, sizeof(struct direct), DT_DIR, 1, "." },
{ ROOTINO, sizeof(struct direct), DT_DIR, 2, ".." },
iput(&node, ROOTINO);
iput(&node, ROOTINO + 1);
iput(&node, ROOTINO);
iput(&node, ROOTINO + 1);
ino < ROOTINO ||
ino = ROOTINO;
if (node.ino == ROOTINO &&
bigino = ROOTINO;
treescan(".", ROOTINO, nodeupdates);
treescan(".", ROOTINO, nodeupdates);
treescan(".", ROOTINO, verifyfile);
for (i = ROOTINO + 1; i < maxino; i++) {
for (i = ROOTINO; i < maxino; i++) {
first = lowerbnd(ROOTINO);
first = lowerbnd(ROOTINO);
for (i = ROOTINO; i < maxino; i++) {
for (i = ROOTINO; i < maxino; i++) {
if (inum < ROOTINO || inum >= maxino)
for (ep = lookupino(ROOTINO); ep != NULL; ep = ep->e_entries) {
if (ep == lookupino(ROOTINO))
if (inum != ROOTINO || lookupino(ROOTINO) != NULL)
addino(ROOTINO, np);
for (i = ROOTINO; i <= maxino; i++) {
for (i = ROOTINO; i <= maxino; i++) {
ep = addentry(".", ROOTINO, NODE);
if (inum < ROOTINO || inum >= maxino)
if (inum < ROOTINO || inum >= maxino)
for ( ; start > ROOTINO; start--) {
inumber = ROOTINO;
inumber = ROOTINO;
inumber = ROOTINO;
inumber = ROOTINO;
inumber = ROOTINO;
inumber = ROOTINO;
rootino = ROOTINO;
if (ip->i_number == ROOTINO)
sbp->f_files = fs->fs_ncg * fs->fs_ipg - ROOTINO;
if (ino < ROOTINO || ino >= fs->fs_ncg * fs->fs_ipg)
rootino = ROOTINO;
if ((error = VFS_VGET(mp, ROOTINO, &nvp)) != 0)
fsopts->curinode = ROOTINO;
fsopts->inodes += ROOTINO; /* include first two inodes */
if ((off_t)(fs->fs_cstotal.cs_nifree + ROOTINO) < fsopts->inodes) {
(long long)(fs->fs_cstotal.cs_nifree + ROOTINO),
sblock.fs_cstotal.cs_nifree = sblock.fs_ncg * sblock.fs_ipg - ROOTINO;
for (r = 0; r < ROOTINO; r++) {