rcache.c revision 1.20 1 1.20 tls /* $NetBSD: rcache.c,v 1.20 2003/04/19 23:29:12 tls Exp $ */
2 1.1 bouyer
3 1.1 bouyer /*-
4 1.1 bouyer * Copyright (c) 1999 The NetBSD Foundation, Inc.
5 1.1 bouyer * All rights reserved.
6 1.1 bouyer *
7 1.1 bouyer * This code is derived from software contributed to The NetBSD Foundation
8 1.10 lukem * by Martin J. Laubach <mjl (at) emsi.priv.at> and
9 1.1 bouyer * Manuel Bouyer <Manuel.Bouyer (at) lip6.fr>.
10 1.1 bouyer *
11 1.1 bouyer * Redistribution and use in source and binary forms, with or without
12 1.1 bouyer * modification, are permitted provided that the following conditions
13 1.1 bouyer * are met:
14 1.1 bouyer * 1. Redistributions of source code must retain the above copyright
15 1.1 bouyer * notice, this list of conditions and the following disclaimer.
16 1.1 bouyer * 2. Redistributions in binary form must reproduce the above copyright
17 1.1 bouyer * notice, this list of conditions and the following disclaimer in the
18 1.1 bouyer * documentation and/or other materials provided with the distribution.
19 1.1 bouyer * 3. All advertising materials mentioning features or use of this software
20 1.1 bouyer * must display the following acknowledgement:
21 1.8 lukem * This product includes software developed by the NetBSD
22 1.8 lukem * Foundation, Inc. and its contributors.
23 1.1 bouyer * 4. Neither the name of The NetBSD Foundation nor the names of its
24 1.1 bouyer * contributors may be used to endorse or promote products derived
25 1.1 bouyer * from this software without specific prior written permission.
26 1.1 bouyer *
27 1.1 bouyer * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
28 1.1 bouyer * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
29 1.1 bouyer * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
30 1.10 lukem * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
31 1.1 bouyer * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
32 1.1 bouyer * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
33 1.1 bouyer * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
34 1.1 bouyer * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
35 1.1 bouyer * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
36 1.1 bouyer * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
37 1.1 bouyer * POSSIBILITY OF SUCH DAMAGE.
38 1.1 bouyer */
39 1.11 lukem
40 1.11 lukem #include <sys/cdefs.h>
41 1.11 lukem #ifndef lint
42 1.20 tls __RCSID("$NetBSD: rcache.c,v 1.20 2003/04/19 23:29:12 tls Exp $");
43 1.11 lukem #endif /* not lint */
44 1.11 lukem
45 1.1 bouyer #include <sys/types.h>
46 1.1 bouyer #include <sys/uio.h>
47 1.1 bouyer #include <sys/mman.h>
48 1.1 bouyer #include <sys/param.h>
49 1.1 bouyer #include <sys/sysctl.h>
50 1.1 bouyer #include <ufs/ufs/dinode.h>
51 1.1 bouyer
52 1.1 bouyer #include <stdio.h>
53 1.1 bouyer #include <stdlib.h>
54 1.1 bouyer #include <unistd.h>
55 1.1 bouyer #include <fcntl.h>
56 1.1 bouyer #include <errno.h>
57 1.1 bouyer #include <string.h>
58 1.1 bouyer
59 1.1 bouyer #include "dump.h"
60 1.1 bouyer
61 1.1 bouyer /*-----------------------------------------------------------------------*/
62 1.1 bouyer #define MAXCACHEBUFS 512 /* max 512 buffers */
63 1.1 bouyer #define MAXMEMPART 6 /* max 15% of the user mem */
64 1.1 bouyer
65 1.1 bouyer /*-----------------------------------------------------------------------*/
66 1.13 hannken union cdesc {
67 1.13 hannken volatile size_t cd_count;
68 1.13 hannken struct {
69 1.13 hannken volatile daddr_t blkstart;
70 1.14 enami volatile daddr_t blkend; /* start + nblksread */
71 1.13 hannken volatile daddr_t blocksRead;
72 1.13 hannken volatile size_t time;
73 1.1 bouyer #ifdef DIAGNOSTICS
74 1.13 hannken volatile pid_t owner;
75 1.1 bouyer #endif
76 1.13 hannken } desc;
77 1.13 hannken #define cd_blkstart desc.blkstart
78 1.13 hannken #define cd_blkend desc.blkend
79 1.13 hannken #define cd_blocksRead desc.blocksRead
80 1.13 hannken #define cd_time desc.time
81 1.13 hannken #define cd_owner desc.owner
82 1.1 bouyer };
83 1.1 bouyer
84 1.6 lukem static int findlru(void);
85 1.1 bouyer
86 1.1 bouyer static void *shareBuffer = NULL;
87 1.13 hannken static union cdesc *cheader;
88 1.13 hannken static union cdesc *cdesc;
89 1.1 bouyer static char *cdata;
90 1.1 bouyer static int cachebufs;
91 1.1 bouyer static int nblksread;
92 1.1 bouyer
93 1.1 bouyer #ifdef STATS
94 1.1 bouyer static int nreads;
95 1.1 bouyer static int nphysread;
96 1.1 bouyer static int64_t readsize;
97 1.1 bouyer static int64_t physreadsize;
98 1.1 bouyer #endif
99 1.1 bouyer
100 1.16 enami #define CSIZE (nblksread << dev_bshift) /* cache buf size */
101 1.16 enami #define CDATA(desc) (cdata + ((desc) - cdesc) * CSIZE)
102 1.1 bouyer
103 1.10 lukem void
104 1.6 lukem initcache(int cachesize, int readblksize)
105 1.1 bouyer {
106 1.1 bouyer size_t len;
107 1.14 enami size_t sharedSize;
108 1.1 bouyer
109 1.15 enami /* Convert read block size in terms of filesystem block size */
110 1.14 enami nblksread = howmany(readblksize, ufsib->ufs_bsize);
111 1.15 enami
112 1.15 enami /* Then, convert it in terms of device block size */
113 1.15 enami nblksread <<= ufsib->ufs_bshift - dev_bshift;
114 1.15 enami
115 1.14 enami if (cachesize == -1) { /* Compute from memory available */
116 1.20 tls unsigned int usermem;
117 1.1 bouyer int mib[2] = { CTL_HW, HW_USERMEM };
118 1.10 lukem
119 1.1 bouyer len = sizeof(usermem);
120 1.1 bouyer if (sysctl(mib, 2, &usermem, &len, NULL, 0) < 0) {
121 1.14 enami msg("sysctl(hw.usermem) failed: %s\n",
122 1.14 enami strerror(errno));
123 1.1 bouyer return;
124 1.1 bouyer }
125 1.16 enami cachebufs = (usermem / MAXMEMPART) / CSIZE;
126 1.1 bouyer } else { /* User specified */
127 1.1 bouyer cachebufs = cachesize;
128 1.1 bouyer }
129 1.10 lukem
130 1.14 enami if (cachebufs) { /* Don't allocate if zero --> no caching */
131 1.1 bouyer if (cachebufs > MAXCACHEBUFS)
132 1.1 bouyer cachebufs = MAXCACHEBUFS;
133 1.1 bouyer
134 1.13 hannken sharedSize = sizeof(union cdesc) +
135 1.13 hannken sizeof(union cdesc) * cachebufs +
136 1.16 enami cachebufs * CSIZE;
137 1.10 lukem #ifdef STATS
138 1.1 bouyer fprintf(stderr, "Using %d buffers (%d bytes)\n", cachebufs,
139 1.1 bouyer sharedSize);
140 1.1 bouyer #endif
141 1.1 bouyer shareBuffer = mmap(NULL, sharedSize, PROT_READ | PROT_WRITE,
142 1.1 bouyer MAP_ANON | MAP_SHARED, -1, 0);
143 1.14 enami if (shareBuffer == MAP_FAILED) {
144 1.1 bouyer msg("can't mmap shared memory for buffer: %s\n",
145 1.1 bouyer strerror(errno));
146 1.1 bouyer return;
147 1.1 bouyer }
148 1.1 bouyer cheader = shareBuffer;
149 1.13 hannken cdesc = (union cdesc *) (((char *) shareBuffer) +
150 1.13 hannken sizeof(union cdesc));
151 1.13 hannken cdata = ((char *) shareBuffer) + sizeof(union cdesc) +
152 1.13 hannken sizeof(union cdesc) * cachebufs;
153 1.1 bouyer
154 1.1 bouyer memset(shareBuffer, '\0', sharedSize);
155 1.1 bouyer }
156 1.1 bouyer }
157 1.1 bouyer
158 1.6 lukem /*
159 1.6 lukem * Find the cache buffer descriptor that shows the minimal access time
160 1.6 lukem */
161 1.10 lukem static int
162 1.6 lukem findlru(void)
163 1.1 bouyer {
164 1.8 lukem int i;
165 1.13 hannken size_t minTime = cdesc[0].cd_time;
166 1.8 lukem int minIdx = 0;
167 1.1 bouyer
168 1.1 bouyer for (i = 0; i < cachebufs; i++) {
169 1.13 hannken if (cdesc[i].cd_time < minTime) {
170 1.1 bouyer minIdx = i;
171 1.13 hannken minTime = cdesc[i].cd_time;
172 1.1 bouyer }
173 1.1 bouyer }
174 1.1 bouyer
175 1.1 bouyer return minIdx;
176 1.1 bouyer }
177 1.6 lukem
178 1.1 bouyer /*
179 1.1 bouyer * Read data directly from disk, with smart error handling.
180 1.1 bouyer * Try to recover from hard errors by reading in sector sized pieces.
181 1.1 bouyer * Error recovery is attempted at most BREADEMAX times before seeking
182 1.1 bouyer * consent from the operator to continue.
183 1.1 bouyer */
184 1.1 bouyer
185 1.1 bouyer static int breaderrors = 0;
186 1.1 bouyer #define BREADEMAX 32
187 1.1 bouyer
188 1.10 lukem void
189 1.6 lukem rawread(daddr_t blkno, char *buf, int size)
190 1.1 bouyer {
191 1.1 bouyer int cnt, i;
192 1.14 enami
193 1.1 bouyer #ifdef STATS
194 1.1 bouyer nphysread++;
195 1.1 bouyer physreadsize += size;
196 1.1 bouyer #endif
197 1.1 bouyer
198 1.14 enami loop:
199 1.18 enami if (lseek(diskfd, ((off_t) blkno << dev_bshift), SEEK_SET) == -1) {
200 1.1 bouyer msg("rawread: lseek fails\n");
201 1.1 bouyer goto err;
202 1.1 bouyer }
203 1.14 enami if ((cnt = read(diskfd, buf, size)) == size)
204 1.1 bouyer return;
205 1.16 enami if (blkno + (size >> dev_bshift) > ufsib->ufs_dsize) {
206 1.7 lukem /*
207 1.7 lukem * Trying to read the final fragment.
208 1.7 lukem *
209 1.7 lukem * NB - dump only works in TP_BSIZE blocks, hence
210 1.7 lukem * rounds `dev_bsize' fragments up to TP_BSIZE pieces.
211 1.7 lukem * It should be smarter about not actually trying to
212 1.7 lukem * read more than it can get, but for the time being
213 1.7 lukem * we punt and scale back the read only when it gets
214 1.7 lukem * us into trouble. (mkm 9/25/83)
215 1.7 lukem */
216 1.7 lukem size -= dev_bsize;
217 1.7 lukem goto loop;
218 1.7 lukem }
219 1.1 bouyer if (cnt == -1)
220 1.12 fvdl msg("read error from %s: %s: [block %lld]: count=%d\n",
221 1.14 enami disk, strerror(errno), (long long)blkno, size);
222 1.1 bouyer else
223 1.14 enami msg("short read error from %s: [block %lld]: "
224 1.14 enami "count=%d, got=%d\n",
225 1.14 enami disk, (long long)blkno, size, cnt);
226 1.1 bouyer err:
227 1.1 bouyer if (++breaderrors > BREADEMAX) {
228 1.5 briggs msg("More than %d block read errors from %s\n",
229 1.14 enami BREADEMAX, disk);
230 1.1 bouyer broadcast("DUMP IS AILING!\n");
231 1.1 bouyer msg("This is an unrecoverable error.\n");
232 1.14 enami if (!query("Do you want to attempt to continue?")) {
233 1.1 bouyer dumpabort(0);
234 1.1 bouyer /*NOTREACHED*/
235 1.1 bouyer } else
236 1.1 bouyer breaderrors = 0;
237 1.1 bouyer }
238 1.1 bouyer /*
239 1.1 bouyer * Zero buffer, then try to read each sector of buffer separately.
240 1.1 bouyer */
241 1.1 bouyer memset(buf, 0, size);
242 1.1 bouyer for (i = 0; i < size; i += dev_bsize, buf += dev_bsize, blkno++) {
243 1.14 enami if (lseek(diskfd, ((off_t)blkno << dev_bshift),
244 1.18 enami SEEK_SET) == -1) {
245 1.1 bouyer msg("rawread: lseek2 fails: %s!\n",
246 1.1 bouyer strerror(errno));
247 1.1 bouyer continue;
248 1.1 bouyer }
249 1.1 bouyer if ((cnt = read(diskfd, buf, (int)dev_bsize)) == dev_bsize)
250 1.1 bouyer continue;
251 1.1 bouyer if (cnt == -1) {
252 1.14 enami msg("read error from %s: %s: [sector %lld]: "
253 1.19 enami "count=%ld\n", disk, strerror(errno),
254 1.19 enami (long long)blkno, dev_bsize);
255 1.1 bouyer continue;
256 1.1 bouyer }
257 1.14 enami msg("short read error from %s: [sector %lld]: "
258 1.14 enami "count=%ld, got=%d\n",
259 1.12 fvdl disk, (long long)blkno, dev_bsize, cnt);
260 1.1 bouyer }
261 1.1 bouyer }
262 1.1 bouyer
263 1.10 lukem void
264 1.6 lukem bread(daddr_t blkno, char *buf, int size)
265 1.1 bouyer {
266 1.16 enami int osize = size, idx;
267 1.1 bouyer daddr_t oblkno = blkno;
268 1.1 bouyer char *obuf = buf;
269 1.14 enami daddr_t numBlocks = howmany(size, dev_bsize);
270 1.1 bouyer
271 1.1 bouyer #ifdef STATS
272 1.1 bouyer nreads++;
273 1.1 bouyer readsize += size;
274 1.1 bouyer #endif
275 1.1 bouyer
276 1.1 bouyer if (!shareBuffer) {
277 1.1 bouyer rawread(blkno, buf, size);
278 1.1 bouyer return;
279 1.1 bouyer }
280 1.1 bouyer
281 1.1 bouyer if (flock(diskfd, LOCK_EX)) {
282 1.1 bouyer msg("flock(LOCK_EX) failed: %s\n",
283 1.1 bouyer strerror(errno));
284 1.1 bouyer rawread(blkno, buf, size);
285 1.1 bouyer return;
286 1.1 bouyer }
287 1.1 bouyer
288 1.1 bouyer retry:
289 1.16 enami idx = 0;
290 1.16 enami while (size > 0) {
291 1.8 lukem int i;
292 1.10 lukem
293 1.1 bouyer for (i = 0; i < cachebufs; i++) {
294 1.16 enami union cdesc *curr = &cdesc[(i + idx) % cachebufs];
295 1.1 bouyer
296 1.1 bouyer #ifdef DIAGNOSTICS
297 1.13 hannken if (curr->cd_owner) {
298 1.1 bouyer fprintf(stderr, "Owner is set (%d, me=%d), can"
299 1.13 hannken "not happen.\n", curr->cd_owner, getpid());
300 1.1 bouyer }
301 1.1 bouyer #endif
302 1.1 bouyer
303 1.13 hannken if (curr->cd_blkend == 0)
304 1.1 bouyer continue;
305 1.1 bouyer /*
306 1.1 bouyer * If we find a bit of the read in the buffers,
307 1.1 bouyer * now compute how many blocks we can copy,
308 1.1 bouyer * copy them out, adjust blkno, buf and size,
309 1.1 bouyer * and restart
310 1.1 bouyer */
311 1.13 hannken if (curr->cd_blkstart <= blkno &&
312 1.13 hannken blkno < curr->cd_blkend) {
313 1.1 bouyer /* Number of data blocks to be copied */
314 1.6 lukem int toCopy = MIN(size,
315 1.16 enami (curr->cd_blkend - blkno) << dev_bshift);
316 1.1 bouyer #ifdef DIAGNOSTICS
317 1.16 enami if (toCopy <= 0 || toCopy > CSIZE) {
318 1.1 bouyer fprintf(stderr, "toCopy %d !\n",
319 1.1 bouyer toCopy);
320 1.1 bouyer dumpabort(0);
321 1.1 bouyer }
322 1.16 enami if (CDATA(curr) +
323 1.16 enami ((blkno - curr->cd_blkstart) <<
324 1.17 enami dev_bshift) < CDATA(curr) ||
325 1.16 enami CDATA(curr) +
326 1.16 enami ((blkno - curr->cd_blkstart) <<
327 1.17 enami dev_bshift) > CDATA(curr) + CSIZE) {
328 1.1 bouyer fprintf(stderr, "%p < %p !!!\n",
329 1.16 enami CDATA(curr) + ((blkno -
330 1.16 enami curr->cd_blkstart) << dev_bshift),
331 1.16 enami CDATA(curr));
332 1.16 enami fprintf(stderr,
333 1.16 enami "cdesc[i].cd_blkstart %lld "
334 1.16 enami "blkno %lld dev_bsize %ld\n",
335 1.16 enami (long long)curr->cd_blkstart,
336 1.16 enami (long long)blkno,
337 1.16 enami dev_bsize);
338 1.1 bouyer dumpabort(0);
339 1.1 bouyer }
340 1.1 bouyer #endif
341 1.16 enami memcpy(buf, CDATA(curr) +
342 1.17 enami ((blkno - curr->cd_blkstart) <<
343 1.17 enami dev_bshift),
344 1.1 bouyer toCopy);
345 1.1 bouyer
346 1.1 bouyer buf += toCopy;
347 1.1 bouyer size -= toCopy;
348 1.14 enami blkno += howmany(toCopy, dev_bsize);
349 1.14 enami numBlocks -= howmany(toCopy, dev_bsize);
350 1.1 bouyer
351 1.13 hannken curr->cd_time = cheader->cd_count++;
352 1.1 bouyer
353 1.1 bouyer /*
354 1.1 bouyer * If all data of a cache block have been
355 1.1 bouyer * read, chances are good no more reads
356 1.1 bouyer * will occur, so expire the cache immediately
357 1.1 bouyer */
358 1.1 bouyer
359 1.13 hannken curr->cd_blocksRead +=
360 1.14 enami howmany(toCopy, dev_bsize);
361 1.13 hannken if (curr->cd_blocksRead >= nblksread)
362 1.13 hannken curr->cd_time = 0;
363 1.1 bouyer
364 1.1 bouyer goto retry;
365 1.1 bouyer }
366 1.1 bouyer }
367 1.1 bouyer
368 1.1 bouyer /* No more to do? */
369 1.1 bouyer if (size == 0)
370 1.1 bouyer break;
371 1.9 lukem
372 1.1 bouyer /*
373 1.1 bouyer * This does actually not happen if fs blocks are not greater
374 1.1 bouyer * than nblksread.
375 1.1 bouyer */
376 1.9 lukem if (numBlocks > nblksread || blkno >= ufsib->ufs_dsize) {
377 1.1 bouyer rawread(oblkno, obuf, osize);
378 1.1 bouyer break;
379 1.1 bouyer } else {
380 1.8 lukem ssize_t rsize;
381 1.8 lukem daddr_t blockBlkNo;
382 1.1 bouyer
383 1.1 bouyer blockBlkNo = (blkno / nblksread) * nblksread;
384 1.1 bouyer idx = findlru();
385 1.6 lukem rsize = MIN(nblksread,
386 1.16 enami ufsib->ufs_dsize - blockBlkNo) << dev_bshift;
387 1.3 perseant
388 1.1 bouyer #ifdef DIAGNOSTICS
389 1.13 hannken if (cdesc[idx].cd_owner)
390 1.1 bouyer fprintf(stderr, "Owner is set (%d, me=%d), can"
391 1.13 hannken "not happen(2).\n", cdesc[idx].cd_owner,
392 1.1 bouyer getpid());
393 1.13 hannken cdesc[idx].cd_owner = getpid();
394 1.1 bouyer #endif
395 1.13 hannken cdesc[idx].cd_time = cheader->cd_count++;
396 1.13 hannken cdesc[idx].cd_blkstart = blockBlkNo;
397 1.16 enami cdesc[idx].cd_blkend = 0;
398 1.13 hannken cdesc[idx].cd_blocksRead = 0;
399 1.1 bouyer
400 1.14 enami if (lseek(diskfd, ((off_t) blockBlkNo << dev_bshift),
401 1.18 enami SEEK_SET) == -1) {
402 1.1 bouyer msg("readBlocks: lseek fails: %s\n",
403 1.1 bouyer strerror(errno));
404 1.1 bouyer rsize = -1;
405 1.1 bouyer } else {
406 1.16 enami rsize = read(diskfd,
407 1.16 enami CDATA(&cdesc[idx]), rsize);
408 1.1 bouyer if (rsize < 0) {
409 1.1 bouyer msg("readBlocks: read fails: %s\n",
410 1.1 bouyer strerror(errno));
411 1.1 bouyer }
412 1.1 bouyer }
413 1.1 bouyer
414 1.1 bouyer /* On errors, panic, punt, try to read without
415 1.1 bouyer * cache and let raw read routine do the rest.
416 1.1 bouyer */
417 1.1 bouyer
418 1.1 bouyer if (rsize <= 0) {
419 1.1 bouyer rawread(oblkno, obuf, osize);
420 1.1 bouyer #ifdef DIAGNOSTICS
421 1.13 hannken if (cdesc[idx].cd_owner != getpid())
422 1.1 bouyer fprintf(stderr, "Owner changed from "
423 1.1 bouyer "%d to %d, can't happen\n",
424 1.13 hannken getpid(), cdesc[idx].cd_owner);
425 1.13 hannken cdesc[idx].cd_owner = 0;
426 1.1 bouyer #endif
427 1.1 bouyer break;
428 1.1 bouyer }
429 1.1 bouyer
430 1.1 bouyer /* On short read, just note the fact and go on */
431 1.13 hannken cdesc[idx].cd_blkend = blockBlkNo + rsize / dev_bsize;
432 1.1 bouyer
433 1.1 bouyer #ifdef STATS
434 1.1 bouyer nphysread++;
435 1.1 bouyer physreadsize += rsize;
436 1.1 bouyer #endif
437 1.1 bouyer #ifdef DIAGNOSTICS
438 1.13 hannken if (cdesc[idx].cd_owner != getpid())
439 1.1 bouyer fprintf(stderr, "Owner changed from "
440 1.1 bouyer "%d to %d, can't happen\n",
441 1.13 hannken getpid(), cdesc[idx].cd_owner);
442 1.13 hannken cdesc[idx].cd_owner = 0;
443 1.1 bouyer #endif
444 1.1 bouyer /*
445 1.1 bouyer * We swapped some of data in, let the loop fetch
446 1.1 bouyer * them from cache
447 1.1 bouyer */
448 1.1 bouyer }
449 1.1 bouyer }
450 1.10 lukem
451 1.1 bouyer if (flock(diskfd, LOCK_UN))
452 1.1 bouyer msg("flock(LOCK_UN) failed: %s\n",
453 1.1 bouyer strerror(errno));
454 1.1 bouyer }
455 1.1 bouyer
456 1.1 bouyer void
457 1.6 lukem printcachestats(void)
458 1.1 bouyer {
459 1.14 enami
460 1.1 bouyer #ifdef STATS
461 1.1 bouyer fprintf(stderr, "Pid %d: %d reads (%u bytes) "
462 1.1 bouyer "%d physical reads (%u bytes) %d%% hits, %d%% overhead\n",
463 1.1 bouyer getpid(), nreads, (u_int) readsize, nphysread,
464 1.1 bouyer (u_int) physreadsize, (nreads - nphysread) * 100 / nreads,
465 1.1 bouyer (int) (((physreadsize - readsize) * 100) / readsize));
466 1.1 bouyer #endif
467 1.1 bouyer }
468