]>
Commit | Line | Data |
---|---|---|
1da177e4 | 1 | /* |
7b718769 NS |
2 | * Copyright (c) 2000-2002,2005 Silicon Graphics, Inc. |
3 | * All Rights Reserved. | |
1da177e4 | 4 | * |
7b718769 NS |
5 | * This program is free software; you can redistribute it and/or |
6 | * modify it under the terms of the GNU General Public License as | |
1da177e4 LT |
7 | * published by the Free Software Foundation. |
8 | * | |
7b718769 NS |
9 | * This program is distributed in the hope that it would be useful, |
10 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
11 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
12 | * GNU General Public License for more details. | |
1da177e4 | 13 | * |
7b718769 NS |
14 | * You should have received a copy of the GNU General Public License |
15 | * along with this program; if not, write the Free Software Foundation, | |
16 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA | |
1da177e4 | 17 | */ |
1da177e4 | 18 | #include "xfs.h" |
a844f451 | 19 | #include "xfs_fs.h" |
70a9883c | 20 | #include "xfs_shared.h" |
a4fbe6ab | 21 | #include "xfs_format.h" |
239880ef DC |
22 | #include "xfs_log_format.h" |
23 | #include "xfs_trans_resv.h" | |
1da177e4 | 24 | #include "xfs_mount.h" |
a844f451 | 25 | #include "xfs_inode.h" |
239880ef | 26 | #include "xfs_trans.h" |
a844f451 | 27 | #include "xfs_buf_item.h" |
1da177e4 LT |
28 | #include "xfs_trans_priv.h" |
29 | #include "xfs_error.h" | |
0b1b213f | 30 | #include "xfs_trace.h" |
1da177e4 | 31 | |
4a5224d7 CH |
32 | /* |
33 | * Check to see if a buffer matching the given parameters is already | |
34 | * a part of the given transaction. | |
35 | */ | |
36 | STATIC struct xfs_buf * | |
37 | xfs_trans_buf_item_match( | |
38 | struct xfs_trans *tp, | |
39 | struct xfs_buftarg *target, | |
de2a4f59 DC |
40 | struct xfs_buf_map *map, |
41 | int nmaps) | |
4a5224d7 | 42 | { |
e98c414f CH |
43 | struct xfs_log_item_desc *lidp; |
44 | struct xfs_buf_log_item *blip; | |
de2a4f59 DC |
45 | int len = 0; |
46 | int i; | |
47 | ||
48 | for (i = 0; i < nmaps; i++) | |
49 | len += map[i].bm_len; | |
1da177e4 | 50 | |
e98c414f CH |
51 | list_for_each_entry(lidp, &tp->t_items, lid_trans) { |
52 | blip = (struct xfs_buf_log_item *)lidp->lid_item; | |
53 | if (blip->bli_item.li_type == XFS_LI_BUF && | |
49074c06 | 54 | blip->bli_buf->b_target == target && |
de2a4f59 DC |
55 | XFS_BUF_ADDR(blip->bli_buf) == map[0].bm_bn && |
56 | blip->bli_buf->b_length == len) { | |
57 | ASSERT(blip->bli_buf->b_map_count == nmaps); | |
e98c414f | 58 | return blip->bli_buf; |
de2a4f59 | 59 | } |
4a5224d7 CH |
60 | } |
61 | ||
62 | return NULL; | |
63 | } | |
1da177e4 | 64 | |
d7e84f41 CH |
65 | /* |
66 | * Add the locked buffer to the transaction. | |
67 | * | |
68 | * The buffer must be locked, and it cannot be associated with any | |
69 | * transaction. | |
70 | * | |
71 | * If the buffer does not yet have a buf log item associated with it, | |
72 | * then allocate one for it. Then add the buf item to the transaction. | |
73 | */ | |
74 | STATIC void | |
75 | _xfs_trans_bjoin( | |
76 | struct xfs_trans *tp, | |
77 | struct xfs_buf *bp, | |
78 | int reset_recur) | |
79 | { | |
80 | struct xfs_buf_log_item *bip; | |
81 | ||
bf9d9013 | 82 | ASSERT(bp->b_transp == NULL); |
d7e84f41 CH |
83 | |
84 | /* | |
85 | * The xfs_buf_log_item pointer is stored in b_fsprivate. If | |
86 | * it doesn't have one yet, then allocate one and initialize it. | |
87 | * The checks to see if one is there are in xfs_buf_item_init(). | |
88 | */ | |
89 | xfs_buf_item_init(bp, tp->t_mountp); | |
adadbeef | 90 | bip = bp->b_fspriv; |
d7e84f41 | 91 | ASSERT(!(bip->bli_flags & XFS_BLI_STALE)); |
0f22f9d0 | 92 | ASSERT(!(bip->__bli_format.blf_flags & XFS_BLF_CANCEL)); |
d7e84f41 CH |
93 | ASSERT(!(bip->bli_flags & XFS_BLI_LOGGED)); |
94 | if (reset_recur) | |
95 | bip->bli_recur = 0; | |
96 | ||
97 | /* | |
98 | * Take a reference for this transaction on the buf item. | |
99 | */ | |
100 | atomic_inc(&bip->bli_refcount); | |
101 | ||
102 | /* | |
103 | * Get a log_item_desc to point at the new item. | |
104 | */ | |
e98c414f | 105 | xfs_trans_add_item(tp, &bip->bli_item); |
d7e84f41 CH |
106 | |
107 | /* | |
108 | * Initialize b_fsprivate2 so we can find it with incore_match() | |
109 | * in xfs_trans_get_buf() and friends above. | |
110 | */ | |
bf9d9013 | 111 | bp->b_transp = tp; |
d7e84f41 CH |
112 | |
113 | } | |
114 | ||
115 | void | |
116 | xfs_trans_bjoin( | |
117 | struct xfs_trans *tp, | |
118 | struct xfs_buf *bp) | |
119 | { | |
120 | _xfs_trans_bjoin(tp, bp, 0); | |
121 | trace_xfs_trans_bjoin(bp->b_fspriv); | |
122 | } | |
1da177e4 LT |
123 | |
124 | /* | |
125 | * Get and lock the buffer for the caller if it is not already | |
126 | * locked within the given transaction. If it is already locked | |
127 | * within the transaction, just increment its lock recursion count | |
128 | * and return a pointer to it. | |
129 | * | |
1da177e4 LT |
130 | * If the transaction pointer is NULL, make this just a normal |
131 | * get_buf() call. | |
132 | */ | |
de2a4f59 DC |
133 | struct xfs_buf * |
134 | xfs_trans_get_buf_map( | |
135 | struct xfs_trans *tp, | |
136 | struct xfs_buftarg *target, | |
137 | struct xfs_buf_map *map, | |
138 | int nmaps, | |
139 | xfs_buf_flags_t flags) | |
1da177e4 LT |
140 | { |
141 | xfs_buf_t *bp; | |
142 | xfs_buf_log_item_t *bip; | |
143 | ||
de2a4f59 DC |
144 | if (!tp) |
145 | return xfs_buf_get_map(target, map, nmaps, flags); | |
1da177e4 LT |
146 | |
147 | /* | |
148 | * If we find the buffer in the cache with this transaction | |
149 | * pointer in its b_fsprivate2 field, then we know we already | |
150 | * have it locked. In this case we just increment the lock | |
151 | * recursion count and return the buffer to the caller. | |
152 | */ | |
de2a4f59 | 153 | bp = xfs_trans_buf_item_match(tp, target, map, nmaps); |
1da177e4 | 154 | if (bp != NULL) { |
0c842ad4 | 155 | ASSERT(xfs_buf_islocked(bp)); |
c867cb61 CH |
156 | if (XFS_FORCED_SHUTDOWN(tp->t_mountp)) { |
157 | xfs_buf_stale(bp); | |
c867cb61 CH |
158 | XFS_BUF_DONE(bp); |
159 | } | |
0b1b213f | 160 | |
bf9d9013 | 161 | ASSERT(bp->b_transp == tp); |
adadbeef | 162 | bip = bp->b_fspriv; |
1da177e4 LT |
163 | ASSERT(bip != NULL); |
164 | ASSERT(atomic_read(&bip->bli_refcount) > 0); | |
165 | bip->bli_recur++; | |
0b1b213f | 166 | trace_xfs_trans_get_buf_recur(bip); |
d99831ff | 167 | return bp; |
1da177e4 LT |
168 | } |
169 | ||
de2a4f59 | 170 | bp = xfs_buf_get_map(target, map, nmaps, flags); |
1da177e4 LT |
171 | if (bp == NULL) { |
172 | return NULL; | |
173 | } | |
174 | ||
5a52c2a5 | 175 | ASSERT(!bp->b_error); |
1da177e4 | 176 | |
d7e84f41 CH |
177 | _xfs_trans_bjoin(tp, bp, 1); |
178 | trace_xfs_trans_get_buf(bp->b_fspriv); | |
d99831ff | 179 | return bp; |
1da177e4 LT |
180 | } |
181 | ||
182 | /* | |
183 | * Get and lock the superblock buffer of this file system for the | |
184 | * given transaction. | |
185 | * | |
186 | * We don't need to use incore_match() here, because the superblock | |
187 | * buffer is a private buffer which we keep a pointer to in the | |
188 | * mount structure. | |
189 | */ | |
190 | xfs_buf_t * | |
191 | xfs_trans_getsb(xfs_trans_t *tp, | |
192 | struct xfs_mount *mp, | |
193 | int flags) | |
194 | { | |
195 | xfs_buf_t *bp; | |
196 | xfs_buf_log_item_t *bip; | |
197 | ||
198 | /* | |
199 | * Default to just trying to lock the superblock buffer | |
200 | * if tp is NULL. | |
201 | */ | |
d99831ff ES |
202 | if (tp == NULL) |
203 | return xfs_getsb(mp, flags); | |
1da177e4 LT |
204 | |
205 | /* | |
206 | * If the superblock buffer already has this transaction | |
207 | * pointer in its b_fsprivate2 field, then we know we already | |
208 | * have it locked. In this case we just increment the lock | |
209 | * recursion count and return the buffer to the caller. | |
210 | */ | |
211 | bp = mp->m_sb_bp; | |
bf9d9013 | 212 | if (bp->b_transp == tp) { |
adadbeef | 213 | bip = bp->b_fspriv; |
1da177e4 LT |
214 | ASSERT(bip != NULL); |
215 | ASSERT(atomic_read(&bip->bli_refcount) > 0); | |
216 | bip->bli_recur++; | |
0b1b213f | 217 | trace_xfs_trans_getsb_recur(bip); |
d99831ff | 218 | return bp; |
1da177e4 LT |
219 | } |
220 | ||
221 | bp = xfs_getsb(mp, flags); | |
d7e84f41 | 222 | if (bp == NULL) |
1da177e4 | 223 | return NULL; |
1da177e4 | 224 | |
d7e84f41 CH |
225 | _xfs_trans_bjoin(tp, bp, 1); |
226 | trace_xfs_trans_getsb(bp->b_fspriv); | |
d99831ff | 227 | return bp; |
1da177e4 LT |
228 | } |
229 | ||
1da177e4 LT |
230 | /* |
231 | * Get and lock the buffer for the caller if it is not already | |
232 | * locked within the given transaction. If it has not yet been | |
233 | * read in, read it from disk. If it is already locked | |
234 | * within the transaction and already read in, just increment its | |
235 | * lock recursion count and return a pointer to it. | |
236 | * | |
1da177e4 LT |
237 | * If the transaction pointer is NULL, make this just a normal |
238 | * read_buf() call. | |
239 | */ | |
240 | int | |
de2a4f59 DC |
241 | xfs_trans_read_buf_map( |
242 | struct xfs_mount *mp, | |
243 | struct xfs_trans *tp, | |
244 | struct xfs_buftarg *target, | |
245 | struct xfs_buf_map *map, | |
246 | int nmaps, | |
247 | xfs_buf_flags_t flags, | |
c3f8fc73 | 248 | struct xfs_buf **bpp, |
1813dd64 | 249 | const struct xfs_buf_ops *ops) |
1da177e4 | 250 | { |
2d3d0c53 DC |
251 | struct xfs_buf *bp = NULL; |
252 | struct xfs_buf_log_item *bip; | |
1da177e4 LT |
253 | int error; |
254 | ||
7ca790a5 | 255 | *bpp = NULL; |
1da177e4 LT |
256 | /* |
257 | * If we find the buffer in the cache with this transaction | |
258 | * pointer in its b_fsprivate2 field, then we know we already | |
259 | * have it locked. If it is already read in we just increment | |
260 | * the lock recursion count and return the buffer to the caller. | |
261 | * If the buffer is not yet read in, then we read it in, increment | |
262 | * the lock recursion count, and return it to the caller. | |
263 | */ | |
2d3d0c53 DC |
264 | if (tp) |
265 | bp = xfs_trans_buf_item_match(tp, target, map, nmaps); | |
266 | if (bp) { | |
0c842ad4 | 267 | ASSERT(xfs_buf_islocked(bp)); |
bf9d9013 | 268 | ASSERT(bp->b_transp == tp); |
adadbeef | 269 | ASSERT(bp->b_fspriv != NULL); |
5a52c2a5 | 270 | ASSERT(!bp->b_error); |
2d3d0c53 DC |
271 | ASSERT(bp->b_flags & XBF_DONE); |
272 | ||
1da177e4 LT |
273 | /* |
274 | * We never locked this buf ourselves, so we shouldn't | |
275 | * brelse it either. Just get out. | |
276 | */ | |
277 | if (XFS_FORCED_SHUTDOWN(mp)) { | |
0b1b213f | 278 | trace_xfs_trans_read_buf_shut(bp, _RET_IP_); |
2451337d | 279 | return -EIO; |
1da177e4 LT |
280 | } |
281 | ||
adadbeef | 282 | bip = bp->b_fspriv; |
1da177e4 LT |
283 | bip->bli_recur++; |
284 | ||
285 | ASSERT(atomic_read(&bip->bli_refcount) > 0); | |
0b1b213f | 286 | trace_xfs_trans_read_buf_recur(bip); |
1da177e4 LT |
287 | *bpp = bp; |
288 | return 0; | |
289 | } | |
290 | ||
1813dd64 | 291 | bp = xfs_buf_read_map(target, map, nmaps, flags, ops); |
2d3d0c53 DC |
292 | if (!bp) { |
293 | if (!(flags & XBF_TRYLOCK)) | |
294 | return -ENOMEM; | |
295 | return tp ? 0 : -EAGAIN; | |
1da177e4 | 296 | } |
2d3d0c53 DC |
297 | |
298 | /* | |
299 | * If we've had a read error, then the contents of the buffer are | |
300 | * invalid and should not be used. To ensure that a followup read tries | |
301 | * to pull the buffer from disk again, we clear the XBF_DONE flag and | |
302 | * mark the buffer stale. This ensures that anyone who has a current | |
303 | * reference to the buffer will interpret it's contents correctly and | |
304 | * future cache lookups will also treat it as an empty, uninitialised | |
305 | * buffer. | |
306 | */ | |
5a52c2a5 CS |
307 | if (bp->b_error) { |
308 | error = bp->b_error; | |
2d3d0c53 DC |
309 | if (!XFS_FORCED_SHUTDOWN(mp)) |
310 | xfs_buf_ioerror_alert(bp, __func__); | |
311 | bp->b_flags &= ~XBF_DONE; | |
c867cb61 | 312 | xfs_buf_stale(bp); |
2d3d0c53 DC |
313 | |
314 | if (tp && (tp->t_flags & XFS_TRANS_DIRTY)) | |
7d04a335 | 315 | xfs_force_shutdown(tp->t_mountp, SHUTDOWN_META_IO_ERROR); |
1da177e4 | 316 | xfs_buf_relse(bp); |
ac75a1f7 DC |
317 | |
318 | /* bad CRC means corrupted metadata */ | |
2451337d DC |
319 | if (error == -EFSBADCRC) |
320 | error = -EFSCORRUPTED; | |
1da177e4 LT |
321 | return error; |
322 | } | |
2d3d0c53 DC |
323 | |
324 | if (XFS_FORCED_SHUTDOWN(mp)) { | |
325 | xfs_buf_relse(bp); | |
326 | trace_xfs_trans_read_buf_shut(bp, _RET_IP_); | |
327 | return -EIO; | |
1da177e4 | 328 | } |
1da177e4 | 329 | |
2d3d0c53 DC |
330 | if (tp) |
331 | _xfs_trans_bjoin(tp, bp, 1); | |
d7e84f41 | 332 | trace_xfs_trans_read_buf(bp->b_fspriv); |
1da177e4 LT |
333 | *bpp = bp; |
334 | return 0; | |
335 | ||
1da177e4 LT |
336 | } |
337 | ||
1da177e4 LT |
338 | /* |
339 | * Release the buffer bp which was previously acquired with one of the | |
340 | * xfs_trans_... buffer allocation routines if the buffer has not | |
341 | * been modified within this transaction. If the buffer is modified | |
342 | * within this transaction, do decrement the recursion count but do | |
343 | * not release the buffer even if the count goes to 0. If the buffer is not | |
344 | * modified within the transaction, decrement the recursion count and | |
345 | * release the buffer if the recursion count goes to 0. | |
346 | * | |
347 | * If the buffer is to be released and it was not modified before | |
348 | * this transaction began, then free the buf_log_item associated with it. | |
349 | * | |
350 | * If the transaction pointer is NULL, make this just a normal | |
351 | * brelse() call. | |
352 | */ | |
353 | void | |
354 | xfs_trans_brelse(xfs_trans_t *tp, | |
355 | xfs_buf_t *bp) | |
356 | { | |
357 | xfs_buf_log_item_t *bip; | |
1da177e4 LT |
358 | |
359 | /* | |
360 | * Default to a normal brelse() call if the tp is NULL. | |
361 | */ | |
362 | if (tp == NULL) { | |
bf9d9013 | 363 | ASSERT(bp->b_transp == NULL); |
1da177e4 LT |
364 | xfs_buf_relse(bp); |
365 | return; | |
366 | } | |
367 | ||
bf9d9013 | 368 | ASSERT(bp->b_transp == tp); |
adadbeef | 369 | bip = bp->b_fspriv; |
1da177e4 LT |
370 | ASSERT(bip->bli_item.li_type == XFS_LI_BUF); |
371 | ASSERT(!(bip->bli_flags & XFS_BLI_STALE)); | |
0f22f9d0 | 372 | ASSERT(!(bip->__bli_format.blf_flags & XFS_BLF_CANCEL)); |
1da177e4 LT |
373 | ASSERT(atomic_read(&bip->bli_refcount) > 0); |
374 | ||
0b1b213f CH |
375 | trace_xfs_trans_brelse(bip); |
376 | ||
1da177e4 LT |
377 | /* |
378 | * If the release is just for a recursive lock, | |
379 | * then decrement the count and return. | |
380 | */ | |
381 | if (bip->bli_recur > 0) { | |
382 | bip->bli_recur--; | |
1da177e4 LT |
383 | return; |
384 | } | |
385 | ||
386 | /* | |
387 | * If the buffer is dirty within this transaction, we can't | |
388 | * release it until we commit. | |
389 | */ | |
e98c414f | 390 | if (bip->bli_item.li_desc->lid_flags & XFS_LID_DIRTY) |
1da177e4 | 391 | return; |
1da177e4 LT |
392 | |
393 | /* | |
394 | * If the buffer has been invalidated, then we can't release | |
395 | * it until the transaction commits to disk unless it is re-dirtied | |
396 | * as part of this transaction. This prevents us from pulling | |
397 | * the item from the AIL before we should. | |
398 | */ | |
0b1b213f | 399 | if (bip->bli_flags & XFS_BLI_STALE) |
1da177e4 | 400 | return; |
1da177e4 LT |
401 | |
402 | ASSERT(!(bip->bli_flags & XFS_BLI_LOGGED)); | |
1da177e4 LT |
403 | |
404 | /* | |
405 | * Free up the log item descriptor tracking the released item. | |
406 | */ | |
e98c414f | 407 | xfs_trans_del_item(&bip->bli_item); |
1da177e4 LT |
408 | |
409 | /* | |
410 | * Clear the hold flag in the buf log item if it is set. | |
411 | * We wouldn't want the next user of the buffer to | |
412 | * get confused. | |
413 | */ | |
414 | if (bip->bli_flags & XFS_BLI_HOLD) { | |
415 | bip->bli_flags &= ~XFS_BLI_HOLD; | |
416 | } | |
417 | ||
418 | /* | |
419 | * Drop our reference to the buf log item. | |
420 | */ | |
421 | atomic_dec(&bip->bli_refcount); | |
422 | ||
423 | /* | |
424 | * If the buf item is not tracking data in the log, then | |
425 | * we must free it before releasing the buffer back to the | |
426 | * free pool. Before releasing the buffer to the free pool, | |
427 | * clear the transaction pointer in b_fsprivate2 to dissolve | |
428 | * its relation to this transaction. | |
429 | */ | |
430 | if (!xfs_buf_item_dirty(bip)) { | |
431 | /*** | |
432 | ASSERT(bp->b_pincount == 0); | |
433 | ***/ | |
434 | ASSERT(atomic_read(&bip->bli_refcount) == 0); | |
435 | ASSERT(!(bip->bli_item.li_flags & XFS_LI_IN_AIL)); | |
436 | ASSERT(!(bip->bli_flags & XFS_BLI_INODE_ALLOC_BUF)); | |
437 | xfs_buf_item_relse(bp); | |
1da177e4 LT |
438 | } |
439 | ||
5b03ff1b | 440 | bp->b_transp = NULL; |
1da177e4 | 441 | xfs_buf_relse(bp); |
1da177e4 LT |
442 | } |
443 | ||
1da177e4 LT |
444 | /* |
445 | * Mark the buffer as not needing to be unlocked when the buf item's | |
904c17e6 | 446 | * iop_unlock() routine is called. The buffer must already be locked |
1da177e4 LT |
447 | * and associated with the given transaction. |
448 | */ | |
449 | /* ARGSUSED */ | |
450 | void | |
451 | xfs_trans_bhold(xfs_trans_t *tp, | |
452 | xfs_buf_t *bp) | |
453 | { | |
adadbeef | 454 | xfs_buf_log_item_t *bip = bp->b_fspriv; |
1da177e4 | 455 | |
bf9d9013 | 456 | ASSERT(bp->b_transp == tp); |
adadbeef | 457 | ASSERT(bip != NULL); |
1da177e4 | 458 | ASSERT(!(bip->bli_flags & XFS_BLI_STALE)); |
0f22f9d0 | 459 | ASSERT(!(bip->__bli_format.blf_flags & XFS_BLF_CANCEL)); |
1da177e4 | 460 | ASSERT(atomic_read(&bip->bli_refcount) > 0); |
adadbeef | 461 | |
1da177e4 | 462 | bip->bli_flags |= XFS_BLI_HOLD; |
0b1b213f | 463 | trace_xfs_trans_bhold(bip); |
1da177e4 LT |
464 | } |
465 | ||
efa092f3 TS |
466 | /* |
467 | * Cancel the previous buffer hold request made on this buffer | |
468 | * for this transaction. | |
469 | */ | |
470 | void | |
471 | xfs_trans_bhold_release(xfs_trans_t *tp, | |
472 | xfs_buf_t *bp) | |
473 | { | |
adadbeef | 474 | xfs_buf_log_item_t *bip = bp->b_fspriv; |
efa092f3 | 475 | |
bf9d9013 | 476 | ASSERT(bp->b_transp == tp); |
adadbeef | 477 | ASSERT(bip != NULL); |
efa092f3 | 478 | ASSERT(!(bip->bli_flags & XFS_BLI_STALE)); |
0f22f9d0 | 479 | ASSERT(!(bip->__bli_format.blf_flags & XFS_BLF_CANCEL)); |
efa092f3 TS |
480 | ASSERT(atomic_read(&bip->bli_refcount) > 0); |
481 | ASSERT(bip->bli_flags & XFS_BLI_HOLD); | |
0b1b213f | 482 | |
adadbeef | 483 | bip->bli_flags &= ~XFS_BLI_HOLD; |
0b1b213f | 484 | trace_xfs_trans_bhold_release(bip); |
efa092f3 TS |
485 | } |
486 | ||
1da177e4 LT |
487 | /* |
488 | * This is called to mark bytes first through last inclusive of the given | |
489 | * buffer as needing to be logged when the transaction is committed. | |
490 | * The buffer must already be associated with the given transaction. | |
491 | * | |
492 | * First and last are numbers relative to the beginning of this buffer, | |
493 | * so the first byte in the buffer is numbered 0 regardless of the | |
494 | * value of b_blkno. | |
495 | */ | |
496 | void | |
497 | xfs_trans_log_buf(xfs_trans_t *tp, | |
498 | xfs_buf_t *bp, | |
499 | uint first, | |
500 | uint last) | |
501 | { | |
adadbeef | 502 | xfs_buf_log_item_t *bip = bp->b_fspriv; |
1da177e4 | 503 | |
bf9d9013 | 504 | ASSERT(bp->b_transp == tp); |
adadbeef | 505 | ASSERT(bip != NULL); |
aa0e8833 | 506 | ASSERT(first <= last && last < BBTOB(bp->b_length)); |
cb669ca5 CH |
507 | ASSERT(bp->b_iodone == NULL || |
508 | bp->b_iodone == xfs_buf_iodone_callbacks); | |
1da177e4 LT |
509 | |
510 | /* | |
511 | * Mark the buffer as needing to be written out eventually, | |
512 | * and set its iodone function to remove the buffer's buf log | |
513 | * item from the AIL and free it when the buffer is flushed | |
514 | * to disk. See xfs_buf_attach_iodone() for more details | |
515 | * on li_cb and xfs_buf_iodone_callbacks(). | |
516 | * If we end up aborting this transaction, we trap this buffer | |
517 | * inside the b_bdstrat callback so that this won't get written to | |
518 | * disk. | |
519 | */ | |
1da177e4 LT |
520 | XFS_BUF_DONE(bp); |
521 | ||
1da177e4 | 522 | ASSERT(atomic_read(&bip->bli_refcount) > 0); |
cb669ca5 | 523 | bp->b_iodone = xfs_buf_iodone_callbacks; |
ca30b2a7 | 524 | bip->bli_item.li_cb = xfs_buf_iodone; |
1da177e4 | 525 | |
0b1b213f CH |
526 | trace_xfs_trans_log_buf(bip); |
527 | ||
1da177e4 LT |
528 | /* |
529 | * If we invalidated the buffer within this transaction, then | |
530 | * cancel the invalidation now that we're dirtying the buffer | |
531 | * again. There are no races with the code in xfs_buf_item_unpin(), | |
532 | * because we have a reference to the buffer this entire time. | |
533 | */ | |
534 | if (bip->bli_flags & XFS_BLI_STALE) { | |
1da177e4 LT |
535 | bip->bli_flags &= ~XFS_BLI_STALE; |
536 | ASSERT(XFS_BUF_ISSTALE(bp)); | |
537 | XFS_BUF_UNSTALE(bp); | |
0f22f9d0 | 538 | bip->__bli_format.blf_flags &= ~XFS_BLF_CANCEL; |
1da177e4 LT |
539 | } |
540 | ||
1da177e4 | 541 | tp->t_flags |= XFS_TRANS_DIRTY; |
e98c414f | 542 | bip->bli_item.li_desc->lid_flags |= XFS_LID_DIRTY; |
5f6bed76 DC |
543 | |
544 | /* | |
545 | * If we have an ordered buffer we are not logging any dirty range but | |
546 | * it still needs to be marked dirty and that it has been logged. | |
547 | */ | |
548 | bip->bli_flags |= XFS_BLI_DIRTY | XFS_BLI_LOGGED; | |
549 | if (!(bip->bli_flags & XFS_BLI_ORDERED)) | |
550 | xfs_buf_item_log(bip, first, last); | |
1da177e4 LT |
551 | } |
552 | ||
553 | ||
554 | /* | |
43ff2122 CH |
555 | * Invalidate a buffer that is being used within a transaction. |
556 | * | |
557 | * Typically this is because the blocks in the buffer are being freed, so we | |
558 | * need to prevent it from being written out when we're done. Allowing it | |
559 | * to be written again might overwrite data in the free blocks if they are | |
560 | * reallocated to a file. | |
1da177e4 | 561 | * |
43ff2122 CH |
562 | * We prevent the buffer from being written out by marking it stale. We can't |
563 | * get rid of the buf log item at this point because the buffer may still be | |
564 | * pinned by another transaction. If that is the case, then we'll wait until | |
565 | * the buffer is committed to disk for the last time (we can tell by the ref | |
566 | * count) and free it in xfs_buf_item_unpin(). Until that happens we will | |
567 | * keep the buffer locked so that the buffer and buf log item are not reused. | |
568 | * | |
569 | * We also set the XFS_BLF_CANCEL flag in the buf log format structure and log | |
570 | * the buf item. This will be used at recovery time to determine that copies | |
571 | * of the buffer in the log before this should not be replayed. | |
572 | * | |
573 | * We mark the item descriptor and the transaction dirty so that we'll hold | |
574 | * the buffer until after the commit. | |
575 | * | |
576 | * Since we're invalidating the buffer, we also clear the state about which | |
577 | * parts of the buffer have been logged. We also clear the flag indicating | |
578 | * that this is an inode buffer since the data in the buffer will no longer | |
579 | * be valid. | |
580 | * | |
581 | * We set the stale bit in the buffer as well since we're getting rid of it. | |
1da177e4 LT |
582 | */ |
583 | void | |
584 | xfs_trans_binval( | |
585 | xfs_trans_t *tp, | |
586 | xfs_buf_t *bp) | |
587 | { | |
adadbeef | 588 | xfs_buf_log_item_t *bip = bp->b_fspriv; |
91e4bac0 | 589 | int i; |
1da177e4 | 590 | |
bf9d9013 | 591 | ASSERT(bp->b_transp == tp); |
adadbeef | 592 | ASSERT(bip != NULL); |
1da177e4 LT |
593 | ASSERT(atomic_read(&bip->bli_refcount) > 0); |
594 | ||
0b1b213f CH |
595 | trace_xfs_trans_binval(bip); |
596 | ||
1da177e4 LT |
597 | if (bip->bli_flags & XFS_BLI_STALE) { |
598 | /* | |
599 | * If the buffer is already invalidated, then | |
600 | * just return. | |
601 | */ | |
1da177e4 LT |
602 | ASSERT(XFS_BUF_ISSTALE(bp)); |
603 | ASSERT(!(bip->bli_flags & (XFS_BLI_LOGGED | XFS_BLI_DIRTY))); | |
0f22f9d0 | 604 | ASSERT(!(bip->__bli_format.blf_flags & XFS_BLF_INODE_BUF)); |
61fe135c | 605 | ASSERT(!(bip->__bli_format.blf_flags & XFS_BLFT_MASK)); |
0f22f9d0 | 606 | ASSERT(bip->__bli_format.blf_flags & XFS_BLF_CANCEL); |
e98c414f | 607 | ASSERT(bip->bli_item.li_desc->lid_flags & XFS_LID_DIRTY); |
1da177e4 | 608 | ASSERT(tp->t_flags & XFS_TRANS_DIRTY); |
1da177e4 LT |
609 | return; |
610 | } | |
611 | ||
c867cb61 | 612 | xfs_buf_stale(bp); |
43ff2122 | 613 | |
1da177e4 | 614 | bip->bli_flags |= XFS_BLI_STALE; |
ccf7c23f | 615 | bip->bli_flags &= ~(XFS_BLI_INODE_BUF | XFS_BLI_LOGGED | XFS_BLI_DIRTY); |
0f22f9d0 MT |
616 | bip->__bli_format.blf_flags &= ~XFS_BLF_INODE_BUF; |
617 | bip->__bli_format.blf_flags |= XFS_BLF_CANCEL; | |
61fe135c | 618 | bip->__bli_format.blf_flags &= ~XFS_BLFT_MASK; |
91e4bac0 MT |
619 | for (i = 0; i < bip->bli_format_count; i++) { |
620 | memset(bip->bli_formats[i].blf_data_map, 0, | |
621 | (bip->bli_formats[i].blf_map_size * sizeof(uint))); | |
622 | } | |
e98c414f | 623 | bip->bli_item.li_desc->lid_flags |= XFS_LID_DIRTY; |
1da177e4 | 624 | tp->t_flags |= XFS_TRANS_DIRTY; |
1da177e4 LT |
625 | } |
626 | ||
627 | /* | |
ccf7c23f DC |
628 | * This call is used to indicate that the buffer contains on-disk inodes which |
629 | * must be handled specially during recovery. They require special handling | |
630 | * because only the di_next_unlinked from the inodes in the buffer should be | |
631 | * recovered. The rest of the data in the buffer is logged via the inodes | |
632 | * themselves. | |
1da177e4 | 633 | * |
ccf7c23f DC |
634 | * All we do is set the XFS_BLI_INODE_BUF flag in the items flags so it can be |
635 | * transferred to the buffer's log format structure so that we'll know what to | |
636 | * do at recovery time. | |
1da177e4 | 637 | */ |
1da177e4 LT |
638 | void |
639 | xfs_trans_inode_buf( | |
640 | xfs_trans_t *tp, | |
641 | xfs_buf_t *bp) | |
642 | { | |
adadbeef | 643 | xfs_buf_log_item_t *bip = bp->b_fspriv; |
1da177e4 | 644 | |
bf9d9013 | 645 | ASSERT(bp->b_transp == tp); |
adadbeef | 646 | ASSERT(bip != NULL); |
1da177e4 LT |
647 | ASSERT(atomic_read(&bip->bli_refcount) > 0); |
648 | ||
ccf7c23f | 649 | bip->bli_flags |= XFS_BLI_INODE_BUF; |
61fe135c | 650 | xfs_trans_buf_set_type(tp, bp, XFS_BLFT_DINO_BUF); |
1da177e4 LT |
651 | } |
652 | ||
653 | /* | |
654 | * This call is used to indicate that the buffer is going to | |
655 | * be staled and was an inode buffer. This means it gets | |
93848a99 | 656 | * special processing during unpin - where any inodes |
1da177e4 LT |
657 | * associated with the buffer should be removed from ail. |
658 | * There is also special processing during recovery, | |
659 | * any replay of the inodes in the buffer needs to be | |
660 | * prevented as the buffer may have been reused. | |
661 | */ | |
662 | void | |
663 | xfs_trans_stale_inode_buf( | |
664 | xfs_trans_t *tp, | |
665 | xfs_buf_t *bp) | |
666 | { | |
adadbeef | 667 | xfs_buf_log_item_t *bip = bp->b_fspriv; |
1da177e4 | 668 | |
bf9d9013 | 669 | ASSERT(bp->b_transp == tp); |
adadbeef | 670 | ASSERT(bip != NULL); |
1da177e4 LT |
671 | ASSERT(atomic_read(&bip->bli_refcount) > 0); |
672 | ||
673 | bip->bli_flags |= XFS_BLI_STALE_INODE; | |
ca30b2a7 | 674 | bip->bli_item.li_cb = xfs_buf_iodone; |
61fe135c | 675 | xfs_trans_buf_set_type(tp, bp, XFS_BLFT_DINO_BUF); |
1da177e4 LT |
676 | } |
677 | ||
1da177e4 LT |
678 | /* |
679 | * Mark the buffer as being one which contains newly allocated | |
680 | * inodes. We need to make sure that even if this buffer is | |
681 | * relogged as an 'inode buf' we still recover all of the inode | |
682 | * images in the face of a crash. This works in coordination with | |
683 | * xfs_buf_item_committed() to ensure that the buffer remains in the | |
684 | * AIL at its original location even after it has been relogged. | |
685 | */ | |
686 | /* ARGSUSED */ | |
687 | void | |
688 | xfs_trans_inode_alloc_buf( | |
689 | xfs_trans_t *tp, | |
690 | xfs_buf_t *bp) | |
691 | { | |
adadbeef | 692 | xfs_buf_log_item_t *bip = bp->b_fspriv; |
1da177e4 | 693 | |
bf9d9013 | 694 | ASSERT(bp->b_transp == tp); |
adadbeef | 695 | ASSERT(bip != NULL); |
1da177e4 LT |
696 | ASSERT(atomic_read(&bip->bli_refcount) > 0); |
697 | ||
698 | bip->bli_flags |= XFS_BLI_INODE_ALLOC_BUF; | |
61fe135c | 699 | xfs_trans_buf_set_type(tp, bp, XFS_BLFT_DINO_BUF); |
1da177e4 LT |
700 | } |
701 | ||
5f6bed76 DC |
702 | /* |
703 | * Mark the buffer as ordered for this transaction. This means | |
704 | * that the contents of the buffer are not recorded in the transaction | |
705 | * but it is tracked in the AIL as though it was. This allows us | |
706 | * to record logical changes in transactions rather than the physical | |
707 | * changes we make to the buffer without changing writeback ordering | |
708 | * constraints of metadata buffers. | |
709 | */ | |
710 | void | |
711 | xfs_trans_ordered_buf( | |
712 | struct xfs_trans *tp, | |
713 | struct xfs_buf *bp) | |
714 | { | |
715 | struct xfs_buf_log_item *bip = bp->b_fspriv; | |
716 | ||
717 | ASSERT(bp->b_transp == tp); | |
718 | ASSERT(bip != NULL); | |
719 | ASSERT(atomic_read(&bip->bli_refcount) > 0); | |
720 | ||
721 | bip->bli_flags |= XFS_BLI_ORDERED; | |
722 | trace_xfs_buf_item_ordered(bip); | |
723 | } | |
724 | ||
ee1a47ab CH |
725 | /* |
726 | * Set the type of the buffer for log recovery so that it can correctly identify | |
727 | * and hence attach the correct buffer ops to the buffer after replay. | |
728 | */ | |
729 | void | |
730 | xfs_trans_buf_set_type( | |
731 | struct xfs_trans *tp, | |
732 | struct xfs_buf *bp, | |
61fe135c | 733 | enum xfs_blft type) |
ee1a47ab CH |
734 | { |
735 | struct xfs_buf_log_item *bip = bp->b_fspriv; | |
736 | ||
d75afeb3 DC |
737 | if (!tp) |
738 | return; | |
739 | ||
ee1a47ab CH |
740 | ASSERT(bp->b_transp == tp); |
741 | ASSERT(bip != NULL); | |
742 | ASSERT(atomic_read(&bip->bli_refcount) > 0); | |
ee1a47ab | 743 | |
61fe135c | 744 | xfs_blft_to_flags(&bip->__bli_format, type); |
ee1a47ab | 745 | } |
1da177e4 | 746 | |
d75afeb3 DC |
747 | void |
748 | xfs_trans_buf_copy_type( | |
749 | struct xfs_buf *dst_bp, | |
750 | struct xfs_buf *src_bp) | |
751 | { | |
752 | struct xfs_buf_log_item *sbip = src_bp->b_fspriv; | |
753 | struct xfs_buf_log_item *dbip = dst_bp->b_fspriv; | |
61fe135c | 754 | enum xfs_blft type; |
d75afeb3 | 755 | |
61fe135c DC |
756 | type = xfs_blft_from_flags(&sbip->__bli_format); |
757 | xfs_blft_to_flags(&dbip->__bli_format, type); | |
d75afeb3 DC |
758 | } |
759 | ||
1da177e4 LT |
760 | /* |
761 | * Similar to xfs_trans_inode_buf(), this marks the buffer as a cluster of | |
762 | * dquots. However, unlike in inode buffer recovery, dquot buffers get | |
763 | * recovered in their entirety. (Hence, no XFS_BLI_DQUOT_ALLOC_BUF flag). | |
764 | * The only thing that makes dquot buffers different from regular | |
765 | * buffers is that we must not replay dquot bufs when recovering | |
766 | * if a _corresponding_ quotaoff has happened. We also have to distinguish | |
767 | * between usr dquot bufs and grp dquot bufs, because usr and grp quotas | |
768 | * can be turned off independently. | |
769 | */ | |
770 | /* ARGSUSED */ | |
771 | void | |
772 | xfs_trans_dquot_buf( | |
773 | xfs_trans_t *tp, | |
774 | xfs_buf_t *bp, | |
775 | uint type) | |
776 | { | |
61fe135c DC |
777 | struct xfs_buf_log_item *bip = bp->b_fspriv; |
778 | ||
c1155410 DC |
779 | ASSERT(type == XFS_BLF_UDQUOT_BUF || |
780 | type == XFS_BLF_PDQUOT_BUF || | |
781 | type == XFS_BLF_GDQUOT_BUF); | |
1da177e4 | 782 | |
61fe135c DC |
783 | bip->__bli_format.blf_flags |= type; |
784 | ||
785 | switch (type) { | |
786 | case XFS_BLF_UDQUOT_BUF: | |
787 | type = XFS_BLFT_UDQUOT_BUF; | |
788 | break; | |
789 | case XFS_BLF_PDQUOT_BUF: | |
790 | type = XFS_BLFT_PDQUOT_BUF; | |
791 | break; | |
792 | case XFS_BLF_GDQUOT_BUF: | |
793 | type = XFS_BLFT_GDQUOT_BUF; | |
794 | break; | |
795 | default: | |
796 | type = XFS_BLFT_UNKNOWN_BUF; | |
797 | break; | |
798 | } | |
799 | ||
ee1a47ab | 800 | xfs_trans_buf_set_type(tp, bp, type); |
1da177e4 | 801 | } |