Home | History | Annotate | Download | only in lfs

Lines Matching refs:ino

98 	DLOG((DLOG_ALLOC, "lfs: ino %d wrd %d bit %d set\n", (int)(I), 	\
103 DLOG((DLOG_ALLOC, "lfs: ino %d wrd %d bit %d clr\n", (int)(I), \
247 ino_t *ino, int *gen)
267 LFS_GET_HEADFREE(fs, cip, cbp, ino);
270 KASSERT(*ino != LFS_UNUSED_INUM && *ino != LFS_IFILE_INUM);
272 *ino));
275 CLR_BITMAP_FREE(fs, *ino);
281 LFS_IENTRY(ifp, fs, *ino, bp);
284 *ino);
289 *ino, (uintmax_t)lfs_if_getnextfree(fs, ifp)));
317 LFS_PUT_HEADFREE(fs, cip, cbp, *ino);
350 lfs_valloc_fixed(struct lfs *fs, ino_t ino, int vers)
374 while (VTOI(fs->lfs_ivnode)->i_size <= (ino /
377 DLOG((DLOG_ALLOC, "extend ifile to accommodate ino %jd\n",
378 (intmax_t)ino));
386 LFS_IENTRY(ifp, fs, ino, bp);
395 if (headino == ino) {
413 if (nextfree == ino ||
441 if (tailino == ino)
446 LFS_IENTRY(ifp, fs, ino, bp);
461 LFS_PUT_HEADFREE(fs, cip, cbp, ino);
487 ino_t ino, maxino;
492 for (ino = maxino - 1; ino > LFS_UNUSED_INUM; --ino) {
493 if (ISSET_BITMAP_FREE(fs, ino) == 0)
496 return ino;
506 lfs_freelist_prev(struct lfs *fs, ino_t ino)
516 bound = ino & ~BMMASK;
517 for (tino = ino - 1; tino >= bound && tino > LFS_UNUSED_INUM; tino--)
521 if (ino >> BMSHIFT == 0)
529 for (bb = (ino >> BMSHIFT) - 1; bb >= freehdbb && bb > 0; --bb)
557 lfs_vfree(struct vnode *vp, ino_t ino, int mode)
570 ino = ip->i_number;
575 DLOG((DLOG_ALLOC, "lfs_vfree: free ino %lld\n", (long long)ino));
642 SET_BITMAP_FREE(fs, ino);
650 LFS_IENTRY(ifp, fs, ino, bp);
667 LFS_PUT_HEADFREE(fs, cip, cbp, ino);
688 tino = lfs_freelist_prev(fs, ino);
698 LFS_IENTRY(ifp, fs, ino, bp);
702 LFS_PUT_HEADFREE(fs, cip, cbp, ino);
704 (long long)nextfree, (long long)ino));
711 LFS_PUT_TAILFREE(fs, cip, cbp, ino);
714 (long long)ino));
723 DLOG((DLOG_ALLOC, "lfs_vfree: insert ino %lld "
724 " after %lld\n", ino, tino));
730 lfs_if_setnextfree(fs, ifp, ino);
735 LFS_IENTRY(ifp, fs, ino, bp);
744 LFS_PUT_TAILFREE(fs, cip, cbp, ino);
747 (long long)ino));
753 KASSERTMSG((ino != LFS_UNUSED_INUM), "inode 0 freed");
801 ino_t ino, firstino, lastino, maxino;
827 for (ino = 0; ino < maxino; ino++) {
829 if (ino % lfs_sb_getifpb(fs) == 0)
830 LFS_IENTRY(ifp, fs, ino, bp);
835 if (ino == LFS_UNUSED_INUM || ino == LFS_IFILE_INUM)
867 orphan[norphan++] = ino;
879 firstino = ino;
889 lfs_if_setnextfree(fs, ifp, ino);
894 LFS_IENTRY(ifp, fs, ino, bp);
897 lastino = ino;
900 SET_BITMAP_FREE(fs, ino);
904 if ((ino + 1) % lfs_sb_getifpb(fs) == 0)
942 lfs_orphan(struct lfs *fs, ino_t ino)
947 LFS_IENTRY(ifp, fs, ino, bp);
968 ino_t ino = orphan[i];
978 LFS_IENTRY(ifp, fs, ino, bp);
987 error = VFS_VGET(fs->lfs_ivnode->v_mount, ino, LK_EXCLUSIVE,
990 printf("orphan %jd vget error %d\n", (intmax_t)ino,
1002 printf("orphan %jd nlink %d\n", (intmax_t)ino,
1014 printf("orphan %jd truncate error %d", (intmax_t)ino,
1025 LFS_IENTRY(ifp, fs, ino, bp);
1074 printf("tailino=%jd, but ino=%jd"
1086 printf("with tailino=%jd, ino=%jd"
1135 printf("Last ino %jd but tail %jd\n",