1 // SPDX-License-Identifier: GPL-2.0+
2 /*
3 * Copyright (C) 2016 Oracle. All Rights Reserved.
4 * Author: Darrick J. Wong <darrick.wong@oracle.com>
5 */
6 #include "xfs.h"
7 #include "xfs_fs.h"
8 #include "xfs_format.h"
9 #include "xfs_log_format.h"
10 #include "xfs_trans_resv.h"
11 #include "xfs_bit.h"
12 #include "xfs_shared.h"
13 #include "xfs_mount.h"
14 #include "xfs_defer.h"
15 #include "xfs_inode.h"
16 #include "xfs_trans.h"
17 #include "xfs_trans_priv.h"
18 #include "xfs_bmap_item.h"
19 #include "xfs_log.h"
20 #include "xfs_bmap.h"
21 #include "xfs_icache.h"
22 #include "xfs_bmap_btree.h"
23 #include "xfs_trans_space.h"
24 #include "xfs_error.h"
25 #include "xfs_log_priv.h"
26 #include "xfs_log_recover.h"
27 #include "xfs_ag.h"
28 #include "xfs_trace.h"
29
30 struct kmem_cache *xfs_bui_cache;
31 struct kmem_cache *xfs_bud_cache;
32
33 static const struct xfs_item_ops xfs_bui_item_ops;
34
35 static inline struct xfs_bui_log_item *BUI_ITEM(struct xfs_log_item *lip)
36 {
37 return container_of(lip, struct xfs_bui_log_item, bui_item);
38 }
39
40 STATIC void
41 xfs_bui_item_free(
42 struct xfs_bui_log_item *buip)
43 {
44 kvfree(buip->bui_item.li_lv_shadow);
45 kmem_cache_free(xfs_bui_cache, buip);
46 }
47
48 /*
49 * Freeing the BUI requires that we remove it from the AIL if it has already
50 * been placed there. However, the BUI may not yet have been placed in the AIL
51 * when called by xfs_bui_release() from BUD processing due to the ordering of
52 * committed vs unpin operations in bulk insert operations. Hence the reference
53 * count to ensure only the last caller frees the BUI.
54 */
55 STATIC void
56 xfs_bui_release(
57 struct xfs_bui_log_item *buip)
58 {
59 ASSERT(atomic_read(&buip->bui_refcount) > 0);
60 if (!atomic_dec_and_test(&buip->bui_refcount))
61 return;
62
63 xfs_trans_ail_delete(&buip->bui_item, 0);
64 xfs_bui_item_free(buip);
65 }
66
67
68 STATIC void
69 xfs_bui_item_size(
70 struct xfs_log_item *lip,
71 int *nvecs,
72 int *nbytes)
73 {
74 struct xfs_bui_log_item *buip = BUI_ITEM(lip);
75
76 *nvecs += 1;
77 *nbytes += xfs_bui_log_format_sizeof(buip->bui_format.bui_nextents);
78 }
79
80 /*
81 * This is called to fill in the vector of log iovecs for the
82 * given bui log item. We use only 1 iovec, and we point that
83 * at the bui_log_format structure embedded in the bui item.
84 * It is at this point that we assert that all of the extent
85 * slots in the bui item have been filled.
86 */
87 STATIC void
88 xfs_bui_item_format(
89 struct xfs_log_item *lip,
90 struct xfs_log_vec *lv)
91 {
92 struct xfs_bui_log_item *buip = BUI_ITEM(lip);
93 struct xfs_log_iovec *vecp = NULL;
94
95 ASSERT(atomic_read(&buip->bui_next_extent) ==
96 buip->bui_format.bui_nextents);
97
98 buip->bui_format.bui_type = XFS_LI_BUI;
99 buip->bui_format.bui_size = 1;
100
101 xlog_copy_iovec(lv, &vecp, XLOG_REG_TYPE_BUI_FORMAT, &buip->bui_format,
102 xfs_bui_log_format_sizeof(buip->bui_format.bui_nextents));
103 }
104
105 /*
106 * The unpin operation is the last place an BUI is manipulated in the log. It is
107 * either inserted in the AIL or aborted in the event of a log I/O error. In
108 * either case, the BUI transaction has been successfully committed to make it
109 * this far. Therefore, we expect whoever committed the BUI to either construct
110 * and commit the BUD or drop the BUD's reference in the event of error. Simply
111 * drop the log's BUI reference now that the log is done with it.
112 */
113 STATIC void
114 xfs_bui_item_unpin(
115 struct xfs_log_item *lip,
116 int remove)
117 {
118 struct xfs_bui_log_item *buip = BUI_ITEM(lip);
119
120 xfs_bui_release(buip);
121 }
122
123 /*
124 * The BUI has been either committed or aborted if the transaction has been
125 * cancelled. If the transaction was cancelled, an BUD isn't going to be
126 * constructed and thus we free the BUI here directly.
127 */
128 STATIC void
129 xfs_bui_item_release(
130 struct xfs_log_item *lip)
131 {
132 xfs_bui_release(BUI_ITEM(lip));
133 }
134
135 /*
136 * Allocate and initialize an bui item with the given number of extents.
137 */
138 STATIC struct xfs_bui_log_item *
139 xfs_bui_init(
140 struct xfs_mount *mp)
141
142 {
143 struct xfs_bui_log_item *buip;
144
145 buip = kmem_cache_zalloc(xfs_bui_cache, GFP_KERNEL | __GFP_NOFAIL);
146
147 xfs_log_item_init(mp, &buip->bui_item, XFS_LI_BUI, &xfs_bui_item_ops);
148 buip->bui_format.bui_nextents = XFS_BUI_MAX_FAST_EXTENTS;
149 buip->bui_format.bui_id = (uintptr_t)(void *)buip;
150 atomic_set(&buip->bui_next_extent, 0);
151 atomic_set(&buip->bui_refcount, 2);
152
153 return buip;
154 }
155
156 static inline struct xfs_bud_log_item *BUD_ITEM(struct xfs_log_item *lip)
157 {
158 return container_of(lip, struct xfs_bud_log_item, bud_item);
159 }
160
161 STATIC void
162 xfs_bud_item_size(
163 struct xfs_log_item *lip,
164 int *nvecs,
165 int *nbytes)
166 {
167 *nvecs += 1;
168 *nbytes += sizeof(struct xfs_bud_log_format);
169 }
170
171 /*
172 * This is called to fill in the vector of log iovecs for the
173 * given bud log item. We use only 1 iovec, and we point that
174 * at the bud_log_format structure embedded in the bud item.
175 * It is at this point that we assert that all of the extent
176 * slots in the bud item have been filled.
177 */
178 STATIC void
179 xfs_bud_item_format(
180 struct xfs_log_item *lip,
181 struct xfs_log_vec *lv)
182 {
183 struct xfs_bud_log_item *budp = BUD_ITEM(lip);
184 struct xfs_log_iovec *vecp = NULL;
185
186 budp->bud_format.bud_type = XFS_LI_BUD;
187 budp->bud_format.bud_size = 1;
188
189 xlog_copy_iovec(lv, &vecp, XLOG_REG_TYPE_BUD_FORMAT, &budp->bud_format,
190 sizeof(struct xfs_bud_log_format));
191 }
192
193 /*
194 * The BUD is either committed or aborted if the transaction is cancelled. If
195 * the transaction is cancelled, drop our reference to the BUI and free the
196 * BUD.
197 */
198 STATIC void
199 xfs_bud_item_release(
200 struct xfs_log_item *lip)
201 {
202 struct xfs_bud_log_item *budp = BUD_ITEM(lip);
203
204 xfs_bui_release(budp->bud_buip);
205 kvfree(budp->bud_item.li_lv_shadow);
206 kmem_cache_free(xfs_bud_cache, budp);
207 }
208
209 static struct xfs_log_item *
210 xfs_bud_item_intent(
211 struct xfs_log_item *lip)
212 {
213 return &BUD_ITEM(lip)->bud_buip->bui_item;
214 }
215
216 static const struct xfs_item_ops xfs_bud_item_ops = {
217 .flags = XFS_ITEM_RELEASE_WHEN_COMMITTED |
218 XFS_ITEM_INTENT_DONE,
219 .iop_size = xfs_bud_item_size,
220 .iop_format = xfs_bud_item_format,
221 .iop_release = xfs_bud_item_release,
222 .iop_intent = xfs_bud_item_intent,
223 };
224
225 static inline struct xfs_bmap_intent *bi_entry(const struct list_head *e)
226 {
227 return list_entry(e, struct xfs_bmap_intent, bi_list);
228 }
229
230 /* Sort bmap intents by inode. */
231 static int
232 xfs_bmap_update_diff_items(
233 void *priv,
234 const struct list_head *a,
235 const struct list_head *b)
236 {
237 struct xfs_bmap_intent *ba = bi_entry(a);
238 struct xfs_bmap_intent *bb = bi_entry(b);
239
240 return ba->bi_owner->i_ino - bb->bi_owner->i_ino;
241 }
242
243 /* Log bmap updates in the intent item. */
244 STATIC void
245 xfs_bmap_update_log_item(
246 struct xfs_trans *tp,
247 struct xfs_bui_log_item *buip,
248 struct xfs_bmap_intent *bi)
249 {
250 uint next_extent;
251 struct xfs_map_extent *map;
252
253 /*
254 * atomic_inc_return gives us the value after the increment;
255 * we want to use it as an array index so we need to subtract 1 from
256 * it.
257 */
258 next_extent = atomic_inc_return(&buip->bui_next_extent) - 1;
259 ASSERT(next_extent < buip->bui_format.bui_nextents);
260 map = &buip->bui_format.bui_extents[next_extent];
261 map->me_owner = bi->bi_owner->i_ino;
262 map->me_startblock = bi->bi_bmap.br_startblock;
263 map->me_startoff = bi->bi_bmap.br_startoff;
264 map->me_len = bi->bi_bmap.br_blockcount;
265
266 switch (bi->bi_type) {
267 case XFS_BMAP_MAP:
268 case XFS_BMAP_UNMAP:
269 map->me_flags = bi->bi_type;
270 break;
271 default:
272 ASSERT(0);
273 }
274 if (bi->bi_bmap.br_state == XFS_EXT_UNWRITTEN)
275 map->me_flags |= XFS_BMAP_EXTENT_UNWRITTEN;
276 if (bi->bi_whichfork == XFS_ATTR_FORK)
277 map->me_flags |= XFS_BMAP_EXTENT_ATTR_FORK;
278 if (xfs_ifork_is_realtime(bi->bi_owner, bi->bi_whichfork))
279 map->me_flags |= XFS_BMAP_EXTENT_REALTIME;
280 }
281
282 static struct xfs_log_item *
283 xfs_bmap_update_create_intent(
284 struct xfs_trans *tp,
285 struct list_head *items,
286 unsigned int count,
287 bool sort)
288 {
289 struct xfs_mount *mp = tp->t_mountp;
290 struct xfs_bui_log_item *buip = xfs_bui_init(mp);
291 struct xfs_bmap_intent *bi;
292
293 ASSERT(count == XFS_BUI_MAX_FAST_EXTENTS);
294
295 if (sort)
296 list_sort(mp, items, xfs_bmap_update_diff_items);
297 list_for_each_entry(bi, items, bi_list)
298 xfs_bmap_update_log_item(tp, buip, bi);
299 return &buip->bui_item;
300 }
301
302 /* Get an BUD so we can process all the deferred bmap updates. */
303 static struct xfs_log_item *
304 xfs_bmap_update_create_done(
305 struct xfs_trans *tp,
306 struct xfs_log_item *intent,
307 unsigned int count)
308 {
309 struct xfs_bui_log_item *buip = BUI_ITEM(intent);
310 struct xfs_bud_log_item *budp;
311
312 budp = kmem_cache_zalloc(xfs_bud_cache, GFP_KERNEL | __GFP_NOFAIL);
313 xfs_log_item_init(tp->t_mountp, &budp->bud_item, XFS_LI_BUD,
314 &xfs_bud_item_ops);
315 budp->bud_buip = buip;
316 budp->bud_format.bud_bui_id = buip->bui_format.bui_id;
317
318 return &budp->bud_item;
319 }
320
321 /* Take a passive ref to the AG containing the space we're mapping. */
322 static inline void
323 xfs_bmap_update_get_group(
324 struct xfs_mount *mp,
325 struct xfs_bmap_intent *bi)
326 {
327 if (xfs_ifork_is_realtime(bi->bi_owner, bi->bi_whichfork))
328 return;
329
330 /*
331 * Bump the intent count on behalf of the deferred rmap and refcount
332 * intent items that that we can queue when we finish this bmap work.
333 * This new intent item will bump the intent count before the bmap
334 * intent drops the intent count, ensuring that the intent count
335 * remains nonzero across the transaction roll.
336 */
337 bi->bi_pag = xfs_perag_intent_get(mp, bi->bi_bmap.br_startblock);
338 }
339
340 /* Add this deferred BUI to the transaction. */
341 void
342 xfs_bmap_defer_add(
343 struct xfs_trans *tp,
344 struct xfs_bmap_intent *bi)
345 {
346 trace_xfs_bmap_defer(bi);
347
348 xfs_bmap_update_get_group(tp->t_mountp, bi);
349 xfs_defer_add(tp, &bi->bi_list, &xfs_bmap_update_defer_type);
350 }
351
352 /* Release a passive AG ref after finishing mapping work. */
353 static inline void
354 xfs_bmap_update_put_group(
355 struct xfs_bmap_intent *bi)
356 {
357 if (xfs_ifork_is_realtime(bi->bi_owner, bi->bi_whichfork))
358 return;
359
360 xfs_perag_intent_put(bi->bi_pag);
361 }
362
363 /* Cancel a deferred bmap update. */
364 STATIC void
365 xfs_bmap_update_cancel_item(
366 struct list_head *item)
367 {
368 struct xfs_bmap_intent *bi = bi_entry(item);
369
370 xfs_bmap_update_put_group(bi);
371 kmem_cache_free(xfs_bmap_intent_cache, bi);
372 }
373
374 /* Process a deferred bmap update. */
375 STATIC int
376 xfs_bmap_update_finish_item(
377 struct xfs_trans *tp,
378 struct xfs_log_item *done,
379 struct list_head *item,
380 struct xfs_btree_cur **state)
381 {
382 struct xfs_bmap_intent *bi = bi_entry(item);
383 int error;
384
385 error = xfs_bmap_finish_one(tp, bi);
386 if (!error && bi->bi_bmap.br_blockcount > 0) {
387 ASSERT(bi->bi_type == XFS_BMAP_UNMAP);
388 return -EAGAIN;
389 }
390
391 xfs_bmap_update_cancel_item(item);
392 return error;
393 }
394
395 /* Abort all pending BUIs. */
396 STATIC void
397 xfs_bmap_update_abort_intent(
398 struct xfs_log_item *intent)
399 {
400 xfs_bui_release(BUI_ITEM(intent));
401 }
402
403 /* Is this recovered BUI ok? */
404 static inline bool
405 xfs_bui_validate(
406 struct xfs_mount *mp,
407 struct xfs_bui_log_item *buip)
408 {
409 struct xfs_map_extent *map;
410
411 /* Only one mapping operation per BUI... */
412 if (buip->bui_format.bui_nextents != XFS_BUI_MAX_FAST_EXTENTS)
413 return false;
414
415 map = &buip->bui_format.bui_extents[0];
416
417 if (map->me_flags & ~XFS_BMAP_EXTENT_FLAGS)
418 return false;
419
420 switch (map->me_flags & XFS_BMAP_EXTENT_TYPE_MASK) {
421 case XFS_BMAP_MAP:
422 case XFS_BMAP_UNMAP:
423 break;
424 default:
425 return false;
426 }
427
428 if (!xfs_verify_ino(mp, map->me_owner))
429 return false;
430
431 if (!xfs_verify_fileext(mp, map->me_startoff, map->me_len))
432 return false;
433
434 if (map->me_flags & XFS_BMAP_EXTENT_REALTIME)
435 return xfs_verify_rtbext(mp, map->me_startblock, map->me_len);
436
437 return xfs_verify_fsbext(mp, map->me_startblock, map->me_len);
438 }
439
440 static inline struct xfs_bmap_intent *
441 xfs_bui_recover_work(
442 struct xfs_mount *mp,
443 struct xfs_defer_pending *dfp,
444 struct xfs_inode **ipp,
445 struct xfs_map_extent *map)
446 {
447 struct xfs_bmap_intent *bi;
448 int error;
449
450 error = xlog_recover_iget(mp, map->me_owner, ipp);
451 if (error)
452 return ERR_PTR(error);
453
454 bi = kmem_cache_zalloc(xfs_bmap_intent_cache,
455 GFP_KERNEL | __GFP_NOFAIL);
456 bi->bi_whichfork = (map->me_flags & XFS_BMAP_EXTENT_ATTR_FORK) ?
457 XFS_ATTR_FORK : XFS_DATA_FORK;
458 bi->bi_type = map->me_flags & XFS_BMAP_EXTENT_TYPE_MASK;
459 bi->bi_bmap.br_startblock = map->me_startblock;
460 bi->bi_bmap.br_startoff = map->me_startoff;
461 bi->bi_bmap.br_blockcount = map->me_len;
462 bi->bi_bmap.br_state = (map->me_flags & XFS_BMAP_EXTENT_UNWRITTEN) ?
463 XFS_EXT_UNWRITTEN : XFS_EXT_NORM;
464 bi->bi_owner = *ipp;
465 xfs_bmap_update_get_group(mp, bi);
466
467 xfs_defer_add_item(dfp, &bi->bi_list);
468 return bi;
469 }
470
471 /*
472 * Process a bmap update intent item that was recovered from the log.
473 * We need to update some inode's bmbt.
474 */
475 STATIC int
476 xfs_bmap_recover_work(
477 struct xfs_defer_pending *dfp,
478 struct list_head *capture_list)
479 {
480 struct xfs_trans_res resv;
481 struct xfs_log_item *lip = dfp->dfp_intent;
482 struct xfs_bui_log_item *buip = BUI_ITEM(lip);
483 struct xfs_trans *tp;
484 struct xfs_inode *ip = NULL;
485 struct xfs_mount *mp = lip->li_log->l_mp;
486 struct xfs_map_extent *map;
487 struct xfs_bmap_intent *work;
488 int iext_delta;
489 int error = 0;
490
491 if (!xfs_bui_validate(mp, buip)) {
492 XFS_CORRUPTION_ERROR(__func__, XFS_ERRLEVEL_LOW, mp,
493 &buip->bui_format, sizeof(buip->bui_format));
494 return -EFSCORRUPTED;
495 }
496
497 map = &buip->bui_format.bui_extents[0];
498 work = xfs_bui_recover_work(mp, dfp, &ip, map);
499 if (IS_ERR(work))
500 return PTR_ERR(work);
501
502 /* Allocate transaction and do the work. */
503 resv = xlog_recover_resv(&M_RES(mp)->tr_itruncate);
504 error = xfs_trans_alloc(mp, &resv,
505 XFS_EXTENTADD_SPACE_RES(mp, XFS_DATA_FORK), 0, 0, &tp);
506 if (error)
507 goto err_rele;
508
509 xfs_ilock(ip, XFS_ILOCK_EXCL);
510 xfs_trans_ijoin(tp, ip, 0);
511
512 if (!!(map->me_flags & XFS_BMAP_EXTENT_REALTIME) !=
513 xfs_ifork_is_realtime(ip, work->bi_whichfork)) {
514 error = -EFSCORRUPTED;
515 goto err_cancel;
516 }
517
518 if (work->bi_type == XFS_BMAP_MAP)
519 iext_delta = XFS_IEXT_ADD_NOSPLIT_CNT;
520 else
521 iext_delta = XFS_IEXT_PUNCH_HOLE_CNT;
522
523 error = xfs_iext_count_extend(tp, ip, work->bi_whichfork, iext_delta);
524 if (error)
525 goto err_cancel;
526
527 error = xlog_recover_finish_intent(tp, dfp);
528 if (error == -EFSCORRUPTED)
529 XFS_CORRUPTION_ERROR(__func__, XFS_ERRLEVEL_LOW, mp,
530 &buip->bui_format, sizeof(buip->bui_format));
531 if (error)
532 goto err_cancel;
533
534 /*
535 * Commit transaction, which frees the transaction and saves the inode
536 * for later replay activities.
537 */
538 error = xfs_defer_ops_capture_and_commit(tp, capture_list);
539 if (error)
540 goto err_unlock;
541
542 xfs_iunlock(ip, XFS_ILOCK_EXCL);
543 xfs_irele(ip);
544 return 0;
545
546 err_cancel:
547 xfs_trans_cancel(tp);
548 err_unlock:
549 xfs_iunlock(ip, XFS_ILOCK_EXCL);
550 err_rele:
551 xfs_irele(ip);
552 return error;
553 }
554
555 /* Relog an intent item to push the log tail forward. */
556 static struct xfs_log_item *
557 xfs_bmap_relog_intent(
558 struct xfs_trans *tp,
559 struct xfs_log_item *intent,
560 struct xfs_log_item *done_item)
561 {
562 struct xfs_bui_log_item *buip;
563 struct xfs_map_extent *map;
564 unsigned int count;
565
566 count = BUI_ITEM(intent)->bui_format.bui_nextents;
567 map = BUI_ITEM(intent)->bui_format.bui_extents;
568
569 buip = xfs_bui_init(tp->t_mountp);
570 memcpy(buip->bui_format.bui_extents, map, count * sizeof(*map));
571 atomic_set(&buip->bui_next_extent, count);
572
573 return &buip->bui_item;
574 }
575
576 const struct xfs_defer_op_type xfs_bmap_update_defer_type = {
577 .name = "bmap",
578 .max_items = XFS_BUI_MAX_FAST_EXTENTS,
579 .create_intent = xfs_bmap_update_create_intent,
580 .abort_intent = xfs_bmap_update_abort_intent,
581 .create_done = xfs_bmap_update_create_done,
582 .finish_item = xfs_bmap_update_finish_item,
583 .cancel_item = xfs_bmap_update_cancel_item,
584 .recover_work = xfs_bmap_recover_work,
585 .relog_intent = xfs_bmap_relog_intent,
586 };
587
588 STATIC bool
589 xfs_bui_item_match(
590 struct xfs_log_item *lip,
591 uint64_t intent_id)
592 {
593 return BUI_ITEM(lip)->bui_format.bui_id == intent_id;
594 }
595
596 static const struct xfs_item_ops xfs_bui_item_ops = {
597 .flags = XFS_ITEM_INTENT,
598 .iop_size = xfs_bui_item_size,
599 .iop_format = xfs_bui_item_format,
600 .iop_unpin = xfs_bui_item_unpin,
601 .iop_release = xfs_bui_item_release,
602 .iop_match = xfs_bui_item_match,
603 };
604
605 static inline void
606 xfs_bui_copy_format(
607 struct xfs_bui_log_format *dst,
608 const struct xfs_bui_log_format *src)
609 {
610 unsigned int i;
611
612 memcpy(dst, src, offsetof(struct xfs_bui_log_format, bui_extents));
613
614 for (i = 0; i < src->bui_nextents; i++)
615 memcpy(&dst->bui_extents[i], &src->bui_extents[i],
616 sizeof(struct xfs_map_extent));
617 }
618
619 /*
620 * This routine is called to create an in-core extent bmap update
621 * item from the bui format structure which was logged on disk.
622 * It allocates an in-core bui, copies the extents from the format
623 * structure into it, and adds the bui to the AIL with the given
624 * LSN.
625 */
626 STATIC int
627 xlog_recover_bui_commit_pass2(
628 struct xlog *log,
629 struct list_head *buffer_list,
630 struct xlog_recover_item *item,
631 xfs_lsn_t lsn)
632 {
633 struct xfs_mount *mp = log->l_mp;
634 struct xfs_bui_log_item *buip;
635 struct xfs_bui_log_format *bui_formatp;
636 size_t len;
637
638 bui_formatp = item->ri_buf[0].i_addr;
639
640 if (item->ri_buf[0].i_len < xfs_bui_log_format_sizeof(0)) {
641 XFS_CORRUPTION_ERROR(__func__, XFS_ERRLEVEL_LOW, mp,
642 item->ri_buf[0].i_addr, item->ri_buf[0].i_len);
643 return -EFSCORRUPTED;
644 }
645
646 if (bui_formatp->bui_nextents != XFS_BUI_MAX_FAST_EXTENTS) {
647 XFS_CORRUPTION_ERROR(__func__, XFS_ERRLEVEL_LOW, mp,
648 item->ri_buf[0].i_addr, item->ri_buf[0].i_len);
649 return -EFSCORRUPTED;
650 }
651
652 len = xfs_bui_log_format_sizeof(bui_formatp->bui_nextents);
653 if (item->ri_buf[0].i_len != len) {
654 XFS_CORRUPTION_ERROR(__func__, XFS_ERRLEVEL_LOW, mp,
655 item->ri_buf[0].i_addr, item->ri_buf[0].i_len);
656 return -EFSCORRUPTED;
657 }
658
659 buip = xfs_bui_init(mp);
660 xfs_bui_copy_format(&buip->bui_format, bui_formatp);
661 atomic_set(&buip->bui_next_extent, bui_formatp->bui_nextents);
662
663 xlog_recover_intent_item(log, &buip->bui_item, lsn,
664 &xfs_bmap_update_defer_type);
665 return 0;
666 }
667
668 const struct xlog_recover_item_ops xlog_bui_item_ops = {
669 .item_type = XFS_LI_BUI,
670 .commit_pass2 = xlog_recover_bui_commit_pass2,
671 };
672
673 /*
674 * This routine is called when an BUD format structure is found in a committed
675 * transaction in the log. Its purpose is to cancel the corresponding BUI if it
676 * was still in the log. To do this it searches the AIL for the BUI with an id
677 * equal to that in the BUD format structure. If we find it we drop the BUD
678 * reference, which removes the BUI from the AIL and frees it.
679 */
680 STATIC int
681 xlog_recover_bud_commit_pass2(
682 struct xlog *log,
683 struct list_head *buffer_list,
684 struct xlog_recover_item *item,
685 xfs_lsn_t lsn)
686 {
687 struct xfs_bud_log_format *bud_formatp;
688
689 bud_formatp = item->ri_buf[0].i_addr;
690 if (item->ri_buf[0].i_len != sizeof(struct xfs_bud_log_format)) {
691 XFS_CORRUPTION_ERROR(__func__, XFS_ERRLEVEL_LOW, log->l_mp,
692 item->ri_buf[0].i_addr, item->ri_buf[0].i_len);
693 return -EFSCORRUPTED;
694 }
695
696 xlog_recover_release_intent(log, XFS_LI_BUI, bud_formatp->bud_bui_id);
697 return 0;
698 }
699
700 const struct xlog_recover_item_ops xlog_bud_item_ops = {
701 .item_type = XFS_LI_BUD,
702 .commit_pass2 = xlog_recover_bud_commit_pass2,
703 };
704
Linux® is a registered trademark of Linus Torvalds in the United States and other countries.
TOMOYO® is a registered trademark of NTT DATA CORPORATION.