Commit | Line | Data |
---|---|---|
71e330b5 DC |
1 | /* |
2 | * Copyright (c) 2010 Red Hat, Inc. All Rights Reserved. | |
3 | * | |
4 | * This program is free software; you can redistribute it and/or | |
5 | * modify it under the terms of the GNU General Public License as | |
6 | * published by the Free Software Foundation. | |
7 | * | |
8 | * This program is distributed in the hope that it would be useful, | |
9 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
10 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
11 | * GNU General Public License for more details. | |
12 | * | |
13 | * You should have received a copy of the GNU General Public License | |
14 | * along with this program; if not, write the Free Software Foundation, | |
15 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA | |
16 | */ | |
17 | ||
18 | #include "xfs.h" | |
19 | #include "xfs_fs.h" | |
20 | #include "xfs_types.h" | |
21 | #include "xfs_bit.h" | |
22 | #include "xfs_log.h" | |
23 | #include "xfs_inum.h" | |
24 | #include "xfs_trans.h" | |
25 | #include "xfs_trans_priv.h" | |
26 | #include "xfs_log_priv.h" | |
27 | #include "xfs_sb.h" | |
28 | #include "xfs_ag.h" | |
71e330b5 DC |
29 | #include "xfs_mount.h" |
30 | #include "xfs_error.h" | |
31 | #include "xfs_alloc.h" | |
32 | ||
33 | /* | |
34 | * Perform initial CIL structure initialisation. If the CIL is not | |
35 | * enabled in this filesystem, ensure the log->l_cilp is null so | |
36 | * we can check this conditional to determine if we are doing delayed | |
37 | * logging or not. | |
38 | */ | |
39 | int | |
40 | xlog_cil_init( | |
41 | struct log *log) | |
42 | { | |
43 | struct xfs_cil *cil; | |
44 | struct xfs_cil_ctx *ctx; | |
45 | ||
46 | log->l_cilp = NULL; | |
47 | if (!(log->l_mp->m_flags & XFS_MOUNT_DELAYLOG)) | |
48 | return 0; | |
49 | ||
50 | cil = kmem_zalloc(sizeof(*cil), KM_SLEEP|KM_MAYFAIL); | |
51 | if (!cil) | |
52 | return ENOMEM; | |
53 | ||
54 | ctx = kmem_zalloc(sizeof(*ctx), KM_SLEEP|KM_MAYFAIL); | |
55 | if (!ctx) { | |
56 | kmem_free(cil); | |
57 | return ENOMEM; | |
58 | } | |
59 | ||
60 | INIT_LIST_HEAD(&cil->xc_cil); | |
61 | INIT_LIST_HEAD(&cil->xc_committing); | |
62 | spin_lock_init(&cil->xc_cil_lock); | |
63 | init_rwsem(&cil->xc_ctx_lock); | |
64 | sv_init(&cil->xc_commit_wait, SV_DEFAULT, "cilwait"); | |
65 | ||
66 | INIT_LIST_HEAD(&ctx->committing); | |
67 | INIT_LIST_HEAD(&ctx->busy_extents); | |
68 | ctx->sequence = 1; | |
69 | ctx->cil = cil; | |
70 | cil->xc_ctx = ctx; | |
a44f13ed | 71 | cil->xc_current_sequence = ctx->sequence; |
71e330b5 DC |
72 | |
73 | cil->xc_log = log; | |
74 | log->l_cilp = cil; | |
75 | return 0; | |
76 | } | |
77 | ||
78 | void | |
79 | xlog_cil_destroy( | |
80 | struct log *log) | |
81 | { | |
82 | if (!log->l_cilp) | |
83 | return; | |
84 | ||
85 | if (log->l_cilp->xc_ctx) { | |
86 | if (log->l_cilp->xc_ctx->ticket) | |
87 | xfs_log_ticket_put(log->l_cilp->xc_ctx->ticket); | |
88 | kmem_free(log->l_cilp->xc_ctx); | |
89 | } | |
90 | ||
91 | ASSERT(list_empty(&log->l_cilp->xc_cil)); | |
92 | kmem_free(log->l_cilp); | |
93 | } | |
94 | ||
95 | /* | |
96 | * Allocate a new ticket. Failing to get a new ticket makes it really hard to | |
97 | * recover, so we don't allow failure here. Also, we allocate in a context that | |
98 | * we don't want to be issuing transactions from, so we need to tell the | |
99 | * allocation code this as well. | |
100 | * | |
101 | * We don't reserve any space for the ticket - we are going to steal whatever | |
102 | * space we require from transactions as they commit. To ensure we reserve all | |
103 | * the space required, we need to set the current reservation of the ticket to | |
104 | * zero so that we know to steal the initial transaction overhead from the | |
105 | * first transaction commit. | |
106 | */ | |
107 | static struct xlog_ticket * | |
108 | xlog_cil_ticket_alloc( | |
109 | struct log *log) | |
110 | { | |
111 | struct xlog_ticket *tic; | |
112 | ||
113 | tic = xlog_ticket_alloc(log, 0, 1, XFS_TRANSACTION, 0, | |
114 | KM_SLEEP|KM_NOFS); | |
115 | tic->t_trans_type = XFS_TRANS_CHECKPOINT; | |
116 | ||
117 | /* | |
118 | * set the current reservation to zero so we know to steal the basic | |
119 | * transaction overhead reservation from the first transaction commit. | |
120 | */ | |
121 | tic->t_curr_res = 0; | |
122 | return tic; | |
123 | } | |
124 | ||
125 | /* | |
126 | * After the first stage of log recovery is done, we know where the head and | |
127 | * tail of the log are. We need this log initialisation done before we can | |
128 | * initialise the first CIL checkpoint context. | |
129 | * | |
130 | * Here we allocate a log ticket to track space usage during a CIL push. This | |
131 | * ticket is passed to xlog_write() directly so that we don't slowly leak log | |
132 | * space by failing to account for space used by log headers and additional | |
133 | * region headers for split regions. | |
134 | */ | |
135 | void | |
136 | xlog_cil_init_post_recovery( | |
137 | struct log *log) | |
138 | { | |
139 | if (!log->l_cilp) | |
140 | return; | |
141 | ||
142 | log->l_cilp->xc_ctx->ticket = xlog_cil_ticket_alloc(log); | |
143 | log->l_cilp->xc_ctx->sequence = 1; | |
144 | log->l_cilp->xc_ctx->commit_lsn = xlog_assign_lsn(log->l_curr_cycle, | |
145 | log->l_curr_block); | |
146 | } | |
147 | ||
148 | /* | |
149 | * Insert the log item into the CIL and calculate the difference in space | |
150 | * consumed by the item. Add the space to the checkpoint ticket and calculate | |
151 | * if the change requires additional log metadata. If it does, take that space | |
152 | * as well. Remove the amount of space we addded to the checkpoint ticket from | |
153 | * the current transaction ticket so that the accounting works out correctly. | |
154 | * | |
155 | * If this is the first time the item is being placed into the CIL in this | |
156 | * context, pin it so it can't be written to disk until the CIL is flushed to | |
157 | * the iclog and the iclog written to disk. | |
158 | */ | |
159 | static void | |
160 | xlog_cil_insert( | |
161 | struct log *log, | |
162 | struct xlog_ticket *ticket, | |
163 | struct xfs_log_item *item, | |
164 | struct xfs_log_vec *lv) | |
165 | { | |
166 | struct xfs_cil *cil = log->l_cilp; | |
167 | struct xfs_log_vec *old = lv->lv_item->li_lv; | |
168 | struct xfs_cil_ctx *ctx = cil->xc_ctx; | |
169 | int len; | |
170 | int diff_iovecs; | |
171 | int iclog_space; | |
172 | ||
173 | if (old) { | |
174 | /* existing lv on log item, space used is a delta */ | |
175 | ASSERT(!list_empty(&item->li_cil)); | |
176 | ASSERT(old->lv_buf && old->lv_buf_len && old->lv_niovecs); | |
177 | ||
178 | len = lv->lv_buf_len - old->lv_buf_len; | |
179 | diff_iovecs = lv->lv_niovecs - old->lv_niovecs; | |
180 | kmem_free(old->lv_buf); | |
181 | kmem_free(old); | |
182 | } else { | |
183 | /* new lv, must pin the log item */ | |
184 | ASSERT(!lv->lv_item->li_lv); | |
185 | ASSERT(list_empty(&item->li_cil)); | |
186 | ||
187 | len = lv->lv_buf_len; | |
188 | diff_iovecs = lv->lv_niovecs; | |
189 | IOP_PIN(lv->lv_item); | |
190 | ||
191 | } | |
192 | len += diff_iovecs * sizeof(xlog_op_header_t); | |
193 | ||
194 | /* attach new log vector to log item */ | |
195 | lv->lv_item->li_lv = lv; | |
196 | ||
197 | spin_lock(&cil->xc_cil_lock); | |
198 | list_move_tail(&item->li_cil, &cil->xc_cil); | |
199 | ctx->nvecs += diff_iovecs; | |
200 | ||
ccf7c23f DC |
201 | /* |
202 | * If this is the first time the item is being committed to the CIL, | |
203 | * store the sequence number on the log item so we can tell | |
204 | * in future commits whether this is the first checkpoint the item is | |
205 | * being committed into. | |
206 | */ | |
207 | if (!item->li_seq) | |
208 | item->li_seq = ctx->sequence; | |
209 | ||
71e330b5 DC |
210 | /* |
211 | * Now transfer enough transaction reservation to the context ticket | |
212 | * for the checkpoint. The context ticket is special - the unit | |
213 | * reservation has to grow as well as the current reservation as we | |
214 | * steal from tickets so we can correctly determine the space used | |
215 | * during the transaction commit. | |
216 | */ | |
217 | if (ctx->ticket->t_curr_res == 0) { | |
218 | /* first commit in checkpoint, steal the header reservation */ | |
219 | ASSERT(ticket->t_curr_res >= ctx->ticket->t_unit_res + len); | |
220 | ctx->ticket->t_curr_res = ctx->ticket->t_unit_res; | |
221 | ticket->t_curr_res -= ctx->ticket->t_unit_res; | |
222 | } | |
223 | ||
224 | /* do we need space for more log record headers? */ | |
225 | iclog_space = log->l_iclog_size - log->l_iclog_hsize; | |
226 | if (len > 0 && (ctx->space_used / iclog_space != | |
227 | (ctx->space_used + len) / iclog_space)) { | |
228 | int hdrs; | |
229 | ||
230 | hdrs = (len + iclog_space - 1) / iclog_space; | |
231 | /* need to take into account split region headers, too */ | |
232 | hdrs *= log->l_iclog_hsize + sizeof(struct xlog_op_header); | |
233 | ctx->ticket->t_unit_res += hdrs; | |
234 | ctx->ticket->t_curr_res += hdrs; | |
235 | ticket->t_curr_res -= hdrs; | |
236 | ASSERT(ticket->t_curr_res >= len); | |
237 | } | |
238 | ticket->t_curr_res -= len; | |
239 | ctx->space_used += len; | |
240 | ||
241 | spin_unlock(&cil->xc_cil_lock); | |
242 | } | |
243 | ||
244 | /* | |
245 | * Format log item into a flat buffers | |
246 | * | |
247 | * For delayed logging, we need to hold a formatted buffer containing all the | |
248 | * changes on the log item. This enables us to relog the item in memory and | |
249 | * write it out asynchronously without needing to relock the object that was | |
250 | * modified at the time it gets written into the iclog. | |
251 | * | |
252 | * This function builds a vector for the changes in each log item in the | |
253 | * transaction. It then works out the length of the buffer needed for each log | |
254 | * item, allocates them and formats the vector for the item into the buffer. | |
255 | * The buffer is then attached to the log item are then inserted into the | |
256 | * Committed Item List for tracking until the next checkpoint is written out. | |
257 | * | |
258 | * We don't set up region headers during this process; we simply copy the | |
259 | * regions into the flat buffer. We can do this because we still have to do a | |
260 | * formatting step to write the regions into the iclog buffer. Writing the | |
261 | * ophdrs during the iclog write means that we can support splitting large | |
262 | * regions across iclog boundares without needing a change in the format of the | |
263 | * item/region encapsulation. | |
264 | * | |
265 | * Hence what we need to do now is change the rewrite the vector array to point | |
266 | * to the copied region inside the buffer we just allocated. This allows us to | |
267 | * format the regions into the iclog as though they are being formatted | |
268 | * directly out of the objects themselves. | |
269 | */ | |
270 | static void | |
271 | xlog_cil_format_items( | |
272 | struct log *log, | |
273 | struct xfs_log_vec *log_vector, | |
274 | struct xlog_ticket *ticket, | |
275 | xfs_lsn_t *start_lsn) | |
276 | { | |
277 | struct xfs_log_vec *lv; | |
278 | ||
279 | if (start_lsn) | |
280 | *start_lsn = log->l_cilp->xc_ctx->sequence; | |
281 | ||
282 | ASSERT(log_vector); | |
283 | for (lv = log_vector; lv; lv = lv->lv_next) { | |
284 | void *ptr; | |
285 | int index; | |
286 | int len = 0; | |
287 | ||
288 | /* build the vector array and calculate it's length */ | |
289 | IOP_FORMAT(lv->lv_item, lv->lv_iovecp); | |
290 | for (index = 0; index < lv->lv_niovecs; index++) | |
291 | len += lv->lv_iovecp[index].i_len; | |
292 | ||
293 | lv->lv_buf_len = len; | |
294 | lv->lv_buf = kmem_zalloc(lv->lv_buf_len, KM_SLEEP|KM_NOFS); | |
295 | ptr = lv->lv_buf; | |
296 | ||
297 | for (index = 0; index < lv->lv_niovecs; index++) { | |
298 | struct xfs_log_iovec *vec = &lv->lv_iovecp[index]; | |
299 | ||
300 | memcpy(ptr, vec->i_addr, vec->i_len); | |
301 | vec->i_addr = ptr; | |
302 | ptr += vec->i_len; | |
303 | } | |
304 | ASSERT(ptr == lv->lv_buf + lv->lv_buf_len); | |
305 | ||
306 | xlog_cil_insert(log, ticket, lv->lv_item, lv); | |
307 | } | |
308 | } | |
309 | ||
310 | static void | |
311 | xlog_cil_free_logvec( | |
312 | struct xfs_log_vec *log_vector) | |
313 | { | |
314 | struct xfs_log_vec *lv; | |
315 | ||
316 | for (lv = log_vector; lv; ) { | |
317 | struct xfs_log_vec *next = lv->lv_next; | |
318 | kmem_free(lv->lv_buf); | |
319 | kmem_free(lv); | |
320 | lv = next; | |
321 | } | |
322 | } | |
323 | ||
71e330b5 DC |
324 | /* |
325 | * Mark all items committed and clear busy extents. We free the log vector | |
326 | * chains in a separate pass so that we unpin the log items as quickly as | |
327 | * possible. | |
328 | */ | |
329 | static void | |
330 | xlog_cil_committed( | |
331 | void *args, | |
332 | int abort) | |
333 | { | |
334 | struct xfs_cil_ctx *ctx = args; | |
335 | struct xfs_log_vec *lv; | |
336 | int abortflag = abort ? XFS_LI_ABORTED : 0; | |
337 | struct xfs_busy_extent *busyp, *n; | |
338 | ||
339 | /* unpin all the log items */ | |
340 | for (lv = ctx->lv_chain; lv; lv = lv->lv_next ) { | |
341 | xfs_trans_item_committed(lv->lv_item, ctx->start_lsn, | |
342 | abortflag); | |
343 | } | |
344 | ||
345 | list_for_each_entry_safe(busyp, n, &ctx->busy_extents, list) | |
346 | xfs_alloc_busy_clear(ctx->cil->xc_log->l_mp, busyp); | |
347 | ||
348 | spin_lock(&ctx->cil->xc_cil_lock); | |
349 | list_del(&ctx->committing); | |
350 | spin_unlock(&ctx->cil->xc_cil_lock); | |
351 | ||
352 | xlog_cil_free_logvec(ctx->lv_chain); | |
353 | kmem_free(ctx); | |
354 | } | |
355 | ||
356 | /* | |
a44f13ed DC |
357 | * Push the Committed Item List to the log. If @push_seq flag is zero, then it |
358 | * is a background flush and so we can chose to ignore it. Otherwise, if the | |
359 | * current sequence is the same as @push_seq we need to do a flush. If | |
360 | * @push_seq is less than the current sequence, then it has already been | |
361 | * flushed and we don't need to do anything - the caller will wait for it to | |
362 | * complete if necessary. | |
363 | * | |
364 | * @push_seq is a value rather than a flag because that allows us to do an | |
365 | * unlocked check of the sequence number for a match. Hence we can allows log | |
366 | * forces to run racily and not issue pushes for the same sequence twice. If we | |
367 | * get a race between multiple pushes for the same sequence they will block on | |
368 | * the first one and then abort, hence avoiding needless pushes. | |
71e330b5 | 369 | */ |
a44f13ed | 370 | STATIC int |
71e330b5 DC |
371 | xlog_cil_push( |
372 | struct log *log, | |
a44f13ed | 373 | xfs_lsn_t push_seq) |
71e330b5 DC |
374 | { |
375 | struct xfs_cil *cil = log->l_cilp; | |
376 | struct xfs_log_vec *lv; | |
377 | struct xfs_cil_ctx *ctx; | |
378 | struct xfs_cil_ctx *new_ctx; | |
379 | struct xlog_in_core *commit_iclog; | |
380 | struct xlog_ticket *tic; | |
381 | int num_lv; | |
382 | int num_iovecs; | |
383 | int len; | |
384 | int error = 0; | |
385 | struct xfs_trans_header thdr; | |
386 | struct xfs_log_iovec lhdr; | |
387 | struct xfs_log_vec lvhdr = { NULL }; | |
388 | xfs_lsn_t commit_lsn; | |
389 | ||
390 | if (!cil) | |
391 | return 0; | |
392 | ||
a44f13ed DC |
393 | ASSERT(!push_seq || push_seq <= cil->xc_ctx->sequence); |
394 | ||
71e330b5 DC |
395 | new_ctx = kmem_zalloc(sizeof(*new_ctx), KM_SLEEP|KM_NOFS); |
396 | new_ctx->ticket = xlog_cil_ticket_alloc(log); | |
397 | ||
df806158 DC |
398 | /* lock out transaction commit, but don't block on background push */ |
399 | if (!down_write_trylock(&cil->xc_ctx_lock)) { | |
a44f13ed | 400 | if (!push_seq) |
df806158 DC |
401 | goto out_free_ticket; |
402 | down_write(&cil->xc_ctx_lock); | |
403 | } | |
71e330b5 DC |
404 | ctx = cil->xc_ctx; |
405 | ||
406 | /* check if we've anything to push */ | |
407 | if (list_empty(&cil->xc_cil)) | |
408 | goto out_skip; | |
409 | ||
df806158 | 410 | /* check for spurious background flush */ |
a44f13ed DC |
411 | if (!push_seq && cil->xc_ctx->space_used < XLOG_CIL_SPACE_LIMIT(log)) |
412 | goto out_skip; | |
413 | ||
414 | /* check for a previously pushed seqeunce */ | |
415 | if (push_seq < cil->xc_ctx->sequence) | |
df806158 DC |
416 | goto out_skip; |
417 | ||
71e330b5 DC |
418 | /* |
419 | * pull all the log vectors off the items in the CIL, and | |
420 | * remove the items from the CIL. We don't need the CIL lock | |
421 | * here because it's only needed on the transaction commit | |
422 | * side which is currently locked out by the flush lock. | |
423 | */ | |
424 | lv = NULL; | |
425 | num_lv = 0; | |
426 | num_iovecs = 0; | |
427 | len = 0; | |
428 | while (!list_empty(&cil->xc_cil)) { | |
429 | struct xfs_log_item *item; | |
430 | int i; | |
431 | ||
432 | item = list_first_entry(&cil->xc_cil, | |
433 | struct xfs_log_item, li_cil); | |
434 | list_del_init(&item->li_cil); | |
435 | if (!ctx->lv_chain) | |
436 | ctx->lv_chain = item->li_lv; | |
437 | else | |
438 | lv->lv_next = item->li_lv; | |
439 | lv = item->li_lv; | |
440 | item->li_lv = NULL; | |
441 | ||
442 | num_lv++; | |
443 | num_iovecs += lv->lv_niovecs; | |
444 | for (i = 0; i < lv->lv_niovecs; i++) | |
445 | len += lv->lv_iovecp[i].i_len; | |
446 | } | |
447 | ||
448 | /* | |
449 | * initialise the new context and attach it to the CIL. Then attach | |
450 | * the current context to the CIL committing lsit so it can be found | |
451 | * during log forces to extract the commit lsn of the sequence that | |
452 | * needs to be forced. | |
453 | */ | |
454 | INIT_LIST_HEAD(&new_ctx->committing); | |
455 | INIT_LIST_HEAD(&new_ctx->busy_extents); | |
456 | new_ctx->sequence = ctx->sequence + 1; | |
457 | new_ctx->cil = cil; | |
458 | cil->xc_ctx = new_ctx; | |
459 | ||
a44f13ed DC |
460 | /* |
461 | * mirror the new sequence into the cil structure so that we can do | |
462 | * unlocked checks against the current sequence in log forces without | |
463 | * risking deferencing a freed context pointer. | |
464 | */ | |
465 | cil->xc_current_sequence = new_ctx->sequence; | |
466 | ||
71e330b5 DC |
467 | /* |
468 | * The switch is now done, so we can drop the context lock and move out | |
469 | * of a shared context. We can't just go straight to the commit record, | |
470 | * though - we need to synchronise with previous and future commits so | |
471 | * that the commit records are correctly ordered in the log to ensure | |
472 | * that we process items during log IO completion in the correct order. | |
473 | * | |
474 | * For example, if we get an EFI in one checkpoint and the EFD in the | |
475 | * next (e.g. due to log forces), we do not want the checkpoint with | |
476 | * the EFD to be committed before the checkpoint with the EFI. Hence | |
477 | * we must strictly order the commit records of the checkpoints so | |
478 | * that: a) the checkpoint callbacks are attached to the iclogs in the | |
479 | * correct order; and b) the checkpoints are replayed in correct order | |
480 | * in log recovery. | |
481 | * | |
482 | * Hence we need to add this context to the committing context list so | |
483 | * that higher sequences will wait for us to write out a commit record | |
484 | * before they do. | |
485 | */ | |
486 | spin_lock(&cil->xc_cil_lock); | |
487 | list_add(&ctx->committing, &cil->xc_committing); | |
488 | spin_unlock(&cil->xc_cil_lock); | |
489 | up_write(&cil->xc_ctx_lock); | |
490 | ||
491 | /* | |
492 | * Build a checkpoint transaction header and write it to the log to | |
493 | * begin the transaction. We need to account for the space used by the | |
494 | * transaction header here as it is not accounted for in xlog_write(). | |
495 | * | |
496 | * The LSN we need to pass to the log items on transaction commit is | |
497 | * the LSN reported by the first log vector write. If we use the commit | |
498 | * record lsn then we can move the tail beyond the grant write head. | |
499 | */ | |
500 | tic = ctx->ticket; | |
501 | thdr.th_magic = XFS_TRANS_HEADER_MAGIC; | |
502 | thdr.th_type = XFS_TRANS_CHECKPOINT; | |
503 | thdr.th_tid = tic->t_tid; | |
504 | thdr.th_num_items = num_iovecs; | |
4e0d5f92 | 505 | lhdr.i_addr = &thdr; |
71e330b5 DC |
506 | lhdr.i_len = sizeof(xfs_trans_header_t); |
507 | lhdr.i_type = XLOG_REG_TYPE_TRANSHDR; | |
508 | tic->t_curr_res -= lhdr.i_len + sizeof(xlog_op_header_t); | |
509 | ||
510 | lvhdr.lv_niovecs = 1; | |
511 | lvhdr.lv_iovecp = &lhdr; | |
512 | lvhdr.lv_next = ctx->lv_chain; | |
513 | ||
514 | error = xlog_write(log, &lvhdr, tic, &ctx->start_lsn, NULL, 0); | |
515 | if (error) | |
516 | goto out_abort; | |
517 | ||
518 | /* | |
519 | * now that we've written the checkpoint into the log, strictly | |
520 | * order the commit records so replay will get them in the right order. | |
521 | */ | |
522 | restart: | |
523 | spin_lock(&cil->xc_cil_lock); | |
524 | list_for_each_entry(new_ctx, &cil->xc_committing, committing) { | |
525 | /* | |
526 | * Higher sequences will wait for this one so skip them. | |
527 | * Don't wait for own own sequence, either. | |
528 | */ | |
529 | if (new_ctx->sequence >= ctx->sequence) | |
530 | continue; | |
531 | if (!new_ctx->commit_lsn) { | |
532 | /* | |
533 | * It is still being pushed! Wait for the push to | |
534 | * complete, then start again from the beginning. | |
535 | */ | |
536 | sv_wait(&cil->xc_commit_wait, 0, &cil->xc_cil_lock, 0); | |
537 | goto restart; | |
538 | } | |
539 | } | |
540 | spin_unlock(&cil->xc_cil_lock); | |
541 | ||
542 | commit_lsn = xfs_log_done(log->l_mp, tic, &commit_iclog, 0); | |
543 | if (error || commit_lsn == -1) | |
544 | goto out_abort; | |
545 | ||
546 | /* attach all the transactions w/ busy extents to iclog */ | |
547 | ctx->log_cb.cb_func = xlog_cil_committed; | |
548 | ctx->log_cb.cb_arg = ctx; | |
549 | error = xfs_log_notify(log->l_mp, commit_iclog, &ctx->log_cb); | |
550 | if (error) | |
551 | goto out_abort; | |
552 | ||
553 | /* | |
554 | * now the checkpoint commit is complete and we've attached the | |
555 | * callbacks to the iclog we can assign the commit LSN to the context | |
556 | * and wake up anyone who is waiting for the commit to complete. | |
557 | */ | |
558 | spin_lock(&cil->xc_cil_lock); | |
559 | ctx->commit_lsn = commit_lsn; | |
560 | sv_broadcast(&cil->xc_commit_wait); | |
561 | spin_unlock(&cil->xc_cil_lock); | |
562 | ||
563 | /* release the hounds! */ | |
564 | return xfs_log_release_iclog(log->l_mp, commit_iclog); | |
565 | ||
566 | out_skip: | |
567 | up_write(&cil->xc_ctx_lock); | |
df806158 | 568 | out_free_ticket: |
71e330b5 DC |
569 | xfs_log_ticket_put(new_ctx->ticket); |
570 | kmem_free(new_ctx); | |
571 | return 0; | |
572 | ||
573 | out_abort: | |
574 | xlog_cil_committed(ctx, XFS_LI_ABORTED); | |
575 | return XFS_ERROR(EIO); | |
576 | } | |
577 | ||
a44f13ed DC |
578 | /* |
579 | * Commit a transaction with the given vector to the Committed Item List. | |
580 | * | |
581 | * To do this, we need to format the item, pin it in memory if required and | |
582 | * account for the space used by the transaction. Once we have done that we | |
583 | * need to release the unused reservation for the transaction, attach the | |
584 | * transaction to the checkpoint context so we carry the busy extents through | |
585 | * to checkpoint completion, and then unlock all the items in the transaction. | |
586 | * | |
587 | * For more specific information about the order of operations in | |
588 | * xfs_log_commit_cil() please refer to the comments in | |
589 | * xfs_trans_commit_iclog(). | |
590 | * | |
591 | * Called with the context lock already held in read mode to lock out | |
592 | * background commit, returns without it held once background commits are | |
593 | * allowed again. | |
594 | */ | |
595 | int | |
596 | xfs_log_commit_cil( | |
597 | struct xfs_mount *mp, | |
598 | struct xfs_trans *tp, | |
599 | struct xfs_log_vec *log_vector, | |
600 | xfs_lsn_t *commit_lsn, | |
601 | int flags) | |
602 | { | |
603 | struct log *log = mp->m_log; | |
604 | int log_flags = 0; | |
605 | int push = 0; | |
606 | ||
607 | if (flags & XFS_TRANS_RELEASE_LOG_RES) | |
608 | log_flags = XFS_LOG_REL_PERM_RESERV; | |
609 | ||
610 | if (XLOG_FORCED_SHUTDOWN(log)) { | |
611 | xlog_cil_free_logvec(log_vector); | |
612 | return XFS_ERROR(EIO); | |
613 | } | |
614 | ||
615 | /* lock out background commit */ | |
616 | down_read(&log->l_cilp->xc_ctx_lock); | |
617 | xlog_cil_format_items(log, log_vector, tp->t_ticket, commit_lsn); | |
618 | ||
619 | /* check we didn't blow the reservation */ | |
620 | if (tp->t_ticket->t_curr_res < 0) | |
621 | xlog_print_tic_res(log->l_mp, tp->t_ticket); | |
622 | ||
623 | /* attach the transaction to the CIL if it has any busy extents */ | |
624 | if (!list_empty(&tp->t_busy)) { | |
625 | spin_lock(&log->l_cilp->xc_cil_lock); | |
626 | list_splice_init(&tp->t_busy, | |
627 | &log->l_cilp->xc_ctx->busy_extents); | |
628 | spin_unlock(&log->l_cilp->xc_cil_lock); | |
629 | } | |
630 | ||
631 | tp->t_commit_lsn = *commit_lsn; | |
632 | xfs_log_done(mp, tp->t_ticket, NULL, log_flags); | |
633 | xfs_trans_unreserve_and_mod_sb(tp); | |
634 | ||
635 | /* | |
636 | * Once all the items of the transaction have been copied to the CIL, | |
637 | * the items can be unlocked and freed. | |
638 | * | |
639 | * This needs to be done before we drop the CIL context lock because we | |
640 | * have to update state in the log items and unlock them before they go | |
641 | * to disk. If we don't, then the CIL checkpoint can race with us and | |
642 | * we can run checkpoint completion before we've updated and unlocked | |
643 | * the log items. This affects (at least) processing of stale buffers, | |
644 | * inodes and EFIs. | |
645 | */ | |
646 | xfs_trans_free_items(tp, *commit_lsn, 0); | |
647 | ||
648 | /* check for background commit before unlock */ | |
649 | if (log->l_cilp->xc_ctx->space_used > XLOG_CIL_SPACE_LIMIT(log)) | |
650 | push = 1; | |
651 | ||
652 | up_read(&log->l_cilp->xc_ctx_lock); | |
653 | ||
654 | /* | |
655 | * We need to push CIL every so often so we don't cache more than we | |
656 | * can fit in the log. The limit really is that a checkpoint can't be | |
657 | * more than half the log (the current checkpoint is not allowed to | |
658 | * overwrite the previous checkpoint), but commit latency and memory | |
659 | * usage limit this to a smaller size in most cases. | |
660 | */ | |
661 | if (push) | |
662 | xlog_cil_push(log, 0); | |
663 | return 0; | |
664 | } | |
665 | ||
71e330b5 DC |
666 | /* |
667 | * Conditionally push the CIL based on the sequence passed in. | |
668 | * | |
669 | * We only need to push if we haven't already pushed the sequence | |
670 | * number given. Hence the only time we will trigger a push here is | |
671 | * if the push sequence is the same as the current context. | |
672 | * | |
673 | * We return the current commit lsn to allow the callers to determine if a | |
674 | * iclog flush is necessary following this call. | |
675 | * | |
676 | * XXX: Initially, just push the CIL unconditionally and return whatever | |
677 | * commit lsn is there. It'll be empty, so this is broken for now. | |
678 | */ | |
679 | xfs_lsn_t | |
a44f13ed | 680 | xlog_cil_force_lsn( |
71e330b5 | 681 | struct log *log, |
a44f13ed | 682 | xfs_lsn_t sequence) |
71e330b5 DC |
683 | { |
684 | struct xfs_cil *cil = log->l_cilp; | |
685 | struct xfs_cil_ctx *ctx; | |
686 | xfs_lsn_t commit_lsn = NULLCOMMITLSN; | |
687 | ||
a44f13ed DC |
688 | ASSERT(sequence <= cil->xc_current_sequence); |
689 | ||
690 | /* | |
691 | * check to see if we need to force out the current context. | |
692 | * xlog_cil_push() handles racing pushes for the same sequence, | |
693 | * so no need to deal with it here. | |
694 | */ | |
695 | if (sequence == cil->xc_current_sequence) | |
696 | xlog_cil_push(log, sequence); | |
71e330b5 DC |
697 | |
698 | /* | |
699 | * See if we can find a previous sequence still committing. | |
71e330b5 DC |
700 | * We need to wait for all previous sequence commits to complete |
701 | * before allowing the force of push_seq to go ahead. Hence block | |
702 | * on commits for those as well. | |
703 | */ | |
a44f13ed | 704 | restart: |
71e330b5 | 705 | spin_lock(&cil->xc_cil_lock); |
71e330b5 | 706 | list_for_each_entry(ctx, &cil->xc_committing, committing) { |
a44f13ed | 707 | if (ctx->sequence > sequence) |
71e330b5 DC |
708 | continue; |
709 | if (!ctx->commit_lsn) { | |
710 | /* | |
711 | * It is still being pushed! Wait for the push to | |
712 | * complete, then start again from the beginning. | |
713 | */ | |
714 | sv_wait(&cil->xc_commit_wait, 0, &cil->xc_cil_lock, 0); | |
715 | goto restart; | |
716 | } | |
a44f13ed | 717 | if (ctx->sequence != sequence) |
71e330b5 DC |
718 | continue; |
719 | /* found it! */ | |
720 | commit_lsn = ctx->commit_lsn; | |
721 | } | |
722 | spin_unlock(&cil->xc_cil_lock); | |
723 | return commit_lsn; | |
724 | } | |
ccf7c23f DC |
725 | |
726 | /* | |
727 | * Check if the current log item was first committed in this sequence. | |
728 | * We can't rely on just the log item being in the CIL, we have to check | |
729 | * the recorded commit sequence number. | |
730 | * | |
731 | * Note: for this to be used in a non-racy manner, it has to be called with | |
732 | * CIL flushing locked out. As a result, it should only be used during the | |
733 | * transaction commit process when deciding what to format into the item. | |
734 | */ | |
735 | bool | |
736 | xfs_log_item_in_current_chkpt( | |
737 | struct xfs_log_item *lip) | |
738 | { | |
739 | struct xfs_cil_ctx *ctx; | |
740 | ||
741 | if (!(lip->li_mountp->m_flags & XFS_MOUNT_DELAYLOG)) | |
742 | return false; | |
743 | if (list_empty(&lip->li_cil)) | |
744 | return false; | |
745 | ||
746 | ctx = lip->li_mountp->m_log->l_cilp->xc_ctx; | |
747 | ||
748 | /* | |
749 | * li_seq is written on the first commit of a log item to record the | |
750 | * first checkpoint it is written to. Hence if it is different to the | |
751 | * current sequence, we're in a new checkpoint. | |
752 | */ | |
753 | if (XFS_LSN_CMP(lip->li_seq, ctx->sequence) != 0) | |
754 | return false; | |
755 | return true; | |
756 | } |