?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
Linux 3.12.5
[linux/fpc-iii.git] / fs / xfs / xfs_dir2_data.c
blob47e1326c169a08c71d8d21ac51e8d113444d3295
1 /*
2 * Copyright (c) 2000-2002,2005 Silicon Graphics, Inc.
3 * Copyright (c) 2013 Red Hat, Inc.
4 * All Rights Reserved.
5 *
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
8 * published by the Free Software Foundation.
9 *
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.
14 *
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
18 */
19 #include "xfs.h"
20 #include "xfs_fs.h"
21 #include "xfs_types.h"
22 #include "xfs_log.h"
23 #include "xfs_trans.h"
24 #include "xfs_sb.h"
25 #include "xfs_ag.h"
26 #include "xfs_mount.h"
27 #include "xfs_da_btree.h"
28 #include "xfs_bmap_btree.h"
29 #include "xfs_dinode.h"
30 #include "xfs_inode.h"
31 #include "xfs_dir2_format.h"
32 #include "xfs_dir2.h"
33 #include "xfs_dir2_priv.h"
34 #include "xfs_error.h"
35 #include "xfs_buf_item.h"
36 #include "xfs_cksum.h"
37
38 /*
39 * Check the consistency of the data block.
40 * The input can also be a block-format directory.
41 * Return 0 is the buffer is good, otherwise an error.
42 */
43 int
44 __xfs_dir3_data_check(
45 struct xfs_inode *dp, /* incore inode pointer */
46 struct xfs_buf *bp) /* data block's buffer */
47 {
48 xfs_dir2_dataptr_t addr; /* addr for leaf lookup */
49 xfs_dir2_data_free_t *bf; /* bestfree table */
50 xfs_dir2_block_tail_t *btp=NULL; /* block tail */
51 int count; /* count of entries found */
52 xfs_dir2_data_hdr_t *hdr; /* data block header */
53 xfs_dir2_data_entry_t *dep; /* data entry */
54 xfs_dir2_data_free_t *dfp; /* bestfree entry */
55 xfs_dir2_data_unused_t *dup; /* unused entry */
56 char *endp; /* end of useful data */
57 int freeseen; /* mask of bestfrees seen */
58 xfs_dahash_t hash; /* hash of current name */
59 int i; /* leaf index */
60 int lastfree; /* last entry was unused */
61 xfs_dir2_leaf_entry_t *lep=NULL; /* block leaf entries */
62 xfs_mount_t *mp; /* filesystem mount point */
63 char *p; /* current data position */
64 int stale; /* count of stale leaves */
65 struct xfs_name name;
66
67 mp = bp->b_target->bt_mount;
68 hdr = bp->b_addr;
69 bf = xfs_dir3_data_bestfree_p(hdr);
70 p = (char *)xfs_dir3_data_entry_p(hdr);
71
72 switch (hdr->magic) {
73 case cpu_to_be32(XFS_DIR3_BLOCK_MAGIC):
74 case cpu_to_be32(XFS_DIR2_BLOCK_MAGIC):
75 btp = xfs_dir2_block_tail_p(mp, hdr);
76 lep = xfs_dir2_block_leaf_p(btp);
77 endp = (char *)lep;
78 break;
79 case cpu_to_be32(XFS_DIR3_DATA_MAGIC):
80 case cpu_to_be32(XFS_DIR2_DATA_MAGIC):
81 endp = (char *)hdr + mp->m_dirblksize;
82 break;
83 default:
84 XFS_ERROR_REPORT("Bad Magic", XFS_ERRLEVEL_LOW, mp);
85 return EFSCORRUPTED;
86 }
87
88 count = lastfree = freeseen = 0;
89 /*
90 * Account for zero bestfree entries.
91 */
92 if (!bf[0].length) {
93 XFS_WANT_CORRUPTED_RETURN(!bf[0].offset);
94 freeseen |= 1 << 0;
95 }
96 if (!bf[1].length) {
97 XFS_WANT_CORRUPTED_RETURN(!bf[1].offset);
98 freeseen |= 1 << 1;
99 }
100 if (!bf[2].length) {
101 XFS_WANT_CORRUPTED_RETURN(!bf[2].offset);
102 freeseen |= 1 << 2;
103 }
104
105 XFS_WANT_CORRUPTED_RETURN(be16_to_cpu(bf[0].length) >=
106 be16_to_cpu(bf[1].length));
107 XFS_WANT_CORRUPTED_RETURN(be16_to_cpu(bf[1].length) >=
108 be16_to_cpu(bf[2].length));
109 /*
110 * Loop over the data/unused entries.
111 */
112 while (p < endp) {
113 dup = (xfs_dir2_data_unused_t *)p;
114 /*
115 * If it's unused, look for the space in the bestfree table.
116 * If we find it, account for that, else make sure it
117 * doesn't need to be there.
118 */
119 if (be16_to_cpu(dup->freetag) == XFS_DIR2_DATA_FREE_TAG) {
120 XFS_WANT_CORRUPTED_RETURN(lastfree == 0);
121 XFS_WANT_CORRUPTED_RETURN(
122 be16_to_cpu(*xfs_dir2_data_unused_tag_p(dup)) ==
123 (char *)dup - (char *)hdr);
124 dfp = xfs_dir2_data_freefind(hdr, dup);
125 if (dfp) {
126 i = (int)(dfp - bf);
127 XFS_WANT_CORRUPTED_RETURN(
128 (freeseen & (1 << i)) == 0);
129 freeseen |= 1 << i;
130 } else {
131 XFS_WANT_CORRUPTED_RETURN(
132 be16_to_cpu(dup->length) <=
133 be16_to_cpu(bf[2].length));
134 }
135 p += be16_to_cpu(dup->length);
136 lastfree = 1;
137 continue;
138 }
139 /*
140 * It's a real entry. Validate the fields.
141 * If this is a block directory then make sure it's
142 * in the leaf section of the block.
143 * The linear search is crude but this is DEBUG code.
144 */
145 dep = (xfs_dir2_data_entry_t *)p;
146 XFS_WANT_CORRUPTED_RETURN(dep->namelen != 0);
147 XFS_WANT_CORRUPTED_RETURN(
148 !xfs_dir_ino_validate(mp, be64_to_cpu(dep->inumber)));
149 XFS_WANT_CORRUPTED_RETURN(
150 be16_to_cpu(*xfs_dir3_data_entry_tag_p(mp, dep)) ==
151 (char *)dep - (char *)hdr);
152 XFS_WANT_CORRUPTED_RETURN(
153 xfs_dir3_dirent_get_ftype(mp, dep) < XFS_DIR3_FT_MAX);
154 count++;
155 lastfree = 0;
156 if (hdr->magic == cpu_to_be32(XFS_DIR2_BLOCK_MAGIC) ||
157 hdr->magic == cpu_to_be32(XFS_DIR3_BLOCK_MAGIC)) {
158 addr = xfs_dir2_db_off_to_dataptr(mp, mp->m_dirdatablk,
159 (xfs_dir2_data_aoff_t)
160 ((char *)dep - (char *)hdr));
161 name.name = dep->name;
162 name.len = dep->namelen;
163 hash = mp->m_dirnameops->hashname(&name);
164 for (i = 0; i < be32_to_cpu(btp->count); i++) {
165 if (be32_to_cpu(lep[i].address) == addr &&
166 be32_to_cpu(lep[i].hashval) == hash)
167 break;
168 }
169 XFS_WANT_CORRUPTED_RETURN(i < be32_to_cpu(btp->count));
170 }
171 p += xfs_dir3_data_entsize(mp, dep->namelen);
172 }
173 /*
174 * Need to have seen all the entries and all the bestfree slots.
175 */
176 XFS_WANT_CORRUPTED_RETURN(freeseen == 7);
177 if (hdr->magic == cpu_to_be32(XFS_DIR2_BLOCK_MAGIC) ||
178 hdr->magic == cpu_to_be32(XFS_DIR3_BLOCK_MAGIC)) {
179 for (i = stale = 0; i < be32_to_cpu(btp->count); i++) {
180 if (lep[i].address ==
181 cpu_to_be32(XFS_DIR2_NULL_DATAPTR))
182 stale++;
183 if (i > 0)
184 XFS_WANT_CORRUPTED_RETURN(
185 be32_to_cpu(lep[i].hashval) >=
186 be32_to_cpu(lep[i - 1].hashval));
187 }
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));
191 }
192 return 0;
193 }
194
195 static bool
196 xfs_dir3_data_verify(
197 struct xfs_buf *bp)
198 {
199 struct xfs_mount *mp = bp->b_target->bt_mount;
200 struct xfs_dir3_blk_hdr *hdr3 = bp->b_addr;
201
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;
212 }
213 if (__xfs_dir3_data_check(NULL, bp))
214 return false;
215 return true;
216 }
217
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
224 xfs_dir3_data_reada_verify(
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):
232 case cpu_to_be32(XFS_DIR3_BLOCK_MAGIC):
233 bp->b_ops = &xfs_dir3_block_buf_ops;
234 bp->b_ops->verify_read(bp);
235 return;
236 case cpu_to_be32(XFS_DIR2_DATA_MAGIC):
237 case cpu_to_be32(XFS_DIR3_DATA_MAGIC):
238 xfs_dir3_data_verify(bp);
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
248 xfs_dir3_data_read_verify(
249 struct xfs_buf *bp)
250 {
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 }
260 }
261
262 static void
263 xfs_dir3_data_write_verify(
264 struct xfs_buf *bp)
265 {
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);
283 }
284
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,
288 };
289
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,
293 };
294
295
296 int
297 xfs_dir3_data_read(
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 {
304 int err;
305
306 err = xfs_da_read_buf(tp, dp, bno, mapped_bno, bpp,
307 XFS_DATA_FORK, &xfs_dir3_data_buf_ops);
308 if (!err && tp)
309 xfs_trans_buf_set_type(tp, *bpp, XFS_BLFT_DIR_DATA_BUF);
310 return err;
311 }
312
313 int
314 xfs_dir3_data_readahead(
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,
321 XFS_DATA_FORK, &xfs_dir3_data_reada_buf_ops);
322 }
323
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 */
328 xfs_dir2_data_free_t *
329 xfs_dir2_data_freefind(
330 xfs_dir2_data_hdr_t *hdr, /* data block */
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 */
335 struct xfs_dir2_data_free *bf;
336 #ifdef DEBUG
337 int matched; /* matched the value */
338 int seenzero; /* saw a 0 bestfree entry */
339 #endif
340
341 off = (xfs_dir2_data_aoff_t)((char *)dup - (char *)hdr);
342 bf = xfs_dir3_data_bestfree_p(hdr);
343
344 #ifdef DEBUG
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 */
350 ASSERT(hdr->magic == cpu_to_be32(XFS_DIR2_DATA_MAGIC) ||
351 hdr->magic == cpu_to_be32(XFS_DIR3_DATA_MAGIC) ||
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];
356 dfp++) {
357 if (!dfp->offset) {
358 ASSERT(!dfp->length);
359 seenzero = 1;
360 continue;
361 }
362 ASSERT(seenzero == 0);
363 if (be16_to_cpu(dfp->offset) == off) {
364 matched = 1;
365 ASSERT(dfp->length == dup->length);
366 } else if (off < be16_to_cpu(dfp->offset))
367 ASSERT(off + be16_to_cpu(dup->length) <= be16_to_cpu(dfp->offset));
368 else
369 ASSERT(be16_to_cpu(dfp->offset) + be16_to_cpu(dfp->length) <= off);
370 ASSERT(matched || be16_to_cpu(dfp->length) >= be16_to_cpu(dup->length));
371 if (dfp > &bf[0])
372 ASSERT(be16_to_cpu(dfp[-1].length) >= be16_to_cpu(dfp[0].length));
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 */
379 if (be16_to_cpu(dup->length) <
380 be16_to_cpu(bf[XFS_DIR2_DATA_FD_COUNT - 1].length))
381 return NULL;
382 /*
383 * Look at the three bestfree entries for our guy.
384 */
385 for (dfp = &bf[0]; dfp < &bf[XFS_DIR2_DATA_FD_COUNT]; dfp++) {
386 if (!dfp->offset)
387 return NULL;
388 if (be16_to_cpu(dfp->offset) == off)
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(
402 xfs_dir2_data_hdr_t *hdr, /* data block pointer */
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
409 ASSERT(hdr->magic == cpu_to_be32(XFS_DIR2_DATA_MAGIC) ||
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);
415 new.length = dup->length;
416 new.offset = cpu_to_be16((char *)dup - (char *)hdr);
417
418 /*
419 * Insert at position 0, 1, or 2; or not at all.
420 */
421 if (be16_to_cpu(new.length) > be16_to_cpu(dfp[0].length)) {
422 dfp[2] = dfp[1];
423 dfp[1] = dfp[0];
424 dfp[0] = new;
425 *loghead = 1;
426 return &dfp[0];
427 }
428 if (be16_to_cpu(new.length) > be16_to_cpu(dfp[1].length)) {
429 dfp[2] = dfp[1];
430 dfp[1] = new;
431 *loghead = 1;
432 return &dfp[1];
433 }
434 if (be16_to_cpu(new.length) > be16_to_cpu(dfp[2].length)) {
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 */
445 STATIC void
446 xfs_dir2_data_freeremove(
447 xfs_dir2_data_hdr_t *hdr, /* data block header */
448 xfs_dir2_data_free_t *dfp, /* bestfree entry pointer */
449 int *loghead) /* out: log data header */
450 {
451 struct xfs_dir2_data_free *bf;
452
453 ASSERT(hdr->magic == cpu_to_be32(XFS_DIR2_DATA_MAGIC) ||
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
458 /*
459 * It's the first entry, slide the next 2 up.
460 */
461 bf = xfs_dir3_data_bestfree_p(hdr);
462 if (dfp == &bf[0]) {
463 bf[0] = bf[1];
464 bf[1] = bf[2];
465 }
466 /*
467 * It's the second entry, slide the 3rd entry up.
468 */
469 else if (dfp == &bf[1])
470 bf[1] = bf[2];
471 /*
472 * Must be the last entry.
473 */
474 else
475 ASSERT(dfp == &bf[2]);
476 /*
477 * Clear the 3rd entry, must be zero now.
478 */
479 bf[2].length = 0;
480 bf[2].offset = 0;
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 */
490 xfs_dir2_data_hdr_t *hdr, /* data block header */
491 int *loghead) /* out: log data header */
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 */
496 struct xfs_dir2_data_free *bf;
497 char *endp; /* end of block's data */
498 char *p; /* current entry pointer */
499
500 ASSERT(hdr->magic == cpu_to_be32(XFS_DIR2_DATA_MAGIC) ||
501 hdr->magic == cpu_to_be32(XFS_DIR3_DATA_MAGIC) ||
502 hdr->magic == cpu_to_be32(XFS_DIR2_BLOCK_MAGIC) ||
503 hdr->magic == cpu_to_be32(XFS_DIR3_BLOCK_MAGIC));
504
505 /*
506 * Start by clearing the table.
507 */
508 bf = xfs_dir3_data_bestfree_p(hdr);
509 memset(bf, 0, sizeof(*bf) * XFS_DIR2_DATA_FD_COUNT);
510 *loghead = 1;
511 /*
512 * Set up pointers.
513 */
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)) {
517 btp = xfs_dir2_block_tail_p(mp, hdr);
518 endp = (char *)xfs_dir2_block_leaf_p(btp);
519 } else
520 endp = (char *)hdr + mp->m_dirblksize;
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 */
529 if (be16_to_cpu(dup->freetag) == XFS_DIR2_DATA_FREE_TAG) {
530 ASSERT((char *)dup - (char *)hdr ==
531 be16_to_cpu(*xfs_dir2_data_unused_tag_p(dup)));
532 xfs_dir2_data_freeinsert(hdr, dup, loghead);
533 p += be16_to_cpu(dup->length);
534 }
535 /*
536 * For active entries, check their tags and skip them.
537 */
538 else {
539 dep = (xfs_dir2_data_entry_t *)p;
540 ASSERT((char *)dep - (char *)hdr ==
541 be16_to_cpu(*xfs_dir3_data_entry_tag_p(mp, dep)));
542 p += xfs_dir3_data_entsize(mp, dep->namelen);
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 */
552 xfs_dir3_data_init(
553 xfs_da_args_t *args, /* directory operation args */
554 xfs_dir2_db_t blkno, /* logical dir block number */
555 struct xfs_buf **bpp) /* output block buffer */
556 {
557 struct xfs_buf *bp; /* block buffer */
558 xfs_dir2_data_hdr_t *hdr; /* data block header */
559 xfs_inode_t *dp; /* incore directory inode */
560 xfs_dir2_data_unused_t *dup; /* unused entry pointer */
561 struct xfs_dir2_data_free *bf;
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 */
574 error = xfs_da_get_buf(tp, dp, xfs_dir2_db_to_da(mp, blkno), -1, &bp,
575 XFS_DATA_FORK);
576 if (error)
577 return error;
578 bp->b_ops = &xfs_dir3_data_buf_ops;
579 xfs_trans_buf_set_type(tp, bp, XFS_BLFT_DIR_DATA_BUF);
580
581 /*
582 * Initialize the header.
583 */
584 hdr = bp->b_addr;
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));
599 for (i = 1; i < XFS_DIR2_DATA_FD_COUNT; i++) {
600 bf[i].length = 0;
601 bf[i].offset = 0;
602 }
603
604 /*
605 * Set up an unused entry for the block's body.
606 */
607 dup = xfs_dir3_data_unused_p(hdr);
608 dup->freetag = cpu_to_be16(XFS_DIR2_DATA_FREE_TAG);
609
610 t = mp->m_dirblksize - (uint)xfs_dir3_data_entry_offset(hdr);
611 bf[0].length = cpu_to_be16(t);
612 dup->length = cpu_to_be16(t);
613 *xfs_dir2_data_unused_tag_p(dup) = cpu_to_be16((char *)dup - (char *)hdr);
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(
628 struct xfs_trans *tp,
629 struct xfs_buf *bp,
630 xfs_dir2_data_entry_t *dep) /* data entry pointer */
631 {
632 struct xfs_dir2_data_hdr *hdr = bp->b_addr;
633 struct xfs_mount *mp = tp->t_mountp;
634
635 ASSERT(hdr->magic == cpu_to_be32(XFS_DIR2_DATA_MAGIC) ||
636 hdr->magic == cpu_to_be32(XFS_DIR3_DATA_MAGIC) ||
637 hdr->magic == cpu_to_be32(XFS_DIR2_BLOCK_MAGIC) ||
638 hdr->magic == cpu_to_be32(XFS_DIR3_BLOCK_MAGIC));
639
640 xfs_trans_log_buf(tp, bp, (uint)((char *)dep - (char *)hdr),
641 (uint)((char *)(xfs_dir3_data_entry_tag_p(mp, dep) + 1) -
642 (char *)hdr - 1));
643 }
644
645 /*
646 * Log a data block header.
647 */
648 void
649 xfs_dir2_data_log_header(
650 struct xfs_trans *tp,
651 struct xfs_buf *bp)
652 {
653 xfs_dir2_data_hdr_t *hdr = bp->b_addr;
654
655 ASSERT(hdr->magic == cpu_to_be32(XFS_DIR2_DATA_MAGIC) ||
656 hdr->magic == cpu_to_be32(XFS_DIR3_DATA_MAGIC) ||
657 hdr->magic == cpu_to_be32(XFS_DIR2_BLOCK_MAGIC) ||
658 hdr->magic == cpu_to_be32(XFS_DIR3_BLOCK_MAGIC));
659
660 xfs_trans_log_buf(tp, bp, 0, xfs_dir3_data_entry_offset(hdr) - 1);
661 }
662
663 /*
664 * Log a data unused entry.
665 */
666 void
667 xfs_dir2_data_log_unused(
668 struct xfs_trans *tp,
669 struct xfs_buf *bp,
670 xfs_dir2_data_unused_t *dup) /* data unused pointer */
671 {
672 xfs_dir2_data_hdr_t *hdr = bp->b_addr;
673
674 ASSERT(hdr->magic == cpu_to_be32(XFS_DIR2_DATA_MAGIC) ||
675 hdr->magic == cpu_to_be32(XFS_DIR3_DATA_MAGIC) ||
676 hdr->magic == cpu_to_be32(XFS_DIR2_BLOCK_MAGIC) ||
677 hdr->magic == cpu_to_be32(XFS_DIR3_BLOCK_MAGIC));
678
679 /*
680 * Log the first part of the unused entry.
681 */
682 xfs_trans_log_buf(tp, bp, (uint)((char *)dup - (char *)hdr),
683 (uint)((char *)&dup->length + sizeof(dup->length) -
684 1 - (char *)hdr));
685 /*
686 * Log the end (tag) of the unused entry.
687 */
688 xfs_trans_log_buf(tp, bp,
689 (uint)((char *)xfs_dir2_data_unused_tag_p(dup) - (char *)hdr),
690 (uint)((char *)xfs_dir2_data_unused_tag_p(dup) - (char *)hdr +
691 sizeof(xfs_dir2_data_off_t) - 1));
692 }
693
694 /*
695 * Make a byte range in the data block unused.
696 * Its current contents are unimportant.
697 */
698 void
699 xfs_dir2_data_make_free(
700 struct xfs_trans *tp,
701 struct xfs_buf *bp,
702 xfs_dir2_data_aoff_t offset, /* starting byte offset */
703 xfs_dir2_data_aoff_t len, /* length in bytes */
704 int *needlogp, /* out: log header */
705 int *needscanp) /* out: regen bestfree */
706 {
707 xfs_dir2_data_hdr_t *hdr; /* data block pointer */
708 xfs_dir2_data_free_t *dfp; /* bestfree pointer */
709 char *endptr; /* end of data area */
710 xfs_mount_t *mp; /* filesystem mount point */
711 int needscan; /* need to regen bestfree */
712 xfs_dir2_data_unused_t *newdup; /* new unused entry */
713 xfs_dir2_data_unused_t *postdup; /* unused entry after us */
714 xfs_dir2_data_unused_t *prevdup; /* unused entry before us */
715 struct xfs_dir2_data_free *bf;
716
717 mp = tp->t_mountp;
718 hdr = bp->b_addr;
719
720 /*
721 * Figure out where the end of the data area is.
722 */
723 if (hdr->magic == cpu_to_be32(XFS_DIR2_DATA_MAGIC) ||
724 hdr->magic == cpu_to_be32(XFS_DIR3_DATA_MAGIC))
725 endptr = (char *)hdr + mp->m_dirblksize;
726 else {
727 xfs_dir2_block_tail_t *btp; /* block tail */
728
729 ASSERT(hdr->magic == cpu_to_be32(XFS_DIR2_BLOCK_MAGIC) ||
730 hdr->magic == cpu_to_be32(XFS_DIR3_BLOCK_MAGIC));
731 btp = xfs_dir2_block_tail_p(mp, hdr);
732 endptr = (char *)xfs_dir2_block_leaf_p(btp);
733 }
734 /*
735 * If this isn't the start of the block, then back up to
736 * the previous entry and see if it's free.
737 */
738 if (offset > xfs_dir3_data_entry_offset(hdr)) {
739 __be16 *tagp; /* tag just before us */
740
741 tagp = (__be16 *)((char *)hdr + offset) - 1;
742 prevdup = (xfs_dir2_data_unused_t *)((char *)hdr + be16_to_cpu(*tagp));
743 if (be16_to_cpu(prevdup->freetag) != XFS_DIR2_DATA_FREE_TAG)
744 prevdup = NULL;
745 } else
746 prevdup = NULL;
747 /*
748 * If this isn't the end of the block, see if the entry after
749 * us is free.
750 */
751 if ((char *)hdr + offset + len < endptr) {
752 postdup =
753 (xfs_dir2_data_unused_t *)((char *)hdr + offset + len);
754 if (be16_to_cpu(postdup->freetag) != XFS_DIR2_DATA_FREE_TAG)
755 postdup = NULL;
756 } else
757 postdup = NULL;
758 ASSERT(*needscanp == 0);
759 needscan = 0;
760 /*
761 * Previous and following entries are both free,
762 * merge everything into a single free entry.
763 */
764 bf = xfs_dir3_data_bestfree_p(hdr);
765 if (prevdup && postdup) {
766 xfs_dir2_data_free_t *dfp2; /* another bestfree pointer */
767
768 /*
769 * See if prevdup and/or postdup are in bestfree table.
770 */
771 dfp = xfs_dir2_data_freefind(hdr, prevdup);
772 dfp2 = xfs_dir2_data_freefind(hdr, postdup);
773 /*
774 * We need a rescan unless there are exactly 2 free entries
775 * namely our two. Then we know what's happening, otherwise
776 * since the third bestfree is there, there might be more
777 * entries.
778 */
779 needscan = (bf[2].length != 0);
780 /*
781 * Fix up the new big freespace.
782 */
783 be16_add_cpu(&prevdup->length, len + be16_to_cpu(postdup->length));
784 *xfs_dir2_data_unused_tag_p(prevdup) =
785 cpu_to_be16((char *)prevdup - (char *)hdr);
786 xfs_dir2_data_log_unused(tp, bp, prevdup);
787 if (!needscan) {
788 /*
789 * Has to be the case that entries 0 and 1 are
790 * dfp and dfp2 (don't know which is which), and
791 * entry 2 is empty.
792 * Remove entry 1 first then entry 0.
793 */
794 ASSERT(dfp && dfp2);
795 if (dfp == &bf[1]) {
796 dfp = &bf[0];
797 ASSERT(dfp2 == dfp);
798 dfp2 = &bf[1];
799 }
800 xfs_dir2_data_freeremove(hdr, dfp2, needlogp);
801 xfs_dir2_data_freeremove(hdr, dfp, needlogp);
802 /*
803 * Now insert the new entry.
804 */
805 dfp = xfs_dir2_data_freeinsert(hdr, prevdup, needlogp);
806 ASSERT(dfp == &bf[0]);
807 ASSERT(dfp->length == prevdup->length);
808 ASSERT(!dfp[1].length);
809 ASSERT(!dfp[2].length);
810 }
811 }
812 /*
813 * The entry before us is free, merge with it.
814 */
815 else if (prevdup) {
816 dfp = xfs_dir2_data_freefind(hdr, prevdup);
817 be16_add_cpu(&prevdup->length, len);
818 *xfs_dir2_data_unused_tag_p(prevdup) =
819 cpu_to_be16((char *)prevdup - (char *)hdr);
820 xfs_dir2_data_log_unused(tp, bp, prevdup);
821 /*
822 * If the previous entry was in the table, the new entry
823 * is longer, so it will be in the table too. Remove
824 * the old one and add the new one.
825 */
826 if (dfp) {
827 xfs_dir2_data_freeremove(hdr, dfp, needlogp);
828 xfs_dir2_data_freeinsert(hdr, prevdup, needlogp);
829 }
830 /*
831 * Otherwise we need a scan if the new entry is big enough.
832 */
833 else {
834 needscan = be16_to_cpu(prevdup->length) >
835 be16_to_cpu(bf[2].length);
836 }
837 }
838 /*
839 * The following entry is free, merge with it.
840 */
841 else if (postdup) {
842 dfp = xfs_dir2_data_freefind(hdr, postdup);
843 newdup = (xfs_dir2_data_unused_t *)((char *)hdr + offset);
844 newdup->freetag = cpu_to_be16(XFS_DIR2_DATA_FREE_TAG);
845 newdup->length = cpu_to_be16(len + be16_to_cpu(postdup->length));
846 *xfs_dir2_data_unused_tag_p(newdup) =
847 cpu_to_be16((char *)newdup - (char *)hdr);
848 xfs_dir2_data_log_unused(tp, bp, newdup);
849 /*
850 * If the following entry was in the table, the new entry
851 * is longer, so it will be in the table too. Remove
852 * the old one and add the new one.
853 */
854 if (dfp) {
855 xfs_dir2_data_freeremove(hdr, dfp, needlogp);
856 xfs_dir2_data_freeinsert(hdr, newdup, needlogp);
857 }
858 /*
859 * Otherwise we need a scan if the new entry is big enough.
860 */
861 else {
862 needscan = be16_to_cpu(newdup->length) >
863 be16_to_cpu(bf[2].length);
864 }
865 }
866 /*
867 * Neither neighbor is free. Make a new entry.
868 */
869 else {
870 newdup = (xfs_dir2_data_unused_t *)((char *)hdr + offset);
871 newdup->freetag = cpu_to_be16(XFS_DIR2_DATA_FREE_TAG);
872 newdup->length = cpu_to_be16(len);
873 *xfs_dir2_data_unused_tag_p(newdup) =
874 cpu_to_be16((char *)newdup - (char *)hdr);
875 xfs_dir2_data_log_unused(tp, bp, newdup);
876 xfs_dir2_data_freeinsert(hdr, newdup, needlogp);
877 }
878 *needscanp = needscan;
879 }
880
881 /*
882 * Take a byte range out of an existing unused space and make it un-free.
883 */
884 void
885 xfs_dir2_data_use_free(
886 struct xfs_trans *tp,
887 struct xfs_buf *bp,
888 xfs_dir2_data_unused_t *dup, /* unused entry */
889 xfs_dir2_data_aoff_t offset, /* starting offset to use */
890 xfs_dir2_data_aoff_t len, /* length to use */
891 int *needlogp, /* out: need to log header */
892 int *needscanp) /* out: need regen bestfree */
893 {
894 xfs_dir2_data_hdr_t *hdr; /* data block header */
895 xfs_dir2_data_free_t *dfp; /* bestfree pointer */
896 int matchback; /* matches end of freespace */
897 int matchfront; /* matches start of freespace */
898 int needscan; /* need to regen bestfree */
899 xfs_dir2_data_unused_t *newdup; /* new unused entry */
900 xfs_dir2_data_unused_t *newdup2; /* another new unused entry */
901 int oldlen; /* old unused entry's length */
902 struct xfs_dir2_data_free *bf;
903
904 hdr = bp->b_addr;
905 ASSERT(hdr->magic == cpu_to_be32(XFS_DIR2_DATA_MAGIC) ||
906 hdr->magic == cpu_to_be32(XFS_DIR3_DATA_MAGIC) ||
907 hdr->magic == cpu_to_be32(XFS_DIR2_BLOCK_MAGIC) ||
908 hdr->magic == cpu_to_be32(XFS_DIR3_BLOCK_MAGIC));
909 ASSERT(be16_to_cpu(dup->freetag) == XFS_DIR2_DATA_FREE_TAG);
910 ASSERT(offset >= (char *)dup - (char *)hdr);
911 ASSERT(offset + len <= (char *)dup + be16_to_cpu(dup->length) - (char *)hdr);
912 ASSERT((char *)dup - (char *)hdr == be16_to_cpu(*xfs_dir2_data_unused_tag_p(dup)));
913 /*
914 * Look up the entry in the bestfree table.
915 */
916 dfp = xfs_dir2_data_freefind(hdr, dup);
917 oldlen = be16_to_cpu(dup->length);
918 bf = xfs_dir3_data_bestfree_p(hdr);
919 ASSERT(dfp || oldlen <= be16_to_cpu(bf[2].length));
920 /*
921 * Check for alignment with front and back of the entry.
922 */
923 matchfront = (char *)dup - (char *)hdr == offset;
924 matchback = (char *)dup + oldlen - (char *)hdr == offset + len;
925 ASSERT(*needscanp == 0);
926 needscan = 0;
927 /*
928 * If we matched it exactly we just need to get rid of it from
929 * the bestfree table.
930 */
931 if (matchfront && matchback) {
932 if (dfp) {
933 needscan = (bf[2].offset != 0);
934 if (!needscan)
935 xfs_dir2_data_freeremove(hdr, dfp, needlogp);
936 }
937 }
938 /*
939 * We match the first part of the entry.
940 * Make a new entry with the remaining freespace.
941 */
942 else if (matchfront) {
943 newdup = (xfs_dir2_data_unused_t *)((char *)hdr + offset + len);
944 newdup->freetag = cpu_to_be16(XFS_DIR2_DATA_FREE_TAG);
945 newdup->length = cpu_to_be16(oldlen - len);
946 *xfs_dir2_data_unused_tag_p(newdup) =
947 cpu_to_be16((char *)newdup - (char *)hdr);
948 xfs_dir2_data_log_unused(tp, bp, newdup);
949 /*
950 * If it was in the table, remove it and add the new one.
951 */
952 if (dfp) {
953 xfs_dir2_data_freeremove(hdr, dfp, needlogp);
954 dfp = xfs_dir2_data_freeinsert(hdr, newdup, needlogp);
955 ASSERT(dfp != NULL);
956 ASSERT(dfp->length == newdup->length);
957 ASSERT(be16_to_cpu(dfp->offset) == (char *)newdup - (char *)hdr);
958 /*
959 * If we got inserted at the last slot,
960 * that means we don't know if there was a better
961 * choice for the last slot, or not. Rescan.
962 */
963 needscan = dfp == &bf[2];
964 }
965 }
966 /*
967 * We match the last part of the entry.
968 * Trim the allocated space off the tail of the entry.
969 */
970 else if (matchback) {
971 newdup = dup;
972 newdup->length = cpu_to_be16(((char *)hdr + offset) - (char *)newdup);
973 *xfs_dir2_data_unused_tag_p(newdup) =
974 cpu_to_be16((char *)newdup - (char *)hdr);
975 xfs_dir2_data_log_unused(tp, bp, newdup);
976 /*
977 * If it was in the table, remove it and add the new one.
978 */
979 if (dfp) {
980 xfs_dir2_data_freeremove(hdr, dfp, needlogp);
981 dfp = xfs_dir2_data_freeinsert(hdr, newdup, needlogp);
982 ASSERT(dfp != NULL);
983 ASSERT(dfp->length == newdup->length);
984 ASSERT(be16_to_cpu(dfp->offset) == (char *)newdup - (char *)hdr);
985 /*
986 * If we got inserted at the last slot,
987 * that means we don't know if there was a better
988 * choice for the last slot, or not. Rescan.
989 */
990 needscan = dfp == &bf[2];
991 }
992 }
993 /*
994 * Poking out the middle of an entry.
995 * Make two new entries.
996 */
997 else {
998 newdup = dup;
999 newdup->length = cpu_to_be16(((char *)hdr + offset) - (char *)newdup);
1000 *xfs_dir2_data_unused_tag_p(newdup) =
1001 cpu_to_be16((char *)newdup - (char *)hdr);
1002 xfs_dir2_data_log_unused(tp, bp, newdup);
1003 newdup2 = (xfs_dir2_data_unused_t *)((char *)hdr + offset + len);
1004 newdup2->freetag = cpu_to_be16(XFS_DIR2_DATA_FREE_TAG);
1005 newdup2->length = cpu_to_be16(oldlen - len - be16_to_cpu(newdup->length));
1006 *xfs_dir2_data_unused_tag_p(newdup2) =
1007 cpu_to_be16((char *)newdup2 - (char *)hdr);
1008 xfs_dir2_data_log_unused(tp, bp, newdup2);
1009 /*
1010 * If the old entry was in the table, we need to scan
1011 * if the 3rd entry was valid, since these entries
1012 * are smaller than the old one.
1013 * If we don't need to scan that means there were 1 or 2
1014 * entries in the table, and removing the old and adding
1015 * the 2 new will work.
1016 */
1017 if (dfp) {
1018 needscan = (bf[2].length != 0);
1019 if (!needscan) {
1020 xfs_dir2_data_freeremove(hdr, dfp, needlogp);
1021 xfs_dir2_data_freeinsert(hdr, newdup, needlogp);
1022 xfs_dir2_data_freeinsert(hdr, newdup2,
1023 needlogp);
1024 }
1025 }
1026 }
1027 *needscanp = needscan;
1028 }
Linux with added FPC-III support