]>
Commit | Line | Data |
---|---|---|
4db6bfe0 AK |
1 | /* |
2 | * Copyright (C) 2001-2002 Sistina Software (UK) Limited. | |
3 | * Copyright (C) 2006-2008 Red Hat GmbH | |
4 | * | |
5 | * This file is released under the GPL. | |
6 | */ | |
7 | ||
8 | #include "dm-exception-store.h" | |
4db6bfe0 AK |
9 | |
10 | #include <linux/mm.h> | |
11 | #include <linux/pagemap.h> | |
12 | #include <linux/vmalloc.h> | |
daaa5f7c | 13 | #include <linux/export.h> |
4db6bfe0 AK |
14 | #include <linux/slab.h> |
15 | #include <linux/dm-io.h> | |
16 | ||
17 | #define DM_MSG_PREFIX "persistent snapshot" | |
18 | #define DM_CHUNK_SIZE_DEFAULT_SECTORS 32 /* 16KB */ | |
19 | ||
20 | /*----------------------------------------------------------------- | |
21 | * Persistent snapshots, by persistent we mean that the snapshot | |
22 | * will survive a reboot. | |
23 | *---------------------------------------------------------------*/ | |
24 | ||
25 | /* | |
26 | * We need to store a record of which parts of the origin have | |
27 | * been copied to the snapshot device. The snapshot code | |
28 | * requires that we copy exception chunks to chunk aligned areas | |
29 | * of the COW store. It makes sense therefore, to store the | |
30 | * metadata in chunk size blocks. | |
31 | * | |
32 | * There is no backward or forward compatibility implemented, | |
33 | * snapshots with different disk versions than the kernel will | |
34 | * not be usable. It is expected that "lvcreate" will blank out | |
35 | * the start of a fresh COW device before calling the snapshot | |
36 | * constructor. | |
37 | * | |
38 | * The first chunk of the COW device just contains the header. | |
39 | * After this there is a chunk filled with exception metadata, | |
40 | * followed by as many exception chunks as can fit in the | |
41 | * metadata areas. | |
42 | * | |
43 | * All on disk structures are in little-endian format. The end | |
44 | * of the exceptions info is indicated by an exception with a | |
45 | * new_chunk of 0, which is invalid since it would point to the | |
46 | * header chunk. | |
47 | */ | |
48 | ||
49 | /* | |
50 | * Magic for persistent snapshots: "SnAp" - Feeble isn't it. | |
51 | */ | |
52 | #define SNAP_MAGIC 0x70416e53 | |
53 | ||
54 | /* | |
55 | * The on-disk version of the metadata. | |
56 | */ | |
57 | #define SNAPSHOT_DISK_VERSION 1 | |
58 | ||
4454a621 MP |
59 | #define NUM_SNAPSHOT_HDR_CHUNKS 1 |
60 | ||
4db6bfe0 | 61 | struct disk_header { |
283a8328 | 62 | __le32 magic; |
4db6bfe0 AK |
63 | |
64 | /* | |
65 | * Is this snapshot valid. There is no way of recovering | |
66 | * an invalid snapshot. | |
67 | */ | |
283a8328 | 68 | __le32 valid; |
4db6bfe0 AK |
69 | |
70 | /* | |
71 | * Simple, incrementing version. no backward | |
72 | * compatibility. | |
73 | */ | |
283a8328 | 74 | __le32 version; |
4db6bfe0 AK |
75 | |
76 | /* In sectors */ | |
283a8328 AK |
77 | __le32 chunk_size; |
78 | } __packed; | |
4db6bfe0 AK |
79 | |
80 | struct disk_exception { | |
283a8328 AK |
81 | __le64 old_chunk; |
82 | __le64 new_chunk; | |
83 | } __packed; | |
84 | ||
85 | struct core_exception { | |
4db6bfe0 AK |
86 | uint64_t old_chunk; |
87 | uint64_t new_chunk; | |
88 | }; | |
89 | ||
90 | struct commit_callback { | |
91 | void (*callback)(void *, int success); | |
92 | void *context; | |
93 | }; | |
94 | ||
95 | /* | |
96 | * The top level structure for a persistent exception store. | |
97 | */ | |
98 | struct pstore { | |
71fab00a | 99 | struct dm_exception_store *store; |
4db6bfe0 AK |
100 | int version; |
101 | int valid; | |
102 | uint32_t exceptions_per_area; | |
103 | ||
104 | /* | |
105 | * Now that we have an asynchronous kcopyd there is no | |
106 | * need for large chunk sizes, so it wont hurt to have a | |
107 | * whole chunks worth of metadata in memory at once. | |
108 | */ | |
109 | void *area; | |
110 | ||
111 | /* | |
112 | * An area of zeros used to clear the next area. | |
113 | */ | |
114 | void *zero_area; | |
115 | ||
61578dcd MP |
116 | /* |
117 | * An area used for header. The header can be written | |
118 | * concurrently with metadata (when invalidating the snapshot), | |
119 | * so it needs a separate buffer. | |
120 | */ | |
121 | void *header_area; | |
122 | ||
4db6bfe0 AK |
123 | /* |
124 | * Used to keep track of which metadata area the data in | |
125 | * 'chunk' refers to. | |
126 | */ | |
127 | chunk_t current_area; | |
128 | ||
129 | /* | |
130 | * The next free chunk for an exception. | |
4454a621 MP |
131 | * |
132 | * When creating exceptions, all the chunks here and above are | |
133 | * free. It holds the next chunk to be allocated. On rare | |
134 | * occasions (e.g. after a system crash) holes can be left in | |
135 | * the exception store because chunks can be committed out of | |
136 | * order. | |
137 | * | |
138 | * When merging exceptions, it does not necessarily mean all the | |
139 | * chunks here and above are free. It holds the value it would | |
140 | * have held if all chunks had been committed in order of | |
141 | * allocation. Consequently the value may occasionally be | |
142 | * slightly too low, but since it's only used for 'status' and | |
143 | * it can never reach its minimum value too early this doesn't | |
144 | * matter. | |
4db6bfe0 | 145 | */ |
4454a621 | 146 | |
4db6bfe0 AK |
147 | chunk_t next_free; |
148 | ||
149 | /* | |
150 | * The index of next free exception in the current | |
151 | * metadata area. | |
152 | */ | |
153 | uint32_t current_committed; | |
154 | ||
155 | atomic_t pending_count; | |
156 | uint32_t callback_count; | |
157 | struct commit_callback *callbacks; | |
158 | struct dm_io_client *io_client; | |
159 | ||
160 | struct workqueue_struct *metadata_wq; | |
161 | }; | |
162 | ||
4db6bfe0 AK |
163 | static int alloc_area(struct pstore *ps) |
164 | { | |
165 | int r = -ENOMEM; | |
166 | size_t len; | |
167 | ||
71fab00a | 168 | len = ps->store->chunk_size << SECTOR_SHIFT; |
4db6bfe0 AK |
169 | |
170 | /* | |
171 | * Allocate the chunk_size block of memory that will hold | |
172 | * a single metadata area. | |
173 | */ | |
174 | ps->area = vmalloc(len); | |
175 | if (!ps->area) | |
61578dcd | 176 | goto err_area; |
4db6bfe0 | 177 | |
e29e65aa | 178 | ps->zero_area = vzalloc(len); |
61578dcd MP |
179 | if (!ps->zero_area) |
180 | goto err_zero_area; | |
4db6bfe0 | 181 | |
61578dcd MP |
182 | ps->header_area = vmalloc(len); |
183 | if (!ps->header_area) | |
184 | goto err_header_area; | |
185 | ||
4db6bfe0 | 186 | return 0; |
61578dcd MP |
187 | |
188 | err_header_area: | |
189 | vfree(ps->zero_area); | |
190 | ||
191 | err_zero_area: | |
192 | vfree(ps->area); | |
193 | ||
194 | err_area: | |
195 | return r; | |
4db6bfe0 AK |
196 | } |
197 | ||
198 | static void free_area(struct pstore *ps) | |
199 | { | |
a32079ce JB |
200 | if (ps->area) |
201 | vfree(ps->area); | |
4db6bfe0 | 202 | ps->area = NULL; |
a32079ce JB |
203 | |
204 | if (ps->zero_area) | |
205 | vfree(ps->zero_area); | |
4db6bfe0 | 206 | ps->zero_area = NULL; |
61578dcd MP |
207 | |
208 | if (ps->header_area) | |
209 | vfree(ps->header_area); | |
210 | ps->header_area = NULL; | |
4db6bfe0 AK |
211 | } |
212 | ||
213 | struct mdata_req { | |
214 | struct dm_io_region *where; | |
215 | struct dm_io_request *io_req; | |
216 | struct work_struct work; | |
217 | int result; | |
218 | }; | |
219 | ||
220 | static void do_metadata(struct work_struct *work) | |
221 | { | |
222 | struct mdata_req *req = container_of(work, struct mdata_req, work); | |
223 | ||
224 | req->result = dm_io(req->io_req, 1, req->where, NULL); | |
225 | } | |
226 | ||
227 | /* | |
228 | * Read or write a chunk aligned and sized block of data from a device. | |
229 | */ | |
02d2fd31 MP |
230 | static int chunk_io(struct pstore *ps, void *area, chunk_t chunk, int rw, |
231 | int metadata) | |
4db6bfe0 AK |
232 | { |
233 | struct dm_io_region where = { | |
fc56f6fb | 234 | .bdev = dm_snap_cow(ps->store->snap)->bdev, |
71fab00a JB |
235 | .sector = ps->store->chunk_size * chunk, |
236 | .count = ps->store->chunk_size, | |
4db6bfe0 AK |
237 | }; |
238 | struct dm_io_request io_req = { | |
239 | .bi_rw = rw, | |
240 | .mem.type = DM_IO_VMA, | |
02d2fd31 | 241 | .mem.ptr.vma = area, |
4db6bfe0 AK |
242 | .client = ps->io_client, |
243 | .notify.fn = NULL, | |
244 | }; | |
245 | struct mdata_req req; | |
246 | ||
247 | if (!metadata) | |
248 | return dm_io(&io_req, 1, &where, NULL); | |
249 | ||
250 | req.where = &where; | |
251 | req.io_req = &io_req; | |
252 | ||
253 | /* | |
254 | * Issue the synchronous I/O from a different thread | |
255 | * to avoid generic_make_request recursion. | |
256 | */ | |
ca1cab37 | 257 | INIT_WORK_ONSTACK(&req.work, do_metadata); |
4db6bfe0 | 258 | queue_work(ps->metadata_wq, &req.work); |
5ea330a7 | 259 | flush_workqueue(ps->metadata_wq); |
c1a64160 | 260 | destroy_work_on_stack(&req.work); |
4db6bfe0 AK |
261 | |
262 | return req.result; | |
263 | } | |
264 | ||
265 | /* | |
266 | * Convert a metadata area index to a chunk index. | |
267 | */ | |
268 | static chunk_t area_location(struct pstore *ps, chunk_t area) | |
269 | { | |
87c961cb | 270 | return NUM_SNAPSHOT_HDR_CHUNKS + ((ps->exceptions_per_area + 1) * area); |
4db6bfe0 AK |
271 | } |
272 | ||
e9c6a182 MP |
273 | static void skip_metadata(struct pstore *ps) |
274 | { | |
275 | uint32_t stride = ps->exceptions_per_area + 1; | |
276 | chunk_t next_free = ps->next_free; | |
277 | if (sector_div(next_free, stride) == NUM_SNAPSHOT_HDR_CHUNKS) | |
278 | ps->next_free++; | |
279 | } | |
280 | ||
4db6bfe0 AK |
281 | /* |
282 | * Read or write a metadata area. Remembering to skip the first | |
283 | * chunk which holds the header. | |
284 | */ | |
285 | static int area_io(struct pstore *ps, int rw) | |
286 | { | |
287 | int r; | |
288 | chunk_t chunk; | |
289 | ||
290 | chunk = area_location(ps, ps->current_area); | |
291 | ||
02d2fd31 | 292 | r = chunk_io(ps, ps->area, chunk, rw, 0); |
4db6bfe0 AK |
293 | if (r) |
294 | return r; | |
295 | ||
296 | return 0; | |
297 | } | |
298 | ||
299 | static void zero_memory_area(struct pstore *ps) | |
300 | { | |
71fab00a | 301 | memset(ps->area, 0, ps->store->chunk_size << SECTOR_SHIFT); |
4db6bfe0 AK |
302 | } |
303 | ||
304 | static int zero_disk_area(struct pstore *ps, chunk_t area) | |
305 | { | |
02d2fd31 | 306 | return chunk_io(ps, ps->zero_area, area_location(ps, area), WRITE, 0); |
4db6bfe0 AK |
307 | } |
308 | ||
309 | static int read_header(struct pstore *ps, int *new_snapshot) | |
310 | { | |
311 | int r; | |
312 | struct disk_header *dh; | |
df96eee6 | 313 | unsigned chunk_size; |
4db6bfe0 | 314 | int chunk_size_supplied = 1; |
ae0b7448 | 315 | char *chunk_err; |
4db6bfe0 AK |
316 | |
317 | /* | |
df96eee6 MP |
318 | * Use default chunk size (or logical_block_size, if larger) |
319 | * if none supplied | |
4db6bfe0 | 320 | */ |
71fab00a JB |
321 | if (!ps->store->chunk_size) { |
322 | ps->store->chunk_size = max(DM_CHUNK_SIZE_DEFAULT_SECTORS, | |
fc56f6fb MS |
323 | bdev_logical_block_size(dm_snap_cow(ps->store->snap)-> |
324 | bdev) >> 9); | |
71fab00a JB |
325 | ps->store->chunk_mask = ps->store->chunk_size - 1; |
326 | ps->store->chunk_shift = ffs(ps->store->chunk_size) - 1; | |
4db6bfe0 AK |
327 | chunk_size_supplied = 0; |
328 | } | |
329 | ||
bda8efec | 330 | ps->io_client = dm_io_client_create(); |
4db6bfe0 AK |
331 | if (IS_ERR(ps->io_client)) |
332 | return PTR_ERR(ps->io_client); | |
333 | ||
334 | r = alloc_area(ps); | |
335 | if (r) | |
336 | return r; | |
337 | ||
61578dcd | 338 | r = chunk_io(ps, ps->header_area, 0, READ, 1); |
4db6bfe0 AK |
339 | if (r) |
340 | goto bad; | |
341 | ||
61578dcd | 342 | dh = ps->header_area; |
4db6bfe0 AK |
343 | |
344 | if (le32_to_cpu(dh->magic) == 0) { | |
345 | *new_snapshot = 1; | |
346 | return 0; | |
347 | } | |
348 | ||
349 | if (le32_to_cpu(dh->magic) != SNAP_MAGIC) { | |
350 | DMWARN("Invalid or corrupt snapshot"); | |
351 | r = -ENXIO; | |
352 | goto bad; | |
353 | } | |
354 | ||
355 | *new_snapshot = 0; | |
356 | ps->valid = le32_to_cpu(dh->valid); | |
357 | ps->version = le32_to_cpu(dh->version); | |
358 | chunk_size = le32_to_cpu(dh->chunk_size); | |
359 | ||
ae0b7448 | 360 | if (ps->store->chunk_size == chunk_size) |
4db6bfe0 AK |
361 | return 0; |
362 | ||
ae0b7448 | 363 | if (chunk_size_supplied) |
df96eee6 MP |
364 | DMWARN("chunk size %u in device metadata overrides " |
365 | "table chunk size of %u.", | |
366 | chunk_size, ps->store->chunk_size); | |
4db6bfe0 AK |
367 | |
368 | /* We had a bogus chunk_size. Fix stuff up. */ | |
369 | free_area(ps); | |
370 | ||
ae0b7448 MP |
371 | r = dm_exception_store_set_chunk_size(ps->store, chunk_size, |
372 | &chunk_err); | |
373 | if (r) { | |
df96eee6 MP |
374 | DMERR("invalid on-disk chunk size %u: %s.", |
375 | chunk_size, chunk_err); | |
ae0b7448 MP |
376 | return r; |
377 | } | |
4db6bfe0 | 378 | |
4db6bfe0 AK |
379 | r = alloc_area(ps); |
380 | return r; | |
381 | ||
382 | bad: | |
383 | free_area(ps); | |
384 | return r; | |
385 | } | |
386 | ||
387 | static int write_header(struct pstore *ps) | |
388 | { | |
389 | struct disk_header *dh; | |
390 | ||
61578dcd | 391 | memset(ps->header_area, 0, ps->store->chunk_size << SECTOR_SHIFT); |
4db6bfe0 | 392 | |
61578dcd | 393 | dh = ps->header_area; |
4db6bfe0 AK |
394 | dh->magic = cpu_to_le32(SNAP_MAGIC); |
395 | dh->valid = cpu_to_le32(ps->valid); | |
396 | dh->version = cpu_to_le32(ps->version); | |
71fab00a | 397 | dh->chunk_size = cpu_to_le32(ps->store->chunk_size); |
4db6bfe0 | 398 | |
61578dcd | 399 | return chunk_io(ps, ps->header_area, 0, WRITE, 1); |
4db6bfe0 AK |
400 | } |
401 | ||
402 | /* | |
403 | * Access functions for the disk exceptions, these do the endian conversions. | |
404 | */ | |
2cadabd5 MP |
405 | static struct disk_exception *get_exception(struct pstore *ps, void *ps_area, |
406 | uint32_t index) | |
4db6bfe0 AK |
407 | { |
408 | BUG_ON(index >= ps->exceptions_per_area); | |
409 | ||
2cadabd5 | 410 | return ((struct disk_exception *) ps_area) + index; |
4db6bfe0 AK |
411 | } |
412 | ||
2cadabd5 | 413 | static void read_exception(struct pstore *ps, void *ps_area, |
283a8328 | 414 | uint32_t index, struct core_exception *result) |
4db6bfe0 | 415 | { |
2cadabd5 | 416 | struct disk_exception *de = get_exception(ps, ps_area, index); |
4db6bfe0 AK |
417 | |
418 | /* copy it */ | |
283a8328 AK |
419 | result->old_chunk = le64_to_cpu(de->old_chunk); |
420 | result->new_chunk = le64_to_cpu(de->new_chunk); | |
4db6bfe0 AK |
421 | } |
422 | ||
423 | static void write_exception(struct pstore *ps, | |
283a8328 | 424 | uint32_t index, struct core_exception *e) |
4db6bfe0 | 425 | { |
2cadabd5 | 426 | struct disk_exception *de = get_exception(ps, ps->area, index); |
4db6bfe0 AK |
427 | |
428 | /* copy it */ | |
283a8328 AK |
429 | de->old_chunk = cpu_to_le64(e->old_chunk); |
430 | de->new_chunk = cpu_to_le64(e->new_chunk); | |
4db6bfe0 AK |
431 | } |
432 | ||
4454a621 MP |
433 | static void clear_exception(struct pstore *ps, uint32_t index) |
434 | { | |
2cadabd5 | 435 | struct disk_exception *de = get_exception(ps, ps->area, index); |
4454a621 MP |
436 | |
437 | /* clear it */ | |
283a8328 AK |
438 | de->old_chunk = 0; |
439 | de->new_chunk = 0; | |
4454a621 MP |
440 | } |
441 | ||
4db6bfe0 AK |
442 | /* |
443 | * Registers the exceptions that are present in the current area. | |
444 | * 'full' is filled in to indicate if the area has been | |
445 | * filled. | |
446 | */ | |
2cadabd5 | 447 | static int insert_exceptions(struct pstore *ps, void *ps_area, |
a159c1ac JB |
448 | int (*callback)(void *callback_context, |
449 | chunk_t old, chunk_t new), | |
450 | void *callback_context, | |
451 | int *full) | |
4db6bfe0 AK |
452 | { |
453 | int r; | |
454 | unsigned int i; | |
283a8328 | 455 | struct core_exception e; |
4db6bfe0 AK |
456 | |
457 | /* presume the area is full */ | |
458 | *full = 1; | |
459 | ||
460 | for (i = 0; i < ps->exceptions_per_area; i++) { | |
2cadabd5 | 461 | read_exception(ps, ps_area, i, &e); |
4db6bfe0 AK |
462 | |
463 | /* | |
464 | * If the new_chunk is pointing at the start of | |
465 | * the COW device, where the first metadata area | |
466 | * is we know that we've hit the end of the | |
467 | * exceptions. Therefore the area is not full. | |
468 | */ | |
283a8328 | 469 | if (e.new_chunk == 0LL) { |
4db6bfe0 AK |
470 | ps->current_committed = i; |
471 | *full = 0; | |
472 | break; | |
473 | } | |
474 | ||
475 | /* | |
476 | * Keep track of the start of the free chunks. | |
477 | */ | |
283a8328 AK |
478 | if (ps->next_free <= e.new_chunk) |
479 | ps->next_free = e.new_chunk + 1; | |
4db6bfe0 AK |
480 | |
481 | /* | |
482 | * Otherwise we add the exception to the snapshot. | |
483 | */ | |
283a8328 | 484 | r = callback(callback_context, e.old_chunk, e.new_chunk); |
4db6bfe0 AK |
485 | if (r) |
486 | return r; | |
487 | } | |
488 | ||
489 | return 0; | |
490 | } | |
491 | ||
a159c1ac JB |
492 | static int read_exceptions(struct pstore *ps, |
493 | int (*callback)(void *callback_context, chunk_t old, | |
494 | chunk_t new), | |
495 | void *callback_context) | |
4db6bfe0 AK |
496 | { |
497 | int r, full = 1; | |
498 | ||
499 | /* | |
500 | * Keeping reading chunks and inserting exceptions until | |
501 | * we find a partially full area. | |
502 | */ | |
503 | for (ps->current_area = 0; full; ps->current_area++) { | |
504 | r = area_io(ps, READ); | |
505 | if (r) | |
506 | return r; | |
507 | ||
2cadabd5 MP |
508 | r = insert_exceptions(ps, ps->area, callback, callback_context, |
509 | &full); | |
4db6bfe0 AK |
510 | if (r) |
511 | return r; | |
512 | } | |
513 | ||
514 | ps->current_area--; | |
515 | ||
e9c6a182 MP |
516 | skip_metadata(ps); |
517 | ||
4db6bfe0 AK |
518 | return 0; |
519 | } | |
520 | ||
521 | static struct pstore *get_info(struct dm_exception_store *store) | |
522 | { | |
523 | return (struct pstore *) store->context; | |
524 | } | |
525 | ||
985903bb MS |
526 | static void persistent_usage(struct dm_exception_store *store, |
527 | sector_t *total_sectors, | |
528 | sector_t *sectors_allocated, | |
529 | sector_t *metadata_sectors) | |
4db6bfe0 | 530 | { |
985903bb MS |
531 | struct pstore *ps = get_info(store); |
532 | ||
533 | *sectors_allocated = ps->next_free * store->chunk_size; | |
fc56f6fb | 534 | *total_sectors = get_dev_size(dm_snap_cow(store->snap)->bdev); |
985903bb MS |
535 | |
536 | /* | |
537 | * First chunk is the fixed header. | |
538 | * Then there are (ps->current_area + 1) metadata chunks, each one | |
539 | * separated from the next by ps->exceptions_per_area data chunks. | |
540 | */ | |
4454a621 MP |
541 | *metadata_sectors = (ps->current_area + 1 + NUM_SNAPSHOT_HDR_CHUNKS) * |
542 | store->chunk_size; | |
4db6bfe0 AK |
543 | } |
544 | ||
493df71c | 545 | static void persistent_dtr(struct dm_exception_store *store) |
4db6bfe0 AK |
546 | { |
547 | struct pstore *ps = get_info(store); | |
548 | ||
549 | destroy_workqueue(ps->metadata_wq); | |
a32079ce JB |
550 | |
551 | /* Created in read_header */ | |
552 | if (ps->io_client) | |
553 | dm_io_client_destroy(ps->io_client); | |
4db6bfe0 | 554 | free_area(ps); |
a32079ce JB |
555 | |
556 | /* Allocated in persistent_read_metadata */ | |
557 | if (ps->callbacks) | |
558 | vfree(ps->callbacks); | |
559 | ||
4db6bfe0 AK |
560 | kfree(ps); |
561 | } | |
562 | ||
a159c1ac JB |
563 | static int persistent_read_metadata(struct dm_exception_store *store, |
564 | int (*callback)(void *callback_context, | |
565 | chunk_t old, chunk_t new), | |
566 | void *callback_context) | |
4db6bfe0 AK |
567 | { |
568 | int r, uninitialized_var(new_snapshot); | |
569 | struct pstore *ps = get_info(store); | |
570 | ||
571 | /* | |
572 | * Read the snapshot header. | |
573 | */ | |
574 | r = read_header(ps, &new_snapshot); | |
575 | if (r) | |
576 | return r; | |
577 | ||
578 | /* | |
579 | * Now we know correct chunk_size, complete the initialisation. | |
580 | */ | |
71fab00a JB |
581 | ps->exceptions_per_area = (ps->store->chunk_size << SECTOR_SHIFT) / |
582 | sizeof(struct disk_exception); | |
4db6bfe0 | 583 | ps->callbacks = dm_vcalloc(ps->exceptions_per_area, |
a2d2b034 | 584 | sizeof(*ps->callbacks)); |
4db6bfe0 AK |
585 | if (!ps->callbacks) |
586 | return -ENOMEM; | |
587 | ||
588 | /* | |
589 | * Do we need to setup a new snapshot ? | |
590 | */ | |
591 | if (new_snapshot) { | |
592 | r = write_header(ps); | |
593 | if (r) { | |
594 | DMWARN("write_header failed"); | |
595 | return r; | |
596 | } | |
597 | ||
598 | ps->current_area = 0; | |
599 | zero_memory_area(ps); | |
600 | r = zero_disk_area(ps, 0); | |
f5acc834 | 601 | if (r) |
4db6bfe0 | 602 | DMWARN("zero_disk_area(0) failed"); |
f5acc834 JB |
603 | return r; |
604 | } | |
605 | /* | |
606 | * Sanity checks. | |
607 | */ | |
608 | if (ps->version != SNAPSHOT_DISK_VERSION) { | |
609 | DMWARN("unable to handle snapshot disk version %d", | |
610 | ps->version); | |
611 | return -EINVAL; | |
612 | } | |
4db6bfe0 | 613 | |
f5acc834 JB |
614 | /* |
615 | * Metadata are valid, but snapshot is invalidated | |
616 | */ | |
617 | if (!ps->valid) | |
618 | return 1; | |
4db6bfe0 | 619 | |
f5acc834 JB |
620 | /* |
621 | * Read the metadata. | |
622 | */ | |
623 | r = read_exceptions(ps, callback, callback_context); | |
4db6bfe0 | 624 | |
f5acc834 | 625 | return r; |
4db6bfe0 AK |
626 | } |
627 | ||
a159c1ac | 628 | static int persistent_prepare_exception(struct dm_exception_store *store, |
1d4989c8 | 629 | struct dm_exception *e) |
4db6bfe0 AK |
630 | { |
631 | struct pstore *ps = get_info(store); | |
fc56f6fb | 632 | sector_t size = get_dev_size(dm_snap_cow(store->snap)->bdev); |
4db6bfe0 AK |
633 | |
634 | /* Is there enough room ? */ | |
d0216849 | 635 | if (size < ((ps->next_free + 1) * store->chunk_size)) |
4db6bfe0 AK |
636 | return -ENOSPC; |
637 | ||
638 | e->new_chunk = ps->next_free; | |
639 | ||
640 | /* | |
641 | * Move onto the next free pending, making sure to take | |
642 | * into account the location of the metadata chunks. | |
643 | */ | |
e9c6a182 MP |
644 | ps->next_free++; |
645 | skip_metadata(ps); | |
4db6bfe0 AK |
646 | |
647 | atomic_inc(&ps->pending_count); | |
648 | return 0; | |
649 | } | |
650 | ||
a159c1ac | 651 | static void persistent_commit_exception(struct dm_exception_store *store, |
1d4989c8 | 652 | struct dm_exception *e, |
a159c1ac JB |
653 | void (*callback) (void *, int success), |
654 | void *callback_context) | |
4db6bfe0 AK |
655 | { |
656 | unsigned int i; | |
657 | struct pstore *ps = get_info(store); | |
283a8328 | 658 | struct core_exception ce; |
4db6bfe0 AK |
659 | struct commit_callback *cb; |
660 | ||
283a8328 AK |
661 | ce.old_chunk = e->old_chunk; |
662 | ce.new_chunk = e->new_chunk; | |
663 | write_exception(ps, ps->current_committed++, &ce); | |
4db6bfe0 AK |
664 | |
665 | /* | |
666 | * Add the callback to the back of the array. This code | |
667 | * is the only place where the callback array is | |
668 | * manipulated, and we know that it will never be called | |
669 | * multiple times concurrently. | |
670 | */ | |
671 | cb = ps->callbacks + ps->callback_count++; | |
672 | cb->callback = callback; | |
673 | cb->context = callback_context; | |
674 | ||
675 | /* | |
676 | * If there are exceptions in flight and we have not yet | |
677 | * filled this metadata area there's nothing more to do. | |
678 | */ | |
679 | if (!atomic_dec_and_test(&ps->pending_count) && | |
680 | (ps->current_committed != ps->exceptions_per_area)) | |
681 | return; | |
682 | ||
683 | /* | |
684 | * If we completely filled the current area, then wipe the next one. | |
685 | */ | |
686 | if ((ps->current_committed == ps->exceptions_per_area) && | |
a2d2b034 | 687 | zero_disk_area(ps, ps->current_area + 1)) |
4db6bfe0 AK |
688 | ps->valid = 0; |
689 | ||
690 | /* | |
691 | * Commit exceptions to disk. | |
692 | */ | |
d87f4c14 | 693 | if (ps->valid && area_io(ps, WRITE_FLUSH_FUA)) |
4db6bfe0 AK |
694 | ps->valid = 0; |
695 | ||
696 | /* | |
697 | * Advance to the next area if this one is full. | |
698 | */ | |
699 | if (ps->current_committed == ps->exceptions_per_area) { | |
700 | ps->current_committed = 0; | |
701 | ps->current_area++; | |
702 | zero_memory_area(ps); | |
703 | } | |
704 | ||
705 | for (i = 0; i < ps->callback_count; i++) { | |
706 | cb = ps->callbacks + i; | |
707 | cb->callback(cb->context, ps->valid); | |
708 | } | |
709 | ||
710 | ps->callback_count = 0; | |
711 | } | |
712 | ||
4454a621 MP |
713 | static int persistent_prepare_merge(struct dm_exception_store *store, |
714 | chunk_t *last_old_chunk, | |
715 | chunk_t *last_new_chunk) | |
716 | { | |
717 | struct pstore *ps = get_info(store); | |
283a8328 | 718 | struct core_exception ce; |
4454a621 MP |
719 | int nr_consecutive; |
720 | int r; | |
721 | ||
722 | /* | |
723 | * When current area is empty, move back to preceding area. | |
724 | */ | |
725 | if (!ps->current_committed) { | |
726 | /* | |
727 | * Have we finished? | |
728 | */ | |
729 | if (!ps->current_area) | |
730 | return 0; | |
731 | ||
732 | ps->current_area--; | |
733 | r = area_io(ps, READ); | |
734 | if (r < 0) | |
735 | return r; | |
736 | ps->current_committed = ps->exceptions_per_area; | |
737 | } | |
738 | ||
2cadabd5 | 739 | read_exception(ps, ps->area, ps->current_committed - 1, &ce); |
283a8328 AK |
740 | *last_old_chunk = ce.old_chunk; |
741 | *last_new_chunk = ce.new_chunk; | |
4454a621 MP |
742 | |
743 | /* | |
744 | * Find number of consecutive chunks within the current area, | |
745 | * working backwards. | |
746 | */ | |
747 | for (nr_consecutive = 1; nr_consecutive < ps->current_committed; | |
748 | nr_consecutive++) { | |
2cadabd5 MP |
749 | read_exception(ps, ps->area, |
750 | ps->current_committed - 1 - nr_consecutive, &ce); | |
283a8328 AK |
751 | if (ce.old_chunk != *last_old_chunk - nr_consecutive || |
752 | ce.new_chunk != *last_new_chunk - nr_consecutive) | |
4454a621 MP |
753 | break; |
754 | } | |
755 | ||
756 | return nr_consecutive; | |
757 | } | |
758 | ||
759 | static int persistent_commit_merge(struct dm_exception_store *store, | |
760 | int nr_merged) | |
761 | { | |
762 | int r, i; | |
763 | struct pstore *ps = get_info(store); | |
764 | ||
765 | BUG_ON(nr_merged > ps->current_committed); | |
766 | ||
767 | for (i = 0; i < nr_merged; i++) | |
768 | clear_exception(ps, ps->current_committed - 1 - i); | |
769 | ||
762a80d9 | 770 | r = area_io(ps, WRITE_FLUSH_FUA); |
4454a621 MP |
771 | if (r < 0) |
772 | return r; | |
773 | ||
774 | ps->current_committed -= nr_merged; | |
775 | ||
776 | /* | |
777 | * At this stage, only persistent_usage() uses ps->next_free, so | |
778 | * we make no attempt to keep ps->next_free strictly accurate | |
779 | * as exceptions may have been committed out-of-order originally. | |
780 | * Once a snapshot has become merging, we set it to the value it | |
781 | * would have held had all the exceptions been committed in order. | |
782 | * | |
783 | * ps->current_area does not get reduced by prepare_merge() until | |
784 | * after commit_merge() has removed the nr_merged previous exceptions. | |
785 | */ | |
87c961cb TK |
786 | ps->next_free = area_location(ps, ps->current_area) + |
787 | ps->current_committed + 1; | |
4454a621 MP |
788 | |
789 | return 0; | |
790 | } | |
791 | ||
a159c1ac | 792 | static void persistent_drop_snapshot(struct dm_exception_store *store) |
4db6bfe0 AK |
793 | { |
794 | struct pstore *ps = get_info(store); | |
795 | ||
796 | ps->valid = 0; | |
797 | if (write_header(ps)) | |
798 | DMWARN("write header failed"); | |
799 | } | |
800 | ||
493df71c JB |
801 | static int persistent_ctr(struct dm_exception_store *store, |
802 | unsigned argc, char **argv) | |
4db6bfe0 AK |
803 | { |
804 | struct pstore *ps; | |
805 | ||
806 | /* allocate the pstore */ | |
a32079ce | 807 | ps = kzalloc(sizeof(*ps), GFP_KERNEL); |
4db6bfe0 AK |
808 | if (!ps) |
809 | return -ENOMEM; | |
810 | ||
71fab00a | 811 | ps->store = store; |
4db6bfe0 AK |
812 | ps->valid = 1; |
813 | ps->version = SNAPSHOT_DISK_VERSION; | |
814 | ps->area = NULL; | |
61578dcd MP |
815 | ps->zero_area = NULL; |
816 | ps->header_area = NULL; | |
4454a621 | 817 | ps->next_free = NUM_SNAPSHOT_HDR_CHUNKS + 1; /* header and 1st area */ |
4db6bfe0 AK |
818 | ps->current_committed = 0; |
819 | ||
820 | ps->callback_count = 0; | |
821 | atomic_set(&ps->pending_count, 0); | |
822 | ps->callbacks = NULL; | |
823 | ||
239c8dd5 | 824 | ps->metadata_wq = alloc_workqueue("ksnaphd", WQ_MEM_RECLAIM, 0); |
4db6bfe0 AK |
825 | if (!ps->metadata_wq) { |
826 | kfree(ps); | |
827 | DMERR("couldn't start header metadata update thread"); | |
828 | return -ENOMEM; | |
829 | } | |
830 | ||
4db6bfe0 AK |
831 | store->context = ps; |
832 | ||
833 | return 0; | |
834 | } | |
835 | ||
1e302a92 JB |
836 | static unsigned persistent_status(struct dm_exception_store *store, |
837 | status_type_t status, char *result, | |
838 | unsigned maxlen) | |
493df71c | 839 | { |
1e302a92 JB |
840 | unsigned sz = 0; |
841 | ||
842 | switch (status) { | |
843 | case STATUSTYPE_INFO: | |
844 | break; | |
845 | case STATUSTYPE_TABLE: | |
fc56f6fb | 846 | DMEMIT(" P %llu", (unsigned long long)store->chunk_size); |
1e302a92 | 847 | } |
493df71c JB |
848 | |
849 | return sz; | |
850 | } | |
851 | ||
852 | static struct dm_exception_store_type _persistent_type = { | |
853 | .name = "persistent", | |
854 | .module = THIS_MODULE, | |
855 | .ctr = persistent_ctr, | |
856 | .dtr = persistent_dtr, | |
857 | .read_metadata = persistent_read_metadata, | |
858 | .prepare_exception = persistent_prepare_exception, | |
859 | .commit_exception = persistent_commit_exception, | |
4454a621 MP |
860 | .prepare_merge = persistent_prepare_merge, |
861 | .commit_merge = persistent_commit_merge, | |
493df71c | 862 | .drop_snapshot = persistent_drop_snapshot, |
985903bb | 863 | .usage = persistent_usage, |
493df71c JB |
864 | .status = persistent_status, |
865 | }; | |
866 | ||
867 | static struct dm_exception_store_type _persistent_compat_type = { | |
868 | .name = "P", | |
869 | .module = THIS_MODULE, | |
870 | .ctr = persistent_ctr, | |
871 | .dtr = persistent_dtr, | |
872 | .read_metadata = persistent_read_metadata, | |
873 | .prepare_exception = persistent_prepare_exception, | |
874 | .commit_exception = persistent_commit_exception, | |
4454a621 MP |
875 | .prepare_merge = persistent_prepare_merge, |
876 | .commit_merge = persistent_commit_merge, | |
493df71c | 877 | .drop_snapshot = persistent_drop_snapshot, |
985903bb | 878 | .usage = persistent_usage, |
493df71c JB |
879 | .status = persistent_status, |
880 | }; | |
881 | ||
4db6bfe0 AK |
882 | int dm_persistent_snapshot_init(void) |
883 | { | |
493df71c JB |
884 | int r; |
885 | ||
886 | r = dm_exception_store_type_register(&_persistent_type); | |
887 | if (r) { | |
888 | DMERR("Unable to register persistent exception store type"); | |
889 | return r; | |
890 | } | |
891 | ||
892 | r = dm_exception_store_type_register(&_persistent_compat_type); | |
893 | if (r) { | |
894 | DMERR("Unable to register old-style persistent exception " | |
895 | "store type"); | |
896 | dm_exception_store_type_unregister(&_persistent_type); | |
897 | return r; | |
898 | } | |
899 | ||
900 | return r; | |
4db6bfe0 AK |
901 | } |
902 | ||
903 | void dm_persistent_snapshot_exit(void) | |
904 | { | |
493df71c JB |
905 | dm_exception_store_type_unregister(&_persistent_type); |
906 | dm_exception_store_type_unregister(&_persistent_compat_type); | |
4db6bfe0 | 907 | } |