2 * modified for Lites 1.1
4 * Aug 1995, Godmar Back (gback@cs.utah.edu)
5 * University of Utah, Department of Computer Science
8 * Copyright (c) 1982, 1986, 1989, 1993
9 * The Regents of the University of California. All rights reserved.
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted provided that the following conditions
14 * 1. Redistributions of source code must retain the above copyright
15 * notice, this list of conditions and the following disclaimer.
16 * 2. Redistributions in binary form must reproduce the above copyright
17 * notice, this list of conditions and the following disclaimer in the
18 * documentation and/or other materials provided with the distribution.
19 * 4. Neither the name of the University nor the names of its contributors
20 * may be used to endorse or promote products derived from this software
21 * without specific prior written permission.
23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 * @(#)ffs_alloc.c 8.8 (Berkeley) 2/21/94
39 #include <sys/param.h>
40 #include <sys/systm.h>
42 #include <sys/vnode.h>
44 #include <sys/mount.h>
45 #include <sys/syslog.h>
48 #include <fs/ext2fs/inode.h>
49 #include <fs/ext2fs/ext2_mount.h>
50 #include <fs/ext2fs/ext2fs.h>
51 #include <fs/ext2fs/fs.h>
52 #include <fs/ext2fs/ext2_extern.h>
54 static daddr_t ext2_alloccg(struct inode *, int, daddr_t, int);
55 static u_long ext2_dirpref(struct inode *);
56 static void ext2_fserr(struct m_ext2fs *, uid_t, char *);
57 static u_long ext2_hashalloc(struct inode *, int, long, int,
58 daddr_t (*)(struct inode *, int, daddr_t,
60 static daddr_t ext2_nodealloccg(struct inode *, int, daddr_t, int);
61 static daddr_t ext2_mapsearch(struct m_ext2fs *, char *, daddr_t);
63 static int ext2_reallocblks(struct vop_reallocblks_args *);
67 * Allocate a block in the file system.
69 * A preference may be optionally specified. If a preference is given
70 * the following hierarchy is used to allocate a block:
71 * 1) allocate the requested block.
72 * 2) allocate a rotationally optimal block in the same cylinder.
73 * 3) allocate a block in the same cylinder group.
74 * 4) quadradically rehash into other cylinder groups, until an
75 * available block is located.
76 * If no block preference is given the following hierarchy is used
77 * to allocate a block:
78 * 1) allocate a block in the cylinder group that contains the
80 * 2) quadradically rehash into other cylinder groups, until an
81 * available block is located.
84 ext2_alloc(ip, lbn, bpref, size, cred, bnp)
92 struct ext2mount *ump;
98 mtx_assert(EXT2_MTX(ump), MA_OWNED);
100 if ((u_int)size > fs->e2fs_bsize || blkoff(fs, size) != 0) {
101 vn_printf(ip->i_devvp, "bsize = %lu, size = %d, fs = %s\n",
102 (long unsigned int)fs->e2fs_bsize, size, fs->e2fs_fsmnt);
103 panic("ext2_alloc: bad size");
106 panic("ext2_alloc: missing credential");
107 #endif /* DIAGNOSTIC */
108 if (size == fs->e2fs_bsize && fs->e2fs->e2fs_fbcount == 0)
110 if (cred->cr_uid != 0 &&
111 fs->e2fs->e2fs_fbcount < fs->e2fs->e2fs_rbcount)
113 if (bpref >= fs->e2fs->e2fs_bcount)
116 cg = ino_to_cg(fs, ip->i_number);
118 cg = dtog(fs, bpref);
119 bno = (daddr_t)ext2_hashalloc(ip, cg, bpref, fs->e2fs_bsize,
122 /* set next_alloc fields as done in block_getblk */
123 ip->i_next_alloc_block = lbn;
124 ip->i_next_alloc_goal = bno;
126 ip->i_blocks += btodb(fs->e2fs_bsize);
127 ip->i_flag |= IN_CHANGE | IN_UPDATE;
133 ext2_fserr(fs, cred->cr_uid, "file system full");
134 uprintf("\n%s: write failed, file system is full\n", fs->e2fs_fsmnt);
139 * Reallocate a sequence of blocks into a contiguous sequence of blocks.
141 * The vnode and an array of buffer pointers for a range of sequential
142 * logical blocks to be made contiguous is given. The allocator attempts
143 * to find a range of sequential blocks starting as close as possible to
144 * an fs_rotdelay offset from the end of the allocation for the logical
145 * block immediately preceding the current range. If successful, the
146 * physical block numbers in the buffer pointers and in the inode are
147 * changed to reflect the new allocation. If unsuccessful, the allocation
148 * is left unchanged. The success in doing the reallocation is returned.
149 * Note that the error return is not reflected back to the user. Rather
150 * the previous block allocation will be used.
154 SYSCTL_NODE(_vfs, OID_AUTO, ext2fs, CTLFLAG_RW, 0, "EXT2FS filesystem");
156 static int doasyncfree = 1;
157 SYSCTL_INT(_vfs_ext2fs, OID_AUTO, doasyncfree, CTLFLAG_RW, &doasyncfree, 0,
158 "Use asychronous writes to update block pointers when freeing blocks");
160 static int doreallocblks = 1;
161 SYSCTL_INT(_vfs_ext2fs, OID_AUTO, doreallocblks, CTLFLAG_RW, &doreallocblks, 0, "");
166 struct vop_reallocblks_args /* {
168 struct cluster_save *a_buflist;
171 #ifndef FANCY_REALLOC
172 /* printf("ext2_reallocblks not implemented\n"); */
179 struct buf *sbp, *ebp;
180 int32_t *bap, *sbap, *ebap = 0;
181 struct ext2mount *ump;
182 struct cluster_save *buflist;
183 struct indir start_ap[NIADDR + 1], end_ap[NIADDR + 1], *idp;
184 int32_t start_lbn, end_lbn, soff, newblk, blkno;
185 int i, len, start_lvl, end_lvl, pref, ssize;
192 if (fs->fs_contigsumsize <= 0)
195 buflist = ap->a_buflist;
196 len = buflist->bs_nchildren;
197 start_lbn = buflist->bs_children[0]->b_lblkno;
198 end_lbn = start_lbn + len - 1;
200 for (i = 1; i < len; i++)
201 if (buflist->bs_children[i]->b_lblkno != start_lbn + i)
202 panic("ext2_reallocblks: non-cluster");
205 * If the latest allocation is in a new cylinder group, assume that
206 * the filesystem has decided to move and do not force it back to
207 * the previous cylinder group.
209 if (dtog(fs, dbtofsb(fs, buflist->bs_children[0]->b_blkno)) !=
210 dtog(fs, dbtofsb(fs, buflist->bs_children[len - 1]->b_blkno)))
212 if (ext2_getlbns(vp, start_lbn, start_ap, &start_lvl) ||
213 ext2_getlbns(vp, end_lbn, end_ap, &end_lvl))
216 * Get the starting offset and block map for the first block.
218 if (start_lvl == 0) {
222 idp = &start_ap[start_lvl - 1];
223 if (bread(vp, idp->in_lbn, (int)fs->e2fs_bsize, NOCRED, &sbp)) {
227 sbap = (int32_t *)sbp->b_data;
231 * Find the preferred location for the cluster.
234 pref = ext2_blkpref(ip, start_lbn, soff, sbap, 0);
236 * If the block range spans two block maps, get the second map.
238 if (end_lvl == 0 || (idp = &end_ap[end_lvl - 1])->in_off + 1 >= len) {
242 if (start_ap[start_lvl-1].in_lbn == idp->in_lbn)
243 panic("ext2_reallocblk: start == end");
245 ssize = len - (idp->in_off + 1);
246 if (bread(vp, idp->in_lbn, (int)fs->e2fs_bsize, NOCRED, &ebp)){
250 ebap = (int32_t *)ebp->b_data;
253 * Search the block map looking for an allocation of the desired size.
255 if ((newblk = (int32_t)ext2_hashalloc(ip, dtog(fs, pref), pref,
256 len, ext2_clusteralloc)) == 0){
261 * We have found a new contiguous block.
263 * First we have to replace the old block pointers with the new
264 * block pointers in the inode and indirect blocks associated
268 for (bap = &sbap[soff], i = 0; i < len; i++, blkno += fs->e2fs_fpb) {
273 if (buflist->bs_children[i]->b_blkno != fsbtodb(fs, *bap))
274 panic("ext2_reallocblks: alloc mismatch");
279 * Next we must write out the modified inode and indirect blocks.
280 * For strict correctness, the writes should be synchronous since
281 * the old block values may have been written to disk. In practise
282 * they are almost never written, but if we are concerned about
283 * strict correctness, the `doasyncfree' flag should be set to zero.
285 * The test on `doasyncfree' should be changed to test a flag
286 * that shows whether the associated buffers and inodes have
287 * been written. The flag should be set when the cluster is
288 * started and cleared whenever the buffer or inode is flushed.
289 * We can then check below to see if it is set, and do the
290 * synchronous write only when it has been cleared.
292 if (sbap != &ip->i_db[0]) {
298 ip->i_flag |= IN_CHANGE | IN_UPDATE;
309 * Last, free the old blocks and assign the new blocks to the buffers.
311 for (blkno = newblk, i = 0; i < len; i++, blkno += fs->e2fs_fpb) {
312 ext2_blkfree(ip, dbtofsb(fs, buflist->bs_children[i]->b_blkno),
314 buflist->bs_children[i]->b_blkno = fsbtodb(fs, blkno);
321 if (sbap != &ip->i_db[0])
325 #endif /* FANCY_REALLOC */
329 * Allocate an inode in the file system.
333 ext2_valloc(pvp, mode, cred, vpp)
342 struct ext2mount *ump;
352 if (fs->e2fs->e2fs_ficount == 0)
355 * If it is a directory then obtain a cylinder group based on
356 * ext2_dirpref else obtain it using ino_to_cg. The preferred inode is
357 * always the next inode.
359 if((mode & IFMT) == IFDIR) {
360 cg = ext2_dirpref(pip);
361 if (fs->e2fs_contigdirs[cg] < 255)
362 fs->e2fs_contigdirs[cg]++;
364 cg = ino_to_cg(fs, pip->i_number);
365 if (fs->e2fs_contigdirs[cg] > 0)
366 fs->e2fs_contigdirs[cg]--;
368 ipref = cg * fs->e2fs->e2fs_ipg + 1;
369 ino = (ino_t)ext2_hashalloc(pip, cg, (long)ipref, mode, ext2_nodealloccg);
373 error = VFS_VGET(pvp->v_mount, ino, LK_EXCLUSIVE, vpp);
375 ext2_vfree(pvp, ino, mode);
381 the question is whether using VGET was such good idea at all -
382 Linux doesn't read the old inode in when it's allocating a
383 new one. I will set at least i_size & i_blocks the zero.
389 /* now we want to make sure that the block pointers are zeroed out */
390 for (i = 0; i < NDADDR; i++)
392 for (i = 0; i < NIADDR; i++)
396 * Set up a new generation number for this inode.
397 * XXX check if this makes sense in ext2
399 if (ip->i_gen == 0 || ++ip->i_gen == 0)
400 ip->i_gen = random() / 2 + 1;
402 printf("ext2_valloc: allocated inode %d\n", ino);
407 ext2_fserr(fs, cred->cr_uid, "out of inodes");
408 uprintf("\n%s: create/symlink failed, no inodes free\n", fs->e2fs_fsmnt);
413 * Find a cylinder to place a directory.
415 * The policy implemented by this algorithm is to allocate a
416 * directory inode in the same cylinder group as its parent
417 * directory, but also to reserve space for its files inodes
418 * and data. Restrict the number of directories which may be
419 * allocated one after another in the same cylinder group
420 * without intervening allocation of files.
422 * If we allocate a first level directory then force allocation
423 * in another cylinder group.
427 ext2_dirpref(struct inode *pip)
430 int cg, prefcg, dirsize, cgsize;
431 int avgifree, avgbfree, avgndir, curdirsize;
432 int minifree, minbfree, maxndir;
436 mtx_assert(EXT2_MTX(pip->i_ump), MA_OWNED);
439 avgifree = fs->e2fs->e2fs_ficount / fs->e2fs_gcount;
440 avgbfree = fs->e2fs->e2fs_fbcount / fs->e2fs_gcount;
441 avgndir = fs->e2fs_total_dir / fs->e2fs_gcount;
444 * Force allocation in another cg if creating a first level dir.
446 ASSERT_VOP_LOCKED(ITOV(pip), "ext2fs_dirpref");
447 if (ITOV(pip)->v_vflag & VV_ROOT) {
448 prefcg = arc4random() % fs->e2fs_gcount;
450 minndir = fs->e2fs_ipg;
451 for (cg = prefcg; cg < fs->e2fs_gcount; cg++)
452 if (fs->e2fs_gd[cg].ext2bgd_ndirs < minndir &&
453 fs->e2fs_gd[cg].ext2bgd_nifree >= avgifree &&
454 fs->e2fs_gd[cg].ext2bgd_nbfree >= avgbfree) {
456 minndir = fs->e2fs_gd[cg].ext2bgd_ndirs;
458 for (cg = 0; cg < prefcg; cg++)
459 if (fs->e2fs_gd[cg].ext2bgd_ndirs < minndir &&
460 fs->e2fs_gd[cg].ext2bgd_nifree >= avgifree &&
461 fs->e2fs_gd[cg].ext2bgd_nbfree >= avgbfree) {
463 minndir = fs->e2fs_gd[cg].ext2bgd_ndirs;
470 * Count various limits which used for
471 * optimal allocation of a directory inode.
473 maxndir = min(avgndir + fs->e2fs_ipg / 16, fs->e2fs_ipg);
474 minifree = avgifree - avgifree / 4;
477 minbfree = avgbfree - avgbfree / 4;
480 cgsize = fs->e2fs_fsize * fs->e2fs_fpg;
481 dirsize = AVGDIRSIZE;
482 curdirsize = avgndir ? (cgsize - avgbfree * fs->e2fs_bsize) / avgndir : 0;
483 if (dirsize < curdirsize)
484 dirsize = curdirsize;
486 maxcontigdirs = 0; /* dirsize overflowed */
488 maxcontigdirs = min((avgbfree * fs->e2fs_bsize) / dirsize, 255);
489 maxcontigdirs = min(maxcontigdirs, fs->e2fs_ipg / AFPDIR);
490 if (maxcontigdirs == 0)
494 * Limit number of dirs in one cg and reserve space for
495 * regular files, but only if we have no deficit in
498 prefcg = ino_to_cg(fs, pip->i_number);
499 for (cg = prefcg; cg < fs->e2fs_gcount; cg++)
500 if (fs->e2fs_gd[cg].ext2bgd_ndirs < maxndir &&
501 fs->e2fs_gd[cg].ext2bgd_nifree >= minifree &&
502 fs->e2fs_gd[cg].ext2bgd_nbfree >= minbfree) {
503 if (fs->e2fs_contigdirs[cg] < maxcontigdirs)
506 for (cg = 0; cg < prefcg; cg++)
507 if (fs->e2fs_gd[cg].ext2bgd_ndirs < maxndir &&
508 fs->e2fs_gd[cg].ext2bgd_nifree >= minifree &&
509 fs->e2fs_gd[cg].ext2bgd_nbfree >= minbfree) {
510 if (fs->e2fs_contigdirs[cg] < maxcontigdirs)
514 * This is a backstop when we have deficit in space.
516 for (cg = prefcg; cg < fs->e2fs_gcount; cg++)
517 if (fs->e2fs_gd[cg].ext2bgd_nifree >= avgifree)
519 for (cg = 0; cg < prefcg; cg++)
520 if (fs->e2fs_gd[cg].ext2bgd_nifree >= avgifree)
526 * Select the desired position for the next block in a file.
528 * we try to mimic what Remy does in inode_getblk/block_getblk
530 * we note: blocknr == 0 means that we're about to allocate either
531 * a direct block or a pointer block at the first level of indirection
532 * (In other words, stuff that will go in i_db[] or i_ib[])
534 * blocknr != 0 means that we're allocating a block that is none
535 * of the above. Then, blocknr tells us the number of the block
536 * that will hold the pointer
539 ext2_blkpref(ip, lbn, indx, bap, blocknr)
547 mtx_assert(EXT2_MTX(ip->i_ump), MA_OWNED);
549 /* if the next block is actually what we thought it is,
550 then set the goal to what we thought it should be
552 if(ip->i_next_alloc_block == lbn && ip->i_next_alloc_goal != 0)
553 return ip->i_next_alloc_goal;
555 /* now check whether we were provided with an array that basically
556 tells us previous blocks to which we want to stay closeby
559 for (tmp = indx - 1; tmp >= 0; tmp--)
563 /* else let's fall back to the blocknr, or, if there is none,
564 follow the rule that a block should be allocated near its inode
566 return blocknr ? blocknr :
567 (int32_t)(ip->i_block_group *
568 EXT2_BLOCKS_PER_GROUP(ip->i_e2fs)) +
569 ip->i_e2fs->e2fs->e2fs_first_dblock;
573 * Implement the cylinder overflow algorithm.
575 * The policy implemented by this algorithm is:
576 * 1) allocate the block in its requested cylinder group.
577 * 2) quadradically rehash on the cylinder group number.
578 * 3) brute force search for a free block.
581 ext2_hashalloc(struct inode *ip, int cg, long pref, int size,
582 daddr_t (*allocator)(struct inode *, int, daddr_t, int))
588 mtx_assert(EXT2_MTX(ip->i_ump), MA_OWNED);
591 * 1: preferred cylinder group
593 result = (*allocator)(ip, cg, pref, size);
597 * 2: quadratic rehash
599 for (i = 1; i < fs->e2fs_gcount; i *= 2) {
601 if (cg >= fs->e2fs_gcount)
602 cg -= fs->e2fs_gcount;
603 result = (*allocator)(ip, cg, 0, size);
608 * 3: brute force search
609 * Note that we start at i == 2, since 0 was checked initially,
610 * and 1 is always checked in the quadratic rehash.
612 cg = (icg + 2) % fs->e2fs_gcount;
613 for (i = 2; i < fs->e2fs_gcount; i++) {
614 result = (*allocator)(ip, cg, 0, size);
618 if (cg == fs->e2fs_gcount)
625 * Determine whether a block can be allocated.
627 * Check to see if a block of the appropriate size is available,
628 * and if it is, allocate it.
631 ext2_alloccg(struct inode *ip, int cg, daddr_t bpref, int size)
635 struct ext2mount *ump;
636 daddr_t bno, runstart, runlen;
637 int bit, loc, end, error, start;
642 if (fs->e2fs_gd[cg].ext2bgd_nbfree == 0)
645 error = bread(ip->i_devvp, fsbtodb(fs,
646 fs->e2fs_gd[cg].ext2bgd_b_bitmap),
647 (int)fs->e2fs_bsize, NOCRED, &bp);
653 if (fs->e2fs_gd[cg].ext2bgd_nbfree == 0) {
655 * Another thread allocated the last block in this
656 * group while we were waiting for the buffer.
662 bbp = (char *)bp->b_data;
664 if (dtog(fs, bpref) != cg)
667 bpref = dtogd(fs, bpref);
669 * if the requested block is available, use it
671 if (isclr(bbp, bpref)) {
677 * no blocks in the requested cylinder, so take next
678 * available one in this cylinder group.
679 * first try to get 8 contigous blocks, then fall back to a single
683 start = dtogd(fs, bpref) / NBBY;
686 end = howmany(fs->e2fs->e2fs_fpg, NBBY) - start;
690 for (loc = start; loc < end; loc++) {
691 if (bbp[loc] == (char)0xff) {
696 /* Start of a run, find the number of high clear bits. */
700 runstart = loc * NBBY + bit;
701 } else if (bbp[loc] == 0) {
702 /* Continue a run. */
706 * Finish the current run. If it isn't long
707 * enough, start a new one.
709 bit = ffs(bbp[loc]) - 1;
716 /* Run was too short, start a new one. */
719 runstart = loc * NBBY + bit;
722 /* If the current run is long enough, use it. */
734 bno = ext2_mapsearch(fs, bbp, bpref);
742 if (isset(bbp, bno)) {
743 printf("ext2fs_alloccgblk: cg=%d bno=%jd fs=%s\n",
744 cg, (intmax_t)bno, fs->e2fs_fsmnt);
745 panic("ext2fs_alloccg: dup alloc");
750 fs->e2fs->e2fs_fbcount--;
751 fs->e2fs_gd[cg].ext2bgd_nbfree--;
755 return (cg * fs->e2fs->e2fs_fpg + fs->e2fs->e2fs_first_dblock + bno);
759 * Determine whether an inode can be allocated.
761 * Check to see if an inode is available, and if it is,
762 * allocate it using tode in the specified cylinder group.
765 ext2_nodealloccg(struct inode *ip, int cg, daddr_t ipref, int mode)
769 struct ext2mount *ump;
770 int error, start, len, loc, map, i;
772 ipref--; /* to avoid a lot of (ipref -1) */
777 if (fs->e2fs_gd[cg].ext2bgd_nifree == 0)
780 error = bread(ip->i_devvp, fsbtodb(fs,
781 fs->e2fs_gd[cg].ext2bgd_i_bitmap),
782 (int)fs->e2fs_bsize, NOCRED, &bp);
788 if (fs->e2fs_gd[cg].ext2bgd_nifree == 0) {
790 * Another thread allocated the last i-node in this
791 * group while we were waiting for the buffer.
797 ibp = (char *)bp->b_data;
799 ipref %= fs->e2fs->e2fs_ipg;
800 if (isclr(ibp, ipref))
803 start = ipref / NBBY;
804 len = howmany(fs->e2fs->e2fs_ipg - ipref, NBBY);
805 loc = skpc(0xff, len, &ibp[start]);
809 loc = skpc(0xff, len, &ibp[0]);
811 printf("cg = %d, ipref = %lld, fs = %s\n",
812 cg, (long long)ipref, fs->e2fs_fsmnt);
813 panic("ext2fs_nodealloccg: map corrupted");
817 i = start + len - loc;
820 printf("fs = %s\n", fs->e2fs_fsmnt);
821 panic("ext2fs_nodealloccg: block not in map");
823 ipref = i * NBBY + ffs(map) - 1;
827 fs->e2fs_gd[cg].ext2bgd_nifree--;
828 fs->e2fs->e2fs_ficount--;
830 if ((mode & IFMT) == IFDIR) {
831 fs->e2fs_gd[cg].ext2bgd_ndirs++;
832 fs->e2fs_total_dir++;
836 return (cg * fs->e2fs->e2fs_ipg + ipref +1);
840 * Free a block or fragment.
844 ext2_blkfree(ip, bno, size)
851 struct ext2mount *ump;
858 if ((u_int)bno >= fs->e2fs->e2fs_bcount) {
859 printf("bad block %lld, ino %llu\n", (long long)bno,
860 (unsigned long long)ip->i_number);
861 ext2_fserr(fs, ip->i_uid, "bad block");
864 error = bread(ip->i_devvp,
865 fsbtodb(fs, fs->e2fs_gd[cg].ext2bgd_b_bitmap),
866 (int)fs->e2fs_bsize, NOCRED, &bp);
871 bbp = (char *)bp->b_data;
872 bno = dtogd(fs, bno);
873 if (isclr(bbp, bno)) {
874 printf("block = %lld, fs = %s\n",
875 (long long)bno, fs->e2fs_fsmnt);
876 panic("blkfree: freeing free block");
880 fs->e2fs->e2fs_fbcount++;
881 fs->e2fs_gd[cg].ext2bgd_nbfree++;
892 ext2_vfree(pvp, ino, mode)
900 struct ext2mount *ump;
903 /* mode_t save_i_mode; */
908 if ((u_int)ino > fs->e2fs_ipg * fs->e2fs_gcount)
909 panic("ext2_vfree: range: devvp = %p, ino = %d, fs = %s",
910 pip->i_devvp, ino, fs->e2fs_fsmnt);
912 cg = ino_to_cg(fs, ino);
913 error = bread(pip->i_devvp,
914 fsbtodb(fs, fs->e2fs_gd[cg].ext2bgd_i_bitmap),
915 (int)fs->e2fs_bsize, NOCRED, &bp);
920 ibp = (char *)bp->b_data;
921 ino = (ino - 1) % fs->e2fs->e2fs_ipg;
922 if (isclr(ibp, ino)) {
923 printf("ino = %llu, fs = %s\n",
924 (unsigned long long)ino, fs->e2fs_fsmnt);
925 if (fs->e2fs_ronly == 0)
926 panic("ifree: freeing free inode");
930 fs->e2fs->e2fs_ficount++;
931 fs->e2fs_gd[cg].ext2bgd_nifree++;
932 if ((mode & IFMT) == IFDIR) {
933 fs->e2fs_gd[cg].ext2bgd_ndirs--;
934 fs->e2fs_total_dir--;
943 * Find a block in the specified cylinder group.
945 * It is a panic if a request is made to find a block if none are
949 ext2_mapsearch(struct m_ext2fs *fs, char *bbp, daddr_t bpref)
951 int start, len, loc, i, map;
954 * find the fragment by searching through the free block
955 * map for an appropriate bit pattern
958 start = dtogd(fs, bpref) / NBBY;
961 len = howmany(fs->e2fs->e2fs_fpg, NBBY) - start;
962 loc = skpc(0xff, len, &bbp[start]);
966 loc = skpc(0xff, len, &bbp[start]);
968 printf("start = %d, len = %d, fs = %s\n",
969 start, len, fs->e2fs_fsmnt);
970 panic("ext2fs_alloccg: map corrupted");
974 i = start + len - loc;
977 printf("fs = %s\n", fs->e2fs_fsmnt);
978 panic("ext2fs_mapsearch: block not in map");
980 return (i * NBBY + ffs(map) - 1);
984 * Fserr prints the name of a file system with an error diagnostic.
986 * The form of the error message is:
990 ext2_fserr(fs, uid, cp)
996 log(LOG_ERR, "uid %u on %s: %s\n", uid, fs->e2fs_fsmnt, cp);
1004 if (i == 0 || i == 1)
1006 for (a3 = 3, a5 = 5, a7 = 7;
1007 a3 <= i || a5 <= i || a7 <= i;
1008 a3 *= 3, a5 *= 5, a7 *= 7)
1009 if (i == a3 || i == a5 || i == a7)