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