lfs_bio.c revision 1.4 1 /* $NetBSD: lfs_bio.c,v 1.4 1995/06/18 14:48:33 cgd Exp $ */
2
3 /*
4 * Copyright (c) 1991, 1993
5 * The Regents of the University of California. All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. All advertising materials mentioning features or use of this software
16 * must display the following acknowledgement:
17 * This product includes software developed by the University of
18 * California, Berkeley and its contributors.
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.
22 *
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
33 * SUCH DAMAGE.
34 *
35 * @(#)lfs_bio.c 8.4 (Berkeley) 12/30/93
36 */
37
38 #include <sys/param.h>
39 #include <sys/proc.h>
40 #include <sys/buf.h>
41 #include <sys/vnode.h>
42 #include <sys/resourcevar.h>
43 #include <sys/mount.h>
44 #include <sys/kernel.h>
45
46 #include <ufs/ufs/quota.h>
47 #include <ufs/ufs/inode.h>
48 #include <ufs/ufs/ufsmount.h>
49
50 #include <ufs/lfs/lfs.h>
51 #include <ufs/lfs/lfs_extern.h>
52
53 /*
54 * LFS block write function.
55 *
56 * XXX
57 * No write cost accounting is done.
58 * This is almost certainly wrong for synchronous operations and NFS.
59 */
60 int lfs_allclean_wakeup; /* Cleaner wakeup address. */
61 int locked_queue_count; /* XXX Count of locked-down buffers. */
62 int lfs_writing; /* Set if already kicked off a writer
63 because of buffer space */
64 /*
65 #define WRITE_THRESHHOLD ((nbuf >> 2) - 10)
66 #define WAIT_THRESHHOLD ((nbuf >> 1) - 10)
67 */
68 #define WAIT_THRESHHOLD (nbuf - (nbuf >> 2) - 10)
69 #define WRITE_THRESHHOLD ((nbuf >> 1) - 10)
70 #define LFS_BUFWAIT 2
71
72 int
73 lfs_bwrite(ap)
74 struct vop_bwrite_args /* {
75 struct buf *a_bp;
76 } */ *ap;
77 {
78 register struct buf *bp = ap->a_bp;
79 struct lfs *fs;
80 struct inode *ip;
81 int error, s;
82
83 /*
84 * Set the delayed write flag and use reassignbuf to move the buffer
85 * from the clean list to the dirty one.
86 *
87 * Set the B_LOCKED flag and unlock the buffer, causing brelse to move
88 * the buffer onto the LOCKED free list. This is necessary, otherwise
89 * getnewbuf() would try to reclaim the buffers using bawrite, which
90 * isn't going to work.
91 *
92 * XXX we don't let meta-data writes run out of space because they can
93 * come from the segment writer. We need to make sure that there is
94 * enough space reserved so that there's room to write meta-data
95 * blocks.
96 */
97 if (!(bp->b_flags & B_LOCKED)) {
98 fs = VFSTOUFS(bp->b_vp->v_mount)->um_lfs;
99 while (!LFS_FITS(fs, fsbtodb(fs, 1)) && !IS_IFILE(bp) &&
100 bp->b_lblkno > 0) {
101 /* Out of space, need cleaner to run */
102 wakeup(&lfs_allclean_wakeup);
103 if (error = tsleep(&fs->lfs_avail, PCATCH | PUSER,
104 "cleaner", NULL)) {
105 brelse(bp);
106 return (error);
107 }
108 }
109 ip = VTOI((bp)->b_vp);
110 if (!(ip->i_flag & IN_MODIFIED))
111 ++fs->lfs_uinodes;
112 ip->i_flag |= IN_CHANGE | IN_MODIFIED | IN_UPDATE;
113 fs->lfs_avail -= fsbtodb(fs, 1);
114 ++locked_queue_count;
115 bp->b_flags |= B_DELWRI | B_LOCKED;
116 bp->b_flags &= ~(B_READ | B_ERROR);
117 s = splbio();
118 reassignbuf(bp, bp->b_vp);
119 splx(s);
120 }
121 brelse(bp);
122 return (0);
123 }
124
125 /*
126 * XXX
127 * This routine flushes buffers out of the B_LOCKED queue when LFS has too
128 * many locked down. Eventually the pageout daemon will simply call LFS
129 * when pages need to be reclaimed. Note, we have one static count of locked
130 * buffers, so we can't have more than a single file system. To make this
131 * work for multiple file systems, put the count into the mount structure.
132 */
133 void
134 lfs_flush()
135 {
136 register struct mount *mp;
137
138 #ifdef DOSTATS
139 ++lfs_stats.write_exceeded;
140 #endif
141 if (lfs_writing)
142 return;
143 lfs_writing = 1;
144 for (mp = mountlist.cqh_first; mp != (void *)&mountlist;
145 mp = mp->mnt_list.cqe_next) {
146 /* The lock check below is to avoid races with unmount. */
147 if (!strncmp(&mp->mnt_stat.f_fstypename[0], MOUNT_LFS, MFSNAMELEN) &&
148 (mp->mnt_flag & (MNT_MLOCK|MNT_RDONLY|MNT_UNMOUNT)) == 0 &&
149 !((((struct ufsmount *)mp->mnt_data))->ufsmount_u.lfs)->lfs_dirops ) {
150 /*
151 * We set the queue to 0 here because we are about to
152 * write all the dirty buffers we have. If more come
153 * in while we're writing the segment, they may not
154 * get written, so we want the count to reflect these
155 * new writes after the segwrite completes.
156 */
157 #ifdef DOSTATS
158 ++lfs_stats.flush_invoked;
159 #endif
160 lfs_segwrite(mp, 0);
161 }
162 }
163 lfs_writing = 0;
164 }
165
166 int
167 lfs_check(vp, blkno)
168 struct vnode *vp;
169 daddr_t blkno;
170 {
171 extern int lfs_allclean_wakeup;
172 int error;
173
174 error = 0;
175 if (incore(vp, blkno))
176 return (0);
177 if (locked_queue_count > WRITE_THRESHHOLD)
178 lfs_flush();
179
180 /* If out of buffers, wait on writer */
181 while (locked_queue_count > WAIT_THRESHHOLD) {
182 #ifdef DOSTATS
183 ++lfs_stats.wait_exceeded;
184 #endif
185 error = tsleep(&locked_queue_count, PCATCH | PUSER, "buffers",
186 hz * LFS_BUFWAIT);
187 }
188
189 return (error);
190 }
191