projects / deliverable / linux.git / blob
? search:
summary | shortlog | log | commit | commitdiff | tree
blame | history | raw | HEAD
xfs: merge xfs_ag.h into xfs_format.h
[deliverable/linux.git] / fs / xfs / libxfs / xfs_dir2_block.c
1 /*
2 * Copyright (c) 2000-2003,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_format.h"
22 #include "xfs_log_format.h"
23 #include "xfs_trans_resv.h"
24 #include "xfs_sb.h"
25 #include "xfs_mount.h"
26 #include "xfs_da_format.h"
27 #include "xfs_da_btree.h"
28 #include "xfs_inode.h"
29 #include "xfs_trans.h"
30 #include "xfs_inode_item.h"
31 #include "xfs_bmap.h"
32 #include "xfs_buf_item.h"
33 #include "xfs_dir2.h"
34 #include "xfs_dir2_priv.h"
35 #include "xfs_error.h"
36 #include "xfs_trace.h"
37 #include "xfs_cksum.h"
38
39 /*
40 * Local function prototypes.
41 */
42 static void xfs_dir2_block_log_leaf(xfs_trans_t *tp, struct xfs_buf *bp,
43 int first, int last);
44 static void xfs_dir2_block_log_tail(xfs_trans_t *tp, struct xfs_buf *bp);
45 static int xfs_dir2_block_lookup_int(xfs_da_args_t *args, struct xfs_buf **bpp,
46 int *entno);
47 static int xfs_dir2_block_sort(const void *a, const void *b);
48
49 static xfs_dahash_t xfs_dir_hash_dot, xfs_dir_hash_dotdot;
50
51 /*
52 * One-time startup routine called from xfs_init().
53 */
54 void
55 xfs_dir_startup(void)
56 {
57 xfs_dir_hash_dot = xfs_da_hashname((unsigned char *)".", 1);
58 xfs_dir_hash_dotdot = xfs_da_hashname((unsigned char *)"..", 2);
59 }
60
61 static bool
62 xfs_dir3_block_verify(
63 struct xfs_buf *bp)
64 {
65 struct xfs_mount *mp = bp->b_target->bt_mount;
66 struct xfs_dir3_blk_hdr *hdr3 = bp->b_addr;
67
68 if (xfs_sb_version_hascrc(&mp->m_sb)) {
69 if (hdr3->magic != cpu_to_be32(XFS_DIR3_BLOCK_MAGIC))
70 return false;
71 if (!uuid_equal(&hdr3->uuid, &mp->m_sb.sb_uuid))
72 return false;
73 if (be64_to_cpu(hdr3->blkno) != bp->b_bn)
74 return false;
75 } else {
76 if (hdr3->magic != cpu_to_be32(XFS_DIR2_BLOCK_MAGIC))
77 return false;
78 }
79 if (__xfs_dir3_data_check(NULL, bp))
80 return false;
81 return true;
82 }
83
84 static void
85 xfs_dir3_block_read_verify(
86 struct xfs_buf *bp)
87 {
88 struct xfs_mount *mp = bp->b_target->bt_mount;
89
90 if (xfs_sb_version_hascrc(&mp->m_sb) &&
91 !xfs_buf_verify_cksum(bp, XFS_DIR3_DATA_CRC_OFF))
92 xfs_buf_ioerror(bp, -EFSBADCRC);
93 else if (!xfs_dir3_block_verify(bp))
94 xfs_buf_ioerror(bp, -EFSCORRUPTED);
95
96 if (bp->b_error)
97 xfs_verifier_error(bp);
98 }
99
100 static void
101 xfs_dir3_block_write_verify(
102 struct xfs_buf *bp)
103 {
104 struct xfs_mount *mp = bp->b_target->bt_mount;
105 struct xfs_buf_log_item *bip = bp->b_fspriv;
106 struct xfs_dir3_blk_hdr *hdr3 = bp->b_addr;
107
108 if (!xfs_dir3_block_verify(bp)) {
109 xfs_buf_ioerror(bp, -EFSCORRUPTED);
110 xfs_verifier_error(bp);
111 return;
112 }
113
114 if (!xfs_sb_version_hascrc(&mp->m_sb))
115 return;
116
117 if (bip)
118 hdr3->lsn = cpu_to_be64(bip->bli_item.li_lsn);
119
120 xfs_buf_update_cksum(bp, XFS_DIR3_DATA_CRC_OFF);
121 }
122
123 const struct xfs_buf_ops xfs_dir3_block_buf_ops = {
124 .verify_read = xfs_dir3_block_read_verify,
125 .verify_write = xfs_dir3_block_write_verify,
126 };
127
128 int
129 xfs_dir3_block_read(
130 struct xfs_trans *tp,
131 struct xfs_inode *dp,
132 struct xfs_buf **bpp)
133 {
134 struct xfs_mount *mp = dp->i_mount;
135 int err;
136
137 err = xfs_da_read_buf(tp, dp, mp->m_dir_geo->datablk, -1, bpp,
138 XFS_DATA_FORK, &xfs_dir3_block_buf_ops);
139 if (!err && tp)
140 xfs_trans_buf_set_type(tp, *bpp, XFS_BLFT_DIR_BLOCK_BUF);
141 return err;
142 }
143
144 static void
145 xfs_dir3_block_init(
146 struct xfs_mount *mp,
147 struct xfs_trans *tp,
148 struct xfs_buf *bp,
149 struct xfs_inode *dp)
150 {
151 struct xfs_dir3_blk_hdr *hdr3 = bp->b_addr;
152
153 bp->b_ops = &xfs_dir3_block_buf_ops;
154 xfs_trans_buf_set_type(tp, bp, XFS_BLFT_DIR_BLOCK_BUF);
155
156 if (xfs_sb_version_hascrc(&mp->m_sb)) {
157 memset(hdr3, 0, sizeof(*hdr3));
158 hdr3->magic = cpu_to_be32(XFS_DIR3_BLOCK_MAGIC);
159 hdr3->blkno = cpu_to_be64(bp->b_bn);
160 hdr3->owner = cpu_to_be64(dp->i_ino);
161 uuid_copy(&hdr3->uuid, &mp->m_sb.sb_uuid);
162 return;
163
164 }
165 hdr3->magic = cpu_to_be32(XFS_DIR2_BLOCK_MAGIC);
166 }
167
168 static void
169 xfs_dir2_block_need_space(
170 struct xfs_inode *dp,
171 struct xfs_dir2_data_hdr *hdr,
172 struct xfs_dir2_block_tail *btp,
173 struct xfs_dir2_leaf_entry *blp,
174 __be16 **tagpp,
175 struct xfs_dir2_data_unused **dupp,
176 struct xfs_dir2_data_unused **enddupp,
177 int *compact,
178 int len)
179 {
180 struct xfs_dir2_data_free *bf;
181 __be16 *tagp = NULL;
182 struct xfs_dir2_data_unused *dup = NULL;
183 struct xfs_dir2_data_unused *enddup = NULL;
184
185 *compact = 0;
186 bf = dp->d_ops->data_bestfree_p(hdr);
187
188 /*
189 * If there are stale entries we'll use one for the leaf.
190 */
191 if (btp->stale) {
192 if (be16_to_cpu(bf[0].length) >= len) {
193 /*
194 * The biggest entry enough to avoid compaction.
195 */
196 dup = (xfs_dir2_data_unused_t *)
197 ((char *)hdr + be16_to_cpu(bf[0].offset));
198 goto out;
199 }
200
201 /*
202 * Will need to compact to make this work.
203 * Tag just before the first leaf entry.
204 */
205 *compact = 1;
206 tagp = (__be16 *)blp - 1;
207
208 /* Data object just before the first leaf entry. */
209 dup = (xfs_dir2_data_unused_t *)((char *)hdr + be16_to_cpu(*tagp));
210
211 /*
212 * If it's not free then the data will go where the
213 * leaf data starts now, if it works at all.
214 */
215 if (be16_to_cpu(dup->freetag) == XFS_DIR2_DATA_FREE_TAG) {
216 if (be16_to_cpu(dup->length) + (be32_to_cpu(btp->stale) - 1) *
217 (uint)sizeof(*blp) < len)
218 dup = NULL;
219 } else if ((be32_to_cpu(btp->stale) - 1) * (uint)sizeof(*blp) < len)
220 dup = NULL;
221 else
222 dup = (xfs_dir2_data_unused_t *)blp;
223 goto out;
224 }
225
226 /*
227 * no stale entries, so just use free space.
228 * Tag just before the first leaf entry.
229 */
230 tagp = (__be16 *)blp - 1;
231
232 /* Data object just before the first leaf entry. */
233 enddup = (xfs_dir2_data_unused_t *)((char *)hdr + be16_to_cpu(*tagp));
234
235 /*
236 * If it's not free then can't do this add without cleaning up:
237 * the space before the first leaf entry needs to be free so it
238 * can be expanded to hold the pointer to the new entry.
239 */
240 if (be16_to_cpu(enddup->freetag) == XFS_DIR2_DATA_FREE_TAG) {
241 /*
242 * Check out the biggest freespace and see if it's the same one.
243 */
244 dup = (xfs_dir2_data_unused_t *)
245 ((char *)hdr + be16_to_cpu(bf[0].offset));
246 if (dup != enddup) {
247 /*
248 * Not the same free entry, just check its length.
249 */
250 if (be16_to_cpu(dup->length) < len)
251 dup = NULL;
252 goto out;
253 }
254
255 /*
256 * It is the biggest freespace, can it hold the leaf too?
257 */
258 if (be16_to_cpu(dup->length) < len + (uint)sizeof(*blp)) {
259 /*
260 * Yes, use the second-largest entry instead if it works.
261 */
262 if (be16_to_cpu(bf[1].length) >= len)
263 dup = (xfs_dir2_data_unused_t *)
264 ((char *)hdr + be16_to_cpu(bf[1].offset));
265 else
266 dup = NULL;
267 }
268 }
269 out:
270 *tagpp = tagp;
271 *dupp = dup;
272 *enddupp = enddup;
273 }
274
275 /*
276 * compact the leaf entries.
277 * Leave the highest-numbered stale entry stale.
278 * XXX should be the one closest to mid but mid is not yet computed.
279 */
280 static void
281 xfs_dir2_block_compact(
282 struct xfs_da_args *args,
283 struct xfs_buf *bp,
284 struct xfs_dir2_data_hdr *hdr,
285 struct xfs_dir2_block_tail *btp,
286 struct xfs_dir2_leaf_entry *blp,
287 int *needlog,
288 int *lfloghigh,
289 int *lfloglow)
290 {
291 int fromidx; /* source leaf index */
292 int toidx; /* target leaf index */
293 int needscan = 0;
294 int highstale; /* high stale index */
295
296 fromidx = toidx = be32_to_cpu(btp->count) - 1;
297 highstale = *lfloghigh = -1;
298 for (; fromidx >= 0; fromidx--) {
299 if (blp[fromidx].address == cpu_to_be32(XFS_DIR2_NULL_DATAPTR)) {
300 if (highstale == -1)
301 highstale = toidx;
302 else {
303 if (*lfloghigh == -1)
304 *lfloghigh = toidx;
305 continue;
306 }
307 }
308 if (fromidx < toidx)
309 blp[toidx] = blp[fromidx];
310 toidx--;
311 }
312 *lfloglow = toidx + 1 - (be32_to_cpu(btp->stale) - 1);
313 *lfloghigh -= be32_to_cpu(btp->stale) - 1;
314 be32_add_cpu(&btp->count, -(be32_to_cpu(btp->stale) - 1));
315 xfs_dir2_data_make_free(args, bp,
316 (xfs_dir2_data_aoff_t)((char *)blp - (char *)hdr),
317 (xfs_dir2_data_aoff_t)((be32_to_cpu(btp->stale) - 1) * sizeof(*blp)),
318 needlog, &needscan);
319 btp->stale = cpu_to_be32(1);
320 /*
321 * If we now need to rebuild the bestfree map, do so.
322 * This needs to happen before the next call to use_free.
323 */
324 if (needscan)
325 xfs_dir2_data_freescan(args->dp, hdr, needlog);
326 }
327
328 /*
329 * Add an entry to a block directory.
330 */
331 int /* error */
332 xfs_dir2_block_addname(
333 xfs_da_args_t *args) /* directory op arguments */
334 {
335 xfs_dir2_data_hdr_t *hdr; /* block header */
336 xfs_dir2_leaf_entry_t *blp; /* block leaf entries */
337 struct xfs_buf *bp; /* buffer for block */
338 xfs_dir2_block_tail_t *btp; /* block tail */
339 int compact; /* need to compact leaf ents */
340 xfs_dir2_data_entry_t *dep; /* block data entry */
341 xfs_inode_t *dp; /* directory inode */
342 xfs_dir2_data_unused_t *dup; /* block unused entry */
343 int error; /* error return value */
344 xfs_dir2_data_unused_t *enddup=NULL; /* unused at end of data */
345 xfs_dahash_t hash; /* hash value of found entry */
346 int high; /* high index for binary srch */
347 int highstale; /* high stale index */
348 int lfloghigh=0; /* last final leaf to log */
349 int lfloglow=0; /* first final leaf to log */
350 int len; /* length of the new entry */
351 int low; /* low index for binary srch */
352 int lowstale; /* low stale index */
353 int mid=0; /* midpoint for binary srch */
354 xfs_mount_t *mp; /* filesystem mount point */
355 int needlog; /* need to log header */
356 int needscan; /* need to rescan freespace */
357 __be16 *tagp; /* pointer to tag value */
358 xfs_trans_t *tp; /* transaction structure */
359
360 trace_xfs_dir2_block_addname(args);
361
362 dp = args->dp;
363 tp = args->trans;
364 mp = dp->i_mount;
365
366 /* Read the (one and only) directory block into bp. */
367 error = xfs_dir3_block_read(tp, dp, &bp);
368 if (error)
369 return error;
370
371 len = dp->d_ops->data_entsize(args->namelen);
372
373 /*
374 * Set up pointers to parts of the block.
375 */
376 hdr = bp->b_addr;
377 btp = xfs_dir2_block_tail_p(args->geo, hdr);
378 blp = xfs_dir2_block_leaf_p(btp);
379
380 /*
381 * Find out if we can reuse stale entries or whether we need extra
382 * space for entry and new leaf.
383 */
384 xfs_dir2_block_need_space(dp, hdr, btp, blp, &tagp, &dup,
385 &enddup, &compact, len);
386
387 /*
388 * Done everything we need for a space check now.
389 */
390 if (args->op_flags & XFS_DA_OP_JUSTCHECK) {
391 xfs_trans_brelse(tp, bp);
392 if (!dup)
393 return -ENOSPC;
394 return 0;
395 }
396
397 /*
398 * If we don't have space for the new entry & leaf ...
399 */
400 if (!dup) {
401 /* Don't have a space reservation: return no-space. */
402 if (args->total == 0)
403 return -ENOSPC;
404 /*
405 * Convert to the next larger format.
406 * Then add the new entry in that format.
407 */
408 error = xfs_dir2_block_to_leaf(args, bp);
409 if (error)
410 return error;
411 return xfs_dir2_leaf_addname(args);
412 }
413
414 needlog = needscan = 0;
415
416 /*
417 * If need to compact the leaf entries, do it now.
418 */
419 if (compact) {
420 xfs_dir2_block_compact(args, bp, hdr, btp, blp, &needlog,
421 &lfloghigh, &lfloglow);
422 /* recalculate blp post-compaction */
423 blp = xfs_dir2_block_leaf_p(btp);
424 } else if (btp->stale) {
425 /*
426 * Set leaf logging boundaries to impossible state.
427 * For the no-stale case they're set explicitly.
428 */
429 lfloglow = be32_to_cpu(btp->count);
430 lfloghigh = -1;
431 }
432
433 /*
434 * Find the slot that's first lower than our hash value, -1 if none.
435 */
436 for (low = 0, high = be32_to_cpu(btp->count) - 1; low <= high; ) {
437 mid = (low + high) >> 1;
438 if ((hash = be32_to_cpu(blp[mid].hashval)) == args->hashval)
439 break;
440 if (hash < args->hashval)
441 low = mid + 1;
442 else
443 high = mid - 1;
444 }
445 while (mid >= 0 && be32_to_cpu(blp[mid].hashval) >= args->hashval) {
446 mid--;
447 }
448 /*
449 * No stale entries, will use enddup space to hold new leaf.
450 */
451 if (!btp->stale) {
452 /*
453 * Mark the space needed for the new leaf entry, now in use.
454 */
455 xfs_dir2_data_use_free(args, bp, enddup,
456 (xfs_dir2_data_aoff_t)
457 ((char *)enddup - (char *)hdr + be16_to_cpu(enddup->length) -
458 sizeof(*blp)),
459 (xfs_dir2_data_aoff_t)sizeof(*blp),
460 &needlog, &needscan);
461 /*
462 * Update the tail (entry count).
463 */
464 be32_add_cpu(&btp->count, 1);
465 /*
466 * If we now need to rebuild the bestfree map, do so.
467 * This needs to happen before the next call to use_free.
468 */
469 if (needscan) {
470 xfs_dir2_data_freescan(dp, hdr, &needlog);
471 needscan = 0;
472 }
473 /*
474 * Adjust pointer to the first leaf entry, we're about to move
475 * the table up one to open up space for the new leaf entry.
476 * Then adjust our index to match.
477 */
478 blp--;
479 mid++;
480 if (mid)
481 memmove(blp, &blp[1], mid * sizeof(*blp));
482 lfloglow = 0;
483 lfloghigh = mid;
484 }
485 /*
486 * Use a stale leaf for our new entry.
487 */
488 else {
489 for (lowstale = mid;
490 lowstale >= 0 &&
491 blp[lowstale].address !=
492 cpu_to_be32(XFS_DIR2_NULL_DATAPTR);
493 lowstale--)
494 continue;
495 for (highstale = mid + 1;
496 highstale < be32_to_cpu(btp->count) &&
497 blp[highstale].address !=
498 cpu_to_be32(XFS_DIR2_NULL_DATAPTR) &&
499 (lowstale < 0 || mid - lowstale > highstale - mid);
500 highstale++)
501 continue;
502 /*
503 * Move entries toward the low-numbered stale entry.
504 */
505 if (lowstale >= 0 &&
506 (highstale == be32_to_cpu(btp->count) ||
507 mid - lowstale <= highstale - mid)) {
508 if (mid - lowstale)
509 memmove(&blp[lowstale], &blp[lowstale + 1],
510 (mid - lowstale) * sizeof(*blp));
511 lfloglow = MIN(lowstale, lfloglow);
512 lfloghigh = MAX(mid, lfloghigh);
513 }
514 /*
515 * Move entries toward the high-numbered stale entry.
516 */
517 else {
518 ASSERT(highstale < be32_to_cpu(btp->count));
519 mid++;
520 if (highstale - mid)
521 memmove(&blp[mid + 1], &blp[mid],
522 (highstale - mid) * sizeof(*blp));
523 lfloglow = MIN(mid, lfloglow);
524 lfloghigh = MAX(highstale, lfloghigh);
525 }
526 be32_add_cpu(&btp->stale, -1);
527 }
528 /*
529 * Point to the new data entry.
530 */
531 dep = (xfs_dir2_data_entry_t *)dup;
532 /*
533 * Fill in the leaf entry.
534 */
535 blp[mid].hashval = cpu_to_be32(args->hashval);
536 blp[mid].address = cpu_to_be32(xfs_dir2_byte_to_dataptr(
537 (char *)dep - (char *)hdr));
538 xfs_dir2_block_log_leaf(tp, bp, lfloglow, lfloghigh);
539 /*
540 * Mark space for the data entry used.
541 */
542 xfs_dir2_data_use_free(args, bp, dup,
543 (xfs_dir2_data_aoff_t)((char *)dup - (char *)hdr),
544 (xfs_dir2_data_aoff_t)len, &needlog, &needscan);
545 /*
546 * Create the new data entry.
547 */
548 dep->inumber = cpu_to_be64(args->inumber);
549 dep->namelen = args->namelen;
550 memcpy(dep->name, args->name, args->namelen);
551 dp->d_ops->data_put_ftype(dep, args->filetype);
552 tagp = dp->d_ops->data_entry_tag_p(dep);
553 *tagp = cpu_to_be16((char *)dep - (char *)hdr);
554 /*
555 * Clean up the bestfree array and log the header, tail, and entry.
556 */
557 if (needscan)
558 xfs_dir2_data_freescan(dp, hdr, &needlog);
559 if (needlog)
560 xfs_dir2_data_log_header(args, bp);
561 xfs_dir2_block_log_tail(tp, bp);
562 xfs_dir2_data_log_entry(args, bp, dep);
563 xfs_dir3_data_check(dp, bp);
564 return 0;
565 }
566
567 /*
568 * Log leaf entries from the block.
569 */
570 static void
571 xfs_dir2_block_log_leaf(
572 xfs_trans_t *tp, /* transaction structure */
573 struct xfs_buf *bp, /* block buffer */
574 int first, /* index of first logged leaf */
575 int last) /* index of last logged leaf */
576 {
577 xfs_dir2_data_hdr_t *hdr = bp->b_addr;
578 xfs_dir2_leaf_entry_t *blp;
579 xfs_dir2_block_tail_t *btp;
580
581 btp = xfs_dir2_block_tail_p(tp->t_mountp->m_dir_geo, hdr);
582 blp = xfs_dir2_block_leaf_p(btp);
583 xfs_trans_log_buf(tp, bp, (uint)((char *)&blp[first] - (char *)hdr),
584 (uint)((char *)&blp[last + 1] - (char *)hdr - 1));
585 }
586
587 /*
588 * Log the block tail.
589 */
590 static void
591 xfs_dir2_block_log_tail(
592 xfs_trans_t *tp, /* transaction structure */
593 struct xfs_buf *bp) /* block buffer */
594 {
595 xfs_dir2_data_hdr_t *hdr = bp->b_addr;
596 xfs_dir2_block_tail_t *btp;
597
598 btp = xfs_dir2_block_tail_p(tp->t_mountp->m_dir_geo, hdr);
599 xfs_trans_log_buf(tp, bp, (uint)((char *)btp - (char *)hdr),
600 (uint)((char *)(btp + 1) - (char *)hdr - 1));
601 }
602
603 /*
604 * Look up an entry in the block. This is the external routine,
605 * xfs_dir2_block_lookup_int does the real work.
606 */
607 int /* error */
608 xfs_dir2_block_lookup(
609 xfs_da_args_t *args) /* dir lookup arguments */
610 {
611 xfs_dir2_data_hdr_t *hdr; /* block header */
612 xfs_dir2_leaf_entry_t *blp; /* block leaf entries */
613 struct xfs_buf *bp; /* block buffer */
614 xfs_dir2_block_tail_t *btp; /* block tail */
615 xfs_dir2_data_entry_t *dep; /* block data entry */
616 xfs_inode_t *dp; /* incore inode */
617 int ent; /* entry index */
618 int error; /* error return value */
619 xfs_mount_t *mp; /* filesystem mount point */
620
621 trace_xfs_dir2_block_lookup(args);
622
623 /*
624 * Get the buffer, look up the entry.
625 * If not found (ENOENT) then return, have no buffer.
626 */
627 if ((error = xfs_dir2_block_lookup_int(args, &bp, &ent)))
628 return error;
629 dp = args->dp;
630 mp = dp->i_mount;
631 hdr = bp->b_addr;
632 xfs_dir3_data_check(dp, bp);
633 btp = xfs_dir2_block_tail_p(args->geo, hdr);
634 blp = xfs_dir2_block_leaf_p(btp);
635 /*
636 * Get the offset from the leaf entry, to point to the data.
637 */
638 dep = (xfs_dir2_data_entry_t *)((char *)hdr +
639 xfs_dir2_dataptr_to_off(args->geo,
640 be32_to_cpu(blp[ent].address)));
641 /*
642 * Fill in inode number, CI name if appropriate, release the block.
643 */
644 args->inumber = be64_to_cpu(dep->inumber);
645 args->filetype = dp->d_ops->data_get_ftype(dep);
646 error = xfs_dir_cilookup_result(args, dep->name, dep->namelen);
647 xfs_trans_brelse(args->trans, bp);
648 return error;
649 }
650
651 /*
652 * Internal block lookup routine.
653 */
654 static int /* error */
655 xfs_dir2_block_lookup_int(
656 xfs_da_args_t *args, /* dir lookup arguments */
657 struct xfs_buf **bpp, /* returned block buffer */
658 int *entno) /* returned entry number */
659 {
660 xfs_dir2_dataptr_t addr; /* data entry address */
661 xfs_dir2_data_hdr_t *hdr; /* block header */
662 xfs_dir2_leaf_entry_t *blp; /* block leaf entries */
663 struct xfs_buf *bp; /* block buffer */
664 xfs_dir2_block_tail_t *btp; /* block tail */
665 xfs_dir2_data_entry_t *dep; /* block data entry */
666 xfs_inode_t *dp; /* incore inode */
667 int error; /* error return value */
668 xfs_dahash_t hash; /* found hash value */
669 int high; /* binary search high index */
670 int low; /* binary search low index */
671 int mid; /* binary search current idx */
672 xfs_mount_t *mp; /* filesystem mount point */
673 xfs_trans_t *tp; /* transaction pointer */
674 enum xfs_dacmp cmp; /* comparison result */
675
676 dp = args->dp;
677 tp = args->trans;
678 mp = dp->i_mount;
679
680 error = xfs_dir3_block_read(tp, dp, &bp);
681 if (error)
682 return error;
683
684 hdr = bp->b_addr;
685 xfs_dir3_data_check(dp, bp);
686 btp = xfs_dir2_block_tail_p(args->geo, hdr);
687 blp = xfs_dir2_block_leaf_p(btp);
688 /*
689 * Loop doing a binary search for our hash value.
690 * Find our entry, ENOENT if it's not there.
691 */
692 for (low = 0, high = be32_to_cpu(btp->count) - 1; ; ) {
693 ASSERT(low <= high);
694 mid = (low + high) >> 1;
695 if ((hash = be32_to_cpu(blp[mid].hashval)) == args->hashval)
696 break;
697 if (hash < args->hashval)
698 low = mid + 1;
699 else
700 high = mid - 1;
701 if (low > high) {
702 ASSERT(args->op_flags & XFS_DA_OP_OKNOENT);
703 xfs_trans_brelse(tp, bp);
704 return -ENOENT;
705 }
706 }
707 /*
708 * Back up to the first one with the right hash value.
709 */
710 while (mid > 0 && be32_to_cpu(blp[mid - 1].hashval) == args->hashval) {
711 mid--;
712 }
713 /*
714 * Now loop forward through all the entries with the
715 * right hash value looking for our name.
716 */
717 do {
718 if ((addr = be32_to_cpu(blp[mid].address)) == XFS_DIR2_NULL_DATAPTR)
719 continue;
720 /*
721 * Get pointer to the entry from the leaf.
722 */
723 dep = (xfs_dir2_data_entry_t *)
724 ((char *)hdr + xfs_dir2_dataptr_to_off(args->geo, addr));
725 /*
726 * Compare name and if it's an exact match, return the index
727 * and buffer. If it's the first case-insensitive match, store
728 * the index and buffer and continue looking for an exact match.
729 */
730 cmp = mp->m_dirnameops->compname(args, dep->name, dep->namelen);
731 if (cmp != XFS_CMP_DIFFERENT && cmp != args->cmpresult) {
732 args->cmpresult = cmp;
733 *bpp = bp;
734 *entno = mid;
735 if (cmp == XFS_CMP_EXACT)
736 return 0;
737 }
738 } while (++mid < be32_to_cpu(btp->count) &&
739 be32_to_cpu(blp[mid].hashval) == hash);
740
741 ASSERT(args->op_flags & XFS_DA_OP_OKNOENT);
742 /*
743 * Here, we can only be doing a lookup (not a rename or replace).
744 * If a case-insensitive match was found earlier, return success.
745 */
746 if (args->cmpresult == XFS_CMP_CASE)
747 return 0;
748 /*
749 * No match, release the buffer and return ENOENT.
750 */
751 xfs_trans_brelse(tp, bp);
752 return -ENOENT;
753 }
754
755 /*
756 * Remove an entry from a block format directory.
757 * If that makes the block small enough to fit in shortform, transform it.
758 */
759 int /* error */
760 xfs_dir2_block_removename(
761 xfs_da_args_t *args) /* directory operation args */
762 {
763 xfs_dir2_data_hdr_t *hdr; /* block header */
764 xfs_dir2_leaf_entry_t *blp; /* block leaf pointer */
765 struct xfs_buf *bp; /* block buffer */
766 xfs_dir2_block_tail_t *btp; /* block tail */
767 xfs_dir2_data_entry_t *dep; /* block data entry */
768 xfs_inode_t *dp; /* incore inode */
769 int ent; /* block leaf entry index */
770 int error; /* error return value */
771 xfs_mount_t *mp; /* filesystem mount point */
772 int needlog; /* need to log block header */
773 int needscan; /* need to fixup bestfree */
774 xfs_dir2_sf_hdr_t sfh; /* shortform header */
775 int size; /* shortform size */
776 xfs_trans_t *tp; /* transaction pointer */
777
778 trace_xfs_dir2_block_removename(args);
779
780 /*
781 * Look up the entry in the block. Gets the buffer and entry index.
782 * It will always be there, the vnodeops level does a lookup first.
783 */
784 if ((error = xfs_dir2_block_lookup_int(args, &bp, &ent))) {
785 return error;
786 }
787 dp = args->dp;
788 tp = args->trans;
789 mp = dp->i_mount;
790 hdr = bp->b_addr;
791 btp = xfs_dir2_block_tail_p(args->geo, hdr);
792 blp = xfs_dir2_block_leaf_p(btp);
793 /*
794 * Point to the data entry using the leaf entry.
795 */
796 dep = (xfs_dir2_data_entry_t *)((char *)hdr +
797 xfs_dir2_dataptr_to_off(args->geo,
798 be32_to_cpu(blp[ent].address)));
799 /*
800 * Mark the data entry's space free.
801 */
802 needlog = needscan = 0;
803 xfs_dir2_data_make_free(args, bp,
804 (xfs_dir2_data_aoff_t)((char *)dep - (char *)hdr),
805 dp->d_ops->data_entsize(dep->namelen), &needlog, &needscan);
806 /*
807 * Fix up the block tail.
808 */
809 be32_add_cpu(&btp->stale, 1);
810 xfs_dir2_block_log_tail(tp, bp);
811 /*
812 * Remove the leaf entry by marking it stale.
813 */
814 blp[ent].address = cpu_to_be32(XFS_DIR2_NULL_DATAPTR);
815 xfs_dir2_block_log_leaf(tp, bp, ent, ent);
816 /*
817 * Fix up bestfree, log the header if necessary.
818 */
819 if (needscan)
820 xfs_dir2_data_freescan(dp, hdr, &needlog);
821 if (needlog)
822 xfs_dir2_data_log_header(args, bp);
823 xfs_dir3_data_check(dp, bp);
824 /*
825 * See if the size as a shortform is good enough.
826 */
827 size = xfs_dir2_block_sfsize(dp, hdr, &sfh);
828 if (size > XFS_IFORK_DSIZE(dp))
829 return 0;
830
831 /*
832 * If it works, do the conversion.
833 */
834 return xfs_dir2_block_to_sf(args, bp, size, &sfh);
835 }
836
837 /*
838 * Replace an entry in a V2 block directory.
839 * Change the inode number to the new value.
840 */
841 int /* error */
842 xfs_dir2_block_replace(
843 xfs_da_args_t *args) /* directory operation args */
844 {
845 xfs_dir2_data_hdr_t *hdr; /* block header */
846 xfs_dir2_leaf_entry_t *blp; /* block leaf entries */
847 struct xfs_buf *bp; /* block buffer */
848 xfs_dir2_block_tail_t *btp; /* block tail */
849 xfs_dir2_data_entry_t *dep; /* block data entry */
850 xfs_inode_t *dp; /* incore inode */
851 int ent; /* leaf entry index */
852 int error; /* error return value */
853 xfs_mount_t *mp; /* filesystem mount point */
854
855 trace_xfs_dir2_block_replace(args);
856
857 /*
858 * Lookup the entry in the directory. Get buffer and entry index.
859 * This will always succeed since the caller has already done a lookup.
860 */
861 if ((error = xfs_dir2_block_lookup_int(args, &bp, &ent))) {
862 return error;
863 }
864 dp = args->dp;
865 mp = dp->i_mount;
866 hdr = bp->b_addr;
867 btp = xfs_dir2_block_tail_p(args->geo, hdr);
868 blp = xfs_dir2_block_leaf_p(btp);
869 /*
870 * Point to the data entry we need to change.
871 */
872 dep = (xfs_dir2_data_entry_t *)((char *)hdr +
873 xfs_dir2_dataptr_to_off(args->geo,
874 be32_to_cpu(blp[ent].address)));
875 ASSERT(be64_to_cpu(dep->inumber) != args->inumber);
876 /*
877 * Change the inode number to the new value.
878 */
879 dep->inumber = cpu_to_be64(args->inumber);
880 dp->d_ops->data_put_ftype(dep, args->filetype);
881 xfs_dir2_data_log_entry(args, bp, dep);
882 xfs_dir3_data_check(dp, bp);
883 return 0;
884 }
885
886 /*
887 * Qsort comparison routine for the block leaf entries.
888 */
889 static int /* sort order */
890 xfs_dir2_block_sort(
891 const void *a, /* first leaf entry */
892 const void *b) /* second leaf entry */
893 {
894 const xfs_dir2_leaf_entry_t *la; /* first leaf entry */
895 const xfs_dir2_leaf_entry_t *lb; /* second leaf entry */
896
897 la = a;
898 lb = b;
899 return be32_to_cpu(la->hashval) < be32_to_cpu(lb->hashval) ? -1 :
900 (be32_to_cpu(la->hashval) > be32_to_cpu(lb->hashval) ? 1 : 0);
901 }
902
903 /*
904 * Convert a V2 leaf directory to a V2 block directory if possible.
905 */
906 int /* error */
907 xfs_dir2_leaf_to_block(
908 xfs_da_args_t *args, /* operation arguments */
909 struct xfs_buf *lbp, /* leaf buffer */
910 struct xfs_buf *dbp) /* data buffer */
911 {
912 __be16 *bestsp; /* leaf bests table */
913 xfs_dir2_data_hdr_t *hdr; /* block header */
914 xfs_dir2_block_tail_t *btp; /* block tail */
915 xfs_inode_t *dp; /* incore directory inode */
916 xfs_dir2_data_unused_t *dup; /* unused data entry */
917 int error; /* error return value */
918 int from; /* leaf from index */
919 xfs_dir2_leaf_t *leaf; /* leaf structure */
920 xfs_dir2_leaf_entry_t *lep; /* leaf entry */
921 xfs_dir2_leaf_tail_t *ltp; /* leaf tail structure */
922 xfs_mount_t *mp; /* file system mount point */
923 int needlog; /* need to log data header */
924 int needscan; /* need to scan for bestfree */
925 xfs_dir2_sf_hdr_t sfh; /* shortform header */
926 int size; /* bytes used */
927 __be16 *tagp; /* end of entry (tag) */
928 int to; /* block/leaf to index */
929 xfs_trans_t *tp; /* transaction pointer */
930 struct xfs_dir2_leaf_entry *ents;
931 struct xfs_dir3_icleaf_hdr leafhdr;
932
933 trace_xfs_dir2_leaf_to_block(args);
934
935 dp = args->dp;
936 tp = args->trans;
937 mp = dp->i_mount;
938 leaf = lbp->b_addr;
939 dp->d_ops->leaf_hdr_from_disk(&leafhdr, leaf);
940 ents = dp->d_ops->leaf_ents_p(leaf);
941 ltp = xfs_dir2_leaf_tail_p(args->geo, leaf);
942
943 ASSERT(leafhdr.magic == XFS_DIR2_LEAF1_MAGIC ||
944 leafhdr.magic == XFS_DIR3_LEAF1_MAGIC);
945 /*
946 * If there are data blocks other than the first one, take this
947 * opportunity to remove trailing empty data blocks that may have
948 * been left behind during no-space-reservation operations.
949 * These will show up in the leaf bests table.
950 */
951 while (dp->i_d.di_size > args->geo->blksize) {
952 int hdrsz;
953
954 hdrsz = dp->d_ops->data_entry_offset;
955 bestsp = xfs_dir2_leaf_bests_p(ltp);
956 if (be16_to_cpu(bestsp[be32_to_cpu(ltp->bestcount) - 1]) ==
957 args->geo->blksize - hdrsz) {
958 if ((error =
959 xfs_dir2_leaf_trim_data(args, lbp,
960 (xfs_dir2_db_t)(be32_to_cpu(ltp->bestcount) - 1))))
961 return error;
962 } else
963 return 0;
964 }
965 /*
966 * Read the data block if we don't already have it, give up if it fails.
967 */
968 if (!dbp) {
969 error = xfs_dir3_data_read(tp, dp, args->geo->datablk, -1, &dbp);
970 if (error)
971 return error;
972 }
973 hdr = dbp->b_addr;
974 ASSERT(hdr->magic == cpu_to_be32(XFS_DIR2_DATA_MAGIC) ||
975 hdr->magic == cpu_to_be32(XFS_DIR3_DATA_MAGIC));
976
977 /*
978 * Size of the "leaf" area in the block.
979 */
980 size = (uint)sizeof(xfs_dir2_block_tail_t) +
981 (uint)sizeof(*lep) * (leafhdr.count - leafhdr.stale);
982 /*
983 * Look at the last data entry.
984 */
985 tagp = (__be16 *)((char *)hdr + args->geo->blksize) - 1;
986 dup = (xfs_dir2_data_unused_t *)((char *)hdr + be16_to_cpu(*tagp));
987 /*
988 * If it's not free or is too short we can't do it.
989 */
990 if (be16_to_cpu(dup->freetag) != XFS_DIR2_DATA_FREE_TAG ||
991 be16_to_cpu(dup->length) < size)
992 return 0;
993
994 /*
995 * Start converting it to block form.
996 */
997 xfs_dir3_block_init(mp, tp, dbp, dp);
998
999 needlog = 1;
1000 needscan = 0;
1001 /*
1002 * Use up the space at the end of the block (blp/btp).
1003 */
1004 xfs_dir2_data_use_free(args, dbp, dup, args->geo->blksize - size, size,
1005 &needlog, &needscan);
1006 /*
1007 * Initialize the block tail.
1008 */
1009 btp = xfs_dir2_block_tail_p(args->geo, hdr);
1010 btp->count = cpu_to_be32(leafhdr.count - leafhdr.stale);
1011 btp->stale = 0;
1012 xfs_dir2_block_log_tail(tp, dbp);
1013 /*
1014 * Initialize the block leaf area. We compact out stale entries.
1015 */
1016 lep = xfs_dir2_block_leaf_p(btp);
1017 for (from = to = 0; from < leafhdr.count; from++) {
1018 if (ents[from].address == cpu_to_be32(XFS_DIR2_NULL_DATAPTR))
1019 continue;
1020 lep[to++] = ents[from];
1021 }
1022 ASSERT(to == be32_to_cpu(btp->count));
1023 xfs_dir2_block_log_leaf(tp, dbp, 0, be32_to_cpu(btp->count) - 1);
1024 /*
1025 * Scan the bestfree if we need it and log the data block header.
1026 */
1027 if (needscan)
1028 xfs_dir2_data_freescan(dp, hdr, &needlog);
1029 if (needlog)
1030 xfs_dir2_data_log_header(args, dbp);
1031 /*
1032 * Pitch the old leaf block.
1033 */
1034 error = xfs_da_shrink_inode(args, args->geo->leafblk, lbp);
1035 if (error)
1036 return error;
1037
1038 /*
1039 * Now see if the resulting block can be shrunken to shortform.
1040 */
1041 size = xfs_dir2_block_sfsize(dp, hdr, &sfh);
1042 if (size > XFS_IFORK_DSIZE(dp))
1043 return 0;
1044
1045 return xfs_dir2_block_to_sf(args, dbp, size, &sfh);
1046 }
1047
1048 /*
1049 * Convert the shortform directory to block form.
1050 */
1051 int /* error */
1052 xfs_dir2_sf_to_block(
1053 xfs_da_args_t *args) /* operation arguments */
1054 {
1055 xfs_dir2_db_t blkno; /* dir-relative block # (0) */
1056 xfs_dir2_data_hdr_t *hdr; /* block header */
1057 xfs_dir2_leaf_entry_t *blp; /* block leaf entries */
1058 struct xfs_buf *bp; /* block buffer */
1059 xfs_dir2_block_tail_t *btp; /* block tail pointer */
1060 xfs_dir2_data_entry_t *dep; /* data entry pointer */
1061 xfs_inode_t *dp; /* incore directory inode */
1062 int dummy; /* trash */
1063 xfs_dir2_data_unused_t *dup; /* unused entry pointer */
1064 int endoffset; /* end of data objects */
1065 int error; /* error return value */
1066 int i; /* index */
1067 xfs_mount_t *mp; /* filesystem mount point */
1068 int needlog; /* need to log block header */
1069 int needscan; /* need to scan block freespc */
1070 int newoffset; /* offset from current entry */
1071 int offset; /* target block offset */
1072 xfs_dir2_sf_entry_t *sfep; /* sf entry pointer */
1073 xfs_dir2_sf_hdr_t *oldsfp; /* old shortform header */
1074 xfs_dir2_sf_hdr_t *sfp; /* shortform header */
1075 __be16 *tagp; /* end of data entry */
1076 xfs_trans_t *tp; /* transaction pointer */
1077 struct xfs_name name;
1078 struct xfs_ifork *ifp;
1079
1080 trace_xfs_dir2_sf_to_block(args);
1081
1082 dp = args->dp;
1083 tp = args->trans;
1084 mp = dp->i_mount;
1085 ifp = XFS_IFORK_PTR(dp, XFS_DATA_FORK);
1086 ASSERT(ifp->if_flags & XFS_IFINLINE);
1087 /*
1088 * Bomb out if the shortform directory is way too short.
1089 */
1090 if (dp->i_d.di_size < offsetof(xfs_dir2_sf_hdr_t, parent)) {
1091 ASSERT(XFS_FORCED_SHUTDOWN(mp));
1092 return -EIO;
1093 }
1094
1095 oldsfp = (xfs_dir2_sf_hdr_t *)ifp->if_u1.if_data;
1096
1097 ASSERT(ifp->if_bytes == dp->i_d.di_size);
1098 ASSERT(ifp->if_u1.if_data != NULL);
1099 ASSERT(dp->i_d.di_size >= xfs_dir2_sf_hdr_size(oldsfp->i8count));
1100 ASSERT(dp->i_d.di_nextents == 0);
1101
1102 /*
1103 * Copy the directory into a temporary buffer.
1104 * Then pitch the incore inode data so we can make extents.
1105 */
1106 sfp = kmem_alloc(ifp->if_bytes, KM_SLEEP);
1107 memcpy(sfp, oldsfp, ifp->if_bytes);
1108
1109 xfs_idata_realloc(dp, -ifp->if_bytes, XFS_DATA_FORK);
1110 xfs_bmap_local_to_extents_empty(dp, XFS_DATA_FORK);
1111 dp->i_d.di_size = 0;
1112
1113 /*
1114 * Add block 0 to the inode.
1115 */
1116 error = xfs_dir2_grow_inode(args, XFS_DIR2_DATA_SPACE, &blkno);
1117 if (error) {
1118 kmem_free(sfp);
1119 return error;
1120 }
1121 /*
1122 * Initialize the data block, then convert it to block format.
1123 */
1124 error = xfs_dir3_data_init(args, blkno, &bp);
1125 if (error) {
1126 kmem_free(sfp);
1127 return error;
1128 }
1129 xfs_dir3_block_init(mp, tp, bp, dp);
1130 hdr = bp->b_addr;
1131
1132 /*
1133 * Compute size of block "tail" area.
1134 */
1135 i = (uint)sizeof(*btp) +
1136 (sfp->count + 2) * (uint)sizeof(xfs_dir2_leaf_entry_t);
1137 /*
1138 * The whole thing is initialized to free by the init routine.
1139 * Say we're using the leaf and tail area.
1140 */
1141 dup = dp->d_ops->data_unused_p(hdr);
1142 needlog = needscan = 0;
1143 xfs_dir2_data_use_free(args, bp, dup, args->geo->blksize - i,
1144 i, &needlog, &needscan);
1145 ASSERT(needscan == 0);
1146 /*
1147 * Fill in the tail.
1148 */
1149 btp = xfs_dir2_block_tail_p(args->geo, hdr);
1150 btp->count = cpu_to_be32(sfp->count + 2); /* ., .. */
1151 btp->stale = 0;
1152 blp = xfs_dir2_block_leaf_p(btp);
1153 endoffset = (uint)((char *)blp - (char *)hdr);
1154 /*
1155 * Remove the freespace, we'll manage it.
1156 */
1157 xfs_dir2_data_use_free(args, bp, dup,
1158 (xfs_dir2_data_aoff_t)((char *)dup - (char *)hdr),
1159 be16_to_cpu(dup->length), &needlog, &needscan);
1160 /*
1161 * Create entry for .
1162 */
1163 dep = dp->d_ops->data_dot_entry_p(hdr);
1164 dep->inumber = cpu_to_be64(dp->i_ino);
1165 dep->namelen = 1;
1166 dep->name[0] = '.';
1167 dp->d_ops->data_put_ftype(dep, XFS_DIR3_FT_DIR);
1168 tagp = dp->d_ops->data_entry_tag_p(dep);
1169 *tagp = cpu_to_be16((char *)dep - (char *)hdr);
1170 xfs_dir2_data_log_entry(args, bp, dep);
1171 blp[0].hashval = cpu_to_be32(xfs_dir_hash_dot);
1172 blp[0].address = cpu_to_be32(xfs_dir2_byte_to_dataptr(
1173 (char *)dep - (char *)hdr));
1174 /*
1175 * Create entry for ..
1176 */
1177 dep = dp->d_ops->data_dotdot_entry_p(hdr);
1178 dep->inumber = cpu_to_be64(dp->d_ops->sf_get_parent_ino(sfp));
1179 dep->namelen = 2;
1180 dep->name[0] = dep->name[1] = '.';
1181 dp->d_ops->data_put_ftype(dep, XFS_DIR3_FT_DIR);
1182 tagp = dp->d_ops->data_entry_tag_p(dep);
1183 *tagp = cpu_to_be16((char *)dep - (char *)hdr);
1184 xfs_dir2_data_log_entry(args, bp, dep);
1185 blp[1].hashval = cpu_to_be32(xfs_dir_hash_dotdot);
1186 blp[1].address = cpu_to_be32(xfs_dir2_byte_to_dataptr(
1187 (char *)dep - (char *)hdr));
1188 offset = dp->d_ops->data_first_offset;
1189 /*
1190 * Loop over existing entries, stuff them in.
1191 */
1192 i = 0;
1193 if (!sfp->count)
1194 sfep = NULL;
1195 else
1196 sfep = xfs_dir2_sf_firstentry(sfp);
1197 /*
1198 * Need to preserve the existing offset values in the sf directory.
1199 * Insert holes (unused entries) where necessary.
1200 */
1201 while (offset < endoffset) {
1202 /*
1203 * sfep is null when we reach the end of the list.
1204 */
1205 if (sfep == NULL)
1206 newoffset = endoffset;
1207 else
1208 newoffset = xfs_dir2_sf_get_offset(sfep);
1209 /*
1210 * There should be a hole here, make one.
1211 */
1212 if (offset < newoffset) {
1213 dup = (xfs_dir2_data_unused_t *)((char *)hdr + offset);
1214 dup->freetag = cpu_to_be16(XFS_DIR2_DATA_FREE_TAG);
1215 dup->length = cpu_to_be16(newoffset - offset);
1216 *xfs_dir2_data_unused_tag_p(dup) = cpu_to_be16(
1217 ((char *)dup - (char *)hdr));
1218 xfs_dir2_data_log_unused(args, bp, dup);
1219 xfs_dir2_data_freeinsert(hdr,
1220 dp->d_ops->data_bestfree_p(hdr),
1221 dup, &dummy);
1222 offset += be16_to_cpu(dup->length);
1223 continue;
1224 }
1225 /*
1226 * Copy a real entry.
1227 */
1228 dep = (xfs_dir2_data_entry_t *)((char *)hdr + newoffset);
1229 dep->inumber = cpu_to_be64(dp->d_ops->sf_get_ino(sfp, sfep));
1230 dep->namelen = sfep->namelen;
1231 dp->d_ops->data_put_ftype(dep, dp->d_ops->sf_get_ftype(sfep));
1232 memcpy(dep->name, sfep->name, dep->namelen);
1233 tagp = dp->d_ops->data_entry_tag_p(dep);
1234 *tagp = cpu_to_be16((char *)dep - (char *)hdr);
1235 xfs_dir2_data_log_entry(args, bp, dep);
1236 name.name = sfep->name;
1237 name.len = sfep->namelen;
1238 blp[2 + i].hashval = cpu_to_be32(mp->m_dirnameops->
1239 hashname(&name));
1240 blp[2 + i].address = cpu_to_be32(xfs_dir2_byte_to_dataptr(
1241 (char *)dep - (char *)hdr));
1242 offset = (int)((char *)(tagp + 1) - (char *)hdr);
1243 if (++i == sfp->count)
1244 sfep = NULL;
1245 else
1246 sfep = dp->d_ops->sf_nextentry(sfp, sfep);
1247 }
1248 /* Done with the temporary buffer */
1249 kmem_free(sfp);
1250 /*
1251 * Sort the leaf entries by hash value.
1252 */
1253 xfs_sort(blp, be32_to_cpu(btp->count), sizeof(*blp), xfs_dir2_block_sort);
1254 /*
1255 * Log the leaf entry area and tail.
1256 * Already logged the header in data_init, ignore needlog.
1257 */
1258 ASSERT(needscan == 0);
1259 xfs_dir2_block_log_leaf(tp, bp, 0, be32_to_cpu(btp->count) - 1);
1260 xfs_dir2_block_log_tail(tp, bp);
1261 xfs_dir3_data_check(dp, bp);
1262 return 0;
1263 }
Linux kernel - Deliverables
This page took 0.084441 seconds and 5 git commands to generate.