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