1 /* $NetBSD: segwrite.h,v 1.1 2003/03/28 08:09:54 perseant Exp $ */ 2 /*- 3 * Copyright (c) 2003 The NetBSD Foundation, Inc. 4 * All rights reserved. 5 * 6 * This code is derived from software contributed to The NetBSD Foundation 7 * by Konrad E. Schroder <perseant@hhhh.org>. 8 * 9 * Redistribution and use in source and binary forms, with or without 10 * modification, are permitted provided that the following conditions 11 * are met: 12 * 1. Redistributions of source code must retain the above copyright 13 * notice, this list of conditions and the following disclaimer. 14 * 2. Redistributions in binary form must reproduce the above copyright 15 * notice, this list of conditions and the following disclaimer in the 16 * documentation and/or other materials provided with the distribution. 17 * 3. All advertising materials mentioning features or use of this software 18 * must display the following acknowledgement: 19 * This product includes software developed by the NetBSD 20 * Foundation, Inc. and its contributors. 21 * 4. Neither the name of The NetBSD Foundation nor the names of its 22 * contributors may be used to endorse or promote products derived 23 * from this software without specific prior written permission. 24 * 25 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS 26 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 27 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 28 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS 29 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 30 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 31 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 32 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 33 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 34 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 35 * POSSIBILITY OF SUCH DAMAGE. 36 */ 37 /* 38 * Determine if it's OK to start a partial in this segment, or if we need 39 * to go on to a new segment. 40 */ 41 #define LFS_PARTIAL_FITS(fs) \ 42 ((fs)->lfs_fsbpseg - ((fs)->lfs_offset - (fs)->lfs_curseg) > \ 43 fragstofsb((fs), (fs)->lfs_frag)) 44 45 /* op values to lfs_writevnodes */ 46 #define VN_REG 0 47 #define VN_DIROP 1 48 49 int lfs_segwrite(struct lfs *, int); 50 void lfs_writefile(struct lfs *, struct segment *, struct uvnode *); 51 int lfs_writeinode(struct lfs *, struct segment *, struct inode *); 52 int lfs_gatherblock(struct segment *, struct ubuf *); 53 int lfs_gather(struct lfs *, struct segment *, struct uvnode *, 54 int (*match) (struct lfs *, struct ubuf *)); 55 void lfs_update_single(struct lfs *, struct segment *, daddr_t, int32_t, int); 56 void lfs_updatemeta(struct segment *); 57 int lfs_initseg(struct lfs *); 58 void lfs_newseg(struct lfs *); 59 int lfs_writeseg(struct lfs *, struct segment *); 60 void lfs_writesuper(struct lfs *, ufs_daddr_t); 61 62 int lfs_match_data(struct lfs *, struct ubuf *); 63 int lfs_match_indir(struct lfs *, struct ubuf *); 64 int lfs_match_dindir(struct lfs *, struct ubuf *); 65 int lfs_match_tindir(struct lfs *, struct ubuf *); 66 67 void lfs_shellsort(struct ubuf **, int32_t *, int, int); 68 69 int ufs_getlbns(struct lfs *, struct uvnode *, daddr_t, struct indir *, int *); 70 int ufs_bmaparray(struct lfs *, struct uvnode *, daddr_t, daddr_t *, struct indir *, int *); 71 72 int lfs_seglock(struct lfs *, unsigned long); 73 void lfs_segunlock(struct lfs *); 74 int lfs_writevnodes(struct lfs *, struct segment *, int); 75 76 void lfs_writesuper(struct lfs *, ufs_daddr_t); 77