|
|
@@ -0,0 +1,264 @@
|
|
|
+/*-
|
|
|
+ * Copyright (c) 1982, 1986, 1989, 1993
|
|
|
+ * The Regents of the University of California. All rights reserved.
|
|
|
+ *
|
|
|
+ * Redistribution and use in source and binary forms, with or without
|
|
|
+ * modification, are permitted provided that the following conditions
|
|
|
+ * are met:
|
|
|
+ * 1. Redistributions of source code must retain the above copyright
|
|
|
+ * notice, this list of conditions and the following disclaimer.
|
|
|
+ * 2. Redistributions in binary form must reproduce the above copyright
|
|
|
+ * notice, this list of conditions and the following disclaimer in the
|
|
|
+ * documentation and/or other materials provided with the distribution.
|
|
|
+ * 3. Neither the name of the University nor the names of its contributors
|
|
|
+ * may be used to endorse or promote products derived from this software
|
|
|
+ * without specific prior written permission.
|
|
|
+ *
|
|
|
+ * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
|
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
|
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
|
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
|
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
|
+ * SUCH DAMAGE.
|
|
|
+ *
|
|
|
+ * @(#)ffs_subr.c 8.5 (Berkeley) 3/21/95
|
|
|
+ */
|
|
|
+
|
|
|
+#include <u.h>
|
|
|
+#include <libc.h>
|
|
|
+
|
|
|
+#include <ufs/freebsd_util.h>
|
|
|
+
|
|
|
+#include <ufs/quota.h>
|
|
|
+#include <ffs/fs.h>
|
|
|
+#include <ufs/inode.h>
|
|
|
+
|
|
|
+
|
|
|
+void panic(char*, ...);
|
|
|
+
|
|
|
+
|
|
|
+/*
|
|
|
+ * Update the frsum fields to reflect addition or deletion
|
|
|
+ * of some frags.
|
|
|
+ */
|
|
|
+void
|
|
|
+ffs_fragacct(Fs *fs, int fragmap, int32_t fraglist[], int cnt)
|
|
|
+{
|
|
|
+ int inblk;
|
|
|
+ int field, subfield;
|
|
|
+ int siz, pos;
|
|
|
+
|
|
|
+ inblk = (int)(fragtbl[fs->fs_frag][fragmap]) << 1;
|
|
|
+ fragmap <<= 1;
|
|
|
+ for (siz = 1; siz < fs->fs_frag; siz++) {
|
|
|
+ if ((inblk & (1 << (siz + (fs->fs_frag % NBBY)))) == 0)
|
|
|
+ continue;
|
|
|
+ field = around[siz];
|
|
|
+ subfield = inside[siz];
|
|
|
+ for (pos = siz; pos <= fs->fs_frag; pos++) {
|
|
|
+ if ((fragmap & field) == subfield) {
|
|
|
+ fraglist[siz] += cnt;
|
|
|
+ pos += siz;
|
|
|
+ field <<= siz;
|
|
|
+ subfield <<= siz;
|
|
|
+ }
|
|
|
+ field <<= 1;
|
|
|
+ subfield <<= 1;
|
|
|
+ }
|
|
|
+ }
|
|
|
+}
|
|
|
+
|
|
|
+/*
|
|
|
+ * block operations
|
|
|
+ *
|
|
|
+ * check if a block is available
|
|
|
+ */
|
|
|
+int
|
|
|
+ffs_isblock(Fs *fs, unsigned char *cp, ufs1_daddr_t h)
|
|
|
+{
|
|
|
+ unsigned char mask;
|
|
|
+
|
|
|
+ switch ((int)fs->fs_frag) {
|
|
|
+ case 8:
|
|
|
+ return (cp[h] == 0xff);
|
|
|
+ case 4:
|
|
|
+ mask = 0x0f << ((h & 0x1) << 2);
|
|
|
+ return ((cp[h >> 1] & mask) == mask);
|
|
|
+ case 2:
|
|
|
+ mask = 0x03 << ((h & 0x3) << 1);
|
|
|
+ return ((cp[h >> 2] & mask) == mask);
|
|
|
+ case 1:
|
|
|
+ mask = 0x01 << (h & 0x7);
|
|
|
+ return ((cp[h >> 3] & mask) == mask);
|
|
|
+ default:
|
|
|
+ panic("ffs_isblock");
|
|
|
+ break;
|
|
|
+ }
|
|
|
+ return (0);
|
|
|
+}
|
|
|
+
|
|
|
+/*
|
|
|
+ * check if a block is free
|
|
|
+ */
|
|
|
+int
|
|
|
+ffs_isfreeblock(Fs *fs, uint8_t *cp, ufs1_daddr_t h)
|
|
|
+{
|
|
|
+ switch ((int)fs->fs_frag) {
|
|
|
+ case 8:
|
|
|
+ return (cp[h] == 0);
|
|
|
+ case 4:
|
|
|
+ return ((cp[h >> 1] & (0x0f << ((h & 0x1) << 2))) == 0);
|
|
|
+ case 2:
|
|
|
+ return ((cp[h >> 2] & (0x03 << ((h & 0x3) << 1))) == 0);
|
|
|
+ case 1:
|
|
|
+ return ((cp[h >> 3] & (0x01 << (h & 0x7))) == 0);
|
|
|
+ default:
|
|
|
+ panic("ffs_isfreeblock");
|
|
|
+ break;
|
|
|
+ }
|
|
|
+ return (0);
|
|
|
+}
|
|
|
+
|
|
|
+/*
|
|
|
+ * take a block out of the map
|
|
|
+ */
|
|
|
+void
|
|
|
+ffs_clrblock(Fs *fs, uint8_t *cp, ufs1_daddr_t h)
|
|
|
+{
|
|
|
+ switch ((int)fs->fs_frag) {
|
|
|
+ case 8:
|
|
|
+ cp[h] = 0;
|
|
|
+ return;
|
|
|
+ case 4:
|
|
|
+ cp[h >> 1] &= ~(0x0f << ((h & 0x1) << 2));
|
|
|
+ return;
|
|
|
+ case 2:
|
|
|
+ cp[h >> 2] &= ~(0x03 << ((h & 0x3) << 1));
|
|
|
+ return;
|
|
|
+ case 1:
|
|
|
+ cp[h >> 3] &= ~(0x01 << (h & 0x7));
|
|
|
+ return;
|
|
|
+ default:
|
|
|
+ panic("ffs_clrblock");
|
|
|
+ break;
|
|
|
+ }
|
|
|
+}
|
|
|
+
|
|
|
+/*
|
|
|
+ * put a block into the map
|
|
|
+ */
|
|
|
+void
|
|
|
+ffs_setblock(Fs *fs, unsigned char *cp, ufs1_daddr_t h)
|
|
|
+{
|
|
|
+ switch ((int)fs->fs_frag) {
|
|
|
+
|
|
|
+ case 8:
|
|
|
+ cp[h] = 0xff;
|
|
|
+ return;
|
|
|
+ case 4:
|
|
|
+ cp[h >> 1] |= (0x0f << ((h & 0x1) << 2));
|
|
|
+ return;
|
|
|
+ case 2:
|
|
|
+ cp[h >> 2] |= (0x03 << ((h & 0x3) << 1));
|
|
|
+ return;
|
|
|
+ case 1:
|
|
|
+ cp[h >> 3] |= (0x01 << (h & 0x7));
|
|
|
+ return;
|
|
|
+ default:
|
|
|
+ panic("ffs_setblock");
|
|
|
+ break;
|
|
|
+ }
|
|
|
+}
|
|
|
+
|
|
|
+/*
|
|
|
+ * Update the cluster map because of an allocation or free.
|
|
|
+ *
|
|
|
+ * Cnt == 1 means free; cnt == -1 means allocating.
|
|
|
+ */
|
|
|
+void
|
|
|
+ffs_clusteracct(Fs *fs, Cg *cgp, ufs1_daddr_t blkno, int cnt)
|
|
|
+{
|
|
|
+ int32_t *sump;
|
|
|
+ int32_t *lp;
|
|
|
+ uint8_t *freemapp, *mapp;
|
|
|
+ int i, start, end, forw, back, map, bit;
|
|
|
+
|
|
|
+ if (fs->fs_contigsumsize <= 0)
|
|
|
+ return;
|
|
|
+ freemapp = cg_clustersfree(cgp);
|
|
|
+ sump = cg_clustersum(cgp);
|
|
|
+ /*
|
|
|
+ * Allocate or clear the actual block.
|
|
|
+ */
|
|
|
+ if (cnt > 0)
|
|
|
+ setbit(freemapp, blkno);
|
|
|
+ else
|
|
|
+ clrbit(freemapp, blkno);
|
|
|
+ /*
|
|
|
+ * Find the size of the cluster going forward.
|
|
|
+ */
|
|
|
+ start = blkno + 1;
|
|
|
+ end = start + fs->fs_contigsumsize;
|
|
|
+ if (end >= cgp->cg_nclusterblks)
|
|
|
+ end = cgp->cg_nclusterblks;
|
|
|
+ mapp = &freemapp[start / NBBY];
|
|
|
+ map = *mapp++;
|
|
|
+ bit = 1 << (start % NBBY);
|
|
|
+ for (i = start; i < end; i++) {
|
|
|
+ if ((map & bit) == 0)
|
|
|
+ break;
|
|
|
+ if ((i & (NBBY - 1)) != (NBBY - 1)) {
|
|
|
+ bit <<= 1;
|
|
|
+ } else {
|
|
|
+ map = *mapp++;
|
|
|
+ bit = 1;
|
|
|
+ }
|
|
|
+ }
|
|
|
+ forw = i - start;
|
|
|
+ /*
|
|
|
+ * Find the size of the cluster going backward.
|
|
|
+ */
|
|
|
+ start = blkno - 1;
|
|
|
+ end = start - fs->fs_contigsumsize;
|
|
|
+ if (end < 0)
|
|
|
+ end = -1;
|
|
|
+ mapp = &freemapp[start / NBBY];
|
|
|
+ map = *mapp--;
|
|
|
+ bit = 1 << (start % NBBY);
|
|
|
+ for (i = start; i > end; i--) {
|
|
|
+ if ((map & bit) == 0)
|
|
|
+ break;
|
|
|
+ if ((i & (NBBY - 1)) != 0) {
|
|
|
+ bit >>= 1;
|
|
|
+ } else {
|
|
|
+ map = *mapp--;
|
|
|
+ bit = 1 << (NBBY - 1);
|
|
|
+ }
|
|
|
+ }
|
|
|
+ back = start - i;
|
|
|
+ /*
|
|
|
+ * Account for old cluster and the possibly new forward and
|
|
|
+ * back clusters.
|
|
|
+ */
|
|
|
+ i = back + forw + 1;
|
|
|
+ if (i > fs->fs_contigsumsize)
|
|
|
+ i = fs->fs_contigsumsize;
|
|
|
+ sump[i] += cnt;
|
|
|
+ if (back > 0)
|
|
|
+ sump[back] -= cnt;
|
|
|
+ if (forw > 0)
|
|
|
+ sump[forw] -= cnt;
|
|
|
+ /*
|
|
|
+ * Update cluster summary information.
|
|
|
+ */
|
|
|
+ lp = &sump[fs->fs_contigsumsize];
|
|
|
+ for (i = fs->fs_contigsumsize; i > 0; i--)
|
|
|
+ if (*lp-- > 0)
|
|
|
+ break;
|
|
|
+ fs->fs_maxcluster[cgp->cg_cgx] = i;
|
|
|
+}
|
Graham MacDonald