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