951 lines
36 KiB
C
951 lines
36 KiB
C
/* $NetBSD: lfs.h,v 1.54 2003/03/02 04:34:30 perseant Exp $ */
|
|
|
|
/*-
|
|
* Copyright (c) 1999, 2000, 2001, 2002, 2003 The NetBSD Foundation, Inc.
|
|
* All rights reserved.
|
|
*
|
|
* This code is derived from software contributed to The NetBSD Foundation
|
|
* by Konrad E. Schroder <perseant@hhhh.org>.
|
|
*
|
|
* 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. All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* This product includes software developed by the NetBSD
|
|
* Foundation, Inc. and its contributors.
|
|
* 4. Neither the name of The NetBSD Foundation 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 NETBSD FOUNDATION, INC. 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 FOUNDATION 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.
|
|
*/
|
|
/*-
|
|
* Copyright (c) 1991, 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. All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* This product includes software developed by the University of
|
|
* California, Berkeley and its contributors.
|
|
* 4. 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.
|
|
*
|
|
* @(#)lfs.h 8.9 (Berkeley) 5/8/95
|
|
*/
|
|
|
|
#ifndef _UFS_LFS_LFS_H_
|
|
#define _UFS_LFS_LFS_H_
|
|
|
|
/*
|
|
* Compile-time options for LFS.
|
|
*/
|
|
#define LFS_IFIND_RETRIES 16
|
|
#define LFS_EAGAIN_FAIL /* markv fail with EAGAIN if ino is locked */
|
|
#define LFS_DEBUG_RFW /* print roll-forward debugging info */
|
|
#define LFS_NO_PAGEMOVE /* Use malloc/copy to write clusters */
|
|
#define LFS_AGGRESSIVE_SEGLOCK
|
|
#define LFS_LOGLENGTH 1024
|
|
|
|
/* #define DEBUG_LFS */ /* Intensive debugging of LFS subsystem */
|
|
|
|
#ifdef LFS_NO_PAGEMOVE
|
|
# define LFS_MALLOC_SUMMARY
|
|
#endif
|
|
|
|
/*
|
|
* Parameters and generic definitions
|
|
*/
|
|
#define BW_CLEAN 1
|
|
#define MIN_FREE_SEGS 2
|
|
#define LFS_MAX_ACTIVE 10
|
|
#ifndef LFS_ATIME_IFILE
|
|
# define LFS_ATIME_IFILE 0
|
|
#endif
|
|
/* Max block count for lfs_markv() */
|
|
#define LFS_MARKV_MAXBLKCNT 65536
|
|
|
|
/* Local definition for LFS's usage of PG_PAGER1 */
|
|
#define PG_DELWRI PG_PAGER1
|
|
|
|
/* Types for lfs_newbuf and lfs_malloc */
|
|
#define LFS_NB_UNKNOWN -1
|
|
#define LFS_NB_SUMMARY 0
|
|
#define LFS_NB_SBLOCK 1
|
|
#define LFS_NB_IBLOCK 2
|
|
#define LFS_NB_CLUSTER 3
|
|
#define LFS_NB_CLEAN 4
|
|
#define LFS_NB_COUNT 5 /* always last */
|
|
|
|
/* Number of reserved memory blocks of each type */
|
|
#define LFS_N_SUMMARIES 2
|
|
#define LFS_N_SBLOCKS 1 /* Always 1, to throttle superblock writes */
|
|
#define LFS_N_IBLOCKS 16 /* In theory ssize/bsize; in practice around 2 */
|
|
#define LFS_N_CLUSTERS 16 /* In theory ssize/MAXPHYS */
|
|
#define LFS_N_CLEAN 0
|
|
|
|
/* Total count of "large" (non-pool) types */
|
|
#define LFS_N_TOTAL (LFS_N_SUMMARIES + LFS_N_SBLOCKS + LFS_N_IBLOCKS + LFS_N_CLUSTERS + LFS_N_CLEAN)
|
|
|
|
/* Counts for pool types */
|
|
#define LFS_N_CL LFS_N_CLUSTERS
|
|
#define LFS_N_BPP 2
|
|
#define LFS_N_SEG 2
|
|
|
|
/* Structure to keep reserved blocks */
|
|
typedef struct lfs_res_blk {
|
|
void *p;
|
|
LIST_ENTRY(lfs_res_blk) res;
|
|
int size;
|
|
char inuse;
|
|
} res_t;
|
|
|
|
/*
|
|
* #define WRITE_THRESHHOLD ((nbuf >> 1) - 10)
|
|
* #define WAIT_THRESHHOLD (nbuf - (nbuf >> 2) - 10)
|
|
*/
|
|
#define LFS_MAX_BUFS ((nbuf >> 2) - 10)
|
|
#define LFS_WAIT_BUFS ((nbuf >> 1) - (nbuf >> 3) - 10)
|
|
/* These are new ... is LFS taking up too much memory in its buffers? */
|
|
#define LFS_MAX_BYTES (((bufpages >> 2) - 10) * NBPG)
|
|
#define LFS_WAIT_BYTES (((bufpages >> 1) - (bufpages >> 3) - 10) * NBPG)
|
|
#define LFS_MAX_DIROP ((desiredvnodes >> 2) + (desiredvnodes >> 3))
|
|
#define LFS_BUFWAIT 2
|
|
|
|
#define LFS_MAX_PAGES \
|
|
(((uvmexp.active + uvmexp.inactive + uvmexp.free) * uvmexp.filemin) >> 8)
|
|
#define LFS_WAIT_PAGES \
|
|
(((uvmexp.active + uvmexp.inactive + uvmexp.free) * uvmexp.filemax) >> 8)
|
|
|
|
#define LFS_IS_MALLOC_BUF(bp) (((bp)->b_flags & B_CALL) && \
|
|
((bp)->b_iodone == lfs_callback || (bp)->b_iodone == lfs_fakebuf_iodone))
|
|
|
|
#define LFS_LOCK_BUF(bp) do { \
|
|
if (((bp)->b_flags & (B_LOCKED | B_CALL)) == 0) { \
|
|
++locked_queue_count; \
|
|
locked_queue_bytes += bp->b_bufsize; \
|
|
} \
|
|
(bp)->b_flags |= B_LOCKED; \
|
|
} while (0)
|
|
|
|
#define LFS_UNLOCK_BUF(bp) do { \
|
|
if (((bp)->b_flags & (B_LOCKED | B_CALL)) == B_LOCKED) { \
|
|
--locked_queue_count; \
|
|
locked_queue_bytes -= bp->b_bufsize; \
|
|
if (locked_queue_count < LFS_WAIT_BUFS && \
|
|
locked_queue_bytes < LFS_WAIT_BYTES) \
|
|
wakeup(&locked_queue_count); \
|
|
} \
|
|
(bp)->b_flags &= ~B_LOCKED; \
|
|
} while (0)
|
|
|
|
#ifdef DEBUG_LOCKED_LIST
|
|
# define LFS_DEBUG_COUNTLOCKED(m) do { \
|
|
int _s; \
|
|
extern int locked_queue_count; \
|
|
extern long locked_queue_bytes; \
|
|
_s = splbio(); \
|
|
lfs_countlocked(&locked_queue_count, &locked_queue_bytes, (m)); \
|
|
splx(_s); \
|
|
wakeup(&locked_queue_count); \
|
|
} while (0)
|
|
#else
|
|
# define LFS_DEBUG_COUNTLOCKED(m)
|
|
#endif
|
|
|
|
/* For convenience */
|
|
#define IN_ALLMOD (IN_MODIFIED|IN_ACCESS|IN_CHANGE|IN_UPDATE|IN_ACCESSED|IN_CLEANING)
|
|
|
|
#define LFS_SET_UINO(ip, flags) do { \
|
|
if (((flags) & IN_ACCESSED) && !((ip)->i_flag & IN_ACCESSED)) \
|
|
++(ip)->i_lfs->lfs_uinodes; \
|
|
if (((flags) & IN_CLEANING) && !((ip)->i_flag & IN_CLEANING)) \
|
|
++(ip)->i_lfs->lfs_uinodes; \
|
|
if (((flags) & IN_MODIFIED) && !((ip)->i_flag & IN_MODIFIED)) \
|
|
++(ip)->i_lfs->lfs_uinodes; \
|
|
(ip)->i_flag |= (flags); \
|
|
} while (0)
|
|
|
|
#define LFS_CLR_UINO(ip, flags) do { \
|
|
if (((flags) & IN_ACCESSED) && ((ip)->i_flag & IN_ACCESSED)) \
|
|
--(ip)->i_lfs->lfs_uinodes; \
|
|
if (((flags) & IN_CLEANING) && ((ip)->i_flag & IN_CLEANING)) \
|
|
--(ip)->i_lfs->lfs_uinodes; \
|
|
if (((flags) & IN_MODIFIED) && ((ip)->i_flag & IN_MODIFIED)) \
|
|
--(ip)->i_lfs->lfs_uinodes; \
|
|
(ip)->i_flag &= ~(flags); \
|
|
if ((ip)->i_lfs->lfs_uinodes < 0) { \
|
|
panic("lfs_uinodes < 0"); \
|
|
} \
|
|
} while (0)
|
|
|
|
#ifdef DEBUG
|
|
struct lfs_log_entry {
|
|
char *op;
|
|
char *file;
|
|
int line;
|
|
daddr_t block;
|
|
unsigned long flags;
|
|
};
|
|
extern int lfs_lognum;
|
|
extern struct lfs_log_entry lfs_log[LFS_LOGLENGTH];
|
|
# define LFS_BWRITE_LOG(bp) lfs_bwrite_log((bp), __FILE__, __LINE__)
|
|
# define LFS_ENTER_LOG(theop, thefile, theline, lbn, theflags) do { \
|
|
int _s; \
|
|
\
|
|
_s = splbio(); \
|
|
lfs_log[lfs_lognum].op = theop; \
|
|
lfs_log[lfs_lognum].file = thefile; \
|
|
lfs_log[lfs_lognum].line = (theline); \
|
|
lfs_log[lfs_lognum].block = (lbn); \
|
|
lfs_log[lfs_lognum].flags = (theflags); \
|
|
lfs_lognum = (lfs_lognum + 1) % LFS_LOGLENGTH; \
|
|
splx(_s); \
|
|
} while (0)
|
|
|
|
# define LFS_BCLEAN_LOG(fs, bp) do { \
|
|
if ((bp)->b_vp == (fs)->lfs_ivnode) \
|
|
LFS_ENTER_LOG("clear", __FILE__, __LINE__, bp->b_lblkno, bp->b_flags); \
|
|
} while (0)
|
|
#else
|
|
# define LFS_BCLEAN_LOG(fs, bp)
|
|
# define LFS_BWRITE_LOG(bp) VOP_BWRITE((bp))
|
|
#endif
|
|
|
|
#define LFS_ITIMES(ip, acc, mod, cre) do { \
|
|
struct lfs *_fs = (ip)->i_lfs; \
|
|
\
|
|
if ((ip)->i_flag & IN_ACCESS) { \
|
|
(ip)->i_ffs_atime = (acc)->tv_sec; \
|
|
(ip)->i_ffs_atimensec = (acc)->tv_nsec; \
|
|
if ((ip)->i_lfs->lfs_version > 1) { \
|
|
struct buf *ibp; \
|
|
IFILE *ifp; \
|
|
\
|
|
LFS_IENTRY(ifp, ip->i_lfs, ip->i_number, ibp); \
|
|
ifp->if_atime_sec = (acc)->tv_sec; \
|
|
ifp->if_atime_nsec = (acc)->tv_nsec; \
|
|
LFS_BWRITE_LOG(ibp); \
|
|
_fs->lfs_flags |= LFS_IFDIRTY; \
|
|
} else { \
|
|
LFS_SET_UINO(ip, IN_ACCESSED); \
|
|
} \
|
|
} \
|
|
if ((ip)->i_flag & (IN_CHANGE | IN_UPDATE)) { \
|
|
if ((ip)->i_flag & IN_UPDATE) { \
|
|
(ip)->i_ffs_mtime = (mod)->tv_sec; \
|
|
(ip)->i_ffs_mtimensec = (mod)->tv_nsec; \
|
|
(ip)->i_modrev++; \
|
|
} \
|
|
if ((ip)->i_flag & IN_CHANGE) { \
|
|
(ip)->i_ffs_ctime = (cre)->tv_sec; \
|
|
(ip)->i_ffs_ctimensec = (cre)->tv_nsec; \
|
|
} \
|
|
LFS_SET_UINO(ip, IN_MODIFIED); \
|
|
} \
|
|
(ip)->i_flag &= ~(IN_ACCESS | IN_CHANGE | IN_UPDATE); \
|
|
} while (0)
|
|
|
|
/*
|
|
* How to find out whether a vnode had dirty buffers or pages,
|
|
* to know whether it needs to retain IN_MODIFIED after a write.
|
|
*/
|
|
#ifdef LFS_UBC
|
|
int lfs_checkifempty(struct vnode *);
|
|
# define VPISEMPTY(vp) lfs_checkifempty(vp)
|
|
#else
|
|
# define VPISEMPTY(vp) ((vp)->v_dirtyblkhd.lh_first == NULL)
|
|
#endif
|
|
/*
|
|
* WRITEINPROG does not use VPISEMPTY because any dirty pages will
|
|
* have been given buffer headers, if they are "in progress".
|
|
*/
|
|
#define WRITEINPROG(vp) ((vp)->v_dirtyblkhd.lh_first && !(VTOI(vp)->i_flag & \
|
|
(IN_MODIFIED | IN_ACCESSED | IN_CLEANING)))
|
|
|
|
/* Here begins the berkeley code */
|
|
|
|
#define LFS_LABELPAD 8192 /* LFS label size */
|
|
#define LFS_SBPAD 8192 /* LFS superblock size */
|
|
|
|
/* On-disk and in-memory checkpoint segment usage structure. */
|
|
typedef struct segusage SEGUSE;
|
|
struct segusage {
|
|
u_int32_t su_nbytes; /* 0: number of live bytes */
|
|
u_int32_t su_olastmod; /* 4: SEGUSE last modified timestamp */
|
|
u_int16_t su_nsums; /* 8: number of summaries in segment */
|
|
u_int16_t su_ninos; /* 10: number of inode blocks in seg */
|
|
|
|
#define SEGUSE_ACTIVE 0x01 /* segment currently being written */
|
|
#define SEGUSE_DIRTY 0x02 /* segment has data in it */
|
|
#define SEGUSE_SUPERBLOCK 0x04 /* segment contains a superblock */
|
|
#define SEGUSE_ERROR 0x08 /* cleaner: do not clean segment */
|
|
#define SEGUSE_EMPTY 0x10 /* segment is empty */
|
|
u_int32_t su_flags; /* 12: segment flags */
|
|
u_int64_t su_lastmod; /* 16: last modified timestamp */
|
|
};
|
|
|
|
typedef struct segusage_v1 SEGUSE_V1;
|
|
struct segusage_v1 {
|
|
u_int32_t su_nbytes; /* 0: number of live bytes */
|
|
u_int32_t su_lastmod; /* 4: SEGUSE last modified timestamp */
|
|
u_int16_t su_nsums; /* 8: number of summaries in segment */
|
|
u_int16_t su_ninos; /* 10: number of inode blocks in seg */
|
|
u_int32_t su_flags; /* 12: segment flags */
|
|
};
|
|
|
|
#define SEGUPB(fs) (fs->lfs_sepb)
|
|
#define SEGTABSIZE_SU(fs) \
|
|
(((fs)->lfs_nseg + SEGUPB(fs) - 1) / (fs)->lfs_sepb)
|
|
|
|
/* On-disk file information. One per file with data blocks in the segment. */
|
|
typedef struct finfo FINFO;
|
|
struct finfo {
|
|
u_int32_t fi_nblocks; /* number of blocks */
|
|
u_int32_t fi_version; /* version number */
|
|
u_int32_t fi_ino; /* inode number */
|
|
u_int32_t fi_lastlength; /* length of last block in array */
|
|
int32_t fi_blocks[1]; /* array of logical block numbers */
|
|
};
|
|
|
|
/* sizeof FINFO except fi_blocks */
|
|
#define FINFOSIZE (sizeof(FINFO) - sizeof(int32_t))
|
|
|
|
/* On-disk super block. */
|
|
struct dlfs {
|
|
#define LFS_MAGIC 0x070162
|
|
u_int32_t dlfs_magic; /* 0: magic number */
|
|
#define LFS_VERSION 2
|
|
u_int32_t dlfs_version; /* 4: version number */
|
|
|
|
u_int32_t dlfs_size; /* 8: number of blocks in fs (v1) */
|
|
/* number of frags in fs (v2) */
|
|
u_int32_t dlfs_ssize; /* 12: number of blocks per segment (v1) */
|
|
/* number of bytes per segment (v2) */
|
|
u_int32_t dlfs_dsize; /* 16: number of disk blocks in fs */
|
|
u_int32_t dlfs_bsize; /* 20: file system block size */
|
|
u_int32_t dlfs_fsize; /* 24: size of frag blocks in fs */
|
|
u_int32_t dlfs_frag; /* 28: number of frags in a block in fs */
|
|
|
|
/* Checkpoint region. */
|
|
u_int32_t dlfs_freehd; /* 32: start of the free list */
|
|
u_int32_t dlfs_bfree; /* 36: number of free disk blocks */
|
|
u_int32_t dlfs_nfiles; /* 40: number of allocated inodes */
|
|
int32_t dlfs_avail; /* 44: blocks available for writing */
|
|
int32_t dlfs_uinodes; /* 48: inodes in cache not yet on disk */
|
|
int32_t dlfs_idaddr; /* 52: inode file disk address */
|
|
u_int32_t dlfs_ifile; /* 56: inode file inode number */
|
|
int32_t dlfs_lastseg; /* 60: address of last segment written */
|
|
int32_t dlfs_nextseg; /* 64: address of next segment to write */
|
|
int32_t dlfs_curseg; /* 68: current segment being written */
|
|
int32_t dlfs_offset; /* 72: offset in curseg for next partial */
|
|
int32_t dlfs_lastpseg; /* 76: address of last partial written */
|
|
u_int32_t dlfs_inopf; /* 80: v1: time stamp; v2: inodes per frag */
|
|
#define dlfs_otstamp dlfs_inopf
|
|
|
|
/* These are configuration parameters. */
|
|
u_int32_t dlfs_minfree; /* 84: minimum percentage of free blocks */
|
|
|
|
/* These fields can be computed from the others. */
|
|
u_int64_t dlfs_maxfilesize; /* 88: maximum representable file size */
|
|
u_int32_t dlfs_fsbpseg; /* 96: fsb per segment */
|
|
u_int32_t dlfs_inopb; /* 100: inodes per block */
|
|
u_int32_t dlfs_ifpb; /* 104: IFILE entries per block */
|
|
u_int32_t dlfs_sepb; /* 108: SEGUSE entries per block */
|
|
u_int32_t dlfs_nindir; /* 112: indirect pointers per block */
|
|
u_int32_t dlfs_nseg; /* 116: number of segments */
|
|
u_int32_t dlfs_nspf; /* 120: number of sectors per fragment */
|
|
u_int32_t dlfs_cleansz; /* 124: cleaner info size in blocks */
|
|
u_int32_t dlfs_segtabsz; /* 128: segment table size in blocks */
|
|
u_int32_t dlfs_segmask; /* 132: calculate offset within a segment */
|
|
u_int32_t dlfs_segshift; /* 136: fast mult/div for segments */
|
|
u_int32_t dlfs_bshift; /* 140: calc block number from file offset */
|
|
u_int32_t dlfs_ffshift; /* 144: fast mult/div for frag from file */
|
|
u_int32_t dlfs_fbshift; /* 148: fast mult/div for frag from block */
|
|
u_int64_t dlfs_bmask; /* 152: calc block offset from file offset */
|
|
u_int64_t dlfs_ffmask; /* 160: calc frag offset from file offset */
|
|
u_int64_t dlfs_fbmask; /* 168: calc frag offset from block offset */
|
|
u_int32_t dlfs_blktodb; /* 176: blktodb and dbtoblk shift constant */
|
|
u_int32_t dlfs_sushift; /* 180: fast mult/div for segusage table */
|
|
|
|
int32_t dlfs_maxsymlinklen; /* 184: max length of an internal symlink */
|
|
#define LFS_MIN_SBINTERVAL 5 /* minimum superblock segment spacing */
|
|
#define LFS_MAXNUMSB 10 /* 188: superblock disk offsets */
|
|
int32_t dlfs_sboffs[LFS_MAXNUMSB];
|
|
|
|
u_int32_t dlfs_nclean; /* 228: Number of clean segments */
|
|
u_char dlfs_fsmnt[MNAMELEN]; /* 232: name mounted on */
|
|
#define LFS_PF_CLEAN 0x1
|
|
u_int16_t dlfs_pflags; /* 322: file system persistent flags */
|
|
int32_t dlfs_dmeta; /* 324: total number of dirty summaries */
|
|
u_int32_t dlfs_minfreeseg; /* 328: segs reserved for cleaner */
|
|
u_int32_t dlfs_sumsize; /* 332: size of summary blocks */
|
|
u_int64_t dlfs_serial; /* 336: serial number */
|
|
u_int32_t dlfs_ibsize; /* 344: size of inode blocks */
|
|
int32_t dlfs_start; /* 348: start of segment 0 */
|
|
u_int64_t dlfs_tstamp; /* 352: time stamp */
|
|
#define LFS_44INODEFMT 0
|
|
#define LFS_MAXINODEFMT 0
|
|
u_int32_t dlfs_inodefmt; /* 360: inode format version */
|
|
u_int32_t dlfs_interleave; /* 364: segment interleave */
|
|
u_int32_t dlfs_ident; /* 368: per-fs identifier */
|
|
u_int32_t dlfs_fsbtodb; /* 372: fsbtodb abd dbtodsb shift constant */
|
|
int8_t dlfs_pad[132]; /* 376: round to 512 bytes */
|
|
/* Checksum -- last valid disk field. */
|
|
u_int32_t dlfs_cksum; /* 508: checksum for superblock checking */
|
|
};
|
|
|
|
/* In-memory super block. */
|
|
struct lfs {
|
|
struct dlfs lfs_dlfs; /* on-disk parameters */
|
|
#define lfs_magic lfs_dlfs.dlfs_magic
|
|
#define lfs_version lfs_dlfs.dlfs_version
|
|
#define lfs_size lfs_dlfs.dlfs_size
|
|
#define lfs_ssize lfs_dlfs.dlfs_ssize
|
|
#define lfs_dsize lfs_dlfs.dlfs_dsize
|
|
#define lfs_bsize lfs_dlfs.dlfs_bsize
|
|
#define lfs_fsize lfs_dlfs.dlfs_fsize
|
|
#define lfs_frag lfs_dlfs.dlfs_frag
|
|
#define lfs_freehd lfs_dlfs.dlfs_freehd
|
|
#define lfs_bfree lfs_dlfs.dlfs_bfree
|
|
#define lfs_nfiles lfs_dlfs.dlfs_nfiles
|
|
#define lfs_avail lfs_dlfs.dlfs_avail
|
|
#define lfs_uinodes lfs_dlfs.dlfs_uinodes
|
|
#define lfs_idaddr lfs_dlfs.dlfs_idaddr
|
|
#define lfs_ifile lfs_dlfs.dlfs_ifile
|
|
#define lfs_lastseg lfs_dlfs.dlfs_lastseg
|
|
#define lfs_nextseg lfs_dlfs.dlfs_nextseg
|
|
#define lfs_curseg lfs_dlfs.dlfs_curseg
|
|
#define lfs_offset lfs_dlfs.dlfs_offset
|
|
#define lfs_lastpseg lfs_dlfs.dlfs_lastpseg
|
|
#define lfs_otstamp lfs_dlfs.dlfs_inopf
|
|
#define lfs_inopf lfs_dlfs.dlfs_inopf
|
|
#define lfs_minfree lfs_dlfs.dlfs_minfree
|
|
#define lfs_maxfilesize lfs_dlfs.dlfs_maxfilesize
|
|
#define lfs_fsbpseg lfs_dlfs.dlfs_fsbpseg
|
|
#define lfs_inopb lfs_dlfs.dlfs_inopb
|
|
#define lfs_ifpb lfs_dlfs.dlfs_ifpb
|
|
#define lfs_sepb lfs_dlfs.dlfs_sepb
|
|
#define lfs_nindir lfs_dlfs.dlfs_nindir
|
|
#define lfs_nseg lfs_dlfs.dlfs_nseg
|
|
#define lfs_nspf lfs_dlfs.dlfs_nspf
|
|
#define lfs_cleansz lfs_dlfs.dlfs_cleansz
|
|
#define lfs_segtabsz lfs_dlfs.dlfs_segtabsz
|
|
#define lfs_segmask lfs_dlfs.dlfs_segmask
|
|
#define lfs_segshift lfs_dlfs.dlfs_segshift
|
|
#define lfs_bmask lfs_dlfs.dlfs_bmask
|
|
#define lfs_bshift lfs_dlfs.dlfs_bshift
|
|
#define lfs_ffmask lfs_dlfs.dlfs_ffmask
|
|
#define lfs_ffshift lfs_dlfs.dlfs_ffshift
|
|
#define lfs_fbmask lfs_dlfs.dlfs_fbmask
|
|
#define lfs_fbshift lfs_dlfs.dlfs_fbshift
|
|
#define lfs_blktodb lfs_dlfs.dlfs_blktodb
|
|
#define lfs_fsbtodb lfs_dlfs.dlfs_fsbtodb
|
|
#define lfs_sushift lfs_dlfs.dlfs_sushift
|
|
#define lfs_maxsymlinklen lfs_dlfs.dlfs_maxsymlinklen
|
|
#define lfs_sboffs lfs_dlfs.dlfs_sboffs
|
|
#define lfs_cksum lfs_dlfs.dlfs_cksum
|
|
#define lfs_pflags lfs_dlfs.dlfs_pflags
|
|
#define lfs_fsmnt lfs_dlfs.dlfs_fsmnt
|
|
#define lfs_nclean lfs_dlfs.dlfs_nclean
|
|
#define lfs_dmeta lfs_dlfs.dlfs_dmeta
|
|
#define lfs_minfreeseg lfs_dlfs.dlfs_minfreeseg
|
|
#define lfs_sumsize lfs_dlfs.dlfs_sumsize
|
|
#define lfs_serial lfs_dlfs.dlfs_serial
|
|
#define lfs_ibsize lfs_dlfs.dlfs_ibsize
|
|
#define lfs_start lfs_dlfs.dlfs_start
|
|
#define lfs_tstamp lfs_dlfs.dlfs_tstamp
|
|
#define lfs_inodefmt lfs_dlfs.dlfs_inodefmt
|
|
#define lfs_interleave lfs_dlfs.dlfs_interleave
|
|
#define lfs_ident lfs_dlfs.dlfs_ident
|
|
|
|
/* These fields are set at mount time and are meaningless on disk. */
|
|
struct segment *lfs_sp; /* current segment being written */
|
|
struct vnode *lfs_ivnode; /* vnode for the ifile */
|
|
u_int32_t lfs_seglock; /* single-thread the segment writer */
|
|
pid_t lfs_lockpid; /* pid of lock holder */
|
|
u_int32_t lfs_iocount; /* number of ios pending */
|
|
u_int32_t lfs_writer; /* don't allow any dirops to start */
|
|
u_int32_t lfs_dirops; /* count of active directory ops */
|
|
u_int32_t lfs_doifile; /* Write ifile blocks on next write */
|
|
u_int32_t lfs_nactive; /* Number of segments since last ckp */
|
|
int8_t lfs_fmod; /* super block modified flag */
|
|
int8_t lfs_ronly; /* mounted read-only flag */
|
|
#define LFS_NOTYET 0x01
|
|
#define LFS_IFDIRTY 0x02
|
|
#define LFS_WARNED 0x04
|
|
int8_t lfs_flags; /* currently unused flag */
|
|
u_int16_t lfs_activesb; /* toggle between superblocks */
|
|
daddr_t lfs_sbactive; /* disk address of in-progress sb write */
|
|
struct vnode *lfs_flushvp; /* vnode being flushed */
|
|
struct vnode *lfs_unlockvp; /* being inactivated in lfs_segunlock */
|
|
u_int32_t lfs_diropwait; /* # procs waiting on dirop flush */
|
|
size_t lfs_devbsize; /* Device block size */
|
|
size_t lfs_devbshift; /* Device block shift */
|
|
struct lock lfs_fraglock;
|
|
pid_t lfs_rfpid; /* Process ID of roll-forward agent */
|
|
int lfs_nadirop; /* number of active dirop nodes */
|
|
long lfs_ravail; /* blocks pre-reserved for writing */
|
|
res_t *lfs_resblk; /* Reserved memory for pageout */
|
|
TAILQ_HEAD(, inode) lfs_dchainhd; /* dirop vnodes */
|
|
TAILQ_HEAD(, inode) lfs_pchainhd; /* paging vnodes */
|
|
#define LFS_RESHASH_WIDTH 17
|
|
LIST_HEAD(, lfs_res_blk) lfs_reshash[LFS_RESHASH_WIDTH];
|
|
int lfs_pdflush; /* pagedaemon wants us to flush */
|
|
u_int32_t **lfs_suflags; /* Segment use flags */
|
|
#ifdef _KERNEL
|
|
struct pool lfs_clpool; /* Pool for struct lfs_cluster */
|
|
struct pool lfs_bpppool; /* Pool for bpp */
|
|
struct pool lfs_segpool; /* Pool for struct segment */
|
|
#endif /* KERNEL */
|
|
};
|
|
|
|
/*
|
|
* Inode 0: out-of-band inode number
|
|
* Inode 1: IFILE inode number
|
|
* Inode 2: root inode
|
|
* Inode 3: lost+found inode number
|
|
*/
|
|
#define LFS_UNUSED_INUM 0 /* out of band inode number */
|
|
#define LFS_IFILE_INUM 1 /* IFILE inode number */
|
|
#define LOSTFOUNDINO 3 /* lost+found inode number */
|
|
#define LFS_FIRST_INUM 4 /* first free inode number */
|
|
|
|
/* Address calculations for metadata located in the inode */
|
|
#define S_INDIR(fs) -NDADDR
|
|
#define D_INDIR(fs) (S_INDIR(fs) - NINDIR(fs) - 1)
|
|
#define T_INDIR(fs) (D_INDIR(fs) - NINDIR(fs) * NINDIR(fs) - 1)
|
|
|
|
/* Unassigned disk addresses. */
|
|
#define UNASSIGNED -1
|
|
#define UNWRITTEN -2
|
|
|
|
/* Unused logical block number */
|
|
#define LFS_UNUSED_LBN -1
|
|
|
|
typedef struct ifile IFILE;
|
|
struct ifile {
|
|
u_int32_t if_version; /* inode version number */
|
|
#define LFS_UNUSED_DADDR 0 /* out-of-band daddr */
|
|
int32_t if_daddr; /* inode disk address */
|
|
ino_t if_nextfree; /* next-unallocated inode */
|
|
/* XXX - when inode format changes, this changes too */
|
|
u_int32_t if_atime_sec; /* Last access time, seconds */
|
|
u_int32_t if_atime_nsec; /* and nanoseconds */
|
|
};
|
|
|
|
typedef struct ifile_v1 IFILE_V1;
|
|
struct ifile_v1 {
|
|
u_int32_t if_version; /* inode version number */
|
|
int32_t if_daddr; /* inode disk address */
|
|
ino_t if_nextfree; /* next-unallocated inode */
|
|
#if LFS_ATIME_IFILE
|
|
struct timespec if_atime; /* Last access time */
|
|
#endif
|
|
};
|
|
|
|
/*
|
|
* Cleaner information structure. This resides in the ifile and is used
|
|
* to pass information between the cleaner and the kernel.
|
|
*/
|
|
typedef struct _cleanerinfo {
|
|
u_int32_t clean; /* number of clean segments */
|
|
u_int32_t dirty; /* number of dirty segments */
|
|
u_int32_t bfree; /* disk blocks free */
|
|
int32_t avail; /* disk blocks available */
|
|
u_int32_t free_head; /* head of the inode free list */
|
|
u_int32_t free_tail; /* tail of the inode free list */
|
|
} CLEANERINFO;
|
|
|
|
#define CLEANSIZE_SU(fs) \
|
|
((sizeof(CLEANERINFO) + (fs)->lfs_bsize - 1) >> (fs)->lfs_bshift)
|
|
|
|
/*
|
|
* All summary blocks are the same size, so we can always read a summary
|
|
* block easily from a segment.
|
|
*/
|
|
#define LFS_V1_SUMMARY_SIZE 512
|
|
#define LFS_DFL_SUMMARY_SIZE 512
|
|
|
|
/* On-disk segment summary information */
|
|
typedef struct segsum_v1 SEGSUM_V1;
|
|
struct segsum_v1 {
|
|
u_int32_t ss_sumsum; /* 0: check sum of summary block */
|
|
u_int32_t ss_datasum; /* 4: check sum of data */
|
|
u_int32_t ss_magic; /* 8: segment summary magic number */
|
|
#define SS_MAGIC 0x061561
|
|
int32_t ss_next; /* 12: next segment */
|
|
u_int32_t ss_create; /* 16: creation time stamp */
|
|
u_int16_t ss_nfinfo; /* 20: number of file info structures */
|
|
u_int16_t ss_ninos; /* 22: number of inodes in summary */
|
|
|
|
#define SS_DIROP 0x01 /* segment begins a dirop */
|
|
#define SS_CONT 0x02 /* more partials to finish this write*/
|
|
u_int16_t ss_flags; /* 24: used for directory operations */
|
|
u_int16_t ss_pad; /* 26: extra space */
|
|
/* FINFO's and inode daddr's... */
|
|
};
|
|
|
|
typedef struct segsum SEGSUM;
|
|
struct segsum {
|
|
u_int32_t ss_sumsum; /* 0: check sum of summary block */
|
|
u_int32_t ss_datasum; /* 4: check sum of data */
|
|
u_int32_t ss_magic; /* 8: segment summary magic number */
|
|
int32_t ss_next; /* 12: next segment */
|
|
u_int32_t ss_ident; /* 16: roll-forward fsid */
|
|
#define ss_ocreate ss_ident /* ident is where create was in v1 */
|
|
u_int16_t ss_nfinfo; /* 20: number of file info structures */
|
|
u_int16_t ss_ninos; /* 22: number of inodes in summary */
|
|
u_int16_t ss_flags; /* 24: used for directory operations */
|
|
u_int8_t ss_pad[6]; /* 26: extra space */
|
|
u_int64_t ss_serial; /* 32: serial number */
|
|
u_int64_t ss_create; /* 40: time stamp */
|
|
/* FINFO's and inode daddr's... */
|
|
};
|
|
|
|
#define SEGSUM_SIZE(fs) ((fs)->lfs_version == 1 ? sizeof(SEGSUM_V1) : sizeof(SEGSUM))
|
|
|
|
/* NINDIR is the number of indirects in a file system block. */
|
|
#define NINDIR(fs) ((fs)->lfs_nindir)
|
|
|
|
/* INOPB is the number of inodes in a secondary storage block. */
|
|
#define INOPB(fs) ((fs)->lfs_inopb)
|
|
/* INOPF is the number of inodes in a fragment. */
|
|
#define INOPF(fs) ((fs)->lfs_inopf)
|
|
|
|
#define blksize(fs, ip, lbn) \
|
|
(((lbn) >= NDADDR || (ip)->i_ffs_size >= ((lbn) + 1) << (fs)->lfs_bshift) \
|
|
? (fs)->lfs_bsize \
|
|
: (fragroundup(fs, blkoff(fs, (ip)->i_ffs_size))))
|
|
#define blkoff(fs, loc) ((int)((loc) & (fs)->lfs_bmask))
|
|
#define fragoff(fs, loc) /* calculates (loc % fs->lfs_fsize) */ \
|
|
((int)((loc) & (fs)->lfs_ffmask))
|
|
#define fsbtodb(fs, b) ((b) << (fs)->lfs_fsbtodb)
|
|
#define dbtofsb(fs, b) ((b) >> (fs)->lfs_fsbtodb)
|
|
#define fragstodb(fs, b) ((b) << ((fs)->lfs_blktodb - (fs)->lfs_fbshift))
|
|
#define dbtofrags(fs, b) ((b) >> ((fs)->lfs_blktodb - (fs)->lfs_fbshift))
|
|
#define lblkno(fs, loc) ((loc) >> (fs)->lfs_bshift)
|
|
#define lblktosize(fs, blk) ((blk) << (fs)->lfs_bshift)
|
|
/* Same as above, but named like dbtob(), btodb() */
|
|
#define fsbtob(fs, b) ((b) << ((fs)->lfs_bshift - \
|
|
(fs)->lfs_blktodb + (fs)->lfs_fsbtodb))
|
|
#define btofsb(fs, b) ((b) >> ((fs)->lfs_bshift - \
|
|
(fs)->lfs_blktodb + (fs)->lfs_fsbtodb))
|
|
#define fsbtofrags(fs, b) ((b) >> ((fs)->lfs_blktodb - (fs)->lfs_fbshift - \
|
|
(fs)->lfs_fsbtodb))
|
|
#define fragstofsb(fs, b) ((b) << ((fs)->lfs_blktodb - (fs)->lfs_fbshift - \
|
|
(fs)->lfs_fsbtodb))
|
|
#define btofrags(fs, b) ((b) >> (fs)->lfs_ffshift)
|
|
#define numfrags(fs, loc) /* calculates (loc / fs->lfs_fsize) */ \
|
|
((loc) >> (fs)->lfs_ffshift)
|
|
#define blkroundup(fs, size) /* calculates roundup(size, fs->lfs_bsize) */ \
|
|
((off_t)(((size) + (fs)->lfs_bmask) & (~(fs)->lfs_bmask)))
|
|
#define fragroundup(fs, size) /* calculates roundup(size, fs->lfs_fsize) */ \
|
|
((off_t)(((size) + (fs)->lfs_ffmask) & (~(fs)->lfs_ffmask)))
|
|
#define fragstoblks(fs, frags) /* calculates (frags / fs->lfs_frag) */ \
|
|
((frags) >> (fs)->lfs_fbshift)
|
|
#define blkstofrags(fs, blks) /* calculates (blks * fs->lfs_frag) */ \
|
|
((blks) << (fs)->lfs_fbshift)
|
|
#define fragnum(fs, fsb) /* calculates (fsb % fs->lfs_frag) */ \
|
|
((fsb) & ((fs)->lfs_frag - 1))
|
|
#define blknum(fs, fsb) /* calculates rounddown(fsb, fs->lfs_frag) */ \
|
|
((fsb) &~ ((fs)->lfs_frag - 1))
|
|
#define dblksize(fs, dip, lbn) \
|
|
(((lbn) >= NDADDR || (dip)->di_size >= ((lbn) + 1) << (fs)->lfs_bshift)\
|
|
? (fs)->lfs_bsize \
|
|
: (fragroundup(fs, blkoff(fs, (dip)->di_size))))
|
|
|
|
#define segtod(fs, seg) (((fs)->lfs_version == 1 ? \
|
|
(fs)->lfs_ssize << (fs)->lfs_blktodb : \
|
|
btofsb((fs), (fs)->lfs_ssize)) * (seg))
|
|
#define dtosn(fs, daddr) /* block address to segment number */ \
|
|
((uint32_t)(((daddr) - (fs)->lfs_start) / segtod((fs), 1)))
|
|
#define sntod(fs, sn) /* segment number to disk address */ \
|
|
((daddr_t)(segtod((fs), (sn)) + (fs)->lfs_start))
|
|
|
|
/* Read in the block with the cleaner info from the ifile. */
|
|
#define LFS_CLEANERINFO(CP, F, BP) do { \
|
|
VTOI((F)->lfs_ivnode)->i_flag |= IN_ACCESS; \
|
|
if (bread((F)->lfs_ivnode, \
|
|
(daddr_t)0, (F)->lfs_bsize, NOCRED, &(BP))) \
|
|
panic("lfs: ifile read"); \
|
|
(CP) = (CLEANERINFO *)(BP)->b_data; \
|
|
} while(0)
|
|
|
|
/* Synchronize the Ifile cleaner info with current avail and bfree */
|
|
#define LFS_SYNC_CLEANERINFO(cip, fs, bp, w) do { \
|
|
if ((w) || (cip)->bfree != (fs)->lfs_bfree || \
|
|
(cip)->avail != (fs)->lfs_avail - (fs)->lfs_ravail) { \
|
|
(cip)->bfree = (fs)->lfs_bfree; \
|
|
(cip)->avail = (fs)->lfs_avail - (fs)->lfs_ravail; \
|
|
if (((bp)->b_flags & B_GATHERED) == 0) \
|
|
(fs)->lfs_flags |= LFS_IFDIRTY; \
|
|
(void) LFS_BWRITE_LOG(bp); /* Ifile */ \
|
|
} else \
|
|
brelse(bp); \
|
|
} while (0)
|
|
|
|
#define LFS_GET_HEADFREE(FS, CIP, BP, FREEP) do { \
|
|
if ((FS)->lfs_version > 1) { \
|
|
LFS_CLEANERINFO((CIP), (FS), (BP)); \
|
|
(FS)->lfs_freehd = (CIP)->free_head; \
|
|
brelse(BP); \
|
|
} \
|
|
*(FREEP) = (FS)->lfs_freehd; \
|
|
} while (0)
|
|
|
|
#define LFS_PUT_HEADFREE(FS, CIP, BP, VAL) do { \
|
|
(FS)->lfs_freehd = (VAL); \
|
|
if ((FS)->lfs_version > 1) { \
|
|
LFS_CLEANERINFO((CIP), (FS), (BP)); \
|
|
(CIP)->free_head = (VAL); \
|
|
LFS_BWRITE_LOG(BP); \
|
|
(FS)->lfs_flags |= LFS_IFDIRTY; \
|
|
} \
|
|
} while (0)
|
|
|
|
#define LFS_GET_TAILFREE(FS, CIP, BP, FREEP) do { \
|
|
LFS_CLEANERINFO((CIP), (FS), (BP)); \
|
|
*(FREEP) = (CIP)->free_tail; \
|
|
brelse(BP); \
|
|
} while (0)
|
|
|
|
#define LFS_PUT_TAILFREE(FS, CIP, BP, VAL) do { \
|
|
LFS_CLEANERINFO((CIP), (FS), (BP)); \
|
|
(CIP)->free_tail = (VAL); \
|
|
LFS_BWRITE_LOG(BP); \
|
|
(FS)->lfs_flags |= LFS_IFDIRTY; \
|
|
} while (0)
|
|
|
|
/*
|
|
* XXX - v1 compatibility code is not allowed to touch if_atime, since it
|
|
* may not be mapped!
|
|
*/
|
|
/* Read in the block with a specific inode from the ifile. */
|
|
#define LFS_IENTRY(IP, F, IN, BP) do { \
|
|
int _e; \
|
|
VTOI((F)->lfs_ivnode)->i_flag |= IN_ACCESS; \
|
|
if ((_e = bread((F)->lfs_ivnode, \
|
|
(IN) / (F)->lfs_ifpb + (F)->lfs_cleansz + (F)->lfs_segtabsz, \
|
|
(F)->lfs_bsize, NOCRED, &(BP))) != 0) \
|
|
panic("lfs: ifile read %d", _e); \
|
|
if ((F)->lfs_version == 1) \
|
|
(IP) = (IFILE *)((IFILE_V1 *)(BP)->b_data + (IN) % (F)->lfs_ifpb); \
|
|
else \
|
|
(IP) = (IFILE *)(BP)->b_data + (IN) % (F)->lfs_ifpb; \
|
|
} while(0)
|
|
|
|
/* Read in the block with a specific segment usage entry from the ifile. */
|
|
#define LFS_SEGENTRY(SP, F, IN, BP) do { \
|
|
int _e; \
|
|
VTOI((F)->lfs_ivnode)->i_flag |= IN_ACCESS; \
|
|
if ((_e = bread((F)->lfs_ivnode, \
|
|
((IN) / (F)->lfs_sepb) + (F)->lfs_cleansz, \
|
|
(F)->lfs_bsize, NOCRED, &(BP))) != 0) \
|
|
panic("lfs: ifile read: %d", _e); \
|
|
if ((F)->lfs_version == 1) \
|
|
(SP) = (SEGUSE *)((SEGUSE_V1 *)(BP)->b_data + \
|
|
((IN) & ((F)->lfs_sepb - 1))); \
|
|
else \
|
|
(SP) = (SEGUSE *)(BP)->b_data + ((IN) % (F)->lfs_sepb); \
|
|
} while(0)
|
|
|
|
#define LFS_WRITESEGENTRY(SP, F, IN, BP) do { \
|
|
if ((SP)->su_nbytes == 0) \
|
|
(SP)->su_flags |= SEGUSE_EMPTY; \
|
|
else \
|
|
(SP)->su_flags &= ~SEGUSE_EMPTY; \
|
|
(F)->lfs_suflags[(F)->lfs_activesb][(IN)] = (SP)->su_flags; \
|
|
LFS_BWRITE_LOG(BP); \
|
|
} while(0)
|
|
|
|
/* Determine if a buffer belongs to the ifile */
|
|
#define IS_IFILE(bp) (VTOI(bp->b_vp)->i_number == LFS_IFILE_INUM)
|
|
|
|
/*
|
|
* Structures used by lfs_bmapv and lfs_markv to communicate information
|
|
* about inodes and data blocks.
|
|
*/
|
|
typedef struct block_info {
|
|
ino_t bi_inode; /* inode # */
|
|
/* XXX ondisk32 */
|
|
int32_t bi_lbn; /* logical block w/in file */
|
|
int32_t bi_daddr; /* disk address of block */
|
|
u_int64_t bi_segcreate; /* origin segment create time */
|
|
int bi_version; /* file version number */
|
|
void *bi_bp; /* data buffer */
|
|
int bi_size; /* size of the block (if fragment) */
|
|
} BLOCK_INFO;
|
|
|
|
/* Compatibility for 1.5 binaries */
|
|
typedef struct block_info_15 {
|
|
ino_t bi_inode; /* inode # */
|
|
/* XXX ondisk32 */
|
|
int32_t bi_lbn; /* logical block w/in file */
|
|
int32_t bi_daddr; /* disk address of block */
|
|
u_int32_t bi_segcreate; /* origin segment create time */
|
|
int bi_version; /* file version number */
|
|
void *bi_bp; /* data buffer */
|
|
int bi_size; /* size of the block (if fragment) */
|
|
} BLOCK_INFO_15;
|
|
|
|
/* In-memory description of a segment about to be written. */
|
|
struct segment {
|
|
struct lfs *fs; /* file system pointer */
|
|
struct buf **bpp; /* pointer to buffer array */
|
|
struct buf **cbpp; /* pointer to next available bp */
|
|
struct buf **start_bpp; /* pointer to first bp in this set */
|
|
struct buf *ibp; /* buffer pointer to inode page */
|
|
struct dinode *idp; /* pointer to ifile dinode */
|
|
struct finfo *fip; /* current fileinfo pointer */
|
|
struct vnode *vp; /* vnode being gathered */
|
|
void *segsum; /* segment summary info */
|
|
u_int32_t ninodes; /* number of inodes in this segment */
|
|
int32_t seg_bytes_left; /* bytes left in segment */
|
|
int32_t sum_bytes_left; /* bytes left in summary block */
|
|
u_int32_t seg_number; /* number of this segment */
|
|
/* XXX ondisk32 */
|
|
int32_t *start_lbp; /* beginning lbn for this set */
|
|
|
|
#define SEGM_CKP 0x01 /* doing a checkpoint */
|
|
#define SEGM_CLEAN 0x02 /* cleaner call; don't sort */
|
|
#define SEGM_SYNC 0x04 /* wait for segment */
|
|
#define SEGM_PROT 0x08 /* don't inactivate at segunlock */
|
|
#define SEGM_PAGEDAEMON 0x10 /* pagedaemon called us */
|
|
#define SEGM_WRITERD 0x20 /* LFS writed called us */
|
|
#define SEGM_FORCE_CKP 0x40 /* Force checkpoint right away */
|
|
u_int16_t seg_flags; /* run-time flags for this segment */
|
|
u_int32_t seg_iocount; /* number of ios pending */
|
|
int ndupino; /* number of duplicate inodes */
|
|
};
|
|
|
|
struct lfs_cluster {
|
|
size_t bufsize; /* Size of kept data */
|
|
struct buf **bpp; /* Array of kept buffers */
|
|
int bufcount; /* Number of kept buffers */
|
|
#define LFS_CL_MALLOC 0x00000001
|
|
#define LFS_CL_SHIFT 0x00000002
|
|
#define LFS_CL_SYNC 0x00000004
|
|
u_int32_t flags; /* Flags */
|
|
struct lfs *fs; /* LFS that this belongs to */
|
|
struct segment *seg; /* Segment structure, for LFS_CL_SYNC */
|
|
void *saveaddr; /* Original contents of saveaddr */
|
|
char *olddata; /* Original b_data, if LFS_CL_MALLOC */
|
|
};
|
|
|
|
/*
|
|
* LFS inode extensions; moved from <ufs/ufs/inode.h> so that file didn't
|
|
* have to change every time LFS changed.
|
|
*/
|
|
struct lfs_inode_ext {
|
|
off_t lfs_osize; /* size of file on disk */
|
|
u_int32_t lfs_effnblocks; /* number of blocks when i/o completes */
|
|
size_t lfs_fragsize[NDADDR]; /* size of on-disk direct blocks */
|
|
TAILQ_ENTRY(inode) lfs_dchain; /* Dirop chain. */
|
|
TAILQ_ENTRY(inode) lfs_pchain; /* Paging chain. */
|
|
};
|
|
#define i_lfs_osize inode_ext.lfs->lfs_osize
|
|
#define i_lfs_effnblks inode_ext.lfs->lfs_effnblocks
|
|
#define i_lfs_fragsize inode_ext.lfs->lfs_fragsize
|
|
#define i_lfs_dchain inode_ext.lfs->lfs_dchain
|
|
|
|
/*
|
|
* Macros for determining free space on the disk, with the variable metadata
|
|
* of segment summaries and inode blocks taken into account.
|
|
*/
|
|
/* Estimate number of clean blocks not available for writing */
|
|
#define LFS_EST_CMETA(F) (int32_t)((((F)->lfs_dmeta * \
|
|
(int64_t)(F)->lfs_nclean) / \
|
|
((F)->lfs_nseg - (F)->lfs_nclean)))
|
|
|
|
/* Estimate total size of the disk not including metadata */
|
|
#define LFS_EST_NONMETA(F) ((F)->lfs_dsize - (F)->lfs_dmeta - LFS_EST_CMETA(F))
|
|
|
|
/* Estimate number of blocks actually available for writing */
|
|
#define LFS_EST_BFREE(F) ((F)->lfs_bfree - LFS_EST_CMETA(F) - (F)->lfs_dmeta)
|
|
|
|
/* Amount of non-meta space not available to mortal man */
|
|
#define LFS_EST_RSVD(F) (int32_t)((LFS_EST_NONMETA(F) * \
|
|
(u_int64_t)(F)->lfs_minfree) / \
|
|
100)
|
|
|
|
/* Can credential C write BB blocks */
|
|
#define ISSPACE(F, BB, C) \
|
|
((((C) == NOCRED || (C)->cr_uid == 0) && \
|
|
LFS_EST_BFREE(F) >= (BB)) || \
|
|
((C)->cr_uid != 0 && IS_FREESPACE(F, BB)))
|
|
|
|
/* Can an ordinary user write BB blocks */
|
|
#define IS_FREESPACE(F, BB) \
|
|
(LFS_EST_BFREE(F) >= (BB) + LFS_EST_RSVD(F))
|
|
|
|
/* Statistics Counters */
|
|
struct lfs_stats {
|
|
u_int segsused;
|
|
u_int psegwrites;
|
|
u_int psyncwrites;
|
|
u_int pcleanwrites;
|
|
u_int blocktot;
|
|
u_int cleanblocks;
|
|
u_int ncheckpoints;
|
|
u_int nwrites;
|
|
u_int nsync_writes;
|
|
u_int wait_exceeded;
|
|
u_int write_exceeded;
|
|
u_int flush_invoked;
|
|
u_int vflush_invoked;
|
|
};
|
|
#ifdef _KERNEL
|
|
extern struct lfs_stats lfs_stats;
|
|
#endif
|
|
|
|
/* Fcntls to take the place of the lfs syscalls */
|
|
struct lfs_fcntl_markv {
|
|
BLOCK_INFO *blkiov; /* blocks to relocate */
|
|
int blkcnt; /* number of blocks */
|
|
};
|
|
|
|
#define LFCNSEGWAITALL _FCNW_FSPRIV('L', 0, struct timeval)
|
|
#define LFCNSEGWAIT _FCNW_FSPRIV('L', 1, struct timeval)
|
|
#define LFCNBMAPV _FCNRW_FSPRIV('L', 2, struct lfs_fcntl_markv)
|
|
#define LFCNMARKV _FCNRW_FSPRIV('L', 3, struct lfs_fcntl_markv)
|
|
#define LFCNRECLAIM _FCNO_FSPRIV('L', 4)
|
|
|
|
#endif /* !_UFS_LFS_LFS_H_ */
|