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