]>
Commit | Line | Data |
---|---|---|
2bd0ea18 | 1 | /* |
0d3e0b37 | 2 | * Copyright (c) 2000-2001 Silicon Graphics, Inc. All Rights Reserved. |
dfc130f3 | 3 | * |
2bd0ea18 NS |
4 | * This program is free software; you can redistribute it and/or modify it |
5 | * under the terms of version 2 of the GNU General Public License as | |
6 | * published by the Free Software Foundation. | |
dfc130f3 | 7 | * |
2bd0ea18 NS |
8 | * This program is distributed in the hope that it would be useful, but |
9 | * WITHOUT ANY WARRANTY; without even the implied warranty of | |
10 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. | |
dfc130f3 | 11 | * |
2bd0ea18 NS |
12 | * Further, this software is distributed without any warranty that it is |
13 | * free of the rightful claim of any third person regarding infringement | |
14 | * or the like. Any license provided herein, whether implied or | |
15 | * otherwise, applies only to this software file. Patent licenses, if | |
16 | * any, provided herein do not apply to combinations of this program with | |
17 | * other software, or any other product whatsoever. | |
dfc130f3 | 18 | * |
2bd0ea18 NS |
19 | * You should have received a copy of the GNU General Public License along |
20 | * with this program; if not, write the Free Software Foundation, Inc., 59 | |
21 | * Temple Place - Suite 330, Boston MA 02111-1307, USA. | |
dfc130f3 | 22 | * |
2bd0ea18 NS |
23 | * Contact information: Silicon Graphics, Inc., 1600 Amphitheatre Pkwy, |
24 | * Mountain View, CA 94043, or: | |
dfc130f3 RC |
25 | * |
26 | * http://www.sgi.com | |
27 | * | |
28 | * For further information regarding this notice, see: | |
29 | * | |
2bd0ea18 NS |
30 | * http://oss.sgi.com/projects/GenInfo/SGIGPLNoticeExplan/ |
31 | */ | |
32 | ||
1d7e80ee | 33 | #include <xfs/libxfs.h> |
2bd0ea18 | 34 | #include "bmap.h" |
2bd0ea18 NS |
35 | #include "dbread.h" |
36 | #include "io.h" | |
4ca431fc | 37 | #include "init.h" |
2bd0ea18 NS |
38 | |
39 | int | |
40 | dbread(void *buf, int nblocks, xfs_fileoff_t bno, int whichfork) | |
41 | { | |
42 | bmap_ext_t bm; | |
43 | char *bp; | |
44 | xfs_dfiloff_t eb; | |
45 | xfs_dfiloff_t end; | |
46 | int i; | |
47 | int nex; | |
48 | ||
49 | nex = 1; | |
50 | end = bno + nblocks; | |
51 | bp = buf; | |
52 | while (bno < end) { | |
53 | bmap(bno, end - bno, whichfork, &nex, &bm); | |
54 | if (nex == 0) { | |
55 | bm.startoff = end; | |
56 | bm.blockcount = 1; | |
57 | } | |
58 | if (bm.startoff > bno) { | |
59 | eb = end < bm.startoff ? end : bm.startoff; | |
60 | i = (int)XFS_FSB_TO_B(mp, eb - bno); | |
61 | memset(bp, 0, i); | |
62 | bp += i; | |
63 | bno = eb; | |
64 | } | |
65 | if (bno == end) | |
66 | break; | |
67 | if (bno > bm.startoff) { | |
68 | bm.blockcount -= bno - bm.startoff; | |
69 | bm.startblock += bno - bm.startoff; | |
70 | bm.startoff = bno; | |
71 | } | |
72 | if (bm.startoff + bm.blockcount > end) | |
73 | bm.blockcount = end - bm.startoff; | |
74 | i = read_bbs(XFS_FSB_TO_DADDR(mp, bm.startblock), | |
75 | (int)XFS_FSB_TO_BB(mp, bm.blockcount), | |
76 | (void **)&bp, NULL); | |
77 | if (i) | |
78 | return i; | |
79 | bp += XFS_FSB_TO_B(mp, bm.blockcount); | |
80 | bno += bm.blockcount; | |
81 | } | |
82 | return 0; | |
83 | } |