Commit | Line | Data |
---|---|---|
1da177e4 | 1 | /* |
7b718769 | 2 | * Copyright (c) 2000-2002,2005 Silicon Graphics, Inc. |
f5f3d9b0 | 3 | * Copyright (c) 2013 Red Hat, Inc. |
7b718769 | 4 | * All Rights Reserved. |
1da177e4 | 5 | * |
7b718769 NS |
6 | * This program is free software; you can redistribute it and/or |
7 | * modify it under the terms of the GNU General Public License as | |
1da177e4 LT |
8 | * published by the Free Software Foundation. |
9 | * | |
7b718769 NS |
10 | * This program is distributed in the hope that it would be useful, |
11 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
12 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
13 | * GNU General Public License for more details. | |
1da177e4 | 14 | * |
7b718769 NS |
15 | * You should have received a copy of the GNU General Public License |
16 | * along with this program; if not, write the Free Software Foundation, | |
17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA | |
1da177e4 | 18 | */ |
1da177e4 | 19 | #include "xfs.h" |
a844f451 | 20 | #include "xfs_fs.h" |
a4fbe6ab | 21 | #include "xfs_format.h" |
239880ef DC |
22 | #include "xfs_log_format.h" |
23 | #include "xfs_trans_resv.h" | |
1da177e4 | 24 | #include "xfs_sb.h" |
da353b0d | 25 | #include "xfs_ag.h" |
1da177e4 | 26 | #include "xfs_mount.h" |
57062787 | 27 | #include "xfs_da_format.h" |
a844f451 | 28 | #include "xfs_da_btree.h" |
1da177e4 | 29 | #include "xfs_inode.h" |
2b9ab5ab | 30 | #include "xfs_dir2.h" |
57926640 | 31 | #include "xfs_dir2_priv.h" |
1da177e4 | 32 | #include "xfs_error.h" |
239880ef | 33 | #include "xfs_trans.h" |
33363fee DC |
34 | #include "xfs_buf_item.h" |
35 | #include "xfs_cksum.h" | |
1da177e4 | 36 | |
1da177e4 LT |
37 | /* |
38 | * Check the consistency of the data block. | |
39 | * The input can also be a block-format directory. | |
82025d7f | 40 | * Return 0 is the buffer is good, otherwise an error. |
1da177e4 | 41 | */ |
82025d7f | 42 | int |
33363fee | 43 | __xfs_dir3_data_check( |
1d9025e5 DC |
44 | struct xfs_inode *dp, /* incore inode pointer */ |
45 | struct xfs_buf *bp) /* data block's buffer */ | |
1da177e4 LT |
46 | { |
47 | xfs_dir2_dataptr_t addr; /* addr for leaf lookup */ | |
48 | xfs_dir2_data_free_t *bf; /* bestfree table */ | |
49 | xfs_dir2_block_tail_t *btp=NULL; /* block tail */ | |
50 | int count; /* count of entries found */ | |
c2066e26 | 51 | xfs_dir2_data_hdr_t *hdr; /* data block header */ |
1da177e4 LT |
52 | xfs_dir2_data_entry_t *dep; /* data entry */ |
53 | xfs_dir2_data_free_t *dfp; /* bestfree entry */ | |
54 | xfs_dir2_data_unused_t *dup; /* unused entry */ | |
55 | char *endp; /* end of useful data */ | |
56 | int freeseen; /* mask of bestfrees seen */ | |
57 | xfs_dahash_t hash; /* hash of current name */ | |
58 | int i; /* leaf index */ | |
59 | int lastfree; /* last entry was unused */ | |
60 | xfs_dir2_leaf_entry_t *lep=NULL; /* block leaf entries */ | |
61 | xfs_mount_t *mp; /* filesystem mount point */ | |
62 | char *p; /* current data position */ | |
63 | int stale; /* count of stale leaves */ | |
5163f95a | 64 | struct xfs_name name; |
9d23fc85 | 65 | const struct xfs_dir_ops *ops; |
1da177e4 | 66 | |
82025d7f | 67 | mp = bp->b_target->bt_mount; |
c2066e26 | 68 | |
9d23fc85 | 69 | /* |
4141956a DC |
70 | * We can be passed a null dp here from a verifier, so we need to go the |
71 | * hard way to get them. | |
9d23fc85 | 72 | */ |
4141956a | 73 | ops = xfs_dir_get_ops(mp, dp); |
9d23fc85 | 74 | |
a6293621 DC |
75 | hdr = bp->b_addr; |
76 | p = (char *)ops->data_entry_p(hdr); | |
77 | ||
82025d7f | 78 | switch (hdr->magic) { |
f5f3d9b0 | 79 | case cpu_to_be32(XFS_DIR3_BLOCK_MAGIC): |
82025d7f | 80 | case cpu_to_be32(XFS_DIR2_BLOCK_MAGIC): |
c2066e26 | 81 | btp = xfs_dir2_block_tail_p(mp, hdr); |
bbaaf538 | 82 | lep = xfs_dir2_block_leaf_p(btp); |
1da177e4 | 83 | endp = (char *)lep; |
a6293621 DC |
84 | |
85 | /* | |
86 | * The number of leaf entries is limited by the size of the | |
87 | * block and the amount of space used by the data entries. | |
88 | * We don't know how much space is used by the data entries yet, | |
89 | * so just ensure that the count falls somewhere inside the | |
90 | * block right now. | |
91 | */ | |
92 | XFS_WANT_CORRUPTED_RETURN(be32_to_cpu(btp->count) < | |
93 | ((char *)btp - p) / sizeof(struct xfs_dir2_leaf_entry)); | |
82025d7f | 94 | break; |
33363fee | 95 | case cpu_to_be32(XFS_DIR3_DATA_MAGIC): |
82025d7f | 96 | case cpu_to_be32(XFS_DIR2_DATA_MAGIC): |
c2066e26 | 97 | endp = (char *)hdr + mp->m_dirblksize; |
82025d7f DC |
98 | break; |
99 | default: | |
100 | XFS_ERROR_REPORT("Bad Magic", XFS_ERRLEVEL_LOW, mp); | |
101 | return EFSCORRUPTED; | |
c2066e26 CH |
102 | } |
103 | ||
1da177e4 LT |
104 | /* |
105 | * Account for zero bestfree entries. | |
106 | */ | |
a6293621 DC |
107 | bf = ops->data_bestfree_p(hdr); |
108 | count = lastfree = freeseen = 0; | |
1da177e4 | 109 | if (!bf[0].length) { |
82025d7f | 110 | XFS_WANT_CORRUPTED_RETURN(!bf[0].offset); |
1da177e4 LT |
111 | freeseen |= 1 << 0; |
112 | } | |
113 | if (!bf[1].length) { | |
82025d7f | 114 | XFS_WANT_CORRUPTED_RETURN(!bf[1].offset); |
1da177e4 LT |
115 | freeseen |= 1 << 1; |
116 | } | |
117 | if (!bf[2].length) { | |
82025d7f | 118 | XFS_WANT_CORRUPTED_RETURN(!bf[2].offset); |
1da177e4 LT |
119 | freeseen |= 1 << 2; |
120 | } | |
82025d7f DC |
121 | |
122 | XFS_WANT_CORRUPTED_RETURN(be16_to_cpu(bf[0].length) >= | |
123 | be16_to_cpu(bf[1].length)); | |
124 | XFS_WANT_CORRUPTED_RETURN(be16_to_cpu(bf[1].length) >= | |
125 | be16_to_cpu(bf[2].length)); | |
1da177e4 LT |
126 | /* |
127 | * Loop over the data/unused entries. | |
128 | */ | |
129 | while (p < endp) { | |
130 | dup = (xfs_dir2_data_unused_t *)p; | |
131 | /* | |
132 | * If it's unused, look for the space in the bestfree table. | |
133 | * If we find it, account for that, else make sure it | |
134 | * doesn't need to be there. | |
135 | */ | |
ad354eb3 | 136 | if (be16_to_cpu(dup->freetag) == XFS_DIR2_DATA_FREE_TAG) { |
82025d7f DC |
137 | XFS_WANT_CORRUPTED_RETURN(lastfree == 0); |
138 | XFS_WANT_CORRUPTED_RETURN( | |
139 | be16_to_cpu(*xfs_dir2_data_unused_tag_p(dup)) == | |
140 | (char *)dup - (char *)hdr); | |
2ca98774 | 141 | dfp = xfs_dir2_data_freefind(hdr, bf, dup); |
1da177e4 LT |
142 | if (dfp) { |
143 | i = (int)(dfp - bf); | |
82025d7f DC |
144 | XFS_WANT_CORRUPTED_RETURN( |
145 | (freeseen & (1 << i)) == 0); | |
1da177e4 | 146 | freeseen |= 1 << i; |
70e73f59 | 147 | } else { |
82025d7f DC |
148 | XFS_WANT_CORRUPTED_RETURN( |
149 | be16_to_cpu(dup->length) <= | |
150 | be16_to_cpu(bf[2].length)); | |
70e73f59 | 151 | } |
ad354eb3 | 152 | p += be16_to_cpu(dup->length); |
1da177e4 LT |
153 | lastfree = 1; |
154 | continue; | |
155 | } | |
156 | /* | |
157 | * It's a real entry. Validate the fields. | |
158 | * If this is a block directory then make sure it's | |
159 | * in the leaf section of the block. | |
160 | * The linear search is crude but this is DEBUG code. | |
161 | */ | |
162 | dep = (xfs_dir2_data_entry_t *)p; | |
82025d7f DC |
163 | XFS_WANT_CORRUPTED_RETURN(dep->namelen != 0); |
164 | XFS_WANT_CORRUPTED_RETURN( | |
165 | !xfs_dir_ino_validate(mp, be64_to_cpu(dep->inumber))); | |
166 | XFS_WANT_CORRUPTED_RETURN( | |
9d23fc85 | 167 | be16_to_cpu(*ops->data_entry_tag_p(dep)) == |
82025d7f | 168 | (char *)dep - (char *)hdr); |
1c55cece | 169 | XFS_WANT_CORRUPTED_RETURN( |
9d23fc85 | 170 | ops->data_get_ftype(dep) < XFS_DIR3_FT_MAX); |
1da177e4 LT |
171 | count++; |
172 | lastfree = 0; | |
f5f3d9b0 DC |
173 | if (hdr->magic == cpu_to_be32(XFS_DIR2_BLOCK_MAGIC) || |
174 | hdr->magic == cpu_to_be32(XFS_DIR3_BLOCK_MAGIC)) { | |
bbaaf538 | 175 | addr = xfs_dir2_db_off_to_dataptr(mp, mp->m_dirdatablk, |
1da177e4 | 176 | (xfs_dir2_data_aoff_t) |
c2066e26 | 177 | ((char *)dep - (char *)hdr)); |
5163f95a BN |
178 | name.name = dep->name; |
179 | name.len = dep->namelen; | |
180 | hash = mp->m_dirnameops->hashname(&name); | |
e922fffa | 181 | for (i = 0; i < be32_to_cpu(btp->count); i++) { |
3c1f9c15 NS |
182 | if (be32_to_cpu(lep[i].address) == addr && |
183 | be32_to_cpu(lep[i].hashval) == hash) | |
1da177e4 LT |
184 | break; |
185 | } | |
82025d7f | 186 | XFS_WANT_CORRUPTED_RETURN(i < be32_to_cpu(btp->count)); |
1da177e4 | 187 | } |
9d23fc85 | 188 | p += ops->data_entsize(dep->namelen); |
1da177e4 LT |
189 | } |
190 | /* | |
191 | * Need to have seen all the entries and all the bestfree slots. | |
192 | */ | |
82025d7f | 193 | XFS_WANT_CORRUPTED_RETURN(freeseen == 7); |
f5f3d9b0 DC |
194 | if (hdr->magic == cpu_to_be32(XFS_DIR2_BLOCK_MAGIC) || |
195 | hdr->magic == cpu_to_be32(XFS_DIR3_BLOCK_MAGIC)) { | |
e922fffa | 196 | for (i = stale = 0; i < be32_to_cpu(btp->count); i++) { |
69ef921b CH |
197 | if (lep[i].address == |
198 | cpu_to_be32(XFS_DIR2_NULL_DATAPTR)) | |
1da177e4 LT |
199 | stale++; |
200 | if (i > 0) | |
82025d7f DC |
201 | XFS_WANT_CORRUPTED_RETURN( |
202 | be32_to_cpu(lep[i].hashval) >= | |
203 | be32_to_cpu(lep[i - 1].hashval)); | |
1da177e4 | 204 | } |
82025d7f DC |
205 | XFS_WANT_CORRUPTED_RETURN(count == |
206 | be32_to_cpu(btp->count) - be32_to_cpu(btp->stale)); | |
207 | XFS_WANT_CORRUPTED_RETURN(stale == be32_to_cpu(btp->stale)); | |
1da177e4 | 208 | } |
82025d7f | 209 | return 0; |
1da177e4 | 210 | } |
1da177e4 | 211 | |
33363fee DC |
212 | static bool |
213 | xfs_dir3_data_verify( | |
e4813572 DC |
214 | struct xfs_buf *bp) |
215 | { | |
216 | struct xfs_mount *mp = bp->b_target->bt_mount; | |
33363fee | 217 | struct xfs_dir3_blk_hdr *hdr3 = bp->b_addr; |
e4813572 | 218 | |
33363fee DC |
219 | if (xfs_sb_version_hascrc(&mp->m_sb)) { |
220 | if (hdr3->magic != cpu_to_be32(XFS_DIR3_DATA_MAGIC)) | |
221 | return false; | |
222 | if (!uuid_equal(&hdr3->uuid, &mp->m_sb.sb_uuid)) | |
223 | return false; | |
224 | if (be64_to_cpu(hdr3->blkno) != bp->b_bn) | |
225 | return false; | |
226 | } else { | |
227 | if (hdr3->magic != cpu_to_be32(XFS_DIR2_DATA_MAGIC)) | |
228 | return false; | |
e4813572 | 229 | } |
33363fee DC |
230 | if (__xfs_dir3_data_check(NULL, bp)) |
231 | return false; | |
232 | return true; | |
612cfbfe DC |
233 | } |
234 | ||
1813dd64 DC |
235 | /* |
236 | * Readahead of the first block of the directory when it is opened is completely | |
237 | * oblivious to the format of the directory. Hence we can either get a block | |
238 | * format buffer or a data format buffer on readahead. | |
239 | */ | |
240 | static void | |
33363fee | 241 | xfs_dir3_data_reada_verify( |
1813dd64 DC |
242 | struct xfs_buf *bp) |
243 | { | |
1813dd64 DC |
244 | struct xfs_dir2_data_hdr *hdr = bp->b_addr; |
245 | ||
246 | switch (hdr->magic) { | |
247 | case cpu_to_be32(XFS_DIR2_BLOCK_MAGIC): | |
f5f3d9b0 DC |
248 | case cpu_to_be32(XFS_DIR3_BLOCK_MAGIC): |
249 | bp->b_ops = &xfs_dir3_block_buf_ops; | |
1813dd64 DC |
250 | bp->b_ops->verify_read(bp); |
251 | return; | |
252 | case cpu_to_be32(XFS_DIR2_DATA_MAGIC): | |
33363fee DC |
253 | case cpu_to_be32(XFS_DIR3_DATA_MAGIC): |
254 | xfs_dir3_data_verify(bp); | |
1813dd64 DC |
255 | return; |
256 | default: | |
1813dd64 | 257 | xfs_buf_ioerror(bp, EFSCORRUPTED); |
ce5028cf | 258 | xfs_verifier_error(bp); |
1813dd64 DC |
259 | break; |
260 | } | |
261 | } | |
262 | ||
263 | static void | |
33363fee | 264 | xfs_dir3_data_read_verify( |
612cfbfe DC |
265 | struct xfs_buf *bp) |
266 | { | |
33363fee DC |
267 | struct xfs_mount *mp = bp->b_target->bt_mount; |
268 | ||
ce5028cf ES |
269 | if (xfs_sb_version_hascrc(&mp->m_sb) && |
270 | !xfs_buf_verify_cksum(bp, XFS_DIR3_DATA_CRC_OFF)) | |
271 | xfs_buf_ioerror(bp, EFSBADCRC); | |
272 | else if (!xfs_dir3_data_verify(bp)) | |
33363fee | 273 | xfs_buf_ioerror(bp, EFSCORRUPTED); |
ce5028cf ES |
274 | |
275 | if (bp->b_error) | |
276 | xfs_verifier_error(bp); | |
612cfbfe | 277 | } |
e4813572 | 278 | |
b0f539de | 279 | static void |
33363fee | 280 | xfs_dir3_data_write_verify( |
612cfbfe DC |
281 | struct xfs_buf *bp) |
282 | { | |
33363fee DC |
283 | struct xfs_mount *mp = bp->b_target->bt_mount; |
284 | struct xfs_buf_log_item *bip = bp->b_fspriv; | |
285 | struct xfs_dir3_blk_hdr *hdr3 = bp->b_addr; | |
286 | ||
287 | if (!xfs_dir3_data_verify(bp)) { | |
33363fee | 288 | xfs_buf_ioerror(bp, EFSCORRUPTED); |
ce5028cf | 289 | xfs_verifier_error(bp); |
33363fee DC |
290 | return; |
291 | } | |
292 | ||
293 | if (!xfs_sb_version_hascrc(&mp->m_sb)) | |
294 | return; | |
295 | ||
296 | if (bip) | |
297 | hdr3->lsn = cpu_to_be64(bip->bli_item.li_lsn); | |
298 | ||
f1dbcd7e | 299 | xfs_buf_update_cksum(bp, XFS_DIR3_DATA_CRC_OFF); |
e4813572 DC |
300 | } |
301 | ||
33363fee DC |
302 | const struct xfs_buf_ops xfs_dir3_data_buf_ops = { |
303 | .verify_read = xfs_dir3_data_read_verify, | |
304 | .verify_write = xfs_dir3_data_write_verify, | |
1813dd64 DC |
305 | }; |
306 | ||
33363fee DC |
307 | static const struct xfs_buf_ops xfs_dir3_data_reada_buf_ops = { |
308 | .verify_read = xfs_dir3_data_reada_verify, | |
309 | .verify_write = xfs_dir3_data_write_verify, | |
1813dd64 DC |
310 | }; |
311 | ||
612cfbfe | 312 | |
e4813572 | 313 | int |
33363fee | 314 | xfs_dir3_data_read( |
e4813572 DC |
315 | struct xfs_trans *tp, |
316 | struct xfs_inode *dp, | |
317 | xfs_dablk_t bno, | |
318 | xfs_daddr_t mapped_bno, | |
319 | struct xfs_buf **bpp) | |
320 | { | |
d75afeb3 DC |
321 | int err; |
322 | ||
323 | err = xfs_da_read_buf(tp, dp, bno, mapped_bno, bpp, | |
33363fee | 324 | XFS_DATA_FORK, &xfs_dir3_data_buf_ops); |
d75afeb3 | 325 | if (!err && tp) |
61fe135c | 326 | xfs_trans_buf_set_type(tp, *bpp, XFS_BLFT_DIR_DATA_BUF); |
d75afeb3 | 327 | return err; |
e4813572 DC |
328 | } |
329 | ||
da6958c8 | 330 | int |
33363fee | 331 | xfs_dir3_data_readahead( |
da6958c8 DC |
332 | struct xfs_trans *tp, |
333 | struct xfs_inode *dp, | |
334 | xfs_dablk_t bno, | |
335 | xfs_daddr_t mapped_bno) | |
336 | { | |
337 | return xfs_da_reada_buf(tp, dp, bno, mapped_bno, | |
33363fee | 338 | XFS_DATA_FORK, &xfs_dir3_data_reada_buf_ops); |
da6958c8 DC |
339 | } |
340 | ||
1da177e4 LT |
341 | /* |
342 | * Given a data block and an unused entry from that block, | |
343 | * return the bestfree entry if any that corresponds to it. | |
344 | */ | |
2b9ab5ab | 345 | xfs_dir2_data_free_t * |
1da177e4 | 346 | xfs_dir2_data_freefind( |
2ca98774 DC |
347 | struct xfs_dir2_data_hdr *hdr, /* data block header */ |
348 | struct xfs_dir2_data_free *bf, /* bestfree table pointer */ | |
349 | struct xfs_dir2_data_unused *dup) /* unused space */ | |
1da177e4 LT |
350 | { |
351 | xfs_dir2_data_free_t *dfp; /* bestfree entry */ | |
352 | xfs_dir2_data_aoff_t off; /* offset value needed */ | |
b49a0c18 | 353 | #ifdef DEBUG |
1da177e4 LT |
354 | int matched; /* matched the value */ |
355 | int seenzero; /* saw a 0 bestfree entry */ | |
356 | #endif | |
357 | ||
c2066e26 | 358 | off = (xfs_dir2_data_aoff_t)((char *)dup - (char *)hdr); |
f5f3d9b0 | 359 | |
b49a0c18 | 360 | #ifdef DEBUG |
1da177e4 LT |
361 | /* |
362 | * Validate some consistency in the bestfree table. | |
363 | * Check order, non-overlapping entries, and if we find the | |
364 | * one we're looking for it has to be exact. | |
365 | */ | |
69ef921b | 366 | ASSERT(hdr->magic == cpu_to_be32(XFS_DIR2_DATA_MAGIC) || |
33363fee | 367 | hdr->magic == cpu_to_be32(XFS_DIR3_DATA_MAGIC) || |
f5f3d9b0 DC |
368 | hdr->magic == cpu_to_be32(XFS_DIR2_BLOCK_MAGIC) || |
369 | hdr->magic == cpu_to_be32(XFS_DIR3_BLOCK_MAGIC)); | |
370 | for (dfp = &bf[0], seenzero = matched = 0; | |
371 | dfp < &bf[XFS_DIR2_DATA_FD_COUNT]; | |
1da177e4 LT |
372 | dfp++) { |
373 | if (!dfp->offset) { | |
374 | ASSERT(!dfp->length); | |
375 | seenzero = 1; | |
376 | continue; | |
377 | } | |
378 | ASSERT(seenzero == 0); | |
70e73f59 | 379 | if (be16_to_cpu(dfp->offset) == off) { |
1da177e4 | 380 | matched = 1; |
ad354eb3 | 381 | ASSERT(dfp->length == dup->length); |
70e73f59 | 382 | } else if (off < be16_to_cpu(dfp->offset)) |
ad354eb3 | 383 | ASSERT(off + be16_to_cpu(dup->length) <= be16_to_cpu(dfp->offset)); |
1da177e4 | 384 | else |
70e73f59 | 385 | ASSERT(be16_to_cpu(dfp->offset) + be16_to_cpu(dfp->length) <= off); |
ad354eb3 | 386 | ASSERT(matched || be16_to_cpu(dfp->length) >= be16_to_cpu(dup->length)); |
f5f3d9b0 | 387 | if (dfp > &bf[0]) |
70e73f59 | 388 | ASSERT(be16_to_cpu(dfp[-1].length) >= be16_to_cpu(dfp[0].length)); |
1da177e4 LT |
389 | } |
390 | #endif | |
391 | /* | |
392 | * If this is smaller than the smallest bestfree entry, | |
393 | * it can't be there since they're sorted. | |
394 | */ | |
ad354eb3 | 395 | if (be16_to_cpu(dup->length) < |
f5f3d9b0 | 396 | be16_to_cpu(bf[XFS_DIR2_DATA_FD_COUNT - 1].length)) |
1da177e4 LT |
397 | return NULL; |
398 | /* | |
399 | * Look at the three bestfree entries for our guy. | |
400 | */ | |
f5f3d9b0 | 401 | for (dfp = &bf[0]; dfp < &bf[XFS_DIR2_DATA_FD_COUNT]; dfp++) { |
1da177e4 LT |
402 | if (!dfp->offset) |
403 | return NULL; | |
70e73f59 | 404 | if (be16_to_cpu(dfp->offset) == off) |
1da177e4 LT |
405 | return dfp; |
406 | } | |
407 | /* | |
408 | * Didn't find it. This only happens if there are duplicate lengths. | |
409 | */ | |
410 | return NULL; | |
411 | } | |
412 | ||
413 | /* | |
414 | * Insert an unused-space entry into the bestfree table. | |
415 | */ | |
416 | xfs_dir2_data_free_t * /* entry inserted */ | |
417 | xfs_dir2_data_freeinsert( | |
2ca98774 DC |
418 | struct xfs_dir2_data_hdr *hdr, /* data block pointer */ |
419 | struct xfs_dir2_data_free *dfp, /* bestfree table pointer */ | |
420 | struct xfs_dir2_data_unused *dup, /* unused space */ | |
1da177e4 LT |
421 | int *loghead) /* log the data header (out) */ |
422 | { | |
1da177e4 LT |
423 | xfs_dir2_data_free_t new; /* new bestfree entry */ |
424 | ||
69ef921b | 425 | ASSERT(hdr->magic == cpu_to_be32(XFS_DIR2_DATA_MAGIC) || |
f5f3d9b0 DC |
426 | hdr->magic == cpu_to_be32(XFS_DIR2_BLOCK_MAGIC) || |
427 | hdr->magic == cpu_to_be32(XFS_DIR3_DATA_MAGIC) || | |
428 | hdr->magic == cpu_to_be32(XFS_DIR3_BLOCK_MAGIC)); | |
429 | ||
70e73f59 | 430 | new.length = dup->length; |
c2066e26 CH |
431 | new.offset = cpu_to_be16((char *)dup - (char *)hdr); |
432 | ||
1da177e4 LT |
433 | /* |
434 | * Insert at position 0, 1, or 2; or not at all. | |
435 | */ | |
70e73f59 | 436 | if (be16_to_cpu(new.length) > be16_to_cpu(dfp[0].length)) { |
1da177e4 LT |
437 | dfp[2] = dfp[1]; |
438 | dfp[1] = dfp[0]; | |
439 | dfp[0] = new; | |
440 | *loghead = 1; | |
441 | return &dfp[0]; | |
442 | } | |
70e73f59 | 443 | if (be16_to_cpu(new.length) > be16_to_cpu(dfp[1].length)) { |
1da177e4 LT |
444 | dfp[2] = dfp[1]; |
445 | dfp[1] = new; | |
446 | *loghead = 1; | |
447 | return &dfp[1]; | |
448 | } | |
70e73f59 | 449 | if (be16_to_cpu(new.length) > be16_to_cpu(dfp[2].length)) { |
1da177e4 LT |
450 | dfp[2] = new; |
451 | *loghead = 1; | |
452 | return &dfp[2]; | |
453 | } | |
454 | return NULL; | |
455 | } | |
456 | ||
457 | /* | |
458 | * Remove a bestfree entry from the table. | |
459 | */ | |
ba0f32d4 | 460 | STATIC void |
1da177e4 | 461 | xfs_dir2_data_freeremove( |
2ca98774 DC |
462 | struct xfs_dir2_data_hdr *hdr, /* data block header */ |
463 | struct xfs_dir2_data_free *bf, /* bestfree table pointer */ | |
464 | struct xfs_dir2_data_free *dfp, /* bestfree entry pointer */ | |
1da177e4 LT |
465 | int *loghead) /* out: log data header */ |
466 | { | |
f5f3d9b0 | 467 | |
69ef921b | 468 | ASSERT(hdr->magic == cpu_to_be32(XFS_DIR2_DATA_MAGIC) || |
f5f3d9b0 DC |
469 | hdr->magic == cpu_to_be32(XFS_DIR2_BLOCK_MAGIC) || |
470 | hdr->magic == cpu_to_be32(XFS_DIR3_DATA_MAGIC) || | |
471 | hdr->magic == cpu_to_be32(XFS_DIR3_BLOCK_MAGIC)); | |
472 | ||
1da177e4 LT |
473 | /* |
474 | * It's the first entry, slide the next 2 up. | |
475 | */ | |
f5f3d9b0 DC |
476 | if (dfp == &bf[0]) { |
477 | bf[0] = bf[1]; | |
478 | bf[1] = bf[2]; | |
1da177e4 LT |
479 | } |
480 | /* | |
481 | * It's the second entry, slide the 3rd entry up. | |
482 | */ | |
f5f3d9b0 DC |
483 | else if (dfp == &bf[1]) |
484 | bf[1] = bf[2]; | |
1da177e4 LT |
485 | /* |
486 | * Must be the last entry. | |
487 | */ | |
488 | else | |
f5f3d9b0 | 489 | ASSERT(dfp == &bf[2]); |
1da177e4 LT |
490 | /* |
491 | * Clear the 3rd entry, must be zero now. | |
492 | */ | |
f5f3d9b0 DC |
493 | bf[2].length = 0; |
494 | bf[2].offset = 0; | |
1da177e4 LT |
495 | *loghead = 1; |
496 | } | |
497 | ||
498 | /* | |
499 | * Given a data block, reconstruct its bestfree map. | |
500 | */ | |
501 | void | |
502 | xfs_dir2_data_freescan( | |
9d23fc85 DC |
503 | struct xfs_inode *dp, |
504 | struct xfs_dir2_data_hdr *hdr, | |
505 | int *loghead) | |
1da177e4 LT |
506 | { |
507 | xfs_dir2_block_tail_t *btp; /* block tail */ | |
508 | xfs_dir2_data_entry_t *dep; /* active data entry */ | |
509 | xfs_dir2_data_unused_t *dup; /* unused data entry */ | |
f5f3d9b0 | 510 | struct xfs_dir2_data_free *bf; |
1da177e4 LT |
511 | char *endp; /* end of block's data */ |
512 | char *p; /* current entry pointer */ | |
513 | ||
69ef921b | 514 | ASSERT(hdr->magic == cpu_to_be32(XFS_DIR2_DATA_MAGIC) || |
33363fee | 515 | hdr->magic == cpu_to_be32(XFS_DIR3_DATA_MAGIC) || |
f5f3d9b0 DC |
516 | hdr->magic == cpu_to_be32(XFS_DIR2_BLOCK_MAGIC) || |
517 | hdr->magic == cpu_to_be32(XFS_DIR3_BLOCK_MAGIC)); | |
518 | ||
1da177e4 LT |
519 | /* |
520 | * Start by clearing the table. | |
521 | */ | |
2ca98774 | 522 | bf = dp->d_ops->data_bestfree_p(hdr); |
f5f3d9b0 | 523 | memset(bf, 0, sizeof(*bf) * XFS_DIR2_DATA_FD_COUNT); |
1da177e4 LT |
524 | *loghead = 1; |
525 | /* | |
526 | * Set up pointers. | |
527 | */ | |
2ca98774 | 528 | p = (char *)dp->d_ops->data_entry_p(hdr); |
f5f3d9b0 DC |
529 | if (hdr->magic == cpu_to_be32(XFS_DIR2_BLOCK_MAGIC) || |
530 | hdr->magic == cpu_to_be32(XFS_DIR3_BLOCK_MAGIC)) { | |
9d23fc85 | 531 | btp = xfs_dir2_block_tail_p(dp->i_mount, hdr); |
bbaaf538 | 532 | endp = (char *)xfs_dir2_block_leaf_p(btp); |
1da177e4 | 533 | } else |
9d23fc85 | 534 | endp = (char *)hdr + dp->i_mount->m_dirblksize; |
1da177e4 LT |
535 | /* |
536 | * Loop over the block's entries. | |
537 | */ | |
538 | while (p < endp) { | |
539 | dup = (xfs_dir2_data_unused_t *)p; | |
540 | /* | |
541 | * If it's a free entry, insert it. | |
542 | */ | |
ad354eb3 | 543 | if (be16_to_cpu(dup->freetag) == XFS_DIR2_DATA_FREE_TAG) { |
c2066e26 | 544 | ASSERT((char *)dup - (char *)hdr == |
bbaaf538 | 545 | be16_to_cpu(*xfs_dir2_data_unused_tag_p(dup))); |
2ca98774 | 546 | xfs_dir2_data_freeinsert(hdr, bf, dup, loghead); |
ad354eb3 | 547 | p += be16_to_cpu(dup->length); |
1da177e4 LT |
548 | } |
549 | /* | |
550 | * For active entries, check their tags and skip them. | |
551 | */ | |
552 | else { | |
553 | dep = (xfs_dir2_data_entry_t *)p; | |
c2066e26 | 554 | ASSERT((char *)dep - (char *)hdr == |
9d23fc85 DC |
555 | be16_to_cpu(*dp->d_ops->data_entry_tag_p(dep))); |
556 | p += dp->d_ops->data_entsize(dep->namelen); | |
1da177e4 LT |
557 | } |
558 | } | |
559 | } | |
560 | ||
561 | /* | |
562 | * Initialize a data block at the given block number in the directory. | |
563 | * Give back the buffer for the created block. | |
564 | */ | |
565 | int /* error */ | |
f5f3d9b0 | 566 | xfs_dir3_data_init( |
1da177e4 LT |
567 | xfs_da_args_t *args, /* directory operation args */ |
568 | xfs_dir2_db_t blkno, /* logical dir block number */ | |
1d9025e5 | 569 | struct xfs_buf **bpp) /* output block buffer */ |
1da177e4 | 570 | { |
1d9025e5 | 571 | struct xfs_buf *bp; /* block buffer */ |
c2066e26 | 572 | xfs_dir2_data_hdr_t *hdr; /* data block header */ |
1da177e4 LT |
573 | xfs_inode_t *dp; /* incore directory inode */ |
574 | xfs_dir2_data_unused_t *dup; /* unused entry pointer */ | |
f5f3d9b0 | 575 | struct xfs_dir2_data_free *bf; |
1da177e4 LT |
576 | int error; /* error return value */ |
577 | int i; /* bestfree index */ | |
578 | xfs_mount_t *mp; /* filesystem mount point */ | |
579 | xfs_trans_t *tp; /* transaction pointer */ | |
580 | int t; /* temp */ | |
581 | ||
582 | dp = args->dp; | |
583 | mp = dp->i_mount; | |
584 | tp = args->trans; | |
585 | /* | |
586 | * Get the buffer set up for the block. | |
587 | */ | |
bbaaf538 | 588 | error = xfs_da_get_buf(tp, dp, xfs_dir2_db_to_da(mp, blkno), -1, &bp, |
1da177e4 | 589 | XFS_DATA_FORK); |
b0f539de | 590 | if (error) |
1da177e4 | 591 | return error; |
33363fee | 592 | bp->b_ops = &xfs_dir3_data_buf_ops; |
61fe135c | 593 | xfs_trans_buf_set_type(tp, bp, XFS_BLFT_DIR_DATA_BUF); |
c2066e26 | 594 | |
1da177e4 LT |
595 | /* |
596 | * Initialize the header. | |
597 | */ | |
1d9025e5 | 598 | hdr = bp->b_addr; |
f5f3d9b0 DC |
599 | if (xfs_sb_version_hascrc(&mp->m_sb)) { |
600 | struct xfs_dir3_blk_hdr *hdr3 = bp->b_addr; | |
601 | ||
602 | memset(hdr3, 0, sizeof(*hdr3)); | |
603 | hdr3->magic = cpu_to_be32(XFS_DIR3_DATA_MAGIC); | |
604 | hdr3->blkno = cpu_to_be64(bp->b_bn); | |
605 | hdr3->owner = cpu_to_be64(dp->i_ino); | |
606 | uuid_copy(&hdr3->uuid, &mp->m_sb.sb_uuid); | |
607 | ||
608 | } else | |
609 | hdr->magic = cpu_to_be32(XFS_DIR2_DATA_MAGIC); | |
610 | ||
2ca98774 | 611 | bf = dp->d_ops->data_bestfree_p(hdr); |
1c9a5b2e | 612 | bf[0].offset = cpu_to_be16(dp->d_ops->data_entry_offset); |
1da177e4 | 613 | for (i = 1; i < XFS_DIR2_DATA_FD_COUNT; i++) { |
f5f3d9b0 DC |
614 | bf[i].length = 0; |
615 | bf[i].offset = 0; | |
1da177e4 | 616 | } |
c2066e26 | 617 | |
1da177e4 LT |
618 | /* |
619 | * Set up an unused entry for the block's body. | |
620 | */ | |
2ca98774 | 621 | dup = dp->d_ops->data_unused_p(hdr); |
ad354eb3 | 622 | dup->freetag = cpu_to_be16(XFS_DIR2_DATA_FREE_TAG); |
1da177e4 | 623 | |
1c9a5b2e | 624 | t = mp->m_dirblksize - (uint)dp->d_ops->data_entry_offset; |
f5f3d9b0 | 625 | bf[0].length = cpu_to_be16(t); |
ad354eb3 | 626 | dup->length = cpu_to_be16(t); |
c2066e26 | 627 | *xfs_dir2_data_unused_tag_p(dup) = cpu_to_be16((char *)dup - (char *)hdr); |
1da177e4 LT |
628 | /* |
629 | * Log it and return it. | |
630 | */ | |
2ca98774 | 631 | xfs_dir2_data_log_header(tp, dp, bp); |
1da177e4 LT |
632 | xfs_dir2_data_log_unused(tp, bp, dup); |
633 | *bpp = bp; | |
634 | return 0; | |
635 | } | |
636 | ||
637 | /* | |
638 | * Log an active data entry from the block. | |
639 | */ | |
640 | void | |
641 | xfs_dir2_data_log_entry( | |
1d9025e5 | 642 | struct xfs_trans *tp, |
9d23fc85 | 643 | struct xfs_inode *dp, |
1d9025e5 | 644 | struct xfs_buf *bp, |
1da177e4 LT |
645 | xfs_dir2_data_entry_t *dep) /* data entry pointer */ |
646 | { | |
0cb97766 | 647 | struct xfs_dir2_data_hdr *hdr = bp->b_addr; |
1da177e4 | 648 | |
69ef921b | 649 | ASSERT(hdr->magic == cpu_to_be32(XFS_DIR2_DATA_MAGIC) || |
33363fee | 650 | hdr->magic == cpu_to_be32(XFS_DIR3_DATA_MAGIC) || |
f5f3d9b0 DC |
651 | hdr->magic == cpu_to_be32(XFS_DIR2_BLOCK_MAGIC) || |
652 | hdr->magic == cpu_to_be32(XFS_DIR3_BLOCK_MAGIC)); | |
c2066e26 | 653 | |
1d9025e5 | 654 | xfs_trans_log_buf(tp, bp, (uint)((char *)dep - (char *)hdr), |
9d23fc85 | 655 | (uint)((char *)(dp->d_ops->data_entry_tag_p(dep) + 1) - |
c2066e26 | 656 | (char *)hdr - 1)); |
1da177e4 LT |
657 | } |
658 | ||
659 | /* | |
660 | * Log a data block header. | |
661 | */ | |
662 | void | |
663 | xfs_dir2_data_log_header( | |
1d9025e5 | 664 | struct xfs_trans *tp, |
2ca98774 | 665 | struct xfs_inode *dp, |
1d9025e5 | 666 | struct xfs_buf *bp) |
1da177e4 | 667 | { |
2ca98774 DC |
668 | #ifdef DEBUG |
669 | struct xfs_dir2_data_hdr *hdr = bp->b_addr; | |
1da177e4 | 670 | |
69ef921b | 671 | ASSERT(hdr->magic == cpu_to_be32(XFS_DIR2_DATA_MAGIC) || |
33363fee | 672 | hdr->magic == cpu_to_be32(XFS_DIR3_DATA_MAGIC) || |
f5f3d9b0 DC |
673 | hdr->magic == cpu_to_be32(XFS_DIR2_BLOCK_MAGIC) || |
674 | hdr->magic == cpu_to_be32(XFS_DIR3_BLOCK_MAGIC)); | |
2ca98774 | 675 | #endif |
c2066e26 | 676 | |
1c9a5b2e | 677 | xfs_trans_log_buf(tp, bp, 0, dp->d_ops->data_entry_offset - 1); |
1da177e4 LT |
678 | } |
679 | ||
680 | /* | |
681 | * Log a data unused entry. | |
682 | */ | |
683 | void | |
684 | xfs_dir2_data_log_unused( | |
1d9025e5 DC |
685 | struct xfs_trans *tp, |
686 | struct xfs_buf *bp, | |
1da177e4 LT |
687 | xfs_dir2_data_unused_t *dup) /* data unused pointer */ |
688 | { | |
1d9025e5 | 689 | xfs_dir2_data_hdr_t *hdr = bp->b_addr; |
c2066e26 | 690 | |
69ef921b | 691 | ASSERT(hdr->magic == cpu_to_be32(XFS_DIR2_DATA_MAGIC) || |
33363fee | 692 | hdr->magic == cpu_to_be32(XFS_DIR3_DATA_MAGIC) || |
f5f3d9b0 DC |
693 | hdr->magic == cpu_to_be32(XFS_DIR2_BLOCK_MAGIC) || |
694 | hdr->magic == cpu_to_be32(XFS_DIR3_BLOCK_MAGIC)); | |
1da177e4 | 695 | |
1da177e4 LT |
696 | /* |
697 | * Log the first part of the unused entry. | |
698 | */ | |
1d9025e5 | 699 | xfs_trans_log_buf(tp, bp, (uint)((char *)dup - (char *)hdr), |
1da177e4 | 700 | (uint)((char *)&dup->length + sizeof(dup->length) - |
c2066e26 | 701 | 1 - (char *)hdr)); |
1da177e4 LT |
702 | /* |
703 | * Log the end (tag) of the unused entry. | |
704 | */ | |
1d9025e5 | 705 | xfs_trans_log_buf(tp, bp, |
c2066e26 CH |
706 | (uint)((char *)xfs_dir2_data_unused_tag_p(dup) - (char *)hdr), |
707 | (uint)((char *)xfs_dir2_data_unused_tag_p(dup) - (char *)hdr + | |
1da177e4 LT |
708 | sizeof(xfs_dir2_data_off_t) - 1)); |
709 | } | |
710 | ||
711 | /* | |
712 | * Make a byte range in the data block unused. | |
713 | * Its current contents are unimportant. | |
714 | */ | |
715 | void | |
716 | xfs_dir2_data_make_free( | |
1d9025e5 | 717 | struct xfs_trans *tp, |
2ca98774 | 718 | struct xfs_inode *dp, |
1d9025e5 | 719 | struct xfs_buf *bp, |
1da177e4 LT |
720 | xfs_dir2_data_aoff_t offset, /* starting byte offset */ |
721 | xfs_dir2_data_aoff_t len, /* length in bytes */ | |
722 | int *needlogp, /* out: log header */ | |
723 | int *needscanp) /* out: regen bestfree */ | |
724 | { | |
c2066e26 | 725 | xfs_dir2_data_hdr_t *hdr; /* data block pointer */ |
1da177e4 LT |
726 | xfs_dir2_data_free_t *dfp; /* bestfree pointer */ |
727 | char *endptr; /* end of data area */ | |
728 | xfs_mount_t *mp; /* filesystem mount point */ | |
729 | int needscan; /* need to regen bestfree */ | |
730 | xfs_dir2_data_unused_t *newdup; /* new unused entry */ | |
731 | xfs_dir2_data_unused_t *postdup; /* unused entry after us */ | |
732 | xfs_dir2_data_unused_t *prevdup; /* unused entry before us */ | |
f5f3d9b0 | 733 | struct xfs_dir2_data_free *bf; |
1da177e4 LT |
734 | |
735 | mp = tp->t_mountp; | |
1d9025e5 | 736 | hdr = bp->b_addr; |
c2066e26 | 737 | |
1da177e4 LT |
738 | /* |
739 | * Figure out where the end of the data area is. | |
740 | */ | |
33363fee DC |
741 | if (hdr->magic == cpu_to_be32(XFS_DIR2_DATA_MAGIC) || |
742 | hdr->magic == cpu_to_be32(XFS_DIR3_DATA_MAGIC)) | |
c2066e26 | 743 | endptr = (char *)hdr + mp->m_dirblksize; |
1da177e4 LT |
744 | else { |
745 | xfs_dir2_block_tail_t *btp; /* block tail */ | |
746 | ||
f5f3d9b0 DC |
747 | ASSERT(hdr->magic == cpu_to_be32(XFS_DIR2_BLOCK_MAGIC) || |
748 | hdr->magic == cpu_to_be32(XFS_DIR3_BLOCK_MAGIC)); | |
c2066e26 | 749 | btp = xfs_dir2_block_tail_p(mp, hdr); |
bbaaf538 | 750 | endptr = (char *)xfs_dir2_block_leaf_p(btp); |
1da177e4 LT |
751 | } |
752 | /* | |
753 | * If this isn't the start of the block, then back up to | |
754 | * the previous entry and see if it's free. | |
755 | */ | |
1c9a5b2e | 756 | if (offset > dp->d_ops->data_entry_offset) { |
3d693c6e | 757 | __be16 *tagp; /* tag just before us */ |
1da177e4 | 758 | |
c2066e26 CH |
759 | tagp = (__be16 *)((char *)hdr + offset) - 1; |
760 | prevdup = (xfs_dir2_data_unused_t *)((char *)hdr + be16_to_cpu(*tagp)); | |
ad354eb3 | 761 | if (be16_to_cpu(prevdup->freetag) != XFS_DIR2_DATA_FREE_TAG) |
1da177e4 LT |
762 | prevdup = NULL; |
763 | } else | |
764 | prevdup = NULL; | |
765 | /* | |
766 | * If this isn't the end of the block, see if the entry after | |
767 | * us is free. | |
768 | */ | |
c2066e26 | 769 | if ((char *)hdr + offset + len < endptr) { |
1da177e4 | 770 | postdup = |
c2066e26 | 771 | (xfs_dir2_data_unused_t *)((char *)hdr + offset + len); |
ad354eb3 | 772 | if (be16_to_cpu(postdup->freetag) != XFS_DIR2_DATA_FREE_TAG) |
1da177e4 LT |
773 | postdup = NULL; |
774 | } else | |
775 | postdup = NULL; | |
776 | ASSERT(*needscanp == 0); | |
777 | needscan = 0; | |
778 | /* | |
779 | * Previous and following entries are both free, | |
780 | * merge everything into a single free entry. | |
781 | */ | |
2ca98774 | 782 | bf = dp->d_ops->data_bestfree_p(hdr); |
1da177e4 LT |
783 | if (prevdup && postdup) { |
784 | xfs_dir2_data_free_t *dfp2; /* another bestfree pointer */ | |
785 | ||
786 | /* | |
787 | * See if prevdup and/or postdup are in bestfree table. | |
788 | */ | |
2ca98774 DC |
789 | dfp = xfs_dir2_data_freefind(hdr, bf, prevdup); |
790 | dfp2 = xfs_dir2_data_freefind(hdr, bf, postdup); | |
1da177e4 LT |
791 | /* |
792 | * We need a rescan unless there are exactly 2 free entries | |
793 | * namely our two. Then we know what's happening, otherwise | |
794 | * since the third bestfree is there, there might be more | |
795 | * entries. | |
796 | */ | |
f5f3d9b0 | 797 | needscan = (bf[2].length != 0); |
1da177e4 LT |
798 | /* |
799 | * Fix up the new big freespace. | |
800 | */ | |
413d57c9 | 801 | be16_add_cpu(&prevdup->length, len + be16_to_cpu(postdup->length)); |
bbaaf538 | 802 | *xfs_dir2_data_unused_tag_p(prevdup) = |
c2066e26 | 803 | cpu_to_be16((char *)prevdup - (char *)hdr); |
1da177e4 LT |
804 | xfs_dir2_data_log_unused(tp, bp, prevdup); |
805 | if (!needscan) { | |
806 | /* | |
807 | * Has to be the case that entries 0 and 1 are | |
808 | * dfp and dfp2 (don't know which is which), and | |
809 | * entry 2 is empty. | |
810 | * Remove entry 1 first then entry 0. | |
811 | */ | |
812 | ASSERT(dfp && dfp2); | |
f5f3d9b0 DC |
813 | if (dfp == &bf[1]) { |
814 | dfp = &bf[0]; | |
1da177e4 | 815 | ASSERT(dfp2 == dfp); |
f5f3d9b0 | 816 | dfp2 = &bf[1]; |
1da177e4 | 817 | } |
2ca98774 DC |
818 | xfs_dir2_data_freeremove(hdr, bf, dfp2, needlogp); |
819 | xfs_dir2_data_freeremove(hdr, bf, dfp, needlogp); | |
1da177e4 LT |
820 | /* |
821 | * Now insert the new entry. | |
822 | */ | |
2ca98774 DC |
823 | dfp = xfs_dir2_data_freeinsert(hdr, bf, prevdup, |
824 | needlogp); | |
f5f3d9b0 | 825 | ASSERT(dfp == &bf[0]); |
ad354eb3 | 826 | ASSERT(dfp->length == prevdup->length); |
1da177e4 LT |
827 | ASSERT(!dfp[1].length); |
828 | ASSERT(!dfp[2].length); | |
829 | } | |
830 | } | |
831 | /* | |
832 | * The entry before us is free, merge with it. | |
833 | */ | |
834 | else if (prevdup) { | |
2ca98774 | 835 | dfp = xfs_dir2_data_freefind(hdr, bf, prevdup); |
413d57c9 | 836 | be16_add_cpu(&prevdup->length, len); |
bbaaf538 | 837 | *xfs_dir2_data_unused_tag_p(prevdup) = |
c2066e26 | 838 | cpu_to_be16((char *)prevdup - (char *)hdr); |
1da177e4 LT |
839 | xfs_dir2_data_log_unused(tp, bp, prevdup); |
840 | /* | |
841 | * If the previous entry was in the table, the new entry | |
842 | * is longer, so it will be in the table too. Remove | |
843 | * the old one and add the new one. | |
844 | */ | |
845 | if (dfp) { | |
2ca98774 DC |
846 | xfs_dir2_data_freeremove(hdr, bf, dfp, needlogp); |
847 | xfs_dir2_data_freeinsert(hdr, bf, prevdup, needlogp); | |
1da177e4 LT |
848 | } |
849 | /* | |
850 | * Otherwise we need a scan if the new entry is big enough. | |
851 | */ | |
70e73f59 | 852 | else { |
ad354eb3 | 853 | needscan = be16_to_cpu(prevdup->length) > |
f5f3d9b0 | 854 | be16_to_cpu(bf[2].length); |
70e73f59 | 855 | } |
1da177e4 LT |
856 | } |
857 | /* | |
858 | * The following entry is free, merge with it. | |
859 | */ | |
860 | else if (postdup) { | |
2ca98774 | 861 | dfp = xfs_dir2_data_freefind(hdr, bf, postdup); |
c2066e26 | 862 | newdup = (xfs_dir2_data_unused_t *)((char *)hdr + offset); |
ad354eb3 NS |
863 | newdup->freetag = cpu_to_be16(XFS_DIR2_DATA_FREE_TAG); |
864 | newdup->length = cpu_to_be16(len + be16_to_cpu(postdup->length)); | |
bbaaf538 | 865 | *xfs_dir2_data_unused_tag_p(newdup) = |
c2066e26 | 866 | cpu_to_be16((char *)newdup - (char *)hdr); |
1da177e4 LT |
867 | xfs_dir2_data_log_unused(tp, bp, newdup); |
868 | /* | |
869 | * If the following entry was in the table, the new entry | |
870 | * is longer, so it will be in the table too. Remove | |
871 | * the old one and add the new one. | |
872 | */ | |
873 | if (dfp) { | |
2ca98774 DC |
874 | xfs_dir2_data_freeremove(hdr, bf, dfp, needlogp); |
875 | xfs_dir2_data_freeinsert(hdr, bf, newdup, needlogp); | |
1da177e4 LT |
876 | } |
877 | /* | |
878 | * Otherwise we need a scan if the new entry is big enough. | |
879 | */ | |
70e73f59 | 880 | else { |
ad354eb3 | 881 | needscan = be16_to_cpu(newdup->length) > |
f5f3d9b0 | 882 | be16_to_cpu(bf[2].length); |
70e73f59 | 883 | } |
1da177e4 LT |
884 | } |
885 | /* | |
886 | * Neither neighbor is free. Make a new entry. | |
887 | */ | |
888 | else { | |
c2066e26 | 889 | newdup = (xfs_dir2_data_unused_t *)((char *)hdr + offset); |
ad354eb3 NS |
890 | newdup->freetag = cpu_to_be16(XFS_DIR2_DATA_FREE_TAG); |
891 | newdup->length = cpu_to_be16(len); | |
bbaaf538 | 892 | *xfs_dir2_data_unused_tag_p(newdup) = |
c2066e26 | 893 | cpu_to_be16((char *)newdup - (char *)hdr); |
1da177e4 | 894 | xfs_dir2_data_log_unused(tp, bp, newdup); |
2ca98774 | 895 | xfs_dir2_data_freeinsert(hdr, bf, newdup, needlogp); |
1da177e4 LT |
896 | } |
897 | *needscanp = needscan; | |
898 | } | |
899 | ||
900 | /* | |
901 | * Take a byte range out of an existing unused space and make it un-free. | |
902 | */ | |
903 | void | |
904 | xfs_dir2_data_use_free( | |
1d9025e5 | 905 | struct xfs_trans *tp, |
2ca98774 | 906 | struct xfs_inode *dp, |
1d9025e5 | 907 | struct xfs_buf *bp, |
1da177e4 LT |
908 | xfs_dir2_data_unused_t *dup, /* unused entry */ |
909 | xfs_dir2_data_aoff_t offset, /* starting offset to use */ | |
910 | xfs_dir2_data_aoff_t len, /* length to use */ | |
911 | int *needlogp, /* out: need to log header */ | |
912 | int *needscanp) /* out: need regen bestfree */ | |
913 | { | |
c2066e26 | 914 | xfs_dir2_data_hdr_t *hdr; /* data block header */ |
1da177e4 LT |
915 | xfs_dir2_data_free_t *dfp; /* bestfree pointer */ |
916 | int matchback; /* matches end of freespace */ | |
917 | int matchfront; /* matches start of freespace */ | |
918 | int needscan; /* need to regen bestfree */ | |
919 | xfs_dir2_data_unused_t *newdup; /* new unused entry */ | |
920 | xfs_dir2_data_unused_t *newdup2; /* another new unused entry */ | |
921 | int oldlen; /* old unused entry's length */ | |
f5f3d9b0 | 922 | struct xfs_dir2_data_free *bf; |
1da177e4 | 923 | |
1d9025e5 | 924 | hdr = bp->b_addr; |
69ef921b | 925 | ASSERT(hdr->magic == cpu_to_be32(XFS_DIR2_DATA_MAGIC) || |
33363fee | 926 | hdr->magic == cpu_to_be32(XFS_DIR3_DATA_MAGIC) || |
f5f3d9b0 DC |
927 | hdr->magic == cpu_to_be32(XFS_DIR2_BLOCK_MAGIC) || |
928 | hdr->magic == cpu_to_be32(XFS_DIR3_BLOCK_MAGIC)); | |
ad354eb3 | 929 | ASSERT(be16_to_cpu(dup->freetag) == XFS_DIR2_DATA_FREE_TAG); |
c2066e26 CH |
930 | ASSERT(offset >= (char *)dup - (char *)hdr); |
931 | ASSERT(offset + len <= (char *)dup + be16_to_cpu(dup->length) - (char *)hdr); | |
932 | ASSERT((char *)dup - (char *)hdr == be16_to_cpu(*xfs_dir2_data_unused_tag_p(dup))); | |
1da177e4 LT |
933 | /* |
934 | * Look up the entry in the bestfree table. | |
935 | */ | |
ad354eb3 | 936 | oldlen = be16_to_cpu(dup->length); |
2ca98774 DC |
937 | bf = dp->d_ops->data_bestfree_p(hdr); |
938 | dfp = xfs_dir2_data_freefind(hdr, bf, dup); | |
f5f3d9b0 | 939 | ASSERT(dfp || oldlen <= be16_to_cpu(bf[2].length)); |
1da177e4 LT |
940 | /* |
941 | * Check for alignment with front and back of the entry. | |
942 | */ | |
c2066e26 CH |
943 | matchfront = (char *)dup - (char *)hdr == offset; |
944 | matchback = (char *)dup + oldlen - (char *)hdr == offset + len; | |
1da177e4 LT |
945 | ASSERT(*needscanp == 0); |
946 | needscan = 0; | |
947 | /* | |
948 | * If we matched it exactly we just need to get rid of it from | |
949 | * the bestfree table. | |
950 | */ | |
951 | if (matchfront && matchback) { | |
952 | if (dfp) { | |
f5f3d9b0 | 953 | needscan = (bf[2].offset != 0); |
1da177e4 | 954 | if (!needscan) |
2ca98774 DC |
955 | xfs_dir2_data_freeremove(hdr, bf, dfp, |
956 | needlogp); | |
1da177e4 LT |
957 | } |
958 | } | |
959 | /* | |
960 | * We match the first part of the entry. | |
961 | * Make a new entry with the remaining freespace. | |
962 | */ | |
963 | else if (matchfront) { | |
c2066e26 | 964 | newdup = (xfs_dir2_data_unused_t *)((char *)hdr + offset + len); |
ad354eb3 NS |
965 | newdup->freetag = cpu_to_be16(XFS_DIR2_DATA_FREE_TAG); |
966 | newdup->length = cpu_to_be16(oldlen - len); | |
bbaaf538 | 967 | *xfs_dir2_data_unused_tag_p(newdup) = |
c2066e26 | 968 | cpu_to_be16((char *)newdup - (char *)hdr); |
1da177e4 LT |
969 | xfs_dir2_data_log_unused(tp, bp, newdup); |
970 | /* | |
971 | * If it was in the table, remove it and add the new one. | |
972 | */ | |
973 | if (dfp) { | |
2ca98774 DC |
974 | xfs_dir2_data_freeremove(hdr, bf, dfp, needlogp); |
975 | dfp = xfs_dir2_data_freeinsert(hdr, bf, newdup, | |
976 | needlogp); | |
1da177e4 | 977 | ASSERT(dfp != NULL); |
ad354eb3 | 978 | ASSERT(dfp->length == newdup->length); |
c2066e26 | 979 | ASSERT(be16_to_cpu(dfp->offset) == (char *)newdup - (char *)hdr); |
1da177e4 LT |
980 | /* |
981 | * If we got inserted at the last slot, | |
982 | * that means we don't know if there was a better | |
983 | * choice for the last slot, or not. Rescan. | |
984 | */ | |
f5f3d9b0 | 985 | needscan = dfp == &bf[2]; |
1da177e4 LT |
986 | } |
987 | } | |
988 | /* | |
989 | * We match the last part of the entry. | |
990 | * Trim the allocated space off the tail of the entry. | |
991 | */ | |
992 | else if (matchback) { | |
993 | newdup = dup; | |
c2066e26 | 994 | newdup->length = cpu_to_be16(((char *)hdr + offset) - (char *)newdup); |
bbaaf538 | 995 | *xfs_dir2_data_unused_tag_p(newdup) = |
c2066e26 | 996 | cpu_to_be16((char *)newdup - (char *)hdr); |
1da177e4 LT |
997 | xfs_dir2_data_log_unused(tp, bp, newdup); |
998 | /* | |
999 | * If it was in the table, remove it and add the new one. | |
1000 | */ | |
1001 | if (dfp) { | |
2ca98774 DC |
1002 | xfs_dir2_data_freeremove(hdr, bf, dfp, needlogp); |
1003 | dfp = xfs_dir2_data_freeinsert(hdr, bf, newdup, | |
1004 | needlogp); | |
1da177e4 | 1005 | ASSERT(dfp != NULL); |
ad354eb3 | 1006 | ASSERT(dfp->length == newdup->length); |
c2066e26 | 1007 | ASSERT(be16_to_cpu(dfp->offset) == (char *)newdup - (char *)hdr); |
1da177e4 LT |
1008 | /* |
1009 | * If we got inserted at the last slot, | |
1010 | * that means we don't know if there was a better | |
1011 | * choice for the last slot, or not. Rescan. | |
1012 | */ | |
f5f3d9b0 | 1013 | needscan = dfp == &bf[2]; |
1da177e4 LT |
1014 | } |
1015 | } | |
1016 | /* | |
1017 | * Poking out the middle of an entry. | |
1018 | * Make two new entries. | |
1019 | */ | |
1020 | else { | |
1021 | newdup = dup; | |
c2066e26 | 1022 | newdup->length = cpu_to_be16(((char *)hdr + offset) - (char *)newdup); |
bbaaf538 | 1023 | *xfs_dir2_data_unused_tag_p(newdup) = |
c2066e26 | 1024 | cpu_to_be16((char *)newdup - (char *)hdr); |
1da177e4 | 1025 | xfs_dir2_data_log_unused(tp, bp, newdup); |
c2066e26 | 1026 | newdup2 = (xfs_dir2_data_unused_t *)((char *)hdr + offset + len); |
ad354eb3 NS |
1027 | newdup2->freetag = cpu_to_be16(XFS_DIR2_DATA_FREE_TAG); |
1028 | newdup2->length = cpu_to_be16(oldlen - len - be16_to_cpu(newdup->length)); | |
bbaaf538 | 1029 | *xfs_dir2_data_unused_tag_p(newdup2) = |
c2066e26 | 1030 | cpu_to_be16((char *)newdup2 - (char *)hdr); |
1da177e4 LT |
1031 | xfs_dir2_data_log_unused(tp, bp, newdup2); |
1032 | /* | |
1033 | * If the old entry was in the table, we need to scan | |
1034 | * if the 3rd entry was valid, since these entries | |
1035 | * are smaller than the old one. | |
1036 | * If we don't need to scan that means there were 1 or 2 | |
1037 | * entries in the table, and removing the old and adding | |
1038 | * the 2 new will work. | |
1039 | */ | |
1040 | if (dfp) { | |
f5f3d9b0 | 1041 | needscan = (bf[2].length != 0); |
1da177e4 | 1042 | if (!needscan) { |
2ca98774 DC |
1043 | xfs_dir2_data_freeremove(hdr, bf, dfp, |
1044 | needlogp); | |
1045 | xfs_dir2_data_freeinsert(hdr, bf, newdup, | |
1046 | needlogp); | |
1047 | xfs_dir2_data_freeinsert(hdr, bf, newdup2, | |
c2066e26 | 1048 | needlogp); |
1da177e4 LT |
1049 | } |
1050 | } | |
1051 | } | |
1052 | *needscanp = needscan; | |
1053 | } |