bsd/ufs/ffs/ffs_subr.c

   1 /*
   2  * Copyright (c) 2000 Apple Computer, Inc. All rights reserved.
   3  *
   4  * @APPLE_LICENSE_OSREFERENCE_HEADER_START@
   5  *
   6  * This file contains Original Code and/or Modifications of Original Code
   7  * as defined in and that are subject to the Apple Public Source License
   8  * Version 2.0 (the 'License'). You may not use this file except in
   9  * compliance with the License.  The rights granted to you under the
  10  * License may not be used to create, or enable the creation or
  11  * redistribution of, unlawful or unlicensed copies of an Apple operating
  12  * system, or to circumvent, violate, or enable the circumvention or
  13  * violation of, any terms of an Apple operating system software license
  14  * agreement.
  15  *
  16  * Please obtain a copy of the License at
  17  * http://www.opensource.apple.com/apsl/ and read it before using this
  18  * file.
  19  *
  20  * The Original Code and all software distributed under the License are
  21  * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
  22  * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
  23  * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
  24  * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
  25  * Please see the License for the specific language governing rights and
  26  * limitations under the License.
  27  *
  28  * @APPLE_LICENSE_OSREFERENCE_HEADER_END@
  29  */
  30 /* Copyright (c) 1995 NeXT Computer, Inc. All Rights Reserved */
  31 /*
  32  * Copyright (c) 1982, 1986, 1989, 1993
  33  *      The Regents of the University of California.  All rights reserved.
  34  *
  35  * Redistribution and use in source and binary forms, with or without
  36  * modification, are permitted provided that the following conditions
  37  * are met:
  38  * 1. Redistributions of source code must retain the above copyright
  39  *    notice, this list of conditions and the following disclaimer.
  40  * 2. Redistributions in binary form must reproduce the above copyright
  41  *    notice, this list of conditions and the following disclaimer in the
  42  *    documentation and/or other materials provided with the distribution.
  43  * 3. All advertising materials mentioning features or use of this software
  44  *    must display the following acknowledgement:
  45  *      This product includes software developed by the University of
  46  *      California, Berkeley and its contributors.
  47  * 4. Neither the name of the University nor the names of its contributors
  48  *    may be used to endorse or promote products derived from this software
  49  *    without specific prior written permission.
  50  *
  51  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  52  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  53  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  54  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  55  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  56  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  57  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  58  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  59  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  60  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  61  * SUCH DAMAGE.
  62  *
  63  *      @(#)ffs_subr.c  8.5 (Berkeley) 3/21/95
  64  */
  65
  66 #include <rev_endian_fs.h>
  67 #include <sys/param.h>
  68 #if REV_ENDIAN_FS
  69 #include <sys/mount_internal.h>
  70 #endif /* REV_ENDIAN_FS */
  71
  72 #ifndef KERNEL
  73 #include <ufs/ufs/dinode.h>
  74 #include <ufs/ffs/fs.h>
  75 #else
  76
  77 #include <sys/systm.h>
  78 #include <sys/vnode_internal.h>
  79 #include <sys/buf.h>
  80 #include <sys/quota.h>
  81 #include <ufs/ufs/quota.h>
  82 #include <ufs/ufs/inode.h>
  83 #include <ufs/ffs/fs.h>
  84 #include <ufs/ffs/ffs_extern.h>
  85 #if REV_ENDIAN_FS
  86 #include <ufs/ufs/ufs_byte_order.h>
  87 #endif /* REV_ENDIAN_FS */
  88
  89 /*
  90  * Return buffer with the contents of block "offset" from the beginning of
  91  * directory "ip".  If "res" is non-zero, fill it in with a pointer to the
  92  * remaining space in the directory.
  93  */
  94 __private_extern__
  95 int
  96 ffs_blkatoff(vnode_t vp, off_t offset, char **res, buf_t *bpp)
  97 {
  98         struct inode *ip;
  99         register struct fs *fs;
 100         struct buf *bp;
 101         ufs_daddr_t lbn;
 102         int bsize, error;
 103 #if REV_ENDIAN_FS
 104         struct mount *mp = vnode_mount(vp);
 105         int rev_endian=(mp->mnt_flag & MNT_REVEND);
 106 #endif /* REV_ENDIAN_FS */
 107
 108         ip = VTOI(vp);
 109         fs = ip->i_fs;
 110         lbn = lblkno(fs, offset);
 111         bsize = blksize(fs, ip, lbn);
 112
 113         *bpp = NULL;
 114         if (error = (int)buf_bread(vp, (daddr64_t)((unsigned)lbn), bsize, NOCRED, &bp)) {
 115                 buf_brelse(bp);
 116                 return (error);
 117         }
 118 #if     REV_ENDIAN_FS
 119         if (rev_endian)
 120                 byte_swap_dir_block_in((char *)buf_dataptr(bp), buf_count(bp));
 121 #endif  /* REV_ENDIAN_FS */
 122
 123         if (res)
 124                 *res = (char *)buf_dataptr(bp) + blkoff(fs, offset);
 125         *bpp = bp;
 126         return (0);
 127 }
 128 #endif
 129
 130 /*
 131  * Update the frsum fields to reflect addition or deletion
 132  * of some frags.
 133  */
 134 void
 135 ffs_fragacct(fs, fragmap, fraglist, cnt)
 136         struct fs *fs;
 137         int fragmap;
 138         int32_t fraglist[];
 139         int cnt;
 140 {
 141         int inblk;
 142         register int field, subfield;
 143         register int siz, pos;
 144
 145         inblk = (int)(fragtbl[fs->fs_frag][fragmap]) << 1;
 146         fragmap <<= 1;
 147         for (siz = 1; siz < fs->fs_frag; siz++) {
 148                 if ((inblk & (1 << (siz + (fs->fs_frag % NBBY)))) == 0)
 149                         continue;
 150                 field = around[siz];
 151                 subfield = inside[siz];
 152                 for (pos = siz; pos <= fs->fs_frag; pos++) {
 153                         if ((fragmap & field) == subfield) {
 154                                 fraglist[siz] += cnt;
 155                                 pos += siz;
 156                                 field <<= siz;
 157                                 subfield <<= siz;
 158                         }
 159                         field <<= 1;
 160                         subfield <<= 1;
 161                 }
 162         }
 163 }
 164
 165 /*
 166  * block operations
 167  *
 168  * check if a block is available
 169  */
 170 int
 171 ffs_isblock(fs, cp, h)
 172         struct fs *fs;
 173         unsigned char *cp;
 174         ufs_daddr_t h;
 175 {
 176         unsigned char mask;
 177
 178         switch ((int)fs->fs_frag) {
 179         case 8:
 180                 return (cp[h] == 0xff);
 181         case 4:
 182                 mask = 0x0f << ((h & 0x1) << 2);
 183                 return ((cp[h >> 1] & mask) == mask);
 184         case 2:
 185                 mask = 0x03 << ((h & 0x3) << 1);
 186                 return ((cp[h >> 2] & mask) == mask);
 187         case 1:
 188                 mask = 0x01 << (h & 0x7);
 189                 return ((cp[h >> 3] & mask) == mask);
 190         default:
 191                 panic("ffs_isblock");
 192         }
 193         /* NOTREACHED */
 194         return 0;
 195 }
 196
 197 /*
 198  * take a block out of the map
 199  */
 200 void
 201 ffs_clrblock(fs, cp, h)
 202         struct fs *fs;
 203         u_char *cp;
 204         ufs_daddr_t h;
 205 {
 206
 207         switch ((int)fs->fs_frag) {
 208         case 8:
 209                 cp[h] = 0;
 210                 return;
 211         case 4:
 212                 cp[h >> 1] &= ~(0x0f << ((h & 0x1) << 2));
 213                 return;
 214         case 2:
 215                 cp[h >> 2] &= ~(0x03 << ((h & 0x3) << 1));
 216                 return;
 217         case 1:
 218                 cp[h >> 3] &= ~(0x01 << (h & 0x7));
 219                 return;
 220         default:
 221                 panic("ffs_clrblock");
 222         }
 223 }
 224
 225 /*
 226  * put a block into the map
 227  */
 228 void
 229 ffs_setblock(fs, cp, h)
 230         struct fs *fs;
 231         unsigned char *cp;
 232         ufs_daddr_t h;
 233 {
 234
 235         switch ((int)fs->fs_frag) {
 236
 237         case 8:
 238                 cp[h] = 0xff;
 239                 return;
 240         case 4:
 241                 cp[h >> 1] |= (0x0f << ((h & 0x1) << 2));
 242                 return;
 243         case 2:
 244                 cp[h >> 2] |= (0x03 << ((h & 0x3) << 1));
 245                 return;
 246         case 1:
 247                 cp[h >> 3] |= (0x01 << (h & 0x7));
 248                 return;
 249         default:
 250                 panic("ffs_setblock");
 251         }
 252 }