Commit | Line | Data |
---|---|---|
0b61f8a4 | 1 | // SPDX-License-Identifier: GPL-2.0 |
1da177e4 | 2 | /* |
7b718769 NS |
3 | * Copyright (c) 2000-2005 Silicon Graphics, Inc. |
4 | * All Rights Reserved. | |
1da177e4 | 5 | */ |
1da177e4 | 6 | #include "xfs.h" |
a844f451 | 7 | #include "xfs_fs.h" |
70a9883c | 8 | #include "xfs_shared.h" |
a4fbe6ab | 9 | #include "xfs_format.h" |
239880ef DC |
10 | #include "xfs_log_format.h" |
11 | #include "xfs_trans_resv.h" | |
1da177e4 | 12 | #include "xfs_mount.h" |
e9e899a2 | 13 | #include "xfs_errortag.h" |
1da177e4 | 14 | #include "xfs_error.h" |
239880ef DC |
15 | #include "xfs_trans.h" |
16 | #include "xfs_trans_priv.h" | |
17 | #include "xfs_log.h" | |
1da177e4 | 18 | #include "xfs_log_priv.h" |
0b1b213f | 19 | #include "xfs_trace.h" |
baff4e44 | 20 | #include "xfs_sysfs.h" |
61e63ecb | 21 | #include "xfs_sb.h" |
39353ff6 | 22 | #include "xfs_health.h" |
1da177e4 | 23 | |
eb01c9cd | 24 | kmem_zone_t *xfs_log_ticket_zone; |
1da177e4 | 25 | |
1da177e4 | 26 | /* Local miscellaneous function prototypes */ |
9a8d2fdb MT |
27 | STATIC struct xlog * |
28 | xlog_alloc_log( | |
29 | struct xfs_mount *mp, | |
30 | struct xfs_buftarg *log_target, | |
31 | xfs_daddr_t blk_offset, | |
32 | int num_bblks); | |
ad223e60 MT |
33 | STATIC int |
34 | xlog_space_left( | |
35 | struct xlog *log, | |
36 | atomic64_t *head); | |
9a8d2fdb MT |
37 | STATIC void |
38 | xlog_dealloc_log( | |
39 | struct xlog *log); | |
1da177e4 LT |
40 | |
41 | /* local state machine functions */ | |
d15cbf2f | 42 | STATIC void xlog_state_done_syncing( |
12e6a0f4 | 43 | struct xlog_in_core *iclog); |
9a8d2fdb MT |
44 | STATIC int |
45 | xlog_state_get_iclog_space( | |
46 | struct xlog *log, | |
47 | int len, | |
48 | struct xlog_in_core **iclog, | |
49 | struct xlog_ticket *ticket, | |
50 | int *continued_write, | |
51 | int *logoffsetp); | |
9a8d2fdb MT |
52 | STATIC void |
53 | xlog_state_switch_iclogs( | |
54 | struct xlog *log, | |
55 | struct xlog_in_core *iclog, | |
56 | int eventual_size); | |
57 | STATIC void | |
ad223e60 | 58 | xlog_grant_push_ail( |
9a8d2fdb MT |
59 | struct xlog *log, |
60 | int need_bytes); | |
61 | STATIC void | |
df732b29 CH |
62 | xlog_sync( |
63 | struct xlog *log, | |
64 | struct xlog_in_core *iclog); | |
cfcbbbd0 | 65 | #if defined(DEBUG) |
9a8d2fdb MT |
66 | STATIC void |
67 | xlog_verify_dest_ptr( | |
68 | struct xlog *log, | |
5809d5e0 | 69 | void *ptr); |
ad223e60 MT |
70 | STATIC void |
71 | xlog_verify_grant_tail( | |
9a8d2fdb MT |
72 | struct xlog *log); |
73 | STATIC void | |
74 | xlog_verify_iclog( | |
75 | struct xlog *log, | |
76 | struct xlog_in_core *iclog, | |
abca1f33 | 77 | int count); |
9a8d2fdb MT |
78 | STATIC void |
79 | xlog_verify_tail_lsn( | |
80 | struct xlog *log, | |
81 | struct xlog_in_core *iclog, | |
82 | xfs_lsn_t tail_lsn); | |
1da177e4 LT |
83 | #else |
84 | #define xlog_verify_dest_ptr(a,b) | |
3f336c6f | 85 | #define xlog_verify_grant_tail(a) |
abca1f33 | 86 | #define xlog_verify_iclog(a,b,c) |
1da177e4 LT |
87 | #define xlog_verify_tail_lsn(a,b,c) |
88 | #endif | |
89 | ||
9a8d2fdb MT |
90 | STATIC int |
91 | xlog_iclogs_empty( | |
92 | struct xlog *log); | |
1da177e4 | 93 | |
303591a0 BF |
94 | static int |
95 | xfs_log_cover(struct xfs_mount *); | |
96 | ||
dd954c69 | 97 | static void |
663e496a | 98 | xlog_grant_sub_space( |
ad223e60 MT |
99 | struct xlog *log, |
100 | atomic64_t *head, | |
101 | int bytes) | |
dd954c69 | 102 | { |
d0eb2f38 DC |
103 | int64_t head_val = atomic64_read(head); |
104 | int64_t new, old; | |
a69ed03c | 105 | |
d0eb2f38 DC |
106 | do { |
107 | int cycle, space; | |
a69ed03c | 108 | |
d0eb2f38 | 109 | xlog_crack_grant_head_val(head_val, &cycle, &space); |
a69ed03c | 110 | |
d0eb2f38 DC |
111 | space -= bytes; |
112 | if (space < 0) { | |
113 | space += log->l_logsize; | |
114 | cycle--; | |
115 | } | |
116 | ||
117 | old = head_val; | |
118 | new = xlog_assign_grant_head_val(cycle, space); | |
119 | head_val = atomic64_cmpxchg(head, old, new); | |
120 | } while (head_val != old); | |
dd954c69 CH |
121 | } |
122 | ||
123 | static void | |
663e496a | 124 | xlog_grant_add_space( |
ad223e60 MT |
125 | struct xlog *log, |
126 | atomic64_t *head, | |
127 | int bytes) | |
dd954c69 | 128 | { |
d0eb2f38 DC |
129 | int64_t head_val = atomic64_read(head); |
130 | int64_t new, old; | |
a69ed03c | 131 | |
d0eb2f38 DC |
132 | do { |
133 | int tmp; | |
134 | int cycle, space; | |
a69ed03c | 135 | |
d0eb2f38 | 136 | xlog_crack_grant_head_val(head_val, &cycle, &space); |
a69ed03c | 137 | |
d0eb2f38 DC |
138 | tmp = log->l_logsize - space; |
139 | if (tmp > bytes) | |
140 | space += bytes; | |
141 | else { | |
142 | space = bytes - tmp; | |
143 | cycle++; | |
144 | } | |
145 | ||
146 | old = head_val; | |
147 | new = xlog_assign_grant_head_val(cycle, space); | |
148 | head_val = atomic64_cmpxchg(head, old, new); | |
149 | } while (head_val != old); | |
dd954c69 | 150 | } |
a69ed03c | 151 | |
c303c5b8 CH |
152 | STATIC void |
153 | xlog_grant_head_init( | |
154 | struct xlog_grant_head *head) | |
155 | { | |
156 | xlog_assign_grant_head(&head->grant, 1, 0); | |
157 | INIT_LIST_HEAD(&head->waiters); | |
158 | spin_lock_init(&head->lock); | |
159 | } | |
160 | ||
a79bf2d7 CH |
161 | STATIC void |
162 | xlog_grant_head_wake_all( | |
163 | struct xlog_grant_head *head) | |
164 | { | |
165 | struct xlog_ticket *tic; | |
166 | ||
167 | spin_lock(&head->lock); | |
168 | list_for_each_entry(tic, &head->waiters, t_queue) | |
169 | wake_up_process(tic->t_task); | |
170 | spin_unlock(&head->lock); | |
171 | } | |
172 | ||
e179840d CH |
173 | static inline int |
174 | xlog_ticket_reservation( | |
ad223e60 | 175 | struct xlog *log, |
e179840d CH |
176 | struct xlog_grant_head *head, |
177 | struct xlog_ticket *tic) | |
9f9c19ec | 178 | { |
e179840d CH |
179 | if (head == &log->l_write_head) { |
180 | ASSERT(tic->t_flags & XLOG_TIC_PERM_RESERV); | |
181 | return tic->t_unit_res; | |
182 | } else { | |
9f9c19ec | 183 | if (tic->t_flags & XLOG_TIC_PERM_RESERV) |
e179840d | 184 | return tic->t_unit_res * tic->t_cnt; |
9f9c19ec | 185 | else |
e179840d | 186 | return tic->t_unit_res; |
9f9c19ec | 187 | } |
9f9c19ec CH |
188 | } |
189 | ||
190 | STATIC bool | |
e179840d | 191 | xlog_grant_head_wake( |
ad223e60 | 192 | struct xlog *log, |
e179840d | 193 | struct xlog_grant_head *head, |
9f9c19ec CH |
194 | int *free_bytes) |
195 | { | |
196 | struct xlog_ticket *tic; | |
197 | int need_bytes; | |
7c107afb | 198 | bool woken_task = false; |
9f9c19ec | 199 | |
e179840d | 200 | list_for_each_entry(tic, &head->waiters, t_queue) { |
7c107afb DC |
201 | |
202 | /* | |
203 | * There is a chance that the size of the CIL checkpoints in | |
204 | * progress at the last AIL push target calculation resulted in | |
205 | * limiting the target to the log head (l_last_sync_lsn) at the | |
206 | * time. This may not reflect where the log head is now as the | |
207 | * CIL checkpoints may have completed. | |
208 | * | |
209 | * Hence when we are woken here, it may be that the head of the | |
210 | * log that has moved rather than the tail. As the tail didn't | |
211 | * move, there still won't be space available for the | |
212 | * reservation we require. However, if the AIL has already | |
213 | * pushed to the target defined by the old log head location, we | |
214 | * will hang here waiting for something else to update the AIL | |
215 | * push target. | |
216 | * | |
217 | * Therefore, if there isn't space to wake the first waiter on | |
218 | * the grant head, we need to push the AIL again to ensure the | |
219 | * target reflects both the current log tail and log head | |
220 | * position before we wait for the tail to move again. | |
221 | */ | |
222 | ||
e179840d | 223 | need_bytes = xlog_ticket_reservation(log, head, tic); |
7c107afb DC |
224 | if (*free_bytes < need_bytes) { |
225 | if (!woken_task) | |
226 | xlog_grant_push_ail(log, need_bytes); | |
9f9c19ec | 227 | return false; |
7c107afb | 228 | } |
9f9c19ec | 229 | |
e179840d CH |
230 | *free_bytes -= need_bytes; |
231 | trace_xfs_log_grant_wake_up(log, tic); | |
14a7235f | 232 | wake_up_process(tic->t_task); |
7c107afb | 233 | woken_task = true; |
9f9c19ec CH |
234 | } |
235 | ||
236 | return true; | |
237 | } | |
238 | ||
239 | STATIC int | |
23ee3df3 | 240 | xlog_grant_head_wait( |
ad223e60 | 241 | struct xlog *log, |
23ee3df3 | 242 | struct xlog_grant_head *head, |
9f9c19ec | 243 | struct xlog_ticket *tic, |
a30b0367 DC |
244 | int need_bytes) __releases(&head->lock) |
245 | __acquires(&head->lock) | |
9f9c19ec | 246 | { |
23ee3df3 | 247 | list_add_tail(&tic->t_queue, &head->waiters); |
9f9c19ec CH |
248 | |
249 | do { | |
250 | if (XLOG_FORCED_SHUTDOWN(log)) | |
251 | goto shutdown; | |
252 | xlog_grant_push_ail(log, need_bytes); | |
253 | ||
14a7235f | 254 | __set_current_state(TASK_UNINTERRUPTIBLE); |
23ee3df3 | 255 | spin_unlock(&head->lock); |
14a7235f | 256 | |
ff6d6af2 | 257 | XFS_STATS_INC(log->l_mp, xs_sleep_logspace); |
9f9c19ec | 258 | |
14a7235f CH |
259 | trace_xfs_log_grant_sleep(log, tic); |
260 | schedule(); | |
9f9c19ec CH |
261 | trace_xfs_log_grant_wake(log, tic); |
262 | ||
23ee3df3 | 263 | spin_lock(&head->lock); |
9f9c19ec CH |
264 | if (XLOG_FORCED_SHUTDOWN(log)) |
265 | goto shutdown; | |
23ee3df3 | 266 | } while (xlog_space_left(log, &head->grant) < need_bytes); |
9f9c19ec CH |
267 | |
268 | list_del_init(&tic->t_queue); | |
269 | return 0; | |
270 | shutdown: | |
271 | list_del_init(&tic->t_queue); | |
2451337d | 272 | return -EIO; |
9f9c19ec CH |
273 | } |
274 | ||
42ceedb3 CH |
275 | /* |
276 | * Atomically get the log space required for a log ticket. | |
277 | * | |
278 | * Once a ticket gets put onto head->waiters, it will only return after the | |
279 | * needed reservation is satisfied. | |
280 | * | |
281 | * This function is structured so that it has a lock free fast path. This is | |
282 | * necessary because every new transaction reservation will come through this | |
283 | * path. Hence any lock will be globally hot if we take it unconditionally on | |
284 | * every pass. | |
285 | * | |
286 | * As tickets are only ever moved on and off head->waiters under head->lock, we | |
287 | * only need to take that lock if we are going to add the ticket to the queue | |
288 | * and sleep. We can avoid taking the lock if the ticket was never added to | |
289 | * head->waiters because the t_queue list head will be empty and we hold the | |
290 | * only reference to it so it can safely be checked unlocked. | |
291 | */ | |
292 | STATIC int | |
293 | xlog_grant_head_check( | |
ad223e60 | 294 | struct xlog *log, |
42ceedb3 CH |
295 | struct xlog_grant_head *head, |
296 | struct xlog_ticket *tic, | |
297 | int *need_bytes) | |
298 | { | |
299 | int free_bytes; | |
300 | int error = 0; | |
301 | ||
302 | ASSERT(!(log->l_flags & XLOG_ACTIVE_RECOVERY)); | |
303 | ||
304 | /* | |
305 | * If there are other waiters on the queue then give them a chance at | |
306 | * logspace before us. Wake up the first waiters, if we do not wake | |
307 | * up all the waiters then go to sleep waiting for more free space, | |
308 | * otherwise try to get some space for this transaction. | |
309 | */ | |
310 | *need_bytes = xlog_ticket_reservation(log, head, tic); | |
311 | free_bytes = xlog_space_left(log, &head->grant); | |
312 | if (!list_empty_careful(&head->waiters)) { | |
313 | spin_lock(&head->lock); | |
314 | if (!xlog_grant_head_wake(log, head, &free_bytes) || | |
315 | free_bytes < *need_bytes) { | |
316 | error = xlog_grant_head_wait(log, head, tic, | |
317 | *need_bytes); | |
318 | } | |
319 | spin_unlock(&head->lock); | |
320 | } else if (free_bytes < *need_bytes) { | |
321 | spin_lock(&head->lock); | |
322 | error = xlog_grant_head_wait(log, head, tic, *need_bytes); | |
323 | spin_unlock(&head->lock); | |
324 | } | |
325 | ||
326 | return error; | |
327 | } | |
328 | ||
0adba536 CH |
329 | static void |
330 | xlog_tic_reset_res(xlog_ticket_t *tic) | |
331 | { | |
332 | tic->t_res_num = 0; | |
333 | tic->t_res_arr_sum = 0; | |
334 | tic->t_res_num_ophdrs = 0; | |
335 | } | |
336 | ||
337 | static void | |
338 | xlog_tic_add_region(xlog_ticket_t *tic, uint len, uint type) | |
339 | { | |
340 | if (tic->t_res_num == XLOG_TIC_LEN_MAX) { | |
341 | /* add to overflow and start again */ | |
342 | tic->t_res_o_flow += tic->t_res_arr_sum; | |
343 | tic->t_res_num = 0; | |
344 | tic->t_res_arr_sum = 0; | |
345 | } | |
346 | ||
347 | tic->t_res_arr[tic->t_res_num].r_len = len; | |
348 | tic->t_res_arr[tic->t_res_num].r_type = type; | |
349 | tic->t_res_arr_sum += len; | |
350 | tic->t_res_num++; | |
351 | } | |
dd954c69 | 352 | |
50d25484 BF |
353 | bool |
354 | xfs_log_writable( | |
355 | struct xfs_mount *mp) | |
356 | { | |
357 | /* | |
8e9800f9 DW |
358 | * Do not write to the log on norecovery mounts, if the data or log |
359 | * devices are read-only, or if the filesystem is shutdown. Read-only | |
360 | * mounts allow internal writes for log recovery and unmount purposes, | |
361 | * so don't restrict that case. | |
50d25484 BF |
362 | */ |
363 | if (mp->m_flags & XFS_MOUNT_NORECOVERY) | |
364 | return false; | |
8e9800f9 DW |
365 | if (xfs_readonly_buftarg(mp->m_ddev_targp)) |
366 | return false; | |
50d25484 BF |
367 | if (xfs_readonly_buftarg(mp->m_log->l_targ)) |
368 | return false; | |
369 | if (XFS_FORCED_SHUTDOWN(mp)) | |
370 | return false; | |
371 | return true; | |
372 | } | |
373 | ||
9006fb91 CH |
374 | /* |
375 | * Replenish the byte reservation required by moving the grant write head. | |
376 | */ | |
377 | int | |
378 | xfs_log_regrant( | |
379 | struct xfs_mount *mp, | |
380 | struct xlog_ticket *tic) | |
381 | { | |
ad223e60 | 382 | struct xlog *log = mp->m_log; |
9006fb91 CH |
383 | int need_bytes; |
384 | int error = 0; | |
385 | ||
386 | if (XLOG_FORCED_SHUTDOWN(log)) | |
2451337d | 387 | return -EIO; |
9006fb91 | 388 | |
ff6d6af2 | 389 | XFS_STATS_INC(mp, xs_try_logspace); |
9006fb91 CH |
390 | |
391 | /* | |
392 | * This is a new transaction on the ticket, so we need to change the | |
393 | * transaction ID so that the next transaction has a different TID in | |
394 | * the log. Just add one to the existing tid so that we can see chains | |
395 | * of rolling transactions in the log easily. | |
396 | */ | |
397 | tic->t_tid++; | |
398 | ||
399 | xlog_grant_push_ail(log, tic->t_unit_res); | |
400 | ||
401 | tic->t_curr_res = tic->t_unit_res; | |
402 | xlog_tic_reset_res(tic); | |
403 | ||
404 | if (tic->t_cnt > 0) | |
405 | return 0; | |
406 | ||
407 | trace_xfs_log_regrant(log, tic); | |
408 | ||
409 | error = xlog_grant_head_check(log, &log->l_write_head, tic, | |
410 | &need_bytes); | |
411 | if (error) | |
412 | goto out_error; | |
413 | ||
414 | xlog_grant_add_space(log, &log->l_write_head.grant, need_bytes); | |
415 | trace_xfs_log_regrant_exit(log, tic); | |
416 | xlog_verify_grant_tail(log); | |
417 | return 0; | |
418 | ||
419 | out_error: | |
420 | /* | |
421 | * If we are failing, make sure the ticket doesn't have any current | |
422 | * reservations. We don't want to add this back when the ticket/ | |
423 | * transaction gets cancelled. | |
424 | */ | |
425 | tic->t_curr_res = 0; | |
426 | tic->t_cnt = 0; /* ungrant will give back unit_res * t_cnt. */ | |
427 | return error; | |
428 | } | |
429 | ||
430 | /* | |
a0e336ba | 431 | * Reserve log space and return a ticket corresponding to the reservation. |
9006fb91 CH |
432 | * |
433 | * Each reservation is going to reserve extra space for a log record header. | |
434 | * When writes happen to the on-disk log, we don't subtract the length of the | |
435 | * log record header from any reservation. By wasting space in each | |
436 | * reservation, we prevent over allocation problems. | |
437 | */ | |
438 | int | |
439 | xfs_log_reserve( | |
440 | struct xfs_mount *mp, | |
441 | int unit_bytes, | |
442 | int cnt, | |
443 | struct xlog_ticket **ticp, | |
c8ce540d | 444 | uint8_t client, |
710b1e2c | 445 | bool permanent) |
9006fb91 | 446 | { |
ad223e60 | 447 | struct xlog *log = mp->m_log; |
9006fb91 CH |
448 | struct xlog_ticket *tic; |
449 | int need_bytes; | |
450 | int error = 0; | |
451 | ||
452 | ASSERT(client == XFS_TRANSACTION || client == XFS_LOG); | |
453 | ||
454 | if (XLOG_FORCED_SHUTDOWN(log)) | |
2451337d | 455 | return -EIO; |
9006fb91 | 456 | |
ff6d6af2 | 457 | XFS_STATS_INC(mp, xs_try_logspace); |
9006fb91 CH |
458 | |
459 | ASSERT(*ticp == NULL); | |
ca4f2589 | 460 | tic = xlog_ticket_alloc(log, unit_bytes, cnt, client, permanent); |
9006fb91 CH |
461 | *ticp = tic; |
462 | ||
437a255a DC |
463 | xlog_grant_push_ail(log, tic->t_cnt ? tic->t_unit_res * tic->t_cnt |
464 | : tic->t_unit_res); | |
9006fb91 CH |
465 | |
466 | trace_xfs_log_reserve(log, tic); | |
467 | ||
468 | error = xlog_grant_head_check(log, &log->l_reserve_head, tic, | |
469 | &need_bytes); | |
470 | if (error) | |
471 | goto out_error; | |
472 | ||
473 | xlog_grant_add_space(log, &log->l_reserve_head.grant, need_bytes); | |
474 | xlog_grant_add_space(log, &log->l_write_head.grant, need_bytes); | |
475 | trace_xfs_log_reserve_exit(log, tic); | |
476 | xlog_verify_grant_tail(log); | |
477 | return 0; | |
478 | ||
479 | out_error: | |
480 | /* | |
481 | * If we are failing, make sure the ticket doesn't have any current | |
482 | * reservations. We don't want to add this back when the ticket/ | |
483 | * transaction gets cancelled. | |
484 | */ | |
485 | tic->t_curr_res = 0; | |
486 | tic->t_cnt = 0; /* ungrant will give back unit_res * t_cnt. */ | |
487 | return error; | |
488 | } | |
489 | ||
df732b29 CH |
490 | /* |
491 | * Flush iclog to disk if this is the last reference to the given iclog and the | |
0dc8f7f1 DC |
492 | * it is in the WANT_SYNC state. If the caller passes in a non-zero |
493 | * @old_tail_lsn and the current log tail does not match, there may be metadata | |
494 | * on disk that must be persisted before this iclog is written. To satisfy that | |
495 | * requirement, set the XLOG_ICL_NEED_FLUSH flag as a condition for writing this | |
496 | * iclog with the new log tail value. | |
df732b29 | 497 | */ |
eef983ff | 498 | int |
df732b29 CH |
499 | xlog_state_release_iclog( |
500 | struct xlog *log, | |
0dc8f7f1 DC |
501 | struct xlog_in_core *iclog, |
502 | xfs_lsn_t old_tail_lsn) | |
df732b29 | 503 | { |
9d392064 | 504 | xfs_lsn_t tail_lsn; |
df732b29 CH |
505 | lockdep_assert_held(&log->l_icloglock); |
506 | ||
956f6daa | 507 | trace_xlog_iclog_release(iclog, _RET_IP_); |
1858bb0b | 508 | if (iclog->ic_state == XLOG_STATE_IOERROR) |
df732b29 CH |
509 | return -EIO; |
510 | ||
0dc8f7f1 DC |
511 | /* |
512 | * Grabbing the current log tail needs to be atomic w.r.t. the writing | |
513 | * of the tail LSN into the iclog so we guarantee that the log tail does | |
514 | * not move between deciding if a cache flush is required and writing | |
515 | * the LSN into the iclog below. | |
516 | */ | |
517 | if (old_tail_lsn || iclog->ic_state == XLOG_STATE_WANT_SYNC) { | |
518 | tail_lsn = xlog_assign_tail_lsn(log->l_mp); | |
519 | ||
520 | if (old_tail_lsn && tail_lsn != old_tail_lsn) | |
521 | iclog->ic_flags |= XLOG_ICL_NEED_FLUSH; | |
522 | } | |
523 | ||
9d392064 DC |
524 | if (!atomic_dec_and_test(&iclog->ic_refcnt)) |
525 | return 0; | |
526 | ||
527 | if (iclog->ic_state != XLOG_STATE_WANT_SYNC) { | |
528 | ASSERT(iclog->ic_state == XLOG_STATE_ACTIVE); | |
529 | return 0; | |
df732b29 CH |
530 | } |
531 | ||
9d392064 DC |
532 | iclog->ic_state = XLOG_STATE_SYNCING; |
533 | iclog->ic_header.h_tail_lsn = cpu_to_be64(tail_lsn); | |
534 | xlog_verify_tail_lsn(log, iclog, tail_lsn); | |
535 | trace_xlog_iclog_syncing(iclog, _RET_IP_); | |
536 | ||
537 | spin_unlock(&log->l_icloglock); | |
538 | xlog_sync(log, iclog); | |
539 | spin_lock(&log->l_icloglock); | |
df732b29 CH |
540 | return 0; |
541 | } | |
542 | ||
1da177e4 LT |
543 | /* |
544 | * Mount a log filesystem | |
545 | * | |
546 | * mp - ubiquitous xfs mount point structure | |
547 | * log_target - buftarg of on-disk log device | |
548 | * blk_offset - Start block # where block size is 512 bytes (BBSIZE) | |
549 | * num_bblocks - Number of BBSIZE blocks in on-disk log | |
550 | * | |
551 | * Return error or zero. | |
552 | */ | |
553 | int | |
249a8c11 DC |
554 | xfs_log_mount( |
555 | xfs_mount_t *mp, | |
556 | xfs_buftarg_t *log_target, | |
557 | xfs_daddr_t blk_offset, | |
558 | int num_bblks) | |
1da177e4 | 559 | { |
9c92ee20 | 560 | bool fatal = xfs_sb_version_hascrc(&mp->m_sb); |
3e7b91cf JL |
561 | int error = 0; |
562 | int min_logfsbs; | |
249a8c11 | 563 | |
c99d609a DC |
564 | if (!(mp->m_flags & XFS_MOUNT_NORECOVERY)) { |
565 | xfs_notice(mp, "Mounting V%d Filesystem", | |
566 | XFS_SB_VERSION_NUM(&mp->m_sb)); | |
567 | } else { | |
a0fa2b67 | 568 | xfs_notice(mp, |
c99d609a DC |
569 | "Mounting V%d filesystem in no-recovery mode. Filesystem will be inconsistent.", |
570 | XFS_SB_VERSION_NUM(&mp->m_sb)); | |
bd186aa9 | 571 | ASSERT(mp->m_flags & XFS_MOUNT_RDONLY); |
1da177e4 LT |
572 | } |
573 | ||
574 | mp->m_log = xlog_alloc_log(mp, log_target, blk_offset, num_bblks); | |
a6cb767e | 575 | if (IS_ERR(mp->m_log)) { |
2451337d | 576 | error = PTR_ERR(mp->m_log); |
644c3567 DC |
577 | goto out; |
578 | } | |
1da177e4 | 579 | |
3e7b91cf JL |
580 | /* |
581 | * Validate the given log space and drop a critical message via syslog | |
582 | * if the log size is too small that would lead to some unexpected | |
583 | * situations in transaction log space reservation stage. | |
584 | * | |
585 | * Note: we can't just reject the mount if the validation fails. This | |
586 | * would mean that people would have to downgrade their kernel just to | |
587 | * remedy the situation as there is no way to grow the log (short of | |
588 | * black magic surgery with xfs_db). | |
589 | * | |
590 | * We can, however, reject mounts for CRC format filesystems, as the | |
591 | * mkfs binary being used to make the filesystem should never create a | |
592 | * filesystem with a log that is too small. | |
593 | */ | |
594 | min_logfsbs = xfs_log_calc_minimum_size(mp); | |
595 | ||
596 | if (mp->m_sb.sb_logblocks < min_logfsbs) { | |
597 | xfs_warn(mp, | |
598 | "Log size %d blocks too small, minimum size is %d blocks", | |
599 | mp->m_sb.sb_logblocks, min_logfsbs); | |
2451337d | 600 | error = -EINVAL; |
3e7b91cf JL |
601 | } else if (mp->m_sb.sb_logblocks > XFS_MAX_LOG_BLOCKS) { |
602 | xfs_warn(mp, | |
603 | "Log size %d blocks too large, maximum size is %lld blocks", | |
604 | mp->m_sb.sb_logblocks, XFS_MAX_LOG_BLOCKS); | |
2451337d | 605 | error = -EINVAL; |
3e7b91cf JL |
606 | } else if (XFS_FSB_TO_B(mp, mp->m_sb.sb_logblocks) > XFS_MAX_LOG_BYTES) { |
607 | xfs_warn(mp, | |
608 | "log size %lld bytes too large, maximum size is %lld bytes", | |
609 | XFS_FSB_TO_B(mp, mp->m_sb.sb_logblocks), | |
610 | XFS_MAX_LOG_BYTES); | |
2451337d | 611 | error = -EINVAL; |
9c92ee20 DW |
612 | } else if (mp->m_sb.sb_logsunit > 1 && |
613 | mp->m_sb.sb_logsunit % mp->m_sb.sb_blocksize) { | |
614 | xfs_warn(mp, | |
615 | "log stripe unit %u bytes must be a multiple of block size", | |
616 | mp->m_sb.sb_logsunit); | |
617 | error = -EINVAL; | |
618 | fatal = true; | |
3e7b91cf JL |
619 | } |
620 | if (error) { | |
9c92ee20 DW |
621 | /* |
622 | * Log check errors are always fatal on v5; or whenever bad | |
623 | * metadata leads to a crash. | |
624 | */ | |
625 | if (fatal) { | |
3e7b91cf JL |
626 | xfs_crit(mp, "AAIEEE! Log failed size checks. Abort!"); |
627 | ASSERT(0); | |
628 | goto out_free_log; | |
629 | } | |
f41febd2 | 630 | xfs_crit(mp, "Log size out of supported range."); |
3e7b91cf | 631 | xfs_crit(mp, |
f41febd2 | 632 | "Continuing onwards, but if log hangs are experienced then please report this message in the bug report."); |
3e7b91cf JL |
633 | } |
634 | ||
249a8c11 DC |
635 | /* |
636 | * Initialize the AIL now we have a log. | |
637 | */ | |
249a8c11 DC |
638 | error = xfs_trans_ail_init(mp); |
639 | if (error) { | |
a0fa2b67 | 640 | xfs_warn(mp, "AIL initialisation failed: error %d", error); |
26430752 | 641 | goto out_free_log; |
249a8c11 | 642 | } |
a9c21c1b | 643 | mp->m_log->l_ailp = mp->m_ail; |
249a8c11 | 644 | |
1da177e4 LT |
645 | /* |
646 | * skip log recovery on a norecovery mount. pretend it all | |
647 | * just worked. | |
648 | */ | |
649 | if (!(mp->m_flags & XFS_MOUNT_NORECOVERY)) { | |
249a8c11 | 650 | int readonly = (mp->m_flags & XFS_MOUNT_RDONLY); |
1da177e4 LT |
651 | |
652 | if (readonly) | |
bd186aa9 | 653 | mp->m_flags &= ~XFS_MOUNT_RDONLY; |
1da177e4 | 654 | |
65be6054 | 655 | error = xlog_recover(mp->m_log); |
1da177e4 LT |
656 | |
657 | if (readonly) | |
bd186aa9 | 658 | mp->m_flags |= XFS_MOUNT_RDONLY; |
1da177e4 | 659 | if (error) { |
a0fa2b67 DC |
660 | xfs_warn(mp, "log mount/recovery failed: error %d", |
661 | error); | |
f0b2efad | 662 | xlog_recover_cancel(mp->m_log); |
26430752 | 663 | goto out_destroy_ail; |
1da177e4 LT |
664 | } |
665 | } | |
666 | ||
baff4e44 BF |
667 | error = xfs_sysfs_init(&mp->m_log->l_kobj, &xfs_log_ktype, &mp->m_kobj, |
668 | "log"); | |
669 | if (error) | |
670 | goto out_destroy_ail; | |
671 | ||
1da177e4 LT |
672 | /* Normal transactions can now occur */ |
673 | mp->m_log->l_flags &= ~XLOG_ACTIVE_RECOVERY; | |
674 | ||
71e330b5 DC |
675 | /* |
676 | * Now the log has been fully initialised and we know were our | |
677 | * space grant counters are, we can initialise the permanent ticket | |
678 | * needed for delayed logging to work. | |
679 | */ | |
680 | xlog_cil_init_post_recovery(mp->m_log); | |
681 | ||
1da177e4 | 682 | return 0; |
26430752 CH |
683 | |
684 | out_destroy_ail: | |
685 | xfs_trans_ail_destroy(mp); | |
686 | out_free_log: | |
687 | xlog_dealloc_log(mp->m_log); | |
644c3567 | 688 | out: |
249a8c11 | 689 | return error; |
26430752 | 690 | } |
1da177e4 LT |
691 | |
692 | /* | |
f661f1e0 DC |
693 | * Finish the recovery of the file system. This is separate from the |
694 | * xfs_log_mount() call, because it depends on the code in xfs_mountfs() to read | |
695 | * in the root and real-time bitmap inodes between calling xfs_log_mount() and | |
696 | * here. | |
1da177e4 | 697 | * |
f661f1e0 DC |
698 | * If we finish recovery successfully, start the background log work. If we are |
699 | * not doing recovery, then we have a RO filesystem and we don't need to start | |
700 | * it. | |
1da177e4 LT |
701 | */ |
702 | int | |
f0b2efad BF |
703 | xfs_log_mount_finish( |
704 | struct xfs_mount *mp) | |
1da177e4 | 705 | { |
f661f1e0 | 706 | int error = 0; |
6f4a1eef | 707 | bool readonly = (mp->m_flags & XFS_MOUNT_RDONLY); |
f1b92bbc | 708 | bool recovered = mp->m_log->l_flags & XLOG_RECOVERY_NEEDED; |
1da177e4 | 709 | |
f0b2efad | 710 | if (mp->m_flags & XFS_MOUNT_NORECOVERY) { |
bd186aa9 | 711 | ASSERT(mp->m_flags & XFS_MOUNT_RDONLY); |
f0b2efad | 712 | return 0; |
6f4a1eef ES |
713 | } else if (readonly) { |
714 | /* Allow unlinked processing to proceed */ | |
715 | mp->m_flags &= ~XFS_MOUNT_RDONLY; | |
1da177e4 LT |
716 | } |
717 | ||
8204f8dd DW |
718 | /* |
719 | * During the second phase of log recovery, we need iget and | |
720 | * iput to behave like they do for an active filesystem. | |
721 | * xfs_fs_drop_inode needs to be able to prevent the deletion | |
722 | * of inodes before we're done replaying log items on those | |
723 | * inodes. Turn it off immediately after recovery finishes | |
724 | * so that we don't leak the quota inodes if subsequent mount | |
725 | * activities fail. | |
799ea9e9 DW |
726 | * |
727 | * We let all inodes involved in redo item processing end up on | |
728 | * the LRU instead of being evicted immediately so that if we do | |
729 | * something to an unlinked inode, the irele won't cause | |
730 | * premature truncation and freeing of the inode, which results | |
731 | * in log recovery failure. We have to evict the unreferenced | |
1751e8a6 | 732 | * lru inodes after clearing SB_ACTIVE because we don't |
799ea9e9 DW |
733 | * otherwise clean up the lru if there's a subsequent failure in |
734 | * xfs_mountfs, which leads to us leaking the inodes if nothing | |
735 | * else (e.g. quotacheck) references the inodes before the | |
736 | * mount failure occurs. | |
8204f8dd | 737 | */ |
1751e8a6 | 738 | mp->m_super->s_flags |= SB_ACTIVE; |
f0b2efad BF |
739 | error = xlog_recover_finish(mp->m_log); |
740 | if (!error) | |
741 | xfs_log_work_queue(mp); | |
1751e8a6 | 742 | mp->m_super->s_flags &= ~SB_ACTIVE; |
799ea9e9 | 743 | evict_inodes(mp->m_super); |
f0b2efad | 744 | |
f1b92bbc BF |
745 | /* |
746 | * Drain the buffer LRU after log recovery. This is required for v4 | |
747 | * filesystems to avoid leaving around buffers with NULL verifier ops, | |
748 | * but we do it unconditionally to make sure we're always in a clean | |
749 | * cache state after mount. | |
750 | * | |
751 | * Don't push in the error case because the AIL may have pending intents | |
752 | * that aren't removed until recovery is cancelled. | |
753 | */ | |
754 | if (!error && recovered) { | |
755 | xfs_log_force(mp, XFS_LOG_SYNC); | |
756 | xfs_ail_push_all_sync(mp->m_ail); | |
757 | } | |
10fb9ac1 | 758 | xfs_buftarg_drain(mp->m_ddev_targp); |
f1b92bbc | 759 | |
6f4a1eef ES |
760 | if (readonly) |
761 | mp->m_flags |= XFS_MOUNT_RDONLY; | |
762 | ||
4e6b8270 DW |
763 | /* Make sure the log is dead if we're returning failure. */ |
764 | ASSERT(!error || (mp->m_log->l_flags & XLOG_IO_ERROR)); | |
765 | ||
f0b2efad BF |
766 | return error; |
767 | } | |
768 | ||
769 | /* | |
770 | * The mount has failed. Cancel the recovery if it hasn't completed and destroy | |
771 | * the log. | |
772 | */ | |
a7a9250e | 773 | void |
f0b2efad BF |
774 | xfs_log_mount_cancel( |
775 | struct xfs_mount *mp) | |
776 | { | |
a7a9250e | 777 | xlog_recover_cancel(mp->m_log); |
f0b2efad | 778 | xfs_log_unmount(mp); |
1da177e4 LT |
779 | } |
780 | ||
45eddb41 DC |
781 | /* |
782 | * Flush out the iclog to disk ensuring that device caches are flushed and | |
783 | * the iclog hits stable storage before any completion waiters are woken. | |
784 | */ | |
785 | static inline int | |
786 | xlog_force_iclog( | |
787 | struct xlog_in_core *iclog) | |
788 | { | |
789 | atomic_inc(&iclog->ic_refcnt); | |
2bf1ec0f | 790 | iclog->ic_flags |= XLOG_ICL_NEED_FLUSH | XLOG_ICL_NEED_FUA; |
45eddb41 DC |
791 | if (iclog->ic_state == XLOG_STATE_ACTIVE) |
792 | xlog_state_switch_iclogs(iclog->ic_log, iclog, 0); | |
793 | return xlog_state_release_iclog(iclog->ic_log, iclog, 0); | |
794 | } | |
795 | ||
81e5b50a | 796 | /* |
a79b28c2 DC |
797 | * Wait for the iclog and all prior iclogs to be written disk as required by the |
798 | * log force state machine. Waiting on ic_force_wait ensures iclog completions | |
799 | * have been ordered and callbacks run before we are woken here, hence | |
800 | * guaranteeing that all the iclogs up to this one are on stable storage. | |
81e5b50a | 801 | */ |
a79b28c2 | 802 | int |
81e5b50a CH |
803 | xlog_wait_on_iclog( |
804 | struct xlog_in_core *iclog) | |
805 | __releases(iclog->ic_log->l_icloglock) | |
806 | { | |
807 | struct xlog *log = iclog->ic_log; | |
808 | ||
956f6daa | 809 | trace_xlog_iclog_wait_on(iclog, _RET_IP_); |
81e5b50a CH |
810 | if (!XLOG_FORCED_SHUTDOWN(log) && |
811 | iclog->ic_state != XLOG_STATE_ACTIVE && | |
812 | iclog->ic_state != XLOG_STATE_DIRTY) { | |
813 | XFS_STATS_INC(log->l_mp, xs_log_force_sleep); | |
814 | xlog_wait(&iclog->ic_force_wait, &log->l_icloglock); | |
815 | } else { | |
816 | spin_unlock(&log->l_icloglock); | |
817 | } | |
818 | ||
819 | if (XLOG_FORCED_SHUTDOWN(log)) | |
820 | return -EIO; | |
821 | return 0; | |
822 | } | |
823 | ||
1da177e4 | 824 | /* |
3c702f95 DC |
825 | * Write out an unmount record using the ticket provided. We have to account for |
826 | * the data space used in the unmount ticket as this write is not done from a | |
827 | * transaction context that has already done the accounting for us. | |
1da177e4 | 828 | */ |
3c702f95 DC |
829 | static int |
830 | xlog_write_unmount_record( | |
831 | struct xlog *log, | |
3468bb1c | 832 | struct xlog_ticket *ticket) |
53235f22 | 833 | { |
3c702f95 | 834 | struct xfs_unmount_log_format ulf = { |
53235f22 DW |
835 | .magic = XLOG_UNMOUNT_TYPE, |
836 | }; | |
837 | struct xfs_log_iovec reg = { | |
3c702f95 DC |
838 | .i_addr = &ulf, |
839 | .i_len = sizeof(ulf), | |
53235f22 DW |
840 | .i_type = XLOG_REG_TYPE_UNMOUNT, |
841 | }; | |
842 | struct xfs_log_vec vec = { | |
843 | .lv_niovecs = 1, | |
844 | .lv_iovecp = ®, | |
845 | }; | |
3c702f95 DC |
846 | |
847 | /* account for space used by record data */ | |
848 | ticket->t_curr_res -= sizeof(ulf); | |
eef983ff | 849 | |
3468bb1c | 850 | return xlog_write(log, &vec, ticket, NULL, NULL, XLOG_UNMOUNT_TRANS); |
3c702f95 DC |
851 | } |
852 | ||
853 | /* | |
854 | * Mark the filesystem clean by writing an unmount record to the head of the | |
855 | * log. | |
856 | */ | |
857 | static void | |
858 | xlog_unmount_write( | |
859 | struct xlog *log) | |
860 | { | |
861 | struct xfs_mount *mp = log->l_mp; | |
53235f22 DW |
862 | struct xlog_in_core *iclog; |
863 | struct xlog_ticket *tic = NULL; | |
53235f22 DW |
864 | int error; |
865 | ||
866 | error = xfs_log_reserve(mp, 600, 1, &tic, XFS_LOG, 0); | |
867 | if (error) | |
868 | goto out_err; | |
869 | ||
3468bb1c | 870 | error = xlog_write_unmount_record(log, tic); |
53235f22 DW |
871 | /* |
872 | * At this point, we're umounting anyway, so there's no point in | |
873 | * transitioning log state to IOERROR. Just continue... | |
874 | */ | |
875 | out_err: | |
876 | if (error) | |
877 | xfs_alert(mp, "%s: unmount record failed", __func__); | |
878 | ||
879 | spin_lock(&log->l_icloglock); | |
880 | iclog = log->l_iclog; | |
45eddb41 | 881 | error = xlog_force_iclog(iclog); |
81e5b50a | 882 | xlog_wait_on_iclog(iclog); |
53235f22 DW |
883 | |
884 | if (tic) { | |
885 | trace_xfs_log_umount_write(log, tic); | |
8b41e3f9 | 886 | xfs_log_ticket_ungrant(log, tic); |
53235f22 DW |
887 | } |
888 | } | |
889 | ||
13859c98 CH |
890 | static void |
891 | xfs_log_unmount_verify_iclog( | |
892 | struct xlog *log) | |
893 | { | |
894 | struct xlog_in_core *iclog = log->l_iclog; | |
895 | ||
896 | do { | |
897 | ASSERT(iclog->ic_state == XLOG_STATE_ACTIVE); | |
898 | ASSERT(iclog->ic_offset == 0); | |
899 | } while ((iclog = iclog->ic_next) != log->l_iclog); | |
900 | } | |
901 | ||
1da177e4 LT |
902 | /* |
903 | * Unmount record used to have a string "Unmount filesystem--" in the | |
904 | * data section where the "Un" was really a magic number (XLOG_UNMOUNT_TYPE). | |
905 | * We just write the magic number now since that particular field isn't | |
8e159e72 | 906 | * currently architecture converted and "Unmount" is a bit foo. |
1da177e4 LT |
907 | * As far as I know, there weren't any dependencies on the old behaviour. |
908 | */ | |
550319e9 | 909 | static void |
13859c98 CH |
910 | xfs_log_unmount_write( |
911 | struct xfs_mount *mp) | |
1da177e4 | 912 | { |
13859c98 | 913 | struct xlog *log = mp->m_log; |
1da177e4 | 914 | |
50d25484 | 915 | if (!xfs_log_writable(mp)) |
550319e9 | 916 | return; |
1da177e4 | 917 | |
550319e9 | 918 | xfs_log_force(mp, XFS_LOG_SYNC); |
1da177e4 | 919 | |
6178d104 CH |
920 | if (XLOG_FORCED_SHUTDOWN(log)) |
921 | return; | |
5cc3c006 DW |
922 | |
923 | /* | |
924 | * If we think the summary counters are bad, avoid writing the unmount | |
925 | * record to force log recovery at next mount, after which the summary | |
926 | * counters will be recalculated. Refer to xlog_check_unmount_rec for | |
927 | * more details. | |
928 | */ | |
929 | if (XFS_TEST_ERROR(xfs_fs_has_sickness(mp, XFS_SICK_FS_COUNTERS), mp, | |
930 | XFS_ERRTAG_FORCE_SUMMARY_RECALC)) { | |
931 | xfs_alert(mp, "%s: will fix summary counters at next mount", | |
932 | __func__); | |
933 | return; | |
934 | } | |
935 | ||
13859c98 | 936 | xfs_log_unmount_verify_iclog(log); |
3c702f95 | 937 | xlog_unmount_write(log); |
550319e9 | 938 | } |
1da177e4 LT |
939 | |
940 | /* | |
c75921a7 | 941 | * Empty the log for unmount/freeze. |
cf2931db DC |
942 | * |
943 | * To do this, we first need to shut down the background log work so it is not | |
944 | * trying to cover the log as we clean up. We then need to unpin all objects in | |
945 | * the log so we can then flush them out. Once they have completed their IO and | |
303591a0 | 946 | * run the callbacks removing themselves from the AIL, we can cover the log. |
1da177e4 | 947 | */ |
303591a0 | 948 | int |
c75921a7 DC |
949 | xfs_log_quiesce( |
950 | struct xfs_mount *mp) | |
1da177e4 | 951 | { |
f661f1e0 | 952 | cancel_delayed_work_sync(&mp->m_log->l_work); |
cf2931db DC |
953 | xfs_log_force(mp, XFS_LOG_SYNC); |
954 | ||
955 | /* | |
956 | * The superblock buffer is uncached and while xfs_ail_push_all_sync() | |
8321ddb2 | 957 | * will push it, xfs_buftarg_wait() will not wait for it. Further, |
cf2931db DC |
958 | * xfs_buf_iowait() cannot be used because it was pushed with the |
959 | * XBF_ASYNC flag set, so we need to use a lock/unlock pair to wait for | |
960 | * the IO to complete. | |
961 | */ | |
962 | xfs_ail_push_all_sync(mp->m_ail); | |
8321ddb2 | 963 | xfs_buftarg_wait(mp->m_ddev_targp); |
cf2931db DC |
964 | xfs_buf_lock(mp->m_sb_bp); |
965 | xfs_buf_unlock(mp->m_sb_bp); | |
303591a0 BF |
966 | |
967 | return xfs_log_cover(mp); | |
9e54ee0f | 968 | } |
cf2931db | 969 | |
9e54ee0f BF |
970 | void |
971 | xfs_log_clean( | |
972 | struct xfs_mount *mp) | |
973 | { | |
974 | xfs_log_quiesce(mp); | |
cf2931db | 975 | xfs_log_unmount_write(mp); |
c75921a7 DC |
976 | } |
977 | ||
978 | /* | |
979 | * Shut down and release the AIL and Log. | |
980 | * | |
981 | * During unmount, we need to ensure we flush all the dirty metadata objects | |
982 | * from the AIL so that the log is empty before we write the unmount record to | |
983 | * the log. Once this is done, we can tear down the AIL and the log. | |
984 | */ | |
985 | void | |
986 | xfs_log_unmount( | |
987 | struct xfs_mount *mp) | |
988 | { | |
9e54ee0f | 989 | xfs_log_clean(mp); |
cf2931db | 990 | |
8321ddb2 BF |
991 | xfs_buftarg_drain(mp->m_ddev_targp); |
992 | ||
249a8c11 | 993 | xfs_trans_ail_destroy(mp); |
baff4e44 BF |
994 | |
995 | xfs_sysfs_del(&mp->m_log->l_kobj); | |
996 | ||
c41564b5 | 997 | xlog_dealloc_log(mp->m_log); |
1da177e4 LT |
998 | } |
999 | ||
43f5efc5 DC |
1000 | void |
1001 | xfs_log_item_init( | |
1002 | struct xfs_mount *mp, | |
1003 | struct xfs_log_item *item, | |
1004 | int type, | |
272e42b2 | 1005 | const struct xfs_item_ops *ops) |
43f5efc5 DC |
1006 | { |
1007 | item->li_mountp = mp; | |
1008 | item->li_ailp = mp->m_ail; | |
1009 | item->li_type = type; | |
1010 | item->li_ops = ops; | |
71e330b5 DC |
1011 | item->li_lv = NULL; |
1012 | ||
1013 | INIT_LIST_HEAD(&item->li_ail); | |
1014 | INIT_LIST_HEAD(&item->li_cil); | |
643c8c05 | 1015 | INIT_LIST_HEAD(&item->li_bio_list); |
e6631f85 | 1016 | INIT_LIST_HEAD(&item->li_trans); |
43f5efc5 DC |
1017 | } |
1018 | ||
09a423a3 CH |
1019 | /* |
1020 | * Wake up processes waiting for log space after we have moved the log tail. | |
09a423a3 | 1021 | */ |
1da177e4 | 1022 | void |
09a423a3 | 1023 | xfs_log_space_wake( |
cfb7cdca | 1024 | struct xfs_mount *mp) |
1da177e4 | 1025 | { |
ad223e60 | 1026 | struct xlog *log = mp->m_log; |
cfb7cdca | 1027 | int free_bytes; |
1da177e4 | 1028 | |
1da177e4 LT |
1029 | if (XLOG_FORCED_SHUTDOWN(log)) |
1030 | return; | |
1da177e4 | 1031 | |
28496968 | 1032 | if (!list_empty_careful(&log->l_write_head.waiters)) { |
09a423a3 CH |
1033 | ASSERT(!(log->l_flags & XLOG_ACTIVE_RECOVERY)); |
1034 | ||
28496968 CH |
1035 | spin_lock(&log->l_write_head.lock); |
1036 | free_bytes = xlog_space_left(log, &log->l_write_head.grant); | |
e179840d | 1037 | xlog_grant_head_wake(log, &log->l_write_head, &free_bytes); |
28496968 | 1038 | spin_unlock(&log->l_write_head.lock); |
1da177e4 | 1039 | } |
10547941 | 1040 | |
28496968 | 1041 | if (!list_empty_careful(&log->l_reserve_head.waiters)) { |
09a423a3 CH |
1042 | ASSERT(!(log->l_flags & XLOG_ACTIVE_RECOVERY)); |
1043 | ||
28496968 CH |
1044 | spin_lock(&log->l_reserve_head.lock); |
1045 | free_bytes = xlog_space_left(log, &log->l_reserve_head.grant); | |
e179840d | 1046 | xlog_grant_head_wake(log, &log->l_reserve_head, &free_bytes); |
28496968 | 1047 | spin_unlock(&log->l_reserve_head.lock); |
1da177e4 | 1048 | } |
3f16b985 | 1049 | } |
1da177e4 LT |
1050 | |
1051 | /* | |
2c6e24ce DC |
1052 | * Determine if we have a transaction that has gone to disk that needs to be |
1053 | * covered. To begin the transition to the idle state firstly the log needs to | |
1054 | * be idle. That means the CIL, the AIL and the iclogs needs to be empty before | |
1055 | * we start attempting to cover the log. | |
b6f8dd49 | 1056 | * |
2c6e24ce DC |
1057 | * Only if we are then in a state where covering is needed, the caller is |
1058 | * informed that dummy transactions are required to move the log into the idle | |
1059 | * state. | |
1060 | * | |
1061 | * If there are any items in the AIl or CIL, then we do not want to attempt to | |
1062 | * cover the log as we may be in a situation where there isn't log space | |
1063 | * available to run a dummy transaction and this can lead to deadlocks when the | |
1064 | * tail of the log is pinned by an item that is modified in the CIL. Hence | |
1065 | * there's no point in running a dummy transaction at this point because we | |
1066 | * can't start trying to idle the log until both the CIL and AIL are empty. | |
1da177e4 | 1067 | */ |
37444fc4 BF |
1068 | static bool |
1069 | xfs_log_need_covered( | |
1070 | struct xfs_mount *mp) | |
1da177e4 | 1071 | { |
37444fc4 BF |
1072 | struct xlog *log = mp->m_log; |
1073 | bool needed = false; | |
1da177e4 | 1074 | |
2c6e24ce | 1075 | if (!xlog_cil_empty(log)) |
8646b982 | 1076 | return false; |
2c6e24ce | 1077 | |
b22cd72c | 1078 | spin_lock(&log->l_icloglock); |
b6f8dd49 DC |
1079 | switch (log->l_covered_state) { |
1080 | case XLOG_STATE_COVER_DONE: | |
1081 | case XLOG_STATE_COVER_DONE2: | |
1082 | case XLOG_STATE_COVER_IDLE: | |
1083 | break; | |
1084 | case XLOG_STATE_COVER_NEED: | |
1085 | case XLOG_STATE_COVER_NEED2: | |
2c6e24ce DC |
1086 | if (xfs_ail_min_lsn(log->l_ailp)) |
1087 | break; | |
1088 | if (!xlog_iclogs_empty(log)) | |
1089 | break; | |
1090 | ||
37444fc4 | 1091 | needed = true; |
2c6e24ce DC |
1092 | if (log->l_covered_state == XLOG_STATE_COVER_NEED) |
1093 | log->l_covered_state = XLOG_STATE_COVER_DONE; | |
1094 | else | |
1095 | log->l_covered_state = XLOG_STATE_COVER_DONE2; | |
1096 | break; | |
b6f8dd49 | 1097 | default: |
37444fc4 | 1098 | needed = true; |
b6f8dd49 | 1099 | break; |
1da177e4 | 1100 | } |
b22cd72c | 1101 | spin_unlock(&log->l_icloglock); |
014c2544 | 1102 | return needed; |
1da177e4 LT |
1103 | } |
1104 | ||
303591a0 BF |
1105 | /* |
1106 | * Explicitly cover the log. This is similar to background log covering but | |
1107 | * intended for usage in quiesce codepaths. The caller is responsible to ensure | |
1108 | * the log is idle and suitable for covering. The CIL, iclog buffers and AIL | |
1109 | * must all be empty. | |
1110 | */ | |
1111 | static int | |
1112 | xfs_log_cover( | |
1113 | struct xfs_mount *mp) | |
1114 | { | |
303591a0 | 1115 | int error = 0; |
f46e5a17 | 1116 | bool need_covered; |
303591a0 | 1117 | |
4533fc63 BF |
1118 | ASSERT((xlog_cil_empty(mp->m_log) && xlog_iclogs_empty(mp->m_log) && |
1119 | !xfs_ail_min_lsn(mp->m_log->l_ailp)) || | |
303591a0 BF |
1120 | XFS_FORCED_SHUTDOWN(mp)); |
1121 | ||
1122 | if (!xfs_log_writable(mp)) | |
1123 | return 0; | |
1124 | ||
f46e5a17 BF |
1125 | /* |
1126 | * xfs_log_need_covered() is not idempotent because it progresses the | |
1127 | * state machine if the log requires covering. Therefore, we must call | |
1128 | * this function once and use the result until we've issued an sb sync. | |
1129 | * Do so first to make that abundantly clear. | |
1130 | * | |
1131 | * Fall into the covering sequence if the log needs covering or the | |
1132 | * mount has lazy superblock accounting to sync to disk. The sb sync | |
1133 | * used for covering accumulates the in-core counters, so covering | |
1134 | * handles this for us. | |
1135 | */ | |
1136 | need_covered = xfs_log_need_covered(mp); | |
1137 | if (!need_covered && !xfs_sb_version_haslazysbcount(&mp->m_sb)) | |
1138 | return 0; | |
1139 | ||
303591a0 BF |
1140 | /* |
1141 | * To cover the log, commit the superblock twice (at most) in | |
1142 | * independent checkpoints. The first serves as a reference for the | |
1143 | * tail pointer. The sync transaction and AIL push empties the AIL and | |
1144 | * updates the in-core tail to the LSN of the first checkpoint. The | |
1145 | * second commit updates the on-disk tail with the in-core LSN, | |
1146 | * covering the log. Push the AIL one more time to leave it empty, as | |
1147 | * we found it. | |
1148 | */ | |
f46e5a17 | 1149 | do { |
303591a0 BF |
1150 | error = xfs_sync_sb(mp, true); |
1151 | if (error) | |
1152 | break; | |
1153 | xfs_ail_push_all_sync(mp->m_ail); | |
f46e5a17 | 1154 | } while (xfs_log_need_covered(mp)); |
303591a0 BF |
1155 | |
1156 | return error; | |
1157 | } | |
1158 | ||
09a423a3 | 1159 | /* |
1da177e4 LT |
1160 | * We may be holding the log iclog lock upon entering this routine. |
1161 | */ | |
1162 | xfs_lsn_t | |
1c304625 | 1163 | xlog_assign_tail_lsn_locked( |
1c3cb9ec | 1164 | struct xfs_mount *mp) |
1da177e4 | 1165 | { |
ad223e60 | 1166 | struct xlog *log = mp->m_log; |
1c304625 CH |
1167 | struct xfs_log_item *lip; |
1168 | xfs_lsn_t tail_lsn; | |
1169 | ||
57e80956 | 1170 | assert_spin_locked(&mp->m_ail->ail_lock); |
1da177e4 | 1171 | |
09a423a3 CH |
1172 | /* |
1173 | * To make sure we always have a valid LSN for the log tail we keep | |
1174 | * track of the last LSN which was committed in log->l_last_sync_lsn, | |
1c304625 | 1175 | * and use that when the AIL was empty. |
09a423a3 | 1176 | */ |
1c304625 CH |
1177 | lip = xfs_ail_min(mp->m_ail); |
1178 | if (lip) | |
1179 | tail_lsn = lip->li_lsn; | |
1180 | else | |
84f3c683 | 1181 | tail_lsn = atomic64_read(&log->l_last_sync_lsn); |
750b9c90 | 1182 | trace_xfs_log_assign_tail_lsn(log, tail_lsn); |
1c3cb9ec | 1183 | atomic64_set(&log->l_tail_lsn, tail_lsn); |
1da177e4 | 1184 | return tail_lsn; |
1c3cb9ec | 1185 | } |
1da177e4 | 1186 | |
1c304625 CH |
1187 | xfs_lsn_t |
1188 | xlog_assign_tail_lsn( | |
1189 | struct xfs_mount *mp) | |
1190 | { | |
1191 | xfs_lsn_t tail_lsn; | |
1192 | ||
57e80956 | 1193 | spin_lock(&mp->m_ail->ail_lock); |
1c304625 | 1194 | tail_lsn = xlog_assign_tail_lsn_locked(mp); |
57e80956 | 1195 | spin_unlock(&mp->m_ail->ail_lock); |
1c304625 CH |
1196 | |
1197 | return tail_lsn; | |
1198 | } | |
1199 | ||
1da177e4 LT |
1200 | /* |
1201 | * Return the space in the log between the tail and the head. The head | |
1202 | * is passed in the cycle/bytes formal parms. In the special case where | |
1203 | * the reserve head has wrapped passed the tail, this calculation is no | |
1204 | * longer valid. In this case, just return 0 which means there is no space | |
1205 | * in the log. This works for all places where this function is called | |
1206 | * with the reserve head. Of course, if the write head were to ever | |
1207 | * wrap the tail, we should blow up. Rather than catch this case here, | |
1208 | * we depend on other ASSERTions in other parts of the code. XXXmiken | |
1209 | * | |
1210 | * This code also handles the case where the reservation head is behind | |
1211 | * the tail. The details of this case are described below, but the end | |
1212 | * result is that we return the size of the log as the amount of space left. | |
1213 | */ | |
a8272ce0 | 1214 | STATIC int |
a69ed03c | 1215 | xlog_space_left( |
ad223e60 | 1216 | struct xlog *log, |
c8a09ff8 | 1217 | atomic64_t *head) |
1da177e4 | 1218 | { |
a69ed03c DC |
1219 | int free_bytes; |
1220 | int tail_bytes; | |
1221 | int tail_cycle; | |
1222 | int head_cycle; | |
1223 | int head_bytes; | |
1da177e4 | 1224 | |
a69ed03c | 1225 | xlog_crack_grant_head(head, &head_cycle, &head_bytes); |
1c3cb9ec DC |
1226 | xlog_crack_atomic_lsn(&log->l_tail_lsn, &tail_cycle, &tail_bytes); |
1227 | tail_bytes = BBTOB(tail_bytes); | |
a69ed03c DC |
1228 | if (tail_cycle == head_cycle && head_bytes >= tail_bytes) |
1229 | free_bytes = log->l_logsize - (head_bytes - tail_bytes); | |
1230 | else if (tail_cycle + 1 < head_cycle) | |
1da177e4 | 1231 | return 0; |
a69ed03c DC |
1232 | else if (tail_cycle < head_cycle) { |
1233 | ASSERT(tail_cycle == (head_cycle - 1)); | |
1234 | free_bytes = tail_bytes - head_bytes; | |
1da177e4 LT |
1235 | } else { |
1236 | /* | |
1237 | * The reservation head is behind the tail. | |
1238 | * In this case we just want to return the size of the | |
1239 | * log as the amount of space left. | |
1240 | */ | |
f41febd2 | 1241 | xfs_alert(log->l_mp, "xlog_space_left: head behind tail"); |
a0fa2b67 | 1242 | xfs_alert(log->l_mp, |
f41febd2 JP |
1243 | " tail_cycle = %d, tail_bytes = %d", |
1244 | tail_cycle, tail_bytes); | |
1245 | xfs_alert(log->l_mp, | |
1246 | " GH cycle = %d, GH bytes = %d", | |
1247 | head_cycle, head_bytes); | |
1da177e4 LT |
1248 | ASSERT(0); |
1249 | free_bytes = log->l_logsize; | |
1250 | } | |
1251 | return free_bytes; | |
a69ed03c | 1252 | } |
1da177e4 LT |
1253 | |
1254 | ||
0d5a75e9 | 1255 | static void |
79b54d9b CH |
1256 | xlog_ioend_work( |
1257 | struct work_struct *work) | |
1da177e4 | 1258 | { |
79b54d9b CH |
1259 | struct xlog_in_core *iclog = |
1260 | container_of(work, struct xlog_in_core, ic_end_io_work); | |
1261 | struct xlog *log = iclog->ic_log; | |
79b54d9b | 1262 | int error; |
1da177e4 | 1263 | |
79b54d9b | 1264 | error = blk_status_to_errno(iclog->ic_bio.bi_status); |
366fc4b8 CH |
1265 | #ifdef DEBUG |
1266 | /* treat writes with injected CRC errors as failed */ | |
1267 | if (iclog->ic_fail_crc) | |
79b54d9b | 1268 | error = -EIO; |
366fc4b8 CH |
1269 | #endif |
1270 | ||
1da177e4 | 1271 | /* |
366fc4b8 | 1272 | * Race to shutdown the filesystem if we see an error. |
1da177e4 | 1273 | */ |
79b54d9b CH |
1274 | if (XFS_TEST_ERROR(error, log->l_mp, XFS_ERRTAG_IODONE_IOERR)) { |
1275 | xfs_alert(log->l_mp, "log I/O error %d", error); | |
1276 | xfs_force_shutdown(log->l_mp, SHUTDOWN_LOG_IO_ERROR); | |
1da177e4 | 1277 | } |
3db296f3 | 1278 | |
12e6a0f4 | 1279 | xlog_state_done_syncing(iclog); |
79b54d9b | 1280 | bio_uninit(&iclog->ic_bio); |
9c23eccc | 1281 | |
3db296f3 | 1282 | /* |
79b54d9b CH |
1283 | * Drop the lock to signal that we are done. Nothing references the |
1284 | * iclog after this, so an unmount waiting on this lock can now tear it | |
1285 | * down safely. As such, it is unsafe to reference the iclog after the | |
1286 | * unlock as we could race with it being freed. | |
3db296f3 | 1287 | */ |
79b54d9b | 1288 | up(&iclog->ic_sema); |
c3f8fc73 | 1289 | } |
1da177e4 | 1290 | |
1da177e4 LT |
1291 | /* |
1292 | * Return size of each in-core log record buffer. | |
1293 | * | |
9da096fd | 1294 | * All machines get 8 x 32kB buffers by default, unless tuned otherwise. |
1da177e4 LT |
1295 | * |
1296 | * If the filesystem blocksize is too large, we may need to choose a | |
1297 | * larger size since the directory code currently logs entire blocks. | |
1298 | */ | |
1da177e4 | 1299 | STATIC void |
9a8d2fdb MT |
1300 | xlog_get_iclog_buffer_size( |
1301 | struct xfs_mount *mp, | |
1302 | struct xlog *log) | |
1da177e4 | 1303 | { |
1cb51258 | 1304 | if (mp->m_logbufs <= 0) |
4f62282a CH |
1305 | mp->m_logbufs = XLOG_MAX_ICLOGS; |
1306 | if (mp->m_logbsize <= 0) | |
1307 | mp->m_logbsize = XLOG_BIG_RECORD_BSIZE; | |
1308 | ||
1309 | log->l_iclog_bufs = mp->m_logbufs; | |
1310 | log->l_iclog_size = mp->m_logbsize; | |
1da177e4 LT |
1311 | |
1312 | /* | |
4f62282a | 1313 | * # headers = size / 32k - one header holds cycles from 32k of data. |
1da177e4 | 1314 | */ |
4f62282a CH |
1315 | log->l_iclog_heads = |
1316 | DIV_ROUND_UP(mp->m_logbsize, XLOG_HEADER_CYCLE_SIZE); | |
1317 | log->l_iclog_hsize = log->l_iclog_heads << BBSHIFT; | |
1318 | } | |
1da177e4 | 1319 | |
f661f1e0 DC |
1320 | void |
1321 | xfs_log_work_queue( | |
1322 | struct xfs_mount *mp) | |
1323 | { | |
696a5620 | 1324 | queue_delayed_work(mp->m_sync_workqueue, &mp->m_log->l_work, |
f661f1e0 DC |
1325 | msecs_to_jiffies(xfs_syncd_centisecs * 10)); |
1326 | } | |
1327 | ||
1328 | /* | |
1329 | * Every sync period we need to unpin all items in the AIL and push them to | |
1330 | * disk. If there is nothing dirty, then we might need to cover the log to | |
1331 | * indicate that the filesystem is idle. | |
1332 | */ | |
0d5a75e9 | 1333 | static void |
f661f1e0 DC |
1334 | xfs_log_worker( |
1335 | struct work_struct *work) | |
1336 | { | |
1337 | struct xlog *log = container_of(to_delayed_work(work), | |
1338 | struct xlog, l_work); | |
1339 | struct xfs_mount *mp = log->l_mp; | |
1340 | ||
1341 | /* dgc: errors ignored - not fatal and nowhere to report them */ | |
37444fc4 | 1342 | if (xfs_fs_writable(mp, SB_FREEZE_WRITE) && xfs_log_need_covered(mp)) { |
61e63ecb DC |
1343 | /* |
1344 | * Dump a transaction into the log that contains no real change. | |
1345 | * This is needed to stamp the current tail LSN into the log | |
1346 | * during the covering operation. | |
1347 | * | |
1348 | * We cannot use an inode here for this - that will push dirty | |
1349 | * state back up into the VFS and then periodic inode flushing | |
1350 | * will prevent log covering from making progress. Hence we | |
1351 | * synchronously log the superblock instead to ensure the | |
1352 | * superblock is immediately unpinned and can be written back. | |
1353 | */ | |
1354 | xfs_sync_sb(mp, true); | |
1355 | } else | |
f661f1e0 DC |
1356 | xfs_log_force(mp, 0); |
1357 | ||
1358 | /* start pushing all the metadata that is currently dirty */ | |
1359 | xfs_ail_push_all(mp->m_ail); | |
1360 | ||
1361 | /* queue us up again */ | |
1362 | xfs_log_work_queue(mp); | |
1363 | } | |
1364 | ||
1da177e4 LT |
1365 | /* |
1366 | * This routine initializes some of the log structure for a given mount point. | |
1367 | * Its primary purpose is to fill in enough, so recovery can occur. However, | |
1368 | * some other stuff may be filled in too. | |
1369 | */ | |
9a8d2fdb MT |
1370 | STATIC struct xlog * |
1371 | xlog_alloc_log( | |
1372 | struct xfs_mount *mp, | |
1373 | struct xfs_buftarg *log_target, | |
1374 | xfs_daddr_t blk_offset, | |
1375 | int num_bblks) | |
1da177e4 | 1376 | { |
9a8d2fdb | 1377 | struct xlog *log; |
1da177e4 LT |
1378 | xlog_rec_header_t *head; |
1379 | xlog_in_core_t **iclogp; | |
1380 | xlog_in_core_t *iclog, *prev_iclog=NULL; | |
1da177e4 | 1381 | int i; |
2451337d | 1382 | int error = -ENOMEM; |
69ce58f0 | 1383 | uint log2_size = 0; |
1da177e4 | 1384 | |
9a8d2fdb | 1385 | log = kmem_zalloc(sizeof(struct xlog), KM_MAYFAIL); |
a6cb767e | 1386 | if (!log) { |
a0fa2b67 | 1387 | xfs_warn(mp, "Log allocation failed: No memory!"); |
a6cb767e DC |
1388 | goto out; |
1389 | } | |
1da177e4 LT |
1390 | |
1391 | log->l_mp = mp; | |
1392 | log->l_targ = log_target; | |
1393 | log->l_logsize = BBTOB(num_bblks); | |
1394 | log->l_logBBstart = blk_offset; | |
1395 | log->l_logBBsize = num_bblks; | |
1396 | log->l_covered_state = XLOG_STATE_COVER_IDLE; | |
1397 | log->l_flags |= XLOG_ACTIVE_RECOVERY; | |
f661f1e0 | 1398 | INIT_DELAYED_WORK(&log->l_work, xfs_log_worker); |
1da177e4 LT |
1399 | |
1400 | log->l_prev_block = -1; | |
1da177e4 | 1401 | /* log->l_tail_lsn = 0x100000000LL; cycle = 1; current block = 0 */ |
1c3cb9ec DC |
1402 | xlog_assign_atomic_lsn(&log->l_tail_lsn, 1, 0); |
1403 | xlog_assign_atomic_lsn(&log->l_last_sync_lsn, 1, 0); | |
1da177e4 | 1404 | log->l_curr_cycle = 1; /* 0 is bad since this is initial value */ |
c303c5b8 | 1405 | |
a6a65fef DC |
1406 | if (xfs_sb_version_haslogv2(&mp->m_sb) && mp->m_sb.sb_logsunit > 1) |
1407 | log->l_iclog_roundoff = mp->m_sb.sb_logsunit; | |
1408 | else | |
1409 | log->l_iclog_roundoff = BBSIZE; | |
1410 | ||
c303c5b8 CH |
1411 | xlog_grant_head_init(&log->l_reserve_head); |
1412 | xlog_grant_head_init(&log->l_write_head); | |
1da177e4 | 1413 | |
2451337d | 1414 | error = -EFSCORRUPTED; |
62118709 | 1415 | if (xfs_sb_version_hassector(&mp->m_sb)) { |
69ce58f0 AE |
1416 | log2_size = mp->m_sb.sb_logsectlog; |
1417 | if (log2_size < BBSHIFT) { | |
a0fa2b67 DC |
1418 | xfs_warn(mp, "Log sector size too small (0x%x < 0x%x)", |
1419 | log2_size, BBSHIFT); | |
a6cb767e DC |
1420 | goto out_free_log; |
1421 | } | |
1422 | ||
69ce58f0 AE |
1423 | log2_size -= BBSHIFT; |
1424 | if (log2_size > mp->m_sectbb_log) { | |
a0fa2b67 DC |
1425 | xfs_warn(mp, "Log sector size too large (0x%x > 0x%x)", |
1426 | log2_size, mp->m_sectbb_log); | |
a6cb767e DC |
1427 | goto out_free_log; |
1428 | } | |
69ce58f0 AE |
1429 | |
1430 | /* for larger sector sizes, must have v2 or external log */ | |
1431 | if (log2_size && log->l_logBBstart > 0 && | |
1432 | !xfs_sb_version_haslogv2(&mp->m_sb)) { | |
a0fa2b67 DC |
1433 | xfs_warn(mp, |
1434 | "log sector size (0x%x) invalid for configuration.", | |
1435 | log2_size); | |
a6cb767e DC |
1436 | goto out_free_log; |
1437 | } | |
1da177e4 | 1438 | } |
69ce58f0 | 1439 | log->l_sectBBsize = 1 << log2_size; |
1da177e4 LT |
1440 | |
1441 | xlog_get_iclog_buffer_size(mp, log); | |
1442 | ||
007c61c6 | 1443 | spin_lock_init(&log->l_icloglock); |
eb40a875 | 1444 | init_waitqueue_head(&log->l_flush_wait); |
1da177e4 | 1445 | |
1da177e4 LT |
1446 | iclogp = &log->l_iclog; |
1447 | /* | |
1448 | * The amount of memory to allocate for the iclog structure is | |
1449 | * rather funky due to the way the structure is defined. It is | |
1450 | * done this way so that we can use different sizes for machines | |
1451 | * with different amounts of memory. See the definition of | |
1452 | * xlog_in_core_t in xfs_log_priv.h for details. | |
1453 | */ | |
1da177e4 | 1454 | ASSERT(log->l_iclog_size >= 4096); |
79b54d9b | 1455 | for (i = 0; i < log->l_iclog_bufs; i++) { |
f8f9ee47 | 1456 | int align_mask = xfs_buftarg_dma_alignment(mp->m_logdev_targp); |
89b171ac CH |
1457 | size_t bvec_size = howmany(log->l_iclog_size, PAGE_SIZE) * |
1458 | sizeof(struct bio_vec); | |
79b54d9b CH |
1459 | |
1460 | iclog = kmem_zalloc(sizeof(*iclog) + bvec_size, KM_MAYFAIL); | |
1461 | if (!iclog) | |
644c3567 DC |
1462 | goto out_free_iclog; |
1463 | ||
79b54d9b | 1464 | *iclogp = iclog; |
1da177e4 LT |
1465 | iclog->ic_prev = prev_iclog; |
1466 | prev_iclog = iclog; | |
1fa40b01 | 1467 | |
f8f9ee47 | 1468 | iclog->ic_data = kmem_alloc_io(log->l_iclog_size, align_mask, |
3219e8cf | 1469 | KM_MAYFAIL | KM_ZERO); |
79b54d9b | 1470 | if (!iclog->ic_data) |
644c3567 | 1471 | goto out_free_iclog; |
4679b2d3 | 1472 | #ifdef DEBUG |
5809d5e0 | 1473 | log->l_iclog_bak[i] = &iclog->ic_header; |
4679b2d3 | 1474 | #endif |
1da177e4 LT |
1475 | head = &iclog->ic_header; |
1476 | memset(head, 0, sizeof(xlog_rec_header_t)); | |
b53e675d CH |
1477 | head->h_magicno = cpu_to_be32(XLOG_HEADER_MAGIC_NUM); |
1478 | head->h_version = cpu_to_be32( | |
62118709 | 1479 | xfs_sb_version_haslogv2(&log->l_mp->m_sb) ? 2 : 1); |
b53e675d | 1480 | head->h_size = cpu_to_be32(log->l_iclog_size); |
1da177e4 | 1481 | /* new fields */ |
b53e675d | 1482 | head->h_fmt = cpu_to_be32(XLOG_FMT); |
1da177e4 LT |
1483 | memcpy(&head->h_fs_uuid, &mp->m_sb.sb_uuid, sizeof(uuid_t)); |
1484 | ||
79b54d9b | 1485 | iclog->ic_size = log->l_iclog_size - log->l_iclog_hsize; |
1da177e4 LT |
1486 | iclog->ic_state = XLOG_STATE_ACTIVE; |
1487 | iclog->ic_log = log; | |
114d23aa | 1488 | atomic_set(&iclog->ic_refcnt, 0); |
89ae379d | 1489 | INIT_LIST_HEAD(&iclog->ic_callbacks); |
b28708d6 | 1490 | iclog->ic_datap = (char *)iclog->ic_data + log->l_iclog_hsize; |
1da177e4 | 1491 | |
eb40a875 DC |
1492 | init_waitqueue_head(&iclog->ic_force_wait); |
1493 | init_waitqueue_head(&iclog->ic_write_wait); | |
79b54d9b CH |
1494 | INIT_WORK(&iclog->ic_end_io_work, xlog_ioend_work); |
1495 | sema_init(&iclog->ic_sema, 1); | |
1da177e4 LT |
1496 | |
1497 | iclogp = &iclog->ic_next; | |
1498 | } | |
1499 | *iclogp = log->l_iclog; /* complete ring */ | |
1500 | log->l_iclog->ic_prev = prev_iclog; /* re-write 1st prev ptr */ | |
1501 | ||
1058d0f5 | 1502 | log->l_ioend_workqueue = alloc_workqueue("xfs-log/%s", |
05a302a1 DW |
1503 | XFS_WQFLAGS(WQ_FREEZABLE | WQ_MEM_RECLAIM | |
1504 | WQ_HIGHPRI), | |
1505 | 0, mp->m_super->s_id); | |
1058d0f5 CH |
1506 | if (!log->l_ioend_workqueue) |
1507 | goto out_free_iclog; | |
1508 | ||
71e330b5 DC |
1509 | error = xlog_cil_init(log); |
1510 | if (error) | |
1058d0f5 | 1511 | goto out_destroy_workqueue; |
1da177e4 | 1512 | return log; |
644c3567 | 1513 | |
1058d0f5 CH |
1514 | out_destroy_workqueue: |
1515 | destroy_workqueue(log->l_ioend_workqueue); | |
644c3567 DC |
1516 | out_free_iclog: |
1517 | for (iclog = log->l_iclog; iclog; iclog = prev_iclog) { | |
1518 | prev_iclog = iclog->ic_next; | |
79b54d9b | 1519 | kmem_free(iclog->ic_data); |
644c3567 | 1520 | kmem_free(iclog); |
798a9cad BF |
1521 | if (prev_iclog == log->l_iclog) |
1522 | break; | |
644c3567 | 1523 | } |
644c3567 DC |
1524 | out_free_log: |
1525 | kmem_free(log); | |
a6cb767e | 1526 | out: |
2451337d | 1527 | return ERR_PTR(error); |
1da177e4 LT |
1528 | } /* xlog_alloc_log */ |
1529 | ||
1da177e4 LT |
1530 | /* |
1531 | * Write out the commit record of a transaction associated with the given | |
f10e925d | 1532 | * ticket to close off a running log write. Return the lsn of the commit record. |
1da177e4 | 1533 | */ |
f10e925d | 1534 | int |
55b66332 | 1535 | xlog_commit_record( |
ad223e60 | 1536 | struct xlog *log, |
55b66332 DC |
1537 | struct xlog_ticket *ticket, |
1538 | struct xlog_in_core **iclog, | |
f10e925d | 1539 | xfs_lsn_t *lsn) |
1da177e4 | 1540 | { |
55b66332 DC |
1541 | struct xfs_log_iovec reg = { |
1542 | .i_addr = NULL, | |
1543 | .i_len = 0, | |
1544 | .i_type = XLOG_REG_TYPE_COMMIT, | |
1545 | }; | |
1546 | struct xfs_log_vec vec = { | |
1547 | .lv_niovecs = 1, | |
1548 | .lv_iovecp = ®, | |
1549 | }; | |
f10e925d | 1550 | int error; |
1da177e4 | 1551 | |
f10e925d DC |
1552 | if (XLOG_FORCED_SHUTDOWN(log)) |
1553 | return -EIO; | |
1554 | ||
3468bb1c | 1555 | error = xlog_write(log, &vec, ticket, lsn, iclog, XLOG_COMMIT_TRANS); |
55b66332 | 1556 | if (error) |
f10e925d | 1557 | xfs_force_shutdown(log->l_mp, SHUTDOWN_LOG_IO_ERROR); |
014c2544 | 1558 | return error; |
55b66332 | 1559 | } |
1da177e4 LT |
1560 | |
1561 | /* | |
ed1575da DW |
1562 | * Compute the LSN that we'd need to push the log tail towards in order to have |
1563 | * (a) enough on-disk log space to log the number of bytes specified, (b) at | |
1564 | * least 25% of the log space free, and (c) at least 256 blocks free. If the | |
1565 | * log free space already meets all three thresholds, this function returns | |
1566 | * NULLCOMMITLSN. | |
1da177e4 | 1567 | */ |
ed1575da DW |
1568 | xfs_lsn_t |
1569 | xlog_grant_push_threshold( | |
ad223e60 | 1570 | struct xlog *log, |
2ced19cb | 1571 | int need_bytes) |
1da177e4 | 1572 | { |
2ced19cb | 1573 | xfs_lsn_t threshold_lsn = 0; |
84f3c683 | 1574 | xfs_lsn_t last_sync_lsn; |
2ced19cb DC |
1575 | int free_blocks; |
1576 | int free_bytes; | |
1577 | int threshold_block; | |
1578 | int threshold_cycle; | |
1579 | int free_threshold; | |
1580 | ||
1581 | ASSERT(BTOBB(need_bytes) < log->l_logBBsize); | |
1582 | ||
28496968 | 1583 | free_bytes = xlog_space_left(log, &log->l_reserve_head.grant); |
2ced19cb DC |
1584 | free_blocks = BTOBBT(free_bytes); |
1585 | ||
1586 | /* | |
1587 | * Set the threshold for the minimum number of free blocks in the | |
1588 | * log to the maximum of what the caller needs, one quarter of the | |
1589 | * log, and 256 blocks. | |
1590 | */ | |
1591 | free_threshold = BTOBB(need_bytes); | |
9bb54cb5 DC |
1592 | free_threshold = max(free_threshold, (log->l_logBBsize >> 2)); |
1593 | free_threshold = max(free_threshold, 256); | |
2ced19cb | 1594 | if (free_blocks >= free_threshold) |
ed1575da | 1595 | return NULLCOMMITLSN; |
2ced19cb | 1596 | |
1c3cb9ec DC |
1597 | xlog_crack_atomic_lsn(&log->l_tail_lsn, &threshold_cycle, |
1598 | &threshold_block); | |
1599 | threshold_block += free_threshold; | |
1da177e4 | 1600 | if (threshold_block >= log->l_logBBsize) { |
2ced19cb DC |
1601 | threshold_block -= log->l_logBBsize; |
1602 | threshold_cycle += 1; | |
1da177e4 | 1603 | } |
2ced19cb DC |
1604 | threshold_lsn = xlog_assign_lsn(threshold_cycle, |
1605 | threshold_block); | |
1606 | /* | |
1607 | * Don't pass in an lsn greater than the lsn of the last | |
84f3c683 DC |
1608 | * log record known to be on disk. Use a snapshot of the last sync lsn |
1609 | * so that it doesn't change between the compare and the set. | |
1da177e4 | 1610 | */ |
84f3c683 DC |
1611 | last_sync_lsn = atomic64_read(&log->l_last_sync_lsn); |
1612 | if (XFS_LSN_CMP(threshold_lsn, last_sync_lsn) > 0) | |
1613 | threshold_lsn = last_sync_lsn; | |
2ced19cb | 1614 | |
ed1575da DW |
1615 | return threshold_lsn; |
1616 | } | |
1617 | ||
1618 | /* | |
1619 | * Push the tail of the log if we need to do so to maintain the free log space | |
1620 | * thresholds set out by xlog_grant_push_threshold. We may need to adopt a | |
1621 | * policy which pushes on an lsn which is further along in the log once we | |
1622 | * reach the high water mark. In this manner, we would be creating a low water | |
1623 | * mark. | |
1624 | */ | |
1625 | STATIC void | |
1626 | xlog_grant_push_ail( | |
1627 | struct xlog *log, | |
1628 | int need_bytes) | |
1629 | { | |
1630 | xfs_lsn_t threshold_lsn; | |
1631 | ||
1632 | threshold_lsn = xlog_grant_push_threshold(log, need_bytes); | |
1633 | if (threshold_lsn == NULLCOMMITLSN || XLOG_FORCED_SHUTDOWN(log)) | |
1634 | return; | |
1635 | ||
2ced19cb DC |
1636 | /* |
1637 | * Get the transaction layer to kick the dirty buffers out to | |
1638 | * disk asynchronously. No point in trying to do this if | |
1639 | * the filesystem is shutting down. | |
1640 | */ | |
ed1575da | 1641 | xfs_ail_push(log->l_ailp, threshold_lsn); |
2ced19cb | 1642 | } |
1da177e4 | 1643 | |
0e446be4 CH |
1644 | /* |
1645 | * Stamp cycle number in every block | |
1646 | */ | |
1647 | STATIC void | |
1648 | xlog_pack_data( | |
1649 | struct xlog *log, | |
1650 | struct xlog_in_core *iclog, | |
1651 | int roundoff) | |
1652 | { | |
1653 | int i, j, k; | |
1654 | int size = iclog->ic_offset + roundoff; | |
1655 | __be32 cycle_lsn; | |
b2a922cd | 1656 | char *dp; |
0e446be4 CH |
1657 | |
1658 | cycle_lsn = CYCLE_LSN_DISK(iclog->ic_header.h_lsn); | |
1659 | ||
1660 | dp = iclog->ic_datap; | |
1661 | for (i = 0; i < BTOBB(size); i++) { | |
1662 | if (i >= (XLOG_HEADER_CYCLE_SIZE / BBSIZE)) | |
1663 | break; | |
1664 | iclog->ic_header.h_cycle_data[i] = *(__be32 *)dp; | |
1665 | *(__be32 *)dp = cycle_lsn; | |
1666 | dp += BBSIZE; | |
1667 | } | |
1668 | ||
1669 | if (xfs_sb_version_haslogv2(&log->l_mp->m_sb)) { | |
1670 | xlog_in_core_2_t *xhdr = iclog->ic_data; | |
1671 | ||
1672 | for ( ; i < BTOBB(size); i++) { | |
1673 | j = i / (XLOG_HEADER_CYCLE_SIZE / BBSIZE); | |
1674 | k = i % (XLOG_HEADER_CYCLE_SIZE / BBSIZE); | |
1675 | xhdr[j].hic_xheader.xh_cycle_data[k] = *(__be32 *)dp; | |
1676 | *(__be32 *)dp = cycle_lsn; | |
1677 | dp += BBSIZE; | |
1678 | } | |
1679 | ||
1680 | for (i = 1; i < log->l_iclog_heads; i++) | |
1681 | xhdr[i].hic_xheader.xh_cycle = cycle_lsn; | |
1682 | } | |
1683 | } | |
1684 | ||
1685 | /* | |
1686 | * Calculate the checksum for a log buffer. | |
1687 | * | |
1688 | * This is a little more complicated than it should be because the various | |
1689 | * headers and the actual data are non-contiguous. | |
1690 | */ | |
f9668a09 | 1691 | __le32 |
0e446be4 CH |
1692 | xlog_cksum( |
1693 | struct xlog *log, | |
1694 | struct xlog_rec_header *rhead, | |
1695 | char *dp, | |
1696 | int size) | |
1697 | { | |
c8ce540d | 1698 | uint32_t crc; |
0e446be4 CH |
1699 | |
1700 | /* first generate the crc for the record header ... */ | |
cae028df | 1701 | crc = xfs_start_cksum_update((char *)rhead, |
0e446be4 CH |
1702 | sizeof(struct xlog_rec_header), |
1703 | offsetof(struct xlog_rec_header, h_crc)); | |
1704 | ||
1705 | /* ... then for additional cycle data for v2 logs ... */ | |
1706 | if (xfs_sb_version_haslogv2(&log->l_mp->m_sb)) { | |
1707 | union xlog_in_core2 *xhdr = (union xlog_in_core2 *)rhead; | |
1708 | int i; | |
a3f20014 | 1709 | int xheads; |
0e446be4 | 1710 | |
0c771b99 | 1711 | xheads = DIV_ROUND_UP(size, XLOG_HEADER_CYCLE_SIZE); |
0e446be4 | 1712 | |
a3f20014 | 1713 | for (i = 1; i < xheads; i++) { |
0e446be4 CH |
1714 | crc = crc32c(crc, &xhdr[i].hic_xheader, |
1715 | sizeof(struct xlog_rec_ext_header)); | |
1716 | } | |
1717 | } | |
1718 | ||
1719 | /* ... and finally for the payload */ | |
1720 | crc = crc32c(crc, dp, size); | |
1721 | ||
1722 | return xfs_end_cksum(crc); | |
1723 | } | |
1724 | ||
79b54d9b CH |
1725 | static void |
1726 | xlog_bio_end_io( | |
1727 | struct bio *bio) | |
1728 | { | |
1729 | struct xlog_in_core *iclog = bio->bi_private; | |
1730 | ||
1058d0f5 | 1731 | queue_work(iclog->ic_log->l_ioend_workqueue, |
79b54d9b CH |
1732 | &iclog->ic_end_io_work); |
1733 | } | |
1734 | ||
842a42d1 | 1735 | static int |
79b54d9b CH |
1736 | xlog_map_iclog_data( |
1737 | struct bio *bio, | |
1738 | void *data, | |
1739 | size_t count) | |
1740 | { | |
1741 | do { | |
1742 | struct page *page = kmem_to_page(data); | |
1743 | unsigned int off = offset_in_page(data); | |
1744 | size_t len = min_t(size_t, count, PAGE_SIZE - off); | |
1745 | ||
842a42d1 BF |
1746 | if (bio_add_page(bio, page, len, off) != len) |
1747 | return -EIO; | |
79b54d9b CH |
1748 | |
1749 | data += len; | |
1750 | count -= len; | |
1751 | } while (count); | |
842a42d1 BF |
1752 | |
1753 | return 0; | |
79b54d9b CH |
1754 | } |
1755 | ||
94860a30 CH |
1756 | STATIC void |
1757 | xlog_write_iclog( | |
1758 | struct xlog *log, | |
1759 | struct xlog_in_core *iclog, | |
94860a30 | 1760 | uint64_t bno, |
eef983ff | 1761 | unsigned int count) |
873ff550 | 1762 | { |
94860a30 | 1763 | ASSERT(bno < log->l_logBBsize); |
956f6daa | 1764 | trace_xlog_iclog_write(iclog, _RET_IP_); |
94860a30 CH |
1765 | |
1766 | /* | |
1767 | * We lock the iclogbufs here so that we can serialise against I/O | |
1768 | * completion during unmount. We might be processing a shutdown | |
1769 | * triggered during unmount, and that can occur asynchronously to the | |
1770 | * unmount thread, and hence we need to ensure that completes before | |
1771 | * tearing down the iclogbufs. Hence we need to hold the buffer lock | |
1772 | * across the log IO to archieve that. | |
1773 | */ | |
79b54d9b | 1774 | down(&iclog->ic_sema); |
1858bb0b | 1775 | if (unlikely(iclog->ic_state == XLOG_STATE_IOERROR)) { |
873ff550 CH |
1776 | /* |
1777 | * It would seem logical to return EIO here, but we rely on | |
1778 | * the log state machine to propagate I/O errors instead of | |
79b54d9b CH |
1779 | * doing it here. We kick of the state machine and unlock |
1780 | * the buffer manually, the code needs to be kept in sync | |
1781 | * with the I/O completion path. | |
873ff550 | 1782 | */ |
12e6a0f4 | 1783 | xlog_state_done_syncing(iclog); |
79b54d9b | 1784 | up(&iclog->ic_sema); |
94860a30 | 1785 | return; |
873ff550 CH |
1786 | } |
1787 | ||
79b54d9b CH |
1788 | bio_init(&iclog->ic_bio, iclog->ic_bvec, howmany(count, PAGE_SIZE)); |
1789 | bio_set_dev(&iclog->ic_bio, log->l_targ->bt_bdev); | |
1790 | iclog->ic_bio.bi_iter.bi_sector = log->l_logBBstart + bno; | |
1791 | iclog->ic_bio.bi_end_io = xlog_bio_end_io; | |
1792 | iclog->ic_bio.bi_private = iclog; | |
2def2845 DC |
1793 | |
1794 | /* | |
1795 | * We use REQ_SYNC | REQ_IDLE here to tell the block layer the are more | |
1796 | * IOs coming immediately after this one. This prevents the block layer | |
1797 | * writeback throttle from throttling log writes behind background | |
1798 | * metadata writeback and causing priority inversions. | |
1799 | */ | |
eef983ff | 1800 | iclog->ic_bio.bi_opf = REQ_OP_WRITE | REQ_META | REQ_SYNC | REQ_IDLE; |
b5d721ea | 1801 | if (iclog->ic_flags & XLOG_ICL_NEED_FLUSH) { |
79b54d9b | 1802 | iclog->ic_bio.bi_opf |= REQ_PREFLUSH; |
b5d721ea DC |
1803 | /* |
1804 | * For external log devices, we also need to flush the data | |
1805 | * device cache first to ensure all metadata writeback covered | |
1806 | * by the LSN in this iclog is on stable storage. This is slow, | |
1807 | * but it *must* complete before we issue the external log IO. | |
1808 | */ | |
1809 | if (log->l_targ != log->l_mp->m_ddev_targp) | |
1810 | blkdev_issue_flush(log->l_mp->m_ddev_targp->bt_bdev); | |
1811 | } | |
eef983ff DC |
1812 | if (iclog->ic_flags & XLOG_ICL_NEED_FUA) |
1813 | iclog->ic_bio.bi_opf |= REQ_FUA; | |
b5d721ea | 1814 | |
eef983ff | 1815 | iclog->ic_flags &= ~(XLOG_ICL_NEED_FLUSH | XLOG_ICL_NEED_FUA); |
79b54d9b | 1816 | |
842a42d1 BF |
1817 | if (xlog_map_iclog_data(&iclog->ic_bio, iclog->ic_data, count)) { |
1818 | xfs_force_shutdown(log->l_mp, SHUTDOWN_LOG_IO_ERROR); | |
1819 | return; | |
1820 | } | |
79b54d9b | 1821 | if (is_vmalloc_addr(iclog->ic_data)) |
2c68a1df | 1822 | flush_kernel_vmap_range(iclog->ic_data, count); |
79b54d9b CH |
1823 | |
1824 | /* | |
1825 | * If this log buffer would straddle the end of the log we will have | |
1826 | * to split it up into two bios, so that we can continue at the start. | |
1827 | */ | |
1828 | if (bno + BTOBB(count) > log->l_logBBsize) { | |
1829 | struct bio *split; | |
1830 | ||
1831 | split = bio_split(&iclog->ic_bio, log->l_logBBsize - bno, | |
1832 | GFP_NOIO, &fs_bio_set); | |
1833 | bio_chain(split, &iclog->ic_bio); | |
1834 | submit_bio(split); | |
1835 | ||
1836 | /* restart at logical offset zero for the remainder */ | |
1837 | iclog->ic_bio.bi_iter.bi_sector = log->l_logBBstart; | |
1838 | } | |
1839 | ||
1840 | submit_bio(&iclog->ic_bio); | |
873ff550 | 1841 | } |
1da177e4 | 1842 | |
56933848 CH |
1843 | /* |
1844 | * We need to bump cycle number for the part of the iclog that is | |
1845 | * written to the start of the log. Watch out for the header magic | |
1846 | * number case, though. | |
1847 | */ | |
79b54d9b | 1848 | static void |
56933848 CH |
1849 | xlog_split_iclog( |
1850 | struct xlog *log, | |
1851 | void *data, | |
1852 | uint64_t bno, | |
1853 | unsigned int count) | |
1854 | { | |
1855 | unsigned int split_offset = BBTOB(log->l_logBBsize - bno); | |
1856 | unsigned int i; | |
1857 | ||
1858 | for (i = split_offset; i < count; i += BBSIZE) { | |
1859 | uint32_t cycle = get_unaligned_be32(data + i); | |
1860 | ||
1861 | if (++cycle == XLOG_HEADER_MAGIC_NUM) | |
1862 | cycle++; | |
1863 | put_unaligned_be32(cycle, data + i); | |
1864 | } | |
56933848 CH |
1865 | } |
1866 | ||
db0a6faf CH |
1867 | static int |
1868 | xlog_calc_iclog_size( | |
1869 | struct xlog *log, | |
1870 | struct xlog_in_core *iclog, | |
1871 | uint32_t *roundoff) | |
1872 | { | |
1873 | uint32_t count_init, count; | |
db0a6faf CH |
1874 | |
1875 | /* Add for LR header */ | |
1876 | count_init = log->l_iclog_hsize + iclog->ic_offset; | |
a6a65fef | 1877 | count = roundup(count_init, log->l_iclog_roundoff); |
db0a6faf | 1878 | |
db0a6faf CH |
1879 | *roundoff = count - count_init; |
1880 | ||
a6a65fef DC |
1881 | ASSERT(count >= count_init); |
1882 | ASSERT(*roundoff < log->l_iclog_roundoff); | |
db0a6faf CH |
1883 | return count; |
1884 | } | |
1885 | ||
1da177e4 LT |
1886 | /* |
1887 | * Flush out the in-core log (iclog) to the on-disk log in an asynchronous | |
1888 | * fashion. Previously, we should have moved the current iclog | |
1889 | * ptr in the log to point to the next available iclog. This allows further | |
1890 | * write to continue while this code syncs out an iclog ready to go. | |
1891 | * Before an in-core log can be written out, the data section must be scanned | |
1892 | * to save away the 1st word of each BBSIZE block into the header. We replace | |
1893 | * it with the current cycle count. Each BBSIZE block is tagged with the | |
1894 | * cycle count because there in an implicit assumption that drives will | |
1895 | * guarantee that entire 512 byte blocks get written at once. In other words, | |
1896 | * we can't have part of a 512 byte block written and part not written. By | |
1897 | * tagging each block, we will know which blocks are valid when recovering | |
1898 | * after an unclean shutdown. | |
1899 | * | |
1900 | * This routine is single threaded on the iclog. No other thread can be in | |
1901 | * this routine with the same iclog. Changing contents of iclog can there- | |
1902 | * fore be done without grabbing the state machine lock. Updating the global | |
1903 | * log will require grabbing the lock though. | |
1904 | * | |
1905 | * The entire log manager uses a logical block numbering scheme. Only | |
94860a30 CH |
1906 | * xlog_write_iclog knows about the fact that the log may not start with |
1907 | * block zero on a given device. | |
1da177e4 | 1908 | */ |
94860a30 | 1909 | STATIC void |
9a8d2fdb MT |
1910 | xlog_sync( |
1911 | struct xlog *log, | |
1912 | struct xlog_in_core *iclog) | |
1da177e4 | 1913 | { |
db0a6faf CH |
1914 | unsigned int count; /* byte count of bwrite */ |
1915 | unsigned int roundoff; /* roundoff to BB or stripe */ | |
1916 | uint64_t bno; | |
db0a6faf | 1917 | unsigned int size; |
1da177e4 | 1918 | |
155cc6b7 | 1919 | ASSERT(atomic_read(&iclog->ic_refcnt) == 0); |
956f6daa | 1920 | trace_xlog_iclog_sync(iclog, _RET_IP_); |
1da177e4 | 1921 | |
db0a6faf | 1922 | count = xlog_calc_iclog_size(log, iclog, &roundoff); |
1da177e4 LT |
1923 | |
1924 | /* move grant heads by roundoff in sync */ | |
28496968 CH |
1925 | xlog_grant_add_space(log, &log->l_reserve_head.grant, roundoff); |
1926 | xlog_grant_add_space(log, &log->l_write_head.grant, roundoff); | |
1da177e4 LT |
1927 | |
1928 | /* put cycle number in every block */ | |
1929 | xlog_pack_data(log, iclog, roundoff); | |
1930 | ||
1931 | /* real byte length */ | |
0e446be4 | 1932 | size = iclog->ic_offset; |
db0a6faf | 1933 | if (xfs_sb_version_haslogv2(&log->l_mp->m_sb)) |
0e446be4 CH |
1934 | size += roundoff; |
1935 | iclog->ic_header.h_len = cpu_to_be32(size); | |
1da177e4 | 1936 | |
9b0489c1 | 1937 | XFS_STATS_INC(log->l_mp, xs_log_writes); |
ff6d6af2 | 1938 | XFS_STATS_ADD(log->l_mp, xs_log_blocks, BTOBB(count)); |
1da177e4 | 1939 | |
94860a30 CH |
1940 | bno = BLOCK_LSN(be64_to_cpu(iclog->ic_header.h_lsn)); |
1941 | ||
1da177e4 | 1942 | /* Do we need to split this write into 2 parts? */ |
eef983ff | 1943 | if (bno + BTOBB(count) > log->l_logBBsize) |
79b54d9b | 1944 | xlog_split_iclog(log, &iclog->ic_header, bno, count); |
0e446be4 CH |
1945 | |
1946 | /* calculcate the checksum */ | |
1947 | iclog->ic_header.h_crc = xlog_cksum(log, &iclog->ic_header, | |
1948 | iclog->ic_datap, size); | |
609adfc2 BF |
1949 | /* |
1950 | * Intentionally corrupt the log record CRC based on the error injection | |
1951 | * frequency, if defined. This facilitates testing log recovery in the | |
1952 | * event of torn writes. Hence, set the IOABORT state to abort the log | |
1953 | * write on I/O completion and shutdown the fs. The subsequent mount | |
1954 | * detects the bad CRC and attempts to recover. | |
1955 | */ | |
366fc4b8 | 1956 | #ifdef DEBUG |
3e88a007 | 1957 | if (XFS_TEST_ERROR(false, log->l_mp, XFS_ERRTAG_LOG_BAD_CRC)) { |
e2a64192 | 1958 | iclog->ic_header.h_crc &= cpu_to_le32(0xAAAAAAAA); |
366fc4b8 | 1959 | iclog->ic_fail_crc = true; |
609adfc2 BF |
1960 | xfs_warn(log->l_mp, |
1961 | "Intentionally corrupted log record at LSN 0x%llx. Shutdown imminent.", | |
1962 | be64_to_cpu(iclog->ic_header.h_lsn)); | |
1963 | } | |
366fc4b8 | 1964 | #endif |
abca1f33 | 1965 | xlog_verify_iclog(log, iclog, count); |
eef983ff | 1966 | xlog_write_iclog(log, iclog, bno, count); |
94860a30 | 1967 | } |
1da177e4 | 1968 | |
1da177e4 | 1969 | /* |
c41564b5 | 1970 | * Deallocate a log structure |
1da177e4 | 1971 | */ |
a8272ce0 | 1972 | STATIC void |
9a8d2fdb MT |
1973 | xlog_dealloc_log( |
1974 | struct xlog *log) | |
1da177e4 LT |
1975 | { |
1976 | xlog_in_core_t *iclog, *next_iclog; | |
1da177e4 LT |
1977 | int i; |
1978 | ||
71e330b5 DC |
1979 | xlog_cil_destroy(log); |
1980 | ||
44396476 | 1981 | /* |
9c23eccc DC |
1982 | * Cycle all the iclogbuf locks to make sure all log IO completion |
1983 | * is done before we tear down these buffers. | |
1984 | */ | |
1985 | iclog = log->l_iclog; | |
1986 | for (i = 0; i < log->l_iclog_bufs; i++) { | |
79b54d9b CH |
1987 | down(&iclog->ic_sema); |
1988 | up(&iclog->ic_sema); | |
9c23eccc DC |
1989 | iclog = iclog->ic_next; |
1990 | } | |
1991 | ||
1da177e4 | 1992 | iclog = log->l_iclog; |
9c23eccc | 1993 | for (i = 0; i < log->l_iclog_bufs; i++) { |
1da177e4 | 1994 | next_iclog = iclog->ic_next; |
79b54d9b | 1995 | kmem_free(iclog->ic_data); |
f0e2d93c | 1996 | kmem_free(iclog); |
1da177e4 LT |
1997 | iclog = next_iclog; |
1998 | } | |
1da177e4 | 1999 | |
1da177e4 | 2000 | log->l_mp->m_log = NULL; |
1058d0f5 | 2001 | destroy_workqueue(log->l_ioend_workqueue); |
f0e2d93c | 2002 | kmem_free(log); |
b843299b | 2003 | } |
1da177e4 LT |
2004 | |
2005 | /* | |
2006 | * Update counters atomically now that memcpy is done. | |
2007 | */ | |
1da177e4 | 2008 | static inline void |
9a8d2fdb MT |
2009 | xlog_state_finish_copy( |
2010 | struct xlog *log, | |
2011 | struct xlog_in_core *iclog, | |
2012 | int record_cnt, | |
2013 | int copy_bytes) | |
1da177e4 | 2014 | { |
390aab0a | 2015 | lockdep_assert_held(&log->l_icloglock); |
1da177e4 | 2016 | |
413d57c9 | 2017 | be32_add_cpu(&iclog->ic_header.h_num_logops, record_cnt); |
1da177e4 | 2018 | iclog->ic_offset += copy_bytes; |
390aab0a | 2019 | } |
1da177e4 | 2020 | |
7e9c6396 TS |
2021 | /* |
2022 | * print out info relating to regions written which consume | |
2023 | * the reservation | |
2024 | */ | |
71e330b5 DC |
2025 | void |
2026 | xlog_print_tic_res( | |
2027 | struct xfs_mount *mp, | |
2028 | struct xlog_ticket *ticket) | |
7e9c6396 TS |
2029 | { |
2030 | uint i; | |
2031 | uint ophdr_spc = ticket->t_res_num_ophdrs * (uint)sizeof(xlog_op_header_t); | |
2032 | ||
2033 | /* match with XLOG_REG_TYPE_* in xfs_log.h */ | |
5110cd82 | 2034 | #define REG_TYPE_STR(type, str) [XLOG_REG_TYPE_##type] = str |
d31d7185 | 2035 | static char *res_type_str[] = { |
5110cd82 DW |
2036 | REG_TYPE_STR(BFORMAT, "bformat"), |
2037 | REG_TYPE_STR(BCHUNK, "bchunk"), | |
2038 | REG_TYPE_STR(EFI_FORMAT, "efi_format"), | |
2039 | REG_TYPE_STR(EFD_FORMAT, "efd_format"), | |
2040 | REG_TYPE_STR(IFORMAT, "iformat"), | |
2041 | REG_TYPE_STR(ICORE, "icore"), | |
2042 | REG_TYPE_STR(IEXT, "iext"), | |
2043 | REG_TYPE_STR(IBROOT, "ibroot"), | |
2044 | REG_TYPE_STR(ILOCAL, "ilocal"), | |
2045 | REG_TYPE_STR(IATTR_EXT, "iattr_ext"), | |
2046 | REG_TYPE_STR(IATTR_BROOT, "iattr_broot"), | |
2047 | REG_TYPE_STR(IATTR_LOCAL, "iattr_local"), | |
2048 | REG_TYPE_STR(QFORMAT, "qformat"), | |
2049 | REG_TYPE_STR(DQUOT, "dquot"), | |
2050 | REG_TYPE_STR(QUOTAOFF, "quotaoff"), | |
2051 | REG_TYPE_STR(LRHEADER, "LR header"), | |
2052 | REG_TYPE_STR(UNMOUNT, "unmount"), | |
2053 | REG_TYPE_STR(COMMIT, "commit"), | |
2054 | REG_TYPE_STR(TRANSHDR, "trans header"), | |
d31d7185 DW |
2055 | REG_TYPE_STR(ICREATE, "inode create"), |
2056 | REG_TYPE_STR(RUI_FORMAT, "rui_format"), | |
2057 | REG_TYPE_STR(RUD_FORMAT, "rud_format"), | |
2058 | REG_TYPE_STR(CUI_FORMAT, "cui_format"), | |
2059 | REG_TYPE_STR(CUD_FORMAT, "cud_format"), | |
2060 | REG_TYPE_STR(BUI_FORMAT, "bui_format"), | |
2061 | REG_TYPE_STR(BUD_FORMAT, "bud_format"), | |
7e9c6396 | 2062 | }; |
d31d7185 | 2063 | BUILD_BUG_ON(ARRAY_SIZE(res_type_str) != XLOG_REG_TYPE_MAX + 1); |
5110cd82 | 2064 | #undef REG_TYPE_STR |
7e9c6396 | 2065 | |
7d2d5653 | 2066 | xfs_warn(mp, "ticket reservation summary:"); |
f41febd2 JP |
2067 | xfs_warn(mp, " unit res = %d bytes", |
2068 | ticket->t_unit_res); | |
2069 | xfs_warn(mp, " current res = %d bytes", | |
2070 | ticket->t_curr_res); | |
2071 | xfs_warn(mp, " total reg = %u bytes (o/flow = %u bytes)", | |
2072 | ticket->t_res_arr_sum, ticket->t_res_o_flow); | |
2073 | xfs_warn(mp, " ophdrs = %u (ophdr space = %u bytes)", | |
2074 | ticket->t_res_num_ophdrs, ophdr_spc); | |
2075 | xfs_warn(mp, " ophdr + reg = %u bytes", | |
2076 | ticket->t_res_arr_sum + ticket->t_res_o_flow + ophdr_spc); | |
2077 | xfs_warn(mp, " num regions = %u", | |
2078 | ticket->t_res_num); | |
7e9c6396 TS |
2079 | |
2080 | for (i = 0; i < ticket->t_res_num; i++) { | |
a0fa2b67 | 2081 | uint r_type = ticket->t_res_arr[i].r_type; |
08e96e1a | 2082 | xfs_warn(mp, "region[%u]: %s - %u bytes", i, |
7e9c6396 | 2083 | ((r_type <= 0 || r_type > XLOG_REG_TYPE_MAX) ? |
5110cd82 | 2084 | "bad-rtype" : res_type_str[r_type]), |
7e9c6396 TS |
2085 | ticket->t_res_arr[i].r_len); |
2086 | } | |
2087 | } | |
7e9c6396 | 2088 | |
d4ca1d55 BF |
2089 | /* |
2090 | * Print a summary of the transaction. | |
2091 | */ | |
2092 | void | |
2093 | xlog_print_trans( | |
e6631f85 | 2094 | struct xfs_trans *tp) |
d4ca1d55 | 2095 | { |
e6631f85 DC |
2096 | struct xfs_mount *mp = tp->t_mountp; |
2097 | struct xfs_log_item *lip; | |
d4ca1d55 BF |
2098 | |
2099 | /* dump core transaction and ticket info */ | |
2100 | xfs_warn(mp, "transaction summary:"); | |
2c8f6265 BF |
2101 | xfs_warn(mp, " log res = %d", tp->t_log_res); |
2102 | xfs_warn(mp, " log count = %d", tp->t_log_count); | |
2103 | xfs_warn(mp, " flags = 0x%x", tp->t_flags); | |
d4ca1d55 BF |
2104 | |
2105 | xlog_print_tic_res(mp, tp->t_ticket); | |
2106 | ||
2107 | /* dump each log item */ | |
e6631f85 | 2108 | list_for_each_entry(lip, &tp->t_items, li_trans) { |
d4ca1d55 BF |
2109 | struct xfs_log_vec *lv = lip->li_lv; |
2110 | struct xfs_log_iovec *vec; | |
2111 | int i; | |
2112 | ||
2113 | xfs_warn(mp, "log item: "); | |
2114 | xfs_warn(mp, " type = 0x%x", lip->li_type); | |
22525c17 | 2115 | xfs_warn(mp, " flags = 0x%lx", lip->li_flags); |
d4ca1d55 BF |
2116 | if (!lv) |
2117 | continue; | |
2118 | xfs_warn(mp, " niovecs = %d", lv->lv_niovecs); | |
2119 | xfs_warn(mp, " size = %d", lv->lv_size); | |
2120 | xfs_warn(mp, " bytes = %d", lv->lv_bytes); | |
2121 | xfs_warn(mp, " buf len = %d", lv->lv_buf_len); | |
2122 | ||
2123 | /* dump each iovec for the log item */ | |
2124 | vec = lv->lv_iovecp; | |
2125 | for (i = 0; i < lv->lv_niovecs; i++) { | |
2126 | int dumplen = min(vec->i_len, 32); | |
2127 | ||
2128 | xfs_warn(mp, " iovec[%d]", i); | |
2129 | xfs_warn(mp, " type = 0x%x", vec->i_type); | |
2130 | xfs_warn(mp, " len = %d", vec->i_len); | |
2131 | xfs_warn(mp, " first %d bytes of iovec[%d]:", dumplen, i); | |
244e3dea | 2132 | xfs_hex_dump(vec->i_addr, dumplen); |
d4ca1d55 BF |
2133 | |
2134 | vec++; | |
2135 | } | |
2136 | } | |
2137 | } | |
2138 | ||
b5203cd0 | 2139 | /* |
7ec94921 DC |
2140 | * Calculate the potential space needed by the log vector. We may need a start |
2141 | * record, and each region gets its own struct xlog_op_header and may need to be | |
2142 | * double word aligned. | |
b5203cd0 DC |
2143 | */ |
2144 | static int | |
2145 | xlog_write_calc_vec_length( | |
2146 | struct xlog_ticket *ticket, | |
7ec94921 | 2147 | struct xfs_log_vec *log_vector, |
3468bb1c | 2148 | uint optype) |
b5203cd0 | 2149 | { |
55b66332 | 2150 | struct xfs_log_vec *lv; |
3468bb1c | 2151 | int headers = 0; |
b5203cd0 DC |
2152 | int len = 0; |
2153 | int i; | |
2154 | ||
3468bb1c DC |
2155 | if (optype & XLOG_START_TRANS) |
2156 | headers++; | |
2157 | ||
55b66332 | 2158 | for (lv = log_vector; lv; lv = lv->lv_next) { |
fd63875c DC |
2159 | /* we don't write ordered log vectors */ |
2160 | if (lv->lv_buf_len == XFS_LOG_VEC_ORDERED) | |
2161 | continue; | |
2162 | ||
55b66332 DC |
2163 | headers += lv->lv_niovecs; |
2164 | ||
2165 | for (i = 0; i < lv->lv_niovecs; i++) { | |
2166 | struct xfs_log_iovec *vecp = &lv->lv_iovecp[i]; | |
b5203cd0 | 2167 | |
55b66332 DC |
2168 | len += vecp->i_len; |
2169 | xlog_tic_add_region(ticket, vecp->i_len, vecp->i_type); | |
2170 | } | |
b5203cd0 DC |
2171 | } |
2172 | ||
2173 | ticket->t_res_num_ophdrs += headers; | |
2174 | len += headers * sizeof(struct xlog_op_header); | |
2175 | ||
2176 | return len; | |
2177 | } | |
2178 | ||
7ec94921 | 2179 | static void |
b5203cd0 | 2180 | xlog_write_start_rec( |
e6b1f273 | 2181 | struct xlog_op_header *ophdr, |
b5203cd0 DC |
2182 | struct xlog_ticket *ticket) |
2183 | { | |
b5203cd0 DC |
2184 | ophdr->oh_tid = cpu_to_be32(ticket->t_tid); |
2185 | ophdr->oh_clientid = ticket->t_clientid; | |
2186 | ophdr->oh_len = 0; | |
2187 | ophdr->oh_flags = XLOG_START_TRANS; | |
2188 | ophdr->oh_res2 = 0; | |
b5203cd0 DC |
2189 | } |
2190 | ||
2191 | static xlog_op_header_t * | |
2192 | xlog_write_setup_ophdr( | |
ad223e60 | 2193 | struct xlog *log, |
e6b1f273 | 2194 | struct xlog_op_header *ophdr, |
b5203cd0 DC |
2195 | struct xlog_ticket *ticket, |
2196 | uint flags) | |
2197 | { | |
b5203cd0 DC |
2198 | ophdr->oh_tid = cpu_to_be32(ticket->t_tid); |
2199 | ophdr->oh_clientid = ticket->t_clientid; | |
2200 | ophdr->oh_res2 = 0; | |
2201 | ||
2202 | /* are we copying a commit or unmount record? */ | |
2203 | ophdr->oh_flags = flags; | |
2204 | ||
2205 | /* | |
2206 | * We've seen logs corrupted with bad transaction client ids. This | |
2207 | * makes sure that XFS doesn't generate them on. Turn this into an EIO | |
2208 | * and shut down the filesystem. | |
2209 | */ | |
2210 | switch (ophdr->oh_clientid) { | |
2211 | case XFS_TRANSACTION: | |
2212 | case XFS_VOLUME: | |
2213 | case XFS_LOG: | |
2214 | break; | |
2215 | default: | |
a0fa2b67 | 2216 | xfs_warn(log->l_mp, |
c9690043 | 2217 | "Bad XFS transaction clientid 0x%x in ticket "PTR_FMT, |
b5203cd0 DC |
2218 | ophdr->oh_clientid, ticket); |
2219 | return NULL; | |
2220 | } | |
2221 | ||
2222 | return ophdr; | |
2223 | } | |
2224 | ||
2225 | /* | |
2226 | * Set up the parameters of the region copy into the log. This has | |
2227 | * to handle region write split across multiple log buffers - this | |
2228 | * state is kept external to this function so that this code can | |
ac0e300f | 2229 | * be written in an obvious, self documenting manner. |
b5203cd0 DC |
2230 | */ |
2231 | static int | |
2232 | xlog_write_setup_copy( | |
2233 | struct xlog_ticket *ticket, | |
2234 | struct xlog_op_header *ophdr, | |
2235 | int space_available, | |
2236 | int space_required, | |
2237 | int *copy_off, | |
2238 | int *copy_len, | |
2239 | int *last_was_partial_copy, | |
2240 | int *bytes_consumed) | |
2241 | { | |
2242 | int still_to_copy; | |
2243 | ||
2244 | still_to_copy = space_required - *bytes_consumed; | |
2245 | *copy_off = *bytes_consumed; | |
2246 | ||
2247 | if (still_to_copy <= space_available) { | |
2248 | /* write of region completes here */ | |
2249 | *copy_len = still_to_copy; | |
2250 | ophdr->oh_len = cpu_to_be32(*copy_len); | |
2251 | if (*last_was_partial_copy) | |
2252 | ophdr->oh_flags |= (XLOG_END_TRANS|XLOG_WAS_CONT_TRANS); | |
2253 | *last_was_partial_copy = 0; | |
2254 | *bytes_consumed = 0; | |
2255 | return 0; | |
2256 | } | |
2257 | ||
2258 | /* partial write of region, needs extra log op header reservation */ | |
2259 | *copy_len = space_available; | |
2260 | ophdr->oh_len = cpu_to_be32(*copy_len); | |
2261 | ophdr->oh_flags |= XLOG_CONTINUE_TRANS; | |
2262 | if (*last_was_partial_copy) | |
2263 | ophdr->oh_flags |= XLOG_WAS_CONT_TRANS; | |
2264 | *bytes_consumed += *copy_len; | |
2265 | (*last_was_partial_copy)++; | |
2266 | ||
2267 | /* account for new log op header */ | |
2268 | ticket->t_curr_res -= sizeof(struct xlog_op_header); | |
2269 | ticket->t_res_num_ophdrs++; | |
2270 | ||
2271 | return sizeof(struct xlog_op_header); | |
2272 | } | |
2273 | ||
2274 | static int | |
2275 | xlog_write_copy_finish( | |
ad223e60 | 2276 | struct xlog *log, |
b5203cd0 DC |
2277 | struct xlog_in_core *iclog, |
2278 | uint flags, | |
2279 | int *record_cnt, | |
2280 | int *data_cnt, | |
2281 | int *partial_copy, | |
2282 | int *partial_copy_len, | |
2283 | int log_offset, | |
2284 | struct xlog_in_core **commit_iclog) | |
2285 | { | |
df732b29 CH |
2286 | int error; |
2287 | ||
b5203cd0 DC |
2288 | if (*partial_copy) { |
2289 | /* | |
2290 | * This iclog has already been marked WANT_SYNC by | |
2291 | * xlog_state_get_iclog_space. | |
2292 | */ | |
390aab0a | 2293 | spin_lock(&log->l_icloglock); |
b5203cd0 DC |
2294 | xlog_state_finish_copy(log, iclog, *record_cnt, *data_cnt); |
2295 | *record_cnt = 0; | |
2296 | *data_cnt = 0; | |
df732b29 | 2297 | goto release_iclog; |
b5203cd0 DC |
2298 | } |
2299 | ||
2300 | *partial_copy = 0; | |
2301 | *partial_copy_len = 0; | |
2302 | ||
2303 | if (iclog->ic_size - log_offset <= sizeof(xlog_op_header_t)) { | |
2304 | /* no more space in this iclog - push it. */ | |
390aab0a | 2305 | spin_lock(&log->l_icloglock); |
b5203cd0 DC |
2306 | xlog_state_finish_copy(log, iclog, *record_cnt, *data_cnt); |
2307 | *record_cnt = 0; | |
2308 | *data_cnt = 0; | |
2309 | ||
69363999 CH |
2310 | if (iclog->ic_state == XLOG_STATE_ACTIVE) |
2311 | xlog_state_switch_iclogs(log, iclog, 0); | |
2312 | else | |
2313 | ASSERT(iclog->ic_state == XLOG_STATE_WANT_SYNC || | |
2314 | iclog->ic_state == XLOG_STATE_IOERROR); | |
b5203cd0 | 2315 | if (!commit_iclog) |
df732b29 CH |
2316 | goto release_iclog; |
2317 | spin_unlock(&log->l_icloglock); | |
b5203cd0 DC |
2318 | ASSERT(flags & XLOG_COMMIT_TRANS); |
2319 | *commit_iclog = iclog; | |
2320 | } | |
2321 | ||
2322 | return 0; | |
df732b29 CH |
2323 | |
2324 | release_iclog: | |
0dc8f7f1 | 2325 | error = xlog_state_release_iclog(log, iclog, 0); |
df732b29 CH |
2326 | spin_unlock(&log->l_icloglock); |
2327 | return error; | |
b5203cd0 DC |
2328 | } |
2329 | ||
1da177e4 LT |
2330 | /* |
2331 | * Write some region out to in-core log | |
2332 | * | |
2333 | * This will be called when writing externally provided regions or when | |
2334 | * writing out a commit record for a given transaction. | |
2335 | * | |
2336 | * General algorithm: | |
2337 | * 1. Find total length of this write. This may include adding to the | |
2338 | * lengths passed in. | |
2339 | * 2. Check whether we violate the tickets reservation. | |
2340 | * 3. While writing to this iclog | |
2341 | * A. Reserve as much space in this iclog as can get | |
2342 | * B. If this is first write, save away start lsn | |
2343 | * C. While writing this region: | |
2344 | * 1. If first write of transaction, write start record | |
2345 | * 2. Write log operation header (header per region) | |
2346 | * 3. Find out if we can fit entire region into this iclog | |
2347 | * 4. Potentially, verify destination memcpy ptr | |
2348 | * 5. Memcpy (partial) region | |
2349 | * 6. If partial copy, release iclog; otherwise, continue | |
2350 | * copying more regions into current iclog | |
2351 | * 4. Mark want sync bit (in simulation mode) | |
2352 | * 5. Release iclog for potential flush to on-disk log. | |
2353 | * | |
2354 | * ERRORS: | |
2355 | * 1. Panic if reservation is overrun. This should never happen since | |
2356 | * reservation amounts are generated internal to the filesystem. | |
2357 | * NOTES: | |
2358 | * 1. Tickets are single threaded data structures. | |
2359 | * 2. The XLOG_END_TRANS & XLOG_CONTINUE_TRANS flags are passed down to the | |
2360 | * syncing routine. When a single log_write region needs to span | |
2361 | * multiple in-core logs, the XLOG_CONTINUE_TRANS bit should be set | |
2362 | * on all log operation writes which don't contain the end of the | |
2363 | * region. The XLOG_END_TRANS bit is used for the in-core log | |
2364 | * operation which contains the end of the continued log_write region. | |
2365 | * 3. When xlog_state_get_iclog_space() grabs the rest of the current iclog, | |
2366 | * we don't really know exactly how much space will be used. As a result, | |
2367 | * we don't update ic_offset until the end when we know exactly how many | |
2368 | * bytes have been written out. | |
2369 | */ | |
71e330b5 | 2370 | int |
35a8a72f | 2371 | xlog_write( |
ad223e60 | 2372 | struct xlog *log, |
55b66332 | 2373 | struct xfs_log_vec *log_vector, |
35a8a72f CH |
2374 | struct xlog_ticket *ticket, |
2375 | xfs_lsn_t *start_lsn, | |
2376 | struct xlog_in_core **commit_iclog, | |
3468bb1c | 2377 | uint optype) |
1da177e4 | 2378 | { |
99428ad0 | 2379 | struct xlog_in_core *iclog = NULL; |
9590e9c6 DC |
2380 | struct xfs_log_vec *lv = log_vector; |
2381 | struct xfs_log_iovec *vecp = lv->lv_iovecp; | |
2382 | int index = 0; | |
99428ad0 | 2383 | int len; |
99428ad0 CH |
2384 | int partial_copy = 0; |
2385 | int partial_copy_len = 0; | |
2386 | int contwr = 0; | |
2387 | int record_cnt = 0; | |
2388 | int data_cnt = 0; | |
df732b29 | 2389 | int error = 0; |
99428ad0 | 2390 | |
93b8a585 | 2391 | /* |
9590e9c6 DC |
2392 | * If this is a commit or unmount transaction, we don't need a start |
2393 | * record to be written. We do, however, have to account for the | |
2394 | * commit or unmount header that gets written. Hence we always have | |
2395 | * to account for an extra xlog_op_header here. | |
93b8a585 | 2396 | */ |
9590e9c6 | 2397 | ticket->t_curr_res -= sizeof(struct xlog_op_header); |
7d2d5653 BF |
2398 | if (ticket->t_curr_res < 0) { |
2399 | xfs_alert_tag(log->l_mp, XFS_PTAG_LOGRES, | |
2400 | "ctx ticket reservation ran out. Need to up reservation"); | |
55b66332 | 2401 | xlog_print_tic_res(log->l_mp, ticket); |
7d2d5653 BF |
2402 | xfs_force_shutdown(log->l_mp, SHUTDOWN_LOG_IO_ERROR); |
2403 | } | |
1da177e4 | 2404 | |
3468bb1c DC |
2405 | len = xlog_write_calc_vec_length(ticket, log_vector, optype); |
2406 | if (start_lsn) | |
2407 | *start_lsn = 0; | |
fd63875c | 2408 | while (lv && (!lv->lv_niovecs || index < lv->lv_niovecs)) { |
e6b1f273 | 2409 | void *ptr; |
99428ad0 | 2410 | int log_offset; |
1da177e4 | 2411 | |
99428ad0 CH |
2412 | error = xlog_state_get_iclog_space(log, len, &iclog, ticket, |
2413 | &contwr, &log_offset); | |
2414 | if (error) | |
2415 | return error; | |
1da177e4 | 2416 | |
99428ad0 | 2417 | ASSERT(log_offset <= iclog->ic_size - 1); |
e6b1f273 | 2418 | ptr = iclog->ic_datap + log_offset; |
1da177e4 | 2419 | |
eef983ff | 2420 | /* Start_lsn is the first lsn written to. */ |
3468bb1c | 2421 | if (start_lsn && !*start_lsn) |
99428ad0 | 2422 | *start_lsn = be64_to_cpu(iclog->ic_header.h_lsn); |
b5203cd0 | 2423 | |
99428ad0 CH |
2424 | /* |
2425 | * This loop writes out as many regions as can fit in the amount | |
2426 | * of space which was allocated by xlog_state_get_iclog_space(). | |
2427 | */ | |
fd63875c DC |
2428 | while (lv && (!lv->lv_niovecs || index < lv->lv_niovecs)) { |
2429 | struct xfs_log_iovec *reg; | |
99428ad0 | 2430 | struct xlog_op_header *ophdr; |
99428ad0 CH |
2431 | int copy_len; |
2432 | int copy_off; | |
fd63875c | 2433 | bool ordered = false; |
3468bb1c | 2434 | bool wrote_start_rec = false; |
fd63875c DC |
2435 | |
2436 | /* ordered log vectors have no regions to write */ | |
2437 | if (lv->lv_buf_len == XFS_LOG_VEC_ORDERED) { | |
2438 | ASSERT(lv->lv_niovecs == 0); | |
2439 | ordered = true; | |
2440 | goto next_lv; | |
2441 | } | |
99428ad0 | 2442 | |
fd63875c | 2443 | reg = &vecp[index]; |
c8ce540d DW |
2444 | ASSERT(reg->i_len % sizeof(int32_t) == 0); |
2445 | ASSERT((unsigned long)ptr % sizeof(int32_t) == 0); | |
99428ad0 | 2446 | |
7ec94921 DC |
2447 | /* |
2448 | * Before we start formatting log vectors, we need to | |
2449 | * write a start record. Only do this for the first | |
2450 | * iclog we write to. | |
2451 | */ | |
3468bb1c | 2452 | if (optype & XLOG_START_TRANS) { |
7ec94921 | 2453 | xlog_write_start_rec(ptr, ticket); |
e6b1f273 | 2454 | xlog_write_adv_cnt(&ptr, &len, &log_offset, |
7ec94921 | 2455 | sizeof(struct xlog_op_header)); |
3468bb1c DC |
2456 | optype &= ~XLOG_START_TRANS; |
2457 | wrote_start_rec = true; | |
99428ad0 | 2458 | } |
b5203cd0 | 2459 | |
3468bb1c | 2460 | ophdr = xlog_write_setup_ophdr(log, ptr, ticket, optype); |
99428ad0 | 2461 | if (!ophdr) |
2451337d | 2462 | return -EIO; |
99428ad0 | 2463 | |
e6b1f273 | 2464 | xlog_write_adv_cnt(&ptr, &len, &log_offset, |
99428ad0 CH |
2465 | sizeof(struct xlog_op_header)); |
2466 | ||
2467 | len += xlog_write_setup_copy(ticket, ophdr, | |
2468 | iclog->ic_size-log_offset, | |
55b66332 | 2469 | reg->i_len, |
99428ad0 CH |
2470 | ©_off, ©_len, |
2471 | &partial_copy, | |
2472 | &partial_copy_len); | |
2473 | xlog_verify_dest_ptr(log, ptr); | |
2474 | ||
91f9f5fe ES |
2475 | /* |
2476 | * Copy region. | |
2477 | * | |
2478 | * Unmount records just log an opheader, so can have | |
2479 | * empty payloads with no data region to copy. Hence we | |
2480 | * only copy the payload if the vector says it has data | |
2481 | * to copy. | |
2482 | */ | |
99428ad0 | 2483 | ASSERT(copy_len >= 0); |
91f9f5fe ES |
2484 | if (copy_len > 0) { |
2485 | memcpy(ptr, reg->i_addr + copy_off, copy_len); | |
2486 | xlog_write_adv_cnt(&ptr, &len, &log_offset, | |
2487 | copy_len); | |
2488 | } | |
7ec94921 | 2489 | copy_len += sizeof(struct xlog_op_header); |
99428ad0 | 2490 | record_cnt++; |
3468bb1c | 2491 | if (wrote_start_rec) { |
7ec94921 DC |
2492 | copy_len += sizeof(struct xlog_op_header); |
2493 | record_cnt++; | |
7ec94921 | 2494 | } |
99428ad0 CH |
2495 | data_cnt += contwr ? copy_len : 0; |
2496 | ||
3468bb1c | 2497 | error = xlog_write_copy_finish(log, iclog, optype, |
99428ad0 CH |
2498 | &record_cnt, &data_cnt, |
2499 | &partial_copy, | |
2500 | &partial_copy_len, | |
2501 | log_offset, | |
2502 | commit_iclog); | |
2503 | if (error) | |
2504 | return error; | |
2505 | ||
2506 | /* | |
2507 | * if we had a partial copy, we need to get more iclog | |
2508 | * space but we don't want to increment the region | |
2509 | * index because there is still more is this region to | |
2510 | * write. | |
2511 | * | |
2512 | * If we completed writing this region, and we flushed | |
2513 | * the iclog (indicated by resetting of the record | |
2514 | * count), then we also need to get more log space. If | |
2515 | * this was the last record, though, we are done and | |
2516 | * can just return. | |
2517 | */ | |
2518 | if (partial_copy) | |
2519 | break; | |
2520 | ||
55b66332 | 2521 | if (++index == lv->lv_niovecs) { |
fd63875c | 2522 | next_lv: |
55b66332 DC |
2523 | lv = lv->lv_next; |
2524 | index = 0; | |
2525 | if (lv) | |
2526 | vecp = lv->lv_iovecp; | |
2527 | } | |
749f24f3 | 2528 | if (record_cnt == 0 && !ordered) { |
55b66332 | 2529 | if (!lv) |
99428ad0 CH |
2530 | return 0; |
2531 | break; | |
2532 | } | |
2533 | } | |
2534 | } | |
2535 | ||
2536 | ASSERT(len == 0); | |
2537 | ||
390aab0a | 2538 | spin_lock(&log->l_icloglock); |
99428ad0 | 2539 | xlog_state_finish_copy(log, iclog, record_cnt, data_cnt); |
df732b29 | 2540 | if (commit_iclog) { |
3468bb1c | 2541 | ASSERT(optype & XLOG_COMMIT_TRANS); |
df732b29 CH |
2542 | *commit_iclog = iclog; |
2543 | } else { | |
0dc8f7f1 | 2544 | error = xlog_state_release_iclog(log, iclog, 0); |
df732b29 | 2545 | } |
390aab0a | 2546 | spin_unlock(&log->l_icloglock); |
1da177e4 | 2547 | |
df732b29 | 2548 | return error; |
99428ad0 | 2549 | } |
1da177e4 | 2550 | |
c814b4f2 CH |
2551 | static void |
2552 | xlog_state_activate_iclog( | |
2553 | struct xlog_in_core *iclog, | |
2554 | int *iclogs_changed) | |
2555 | { | |
2556 | ASSERT(list_empty_careful(&iclog->ic_callbacks)); | |
956f6daa | 2557 | trace_xlog_iclog_activate(iclog, _RET_IP_); |
c814b4f2 CH |
2558 | |
2559 | /* | |
2560 | * If the number of ops in this iclog indicate it just contains the | |
2561 | * dummy transaction, we can change state into IDLE (the second time | |
2562 | * around). Otherwise we should change the state into NEED a dummy. | |
2563 | * We don't need to cover the dummy. | |
2564 | */ | |
2565 | if (*iclogs_changed == 0 && | |
2566 | iclog->ic_header.h_num_logops == cpu_to_be32(XLOG_COVER_OPS)) { | |
2567 | *iclogs_changed = 1; | |
2568 | } else { | |
2569 | /* | |
2570 | * We have two dirty iclogs so start over. This could also be | |
2571 | * num of ops indicating this is not the dummy going out. | |
2572 | */ | |
2573 | *iclogs_changed = 2; | |
2574 | } | |
2575 | ||
2576 | iclog->ic_state = XLOG_STATE_ACTIVE; | |
2577 | iclog->ic_offset = 0; | |
2578 | iclog->ic_header.h_num_logops = 0; | |
2579 | memset(iclog->ic_header.h_cycle_data, 0, | |
2580 | sizeof(iclog->ic_header.h_cycle_data)); | |
2581 | iclog->ic_header.h_lsn = 0; | |
2582 | } | |
2583 | ||
0383f543 | 2584 | /* |
c814b4f2 CH |
2585 | * Loop through all iclogs and mark all iclogs currently marked DIRTY as |
2586 | * ACTIVE after iclog I/O has completed. | |
1da177e4 | 2587 | */ |
c814b4f2 CH |
2588 | static void |
2589 | xlog_state_activate_iclogs( | |
0383f543 | 2590 | struct xlog *log, |
c814b4f2 | 2591 | int *iclogs_changed) |
1da177e4 | 2592 | { |
c814b4f2 | 2593 | struct xlog_in_core *iclog = log->l_iclog; |
1da177e4 | 2594 | |
1da177e4 | 2595 | do { |
c814b4f2 CH |
2596 | if (iclog->ic_state == XLOG_STATE_DIRTY) |
2597 | xlog_state_activate_iclog(iclog, iclogs_changed); | |
2598 | /* | |
2599 | * The ordering of marking iclogs ACTIVE must be maintained, so | |
2600 | * an iclog doesn't become ACTIVE beyond one that is SYNCING. | |
2601 | */ | |
2602 | else if (iclog->ic_state != XLOG_STATE_ACTIVE) | |
2603 | break; | |
2604 | } while ((iclog = iclog->ic_next) != log->l_iclog); | |
2605 | } | |
0383f543 | 2606 | |
c814b4f2 CH |
2607 | static int |
2608 | xlog_covered_state( | |
2609 | int prev_state, | |
2610 | int iclogs_changed) | |
2611 | { | |
0383f543 | 2612 | /* |
b0eb9e11 BF |
2613 | * We go to NEED for any non-covering writes. We go to NEED2 if we just |
2614 | * wrote the first covering record (DONE). We go to IDLE if we just | |
2615 | * wrote the second covering record (DONE2) and remain in IDLE until a | |
2616 | * non-covering write occurs. | |
0383f543 | 2617 | */ |
c814b4f2 CH |
2618 | switch (prev_state) { |
2619 | case XLOG_STATE_COVER_IDLE: | |
b0eb9e11 BF |
2620 | if (iclogs_changed == 1) |
2621 | return XLOG_STATE_COVER_IDLE; | |
53004ee7 | 2622 | fallthrough; |
c814b4f2 CH |
2623 | case XLOG_STATE_COVER_NEED: |
2624 | case XLOG_STATE_COVER_NEED2: | |
2625 | break; | |
2626 | case XLOG_STATE_COVER_DONE: | |
2627 | if (iclogs_changed == 1) | |
2628 | return XLOG_STATE_COVER_NEED2; | |
2629 | break; | |
2630 | case XLOG_STATE_COVER_DONE2: | |
2631 | if (iclogs_changed == 1) | |
2632 | return XLOG_STATE_COVER_IDLE; | |
2633 | break; | |
2634 | default: | |
2635 | ASSERT(0); | |
2636 | } | |
0383f543 | 2637 | |
c814b4f2 CH |
2638 | return XLOG_STATE_COVER_NEED; |
2639 | } | |
1da177e4 | 2640 | |
c814b4f2 CH |
2641 | STATIC void |
2642 | xlog_state_clean_iclog( | |
2643 | struct xlog *log, | |
2644 | struct xlog_in_core *dirty_iclog) | |
2645 | { | |
2646 | int iclogs_changed = 0; | |
1da177e4 | 2647 | |
956f6daa DC |
2648 | trace_xlog_iclog_clean(dirty_iclog, _RET_IP_); |
2649 | ||
5781464b | 2650 | dirty_iclog->ic_state = XLOG_STATE_DIRTY; |
1da177e4 | 2651 | |
c814b4f2 CH |
2652 | xlog_state_activate_iclogs(log, &iclogs_changed); |
2653 | wake_up_all(&dirty_iclog->ic_force_wait); | |
2654 | ||
2655 | if (iclogs_changed) { | |
2656 | log->l_covered_state = xlog_covered_state(log->l_covered_state, | |
2657 | iclogs_changed); | |
1da177e4 | 2658 | } |
0383f543 | 2659 | } |
1da177e4 LT |
2660 | |
2661 | STATIC xfs_lsn_t | |
2662 | xlog_get_lowest_lsn( | |
9bff3132 | 2663 | struct xlog *log) |
1da177e4 | 2664 | { |
9bff3132 CH |
2665 | struct xlog_in_core *iclog = log->l_iclog; |
2666 | xfs_lsn_t lowest_lsn = 0, lsn; | |
1da177e4 | 2667 | |
1da177e4 | 2668 | do { |
1858bb0b CH |
2669 | if (iclog->ic_state == XLOG_STATE_ACTIVE || |
2670 | iclog->ic_state == XLOG_STATE_DIRTY) | |
9bff3132 CH |
2671 | continue; |
2672 | ||
2673 | lsn = be64_to_cpu(iclog->ic_header.h_lsn); | |
2674 | if ((lsn && !lowest_lsn) || XFS_LSN_CMP(lsn, lowest_lsn) < 0) | |
1da177e4 | 2675 | lowest_lsn = lsn; |
9bff3132 CH |
2676 | } while ((iclog = iclog->ic_next) != log->l_iclog); |
2677 | ||
014c2544 | 2678 | return lowest_lsn; |
1da177e4 LT |
2679 | } |
2680 | ||
14e15f1b DC |
2681 | /* |
2682 | * Completion of a iclog IO does not imply that a transaction has completed, as | |
2683 | * transactions can be large enough to span many iclogs. We cannot change the | |
2684 | * tail of the log half way through a transaction as this may be the only | |
2685 | * transaction in the log and moving the tail to point to the middle of it | |
2686 | * will prevent recovery from finding the start of the transaction. Hence we | |
2687 | * should only update the last_sync_lsn if this iclog contains transaction | |
2688 | * completion callbacks on it. | |
2689 | * | |
2690 | * We have to do this before we drop the icloglock to ensure we are the only one | |
2691 | * that can update it. | |
2692 | * | |
2693 | * If we are moving the last_sync_lsn forwards, we also need to ensure we kick | |
2694 | * the reservation grant head pushing. This is due to the fact that the push | |
2695 | * target is bound by the current last_sync_lsn value. Hence if we have a large | |
2696 | * amount of log space bound up in this committing transaction then the | |
2697 | * last_sync_lsn value may be the limiting factor preventing tail pushing from | |
2698 | * freeing space in the log. Hence once we've updated the last_sync_lsn we | |
2699 | * should push the AIL to ensure the push target (and hence the grant head) is | |
2700 | * no longer bound by the old log head location and can move forwards and make | |
2701 | * progress again. | |
2702 | */ | |
2703 | static void | |
2704 | xlog_state_set_callback( | |
2705 | struct xlog *log, | |
2706 | struct xlog_in_core *iclog, | |
2707 | xfs_lsn_t header_lsn) | |
2708 | { | |
956f6daa | 2709 | trace_xlog_iclog_callback(iclog, _RET_IP_); |
14e15f1b DC |
2710 | iclog->ic_state = XLOG_STATE_CALLBACK; |
2711 | ||
2712 | ASSERT(XFS_LSN_CMP(atomic64_read(&log->l_last_sync_lsn), | |
2713 | header_lsn) <= 0); | |
2714 | ||
2715 | if (list_empty_careful(&iclog->ic_callbacks)) | |
2716 | return; | |
2717 | ||
2718 | atomic64_set(&log->l_last_sync_lsn, header_lsn); | |
2719 | xlog_grant_push_ail(log, 0); | |
2720 | } | |
2721 | ||
5e96fa8d DC |
2722 | /* |
2723 | * Return true if we need to stop processing, false to continue to the next | |
2724 | * iclog. The caller will need to run callbacks if the iclog is returned in the | |
2725 | * XLOG_STATE_CALLBACK state. | |
2726 | */ | |
2727 | static bool | |
2728 | xlog_state_iodone_process_iclog( | |
2729 | struct xlog *log, | |
2730 | struct xlog_in_core *iclog, | |
5e96fa8d DC |
2731 | bool *ioerror) |
2732 | { | |
2733 | xfs_lsn_t lowest_lsn; | |
14e15f1b | 2734 | xfs_lsn_t header_lsn; |
5e96fa8d | 2735 | |
1858bb0b CH |
2736 | switch (iclog->ic_state) { |
2737 | case XLOG_STATE_ACTIVE: | |
2738 | case XLOG_STATE_DIRTY: | |
2739 | /* | |
2740 | * Skip all iclogs in the ACTIVE & DIRTY states: | |
2741 | */ | |
5e96fa8d | 2742 | return false; |
1858bb0b CH |
2743 | case XLOG_STATE_IOERROR: |
2744 | /* | |
2745 | * Between marking a filesystem SHUTDOWN and stopping the log, | |
2746 | * we do flush all iclogs to disk (if there wasn't a log I/O | |
2747 | * error). So, we do want things to go smoothly in case of just | |
4b29ab04 | 2748 | * a SHUTDOWN w/o a LOG_IO_ERROR. |
1858bb0b | 2749 | */ |
5e96fa8d DC |
2750 | *ioerror = true; |
2751 | return false; | |
1858bb0b | 2752 | case XLOG_STATE_DONE_SYNC: |
1858bb0b | 2753 | /* |
4b29ab04 CH |
2754 | * Now that we have an iclog that is in the DONE_SYNC state, do |
2755 | * one more check here to see if we have chased our tail around. | |
2756 | * If this is not the lowest lsn iclog, then we will leave it | |
2757 | * for another completion to process. | |
1858bb0b CH |
2758 | */ |
2759 | header_lsn = be64_to_cpu(iclog->ic_header.h_lsn); | |
2760 | lowest_lsn = xlog_get_lowest_lsn(log); | |
2761 | if (lowest_lsn && XFS_LSN_CMP(lowest_lsn, header_lsn) < 0) | |
2762 | return false; | |
2763 | xlog_state_set_callback(log, iclog, header_lsn); | |
2764 | return false; | |
2765 | default: | |
2766 | /* | |
2767 | * Can only perform callbacks in order. Since this iclog is not | |
4b29ab04 CH |
2768 | * in the DONE_SYNC state, we skip the rest and just try to |
2769 | * clean up. | |
1858bb0b | 2770 | */ |
5e96fa8d DC |
2771 | return true; |
2772 | } | |
5e96fa8d DC |
2773 | } |
2774 | ||
1da177e4 LT |
2775 | STATIC void |
2776 | xlog_state_do_callback( | |
12e6a0f4 | 2777 | struct xlog *log) |
1da177e4 | 2778 | { |
5e96fa8d DC |
2779 | struct xlog_in_core *iclog; |
2780 | struct xlog_in_core *first_iclog; | |
5e96fa8d DC |
2781 | bool cycled_icloglock; |
2782 | bool ioerror; | |
2783 | int flushcnt = 0; | |
2784 | int repeats = 0; | |
1da177e4 | 2785 | |
b22cd72c | 2786 | spin_lock(&log->l_icloglock); |
1da177e4 LT |
2787 | do { |
2788 | /* | |
2789 | * Scan all iclogs starting with the one pointed to by the | |
2790 | * log. Reset this starting point each time the log is | |
2791 | * unlocked (during callbacks). | |
2792 | * | |
2793 | * Keep looping through iclogs until one full pass is made | |
2794 | * without running any callbacks. | |
2795 | */ | |
2796 | first_iclog = log->l_iclog; | |
2797 | iclog = log->l_iclog; | |
6546818c | 2798 | cycled_icloglock = false; |
5e96fa8d | 2799 | ioerror = false; |
1da177e4 LT |
2800 | repeats++; |
2801 | ||
2802 | do { | |
a1bb8505 DC |
2803 | LIST_HEAD(cb_list); |
2804 | ||
5e96fa8d | 2805 | if (xlog_state_iodone_process_iclog(log, iclog, |
4b29ab04 | 2806 | &ioerror)) |
5e96fa8d | 2807 | break; |
1da177e4 | 2808 | |
1858bb0b CH |
2809 | if (iclog->ic_state != XLOG_STATE_CALLBACK && |
2810 | iclog->ic_state != XLOG_STATE_IOERROR) { | |
1da177e4 LT |
2811 | iclog = iclog->ic_next; |
2812 | continue; | |
2813 | } | |
a1bb8505 | 2814 | list_splice_init(&iclog->ic_callbacks, &cb_list); |
6be00102 | 2815 | spin_unlock(&log->l_icloglock); |
1da177e4 | 2816 | |
a1bb8505 DC |
2817 | trace_xlog_iclog_callbacks_start(iclog, _RET_IP_); |
2818 | xlog_cil_process_committed(&cb_list); | |
2819 | trace_xlog_iclog_callbacks_done(iclog, _RET_IP_); | |
6546818c | 2820 | cycled_icloglock = true; |
6be00102 DC |
2821 | |
2822 | spin_lock(&log->l_icloglock); | |
5781464b CH |
2823 | if (XLOG_FORCED_SHUTDOWN(log)) |
2824 | wake_up_all(&iclog->ic_force_wait); | |
2825 | else | |
2826 | xlog_state_clean_iclog(log, iclog); | |
1da177e4 LT |
2827 | iclog = iclog->ic_next; |
2828 | } while (first_iclog != iclog); | |
a3c6685e NS |
2829 | |
2830 | if (repeats > 5000) { | |
2831 | flushcnt += repeats; | |
2832 | repeats = 0; | |
a0fa2b67 | 2833 | xfs_warn(log->l_mp, |
a3c6685e | 2834 | "%s: possible infinite loop (%d iterations)", |
34a622b2 | 2835 | __func__, flushcnt); |
1da177e4 | 2836 | } |
5e96fa8d | 2837 | } while (!ioerror && cycled_icloglock); |
1da177e4 | 2838 | |
1858bb0b CH |
2839 | if (log->l_iclog->ic_state == XLOG_STATE_ACTIVE || |
2840 | log->l_iclog->ic_state == XLOG_STATE_IOERROR) | |
eb40a875 | 2841 | wake_up_all(&log->l_flush_wait); |
cdea5459 RR |
2842 | |
2843 | spin_unlock(&log->l_icloglock); | |
d748c623 | 2844 | } |
1da177e4 LT |
2845 | |
2846 | ||
2847 | /* | |
2848 | * Finish transitioning this iclog to the dirty state. | |
2849 | * | |
2850 | * Make sure that we completely execute this routine only when this is | |
2851 | * the last call to the iclog. There is a good chance that iclog flushes, | |
2852 | * when we reach the end of the physical log, get turned into 2 separate | |
2853 | * calls to bwrite. Hence, one iclog flush could generate two calls to this | |
2854 | * routine. By using the reference count bwritecnt, we guarantee that only | |
2855 | * the second completion goes through. | |
2856 | * | |
2857 | * Callbacks could take time, so they are done outside the scope of the | |
12017faf | 2858 | * global state machine log lock. |
1da177e4 | 2859 | */ |
a8272ce0 | 2860 | STATIC void |
1da177e4 | 2861 | xlog_state_done_syncing( |
12e6a0f4 | 2862 | struct xlog_in_core *iclog) |
1da177e4 | 2863 | { |
d15cbf2f | 2864 | struct xlog *log = iclog->ic_log; |
1da177e4 | 2865 | |
b22cd72c | 2866 | spin_lock(&log->l_icloglock); |
155cc6b7 | 2867 | ASSERT(atomic_read(&iclog->ic_refcnt) == 0); |
956f6daa | 2868 | trace_xlog_iclog_sync_done(iclog, _RET_IP_); |
1da177e4 LT |
2869 | |
2870 | /* | |
2871 | * If we got an error, either on the first buffer, or in the case of | |
12e6a0f4 CH |
2872 | * split log writes, on the second, we shut down the file system and |
2873 | * no iclogs should ever be attempted to be written to disk again. | |
1da177e4 | 2874 | */ |
12e6a0f4 CH |
2875 | if (!XLOG_FORCED_SHUTDOWN(log)) { |
2876 | ASSERT(iclog->ic_state == XLOG_STATE_SYNCING); | |
1da177e4 | 2877 | iclog->ic_state = XLOG_STATE_DONE_SYNC; |
12e6a0f4 | 2878 | } |
1da177e4 LT |
2879 | |
2880 | /* | |
2881 | * Someone could be sleeping prior to writing out the next | |
2882 | * iclog buffer, we wake them all, one will get to do the | |
2883 | * I/O, the others get to wait for the result. | |
2884 | */ | |
eb40a875 | 2885 | wake_up_all(&iclog->ic_write_wait); |
b22cd72c | 2886 | spin_unlock(&log->l_icloglock); |
b843299b | 2887 | xlog_state_do_callback(log); |
12e6a0f4 | 2888 | } |
1da177e4 LT |
2889 | |
2890 | /* | |
2891 | * If the head of the in-core log ring is not (ACTIVE or DIRTY), then we must | |
12017faf DC |
2892 | * sleep. We wait on the flush queue on the head iclog as that should be |
2893 | * the first iclog to complete flushing. Hence if all iclogs are syncing, | |
2894 | * we will wait here and all new writes will sleep until a sync completes. | |
1da177e4 LT |
2895 | * |
2896 | * The in-core logs are used in a circular fashion. They are not used | |
2897 | * out-of-order even when an iclog past the head is free. | |
2898 | * | |
2899 | * return: | |
2900 | * * log_offset where xlog_write() can start writing into the in-core | |
2901 | * log's data space. | |
2902 | * * in-core log pointer to which xlog_write() should write. | |
2903 | * * boolean indicating this is a continued write to an in-core log. | |
2904 | * If this is the last write, then the in-core log's offset field | |
2905 | * needs to be incremented, depending on the amount of data which | |
2906 | * is copied. | |
2907 | */ | |
a8272ce0 | 2908 | STATIC int |
9a8d2fdb MT |
2909 | xlog_state_get_iclog_space( |
2910 | struct xlog *log, | |
2911 | int len, | |
2912 | struct xlog_in_core **iclogp, | |
2913 | struct xlog_ticket *ticket, | |
2914 | int *continued_write, | |
2915 | int *logoffsetp) | |
1da177e4 | 2916 | { |
1da177e4 LT |
2917 | int log_offset; |
2918 | xlog_rec_header_t *head; | |
2919 | xlog_in_core_t *iclog; | |
1da177e4 LT |
2920 | |
2921 | restart: | |
b22cd72c | 2922 | spin_lock(&log->l_icloglock); |
1da177e4 | 2923 | if (XLOG_FORCED_SHUTDOWN(log)) { |
b22cd72c | 2924 | spin_unlock(&log->l_icloglock); |
2451337d | 2925 | return -EIO; |
1da177e4 LT |
2926 | } |
2927 | ||
2928 | iclog = log->l_iclog; | |
d748c623 | 2929 | if (iclog->ic_state != XLOG_STATE_ACTIVE) { |
ff6d6af2 | 2930 | XFS_STATS_INC(log->l_mp, xs_log_noiclogs); |
d748c623 MW |
2931 | |
2932 | /* Wait for log writes to have flushed */ | |
eb40a875 | 2933 | xlog_wait(&log->l_flush_wait, &log->l_icloglock); |
1da177e4 LT |
2934 | goto restart; |
2935 | } | |
d748c623 | 2936 | |
1da177e4 LT |
2937 | head = &iclog->ic_header; |
2938 | ||
155cc6b7 | 2939 | atomic_inc(&iclog->ic_refcnt); /* prevents sync */ |
1da177e4 LT |
2940 | log_offset = iclog->ic_offset; |
2941 | ||
956f6daa DC |
2942 | trace_xlog_iclog_get_space(iclog, _RET_IP_); |
2943 | ||
1da177e4 LT |
2944 | /* On the 1st write to an iclog, figure out lsn. This works |
2945 | * if iclogs marked XLOG_STATE_WANT_SYNC always write out what they are | |
2946 | * committing to. If the offset is set, that's how many blocks | |
2947 | * must be written. | |
2948 | */ | |
2949 | if (log_offset == 0) { | |
2950 | ticket->t_curr_res -= log->l_iclog_hsize; | |
0adba536 | 2951 | xlog_tic_add_region(ticket, |
7e9c6396 TS |
2952 | log->l_iclog_hsize, |
2953 | XLOG_REG_TYPE_LRHEADER); | |
b53e675d CH |
2954 | head->h_cycle = cpu_to_be32(log->l_curr_cycle); |
2955 | head->h_lsn = cpu_to_be64( | |
03bea6fe | 2956 | xlog_assign_lsn(log->l_curr_cycle, log->l_curr_block)); |
1da177e4 LT |
2957 | ASSERT(log->l_curr_block >= 0); |
2958 | } | |
2959 | ||
2960 | /* If there is enough room to write everything, then do it. Otherwise, | |
2961 | * claim the rest of the region and make sure the XLOG_STATE_WANT_SYNC | |
2962 | * bit is on, so this will get flushed out. Don't update ic_offset | |
2963 | * until you know exactly how many bytes get copied. Therefore, wait | |
2964 | * until later to update ic_offset. | |
2965 | * | |
2966 | * xlog_write() algorithm assumes that at least 2 xlog_op_header_t's | |
2967 | * can fit into remaining data section. | |
2968 | */ | |
2969 | if (iclog->ic_size - iclog->ic_offset < 2*sizeof(xlog_op_header_t)) { | |
df732b29 CH |
2970 | int error = 0; |
2971 | ||
1da177e4 LT |
2972 | xlog_state_switch_iclogs(log, iclog, iclog->ic_size); |
2973 | ||
49641f1a | 2974 | /* |
df732b29 CH |
2975 | * If we are the only one writing to this iclog, sync it to |
2976 | * disk. We need to do an atomic compare and decrement here to | |
2977 | * avoid racing with concurrent atomic_dec_and_lock() calls in | |
49641f1a DC |
2978 | * xlog_state_release_iclog() when there is more than one |
2979 | * reference to the iclog. | |
2980 | */ | |
df732b29 | 2981 | if (!atomic_add_unless(&iclog->ic_refcnt, -1, 1)) |
0dc8f7f1 | 2982 | error = xlog_state_release_iclog(log, iclog, 0); |
df732b29 CH |
2983 | spin_unlock(&log->l_icloglock); |
2984 | if (error) | |
2985 | return error; | |
1da177e4 LT |
2986 | goto restart; |
2987 | } | |
2988 | ||
2989 | /* Do we have enough room to write the full amount in the remainder | |
2990 | * of this iclog? Or must we continue a write on the next iclog and | |
2991 | * mark this iclog as completely taken? In the case where we switch | |
2992 | * iclogs (to mark it taken), this particular iclog will release/sync | |
2993 | * to disk in xlog_write(). | |
2994 | */ | |
2995 | if (len <= iclog->ic_size - iclog->ic_offset) { | |
2996 | *continued_write = 0; | |
2997 | iclog->ic_offset += len; | |
2998 | } else { | |
2999 | *continued_write = 1; | |
3000 | xlog_state_switch_iclogs(log, iclog, iclog->ic_size); | |
3001 | } | |
3002 | *iclogp = iclog; | |
3003 | ||
3004 | ASSERT(iclog->ic_offset <= iclog->ic_size); | |
b22cd72c | 3005 | spin_unlock(&log->l_icloglock); |
1da177e4 LT |
3006 | |
3007 | *logoffsetp = log_offset; | |
3008 | return 0; | |
b843299b | 3009 | } |
1da177e4 | 3010 | |
8b41e3f9 | 3011 | /* |
b843299b DC |
3012 | * The first cnt-1 times a ticket goes through here we don't need to move the |
3013 | * grant write head because the permanent reservation has reserved cnt times the | |
3014 | * unit amount. Release part of current permanent unit reservation and reset | |
3015 | * current reservation to be one units worth. Also move grant reservation head | |
3016 | * forward. | |
1da177e4 | 3017 | */ |
8b41e3f9 CH |
3018 | void |
3019 | xfs_log_ticket_regrant( | |
9a8d2fdb MT |
3020 | struct xlog *log, |
3021 | struct xlog_ticket *ticket) | |
1da177e4 | 3022 | { |
8b41e3f9 | 3023 | trace_xfs_log_ticket_regrant(log, ticket); |
0b1b213f | 3024 | |
1da177e4 LT |
3025 | if (ticket->t_cnt > 0) |
3026 | ticket->t_cnt--; | |
3027 | ||
28496968 | 3028 | xlog_grant_sub_space(log, &log->l_reserve_head.grant, |
a69ed03c | 3029 | ticket->t_curr_res); |
28496968 | 3030 | xlog_grant_sub_space(log, &log->l_write_head.grant, |
a69ed03c | 3031 | ticket->t_curr_res); |
1da177e4 | 3032 | ticket->t_curr_res = ticket->t_unit_res; |
0adba536 | 3033 | xlog_tic_reset_res(ticket); |
0b1b213f | 3034 | |
8b41e3f9 | 3035 | trace_xfs_log_ticket_regrant_sub(log, ticket); |
0b1b213f | 3036 | |
1da177e4 | 3037 | /* just return if we still have some of the pre-reserved space */ |
8b41e3f9 CH |
3038 | if (!ticket->t_cnt) { |
3039 | xlog_grant_add_space(log, &log->l_reserve_head.grant, | |
3040 | ticket->t_unit_res); | |
3041 | trace_xfs_log_ticket_regrant_exit(log, ticket); | |
1da177e4 | 3042 | |
8b41e3f9 CH |
3043 | ticket->t_curr_res = ticket->t_unit_res; |
3044 | xlog_tic_reset_res(ticket); | |
3045 | } | |
1da177e4 | 3046 | |
8b41e3f9 CH |
3047 | xfs_log_ticket_put(ticket); |
3048 | } | |
1da177e4 LT |
3049 | |
3050 | /* | |
3051 | * Give back the space left from a reservation. | |
3052 | * | |
3053 | * All the information we need to make a correct determination of space left | |
3054 | * is present. For non-permanent reservations, things are quite easy. The | |
3055 | * count should have been decremented to zero. We only need to deal with the | |
3056 | * space remaining in the current reservation part of the ticket. If the | |
3057 | * ticket contains a permanent reservation, there may be left over space which | |
3058 | * needs to be released. A count of N means that N-1 refills of the current | |
3059 | * reservation can be done before we need to ask for more space. The first | |
3060 | * one goes to fill up the first current reservation. Once we run out of | |
3061 | * space, the count will stay at zero and the only space remaining will be | |
3062 | * in the current reservation field. | |
3063 | */ | |
8b41e3f9 CH |
3064 | void |
3065 | xfs_log_ticket_ungrant( | |
9a8d2fdb MT |
3066 | struct xlog *log, |
3067 | struct xlog_ticket *ticket) | |
1da177e4 | 3068 | { |
8b41e3f9 CH |
3069 | int bytes; |
3070 | ||
3071 | trace_xfs_log_ticket_ungrant(log, ticket); | |
663e496a | 3072 | |
1da177e4 LT |
3073 | if (ticket->t_cnt > 0) |
3074 | ticket->t_cnt--; | |
3075 | ||
8b41e3f9 | 3076 | trace_xfs_log_ticket_ungrant_sub(log, ticket); |
1da177e4 | 3077 | |
663e496a DC |
3078 | /* |
3079 | * If this is a permanent reservation ticket, we may be able to free | |
1da177e4 LT |
3080 | * up more space based on the remaining count. |
3081 | */ | |
663e496a | 3082 | bytes = ticket->t_curr_res; |
1da177e4 LT |
3083 | if (ticket->t_cnt > 0) { |
3084 | ASSERT(ticket->t_flags & XLOG_TIC_PERM_RESERV); | |
663e496a | 3085 | bytes += ticket->t_unit_res*ticket->t_cnt; |
1da177e4 LT |
3086 | } |
3087 | ||
28496968 CH |
3088 | xlog_grant_sub_space(log, &log->l_reserve_head.grant, bytes); |
3089 | xlog_grant_sub_space(log, &log->l_write_head.grant, bytes); | |
663e496a | 3090 | |
8b41e3f9 | 3091 | trace_xfs_log_ticket_ungrant_exit(log, ticket); |
0b1b213f | 3092 | |
cfb7cdca | 3093 | xfs_log_space_wake(log->l_mp); |
8b41e3f9 | 3094 | xfs_log_ticket_put(ticket); |
09a423a3 | 3095 | } |
1da177e4 | 3096 | |
1da177e4 | 3097 | /* |
b843299b DC |
3098 | * This routine will mark the current iclog in the ring as WANT_SYNC and move |
3099 | * the current iclog pointer to the next iclog in the ring. | |
1da177e4 LT |
3100 | */ |
3101 | STATIC void | |
9a8d2fdb MT |
3102 | xlog_state_switch_iclogs( |
3103 | struct xlog *log, | |
3104 | struct xlog_in_core *iclog, | |
3105 | int eventual_size) | |
1da177e4 LT |
3106 | { |
3107 | ASSERT(iclog->ic_state == XLOG_STATE_ACTIVE); | |
69363999 | 3108 | assert_spin_locked(&log->l_icloglock); |
956f6daa | 3109 | trace_xlog_iclog_switch(iclog, _RET_IP_); |
69363999 | 3110 | |
1da177e4 LT |
3111 | if (!eventual_size) |
3112 | eventual_size = iclog->ic_offset; | |
3113 | iclog->ic_state = XLOG_STATE_WANT_SYNC; | |
b53e675d | 3114 | iclog->ic_header.h_prev_block = cpu_to_be32(log->l_prev_block); |
1da177e4 LT |
3115 | log->l_prev_block = log->l_curr_block; |
3116 | log->l_prev_cycle = log->l_curr_cycle; | |
3117 | ||
3118 | /* roll log?: ic_offset changed later */ | |
3119 | log->l_curr_block += BTOBB(eventual_size)+BTOBB(log->l_iclog_hsize); | |
3120 | ||
3121 | /* Round up to next log-sunit */ | |
a6a65fef | 3122 | if (log->l_iclog_roundoff > BBSIZE) { |
18842e0a | 3123 | uint32_t sunit_bb = BTOBB(log->l_iclog_roundoff); |
1da177e4 LT |
3124 | log->l_curr_block = roundup(log->l_curr_block, sunit_bb); |
3125 | } | |
3126 | ||
3127 | if (log->l_curr_block >= log->l_logBBsize) { | |
a45086e2 BF |
3128 | /* |
3129 | * Rewind the current block before the cycle is bumped to make | |
3130 | * sure that the combined LSN never transiently moves forward | |
3131 | * when the log wraps to the next cycle. This is to support the | |
3132 | * unlocked sample of these fields from xlog_valid_lsn(). Most | |
3133 | * other cases should acquire l_icloglock. | |
3134 | */ | |
3135 | log->l_curr_block -= log->l_logBBsize; | |
3136 | ASSERT(log->l_curr_block >= 0); | |
3137 | smp_wmb(); | |
1da177e4 LT |
3138 | log->l_curr_cycle++; |
3139 | if (log->l_curr_cycle == XLOG_HEADER_MAGIC_NUM) | |
3140 | log->l_curr_cycle++; | |
1da177e4 LT |
3141 | } |
3142 | ASSERT(iclog == log->l_iclog); | |
3143 | log->l_iclog = iclog->ic_next; | |
b843299b | 3144 | } |
1da177e4 | 3145 | |
1da177e4 LT |
3146 | /* |
3147 | * Write out all data in the in-core log as of this exact moment in time. | |
3148 | * | |
3149 | * Data may be written to the in-core log during this call. However, | |
3150 | * we don't guarantee this data will be written out. A change from past | |
3151 | * implementation means this routine will *not* write out zero length LRs. | |
3152 | * | |
3153 | * Basically, we try and perform an intelligent scan of the in-core logs. | |
3154 | * If we determine there is no flushable data, we just return. There is no | |
3155 | * flushable data if: | |
3156 | * | |
3157 | * 1. the current iclog is active and has no data; the previous iclog | |
3158 | * is in the active or dirty state. | |
3159 | * 2. the current iclog is drity, and the previous iclog is in the | |
3160 | * active or dirty state. | |
3161 | * | |
12017faf | 3162 | * We may sleep if: |
1da177e4 LT |
3163 | * |
3164 | * 1. the current iclog is not in the active nor dirty state. | |
3165 | * 2. the current iclog dirty, and the previous iclog is not in the | |
3166 | * active nor dirty state. | |
3167 | * 3. the current iclog is active, and there is another thread writing | |
3168 | * to this particular iclog. | |
3169 | * 4. a) the current iclog is active and has no other writers | |
3170 | * b) when we return from flushing out this iclog, it is still | |
3171 | * not in the active nor dirty state. | |
3172 | */ | |
a14a348b | 3173 | int |
60e5bb78 | 3174 | xfs_log_force( |
a14a348b | 3175 | struct xfs_mount *mp, |
60e5bb78 | 3176 | uint flags) |
1da177e4 | 3177 | { |
ad223e60 | 3178 | struct xlog *log = mp->m_log; |
a14a348b CH |
3179 | struct xlog_in_core *iclog; |
3180 | xfs_lsn_t lsn; | |
3181 | ||
ff6d6af2 | 3182 | XFS_STATS_INC(mp, xs_log_force); |
60e5bb78 | 3183 | trace_xfs_log_force(mp, 0, _RET_IP_); |
1da177e4 | 3184 | |
93b8a585 | 3185 | xlog_cil_force(log); |
71e330b5 | 3186 | |
b22cd72c | 3187 | spin_lock(&log->l_icloglock); |
1da177e4 | 3188 | iclog = log->l_iclog; |
1858bb0b | 3189 | if (iclog->ic_state == XLOG_STATE_IOERROR) |
e6b96570 | 3190 | goto out_error; |
1da177e4 | 3191 | |
956f6daa DC |
3192 | trace_xlog_iclog_force(iclog, _RET_IP_); |
3193 | ||
e6b96570 CH |
3194 | if (iclog->ic_state == XLOG_STATE_DIRTY || |
3195 | (iclog->ic_state == XLOG_STATE_ACTIVE && | |
3196 | atomic_read(&iclog->ic_refcnt) == 0 && iclog->ic_offset == 0)) { | |
1da177e4 | 3197 | /* |
e6b96570 CH |
3198 | * If the head is dirty or (active and empty), then we need to |
3199 | * look at the previous iclog. | |
3200 | * | |
3201 | * If the previous iclog is active or dirty we are done. There | |
3202 | * is nothing to sync out. Otherwise, we attach ourselves to the | |
1da177e4 LT |
3203 | * previous iclog and go to sleep. |
3204 | */ | |
e6b96570 | 3205 | iclog = iclog->ic_prev; |
e6b96570 CH |
3206 | } else if (iclog->ic_state == XLOG_STATE_ACTIVE) { |
3207 | if (atomic_read(&iclog->ic_refcnt) == 0) { | |
45eddb41 | 3208 | /* We have exclusive access to this iclog. */ |
e6b96570 | 3209 | lsn = be64_to_cpu(iclog->ic_header.h_lsn); |
45eddb41 | 3210 | if (xlog_force_iclog(iclog)) |
df732b29 | 3211 | goto out_error; |
1da177e4 | 3212 | |
81e5b50a | 3213 | if (be64_to_cpu(iclog->ic_header.h_lsn) != lsn) |
e6b96570 CH |
3214 | goto out_unlock; |
3215 | } else { | |
3216 | /* | |
2bf1ec0f DC |
3217 | * Someone else is still writing to this iclog, so we |
3218 | * need to ensure that when they release the iclog it | |
3219 | * gets synced immediately as we may be waiting on it. | |
e6b96570 CH |
3220 | */ |
3221 | xlog_state_switch_iclogs(log, iclog, 0); | |
1da177e4 | 3222 | } |
1da177e4 | 3223 | } |
e6b96570 | 3224 | |
2bf1ec0f DC |
3225 | /* |
3226 | * The iclog we are about to wait on may contain the checkpoint pushed | |
3227 | * by the above xlog_cil_force() call, but it may not have been pushed | |
3228 | * to disk yet. Like the ACTIVE case above, we need to make sure caches | |
3229 | * are flushed when this iclog is written. | |
3230 | */ | |
3231 | if (iclog->ic_state == XLOG_STATE_WANT_SYNC) | |
3232 | iclog->ic_flags |= XLOG_ICL_NEED_FLUSH | XLOG_ICL_NEED_FUA; | |
3233 | ||
81e5b50a CH |
3234 | if (flags & XFS_LOG_SYNC) |
3235 | return xlog_wait_on_iclog(iclog); | |
e6b96570 CH |
3236 | out_unlock: |
3237 | spin_unlock(&log->l_icloglock); | |
3238 | return 0; | |
3239 | out_error: | |
3240 | spin_unlock(&log->l_icloglock); | |
3241 | return -EIO; | |
a14a348b | 3242 | } |
1da177e4 | 3243 | |
3e4da466 | 3244 | static int |
5f9b4b0d DC |
3245 | xlog_force_lsn( |
3246 | struct xlog *log, | |
a14a348b CH |
3247 | xfs_lsn_t lsn, |
3248 | uint flags, | |
3e4da466 CH |
3249 | int *log_flushed, |
3250 | bool already_slept) | |
1da177e4 | 3251 | { |
a14a348b | 3252 | struct xlog_in_core *iclog; |
71e330b5 | 3253 | |
a14a348b CH |
3254 | spin_lock(&log->l_icloglock); |
3255 | iclog = log->l_iclog; | |
1858bb0b | 3256 | if (iclog->ic_state == XLOG_STATE_IOERROR) |
93806299 | 3257 | goto out_error; |
1da177e4 | 3258 | |
93806299 | 3259 | while (be64_to_cpu(iclog->ic_header.h_lsn) != lsn) { |
956f6daa | 3260 | trace_xlog_iclog_force_lsn(iclog, _RET_IP_); |
93806299 CH |
3261 | iclog = iclog->ic_next; |
3262 | if (iclog == log->l_iclog) | |
3263 | goto out_unlock; | |
3264 | } | |
a14a348b | 3265 | |
2bf1ec0f DC |
3266 | switch (iclog->ic_state) { |
3267 | case XLOG_STATE_ACTIVE: | |
93806299 CH |
3268 | /* |
3269 | * We sleep here if we haven't already slept (e.g. this is the | |
3270 | * first time we've looked at the correct iclog buf) and the | |
3271 | * buffer before us is going to be sync'ed. The reason for this | |
3272 | * is that if we are doing sync transactions here, by waiting | |
3273 | * for the previous I/O to complete, we can allow a few more | |
3274 | * transactions into this iclog before we close it down. | |
3275 | * | |
3276 | * Otherwise, we mark the buffer WANT_SYNC, and bump up the | |
3277 | * refcnt so we can release the log (which drops the ref count). | |
3278 | * The state switch keeps new transaction commits from using | |
3279 | * this buffer. When the current commits finish writing into | |
3280 | * the buffer, the refcount will drop to zero and the buffer | |
3281 | * will go out then. | |
3282 | */ | |
3283 | if (!already_slept && | |
1858bb0b CH |
3284 | (iclog->ic_prev->ic_state == XLOG_STATE_WANT_SYNC || |
3285 | iclog->ic_prev->ic_state == XLOG_STATE_SYNCING)) { | |
93806299 CH |
3286 | xlog_wait(&iclog->ic_prev->ic_write_wait, |
3287 | &log->l_icloglock); | |
3e4da466 | 3288 | return -EAGAIN; |
1da177e4 | 3289 | } |
45eddb41 | 3290 | if (xlog_force_iclog(iclog)) |
df732b29 | 3291 | goto out_error; |
93806299 CH |
3292 | if (log_flushed) |
3293 | *log_flushed = 1; | |
2bf1ec0f DC |
3294 | break; |
3295 | case XLOG_STATE_WANT_SYNC: | |
3296 | /* | |
3297 | * This iclog may contain the checkpoint pushed by the | |
3298 | * xlog_cil_force_seq() call, but there are other writers still | |
3299 | * accessing it so it hasn't been pushed to disk yet. Like the | |
3300 | * ACTIVE case above, we need to make sure caches are flushed | |
3301 | * when this iclog is written. | |
3302 | */ | |
3303 | iclog->ic_flags |= XLOG_ICL_NEED_FLUSH | XLOG_ICL_NEED_FUA; | |
3304 | break; | |
3305 | default: | |
3306 | /* | |
3307 | * The entire checkpoint was written by the CIL force and is on | |
3308 | * its way to disk already. It will be stable when it | |
3309 | * completes, so we don't need to manipulate caches here at all. | |
3310 | * We just need to wait for completion if necessary. | |
3311 | */ | |
3312 | break; | |
93806299 | 3313 | } |
1da177e4 | 3314 | |
81e5b50a CH |
3315 | if (flags & XFS_LOG_SYNC) |
3316 | return xlog_wait_on_iclog(iclog); | |
93806299 | 3317 | out_unlock: |
a14a348b CH |
3318 | spin_unlock(&log->l_icloglock); |
3319 | return 0; | |
93806299 CH |
3320 | out_error: |
3321 | spin_unlock(&log->l_icloglock); | |
3322 | return -EIO; | |
a14a348b CH |
3323 | } |
3324 | ||
3e4da466 CH |
3325 | /* |
3326 | * Force the in-core log to disk for a specific LSN. | |
3327 | * | |
3328 | * Find in-core log with lsn. | |
3329 | * If it is in the DIRTY state, just return. | |
3330 | * If it is in the ACTIVE state, move the in-core log into the WANT_SYNC | |
3331 | * state and go to sleep or return. | |
3332 | * If it is in any other state, go to sleep or return. | |
3333 | * | |
3334 | * Synchronous forces are implemented with a wait queue. All callers trying | |
3335 | * to force a given lsn to disk must wait on the queue attached to the | |
3336 | * specific in-core log. When given in-core log finally completes its write | |
3337 | * to disk, that thread will wake up all threads waiting on the queue. | |
3338 | */ | |
3339 | int | |
5f9b4b0d | 3340 | xfs_log_force_seq( |
3e4da466 | 3341 | struct xfs_mount *mp, |
5f9b4b0d | 3342 | xfs_csn_t seq, |
3e4da466 CH |
3343 | uint flags, |
3344 | int *log_flushed) | |
3345 | { | |
5f9b4b0d DC |
3346 | struct xlog *log = mp->m_log; |
3347 | xfs_lsn_t lsn; | |
3e4da466 | 3348 | int ret; |
5f9b4b0d | 3349 | ASSERT(seq != 0); |
3e4da466 CH |
3350 | |
3351 | XFS_STATS_INC(mp, xs_log_force); | |
5f9b4b0d | 3352 | trace_xfs_log_force(mp, seq, _RET_IP_); |
3e4da466 | 3353 | |
5f9b4b0d | 3354 | lsn = xlog_cil_force_seq(log, seq); |
3e4da466 CH |
3355 | if (lsn == NULLCOMMITLSN) |
3356 | return 0; | |
3357 | ||
5f9b4b0d DC |
3358 | ret = xlog_force_lsn(log, lsn, flags, log_flushed, false); |
3359 | if (ret == -EAGAIN) { | |
3360 | XFS_STATS_INC(mp, xs_log_force_sleep); | |
3361 | ret = xlog_force_lsn(log, lsn, flags, log_flushed, true); | |
3362 | } | |
3e4da466 CH |
3363 | return ret; |
3364 | } | |
3365 | ||
1da177e4 | 3366 | /* |
9da096fd | 3367 | * Free a used ticket when its refcount falls to zero. |
1da177e4 | 3368 | */ |
cc09c0dc DC |
3369 | void |
3370 | xfs_log_ticket_put( | |
3371 | xlog_ticket_t *ticket) | |
1da177e4 | 3372 | { |
cc09c0dc | 3373 | ASSERT(atomic_read(&ticket->t_ref) > 0); |
eb40a875 | 3374 | if (atomic_dec_and_test(&ticket->t_ref)) |
377bcd5f | 3375 | kmem_cache_free(xfs_log_ticket_zone, ticket); |
cc09c0dc | 3376 | } |
1da177e4 | 3377 | |
cc09c0dc DC |
3378 | xlog_ticket_t * |
3379 | xfs_log_ticket_get( | |
3380 | xlog_ticket_t *ticket) | |
3381 | { | |
3382 | ASSERT(atomic_read(&ticket->t_ref) > 0); | |
3383 | atomic_inc(&ticket->t_ref); | |
3384 | return ticket; | |
3385 | } | |
1da177e4 LT |
3386 | |
3387 | /* | |
e773fc93 JL |
3388 | * Figure out the total log space unit (in bytes) that would be |
3389 | * required for a log ticket. | |
1da177e4 | 3390 | */ |
a6a65fef DC |
3391 | static int |
3392 | xlog_calc_unit_res( | |
3393 | struct xlog *log, | |
e773fc93 | 3394 | int unit_bytes) |
1da177e4 | 3395 | { |
e773fc93 JL |
3396 | int iclog_space; |
3397 | uint num_headers; | |
1da177e4 LT |
3398 | |
3399 | /* | |
3400 | * Permanent reservations have up to 'cnt'-1 active log operations | |
3401 | * in the log. A unit in this case is the amount of space for one | |
3402 | * of these log operations. Normal reservations have a cnt of 1 | |
3403 | * and their unit amount is the total amount of space required. | |
3404 | * | |
3405 | * The following lines of code account for non-transaction data | |
32fb9b57 TS |
3406 | * which occupy space in the on-disk log. |
3407 | * | |
3408 | * Normal form of a transaction is: | |
3409 | * <oph><trans-hdr><start-oph><reg1-oph><reg1><reg2-oph>...<commit-oph> | |
3410 | * and then there are LR hdrs, split-recs and roundoff at end of syncs. | |
3411 | * | |
3412 | * We need to account for all the leadup data and trailer data | |
3413 | * around the transaction data. | |
3414 | * And then we need to account for the worst case in terms of using | |
3415 | * more space. | |
3416 | * The worst case will happen if: | |
3417 | * - the placement of the transaction happens to be such that the | |
3418 | * roundoff is at its maximum | |
3419 | * - the transaction data is synced before the commit record is synced | |
3420 | * i.e. <transaction-data><roundoff> | <commit-rec><roundoff> | |
3421 | * Therefore the commit record is in its own Log Record. | |
3422 | * This can happen as the commit record is called with its | |
3423 | * own region to xlog_write(). | |
3424 | * This then means that in the worst case, roundoff can happen for | |
3425 | * the commit-rec as well. | |
3426 | * The commit-rec is smaller than padding in this scenario and so it is | |
3427 | * not added separately. | |
1da177e4 LT |
3428 | */ |
3429 | ||
32fb9b57 TS |
3430 | /* for trans header */ |
3431 | unit_bytes += sizeof(xlog_op_header_t); | |
3432 | unit_bytes += sizeof(xfs_trans_header_t); | |
3433 | ||
1da177e4 | 3434 | /* for start-rec */ |
32fb9b57 TS |
3435 | unit_bytes += sizeof(xlog_op_header_t); |
3436 | ||
9b9fc2b7 DC |
3437 | /* |
3438 | * for LR headers - the space for data in an iclog is the size minus | |
3439 | * the space used for the headers. If we use the iclog size, then we | |
3440 | * undercalculate the number of headers required. | |
3441 | * | |
3442 | * Furthermore - the addition of op headers for split-recs might | |
3443 | * increase the space required enough to require more log and op | |
3444 | * headers, so take that into account too. | |
3445 | * | |
3446 | * IMPORTANT: This reservation makes the assumption that if this | |
3447 | * transaction is the first in an iclog and hence has the LR headers | |
3448 | * accounted to it, then the remaining space in the iclog is | |
3449 | * exclusively for this transaction. i.e. if the transaction is larger | |
3450 | * than the iclog, it will be the only thing in that iclog. | |
3451 | * Fundamentally, this means we must pass the entire log vector to | |
3452 | * xlog_write to guarantee this. | |
3453 | */ | |
3454 | iclog_space = log->l_iclog_size - log->l_iclog_hsize; | |
3455 | num_headers = howmany(unit_bytes, iclog_space); | |
3456 | ||
3457 | /* for split-recs - ophdrs added when data split over LRs */ | |
3458 | unit_bytes += sizeof(xlog_op_header_t) * num_headers; | |
3459 | ||
3460 | /* add extra header reservations if we overrun */ | |
3461 | while (!num_headers || | |
3462 | howmany(unit_bytes, iclog_space) > num_headers) { | |
3463 | unit_bytes += sizeof(xlog_op_header_t); | |
3464 | num_headers++; | |
3465 | } | |
32fb9b57 | 3466 | unit_bytes += log->l_iclog_hsize * num_headers; |
1da177e4 | 3467 | |
32fb9b57 TS |
3468 | /* for commit-rec LR header - note: padding will subsume the ophdr */ |
3469 | unit_bytes += log->l_iclog_hsize; | |
3470 | ||
a6a65fef DC |
3471 | /* roundoff padding for transaction data and one for commit record */ |
3472 | unit_bytes += 2 * log->l_iclog_roundoff; | |
1da177e4 | 3473 | |
e773fc93 JL |
3474 | return unit_bytes; |
3475 | } | |
3476 | ||
a6a65fef DC |
3477 | int |
3478 | xfs_log_calc_unit_res( | |
3479 | struct xfs_mount *mp, | |
3480 | int unit_bytes) | |
3481 | { | |
3482 | return xlog_calc_unit_res(mp->m_log, unit_bytes); | |
3483 | } | |
3484 | ||
e773fc93 JL |
3485 | /* |
3486 | * Allocate and initialise a new log ticket. | |
3487 | */ | |
3488 | struct xlog_ticket * | |
3489 | xlog_ticket_alloc( | |
3490 | struct xlog *log, | |
3491 | int unit_bytes, | |
3492 | int cnt, | |
3493 | char client, | |
ca4f2589 | 3494 | bool permanent) |
e773fc93 JL |
3495 | { |
3496 | struct xlog_ticket *tic; | |
3497 | int unit_res; | |
3498 | ||
ca4f2589 | 3499 | tic = kmem_cache_zalloc(xfs_log_ticket_zone, GFP_NOFS | __GFP_NOFAIL); |
e773fc93 | 3500 | |
a6a65fef | 3501 | unit_res = xlog_calc_unit_res(log, unit_bytes); |
e773fc93 | 3502 | |
cc09c0dc | 3503 | atomic_set(&tic->t_ref, 1); |
14a7235f | 3504 | tic->t_task = current; |
10547941 | 3505 | INIT_LIST_HEAD(&tic->t_queue); |
e773fc93 JL |
3506 | tic->t_unit_res = unit_res; |
3507 | tic->t_curr_res = unit_res; | |
1da177e4 LT |
3508 | tic->t_cnt = cnt; |
3509 | tic->t_ocnt = cnt; | |
ecb3403d | 3510 | tic->t_tid = prandom_u32(); |
1da177e4 | 3511 | tic->t_clientid = client; |
9006fb91 | 3512 | if (permanent) |
1da177e4 | 3513 | tic->t_flags |= XLOG_TIC_PERM_RESERV; |
1da177e4 | 3514 | |
0adba536 | 3515 | xlog_tic_reset_res(tic); |
7e9c6396 | 3516 | |
1da177e4 | 3517 | return tic; |
cc09c0dc | 3518 | } |
1da177e4 | 3519 | |
cfcbbbd0 | 3520 | #if defined(DEBUG) |
1da177e4 LT |
3521 | /* |
3522 | * Make sure that the destination ptr is within the valid data region of | |
3523 | * one of the iclogs. This uses backup pointers stored in a different | |
3524 | * part of the log in case we trash the log structure. | |
3525 | */ | |
181fdfe6 | 3526 | STATIC void |
e6b1f273 | 3527 | xlog_verify_dest_ptr( |
ad223e60 | 3528 | struct xlog *log, |
5809d5e0 | 3529 | void *ptr) |
1da177e4 LT |
3530 | { |
3531 | int i; | |
3532 | int good_ptr = 0; | |
3533 | ||
e6b1f273 CH |
3534 | for (i = 0; i < log->l_iclog_bufs; i++) { |
3535 | if (ptr >= log->l_iclog_bak[i] && | |
3536 | ptr <= log->l_iclog_bak[i] + log->l_iclog_size) | |
1da177e4 LT |
3537 | good_ptr++; |
3538 | } | |
e6b1f273 CH |
3539 | |
3540 | if (!good_ptr) | |
a0fa2b67 | 3541 | xfs_emerg(log->l_mp, "%s: invalid ptr", __func__); |
e6b1f273 | 3542 | } |
1da177e4 | 3543 | |
da8a1a4a DC |
3544 | /* |
3545 | * Check to make sure the grant write head didn't just over lap the tail. If | |
3546 | * the cycles are the same, we can't be overlapping. Otherwise, make sure that | |
3547 | * the cycles differ by exactly one and check the byte count. | |
3548 | * | |
3549 | * This check is run unlocked, so can give false positives. Rather than assert | |
3550 | * on failures, use a warn-once flag and a panic tag to allow the admin to | |
3551 | * determine if they want to panic the machine when such an error occurs. For | |
3552 | * debug kernels this will have the same effect as using an assert but, unlinke | |
3553 | * an assert, it can be turned off at runtime. | |
3554 | */ | |
3f336c6f DC |
3555 | STATIC void |
3556 | xlog_verify_grant_tail( | |
ad223e60 | 3557 | struct xlog *log) |
3f336c6f | 3558 | { |
1c3cb9ec | 3559 | int tail_cycle, tail_blocks; |
a69ed03c | 3560 | int cycle, space; |
3f336c6f | 3561 | |
28496968 | 3562 | xlog_crack_grant_head(&log->l_write_head.grant, &cycle, &space); |
1c3cb9ec DC |
3563 | xlog_crack_atomic_lsn(&log->l_tail_lsn, &tail_cycle, &tail_blocks); |
3564 | if (tail_cycle != cycle) { | |
da8a1a4a DC |
3565 | if (cycle - 1 != tail_cycle && |
3566 | !(log->l_flags & XLOG_TAIL_WARN)) { | |
3567 | xfs_alert_tag(log->l_mp, XFS_PTAG_LOGRES, | |
3568 | "%s: cycle - 1 != tail_cycle", __func__); | |
3569 | log->l_flags |= XLOG_TAIL_WARN; | |
3570 | } | |
3571 | ||
3572 | if (space > BBTOB(tail_blocks) && | |
3573 | !(log->l_flags & XLOG_TAIL_WARN)) { | |
3574 | xfs_alert_tag(log->l_mp, XFS_PTAG_LOGRES, | |
3575 | "%s: space > BBTOB(tail_blocks)", __func__); | |
3576 | log->l_flags |= XLOG_TAIL_WARN; | |
3577 | } | |
3f336c6f DC |
3578 | } |
3579 | } | |
3580 | ||
1da177e4 LT |
3581 | /* check if it will fit */ |
3582 | STATIC void | |
9a8d2fdb MT |
3583 | xlog_verify_tail_lsn( |
3584 | struct xlog *log, | |
3585 | struct xlog_in_core *iclog, | |
3586 | xfs_lsn_t tail_lsn) | |
1da177e4 LT |
3587 | { |
3588 | int blocks; | |
3589 | ||
3590 | if (CYCLE_LSN(tail_lsn) == log->l_prev_cycle) { | |
3591 | blocks = | |
3592 | log->l_logBBsize - (log->l_prev_block - BLOCK_LSN(tail_lsn)); | |
3593 | if (blocks < BTOBB(iclog->ic_offset)+BTOBB(log->l_iclog_hsize)) | |
a0fa2b67 | 3594 | xfs_emerg(log->l_mp, "%s: ran out of log space", __func__); |
1da177e4 LT |
3595 | } else { |
3596 | ASSERT(CYCLE_LSN(tail_lsn)+1 == log->l_prev_cycle); | |
3597 | ||
3598 | if (BLOCK_LSN(tail_lsn) == log->l_prev_block) | |
a0fa2b67 | 3599 | xfs_emerg(log->l_mp, "%s: tail wrapped", __func__); |
1da177e4 LT |
3600 | |
3601 | blocks = BLOCK_LSN(tail_lsn) - log->l_prev_block; | |
3602 | if (blocks < BTOBB(iclog->ic_offset) + 1) | |
a0fa2b67 | 3603 | xfs_emerg(log->l_mp, "%s: ran out of log space", __func__); |
1da177e4 | 3604 | } |
b843299b | 3605 | } |
1da177e4 LT |
3606 | |
3607 | /* | |
3608 | * Perform a number of checks on the iclog before writing to disk. | |
3609 | * | |
3610 | * 1. Make sure the iclogs are still circular | |
3611 | * 2. Make sure we have a good magic number | |
3612 | * 3. Make sure we don't have magic numbers in the data | |
3613 | * 4. Check fields of each log operation header for: | |
3614 | * A. Valid client identifier | |
3615 | * B. tid ptr value falls in valid ptr space (user space code) | |
3616 | * C. Length in log record header is correct according to the | |
3617 | * individual operation headers within record. | |
3618 | * 5. When a bwrite will occur within 5 blocks of the front of the physical | |
3619 | * log, check the preceding blocks of the physical log to make sure all | |
3620 | * the cycle numbers agree with the current cycle number. | |
3621 | */ | |
3622 | STATIC void | |
9a8d2fdb MT |
3623 | xlog_verify_iclog( |
3624 | struct xlog *log, | |
3625 | struct xlog_in_core *iclog, | |
abca1f33 | 3626 | int count) |
1da177e4 LT |
3627 | { |
3628 | xlog_op_header_t *ophead; | |
3629 | xlog_in_core_t *icptr; | |
3630 | xlog_in_core_2_t *xhdr; | |
5809d5e0 | 3631 | void *base_ptr, *ptr, *p; |
db9d67d6 | 3632 | ptrdiff_t field_offset; |
c8ce540d | 3633 | uint8_t clientid; |
1da177e4 LT |
3634 | int len, i, j, k, op_len; |
3635 | int idx; | |
1da177e4 LT |
3636 | |
3637 | /* check validity of iclog pointers */ | |
b22cd72c | 3638 | spin_lock(&log->l_icloglock); |
1da177e4 | 3639 | icptr = log->l_iclog; |
643f7c4e GB |
3640 | for (i = 0; i < log->l_iclog_bufs; i++, icptr = icptr->ic_next) |
3641 | ASSERT(icptr); | |
3642 | ||
1da177e4 | 3643 | if (icptr != log->l_iclog) |
a0fa2b67 | 3644 | xfs_emerg(log->l_mp, "%s: corrupt iclog ring", __func__); |
b22cd72c | 3645 | spin_unlock(&log->l_icloglock); |
1da177e4 LT |
3646 | |
3647 | /* check log magic numbers */ | |
69ef921b | 3648 | if (iclog->ic_header.h_magicno != cpu_to_be32(XLOG_HEADER_MAGIC_NUM)) |
a0fa2b67 | 3649 | xfs_emerg(log->l_mp, "%s: invalid magic num", __func__); |
1da177e4 | 3650 | |
5809d5e0 CH |
3651 | base_ptr = ptr = &iclog->ic_header; |
3652 | p = &iclog->ic_header; | |
3653 | for (ptr += BBSIZE; ptr < base_ptr + count; ptr += BBSIZE) { | |
69ef921b | 3654 | if (*(__be32 *)ptr == cpu_to_be32(XLOG_HEADER_MAGIC_NUM)) |
a0fa2b67 DC |
3655 | xfs_emerg(log->l_mp, "%s: unexpected magic num", |
3656 | __func__); | |
1da177e4 LT |
3657 | } |
3658 | ||
3659 | /* check fields */ | |
b53e675d | 3660 | len = be32_to_cpu(iclog->ic_header.h_num_logops); |
5809d5e0 CH |
3661 | base_ptr = ptr = iclog->ic_datap; |
3662 | ophead = ptr; | |
b28708d6 | 3663 | xhdr = iclog->ic_data; |
1da177e4 | 3664 | for (i = 0; i < len; i++) { |
5809d5e0 | 3665 | ophead = ptr; |
1da177e4 LT |
3666 | |
3667 | /* clientid is only 1 byte */ | |
5809d5e0 CH |
3668 | p = &ophead->oh_clientid; |
3669 | field_offset = p - base_ptr; | |
abca1f33 | 3670 | if (field_offset & 0x1ff) { |
1da177e4 LT |
3671 | clientid = ophead->oh_clientid; |
3672 | } else { | |
b2a922cd | 3673 | idx = BTOBBT((char *)&ophead->oh_clientid - iclog->ic_datap); |
1da177e4 LT |
3674 | if (idx >= (XLOG_HEADER_CYCLE_SIZE / BBSIZE)) { |
3675 | j = idx / (XLOG_HEADER_CYCLE_SIZE / BBSIZE); | |
3676 | k = idx % (XLOG_HEADER_CYCLE_SIZE / BBSIZE); | |
03bea6fe CH |
3677 | clientid = xlog_get_client_id( |
3678 | xhdr[j].hic_xheader.xh_cycle_data[k]); | |
1da177e4 | 3679 | } else { |
03bea6fe CH |
3680 | clientid = xlog_get_client_id( |
3681 | iclog->ic_header.h_cycle_data[idx]); | |
1da177e4 LT |
3682 | } |
3683 | } | |
3684 | if (clientid != XFS_TRANSACTION && clientid != XFS_LOG) | |
a0fa2b67 | 3685 | xfs_warn(log->l_mp, |
c9690043 | 3686 | "%s: invalid clientid %d op "PTR_FMT" offset 0x%lx", |
a0fa2b67 DC |
3687 | __func__, clientid, ophead, |
3688 | (unsigned long)field_offset); | |
1da177e4 LT |
3689 | |
3690 | /* check length */ | |
5809d5e0 CH |
3691 | p = &ophead->oh_len; |
3692 | field_offset = p - base_ptr; | |
abca1f33 | 3693 | if (field_offset & 0x1ff) { |
67fcb7bf | 3694 | op_len = be32_to_cpu(ophead->oh_len); |
1da177e4 | 3695 | } else { |
db9d67d6 CH |
3696 | idx = BTOBBT((uintptr_t)&ophead->oh_len - |
3697 | (uintptr_t)iclog->ic_datap); | |
1da177e4 LT |
3698 | if (idx >= (XLOG_HEADER_CYCLE_SIZE / BBSIZE)) { |
3699 | j = idx / (XLOG_HEADER_CYCLE_SIZE / BBSIZE); | |
3700 | k = idx % (XLOG_HEADER_CYCLE_SIZE / BBSIZE); | |
b53e675d | 3701 | op_len = be32_to_cpu(xhdr[j].hic_xheader.xh_cycle_data[k]); |
1da177e4 | 3702 | } else { |
b53e675d | 3703 | op_len = be32_to_cpu(iclog->ic_header.h_cycle_data[idx]); |
1da177e4 LT |
3704 | } |
3705 | } | |
3706 | ptr += sizeof(xlog_op_header_t) + op_len; | |
3707 | } | |
b843299b | 3708 | } |
cfcbbbd0 | 3709 | #endif |
1da177e4 LT |
3710 | |
3711 | /* | |
b22cd72c | 3712 | * Mark all iclogs IOERROR. l_icloglock is held by the caller. |
1da177e4 LT |
3713 | */ |
3714 | STATIC int | |
3715 | xlog_state_ioerror( | |
9a8d2fdb | 3716 | struct xlog *log) |
1da177e4 LT |
3717 | { |
3718 | xlog_in_core_t *iclog, *ic; | |
3719 | ||
3720 | iclog = log->l_iclog; | |
1858bb0b | 3721 | if (iclog->ic_state != XLOG_STATE_IOERROR) { |
1da177e4 LT |
3722 | /* |
3723 | * Mark all the incore logs IOERROR. | |
3724 | * From now on, no log flushes will result. | |
3725 | */ | |
3726 | ic = iclog; | |
3727 | do { | |
3728 | ic->ic_state = XLOG_STATE_IOERROR; | |
3729 | ic = ic->ic_next; | |
3730 | } while (ic != iclog); | |
014c2544 | 3731 | return 0; |
1da177e4 LT |
3732 | } |
3733 | /* | |
3734 | * Return non-zero, if state transition has already happened. | |
3735 | */ | |
014c2544 | 3736 | return 1; |
1da177e4 LT |
3737 | } |
3738 | ||
3739 | /* | |
3740 | * This is called from xfs_force_shutdown, when we're forcibly | |
3741 | * shutting down the filesystem, typically because of an IO error. | |
3742 | * Our main objectives here are to make sure that: | |
a870fe6d DC |
3743 | * a. if !logerror, flush the logs to disk. Anything modified |
3744 | * after this is ignored. | |
3745 | * b. the filesystem gets marked 'SHUTDOWN' for all interested | |
1da177e4 | 3746 | * parties to find out, 'atomically'. |
a870fe6d | 3747 | * c. those who're sleeping on log reservations, pinned objects and |
1da177e4 | 3748 | * other resources get woken up, and be told the bad news. |
a870fe6d | 3749 | * d. nothing new gets queued up after (b) and (c) are done. |
9da1ab18 | 3750 | * |
a870fe6d DC |
3751 | * Note: for the !logerror case we need to flush the regions held in memory out |
3752 | * to disk first. This needs to be done before the log is marked as shutdown, | |
3753 | * otherwise the iclog writes will fail. | |
1da177e4 LT |
3754 | */ |
3755 | int | |
3756 | xfs_log_force_umount( | |
3757 | struct xfs_mount *mp, | |
3758 | int logerror) | |
3759 | { | |
9a8d2fdb | 3760 | struct xlog *log; |
1da177e4 | 3761 | int retval; |
1da177e4 LT |
3762 | |
3763 | log = mp->m_log; | |
3764 | ||
3765 | /* | |
3766 | * If this happens during log recovery, don't worry about | |
3767 | * locking; the log isn't open for business yet. | |
3768 | */ | |
3769 | if (!log || | |
3770 | log->l_flags & XLOG_ACTIVE_RECOVERY) { | |
3771 | mp->m_flags |= XFS_MOUNT_FS_SHUTDOWN; | |
bac8dca9 | 3772 | if (mp->m_sb_bp) |
b0388bf1 | 3773 | mp->m_sb_bp->b_flags |= XBF_DONE; |
014c2544 | 3774 | return 0; |
1da177e4 LT |
3775 | } |
3776 | ||
3777 | /* | |
3778 | * Somebody could've already done the hard work for us. | |
3779 | * No need to get locks for this. | |
3780 | */ | |
1858bb0b | 3781 | if (logerror && log->l_iclog->ic_state == XLOG_STATE_IOERROR) { |
1da177e4 | 3782 | ASSERT(XLOG_FORCED_SHUTDOWN(log)); |
014c2544 | 3783 | return 1; |
1da177e4 | 3784 | } |
9da1ab18 DC |
3785 | |
3786 | /* | |
a870fe6d DC |
3787 | * Flush all the completed transactions to disk before marking the log |
3788 | * being shut down. We need to do it in this order to ensure that | |
3789 | * completed operations are safely on disk before we shut down, and that | |
3790 | * we don't have to issue any buffer IO after the shutdown flags are set | |
3791 | * to guarantee this. | |
9da1ab18 | 3792 | */ |
93b8a585 | 3793 | if (!logerror) |
60e5bb78 | 3794 | xfs_log_force(mp, XFS_LOG_SYNC); |
9da1ab18 | 3795 | |
1da177e4 | 3796 | /* |
3f16b985 DC |
3797 | * mark the filesystem and the as in a shutdown state and wake |
3798 | * everybody up to tell them the bad news. | |
1da177e4 | 3799 | */ |
b22cd72c | 3800 | spin_lock(&log->l_icloglock); |
1da177e4 | 3801 | mp->m_flags |= XFS_MOUNT_FS_SHUTDOWN; |
bac8dca9 | 3802 | if (mp->m_sb_bp) |
b0388bf1 | 3803 | mp->m_sb_bp->b_flags |= XBF_DONE; |
bac8dca9 | 3804 | |
1da177e4 | 3805 | /* |
a870fe6d DC |
3806 | * Mark the log and the iclogs with IO error flags to prevent any |
3807 | * further log IO from being issued or completed. | |
1da177e4 LT |
3808 | */ |
3809 | log->l_flags |= XLOG_IO_ERROR; | |
a870fe6d | 3810 | retval = xlog_state_ioerror(log); |
b22cd72c | 3811 | spin_unlock(&log->l_icloglock); |
1da177e4 LT |
3812 | |
3813 | /* | |
10547941 DC |
3814 | * We don't want anybody waiting for log reservations after this. That |
3815 | * means we have to wake up everybody queued up on reserveq as well as | |
3816 | * writeq. In addition, we make sure in xlog_{re}grant_log_space that | |
3817 | * we don't enqueue anything once the SHUTDOWN flag is set, and this | |
3f16b985 | 3818 | * action is protected by the grant locks. |
1da177e4 | 3819 | */ |
a79bf2d7 CH |
3820 | xlog_grant_head_wake_all(&log->l_reserve_head); |
3821 | xlog_grant_head_wake_all(&log->l_write_head); | |
1da177e4 | 3822 | |
1da177e4 | 3823 | /* |
ac983517 DC |
3824 | * Wake up everybody waiting on xfs_log_force. Wake the CIL push first |
3825 | * as if the log writes were completed. The abort handling in the log | |
3826 | * item committed callback functions will do this again under lock to | |
3827 | * avoid races. | |
1da177e4 | 3828 | */ |
cdea5459 | 3829 | spin_lock(&log->l_cilp->xc_push_lock); |
ac983517 | 3830 | wake_up_all(&log->l_cilp->xc_commit_wait); |
cdea5459 | 3831 | spin_unlock(&log->l_cilp->xc_push_lock); |
12e6a0f4 | 3832 | xlog_state_do_callback(log); |
1da177e4 | 3833 | |
1da177e4 | 3834 | /* return non-zero if log IOERROR transition had already happened */ |
014c2544 | 3835 | return retval; |
1da177e4 LT |
3836 | } |
3837 | ||
ba0f32d4 | 3838 | STATIC int |
9a8d2fdb MT |
3839 | xlog_iclogs_empty( |
3840 | struct xlog *log) | |
1da177e4 LT |
3841 | { |
3842 | xlog_in_core_t *iclog; | |
3843 | ||
3844 | iclog = log->l_iclog; | |
3845 | do { | |
3846 | /* endianness does not matter here, zero is zero in | |
3847 | * any language. | |
3848 | */ | |
3849 | if (iclog->ic_header.h_num_logops) | |
014c2544 | 3850 | return 0; |
1da177e4 LT |
3851 | iclog = iclog->ic_next; |
3852 | } while (iclog != log->l_iclog); | |
014c2544 | 3853 | return 1; |
1da177e4 | 3854 | } |
f661f1e0 | 3855 | |
a45086e2 BF |
3856 | /* |
3857 | * Verify that an LSN stamped into a piece of metadata is valid. This is | |
3858 | * intended for use in read verifiers on v5 superblocks. | |
3859 | */ | |
3860 | bool | |
3861 | xfs_log_check_lsn( | |
3862 | struct xfs_mount *mp, | |
3863 | xfs_lsn_t lsn) | |
3864 | { | |
3865 | struct xlog *log = mp->m_log; | |
3866 | bool valid; | |
3867 | ||
3868 | /* | |
3869 | * norecovery mode skips mount-time log processing and unconditionally | |
3870 | * resets the in-core LSN. We can't validate in this mode, but | |
3871 | * modifications are not allowed anyways so just return true. | |
3872 | */ | |
3873 | if (mp->m_flags & XFS_MOUNT_NORECOVERY) | |
3874 | return true; | |
3875 | ||
3876 | /* | |
3877 | * Some metadata LSNs are initialized to NULL (e.g., the agfl). This is | |
3878 | * handled by recovery and thus safe to ignore here. | |
3879 | */ | |
3880 | if (lsn == NULLCOMMITLSN) | |
3881 | return true; | |
3882 | ||
3883 | valid = xlog_valid_lsn(mp->m_log, lsn); | |
3884 | ||
3885 | /* warn the user about what's gone wrong before verifier failure */ | |
3886 | if (!valid) { | |
3887 | spin_lock(&log->l_icloglock); | |
3888 | xfs_warn(mp, | |
3889 | "Corruption warning: Metadata has LSN (%d:%d) ahead of current LSN (%d:%d). " | |
3890 | "Please unmount and run xfs_repair (>= v4.3) to resolve.", | |
3891 | CYCLE_LSN(lsn), BLOCK_LSN(lsn), | |
3892 | log->l_curr_cycle, log->l_curr_block); | |
3893 | spin_unlock(&log->l_icloglock); | |
3894 | } | |
3895 | ||
3896 | return valid; | |
3897 | } | |
0c60d3aa DW |
3898 | |
3899 | bool | |
3900 | xfs_log_in_recovery( | |
3901 | struct xfs_mount *mp) | |
3902 | { | |
3903 | struct xlog *log = mp->m_log; | |
3904 | ||
3905 | return log->l_flags & XLOG_ACTIVE_RECOVERY; | |
3906 | } |