Deleted Added
sdiff udiff text old ( 1817 ) new ( 10551 )
full compact
cd9660_bmap.c (1817) cd9660_bmap.c (10551)
1/*-
2 * Copyright (c) 1994
3 * The Regents of the University of California. All rights reserved.
4 *
5 * This code is derived from software contributed to Berkeley
6 * by Pace Willisson (pace@blitz.com). The Rock Ridge Extension
7 * Support code is derived from software contributed to Berkeley
8 * by Atsushi Murai (amurai@spec.co.jp).
9 *
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
12 * are met:
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. All advertising materials mentioning features or use of this software
19 * must display the following acknowledgement:
20 * This product includes software developed by the University of
21 * California, Berkeley and its contributors.
22 * 4. Neither the name of the University nor the names of its contributors
23 * may be used to endorse or promote products derived from this software
24 * without specific prior written permission.
25 *
26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * SUCH DAMAGE.
37 *
38 * @(#)cd9660_bmap.c 8.3 (Berkeley) 1/23/94
1/*-
2 * Copyright (c) 1994
3 * The Regents of the University of California. All rights reserved.
4 *
5 * This code is derived from software contributed to Berkeley
6 * by Pace Willisson (pace@blitz.com). The Rock Ridge Extension
7 * Support code is derived from software contributed to Berkeley
8 * by Atsushi Murai (amurai@spec.co.jp).
9 *
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
12 * are met:
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. All advertising materials mentioning features or use of this software
19 * must display the following acknowledgement:
20 * This product includes software developed by the University of
21 * California, Berkeley and its contributors.
22 * 4. Neither the name of the University nor the names of its contributors
23 * may be used to endorse or promote products derived from this software
24 * without specific prior written permission.
25 *
26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * SUCH DAMAGE.
37 *
38 * @(#)cd9660_bmap.c 8.3 (Berkeley) 1/23/94
39 * $Id$
39 * $Id: cd9660_bmap.c,v 1.2 1994/08/02 07:41:15 davidg Exp $
40 */
41
42#include <sys/param.h>
43#include <sys/namei.h>
44#include <sys/buf.h>
45#include <sys/file.h>
46#include <sys/vnode.h>
47#include <sys/mount.h>
48
49#include <isofs/cd9660/iso.h>
50#include <isofs/cd9660/cd9660_node.h>
51
52/*
53 * Bmap converts a the logical block number of a file to its physical block
54 * number on the disk. The conversion is done by using the logical block
55 * number to index into the data block (extent) for the file.
56 */
57int
58cd9660_bmap(ap)
59 struct vop_bmap_args /* {
60 struct vnode *a_vp;
61 daddr_t a_bn;
62 struct vnode **a_vpp;
63 daddr_t *a_bnp;
64 int *a_runp;
40 */
41
42#include <sys/param.h>
43#include <sys/namei.h>
44#include <sys/buf.h>
45#include <sys/file.h>
46#include <sys/vnode.h>
47#include <sys/mount.h>
48
49#include <isofs/cd9660/iso.h>
50#include <isofs/cd9660/cd9660_node.h>
51
52/*
53 * Bmap converts a the logical block number of a file to its physical block
54 * number on the disk. The conversion is done by using the logical block
55 * number to index into the data block (extent) for the file.
56 */
57int
58cd9660_bmap(ap)
59 struct vop_bmap_args /* {
60 struct vnode *a_vp;
61 daddr_t a_bn;
62 struct vnode **a_vpp;
63 daddr_t *a_bnp;
64 int *a_runp;
65 int *a_runb;
65 } */ *ap;
66{
67 struct iso_node *ip = VTOI(ap->a_vp);
68 daddr_t lblkno = ap->a_bn;
69 long bsize;
70
71 /*
72 * Check for underlying vnode requests and ensure that logical
73 * to physical mapping is requested.
74 */
75 if (ap->a_vpp != NULL)
76 *ap->a_vpp = ip->i_devvp;
77 if (ap->a_bnp == NULL)
78 return (0);
79
80 /*
81 * Compute the requested block number
82 */
83 bsize = ip->i_mnt->logical_block_size;
84 *ap->a_bnp = (ip->iso_start + lblkno) * btodb(bsize);
85
86 /*
87 * Determine maximum number of readahead blocks following the
88 * requested block.
89 */
90 if (ap->a_runp) {
91 int nblk;
92
93 nblk = (ip->i_size - (lblkno + 1) * bsize) / bsize;
94 if (nblk <= 0)
95 *ap->a_runp = 0;
96 else if (nblk >= MAXBSIZE/bsize)
97 *ap->a_runp = MAXBSIZE/bsize - 1;
98 else
99 *ap->a_runp = nblk;
100 }
101
66 } */ *ap;
67{
68 struct iso_node *ip = VTOI(ap->a_vp);
69 daddr_t lblkno = ap->a_bn;
70 long bsize;
71
72 /*
73 * Check for underlying vnode requests and ensure that logical
74 * to physical mapping is requested.
75 */
76 if (ap->a_vpp != NULL)
77 *ap->a_vpp = ip->i_devvp;
78 if (ap->a_bnp == NULL)
79 return (0);
80
81 /*
82 * Compute the requested block number
83 */
84 bsize = ip->i_mnt->logical_block_size;
85 *ap->a_bnp = (ip->iso_start + lblkno) * btodb(bsize);
86
87 /*
88 * Determine maximum number of readahead blocks following the
89 * requested block.
90 */
91 if (ap->a_runp) {
92 int nblk;
93
94 nblk = (ip->i_size - (lblkno + 1) * bsize) / bsize;
95 if (nblk <= 0)
96 *ap->a_runp = 0;
97 else if (nblk >= MAXBSIZE/bsize)
98 *ap->a_runp = MAXBSIZE/bsize - 1;
99 else
100 *ap->a_runp = nblk;
101 }
102
103 if (ap->a_runb) {
104 *ap->a_runb = 0;
105 }
106
102 return 0;
103}
107 return 0;
108}