2 * Copyright (c) 2010 Zheng Liu <lz@freebsd.org>
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 #include <sys/param.h>
30 #include <sys/systm.h>
31 #include <sys/types.h>
32 #include <sys/kernel.h>
33 #include <sys/malloc.h>
34 #include <sys/vnode.h>
39 #include <fs/ext2fs/ext2_mount.h>
40 #include <fs/ext2fs/fs.h>
41 #include <fs/ext2fs/inode.h>
42 #include <fs/ext2fs/ext2fs.h>
43 #include <fs/ext2fs/ext2_extents.h>
44 #include <fs/ext2fs/ext2_extern.h>
47 ext4_ext_binsearch_index(struct inode *ip, struct ext4_extent_path *path,
48 daddr_t lbn, daddr_t *first_lbn, daddr_t *last_lbn)
50 struct ext4_extent_header *ehp = path->ep_header;
51 struct ext4_extent_index *first, *last, *l, *r, *m;
53 first = (struct ext4_extent_index *)(char *)(ehp + 1);
54 last = first + ehp->eh_ecount - 1;
66 path->ep_sparse_ext.e_blk = *first_lbn;
67 path->ep_sparse_ext.e_len = first->ei_blk - *first_lbn;
68 path->ep_sparse_ext.e_start_hi = 0;
69 path->ep_sparse_ext.e_start_lo = 0;
70 path->ep_is_sparse = true;
73 path->ep_index = l - 1;
74 *first_lbn = path->ep_index->ei_blk;
75 if (path->ep_index < last)
76 *last_lbn = l->ei_blk - 1;
81 ext4_ext_binsearch(struct inode *ip, struct ext4_extent_path *path, daddr_t lbn,
82 daddr_t first_lbn, daddr_t last_lbn)
84 struct ext4_extent_header *ehp = path->ep_header;
85 struct ext4_extent *first, *l, *r, *m;
87 if (ehp->eh_ecount == 0)
90 first = (struct ext4_extent *)(char *)(ehp + 1);
92 r = first + ehp->eh_ecount - 1;
102 path->ep_sparse_ext.e_blk = first_lbn;
103 path->ep_sparse_ext.e_len = first->e_blk - first_lbn;
104 path->ep_sparse_ext.e_start_hi = 0;
105 path->ep_sparse_ext.e_start_lo = 0;
106 path->ep_is_sparse = true;
109 path->ep_ext = l - 1;
110 if (path->ep_ext->e_blk + path->ep_ext->e_len <= lbn) {
111 path->ep_sparse_ext.e_blk = path->ep_ext->e_blk +
113 if (l <= (first + ehp->eh_ecount - 1))
114 path->ep_sparse_ext.e_len = l->e_blk -
115 path->ep_sparse_ext.e_blk;
117 path->ep_sparse_ext.e_len = last_lbn -
118 path->ep_sparse_ext.e_blk + 1;
119 path->ep_sparse_ext.e_start_hi = 0;
120 path->ep_sparse_ext.e_start_lo = 0;
121 path->ep_is_sparse = true;
126 * Find a block in ext4 extent cache.
129 ext4_ext_in_cache(struct inode *ip, daddr_t lbn, struct ext4_extent *ep)
131 struct ext4_extent_cache *ecp;
132 int ret = EXT4_EXT_CACHE_NO;
134 ecp = &ip->i_ext_cache;
136 /* cache is invalid */
137 if (ecp->ec_type == EXT4_EXT_CACHE_NO)
140 if (lbn >= ecp->ec_blk && lbn < ecp->ec_blk + ecp->ec_len) {
141 ep->e_blk = ecp->ec_blk;
142 ep->e_start_lo = ecp->ec_start & 0xffffffff;
143 ep->e_start_hi = ecp->ec_start >> 32 & 0xffff;
144 ep->e_len = ecp->ec_len;
151 * Put an ext4_extent structure in ext4 cache.
154 ext4_ext_put_cache(struct inode *ip, struct ext4_extent *ep, int type)
156 struct ext4_extent_cache *ecp;
158 ecp = &ip->i_ext_cache;
160 ecp->ec_blk = ep->e_blk;
161 ecp->ec_len = ep->e_len;
162 ecp->ec_start = (daddr_t)ep->e_start_hi << 32 | ep->e_start_lo;
168 struct ext4_extent_path *
169 ext4_ext_find_extent(struct m_ext2fs *fs, struct inode *ip,
170 daddr_t lbn, struct ext4_extent_path *path)
172 struct ext4_extent_header *ehp;
177 ehp = (struct ext4_extent_header *)(char *)ip->i_db;
179 if (ehp->eh_magic != EXT4_EXT_MAGIC)
182 path->ep_header = ehp;
184 daddr_t first_lbn = 0;
185 daddr_t last_lbn = lblkno(ip->i_e2fs, ip->i_size);
187 for (i = ehp->eh_depth; i != 0; --i) {
190 if (ext4_ext_binsearch_index(ip, path, lbn, &first_lbn,
195 nblk = (daddr_t)path->ep_index->ei_leaf_hi << 32 |
196 path->ep_index->ei_leaf_lo;
197 size = blksize(fs, ip, nblk);
198 if (path->ep_bp != NULL) {
202 error = bread(ip->i_devvp, fsbtodb(fs, nblk), size, NOCRED,
209 ehp = (struct ext4_extent_header *)path->ep_bp->b_data;
210 path->ep_header = ehp;
215 path->ep_index = NULL;
216 path->ep_is_sparse = false;
218 ext4_ext_binsearch(ip, path, lbn, first_lbn, last_lbn);