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