]>
Commit | Line | Data |
---|---|---|
3d0480ed | 1 | /* |
147d5fac | 2 | * Copyright (C) 2005-2007 Red Hat, Inc. All rights reserved. |
3d0480ed AK |
3 | * |
4 | * This file is part of the device-mapper userspace tools. | |
5 | * | |
6 | * This copyrighted material is made available to anyone wishing to use, | |
7 | * modify, copy, or redistribute it subject to the terms and conditions | |
8 | * of the GNU Lesser General Public License v.2.1. | |
9 | * | |
10 | * You should have received a copy of the GNU Lesser General Public License | |
11 | * along with this program; if not, write to the Free Software Foundation, | |
12 | * Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA | |
13 | */ | |
14 | ||
3e5b6ed2 | 15 | #include "dmlib.h" |
3d0480ed AK |
16 | #include "libdm-targets.h" |
17 | #include "libdm-common.h" | |
3d0480ed | 18 | #include "kdev_t.h" |
0782ad50 | 19 | #include "dm-ioctl.h" |
3d0480ed AK |
20 | |
21 | #include <stdarg.h> | |
22 | #include <sys/param.h> | |
8f26e18c | 23 | #include <sys/utsname.h> |
3d0480ed | 24 | |
165e4a11 AK |
25 | #define MAX_TARGET_PARAMSIZE 500000 |
26 | ||
87f98002 AK |
27 | /* FIXME Fix interface so this is used only by LVM */ |
28 | #define UUID_PREFIX "LVM-" | |
29 | ||
165e4a11 AK |
30 | /* Supported segment types */ |
31 | enum { | |
12ca060e MB |
32 | SEG_CRYPT, |
33 | SEG_ERROR, | |
165e4a11 AK |
34 | SEG_LINEAR, |
35 | SEG_MIRRORED, | |
36 | SEG_SNAPSHOT, | |
37 | SEG_SNAPSHOT_ORIGIN, | |
aa6f4e51 | 38 | SEG_SNAPSHOT_MERGE, |
165e4a11 AK |
39 | SEG_STRIPED, |
40 | SEG_ZERO, | |
41 | }; | |
b4f1578f | 42 | |
165e4a11 AK |
43 | /* FIXME Add crypt and multipath support */ |
44 | ||
45 | struct { | |
46 | unsigned type; | |
47 | const char *target; | |
48 | } dm_segtypes[] = { | |
12ca060e | 49 | { SEG_CRYPT, "crypt" }, |
165e4a11 AK |
50 | { SEG_ERROR, "error" }, |
51 | { SEG_LINEAR, "linear" }, | |
52 | { SEG_MIRRORED, "mirror" }, | |
53 | { SEG_SNAPSHOT, "snapshot" }, | |
54 | { SEG_SNAPSHOT_ORIGIN, "snapshot-origin" }, | |
aa6f4e51 | 55 | { SEG_SNAPSHOT_MERGE, "snapshot-merge" }, |
165e4a11 AK |
56 | { SEG_STRIPED, "striped" }, |
57 | { SEG_ZERO, "zero"}, | |
58 | }; | |
59 | ||
60 | /* Some segment types have a list of areas of other devices attached */ | |
61 | struct seg_area { | |
2c44337b | 62 | struct dm_list list; |
165e4a11 | 63 | |
b4f1578f | 64 | struct dm_tree_node *dev_node; |
165e4a11 AK |
65 | |
66 | uint64_t offset; | |
67 | }; | |
68 | ||
69 | /* Per-segment properties */ | |
70 | struct load_segment { | |
2c44337b | 71 | struct dm_list list; |
165e4a11 AK |
72 | |
73 | unsigned type; | |
74 | ||
75 | uint64_t size; | |
76 | ||
12ca060e MB |
77 | unsigned area_count; /* Linear + Striped + Mirrored + Crypt */ |
78 | struct dm_list areas; /* Linear + Striped + Mirrored + Crypt */ | |
165e4a11 AK |
79 | |
80 | uint32_t stripe_size; /* Striped */ | |
81 | ||
82 | int persistent; /* Snapshot */ | |
83 | uint32_t chunk_size; /* Snapshot */ | |
b4f1578f AK |
84 | struct dm_tree_node *cow; /* Snapshot */ |
85 | struct dm_tree_node *origin; /* Snapshot + Snapshot origin */ | |
aa6f4e51 | 86 | struct dm_tree_node *merge; /* Snapshot */ |
165e4a11 | 87 | |
b4f1578f | 88 | struct dm_tree_node *log; /* Mirror */ |
165e4a11 AK |
89 | uint32_t region_size; /* Mirror */ |
90 | unsigned clustered; /* Mirror */ | |
91 | unsigned mirror_area_count; /* Mirror */ | |
dbcb64b8 | 92 | uint32_t flags; /* Mirror log */ |
67b25ed4 | 93 | char *uuid; /* Clustered mirror log */ |
12ca060e MB |
94 | |
95 | const char *cipher; /* Crypt */ | |
96 | const char *chainmode; /* Crypt */ | |
97 | const char *iv; /* Crypt */ | |
98 | uint64_t iv_offset; /* Crypt */ | |
99 | const char *key; /* Crypt */ | |
165e4a11 AK |
100 | }; |
101 | ||
102 | /* Per-device properties */ | |
103 | struct load_properties { | |
104 | int read_only; | |
105 | uint32_t major; | |
106 | uint32_t minor; | |
107 | ||
52b84409 AK |
108 | uint32_t read_ahead; |
109 | uint32_t read_ahead_flags; | |
110 | ||
165e4a11 | 111 | unsigned segment_count; |
bb875bb9 | 112 | unsigned size_changed; |
2c44337b | 113 | struct dm_list segs; |
165e4a11 AK |
114 | |
115 | const char *new_name; | |
116 | }; | |
117 | ||
118 | /* Two of these used to join two nodes with uses and used_by. */ | |
b4f1578f | 119 | struct dm_tree_link { |
2c44337b | 120 | struct dm_list list; |
b4f1578f | 121 | struct dm_tree_node *node; |
165e4a11 AK |
122 | }; |
123 | ||
b4f1578f AK |
124 | struct dm_tree_node { |
125 | struct dm_tree *dtree; | |
3d0480ed AK |
126 | |
127 | const char *name; | |
128 | const char *uuid; | |
129 | struct dm_info info; | |
130 | ||
2c44337b AK |
131 | struct dm_list uses; /* Nodes this node uses */ |
132 | struct dm_list used_by; /* Nodes that use this node */ | |
165e4a11 | 133 | |
56c28292 AK |
134 | int activation_priority; /* 0 gets activated first */ |
135 | ||
f16aea9e PR |
136 | uint16_t udev_flags; /* Udev control flags */ |
137 | ||
165e4a11 AK |
138 | void *context; /* External supplied context */ |
139 | ||
140 | struct load_properties props; /* For creation/table (re)load */ | |
3d0480ed AK |
141 | }; |
142 | ||
b4f1578f | 143 | struct dm_tree { |
a3f6b2ce AK |
144 | struct dm_pool *mem; |
145 | struct dm_hash_table *devs; | |
165e4a11 | 146 | struct dm_hash_table *uuids; |
b4f1578f | 147 | struct dm_tree_node root; |
c55b1410 | 148 | int skip_lockfs; /* 1 skips lockfs (for non-snapshots) */ |
b9ffd32c | 149 | int no_flush; /* 1 sets noflush (mirrors/multipath) */ |
bd90c6b2 | 150 | uint32_t cookie; |
3d0480ed AK |
151 | }; |
152 | ||
b4f1578f | 153 | struct dm_tree *dm_tree_create(void) |
3d0480ed | 154 | { |
b4f1578f | 155 | struct dm_tree *dtree; |
3d0480ed | 156 | |
b4f1578f AK |
157 | if (!(dtree = dm_malloc(sizeof(*dtree)))) { |
158 | log_error("dm_tree_create malloc failed"); | |
3d0480ed AK |
159 | return NULL; |
160 | } | |
161 | ||
b4f1578f AK |
162 | memset(dtree, 0, sizeof(*dtree)); |
163 | dtree->root.dtree = dtree; | |
2c44337b AK |
164 | dm_list_init(&dtree->root.uses); |
165 | dm_list_init(&dtree->root.used_by); | |
c55b1410 | 166 | dtree->skip_lockfs = 0; |
b9ffd32c | 167 | dtree->no_flush = 0; |
3d0480ed | 168 | |
b4f1578f AK |
169 | if (!(dtree->mem = dm_pool_create("dtree", 1024))) { |
170 | log_error("dtree pool creation failed"); | |
171 | dm_free(dtree); | |
3d0480ed AK |
172 | return NULL; |
173 | } | |
174 | ||
b4f1578f AK |
175 | if (!(dtree->devs = dm_hash_create(8))) { |
176 | log_error("dtree hash creation failed"); | |
177 | dm_pool_destroy(dtree->mem); | |
178 | dm_free(dtree); | |
3d0480ed AK |
179 | return NULL; |
180 | } | |
181 | ||
b4f1578f AK |
182 | if (!(dtree->uuids = dm_hash_create(32))) { |
183 | log_error("dtree uuid hash creation failed"); | |
184 | dm_hash_destroy(dtree->devs); | |
185 | dm_pool_destroy(dtree->mem); | |
186 | dm_free(dtree); | |
165e4a11 AK |
187 | return NULL; |
188 | } | |
189 | ||
b4f1578f | 190 | return dtree; |
3d0480ed AK |
191 | } |
192 | ||
b4f1578f | 193 | void dm_tree_free(struct dm_tree *dtree) |
3d0480ed | 194 | { |
b4f1578f | 195 | if (!dtree) |
3d0480ed AK |
196 | return; |
197 | ||
b4f1578f AK |
198 | dm_hash_destroy(dtree->uuids); |
199 | dm_hash_destroy(dtree->devs); | |
200 | dm_pool_destroy(dtree->mem); | |
201 | dm_free(dtree); | |
3d0480ed AK |
202 | } |
203 | ||
04bde319 ZK |
204 | static int _nodes_are_linked(const struct dm_tree_node *parent, |
205 | const struct dm_tree_node *child) | |
3d0480ed | 206 | { |
b4f1578f | 207 | struct dm_tree_link *dlink; |
3d0480ed | 208 | |
2c44337b | 209 | dm_list_iterate_items(dlink, &parent->uses) |
3d0480ed AK |
210 | if (dlink->node == child) |
211 | return 1; | |
3d0480ed AK |
212 | |
213 | return 0; | |
214 | } | |
215 | ||
2c44337b | 216 | static int _link(struct dm_list *list, struct dm_tree_node *node) |
3d0480ed | 217 | { |
b4f1578f | 218 | struct dm_tree_link *dlink; |
3d0480ed | 219 | |
b4f1578f AK |
220 | if (!(dlink = dm_pool_alloc(node->dtree->mem, sizeof(*dlink)))) { |
221 | log_error("dtree link allocation failed"); | |
3d0480ed AK |
222 | return 0; |
223 | } | |
224 | ||
225 | dlink->node = node; | |
2c44337b | 226 | dm_list_add(list, &dlink->list); |
3d0480ed AK |
227 | |
228 | return 1; | |
229 | } | |
230 | ||
b4f1578f AK |
231 | static int _link_nodes(struct dm_tree_node *parent, |
232 | struct dm_tree_node *child) | |
3d0480ed AK |
233 | { |
234 | if (_nodes_are_linked(parent, child)) | |
235 | return 1; | |
236 | ||
237 | if (!_link(&parent->uses, child)) | |
238 | return 0; | |
239 | ||
240 | if (!_link(&child->used_by, parent)) | |
241 | return 0; | |
242 | ||
243 | return 1; | |
244 | } | |
245 | ||
2c44337b | 246 | static void _unlink(struct dm_list *list, struct dm_tree_node *node) |
3d0480ed | 247 | { |
b4f1578f | 248 | struct dm_tree_link *dlink; |
3d0480ed | 249 | |
2c44337b | 250 | dm_list_iterate_items(dlink, list) |
3d0480ed | 251 | if (dlink->node == node) { |
2c44337b | 252 | dm_list_del(&dlink->list); |
3d0480ed AK |
253 | break; |
254 | } | |
3d0480ed AK |
255 | } |
256 | ||
b4f1578f AK |
257 | static void _unlink_nodes(struct dm_tree_node *parent, |
258 | struct dm_tree_node *child) | |
3d0480ed AK |
259 | { |
260 | if (!_nodes_are_linked(parent, child)) | |
261 | return; | |
262 | ||
263 | _unlink(&parent->uses, child); | |
264 | _unlink(&child->used_by, parent); | |
265 | } | |
266 | ||
b4f1578f | 267 | static int _add_to_toplevel(struct dm_tree_node *node) |
165e4a11 | 268 | { |
b4f1578f | 269 | return _link_nodes(&node->dtree->root, node); |
165e4a11 AK |
270 | } |
271 | ||
b4f1578f | 272 | static void _remove_from_toplevel(struct dm_tree_node *node) |
3d0480ed | 273 | { |
b1ebf028 | 274 | _unlink_nodes(&node->dtree->root, node); |
3d0480ed AK |
275 | } |
276 | ||
b4f1578f | 277 | static int _add_to_bottomlevel(struct dm_tree_node *node) |
3d0480ed | 278 | { |
b4f1578f | 279 | return _link_nodes(node, &node->dtree->root); |
3d0480ed AK |
280 | } |
281 | ||
b4f1578f | 282 | static void _remove_from_bottomlevel(struct dm_tree_node *node) |
165e4a11 | 283 | { |
b1ebf028 | 284 | _unlink_nodes(node, &node->dtree->root); |
165e4a11 AK |
285 | } |
286 | ||
b4f1578f | 287 | static int _link_tree_nodes(struct dm_tree_node *parent, struct dm_tree_node *child) |
165e4a11 AK |
288 | { |
289 | /* Don't link to root node if child already has a parent */ | |
b4f1578f AK |
290 | if ((parent == &parent->dtree->root)) { |
291 | if (dm_tree_node_num_children(child, 1)) | |
165e4a11 AK |
292 | return 1; |
293 | } else | |
294 | _remove_from_toplevel(child); | |
295 | ||
b4f1578f AK |
296 | if ((child == &child->dtree->root)) { |
297 | if (dm_tree_node_num_children(parent, 0)) | |
165e4a11 AK |
298 | return 1; |
299 | } else | |
300 | _remove_from_bottomlevel(parent); | |
301 | ||
302 | return _link_nodes(parent, child); | |
303 | } | |
304 | ||
b4f1578f | 305 | static struct dm_tree_node *_create_dm_tree_node(struct dm_tree *dtree, |
3d0480ed AK |
306 | const char *name, |
307 | const char *uuid, | |
165e4a11 | 308 | struct dm_info *info, |
f16aea9e PR |
309 | void *context, |
310 | uint16_t udev_flags) | |
3d0480ed | 311 | { |
b4f1578f | 312 | struct dm_tree_node *node; |
3d0480ed AK |
313 | uint64_t dev; |
314 | ||
b4f1578f AK |
315 | if (!(node = dm_pool_zalloc(dtree->mem, sizeof(*node)))) { |
316 | log_error("_create_dm_tree_node alloc failed"); | |
3d0480ed AK |
317 | return NULL; |
318 | } | |
319 | ||
b4f1578f | 320 | node->dtree = dtree; |
3d0480ed AK |
321 | |
322 | node->name = name; | |
323 | node->uuid = uuid; | |
324 | node->info = *info; | |
165e4a11 | 325 | node->context = context; |
f16aea9e | 326 | node->udev_flags = udev_flags; |
56c28292 | 327 | node->activation_priority = 0; |
3d0480ed | 328 | |
2c44337b AK |
329 | dm_list_init(&node->uses); |
330 | dm_list_init(&node->used_by); | |
331 | dm_list_init(&node->props.segs); | |
3d0480ed AK |
332 | |
333 | dev = MKDEV(info->major, info->minor); | |
334 | ||
b4f1578f | 335 | if (!dm_hash_insert_binary(dtree->devs, (const char *) &dev, |
3d0480ed | 336 | sizeof(dev), node)) { |
b4f1578f AK |
337 | log_error("dtree node hash insertion failed"); |
338 | dm_pool_free(dtree->mem, node); | |
3d0480ed AK |
339 | return NULL; |
340 | } | |
341 | ||
165e4a11 | 342 | if (uuid && *uuid && |
b4f1578f AK |
343 | !dm_hash_insert(dtree->uuids, uuid, node)) { |
344 | log_error("dtree uuid hash insertion failed"); | |
345 | dm_hash_remove_binary(dtree->devs, (const char *) &dev, | |
165e4a11 | 346 | sizeof(dev)); |
b4f1578f | 347 | dm_pool_free(dtree->mem, node); |
165e4a11 AK |
348 | return NULL; |
349 | } | |
350 | ||
3d0480ed AK |
351 | return node; |
352 | } | |
353 | ||
b4f1578f | 354 | static struct dm_tree_node *_find_dm_tree_node(struct dm_tree *dtree, |
3d0480ed AK |
355 | uint32_t major, uint32_t minor) |
356 | { | |
357 | uint64_t dev = MKDEV(major, minor); | |
358 | ||
b4f1578f | 359 | return dm_hash_lookup_binary(dtree->devs, (const char *) &dev, |
3d0480ed AK |
360 | sizeof(dev)); |
361 | } | |
362 | ||
b4f1578f | 363 | static struct dm_tree_node *_find_dm_tree_node_by_uuid(struct dm_tree *dtree, |
165e4a11 AK |
364 | const char *uuid) |
365 | { | |
87f98002 AK |
366 | struct dm_tree_node *node; |
367 | ||
368 | if ((node = dm_hash_lookup(dtree->uuids, uuid))) | |
369 | return node; | |
370 | ||
371 | if (strncmp(uuid, UUID_PREFIX, sizeof(UUID_PREFIX) - 1)) | |
372 | return NULL; | |
373 | ||
374 | return dm_hash_lookup(dtree->uuids, uuid + sizeof(UUID_PREFIX) - 1); | |
165e4a11 AK |
375 | } |
376 | ||
a3f6b2ce | 377 | static int _deps(struct dm_task **dmt, struct dm_pool *mem, uint32_t major, uint32_t minor, |
3d0480ed AK |
378 | const char **name, const char **uuid, |
379 | struct dm_info *info, struct dm_deps **deps) | |
380 | { | |
381 | memset(info, 0, sizeof(*info)); | |
382 | ||
383 | if (!dm_is_dm_major(major)) { | |
384 | *name = ""; | |
385 | *uuid = ""; | |
386 | *deps = NULL; | |
387 | info->major = major; | |
388 | info->minor = minor; | |
389 | info->exists = 0; | |
165e4a11 AK |
390 | info->live_table = 0; |
391 | info->inactive_table = 0; | |
392 | info->read_only = 0; | |
3d0480ed AK |
393 | return 1; |
394 | } | |
395 | ||
396 | if (!(*dmt = dm_task_create(DM_DEVICE_DEPS))) { | |
397 | log_error("deps dm_task creation failed"); | |
398 | return 0; | |
399 | } | |
400 | ||
b4f1578f AK |
401 | if (!dm_task_set_major(*dmt, major)) { |
402 | log_error("_deps: failed to set major for (%" PRIu32 ":%" PRIu32 ")", | |
403 | major, minor); | |
3d0480ed | 404 | goto failed; |
b4f1578f | 405 | } |
3d0480ed | 406 | |
b4f1578f AK |
407 | if (!dm_task_set_minor(*dmt, minor)) { |
408 | log_error("_deps: failed to set minor for (%" PRIu32 ":%" PRIu32 ")", | |
409 | major, minor); | |
3d0480ed | 410 | goto failed; |
b4f1578f | 411 | } |
3d0480ed | 412 | |
b4f1578f AK |
413 | if (!dm_task_run(*dmt)) { |
414 | log_error("_deps: task run failed for (%" PRIu32 ":%" PRIu32 ")", | |
415 | major, minor); | |
3d0480ed | 416 | goto failed; |
b4f1578f | 417 | } |
3d0480ed | 418 | |
b4f1578f AK |
419 | if (!dm_task_get_info(*dmt, info)) { |
420 | log_error("_deps: failed to get info for (%" PRIu32 ":%" PRIu32 ")", | |
421 | major, minor); | |
3d0480ed | 422 | goto failed; |
b4f1578f | 423 | } |
3d0480ed AK |
424 | |
425 | if (!info->exists) { | |
426 | *name = ""; | |
427 | *uuid = ""; | |
428 | *deps = NULL; | |
429 | } else { | |
430 | if (info->major != major) { | |
b4f1578f | 431 | log_error("Inconsistent dtree major number: %u != %u", |
3d0480ed AK |
432 | major, info->major); |
433 | goto failed; | |
434 | } | |
435 | if (info->minor != minor) { | |
b4f1578f | 436 | log_error("Inconsistent dtree minor number: %u != %u", |
3d0480ed AK |
437 | minor, info->minor); |
438 | goto failed; | |
439 | } | |
a3f6b2ce | 440 | if (!(*name = dm_pool_strdup(mem, dm_task_get_name(*dmt)))) { |
3d0480ed AK |
441 | log_error("name pool_strdup failed"); |
442 | goto failed; | |
443 | } | |
a3f6b2ce | 444 | if (!(*uuid = dm_pool_strdup(mem, dm_task_get_uuid(*dmt)))) { |
3d0480ed AK |
445 | log_error("uuid pool_strdup failed"); |
446 | goto failed; | |
447 | } | |
448 | *deps = dm_task_get_deps(*dmt); | |
449 | } | |
450 | ||
451 | return 1; | |
452 | ||
453 | failed: | |
454 | dm_task_destroy(*dmt); | |
455 | return 0; | |
456 | } | |
457 | ||
b4f1578f AK |
458 | static struct dm_tree_node *_add_dev(struct dm_tree *dtree, |
459 | struct dm_tree_node *parent, | |
cda69e17 PR |
460 | uint32_t major, uint32_t minor, |
461 | uint16_t udev_flags) | |
3d0480ed AK |
462 | { |
463 | struct dm_task *dmt = NULL; | |
464 | struct dm_info info; | |
465 | struct dm_deps *deps = NULL; | |
466 | const char *name = NULL; | |
467 | const char *uuid = NULL; | |
b4f1578f | 468 | struct dm_tree_node *node = NULL; |
3d0480ed | 469 | uint32_t i; |
3d0480ed AK |
470 | int new = 0; |
471 | ||
472 | /* Already in tree? */ | |
b4f1578f AK |
473 | if (!(node = _find_dm_tree_node(dtree, major, minor))) { |
474 | if (!_deps(&dmt, dtree->mem, major, minor, &name, &uuid, &info, &deps)) | |
475 | return_NULL; | |
3d0480ed | 476 | |
f16aea9e | 477 | if (!(node = _create_dm_tree_node(dtree, name, uuid, &info, |
cda69e17 | 478 | NULL, udev_flags))) |
b4f1578f | 479 | goto_out; |
3d0480ed AK |
480 | new = 1; |
481 | } | |
482 | ||
165e4a11 AK |
483 | if (!_link_tree_nodes(parent, node)) { |
484 | node = NULL; | |
b4f1578f | 485 | goto_out; |
165e4a11 | 486 | } |
3d0480ed AK |
487 | |
488 | /* If node was already in tree, no need to recurse. */ | |
489 | if (!new) | |
165e4a11 | 490 | goto out; |
3d0480ed AK |
491 | |
492 | /* Can't recurse if not a mapped device or there are no dependencies */ | |
493 | if (!node->info.exists || !deps->count) { | |
b4f1578f AK |
494 | if (!_add_to_bottomlevel(node)) { |
495 | stack; | |
165e4a11 | 496 | node = NULL; |
b4f1578f | 497 | } |
165e4a11 | 498 | goto out; |
3d0480ed AK |
499 | } |
500 | ||
501 | /* Add dependencies to tree */ | |
502 | for (i = 0; i < deps->count; i++) | |
b4f1578f | 503 | if (!_add_dev(dtree, node, MAJOR(deps->device[i]), |
cda69e17 | 504 | MINOR(deps->device[i]), udev_flags)) { |
165e4a11 | 505 | node = NULL; |
b4f1578f | 506 | goto_out; |
165e4a11 | 507 | } |
3d0480ed | 508 | |
3d0480ed AK |
509 | out: |
510 | if (dmt) | |
511 | dm_task_destroy(dmt); | |
512 | ||
165e4a11 AK |
513 | return node; |
514 | } | |
515 | ||
b4f1578f | 516 | static int _node_clear_table(struct dm_tree_node *dnode) |
165e4a11 AK |
517 | { |
518 | struct dm_task *dmt; | |
519 | struct dm_info *info; | |
520 | const char *name; | |
521 | int r; | |
522 | ||
523 | if (!(info = &dnode->info)) { | |
b4f1578f | 524 | log_error("_node_clear_table failed: missing info"); |
165e4a11 AK |
525 | return 0; |
526 | } | |
527 | ||
b4f1578f AK |
528 | if (!(name = dm_tree_node_get_name(dnode))) { |
529 | log_error("_node_clear_table failed: missing name"); | |
165e4a11 AK |
530 | return 0; |
531 | } | |
532 | ||
533 | /* Is there a table? */ | |
534 | if (!info->exists || !info->inactive_table) | |
535 | return 1; | |
536 | ||
537 | log_verbose("Clearing inactive table %s (%" PRIu32 ":%" PRIu32 ")", | |
538 | name, info->major, info->minor); | |
539 | ||
540 | if (!(dmt = dm_task_create(DM_DEVICE_CLEAR))) { | |
541 | dm_task_destroy(dmt); | |
542 | log_error("Table clear dm_task creation failed for %s", name); | |
543 | return 0; | |
544 | } | |
545 | ||
546 | if (!dm_task_set_major(dmt, info->major) || | |
547 | !dm_task_set_minor(dmt, info->minor)) { | |
548 | log_error("Failed to set device number for %s table clear", name); | |
549 | dm_task_destroy(dmt); | |
550 | return 0; | |
551 | } | |
552 | ||
553 | r = dm_task_run(dmt); | |
554 | ||
555 | if (!dm_task_get_info(dmt, info)) { | |
b4f1578f | 556 | log_error("_node_clear_table failed: info missing after running task for %s", name); |
165e4a11 AK |
557 | r = 0; |
558 | } | |
559 | ||
560 | dm_task_destroy(dmt); | |
561 | ||
3d0480ed AK |
562 | return r; |
563 | } | |
564 | ||
b4f1578f | 565 | struct dm_tree_node *dm_tree_add_new_dev(struct dm_tree *dtree, |
165e4a11 AK |
566 | const char *name, |
567 | const char *uuid, | |
568 | uint32_t major, uint32_t minor, | |
569 | int read_only, | |
570 | int clear_inactive, | |
571 | void *context) | |
572 | { | |
b4f1578f | 573 | struct dm_tree_node *dnode; |
165e4a11 AK |
574 | struct dm_info info; |
575 | const char *name2; | |
576 | const char *uuid2; | |
577 | ||
578 | /* Do we need to add node to tree? */ | |
b4f1578f AK |
579 | if (!(dnode = dm_tree_find_node_by_uuid(dtree, uuid))) { |
580 | if (!(name2 = dm_pool_strdup(dtree->mem, name))) { | |
165e4a11 AK |
581 | log_error("name pool_strdup failed"); |
582 | return NULL; | |
583 | } | |
b4f1578f | 584 | if (!(uuid2 = dm_pool_strdup(dtree->mem, uuid))) { |
165e4a11 AK |
585 | log_error("uuid pool_strdup failed"); |
586 | return NULL; | |
587 | } | |
588 | ||
589 | info.major = 0; | |
590 | info.minor = 0; | |
591 | info.exists = 0; | |
592 | info.live_table = 0; | |
593 | info.inactive_table = 0; | |
594 | info.read_only = 0; | |
595 | ||
f16aea9e PR |
596 | if (!(dnode = _create_dm_tree_node(dtree, name2, uuid2, &info, |
597 | context, 0))) | |
b4f1578f | 598 | return_NULL; |
165e4a11 AK |
599 | |
600 | /* Attach to root node until a table is supplied */ | |
b4f1578f AK |
601 | if (!_add_to_toplevel(dnode) || !_add_to_bottomlevel(dnode)) |
602 | return_NULL; | |
165e4a11 AK |
603 | |
604 | dnode->props.major = major; | |
605 | dnode->props.minor = minor; | |
606 | dnode->props.new_name = NULL; | |
bb875bb9 | 607 | dnode->props.size_changed = 0; |
165e4a11 AK |
608 | } else if (strcmp(name, dnode->name)) { |
609 | /* Do we need to rename node? */ | |
b4f1578f | 610 | if (!(dnode->props.new_name = dm_pool_strdup(dtree->mem, name))) { |
165e4a11 AK |
611 | log_error("name pool_strdup failed"); |
612 | return 0; | |
613 | } | |
614 | } | |
615 | ||
616 | dnode->props.read_only = read_only ? 1 : 0; | |
52b84409 AK |
617 | dnode->props.read_ahead = DM_READ_AHEAD_AUTO; |
618 | dnode->props.read_ahead_flags = 0; | |
165e4a11 | 619 | |
b4f1578f AK |
620 | if (clear_inactive && !_node_clear_table(dnode)) |
621 | return_NULL; | |
165e4a11 AK |
622 | |
623 | dnode->context = context; | |
f16aea9e | 624 | dnode->udev_flags = 0; |
165e4a11 AK |
625 | |
626 | return dnode; | |
627 | } | |
628 | ||
f16aea9e PR |
629 | struct dm_tree_node *dm_tree_add_new_dev_with_udev_flags(struct dm_tree *dtree, |
630 | const char *name, | |
631 | const char *uuid, | |
632 | uint32_t major, | |
633 | uint32_t minor, | |
634 | int read_only, | |
635 | int clear_inactive, | |
636 | void *context, | |
637 | uint16_t udev_flags) | |
638 | { | |
639 | struct dm_tree_node *node; | |
640 | ||
641 | if ((node = dm_tree_add_new_dev(dtree, name, uuid, major, minor, read_only, | |
642 | clear_inactive, context))) | |
643 | node->udev_flags = udev_flags; | |
644 | ||
645 | return node; | |
646 | } | |
647 | ||
648 | ||
52b84409 AK |
649 | void dm_tree_node_set_read_ahead(struct dm_tree_node *dnode, |
650 | uint32_t read_ahead, | |
651 | uint32_t read_ahead_flags) | |
08e64ce5 | 652 | { |
52b84409 AK |
653 | dnode->props.read_ahead = read_ahead; |
654 | dnode->props.read_ahead_flags = read_ahead_flags; | |
655 | } | |
656 | ||
b4f1578f | 657 | int dm_tree_add_dev(struct dm_tree *dtree, uint32_t major, uint32_t minor) |
3d0480ed | 658 | { |
cda69e17 PR |
659 | return _add_dev(dtree, &dtree->root, major, minor, 0) ? 1 : 0; |
660 | } | |
661 | ||
662 | int dm_tree_add_dev_with_udev_flags(struct dm_tree *dtree, uint32_t major, | |
663 | uint32_t minor, uint16_t udev_flags) | |
664 | { | |
665 | return _add_dev(dtree, &dtree->root, major, minor, udev_flags) ? 1 : 0; | |
3d0480ed AK |
666 | } |
667 | ||
04bde319 | 668 | const char *dm_tree_node_get_name(const struct dm_tree_node *node) |
3d0480ed AK |
669 | { |
670 | return node->info.exists ? node->name : ""; | |
671 | } | |
672 | ||
04bde319 | 673 | const char *dm_tree_node_get_uuid(const struct dm_tree_node *node) |
3d0480ed AK |
674 | { |
675 | return node->info.exists ? node->uuid : ""; | |
676 | } | |
677 | ||
04bde319 | 678 | const struct dm_info *dm_tree_node_get_info(const struct dm_tree_node *node) |
3d0480ed AK |
679 | { |
680 | return &node->info; | |
681 | } | |
682 | ||
04bde319 | 683 | void *dm_tree_node_get_context(const struct dm_tree_node *node) |
165e4a11 AK |
684 | { |
685 | return node->context; | |
686 | } | |
687 | ||
04bde319 | 688 | int dm_tree_node_size_changed(const struct dm_tree_node *dnode) |
eb91c4ee MB |
689 | { |
690 | return dnode->props.size_changed; | |
691 | } | |
692 | ||
04bde319 | 693 | int dm_tree_node_num_children(const struct dm_tree_node *node, uint32_t inverted) |
3d0480ed AK |
694 | { |
695 | if (inverted) { | |
b4f1578f | 696 | if (_nodes_are_linked(&node->dtree->root, node)) |
3d0480ed | 697 | return 0; |
2c44337b | 698 | return dm_list_size(&node->used_by); |
3d0480ed AK |
699 | } |
700 | ||
b4f1578f | 701 | if (_nodes_are_linked(node, &node->dtree->root)) |
3d0480ed AK |
702 | return 0; |
703 | ||
2c44337b | 704 | return dm_list_size(&node->uses); |
3d0480ed AK |
705 | } |
706 | ||
2b69db1f AK |
707 | /* |
708 | * Returns 1 if no prefix supplied | |
709 | */ | |
710 | static int _uuid_prefix_matches(const char *uuid, const char *uuid_prefix, size_t uuid_prefix_len) | |
711 | { | |
712 | if (!uuid_prefix) | |
713 | return 1; | |
714 | ||
715 | if (!strncmp(uuid, uuid_prefix, uuid_prefix_len)) | |
716 | return 1; | |
717 | ||
718 | /* Handle transition: active device uuids might be missing the prefix */ | |
719 | if (uuid_prefix_len <= 4) | |
720 | return 0; | |
721 | ||
87f98002 | 722 | if (!strncmp(uuid, UUID_PREFIX, sizeof(UUID_PREFIX) - 1)) |
872dea04 AK |
723 | return 0; |
724 | ||
87f98002 | 725 | if (strncmp(uuid_prefix, UUID_PREFIX, sizeof(UUID_PREFIX) - 1)) |
2b69db1f AK |
726 | return 0; |
727 | ||
87f98002 | 728 | if (!strncmp(uuid, uuid_prefix + sizeof(UUID_PREFIX) - 1, uuid_prefix_len - (sizeof(UUID_PREFIX) - 1))) |
2b69db1f AK |
729 | return 1; |
730 | ||
731 | return 0; | |
732 | } | |
733 | ||
690a5da2 AK |
734 | /* |
735 | * Returns 1 if no children. | |
736 | */ | |
b4f1578f | 737 | static int _children_suspended(struct dm_tree_node *node, |
690a5da2 AK |
738 | uint32_t inverted, |
739 | const char *uuid_prefix, | |
740 | size_t uuid_prefix_len) | |
741 | { | |
2c44337b | 742 | struct dm_list *list; |
b4f1578f | 743 | struct dm_tree_link *dlink; |
690a5da2 AK |
744 | const struct dm_info *dinfo; |
745 | const char *uuid; | |
746 | ||
747 | if (inverted) { | |
b4f1578f | 748 | if (_nodes_are_linked(&node->dtree->root, node)) |
690a5da2 AK |
749 | return 1; |
750 | list = &node->used_by; | |
751 | } else { | |
b4f1578f | 752 | if (_nodes_are_linked(node, &node->dtree->root)) |
690a5da2 AK |
753 | return 1; |
754 | list = &node->uses; | |
755 | } | |
756 | ||
2c44337b | 757 | dm_list_iterate_items(dlink, list) { |
b4f1578f | 758 | if (!(uuid = dm_tree_node_get_uuid(dlink->node))) { |
690a5da2 AK |
759 | stack; |
760 | continue; | |
761 | } | |
762 | ||
763 | /* Ignore if it doesn't belong to this VG */ | |
2b69db1f | 764 | if (!_uuid_prefix_matches(uuid, uuid_prefix, uuid_prefix_len)) |
690a5da2 AK |
765 | continue; |
766 | ||
b4f1578f AK |
767 | if (!(dinfo = dm_tree_node_get_info(dlink->node))) { |
768 | stack; /* FIXME Is this normal? */ | |
690a5da2 AK |
769 | return 0; |
770 | } | |
771 | ||
772 | if (!dinfo->suspended) | |
773 | return 0; | |
774 | } | |
775 | ||
776 | return 1; | |
777 | } | |
778 | ||
3d0480ed AK |
779 | /* |
780 | * Set major and minor to zero for root of tree. | |
781 | */ | |
b4f1578f | 782 | struct dm_tree_node *dm_tree_find_node(struct dm_tree *dtree, |
3d0480ed AK |
783 | uint32_t major, |
784 | uint32_t minor) | |
785 | { | |
786 | if (!major && !minor) | |
b4f1578f | 787 | return &dtree->root; |
3d0480ed | 788 | |
b4f1578f | 789 | return _find_dm_tree_node(dtree, major, minor); |
3d0480ed AK |
790 | } |
791 | ||
165e4a11 AK |
792 | /* |
793 | * Set uuid to NULL for root of tree. | |
794 | */ | |
b4f1578f | 795 | struct dm_tree_node *dm_tree_find_node_by_uuid(struct dm_tree *dtree, |
165e4a11 AK |
796 | const char *uuid) |
797 | { | |
798 | if (!uuid || !*uuid) | |
b4f1578f | 799 | return &dtree->root; |
165e4a11 | 800 | |
b4f1578f | 801 | return _find_dm_tree_node_by_uuid(dtree, uuid); |
165e4a11 AK |
802 | } |
803 | ||
3d0480ed AK |
804 | /* |
805 | * First time set *handle to NULL. | |
806 | * Set inverted to invert the tree. | |
807 | */ | |
b4f1578f | 808 | struct dm_tree_node *dm_tree_next_child(void **handle, |
04bde319 ZK |
809 | const struct dm_tree_node *parent, |
810 | uint32_t inverted) | |
3d0480ed | 811 | { |
2c44337b | 812 | struct dm_list **dlink = (struct dm_list **) handle; |
04bde319 | 813 | const struct dm_list *use_list; |
3d0480ed AK |
814 | |
815 | if (inverted) | |
816 | use_list = &parent->used_by; | |
817 | else | |
818 | use_list = &parent->uses; | |
819 | ||
820 | if (!*dlink) | |
2c44337b | 821 | *dlink = dm_list_first(use_list); |
3d0480ed | 822 | else |
2c44337b | 823 | *dlink = dm_list_next(use_list, *dlink); |
3d0480ed | 824 | |
2c44337b | 825 | return (*dlink) ? dm_list_item(*dlink, struct dm_tree_link)->node : NULL; |
3d0480ed AK |
826 | } |
827 | ||
3e8c6b73 | 828 | /* |
a6d97ede | 829 | * Deactivate a device with its dependencies if the uuid prefix matches. |
3e8c6b73 | 830 | */ |
db208f51 AK |
831 | static int _info_by_dev(uint32_t major, uint32_t minor, int with_open_count, |
832 | struct dm_info *info) | |
3e8c6b73 AK |
833 | { |
834 | struct dm_task *dmt; | |
835 | int r; | |
836 | ||
837 | if (!(dmt = dm_task_create(DM_DEVICE_INFO))) { | |
838 | log_error("_info_by_dev: dm_task creation failed"); | |
839 | return 0; | |
840 | } | |
841 | ||
842 | if (!dm_task_set_major(dmt, major) || !dm_task_set_minor(dmt, minor)) { | |
843 | log_error("_info_by_dev: Failed to set device number"); | |
844 | dm_task_destroy(dmt); | |
845 | return 0; | |
846 | } | |
847 | ||
db208f51 AK |
848 | if (!with_open_count && !dm_task_no_open_count(dmt)) |
849 | log_error("Failed to disable open_count"); | |
850 | ||
3e8c6b73 AK |
851 | if ((r = dm_task_run(dmt))) |
852 | r = dm_task_get_info(dmt, info); | |
853 | ||
854 | dm_task_destroy(dmt); | |
855 | ||
856 | return r; | |
857 | } | |
858 | ||
f16aea9e PR |
859 | static int _deactivate_node(const char *name, uint32_t major, uint32_t minor, |
860 | uint32_t *cookie, uint16_t udev_flags) | |
3e8c6b73 AK |
861 | { |
862 | struct dm_task *dmt; | |
bd90c6b2 | 863 | int r = 0; |
3e8c6b73 AK |
864 | |
865 | log_verbose("Removing %s (%" PRIu32 ":%" PRIu32 ")", name, major, minor); | |
866 | ||
867 | if (!(dmt = dm_task_create(DM_DEVICE_REMOVE))) { | |
868 | log_error("Deactivation dm_task creation failed for %s", name); | |
869 | return 0; | |
870 | } | |
871 | ||
872 | if (!dm_task_set_major(dmt, major) || !dm_task_set_minor(dmt, minor)) { | |
873 | log_error("Failed to set device number for %s deactivation", name); | |
bd90c6b2 | 874 | goto out; |
3e8c6b73 AK |
875 | } |
876 | ||
877 | if (!dm_task_no_open_count(dmt)) | |
878 | log_error("Failed to disable open_count"); | |
879 | ||
f16aea9e | 880 | if (!dm_task_set_cookie(dmt, cookie, udev_flags)) |
bd90c6b2 AK |
881 | goto out; |
882 | ||
3e8c6b73 AK |
883 | r = dm_task_run(dmt); |
884 | ||
165e4a11 | 885 | /* FIXME Until kernel returns actual name so dm-ioctl.c can handle it */ |
cda69e17 PR |
886 | rm_dev_node(name, dmt->cookie_set && |
887 | !(udev_flags & DM_UDEV_DISABLE_DM_RULES_FLAG)); | |
165e4a11 | 888 | |
db208f51 AK |
889 | /* FIXME Remove node from tree or mark invalid? */ |
890 | ||
bd90c6b2 | 891 | out: |
db208f51 AK |
892 | dm_task_destroy(dmt); |
893 | ||
894 | return r; | |
895 | } | |
896 | ||
bd90c6b2 | 897 | static int _rename_node(const char *old_name, const char *new_name, uint32_t major, |
f16aea9e | 898 | uint32_t minor, uint32_t *cookie, uint16_t udev_flags) |
165e4a11 AK |
899 | { |
900 | struct dm_task *dmt; | |
901 | int r = 0; | |
902 | ||
903 | log_verbose("Renaming %s (%" PRIu32 ":%" PRIu32 ") to %s", old_name, major, minor, new_name); | |
904 | ||
905 | if (!(dmt = dm_task_create(DM_DEVICE_RENAME))) { | |
906 | log_error("Rename dm_task creation failed for %s", old_name); | |
907 | return 0; | |
908 | } | |
909 | ||
910 | if (!dm_task_set_name(dmt, old_name)) { | |
911 | log_error("Failed to set name for %s rename.", old_name); | |
912 | goto out; | |
913 | } | |
914 | ||
b4f1578f AK |
915 | if (!dm_task_set_newname(dmt, new_name)) |
916 | goto_out; | |
165e4a11 AK |
917 | |
918 | if (!dm_task_no_open_count(dmt)) | |
919 | log_error("Failed to disable open_count"); | |
920 | ||
f16aea9e | 921 | if (!dm_task_set_cookie(dmt, cookie, udev_flags)) |
bd90c6b2 AK |
922 | goto out; |
923 | ||
165e4a11 AK |
924 | r = dm_task_run(dmt); |
925 | ||
926 | out: | |
927 | dm_task_destroy(dmt); | |
928 | ||
929 | return r; | |
930 | } | |
931 | ||
165e4a11 AK |
932 | /* FIXME Merge with _suspend_node? */ |
933 | static int _resume_node(const char *name, uint32_t major, uint32_t minor, | |
52b84409 | 934 | uint32_t read_ahead, uint32_t read_ahead_flags, |
f16aea9e PR |
935 | struct dm_info *newinfo, uint32_t *cookie, |
936 | uint16_t udev_flags) | |
165e4a11 AK |
937 | { |
938 | struct dm_task *dmt; | |
bd90c6b2 | 939 | int r = 0; |
165e4a11 AK |
940 | |
941 | log_verbose("Resuming %s (%" PRIu32 ":%" PRIu32 ")", name, major, minor); | |
942 | ||
943 | if (!(dmt = dm_task_create(DM_DEVICE_RESUME))) { | |
944 | log_error("Suspend dm_task creation failed for %s", name); | |
945 | return 0; | |
946 | } | |
947 | ||
0b7d16bc AK |
948 | /* FIXME Kernel should fill in name on return instead */ |
949 | if (!dm_task_set_name(dmt, name)) { | |
950 | log_error("Failed to set readahead device name for %s", name); | |
bd90c6b2 | 951 | goto out; |
0b7d16bc AK |
952 | } |
953 | ||
165e4a11 AK |
954 | if (!dm_task_set_major(dmt, major) || !dm_task_set_minor(dmt, minor)) { |
955 | log_error("Failed to set device number for %s resumption.", name); | |
bd90c6b2 | 956 | goto out; |
165e4a11 AK |
957 | } |
958 | ||
959 | if (!dm_task_no_open_count(dmt)) | |
960 | log_error("Failed to disable open_count"); | |
961 | ||
52b84409 AK |
962 | if (!dm_task_set_read_ahead(dmt, read_ahead, read_ahead_flags)) |
963 | log_error("Failed to set read ahead"); | |
964 | ||
f16aea9e | 965 | if (!dm_task_set_cookie(dmt, cookie, udev_flags)) |
bd90c6b2 AK |
966 | goto out; |
967 | ||
165e4a11 AK |
968 | if ((r = dm_task_run(dmt))) |
969 | r = dm_task_get_info(dmt, newinfo); | |
970 | ||
bd90c6b2 | 971 | out: |
165e4a11 AK |
972 | dm_task_destroy(dmt); |
973 | ||
974 | return r; | |
975 | } | |
976 | ||
db208f51 | 977 | static int _suspend_node(const char *name, uint32_t major, uint32_t minor, |
b9ffd32c | 978 | int skip_lockfs, int no_flush, struct dm_info *newinfo) |
db208f51 AK |
979 | { |
980 | struct dm_task *dmt; | |
981 | int r; | |
982 | ||
b9ffd32c AK |
983 | log_verbose("Suspending %s (%" PRIu32 ":%" PRIu32 ")%s%s", |
984 | name, major, minor, | |
985 | skip_lockfs ? "" : " with filesystem sync", | |
6e1898a5 | 986 | no_flush ? "" : " with device flush"); |
db208f51 AK |
987 | |
988 | if (!(dmt = dm_task_create(DM_DEVICE_SUSPEND))) { | |
989 | log_error("Suspend dm_task creation failed for %s", name); | |
990 | return 0; | |
991 | } | |
992 | ||
993 | if (!dm_task_set_major(dmt, major) || !dm_task_set_minor(dmt, minor)) { | |
994 | log_error("Failed to set device number for %s suspension.", name); | |
995 | dm_task_destroy(dmt); | |
996 | return 0; | |
997 | } | |
998 | ||
999 | if (!dm_task_no_open_count(dmt)) | |
1000 | log_error("Failed to disable open_count"); | |
1001 | ||
c55b1410 AK |
1002 | if (skip_lockfs && !dm_task_skip_lockfs(dmt)) |
1003 | log_error("Failed to set skip_lockfs flag."); | |
1004 | ||
b9ffd32c AK |
1005 | if (no_flush && !dm_task_no_flush(dmt)) |
1006 | log_error("Failed to set no_flush flag."); | |
1007 | ||
db208f51 AK |
1008 | if ((r = dm_task_run(dmt))) |
1009 | r = dm_task_get_info(dmt, newinfo); | |
1010 | ||
3e8c6b73 AK |
1011 | dm_task_destroy(dmt); |
1012 | ||
1013 | return r; | |
1014 | } | |
1015 | ||
b4f1578f | 1016 | int dm_tree_deactivate_children(struct dm_tree_node *dnode, |
a6d97ede AK |
1017 | const char *uuid_prefix, |
1018 | size_t uuid_prefix_len) | |
3e8c6b73 | 1019 | { |
b7eb2ad0 | 1020 | int r = 1; |
3e8c6b73 | 1021 | void *handle = NULL; |
b4f1578f | 1022 | struct dm_tree_node *child = dnode; |
3e8c6b73 AK |
1023 | struct dm_info info; |
1024 | const struct dm_info *dinfo; | |
1025 | const char *name; | |
1026 | const char *uuid; | |
1027 | ||
b4f1578f AK |
1028 | while ((child = dm_tree_next_child(&handle, dnode, 0))) { |
1029 | if (!(dinfo = dm_tree_node_get_info(child))) { | |
3e8c6b73 AK |
1030 | stack; |
1031 | continue; | |
1032 | } | |
1033 | ||
b4f1578f | 1034 | if (!(name = dm_tree_node_get_name(child))) { |
3e8c6b73 AK |
1035 | stack; |
1036 | continue; | |
1037 | } | |
1038 | ||
b4f1578f | 1039 | if (!(uuid = dm_tree_node_get_uuid(child))) { |
3e8c6b73 AK |
1040 | stack; |
1041 | continue; | |
1042 | } | |
1043 | ||
1044 | /* Ignore if it doesn't belong to this VG */ | |
2b69db1f | 1045 | if (!_uuid_prefix_matches(uuid, uuid_prefix, uuid_prefix_len)) |
3e8c6b73 | 1046 | continue; |
3e8c6b73 AK |
1047 | |
1048 | /* Refresh open_count */ | |
db208f51 | 1049 | if (!_info_by_dev(dinfo->major, dinfo->minor, 1, &info) || |
f55021f4 | 1050 | !info.exists) |
3e8c6b73 AK |
1051 | continue; |
1052 | ||
f55021f4 | 1053 | if (info.open_count) { |
e6ff36ab AK |
1054 | log_error("Unable to deactivate open %s (%" PRIu32 |
1055 | ":%" PRIu32 ")", name, info.major, | |
1056 | info.minor); | |
f55021f4 AK |
1057 | r = 0; |
1058 | continue; | |
1059 | } | |
1060 | ||
f16aea9e | 1061 | if (!_deactivate_node(name, info.major, info.minor, |
584d1fb7 | 1062 | &child->dtree->cookie, child->udev_flags)) { |
3e8c6b73 AK |
1063 | log_error("Unable to deactivate %s (%" PRIu32 |
1064 | ":%" PRIu32 ")", name, info.major, | |
1065 | info.minor); | |
b7eb2ad0 | 1066 | r = 0; |
3e8c6b73 AK |
1067 | continue; |
1068 | } | |
1069 | ||
b4f1578f | 1070 | if (dm_tree_node_num_children(child, 0)) |
b7eb2ad0 MS |
1071 | if (!dm_tree_deactivate_children(child, uuid_prefix, uuid_prefix_len)) |
1072 | return_0; | |
3e8c6b73 AK |
1073 | } |
1074 | ||
b7eb2ad0 | 1075 | return r; |
3e8c6b73 | 1076 | } |
db208f51 | 1077 | |
c55b1410 AK |
1078 | void dm_tree_skip_lockfs(struct dm_tree_node *dnode) |
1079 | { | |
1080 | dnode->dtree->skip_lockfs = 1; | |
1081 | } | |
1082 | ||
b9ffd32c AK |
1083 | void dm_tree_use_no_flush_suspend(struct dm_tree_node *dnode) |
1084 | { | |
1085 | dnode->dtree->no_flush = 1; | |
1086 | } | |
1087 | ||
b4f1578f | 1088 | int dm_tree_suspend_children(struct dm_tree_node *dnode, |
08e64ce5 ZK |
1089 | const char *uuid_prefix, |
1090 | size_t uuid_prefix_len) | |
db208f51 | 1091 | { |
68085c93 | 1092 | int r = 1; |
db208f51 | 1093 | void *handle = NULL; |
b4f1578f | 1094 | struct dm_tree_node *child = dnode; |
db208f51 AK |
1095 | struct dm_info info, newinfo; |
1096 | const struct dm_info *dinfo; | |
1097 | const char *name; | |
1098 | const char *uuid; | |
1099 | ||
690a5da2 | 1100 | /* Suspend nodes at this level of the tree */ |
b4f1578f AK |
1101 | while ((child = dm_tree_next_child(&handle, dnode, 0))) { |
1102 | if (!(dinfo = dm_tree_node_get_info(child))) { | |
db208f51 AK |
1103 | stack; |
1104 | continue; | |
1105 | } | |
1106 | ||
b4f1578f | 1107 | if (!(name = dm_tree_node_get_name(child))) { |
db208f51 AK |
1108 | stack; |
1109 | continue; | |
1110 | } | |
1111 | ||
b4f1578f | 1112 | if (!(uuid = dm_tree_node_get_uuid(child))) { |
db208f51 AK |
1113 | stack; |
1114 | continue; | |
1115 | } | |
1116 | ||
1117 | /* Ignore if it doesn't belong to this VG */ | |
2b69db1f | 1118 | if (!_uuid_prefix_matches(uuid, uuid_prefix, uuid_prefix_len)) |
db208f51 AK |
1119 | continue; |
1120 | ||
690a5da2 AK |
1121 | /* Ensure immediate parents are already suspended */ |
1122 | if (!_children_suspended(child, 1, uuid_prefix, uuid_prefix_len)) | |
1123 | continue; | |
1124 | ||
db208f51 | 1125 | if (!_info_by_dev(dinfo->major, dinfo->minor, 0, &info) || |
b700541f | 1126 | !info.exists || info.suspended) |
db208f51 AK |
1127 | continue; |
1128 | ||
c55b1410 | 1129 | if (!_suspend_node(name, info.major, info.minor, |
b9ffd32c AK |
1130 | child->dtree->skip_lockfs, |
1131 | child->dtree->no_flush, &newinfo)) { | |
db208f51 AK |
1132 | log_error("Unable to suspend %s (%" PRIu32 |
1133 | ":%" PRIu32 ")", name, info.major, | |
1134 | info.minor); | |
68085c93 | 1135 | r = 0; |
db208f51 AK |
1136 | continue; |
1137 | } | |
1138 | ||
1139 | /* Update cached info */ | |
1140 | child->info = newinfo; | |
690a5da2 AK |
1141 | } |
1142 | ||
1143 | /* Then suspend any child nodes */ | |
1144 | handle = NULL; | |
1145 | ||
b4f1578f AK |
1146 | while ((child = dm_tree_next_child(&handle, dnode, 0))) { |
1147 | if (!(uuid = dm_tree_node_get_uuid(child))) { | |
690a5da2 AK |
1148 | stack; |
1149 | continue; | |
1150 | } | |
1151 | ||
1152 | /* Ignore if it doesn't belong to this VG */ | |
87f98002 | 1153 | if (!_uuid_prefix_matches(uuid, uuid_prefix, uuid_prefix_len)) |
690a5da2 | 1154 | continue; |
db208f51 | 1155 | |
b4f1578f | 1156 | if (dm_tree_node_num_children(child, 0)) |
68085c93 MS |
1157 | if (!dm_tree_suspend_children(child, uuid_prefix, uuid_prefix_len)) |
1158 | return_0; | |
db208f51 AK |
1159 | } |
1160 | ||
68085c93 | 1161 | return r; |
db208f51 AK |
1162 | } |
1163 | ||
b4f1578f | 1164 | int dm_tree_activate_children(struct dm_tree_node *dnode, |
db208f51 AK |
1165 | const char *uuid_prefix, |
1166 | size_t uuid_prefix_len) | |
1167 | { | |
2ca6b865 | 1168 | int r = 1; |
db208f51 | 1169 | void *handle = NULL; |
b4f1578f | 1170 | struct dm_tree_node *child = dnode; |
165e4a11 AK |
1171 | struct dm_info newinfo; |
1172 | const char *name; | |
db208f51 | 1173 | const char *uuid; |
56c28292 | 1174 | int priority; |
db208f51 | 1175 | |
165e4a11 | 1176 | /* Activate children first */ |
b4f1578f AK |
1177 | while ((child = dm_tree_next_child(&handle, dnode, 0))) { |
1178 | if (!(uuid = dm_tree_node_get_uuid(child))) { | |
165e4a11 AK |
1179 | stack; |
1180 | continue; | |
db208f51 AK |
1181 | } |
1182 | ||
908db078 AK |
1183 | if (!_uuid_prefix_matches(uuid, uuid_prefix, uuid_prefix_len)) |
1184 | continue; | |
db208f51 | 1185 | |
b4f1578f | 1186 | if (dm_tree_node_num_children(child, 0)) |
2ca6b865 MS |
1187 | if (!dm_tree_activate_children(child, uuid_prefix, uuid_prefix_len)) |
1188 | return_0; | |
56c28292 | 1189 | } |
165e4a11 | 1190 | |
56c28292 | 1191 | handle = NULL; |
165e4a11 | 1192 | |
aa6f4e51 | 1193 | for (priority = 0; priority < 3; priority++) { |
56c28292 AK |
1194 | while ((child = dm_tree_next_child(&handle, dnode, 0))) { |
1195 | if (!(uuid = dm_tree_node_get_uuid(child))) { | |
1196 | stack; | |
1197 | continue; | |
165e4a11 | 1198 | } |
165e4a11 | 1199 | |
56c28292 AK |
1200 | if (!_uuid_prefix_matches(uuid, uuid_prefix, uuid_prefix_len)) |
1201 | continue; | |
165e4a11 | 1202 | |
56c28292 AK |
1203 | if (priority != child->activation_priority) |
1204 | continue; | |
165e4a11 | 1205 | |
56c28292 AK |
1206 | if (!(name = dm_tree_node_get_name(child))) { |
1207 | stack; | |
1208 | continue; | |
1209 | } | |
1210 | ||
1211 | /* Rename? */ | |
1212 | if (child->props.new_name) { | |
bd90c6b2 | 1213 | if (!_rename_node(name, child->props.new_name, child->info.major, |
f16aea9e PR |
1214 | child->info.minor, &child->dtree->cookie, |
1215 | child->udev_flags)) { | |
56c28292 AK |
1216 | log_error("Failed to rename %s (%" PRIu32 |
1217 | ":%" PRIu32 ") to %s", name, child->info.major, | |
1218 | child->info.minor, child->props.new_name); | |
1219 | return 0; | |
1220 | } | |
1221 | child->name = child->props.new_name; | |
1222 | child->props.new_name = NULL; | |
1223 | } | |
1224 | ||
1225 | if (!child->info.inactive_table && !child->info.suspended) | |
1226 | continue; | |
1227 | ||
bafa2f39 | 1228 | if (!_resume_node(child->name, child->info.major, child->info.minor, |
bd90c6b2 | 1229 | child->props.read_ahead, child->props.read_ahead_flags, |
f16aea9e | 1230 | &newinfo, &child->dtree->cookie, child->udev_flags)) { |
56c28292 | 1231 | log_error("Unable to resume %s (%" PRIu32 |
bafa2f39 | 1232 | ":%" PRIu32 ")", child->name, child->info.major, |
56c28292 | 1233 | child->info.minor); |
2ca6b865 | 1234 | r = 0; |
56c28292 AK |
1235 | continue; |
1236 | } | |
1237 | ||
1238 | /* Update cached info */ | |
1239 | child->info = newinfo; | |
1240 | } | |
db208f51 AK |
1241 | } |
1242 | ||
165e4a11 AK |
1243 | handle = NULL; |
1244 | ||
2ca6b865 | 1245 | return r; |
165e4a11 AK |
1246 | } |
1247 | ||
b4f1578f | 1248 | static int _create_node(struct dm_tree_node *dnode) |
165e4a11 AK |
1249 | { |
1250 | int r = 0; | |
1251 | struct dm_task *dmt; | |
1252 | ||
1253 | log_verbose("Creating %s", dnode->name); | |
1254 | ||
1255 | if (!(dmt = dm_task_create(DM_DEVICE_CREATE))) { | |
1256 | log_error("Create dm_task creation failed for %s", dnode->name); | |
1257 | return 0; | |
1258 | } | |
1259 | ||
1260 | if (!dm_task_set_name(dmt, dnode->name)) { | |
1261 | log_error("Failed to set device name for %s", dnode->name); | |
1262 | goto out; | |
1263 | } | |
1264 | ||
1265 | if (!dm_task_set_uuid(dmt, dnode->uuid)) { | |
1266 | log_error("Failed to set uuid for %s", dnode->name); | |
1267 | goto out; | |
1268 | } | |
1269 | ||
1270 | if (dnode->props.major && | |
1271 | (!dm_task_set_major(dmt, dnode->props.major) || | |
1272 | !dm_task_set_minor(dmt, dnode->props.minor))) { | |
1273 | log_error("Failed to set device number for %s creation.", dnode->name); | |
1274 | goto out; | |
1275 | } | |
1276 | ||
1277 | if (dnode->props.read_only && !dm_task_set_ro(dmt)) { | |
1278 | log_error("Failed to set read only flag for %s", dnode->name); | |
1279 | goto out; | |
1280 | } | |
1281 | ||
1282 | if (!dm_task_no_open_count(dmt)) | |
1283 | log_error("Failed to disable open_count"); | |
1284 | ||
1285 | if ((r = dm_task_run(dmt))) | |
1286 | r = dm_task_get_info(dmt, &dnode->info); | |
1287 | ||
1288 | out: | |
1289 | dm_task_destroy(dmt); | |
1290 | ||
1291 | return r; | |
1292 | } | |
1293 | ||
1294 | ||
b4f1578f | 1295 | static int _build_dev_string(char *devbuf, size_t bufsize, struct dm_tree_node *node) |
165e4a11 AK |
1296 | { |
1297 | if (!dm_format_dev(devbuf, bufsize, node->info.major, node->info.minor)) { | |
1298 | log_error("Failed to format %s device number for %s as dm " | |
1299 | "target (%u,%u)", | |
1300 | node->name, node->uuid, node->info.major, node->info.minor); | |
1301 | return 0; | |
1302 | } | |
1303 | ||
1304 | return 1; | |
1305 | } | |
1306 | ||
ffa9b6a5 ZK |
1307 | /* simplify string emiting code */ |
1308 | #define EMIT_PARAMS(p, str...)\ | |
7b6c011c AK |
1309 | do {\ |
1310 | int w;\ | |
1311 | if ((w = dm_snprintf(params + p, paramsize - (size_t) p, str)) < 0) {\ | |
1312 | stack; /* Out of space */\ | |
1313 | return -1;\ | |
1314 | }\ | |
1315 | p += w;\ | |
1316 | } while (0) | |
ffa9b6a5 | 1317 | |
3c74075f JEB |
1318 | /* |
1319 | * _emit_areas_line | |
1320 | * | |
1321 | * Returns: 1 on success, 0 on failure | |
1322 | */ | |
4dcaa230 AK |
1323 | static int _emit_areas_line(struct dm_task *dmt __attribute((unused)), |
1324 | struct load_segment *seg, char *params, | |
1325 | size_t paramsize, int *pos) | |
165e4a11 AK |
1326 | { |
1327 | struct seg_area *area; | |
7d7d93ac | 1328 | char devbuf[DM_FORMAT_DEV_BUFSIZE]; |
609faae9 | 1329 | unsigned first_time = 1; |
165e4a11 | 1330 | |
2c44337b | 1331 | dm_list_iterate_items(area, &seg->areas) { |
b4f1578f AK |
1332 | if (!_build_dev_string(devbuf, sizeof(devbuf), area->dev_node)) |
1333 | return_0; | |
165e4a11 | 1334 | |
609faae9 AK |
1335 | EMIT_PARAMS(*pos, "%s%s %" PRIu64, first_time ? "" : " ", |
1336 | devbuf, area->offset); | |
1337 | ||
1338 | first_time = 0; | |
165e4a11 AK |
1339 | } |
1340 | ||
1341 | return 1; | |
1342 | } | |
1343 | ||
3c74075f | 1344 | /* |
3c74075f JEB |
1345 | * Returns: 1 on success, 0 on failure |
1346 | */ | |
536f0e08 AK |
1347 | static int _mirror_emit_segment_line(struct dm_task *dmt, uint32_t major, |
1348 | uint32_t minor, struct load_segment *seg, | |
1349 | uint64_t *seg_start, char *params, | |
1350 | size_t paramsize) | |
165e4a11 | 1351 | { |
8f26e18c JEB |
1352 | int r; |
1353 | int block_on_error = 0; | |
1354 | int handle_errors = 0; | |
1355 | int dm_log_userspace = 0; | |
1356 | struct utsname uts; | |
dbcb64b8 | 1357 | unsigned log_parm_count; |
ffa9b6a5 | 1358 | int pos = 0; |
7d7d93ac | 1359 | char logbuf[DM_FORMAT_DEV_BUFSIZE]; |
dbcb64b8 | 1360 | const char *logtype; |
165e4a11 | 1361 | |
8f26e18c JEB |
1362 | r = uname(&uts); |
1363 | if (r) | |
1364 | return_0; | |
67b25ed4 | 1365 | |
8f26e18c JEB |
1366 | if ((seg->flags & DM_BLOCK_ON_ERROR)) { |
1367 | /* | |
1368 | * Originally, block_on_error was an argument to the log | |
1369 | * portion of the mirror CTR table. It was renamed to | |
1370 | * "handle_errors" and now resides in the 'features' | |
1371 | * section of the mirror CTR table (i.e. at the end). | |
1372 | * | |
1373 | * We can identify whether to use "block_on_error" or | |
1374 | * "handle_errors" by the dm-mirror module's version | |
1375 | * number (>= 1.12) or by the kernel version (>= 2.6.22). | |
1376 | */ | |
1377 | if (strncmp(uts.release, "2.6.22", 6) >= 0) | |
1378 | handle_errors = 1; | |
1379 | else | |
1380 | block_on_error = 1; | |
1381 | } | |
1382 | ||
1383 | if (seg->clustered) { | |
1384 | /* Cluster mirrors require a UUID */ | |
1385 | if (!seg->uuid) | |
1386 | return_0; | |
1387 | ||
1388 | /* | |
1389 | * Cluster mirrors used to have their own log | |
1390 | * types. Now they are accessed through the | |
1391 | * userspace log type. | |
1392 | * | |
1393 | * The dm-log-userspace module was added to the | |
1394 | * 2.6.31 kernel. | |
1395 | */ | |
1396 | if (strncmp(uts.release, "2.6.31", 6) >= 0) | |
1397 | dm_log_userspace = 1; | |
1398 | } | |
1399 | ||
1400 | /* Region size */ | |
1401 | log_parm_count = 1; | |
1402 | ||
1403 | /* [no]sync, block_on_error etc. */ | |
1404 | log_parm_count += hweight32(seg->flags); | |
311d6d81 | 1405 | |
8f26e18c JEB |
1406 | /* "handle_errors" is a feature arg now */ |
1407 | if (handle_errors) | |
1408 | log_parm_count--; | |
1409 | ||
1410 | /* DM_CORELOG does not count in the param list */ | |
1411 | if (seg->flags & DM_CORELOG) | |
1412 | log_parm_count--; | |
1413 | ||
1414 | if (seg->clustered) { | |
1415 | log_parm_count++; /* For UUID */ | |
1416 | ||
1417 | if (!dm_log_userspace) | |
ffa9b6a5 | 1418 | EMIT_PARAMS(pos, "clustered-"); |
49b95a5e JEB |
1419 | else |
1420 | /* For clustered-* type field inserted later */ | |
1421 | log_parm_count++; | |
8f26e18c | 1422 | } |
dbcb64b8 | 1423 | |
8f26e18c JEB |
1424 | if (!seg->log) |
1425 | logtype = "core"; | |
1426 | else { | |
1427 | logtype = "disk"; | |
1428 | log_parm_count++; | |
1429 | if (!_build_dev_string(logbuf, sizeof(logbuf), seg->log)) | |
1430 | return_0; | |
1431 | } | |
dbcb64b8 | 1432 | |
8f26e18c JEB |
1433 | if (dm_log_userspace) |
1434 | EMIT_PARAMS(pos, "userspace %u %s clustered-%s", | |
1435 | log_parm_count, seg->uuid, logtype); | |
1436 | else | |
ffa9b6a5 | 1437 | EMIT_PARAMS(pos, "%s %u", logtype, log_parm_count); |
dbcb64b8 | 1438 | |
8f26e18c JEB |
1439 | if (seg->log) |
1440 | EMIT_PARAMS(pos, " %s", logbuf); | |
1441 | ||
1442 | EMIT_PARAMS(pos, " %u", seg->region_size); | |
dbcb64b8 | 1443 | |
8f26e18c JEB |
1444 | if (seg->clustered && !dm_log_userspace) |
1445 | EMIT_PARAMS(pos, " %s", seg->uuid); | |
67b25ed4 | 1446 | |
8f26e18c JEB |
1447 | if ((seg->flags & DM_NOSYNC)) |
1448 | EMIT_PARAMS(pos, " nosync"); | |
1449 | else if ((seg->flags & DM_FORCESYNC)) | |
1450 | EMIT_PARAMS(pos, " sync"); | |
dbcb64b8 | 1451 | |
8f26e18c JEB |
1452 | if (block_on_error) |
1453 | EMIT_PARAMS(pos, " block_on_error"); | |
1454 | ||
1455 | EMIT_PARAMS(pos, " %u ", seg->mirror_area_count); | |
1456 | ||
3c74075f JEB |
1457 | if ((r = _emit_areas_line(dmt, seg, params, paramsize, &pos)) <= 0) |
1458 | return_0; | |
dbcb64b8 | 1459 | |
8f26e18c JEB |
1460 | if (handle_errors) |
1461 | EMIT_PARAMS(pos, " 1 handle_errors"); | |
ffa9b6a5 | 1462 | |
3c74075f | 1463 | return 1; |
8f26e18c JEB |
1464 | } |
1465 | ||
1466 | static int _emit_segment_line(struct dm_task *dmt, uint32_t major, | |
1467 | uint32_t minor, struct load_segment *seg, | |
1468 | uint64_t *seg_start, char *params, | |
1469 | size_t paramsize) | |
1470 | { | |
1471 | int pos = 0; | |
1472 | int r; | |
1473 | char originbuf[DM_FORMAT_DEV_BUFSIZE], cowbuf[DM_FORMAT_DEV_BUFSIZE]; | |
dbcb64b8 | 1474 | |
8f26e18c JEB |
1475 | switch(seg->type) { |
1476 | case SEG_ERROR: | |
1477 | case SEG_ZERO: | |
1478 | case SEG_LINEAR: | |
1479 | break; | |
1480 | case SEG_MIRRORED: | |
1481 | /* Mirrors are pretty complicated - now in separate function */ | |
536f0e08 AK |
1482 | r = _mirror_emit_segment_line(dmt, major, minor, seg, seg_start, |
1483 | params, paramsize); | |
3c74075f JEB |
1484 | if (!r) |
1485 | return_0; | |
165e4a11 AK |
1486 | break; |
1487 | case SEG_SNAPSHOT: | |
aa6f4e51 | 1488 | case SEG_SNAPSHOT_MERGE: |
b4f1578f AK |
1489 | if (!_build_dev_string(originbuf, sizeof(originbuf), seg->origin)) |
1490 | return_0; | |
1491 | if (!_build_dev_string(cowbuf, sizeof(cowbuf), seg->cow)) | |
1492 | return_0; | |
ffa9b6a5 ZK |
1493 | EMIT_PARAMS(pos, "%s %s %c %d", originbuf, cowbuf, |
1494 | seg->persistent ? 'P' : 'N', seg->chunk_size); | |
165e4a11 AK |
1495 | break; |
1496 | case SEG_SNAPSHOT_ORIGIN: | |
b4f1578f AK |
1497 | if (!_build_dev_string(originbuf, sizeof(originbuf), seg->origin)) |
1498 | return_0; | |
ffa9b6a5 | 1499 | EMIT_PARAMS(pos, "%s", originbuf); |
165e4a11 AK |
1500 | break; |
1501 | case SEG_STRIPED: | |
609faae9 | 1502 | EMIT_PARAMS(pos, "%u %u ", seg->area_count, seg->stripe_size); |
165e4a11 | 1503 | break; |
12ca060e | 1504 | case SEG_CRYPT: |
609faae9 | 1505 | EMIT_PARAMS(pos, "%s%s%s%s%s %s %" PRIu64 " ", seg->cipher, |
12ca060e MB |
1506 | seg->chainmode ? "-" : "", seg->chainmode ?: "", |
1507 | seg->iv ? "-" : "", seg->iv ?: "", seg->key, | |
1508 | seg->iv_offset != DM_CRYPT_IV_DEFAULT ? | |
1509 | seg->iv_offset : *seg_start); | |
1510 | break; | |
165e4a11 AK |
1511 | } |
1512 | ||
1513 | switch(seg->type) { | |
1514 | case SEG_ERROR: | |
1515 | case SEG_SNAPSHOT: | |
1516 | case SEG_SNAPSHOT_ORIGIN: | |
aa6f4e51 | 1517 | case SEG_SNAPSHOT_MERGE: |
165e4a11 AK |
1518 | case SEG_ZERO: |
1519 | break; | |
12ca060e | 1520 | case SEG_CRYPT: |
165e4a11 | 1521 | case SEG_LINEAR: |
165e4a11 AK |
1522 | case SEG_STRIPED: |
1523 | if ((r = _emit_areas_line(dmt, seg, params, paramsize, &pos)) <= 0) { | |
1524 | stack; | |
1525 | return r; | |
1526 | } | |
1527 | break; | |
1528 | } | |
1529 | ||
4b2cae46 AK |
1530 | log_debug("Adding target to (%" PRIu32 ":%" PRIu32 "): %" PRIu64 |
1531 | " %" PRIu64 " %s %s", major, minor, | |
165e4a11 AK |
1532 | *seg_start, seg->size, dm_segtypes[seg->type].target, params); |
1533 | ||
b4f1578f AK |
1534 | if (!dm_task_add_target(dmt, *seg_start, seg->size, dm_segtypes[seg->type].target, params)) |
1535 | return_0; | |
165e4a11 AK |
1536 | |
1537 | *seg_start += seg->size; | |
1538 | ||
1539 | return 1; | |
1540 | } | |
1541 | ||
ffa9b6a5 ZK |
1542 | #undef EMIT_PARAMS |
1543 | ||
4b2cae46 AK |
1544 | static int _emit_segment(struct dm_task *dmt, uint32_t major, uint32_t minor, |
1545 | struct load_segment *seg, uint64_t *seg_start) | |
165e4a11 AK |
1546 | { |
1547 | char *params; | |
1548 | size_t paramsize = 4096; | |
1549 | int ret; | |
1550 | ||
1551 | do { | |
1552 | if (!(params = dm_malloc(paramsize))) { | |
1553 | log_error("Insufficient space for target parameters."); | |
1554 | return 0; | |
1555 | } | |
1556 | ||
12ea7cb1 | 1557 | params[0] = '\0'; |
4b2cae46 AK |
1558 | ret = _emit_segment_line(dmt, major, minor, seg, seg_start, |
1559 | params, paramsize); | |
165e4a11 AK |
1560 | dm_free(params); |
1561 | ||
1562 | if (!ret) | |
1563 | stack; | |
1564 | ||
1565 | if (ret >= 0) | |
1566 | return ret; | |
1567 | ||
1568 | log_debug("Insufficient space in params[%" PRIsize_t | |
1569 | "] for target parameters.", paramsize); | |
1570 | ||
1571 | paramsize *= 2; | |
1572 | } while (paramsize < MAX_TARGET_PARAMSIZE); | |
1573 | ||
1574 | log_error("Target parameter size too big. Aborting."); | |
1575 | return 0; | |
1576 | } | |
1577 | ||
b4f1578f | 1578 | static int _load_node(struct dm_tree_node *dnode) |
165e4a11 AK |
1579 | { |
1580 | int r = 0; | |
1581 | struct dm_task *dmt; | |
1582 | struct load_segment *seg; | |
1583 | uint64_t seg_start = 0; | |
1584 | ||
4b2cae46 AK |
1585 | log_verbose("Loading %s table (%" PRIu32 ":%" PRIu32 ")", dnode->name, |
1586 | dnode->info.major, dnode->info.minor); | |
165e4a11 AK |
1587 | |
1588 | if (!(dmt = dm_task_create(DM_DEVICE_RELOAD))) { | |
1589 | log_error("Reload dm_task creation failed for %s", dnode->name); | |
1590 | return 0; | |
1591 | } | |
1592 | ||
1593 | if (!dm_task_set_major(dmt, dnode->info.major) || | |
1594 | !dm_task_set_minor(dmt, dnode->info.minor)) { | |
1595 | log_error("Failed to set device number for %s reload.", dnode->name); | |
1596 | goto out; | |
1597 | } | |
1598 | ||
1599 | if (dnode->props.read_only && !dm_task_set_ro(dmt)) { | |
1600 | log_error("Failed to set read only flag for %s", dnode->name); | |
1601 | goto out; | |
1602 | } | |
1603 | ||
1604 | if (!dm_task_no_open_count(dmt)) | |
1605 | log_error("Failed to disable open_count"); | |
1606 | ||
2c44337b | 1607 | dm_list_iterate_items(seg, &dnode->props.segs) |
4b2cae46 AK |
1608 | if (!_emit_segment(dmt, dnode->info.major, dnode->info.minor, |
1609 | seg, &seg_start)) | |
b4f1578f | 1610 | goto_out; |
165e4a11 | 1611 | |
ec289b64 AK |
1612 | if (!dm_task_suppress_identical_reload(dmt)) |
1613 | log_error("Failed to suppress reload of identical tables."); | |
1614 | ||
1615 | if ((r = dm_task_run(dmt))) { | |
165e4a11 | 1616 | r = dm_task_get_info(dmt, &dnode->info); |
ec289b64 AK |
1617 | if (r && !dnode->info.inactive_table) |
1618 | log_verbose("Suppressed %s identical table reload.", | |
1619 | dnode->name); | |
bb875bb9 AK |
1620 | |
1621 | if ((dnode->props.size_changed = | |
1622 | (dm_task_get_existing_table_size(dmt) == seg_start) ? 0 : 1)) | |
1623 | log_debug("Table size changed from %" PRIu64 " to %" | |
1624 | PRIu64 " for %s", | |
1625 | dm_task_get_existing_table_size(dmt), | |
1626 | seg_start, dnode->name); | |
ec289b64 | 1627 | } |
165e4a11 AK |
1628 | |
1629 | dnode->props.segment_count = 0; | |
1630 | ||
1631 | out: | |
1632 | dm_task_destroy(dmt); | |
1633 | ||
1634 | return r; | |
165e4a11 AK |
1635 | } |
1636 | ||
b4f1578f | 1637 | int dm_tree_preload_children(struct dm_tree_node *dnode, |
bb875bb9 AK |
1638 | const char *uuid_prefix, |
1639 | size_t uuid_prefix_len) | |
165e4a11 | 1640 | { |
2ca6b865 | 1641 | int r = 1; |
165e4a11 | 1642 | void *handle = NULL; |
b4f1578f | 1643 | struct dm_tree_node *child; |
165e4a11 | 1644 | struct dm_info newinfo; |
165e4a11 AK |
1645 | |
1646 | /* Preload children first */ | |
b4f1578f | 1647 | while ((child = dm_tree_next_child(&handle, dnode, 0))) { |
165e4a11 AK |
1648 | /* Skip existing non-device-mapper devices */ |
1649 | if (!child->info.exists && child->info.major) | |
1650 | continue; | |
1651 | ||
1652 | /* Ignore if it doesn't belong to this VG */ | |
87f98002 AK |
1653 | if (child->info.exists && |
1654 | !_uuid_prefix_matches(child->uuid, uuid_prefix, uuid_prefix_len)) | |
165e4a11 AK |
1655 | continue; |
1656 | ||
b4f1578f | 1657 | if (dm_tree_node_num_children(child, 0)) |
2ca6b865 MS |
1658 | if (!dm_tree_preload_children(child, uuid_prefix, uuid_prefix_len)) |
1659 | return_0; | |
165e4a11 | 1660 | |
165e4a11 AK |
1661 | /* FIXME Cope if name exists with no uuid? */ |
1662 | if (!child->info.exists) { | |
1663 | if (!_create_node(child)) { | |
1664 | stack; | |
1665 | return 0; | |
1666 | } | |
1667 | } | |
1668 | ||
1669 | if (!child->info.inactive_table && child->props.segment_count) { | |
1670 | if (!_load_node(child)) { | |
1671 | stack; | |
1672 | return 0; | |
1673 | } | |
1674 | } | |
1675 | ||
eb91c4ee MB |
1676 | /* Propagate device size change change */ |
1677 | if (child->props.size_changed) | |
1678 | dnode->props.size_changed = 1; | |
1679 | ||
bb875bb9 | 1680 | /* Resume device immediately if it has parents and its size changed */ |
3776c494 | 1681 | if (!dm_tree_node_num_children(child, 1) || !child->props.size_changed) |
165e4a11 AK |
1682 | continue; |
1683 | ||
7707ea90 AK |
1684 | if (!child->info.inactive_table && !child->info.suspended) |
1685 | continue; | |
1686 | ||
fc795d87 | 1687 | if (!_resume_node(child->name, child->info.major, child->info.minor, |
bd90c6b2 | 1688 | child->props.read_ahead, child->props.read_ahead_flags, |
f16aea9e | 1689 | &newinfo, &child->dtree->cookie, child->udev_flags)) { |
165e4a11 | 1690 | log_error("Unable to resume %s (%" PRIu32 |
fc795d87 | 1691 | ":%" PRIu32 ")", child->name, child->info.major, |
165e4a11 | 1692 | child->info.minor); |
2ca6b865 | 1693 | r = 0; |
165e4a11 AK |
1694 | continue; |
1695 | } | |
1696 | ||
1697 | /* Update cached info */ | |
1698 | child->info = newinfo; | |
1699 | } | |
1700 | ||
1701 | handle = NULL; | |
1702 | ||
2ca6b865 | 1703 | return r; |
165e4a11 AK |
1704 | } |
1705 | ||
165e4a11 AK |
1706 | /* |
1707 | * Returns 1 if unsure. | |
1708 | */ | |
b4f1578f | 1709 | int dm_tree_children_use_uuid(struct dm_tree_node *dnode, |
165e4a11 AK |
1710 | const char *uuid_prefix, |
1711 | size_t uuid_prefix_len) | |
1712 | { | |
1713 | void *handle = NULL; | |
b4f1578f | 1714 | struct dm_tree_node *child = dnode; |
165e4a11 AK |
1715 | const char *uuid; |
1716 | ||
b4f1578f AK |
1717 | while ((child = dm_tree_next_child(&handle, dnode, 0))) { |
1718 | if (!(uuid = dm_tree_node_get_uuid(child))) { | |
1719 | log_error("Failed to get uuid for dtree node."); | |
165e4a11 AK |
1720 | return 1; |
1721 | } | |
1722 | ||
87f98002 | 1723 | if (_uuid_prefix_matches(uuid, uuid_prefix, uuid_prefix_len)) |
165e4a11 AK |
1724 | return 1; |
1725 | ||
b4f1578f AK |
1726 | if (dm_tree_node_num_children(child, 0)) |
1727 | dm_tree_children_use_uuid(child, uuid_prefix, uuid_prefix_len); | |
165e4a11 AK |
1728 | } |
1729 | ||
1730 | return 0; | |
1731 | } | |
1732 | ||
1733 | /* | |
1734 | * Target functions | |
1735 | */ | |
b4f1578f | 1736 | static struct load_segment *_add_segment(struct dm_tree_node *dnode, unsigned type, uint64_t size) |
165e4a11 AK |
1737 | { |
1738 | struct load_segment *seg; | |
1739 | ||
b4f1578f AK |
1740 | if (!(seg = dm_pool_zalloc(dnode->dtree->mem, sizeof(*seg)))) { |
1741 | log_error("dtree node segment allocation failed"); | |
165e4a11 AK |
1742 | return NULL; |
1743 | } | |
1744 | ||
1745 | seg->type = type; | |
1746 | seg->size = size; | |
1747 | seg->area_count = 0; | |
2c44337b | 1748 | dm_list_init(&seg->areas); |
165e4a11 AK |
1749 | seg->stripe_size = 0; |
1750 | seg->persistent = 0; | |
1751 | seg->chunk_size = 0; | |
1752 | seg->cow = NULL; | |
1753 | seg->origin = NULL; | |
aa6f4e51 | 1754 | seg->merge = NULL; |
165e4a11 | 1755 | |
2c44337b | 1756 | dm_list_add(&dnode->props.segs, &seg->list); |
165e4a11 AK |
1757 | dnode->props.segment_count++; |
1758 | ||
1759 | return seg; | |
1760 | } | |
1761 | ||
b4f1578f | 1762 | int dm_tree_node_add_snapshot_origin_target(struct dm_tree_node *dnode, |
165e4a11 AK |
1763 | uint64_t size, |
1764 | const char *origin_uuid) | |
1765 | { | |
1766 | struct load_segment *seg; | |
b4f1578f | 1767 | struct dm_tree_node *origin_node; |
165e4a11 | 1768 | |
b4f1578f AK |
1769 | if (!(seg = _add_segment(dnode, SEG_SNAPSHOT_ORIGIN, size))) |
1770 | return_0; | |
165e4a11 | 1771 | |
b4f1578f | 1772 | if (!(origin_node = dm_tree_find_node_by_uuid(dnode->dtree, origin_uuid))) { |
165e4a11 AK |
1773 | log_error("Couldn't find snapshot origin uuid %s.", origin_uuid); |
1774 | return 0; | |
1775 | } | |
1776 | ||
1777 | seg->origin = origin_node; | |
b4f1578f AK |
1778 | if (!_link_tree_nodes(dnode, origin_node)) |
1779 | return_0; | |
165e4a11 | 1780 | |
56c28292 AK |
1781 | /* Resume snapshot origins after new snapshots */ |
1782 | dnode->activation_priority = 1; | |
1783 | ||
165e4a11 AK |
1784 | return 1; |
1785 | } | |
1786 | ||
aa6f4e51 MS |
1787 | static int _add_snapshot_target(struct dm_tree_node *node, |
1788 | uint64_t size, | |
1789 | const char *origin_uuid, | |
1790 | const char *cow_uuid, | |
1791 | const char *merge_uuid, | |
1792 | int persistent, | |
1793 | uint32_t chunk_size) | |
165e4a11 AK |
1794 | { |
1795 | struct load_segment *seg; | |
aa6f4e51 MS |
1796 | struct dm_tree_node *origin_node, *cow_node, *merge_node; |
1797 | unsigned seg_type; | |
1798 | ||
1799 | seg_type = !merge_uuid ? SEG_SNAPSHOT : SEG_SNAPSHOT_MERGE; | |
165e4a11 | 1800 | |
aa6f4e51 | 1801 | if (!(seg = _add_segment(node, seg_type, size))) |
b4f1578f | 1802 | return_0; |
165e4a11 | 1803 | |
b4f1578f | 1804 | if (!(origin_node = dm_tree_find_node_by_uuid(node->dtree, origin_uuid))) { |
165e4a11 AK |
1805 | log_error("Couldn't find snapshot origin uuid %s.", origin_uuid); |
1806 | return 0; | |
1807 | } | |
1808 | ||
1809 | seg->origin = origin_node; | |
b4f1578f AK |
1810 | if (!_link_tree_nodes(node, origin_node)) |
1811 | return_0; | |
165e4a11 | 1812 | |
b4f1578f | 1813 | if (!(cow_node = dm_tree_find_node_by_uuid(node->dtree, cow_uuid))) { |
aa6f4e51 | 1814 | log_error("Couldn't find snapshot COW device uuid %s.", cow_uuid); |
165e4a11 AK |
1815 | return 0; |
1816 | } | |
1817 | ||
1818 | seg->cow = cow_node; | |
b4f1578f AK |
1819 | if (!_link_tree_nodes(node, cow_node)) |
1820 | return_0; | |
165e4a11 AK |
1821 | |
1822 | seg->persistent = persistent ? 1 : 0; | |
1823 | seg->chunk_size = chunk_size; | |
1824 | ||
aa6f4e51 MS |
1825 | if (merge_uuid) { |
1826 | if (!(merge_node = dm_tree_find_node_by_uuid(node->dtree, merge_uuid))) { | |
1827 | /* not a pure error, merging snapshot may have been deactivated */ | |
1828 | log_verbose("Couldn't find merging snapshot uuid %s.", merge_uuid); | |
1829 | } else { | |
1830 | seg->merge = merge_node; | |
1831 | /* must not link merging snapshot, would undermine activation_priority below */ | |
1832 | } | |
1833 | ||
1834 | /* Resume snapshot-merge (acting origin) after other snapshots */ | |
1835 | node->activation_priority = 1; | |
1836 | if (seg->merge) { | |
1837 | /* Resume merging snapshot after snapshot-merge */ | |
1838 | seg->merge->activation_priority = 2; | |
1839 | } | |
1840 | } | |
1841 | ||
165e4a11 AK |
1842 | return 1; |
1843 | } | |
1844 | ||
aa6f4e51 MS |
1845 | |
1846 | int dm_tree_node_add_snapshot_target(struct dm_tree_node *node, | |
1847 | uint64_t size, | |
1848 | const char *origin_uuid, | |
1849 | const char *cow_uuid, | |
1850 | int persistent, | |
1851 | uint32_t chunk_size) | |
1852 | { | |
1853 | return _add_snapshot_target(node, size, origin_uuid, cow_uuid, | |
1854 | NULL, persistent, chunk_size); | |
1855 | } | |
1856 | ||
1857 | int dm_tree_node_add_snapshot_merge_target(struct dm_tree_node *node, | |
1858 | uint64_t size, | |
1859 | const char *origin_uuid, | |
1860 | const char *cow_uuid, | |
1861 | const char *merge_uuid, | |
1862 | uint32_t chunk_size) | |
1863 | { | |
1864 | return _add_snapshot_target(node, size, origin_uuid, cow_uuid, | |
1865 | merge_uuid, 1, chunk_size); | |
1866 | } | |
1867 | ||
b4f1578f | 1868 | int dm_tree_node_add_error_target(struct dm_tree_node *node, |
165e4a11 AK |
1869 | uint64_t size) |
1870 | { | |
b4f1578f AK |
1871 | if (!_add_segment(node, SEG_ERROR, size)) |
1872 | return_0; | |
165e4a11 AK |
1873 | |
1874 | return 1; | |
1875 | } | |
1876 | ||
b4f1578f | 1877 | int dm_tree_node_add_zero_target(struct dm_tree_node *node, |
165e4a11 AK |
1878 | uint64_t size) |
1879 | { | |
b4f1578f AK |
1880 | if (!_add_segment(node, SEG_ZERO, size)) |
1881 | return_0; | |
165e4a11 AK |
1882 | |
1883 | return 1; | |
1884 | } | |
1885 | ||
b4f1578f | 1886 | int dm_tree_node_add_linear_target(struct dm_tree_node *node, |
165e4a11 AK |
1887 | uint64_t size) |
1888 | { | |
b4f1578f AK |
1889 | if (!_add_segment(node, SEG_LINEAR, size)) |
1890 | return_0; | |
165e4a11 AK |
1891 | |
1892 | return 1; | |
1893 | } | |
1894 | ||
b4f1578f | 1895 | int dm_tree_node_add_striped_target(struct dm_tree_node *node, |
165e4a11 AK |
1896 | uint64_t size, |
1897 | uint32_t stripe_size) | |
1898 | { | |
1899 | struct load_segment *seg; | |
1900 | ||
b4f1578f AK |
1901 | if (!(seg = _add_segment(node, SEG_STRIPED, size))) |
1902 | return_0; | |
165e4a11 AK |
1903 | |
1904 | seg->stripe_size = stripe_size; | |
1905 | ||
1906 | return 1; | |
1907 | } | |
1908 | ||
12ca060e MB |
1909 | int dm_tree_node_add_crypt_target(struct dm_tree_node *node, |
1910 | uint64_t size, | |
1911 | const char *cipher, | |
1912 | const char *chainmode, | |
1913 | const char *iv, | |
1914 | uint64_t iv_offset, | |
1915 | const char *key) | |
1916 | { | |
1917 | struct load_segment *seg; | |
1918 | ||
1919 | if (!(seg = _add_segment(node, SEG_CRYPT, size))) | |
1920 | return_0; | |
1921 | ||
1922 | seg->cipher = cipher; | |
1923 | seg->chainmode = chainmode; | |
1924 | seg->iv = iv; | |
1925 | seg->iv_offset = iv_offset; | |
1926 | seg->key = key; | |
1927 | ||
1928 | return 1; | |
1929 | } | |
1930 | ||
b4f1578f | 1931 | int dm_tree_node_add_mirror_target_log(struct dm_tree_node *node, |
165e4a11 | 1932 | uint32_t region_size, |
08e64ce5 | 1933 | unsigned clustered, |
165e4a11 | 1934 | const char *log_uuid, |
ce7ed2c0 AK |
1935 | unsigned area_count, |
1936 | uint32_t flags) | |
165e4a11 | 1937 | { |
908db078 | 1938 | struct dm_tree_node *log_node = NULL; |
165e4a11 AK |
1939 | struct load_segment *seg; |
1940 | ||
1941 | if (!node->props.segment_count) { | |
b8175c33 | 1942 | log_error(INTERNAL_ERROR "Attempt to add target area to missing segment."); |
165e4a11 AK |
1943 | return 0; |
1944 | } | |
1945 | ||
2c44337b | 1946 | seg = dm_list_item(dm_list_last(&node->props.segs), struct load_segment); |
165e4a11 | 1947 | |
24b026e3 | 1948 | if (log_uuid) { |
67b25ed4 AK |
1949 | if (!(seg->uuid = dm_pool_strdup(node->dtree->mem, log_uuid))) { |
1950 | log_error("log uuid pool_strdup failed"); | |
1951 | return 0; | |
1952 | } | |
9723090c AK |
1953 | if (!(flags & DM_CORELOG)) { |
1954 | if (!(log_node = dm_tree_find_node_by_uuid(node->dtree, log_uuid))) { | |
1955 | log_error("Couldn't find mirror log uuid %s.", log_uuid); | |
1956 | return 0; | |
1957 | } | |
1958 | ||
1959 | if (!_link_tree_nodes(node, log_node)) | |
1960 | return_0; | |
1961 | } | |
165e4a11 AK |
1962 | } |
1963 | ||
1964 | seg->log = log_node; | |
165e4a11 AK |
1965 | seg->region_size = region_size; |
1966 | seg->clustered = clustered; | |
1967 | seg->mirror_area_count = area_count; | |
dbcb64b8 | 1968 | seg->flags = flags; |
165e4a11 AK |
1969 | |
1970 | return 1; | |
1971 | } | |
1972 | ||
b4f1578f | 1973 | int dm_tree_node_add_mirror_target(struct dm_tree_node *node, |
165e4a11 AK |
1974 | uint64_t size) |
1975 | { | |
1976 | struct load_segment *seg; | |
1977 | ||
b4f1578f AK |
1978 | if (!(seg = _add_segment(node, SEG_MIRRORED, size))) |
1979 | return_0; | |
165e4a11 AK |
1980 | |
1981 | return 1; | |
1982 | } | |
1983 | ||
b4f1578f | 1984 | static int _add_area(struct dm_tree_node *node, struct load_segment *seg, struct dm_tree_node *dev_node, uint64_t offset) |
165e4a11 AK |
1985 | { |
1986 | struct seg_area *area; | |
1987 | ||
b4f1578f | 1988 | if (!(area = dm_pool_zalloc(node->dtree->mem, sizeof (*area)))) { |
165e4a11 AK |
1989 | log_error("Failed to allocate target segment area."); |
1990 | return 0; | |
1991 | } | |
1992 | ||
1993 | area->dev_node = dev_node; | |
1994 | area->offset = offset; | |
1995 | ||
2c44337b | 1996 | dm_list_add(&seg->areas, &area->list); |
165e4a11 AK |
1997 | seg->area_count++; |
1998 | ||
1999 | return 1; | |
2000 | } | |
2001 | ||
b4f1578f | 2002 | int dm_tree_node_add_target_area(struct dm_tree_node *node, |
165e4a11 AK |
2003 | const char *dev_name, |
2004 | const char *uuid, | |
2005 | uint64_t offset) | |
2006 | { | |
2007 | struct load_segment *seg; | |
2008 | struct stat info; | |
b4f1578f | 2009 | struct dm_tree_node *dev_node; |
165e4a11 AK |
2010 | |
2011 | if ((!dev_name || !*dev_name) && (!uuid || !*uuid)) { | |
b4f1578f | 2012 | log_error("dm_tree_node_add_target_area called without device"); |
165e4a11 AK |
2013 | return 0; |
2014 | } | |
2015 | ||
2016 | if (uuid) { | |
b4f1578f | 2017 | if (!(dev_node = dm_tree_find_node_by_uuid(node->dtree, uuid))) { |
165e4a11 AK |
2018 | log_error("Couldn't find area uuid %s.", uuid); |
2019 | return 0; | |
2020 | } | |
b4f1578f AK |
2021 | if (!_link_tree_nodes(node, dev_node)) |
2022 | return_0; | |
165e4a11 AK |
2023 | } else { |
2024 | if (stat(dev_name, &info) < 0) { | |
2025 | log_error("Device %s not found.", dev_name); | |
2026 | return 0; | |
2027 | } | |
2028 | ||
2029 | if (!S_ISBLK(info.st_mode)) { | |
2030 | log_error("Device %s is not a block device.", dev_name); | |
2031 | return 0; | |
2032 | } | |
2033 | ||
2034 | /* FIXME Check correct macro use */ | |
cda69e17 PR |
2035 | if (!(dev_node = _add_dev(node->dtree, node, MAJOR(info.st_rdev), |
2036 | MINOR(info.st_rdev), 0))) | |
b4f1578f | 2037 | return_0; |
165e4a11 AK |
2038 | } |
2039 | ||
2040 | if (!node->props.segment_count) { | |
b8175c33 | 2041 | log_error(INTERNAL_ERROR "Attempt to add target area to missing segment."); |
165e4a11 AK |
2042 | return 0; |
2043 | } | |
2044 | ||
2c44337b | 2045 | seg = dm_list_item(dm_list_last(&node->props.segs), struct load_segment); |
165e4a11 | 2046 | |
b4f1578f AK |
2047 | if (!_add_area(node, seg, dev_node, offset)) |
2048 | return_0; | |
165e4a11 AK |
2049 | |
2050 | return 1; | |
db208f51 | 2051 | } |
bd90c6b2 AK |
2052 | |
2053 | void dm_tree_set_cookie(struct dm_tree_node *node, uint32_t cookie) | |
2054 | { | |
2055 | node->dtree->cookie = cookie; | |
2056 | } | |
2057 | ||
2058 | uint32_t dm_tree_get_cookie(struct dm_tree_node *node) | |
2059 | { | |
2060 | return node->dtree->cookie; | |
2061 | } |