buf.c revision 1.1 1 1.1 lukem /* $NetBSD: buf.c,v 1.1 2001/10/26 06:20:18 lukem Exp $ */
2 1.1 lukem
3 1.1 lukem /*
4 1.1 lukem * Copyright 2001 Wasabi Systems, Inc.
5 1.1 lukem * All rights reserved.
6 1.1 lukem *
7 1.1 lukem * Written by Luke Mewburn for Wasabi Systems, Inc.
8 1.1 lukem *
9 1.1 lukem * Redistribution and use in source and binary forms, with or without
10 1.1 lukem * modification, are permitted provided that the following conditions
11 1.1 lukem * are met:
12 1.1 lukem * 1. Redistributions of source code must retain the above copyright
13 1.1 lukem * notice, this list of conditions and the following disclaimer.
14 1.1 lukem * 2. Redistributions in binary form must reproduce the above copyright
15 1.1 lukem * notice, this list of conditions and the following disclaimer in the
16 1.1 lukem * documentation and/or other materials provided with the distribution.
17 1.1 lukem * 3. All advertising materials mentioning features or use of this software
18 1.1 lukem * must display the following acknowledgement:
19 1.1 lukem * This product includes software developed for the NetBSD Project by
20 1.1 lukem * Wasabi Systems, Inc.
21 1.1 lukem * 4. The name of Wasabi Systems, Inc. may not be used to endorse
22 1.1 lukem * or promote products derived from this software without specific prior
23 1.1 lukem * written permission.
24 1.1 lukem *
25 1.1 lukem * THIS SOFTWARE IS PROVIDED BY WASABI SYSTEMS, INC. ``AS IS'' AND
26 1.1 lukem * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
27 1.1 lukem * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
28 1.1 lukem * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL WASABI SYSTEMS, INC
29 1.1 lukem * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
30 1.1 lukem * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
31 1.1 lukem * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
32 1.1 lukem * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
33 1.1 lukem * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
34 1.1 lukem * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
35 1.1 lukem * POSSIBILITY OF SUCH DAMAGE.
36 1.1 lukem */
37 1.1 lukem
38 1.1 lukem #include <sys/param.h>
39 1.1 lukem #include <sys/time.h>
40 1.1 lukem
41 1.1 lukem #include <assert.h>
42 1.1 lukem #include <err.h>
43 1.1 lukem #include <errno.h>
44 1.1 lukem #include <stdio.h>
45 1.1 lukem #include <stdlib.h>
46 1.1 lukem #include <unistd.h>
47 1.1 lukem
48 1.1 lukem #include <ufs/ufs/inode.h>
49 1.1 lukem #include <ufs/ffs/fs.h>
50 1.1 lukem
51 1.1 lukem #include "makefs.h"
52 1.1 lukem
53 1.1 lukem #include "ffs/buf.h"
54 1.1 lukem
55 1.1 lukem extern int sectorsize; /* XXX: from ffs.c & mkfs.c */
56 1.1 lukem
57 1.1 lukem TAILQ_HEAD(buftailhead,buf) buftail;
58 1.1 lukem
59 1.1 lukem int
60 1.1 lukem bread(int fd, struct fs *fs, daddr_t blkno, int size, struct buf **bpp)
61 1.1 lukem {
62 1.1 lukem off_t offset;
63 1.1 lukem ssize_t rv;
64 1.1 lukem
65 1.1 lukem assert (fs != NULL);
66 1.1 lukem assert (bpp != NULL);
67 1.1 lukem
68 1.1 lukem if (debug & DEBUG_BUF_BREAD)
69 1.1 lukem printf("bread: fs %p blkno %d size %d\n",
70 1.1 lukem fs, blkno, size);
71 1.1 lukem *bpp = getblk(fd, fs, blkno, size);
72 1.1 lukem offset = (*bpp)->b_blkno * sectorsize; /* XXX */
73 1.1 lukem if (debug & DEBUG_BUF_BREAD)
74 1.1 lukem printf("bread: bp %p blkno %d offset %lld bcount %ld\n",
75 1.1 lukem (*bpp), (*bpp)->b_blkno, (long long) offset,
76 1.1 lukem (*bpp)->b_bcount);
77 1.1 lukem if (lseek((*bpp)->b_fd, offset, SEEK_SET) == -1)
78 1.1 lukem err(1, "bread: lseek %lld (%lld)",
79 1.1 lukem (long long)(*bpp)->b_blkno, (long long)offset);
80 1.1 lukem rv = read((*bpp)->b_fd, (*bpp)->b_data, (*bpp)->b_bcount);
81 1.1 lukem if (debug & DEBUG_BUF_BREAD)
82 1.1 lukem printf("bread: read %ld (%lld) returned %d\n",
83 1.1 lukem (*bpp)->b_bcount, (long long)offset, (int)rv);
84 1.1 lukem if (rv == -1) /* read error */
85 1.1 lukem err(1, "bread: read %ld (%lld) returned %d",
86 1.1 lukem (*bpp)->b_bcount, (long long)offset, (int)rv);
87 1.1 lukem else if (rv != (*bpp)->b_bcount) /* short read */
88 1.1 lukem err(1, "bread: read %ld (%lld) returned %d",
89 1.1 lukem (*bpp)->b_bcount, (long long)offset, (int)rv);
90 1.1 lukem else
91 1.1 lukem return (0);
92 1.1 lukem }
93 1.1 lukem
94 1.1 lukem void
95 1.1 lukem brelse(struct buf *bp)
96 1.1 lukem {
97 1.1 lukem
98 1.1 lukem assert (bp != NULL);
99 1.1 lukem assert (bp->b_data != NULL);
100 1.1 lukem
101 1.1 lukem if (bp->b_lblkno < 0) {
102 1.1 lukem /*
103 1.1 lukem * XXX don't remove any buffers with negative logical block
104 1.1 lukem * numbers (lblkno), so that we retain the mapping
105 1.1 lukem * of negative lblkno -> real blkno that ffs_balloc()
106 1.1 lukem * sets up.
107 1.1 lukem *
108 1.1 lukem * if we instead released these buffers, and implemented
109 1.1 lukem * ufs_strategy() (and ufs_bmaparray()) and called those
110 1.1 lukem * from bread() and bwrite() to convert the lblkno to
111 1.1 lukem * a real blkno, we'd add a lot more code & complexity
112 1.1 lukem * and reading off disk, for little gain, because this
113 1.1 lukem * simple hack works for our purpose.
114 1.1 lukem */
115 1.1 lukem bp->b_bcount = 0;
116 1.1 lukem return;
117 1.1 lukem }
118 1.1 lukem
119 1.1 lukem TAILQ_REMOVE(&buftail, bp, b_tailq);
120 1.1 lukem free(bp->b_data);
121 1.1 lukem free(bp);
122 1.1 lukem }
123 1.1 lukem
124 1.1 lukem int
125 1.1 lukem bwrite(struct buf *bp)
126 1.1 lukem {
127 1.1 lukem off_t offset;
128 1.1 lukem ssize_t rv;
129 1.1 lukem
130 1.1 lukem assert (bp != NULL);
131 1.1 lukem offset = bp->b_blkno * sectorsize; /* XXX */
132 1.1 lukem if (debug & DEBUG_BUF_BWRITE)
133 1.1 lukem printf("bwrite: bp %p blkno %d offset %lld bcount %ld\n",
134 1.1 lukem bp, bp->b_blkno, (long long) offset, bp->b_bcount);
135 1.1 lukem if (lseek(bp->b_fd, offset, SEEK_SET) == -1)
136 1.1 lukem return (errno);
137 1.1 lukem rv = write(bp->b_fd, bp->b_data, bp->b_bcount);
138 1.1 lukem if (debug & DEBUG_BUF_BWRITE)
139 1.1 lukem printf("bwrite: write %ld (offset %lld) returned %lld\n",
140 1.1 lukem bp->b_bcount, (long long)offset, (long long)rv);
141 1.1 lukem if (rv == bp->b_bcount)
142 1.1 lukem return (0);
143 1.1 lukem else if (rv == -1) /* write error */
144 1.1 lukem return (errno);
145 1.1 lukem else /* short write ? */
146 1.1 lukem return (EAGAIN);
147 1.1 lukem }
148 1.1 lukem
149 1.1 lukem void
150 1.1 lukem bcleanup(void)
151 1.1 lukem {
152 1.1 lukem struct buf *bp;
153 1.1 lukem
154 1.1 lukem /*
155 1.1 lukem * XXX this really shouldn't be necessary, but i'm curious to
156 1.1 lukem * know why there's still some buffers lying around that
157 1.1 lukem * aren't brelse()d
158 1.1 lukem */
159 1.1 lukem
160 1.1 lukem if (TAILQ_EMPTY(&buftail))
161 1.1 lukem return;
162 1.1 lukem
163 1.1 lukem printf("bcleanup: unflushed buffers:\n");
164 1.1 lukem TAILQ_FOREACH(bp, &buftail, b_tailq) {
165 1.1 lukem printf("\tlblkno %10d blkno %10d count %6ld bufsize %6ld\n",
166 1.1 lukem bp->b_lblkno, bp->b_blkno, bp->b_bcount, bp->b_bufsize);
167 1.1 lukem }
168 1.1 lukem printf("bcleanup: done\n");
169 1.1 lukem }
170 1.1 lukem
171 1.1 lukem struct buf *
172 1.1 lukem getblk(int fd, struct fs *fs, daddr_t blkno, int size)
173 1.1 lukem {
174 1.1 lukem static int buftailinitted;
175 1.1 lukem struct buf *bp;
176 1.1 lukem
177 1.1 lukem assert (fs != NULL);
178 1.1 lukem if (debug & DEBUG_BUF_GETBLK)
179 1.1 lukem printf("getblk: fs %p blkno %d size %d\n", fs, blkno, size);
180 1.1 lukem
181 1.1 lukem bp = NULL;
182 1.1 lukem if (!buftailinitted) {
183 1.1 lukem if (debug & DEBUG_BUF_GETBLK)
184 1.1 lukem printf("getblk: initialising tailq\n");
185 1.1 lukem TAILQ_INIT(&buftail);
186 1.1 lukem buftailinitted = 1;
187 1.1 lukem } else {
188 1.1 lukem TAILQ_FOREACH(bp, &buftail, b_tailq) {
189 1.1 lukem if (bp->b_lblkno != blkno)
190 1.1 lukem continue;
191 1.1 lukem break;
192 1.1 lukem }
193 1.1 lukem }
194 1.1 lukem if (bp == NULL) {
195 1.1 lukem if ((bp = calloc(1, sizeof(struct buf))) == NULL)
196 1.1 lukem err(1, "getblk: calloc");
197 1.1 lukem
198 1.1 lukem bp->b_bufsize = 0;
199 1.1 lukem bp->b_blkno = bp->b_lblkno = blkno;
200 1.1 lukem bp->b_fd = fd;
201 1.1 lukem bp->b_fs = fs;
202 1.1 lukem bp->b_data = NULL;
203 1.1 lukem TAILQ_INSERT_HEAD(&buftail, bp, b_tailq);
204 1.1 lukem }
205 1.1 lukem bp->b_bcount = size;
206 1.1 lukem if (bp->b_data == NULL || bp->b_bcount > bp->b_bufsize) {
207 1.1 lukem bp->b_bufsize = size;
208 1.1 lukem if ((bp->b_data = realloc(bp->b_data, bp->b_bufsize)) == NULL)
209 1.1 lukem err(1, "getblk: realloc b_data %ld", bp->b_bcount);
210 1.1 lukem }
211 1.1 lukem
212 1.1 lukem return (bp);
213 1.1 lukem }
214