]>
Commit | Line | Data |
---|---|---|
3d0480ed AK |
1 | /* |
2 | * Copyright (C) 2005 Red Hat, Inc. All rights reserved. | |
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 | ||
15 | #include "lib.h" | |
16 | #include "libdm-targets.h" | |
17 | #include "libdm-common.h" | |
18 | #include "list.h" | |
19 | #include "kdev_t.h" | |
3d0480ed AK |
20 | |
21 | #include <stdarg.h> | |
22 | #include <sys/param.h> | |
23 | ||
24 | #include <linux/dm-ioctl.h> | |
25 | ||
165e4a11 AK |
26 | #define MAX_TARGET_PARAMSIZE 500000 |
27 | ||
87f98002 AK |
28 | /* FIXME Fix interface so this is used only by LVM */ |
29 | #define UUID_PREFIX "LVM-" | |
30 | ||
165e4a11 AK |
31 | /* Supported segment types */ |
32 | enum { | |
33 | SEG_ERROR, | |
34 | SEG_LINEAR, | |
35 | SEG_MIRRORED, | |
36 | SEG_SNAPSHOT, | |
37 | SEG_SNAPSHOT_ORIGIN, | |
38 | SEG_STRIPED, | |
39 | SEG_ZERO, | |
40 | }; | |
b4f1578f | 41 | |
165e4a11 AK |
42 | /* FIXME Add crypt and multipath support */ |
43 | ||
44 | struct { | |
45 | unsigned type; | |
46 | const char *target; | |
47 | } dm_segtypes[] = { | |
48 | { SEG_ERROR, "error" }, | |
49 | { SEG_LINEAR, "linear" }, | |
50 | { SEG_MIRRORED, "mirror" }, | |
51 | { SEG_SNAPSHOT, "snapshot" }, | |
52 | { SEG_SNAPSHOT_ORIGIN, "snapshot-origin" }, | |
53 | { SEG_STRIPED, "striped" }, | |
54 | { SEG_ZERO, "zero"}, | |
55 | }; | |
56 | ||
57 | /* Some segment types have a list of areas of other devices attached */ | |
58 | struct seg_area { | |
59 | struct list list; | |
60 | ||
b4f1578f | 61 | struct dm_tree_node *dev_node; |
165e4a11 AK |
62 | |
63 | uint64_t offset; | |
64 | }; | |
65 | ||
66 | /* Per-segment properties */ | |
67 | struct load_segment { | |
68 | struct list list; | |
69 | ||
70 | unsigned type; | |
71 | ||
72 | uint64_t size; | |
73 | ||
74 | unsigned area_count; /* Linear + Striped + Mirrored */ | |
75 | struct list areas; /* Linear + Striped + Mirrored */ | |
76 | ||
77 | uint32_t stripe_size; /* Striped */ | |
78 | ||
79 | int persistent; /* Snapshot */ | |
80 | uint32_t chunk_size; /* Snapshot */ | |
b4f1578f AK |
81 | struct dm_tree_node *cow; /* Snapshot */ |
82 | struct dm_tree_node *origin; /* Snapshot + Snapshot origin */ | |
165e4a11 | 83 | |
b4f1578f | 84 | struct dm_tree_node *log; /* Mirror */ |
165e4a11 AK |
85 | uint32_t region_size; /* Mirror */ |
86 | unsigned clustered; /* Mirror */ | |
87 | unsigned mirror_area_count; /* Mirror */ | |
88 | }; | |
89 | ||
90 | /* Per-device properties */ | |
91 | struct load_properties { | |
92 | int read_only; | |
93 | uint32_t major; | |
94 | uint32_t minor; | |
95 | ||
96 | unsigned segment_count; | |
97 | struct list segs; | |
98 | ||
99 | const char *new_name; | |
100 | }; | |
101 | ||
102 | /* Two of these used to join two nodes with uses and used_by. */ | |
b4f1578f | 103 | struct dm_tree_link { |
165e4a11 | 104 | struct list list; |
b4f1578f | 105 | struct dm_tree_node *node; |
165e4a11 AK |
106 | }; |
107 | ||
b4f1578f AK |
108 | struct dm_tree_node { |
109 | struct dm_tree *dtree; | |
3d0480ed AK |
110 | |
111 | const char *name; | |
112 | const char *uuid; | |
113 | struct dm_info info; | |
114 | ||
115 | struct list uses; /* Nodes this node uses */ | |
116 | struct list used_by; /* Nodes that use this node */ | |
165e4a11 AK |
117 | |
118 | void *context; /* External supplied context */ | |
119 | ||
120 | struct load_properties props; /* For creation/table (re)load */ | |
3d0480ed AK |
121 | }; |
122 | ||
b4f1578f | 123 | struct dm_tree { |
a3f6b2ce AK |
124 | struct dm_pool *mem; |
125 | struct dm_hash_table *devs; | |
165e4a11 | 126 | struct dm_hash_table *uuids; |
b4f1578f | 127 | struct dm_tree_node root; |
3d0480ed AK |
128 | }; |
129 | ||
165e4a11 AK |
130 | /* FIXME Consider exporting this */ |
131 | static int _dm_snprintf(char *buf, size_t bufsize, const char *format, ...) | |
132 | { | |
133 | int n; | |
134 | va_list ap; | |
135 | ||
136 | va_start(ap, format); | |
137 | n = vsnprintf(buf, bufsize, format, ap); | |
138 | va_end(ap); | |
139 | ||
140 | if (n < 0 || (n > bufsize - 1)) | |
141 | return -1; | |
142 | ||
143 | return n; | |
144 | } | |
3d0480ed | 145 | |
b4f1578f | 146 | struct dm_tree *dm_tree_create(void) |
3d0480ed | 147 | { |
b4f1578f | 148 | struct dm_tree *dtree; |
3d0480ed | 149 | |
b4f1578f AK |
150 | if (!(dtree = dm_malloc(sizeof(*dtree)))) { |
151 | log_error("dm_tree_create malloc failed"); | |
3d0480ed AK |
152 | return NULL; |
153 | } | |
154 | ||
b4f1578f AK |
155 | memset(dtree, 0, sizeof(*dtree)); |
156 | dtree->root.dtree = dtree; | |
157 | list_init(&dtree->root.uses); | |
158 | list_init(&dtree->root.used_by); | |
3d0480ed | 159 | |
b4f1578f AK |
160 | if (!(dtree->mem = dm_pool_create("dtree", 1024))) { |
161 | log_error("dtree pool creation failed"); | |
162 | dm_free(dtree); | |
3d0480ed AK |
163 | return NULL; |
164 | } | |
165 | ||
b4f1578f AK |
166 | if (!(dtree->devs = dm_hash_create(8))) { |
167 | log_error("dtree hash creation failed"); | |
168 | dm_pool_destroy(dtree->mem); | |
169 | dm_free(dtree); | |
3d0480ed AK |
170 | return NULL; |
171 | } | |
172 | ||
b4f1578f AK |
173 | if (!(dtree->uuids = dm_hash_create(32))) { |
174 | log_error("dtree uuid hash creation failed"); | |
175 | dm_hash_destroy(dtree->devs); | |
176 | dm_pool_destroy(dtree->mem); | |
177 | dm_free(dtree); | |
165e4a11 AK |
178 | return NULL; |
179 | } | |
180 | ||
b4f1578f | 181 | return dtree; |
3d0480ed AK |
182 | } |
183 | ||
b4f1578f | 184 | void dm_tree_free(struct dm_tree *dtree) |
3d0480ed | 185 | { |
b4f1578f | 186 | if (!dtree) |
3d0480ed AK |
187 | return; |
188 | ||
b4f1578f AK |
189 | dm_hash_destroy(dtree->uuids); |
190 | dm_hash_destroy(dtree->devs); | |
191 | dm_pool_destroy(dtree->mem); | |
192 | dm_free(dtree); | |
3d0480ed AK |
193 | } |
194 | ||
b4f1578f AK |
195 | static int _nodes_are_linked(struct dm_tree_node *parent, |
196 | struct dm_tree_node *child) | |
3d0480ed | 197 | { |
b4f1578f | 198 | struct dm_tree_link *dlink; |
3d0480ed | 199 | |
165e4a11 | 200 | list_iterate_items(dlink, &parent->uses) |
3d0480ed AK |
201 | if (dlink->node == child) |
202 | return 1; | |
3d0480ed AK |
203 | |
204 | return 0; | |
205 | } | |
206 | ||
b4f1578f | 207 | static int _link(struct list *list, struct dm_tree_node *node) |
3d0480ed | 208 | { |
b4f1578f | 209 | struct dm_tree_link *dlink; |
3d0480ed | 210 | |
b4f1578f AK |
211 | if (!(dlink = dm_pool_alloc(node->dtree->mem, sizeof(*dlink)))) { |
212 | log_error("dtree link allocation failed"); | |
3d0480ed AK |
213 | return 0; |
214 | } | |
215 | ||
216 | dlink->node = node; | |
217 | list_add(list, &dlink->list); | |
218 | ||
219 | return 1; | |
220 | } | |
221 | ||
b4f1578f AK |
222 | static int _link_nodes(struct dm_tree_node *parent, |
223 | struct dm_tree_node *child) | |
3d0480ed AK |
224 | { |
225 | if (_nodes_are_linked(parent, child)) | |
226 | return 1; | |
227 | ||
228 | if (!_link(&parent->uses, child)) | |
229 | return 0; | |
230 | ||
231 | if (!_link(&child->used_by, parent)) | |
232 | return 0; | |
233 | ||
234 | return 1; | |
235 | } | |
236 | ||
b4f1578f | 237 | static void _unlink(struct list *list, struct dm_tree_node *node) |
3d0480ed | 238 | { |
b4f1578f | 239 | struct dm_tree_link *dlink; |
3d0480ed | 240 | |
165e4a11 | 241 | list_iterate_items(dlink, list) |
3d0480ed AK |
242 | if (dlink->node == node) { |
243 | list_del(&dlink->list); | |
244 | break; | |
245 | } | |
3d0480ed AK |
246 | } |
247 | ||
b4f1578f AK |
248 | static void _unlink_nodes(struct dm_tree_node *parent, |
249 | struct dm_tree_node *child) | |
3d0480ed AK |
250 | { |
251 | if (!_nodes_are_linked(parent, child)) | |
252 | return; | |
253 | ||
254 | _unlink(&parent->uses, child); | |
255 | _unlink(&child->used_by, parent); | |
256 | } | |
257 | ||
b4f1578f | 258 | static int _add_to_toplevel(struct dm_tree_node *node) |
165e4a11 | 259 | { |
b4f1578f | 260 | return _link_nodes(&node->dtree->root, node); |
165e4a11 AK |
261 | } |
262 | ||
b4f1578f | 263 | static void _remove_from_toplevel(struct dm_tree_node *node) |
3d0480ed | 264 | { |
b4f1578f | 265 | return _unlink_nodes(&node->dtree->root, node); |
3d0480ed AK |
266 | } |
267 | ||
b4f1578f | 268 | static int _add_to_bottomlevel(struct dm_tree_node *node) |
3d0480ed | 269 | { |
b4f1578f | 270 | return _link_nodes(node, &node->dtree->root); |
3d0480ed AK |
271 | } |
272 | ||
b4f1578f | 273 | static void _remove_from_bottomlevel(struct dm_tree_node *node) |
165e4a11 | 274 | { |
b4f1578f | 275 | return _unlink_nodes(node, &node->dtree->root); |
165e4a11 AK |
276 | } |
277 | ||
b4f1578f | 278 | static int _link_tree_nodes(struct dm_tree_node *parent, struct dm_tree_node *child) |
165e4a11 AK |
279 | { |
280 | /* Don't link to root node if child already has a parent */ | |
b4f1578f AK |
281 | if ((parent == &parent->dtree->root)) { |
282 | if (dm_tree_node_num_children(child, 1)) | |
165e4a11 AK |
283 | return 1; |
284 | } else | |
285 | _remove_from_toplevel(child); | |
286 | ||
b4f1578f AK |
287 | if ((child == &child->dtree->root)) { |
288 | if (dm_tree_node_num_children(parent, 0)) | |
165e4a11 AK |
289 | return 1; |
290 | } else | |
291 | _remove_from_bottomlevel(parent); | |
292 | ||
293 | return _link_nodes(parent, child); | |
294 | } | |
295 | ||
b4f1578f | 296 | static struct dm_tree_node *_create_dm_tree_node(struct dm_tree *dtree, |
3d0480ed AK |
297 | const char *name, |
298 | const char *uuid, | |
165e4a11 AK |
299 | struct dm_info *info, |
300 | void *context) | |
3d0480ed | 301 | { |
b4f1578f | 302 | struct dm_tree_node *node; |
3d0480ed AK |
303 | uint64_t dev; |
304 | ||
b4f1578f AK |
305 | if (!(node = dm_pool_zalloc(dtree->mem, sizeof(*node)))) { |
306 | log_error("_create_dm_tree_node alloc failed"); | |
3d0480ed AK |
307 | return NULL; |
308 | } | |
309 | ||
b4f1578f | 310 | node->dtree = dtree; |
3d0480ed AK |
311 | |
312 | node->name = name; | |
313 | node->uuid = uuid; | |
314 | node->info = *info; | |
165e4a11 | 315 | node->context = context; |
3d0480ed AK |
316 | |
317 | list_init(&node->uses); | |
318 | list_init(&node->used_by); | |
165e4a11 | 319 | list_init(&node->props.segs); |
3d0480ed AK |
320 | |
321 | dev = MKDEV(info->major, info->minor); | |
322 | ||
b4f1578f | 323 | if (!dm_hash_insert_binary(dtree->devs, (const char *) &dev, |
3d0480ed | 324 | sizeof(dev), node)) { |
b4f1578f AK |
325 | log_error("dtree node hash insertion failed"); |
326 | dm_pool_free(dtree->mem, node); | |
3d0480ed AK |
327 | return NULL; |
328 | } | |
329 | ||
165e4a11 | 330 | if (uuid && *uuid && |
b4f1578f AK |
331 | !dm_hash_insert(dtree->uuids, uuid, node)) { |
332 | log_error("dtree uuid hash insertion failed"); | |
333 | dm_hash_remove_binary(dtree->devs, (const char *) &dev, | |
165e4a11 | 334 | sizeof(dev)); |
b4f1578f | 335 | dm_pool_free(dtree->mem, node); |
165e4a11 AK |
336 | return NULL; |
337 | } | |
338 | ||
3d0480ed AK |
339 | return node; |
340 | } | |
341 | ||
b4f1578f | 342 | static struct dm_tree_node *_find_dm_tree_node(struct dm_tree *dtree, |
3d0480ed AK |
343 | uint32_t major, uint32_t minor) |
344 | { | |
345 | uint64_t dev = MKDEV(major, minor); | |
346 | ||
b4f1578f | 347 | return dm_hash_lookup_binary(dtree->devs, (const char *) &dev, |
3d0480ed AK |
348 | sizeof(dev)); |
349 | } | |
350 | ||
b4f1578f | 351 | static struct dm_tree_node *_find_dm_tree_node_by_uuid(struct dm_tree *dtree, |
165e4a11 AK |
352 | const char *uuid) |
353 | { | |
87f98002 AK |
354 | struct dm_tree_node *node; |
355 | ||
356 | if ((node = dm_hash_lookup(dtree->uuids, uuid))) | |
357 | return node; | |
358 | ||
359 | if (strncmp(uuid, UUID_PREFIX, sizeof(UUID_PREFIX) - 1)) | |
360 | return NULL; | |
361 | ||
362 | return dm_hash_lookup(dtree->uuids, uuid + sizeof(UUID_PREFIX) - 1); | |
165e4a11 AK |
363 | } |
364 | ||
a3f6b2ce | 365 | static int _deps(struct dm_task **dmt, struct dm_pool *mem, uint32_t major, uint32_t minor, |
3d0480ed AK |
366 | const char **name, const char **uuid, |
367 | struct dm_info *info, struct dm_deps **deps) | |
368 | { | |
369 | memset(info, 0, sizeof(*info)); | |
370 | ||
371 | if (!dm_is_dm_major(major)) { | |
372 | *name = ""; | |
373 | *uuid = ""; | |
374 | *deps = NULL; | |
375 | info->major = major; | |
376 | info->minor = minor; | |
377 | info->exists = 0; | |
165e4a11 AK |
378 | info->live_table = 0; |
379 | info->inactive_table = 0; | |
380 | info->read_only = 0; | |
3d0480ed AK |
381 | return 1; |
382 | } | |
383 | ||
384 | if (!(*dmt = dm_task_create(DM_DEVICE_DEPS))) { | |
385 | log_error("deps dm_task creation failed"); | |
386 | return 0; | |
387 | } | |
388 | ||
b4f1578f AK |
389 | if (!dm_task_set_major(*dmt, major)) { |
390 | log_error("_deps: failed to set major for (%" PRIu32 ":%" PRIu32 ")", | |
391 | major, minor); | |
3d0480ed | 392 | goto failed; |
b4f1578f | 393 | } |
3d0480ed | 394 | |
b4f1578f AK |
395 | if (!dm_task_set_minor(*dmt, minor)) { |
396 | log_error("_deps: failed to set minor for (%" PRIu32 ":%" PRIu32 ")", | |
397 | major, minor); | |
3d0480ed | 398 | goto failed; |
b4f1578f | 399 | } |
3d0480ed | 400 | |
b4f1578f AK |
401 | if (!dm_task_run(*dmt)) { |
402 | log_error("_deps: task run failed for (%" PRIu32 ":%" PRIu32 ")", | |
403 | major, minor); | |
3d0480ed | 404 | goto failed; |
b4f1578f | 405 | } |
3d0480ed | 406 | |
b4f1578f AK |
407 | if (!dm_task_get_info(*dmt, info)) { |
408 | log_error("_deps: failed to get info for (%" PRIu32 ":%" PRIu32 ")", | |
409 | major, minor); | |
3d0480ed | 410 | goto failed; |
b4f1578f | 411 | } |
3d0480ed AK |
412 | |
413 | if (!info->exists) { | |
414 | *name = ""; | |
415 | *uuid = ""; | |
416 | *deps = NULL; | |
417 | } else { | |
418 | if (info->major != major) { | |
b4f1578f | 419 | log_error("Inconsistent dtree major number: %u != %u", |
3d0480ed AK |
420 | major, info->major); |
421 | goto failed; | |
422 | } | |
423 | if (info->minor != minor) { | |
b4f1578f | 424 | log_error("Inconsistent dtree minor number: %u != %u", |
3d0480ed AK |
425 | minor, info->minor); |
426 | goto failed; | |
427 | } | |
a3f6b2ce | 428 | if (!(*name = dm_pool_strdup(mem, dm_task_get_name(*dmt)))) { |
3d0480ed AK |
429 | log_error("name pool_strdup failed"); |
430 | goto failed; | |
431 | } | |
a3f6b2ce | 432 | if (!(*uuid = dm_pool_strdup(mem, dm_task_get_uuid(*dmt)))) { |
3d0480ed AK |
433 | log_error("uuid pool_strdup failed"); |
434 | goto failed; | |
435 | } | |
436 | *deps = dm_task_get_deps(*dmt); | |
437 | } | |
438 | ||
439 | return 1; | |
440 | ||
441 | failed: | |
442 | dm_task_destroy(*dmt); | |
443 | return 0; | |
444 | } | |
445 | ||
b4f1578f AK |
446 | static struct dm_tree_node *_add_dev(struct dm_tree *dtree, |
447 | struct dm_tree_node *parent, | |
165e4a11 | 448 | uint32_t major, uint32_t minor) |
3d0480ed AK |
449 | { |
450 | struct dm_task *dmt = NULL; | |
451 | struct dm_info info; | |
452 | struct dm_deps *deps = NULL; | |
453 | const char *name = NULL; | |
454 | const char *uuid = NULL; | |
b4f1578f | 455 | struct dm_tree_node *node = NULL; |
3d0480ed | 456 | uint32_t i; |
3d0480ed AK |
457 | int new = 0; |
458 | ||
459 | /* Already in tree? */ | |
b4f1578f AK |
460 | if (!(node = _find_dm_tree_node(dtree, major, minor))) { |
461 | if (!_deps(&dmt, dtree->mem, major, minor, &name, &uuid, &info, &deps)) | |
462 | return_NULL; | |
3d0480ed | 463 | |
b4f1578f | 464 | if (!(node = _create_dm_tree_node(dtree, name, uuid, |
165e4a11 | 465 | &info, NULL))) |
b4f1578f | 466 | goto_out; |
3d0480ed AK |
467 | new = 1; |
468 | } | |
469 | ||
165e4a11 AK |
470 | if (!_link_tree_nodes(parent, node)) { |
471 | node = NULL; | |
b4f1578f | 472 | goto_out; |
165e4a11 | 473 | } |
3d0480ed AK |
474 | |
475 | /* If node was already in tree, no need to recurse. */ | |
476 | if (!new) | |
165e4a11 | 477 | goto out; |
3d0480ed AK |
478 | |
479 | /* Can't recurse if not a mapped device or there are no dependencies */ | |
480 | if (!node->info.exists || !deps->count) { | |
b4f1578f AK |
481 | if (!_add_to_bottomlevel(node)) { |
482 | stack; | |
165e4a11 | 483 | node = NULL; |
b4f1578f | 484 | } |
165e4a11 | 485 | goto out; |
3d0480ed AK |
486 | } |
487 | ||
488 | /* Add dependencies to tree */ | |
489 | for (i = 0; i < deps->count; i++) | |
b4f1578f | 490 | if (!_add_dev(dtree, node, MAJOR(deps->device[i]), |
165e4a11 AK |
491 | MINOR(deps->device[i]))) { |
492 | node = NULL; | |
b4f1578f | 493 | goto_out; |
165e4a11 | 494 | } |
3d0480ed | 495 | |
3d0480ed AK |
496 | out: |
497 | if (dmt) | |
498 | dm_task_destroy(dmt); | |
499 | ||
165e4a11 AK |
500 | return node; |
501 | } | |
502 | ||
b4f1578f | 503 | static int _node_clear_table(struct dm_tree_node *dnode) |
165e4a11 AK |
504 | { |
505 | struct dm_task *dmt; | |
506 | struct dm_info *info; | |
507 | const char *name; | |
508 | int r; | |
509 | ||
510 | if (!(info = &dnode->info)) { | |
b4f1578f | 511 | log_error("_node_clear_table failed: missing info"); |
165e4a11 AK |
512 | return 0; |
513 | } | |
514 | ||
b4f1578f AK |
515 | if (!(name = dm_tree_node_get_name(dnode))) { |
516 | log_error("_node_clear_table failed: missing name"); | |
165e4a11 AK |
517 | return 0; |
518 | } | |
519 | ||
520 | /* Is there a table? */ | |
521 | if (!info->exists || !info->inactive_table) | |
522 | return 1; | |
523 | ||
524 | log_verbose("Clearing inactive table %s (%" PRIu32 ":%" PRIu32 ")", | |
525 | name, info->major, info->minor); | |
526 | ||
527 | if (!(dmt = dm_task_create(DM_DEVICE_CLEAR))) { | |
528 | dm_task_destroy(dmt); | |
529 | log_error("Table clear dm_task creation failed for %s", name); | |
530 | return 0; | |
531 | } | |
532 | ||
533 | if (!dm_task_set_major(dmt, info->major) || | |
534 | !dm_task_set_minor(dmt, info->minor)) { | |
535 | log_error("Failed to set device number for %s table clear", name); | |
536 | dm_task_destroy(dmt); | |
537 | return 0; | |
538 | } | |
539 | ||
540 | r = dm_task_run(dmt); | |
541 | ||
542 | if (!dm_task_get_info(dmt, info)) { | |
b4f1578f | 543 | log_error("_node_clear_table failed: info missing after running task for %s", name); |
165e4a11 AK |
544 | r = 0; |
545 | } | |
546 | ||
547 | dm_task_destroy(dmt); | |
548 | ||
3d0480ed AK |
549 | return r; |
550 | } | |
551 | ||
b4f1578f | 552 | struct dm_tree_node *dm_tree_add_new_dev(struct dm_tree *dtree, |
165e4a11 AK |
553 | const char *name, |
554 | const char *uuid, | |
555 | uint32_t major, uint32_t minor, | |
556 | int read_only, | |
557 | int clear_inactive, | |
558 | void *context) | |
559 | { | |
b4f1578f | 560 | struct dm_tree_node *dnode; |
165e4a11 AK |
561 | struct dm_info info; |
562 | const char *name2; | |
563 | const char *uuid2; | |
564 | ||
565 | /* Do we need to add node to tree? */ | |
b4f1578f AK |
566 | if (!(dnode = dm_tree_find_node_by_uuid(dtree, uuid))) { |
567 | if (!(name2 = dm_pool_strdup(dtree->mem, name))) { | |
165e4a11 AK |
568 | log_error("name pool_strdup failed"); |
569 | return NULL; | |
570 | } | |
b4f1578f | 571 | if (!(uuid2 = dm_pool_strdup(dtree->mem, uuid))) { |
165e4a11 AK |
572 | log_error("uuid pool_strdup failed"); |
573 | return NULL; | |
574 | } | |
575 | ||
576 | info.major = 0; | |
577 | info.minor = 0; | |
578 | info.exists = 0; | |
579 | info.live_table = 0; | |
580 | info.inactive_table = 0; | |
581 | info.read_only = 0; | |
582 | ||
b4f1578f AK |
583 | if (!(dnode = _create_dm_tree_node(dtree, name2, uuid2, |
584 | &info, context))) | |
585 | return_NULL; | |
165e4a11 AK |
586 | |
587 | /* Attach to root node until a table is supplied */ | |
b4f1578f AK |
588 | if (!_add_to_toplevel(dnode) || !_add_to_bottomlevel(dnode)) |
589 | return_NULL; | |
165e4a11 AK |
590 | |
591 | dnode->props.major = major; | |
592 | dnode->props.minor = minor; | |
593 | dnode->props.new_name = NULL; | |
594 | } else if (strcmp(name, dnode->name)) { | |
595 | /* Do we need to rename node? */ | |
b4f1578f | 596 | if (!(dnode->props.new_name = dm_pool_strdup(dtree->mem, name))) { |
165e4a11 AK |
597 | log_error("name pool_strdup failed"); |
598 | return 0; | |
599 | } | |
600 | } | |
601 | ||
602 | dnode->props.read_only = read_only ? 1 : 0; | |
603 | ||
b4f1578f AK |
604 | if (clear_inactive && !_node_clear_table(dnode)) |
605 | return_NULL; | |
165e4a11 AK |
606 | |
607 | dnode->context = context; | |
608 | ||
609 | return dnode; | |
610 | } | |
611 | ||
b4f1578f | 612 | int dm_tree_add_dev(struct dm_tree *dtree, uint32_t major, uint32_t minor) |
3d0480ed | 613 | { |
b4f1578f | 614 | return _add_dev(dtree, &dtree->root, major, minor) ? 1 : 0; |
3d0480ed AK |
615 | } |
616 | ||
b4f1578f | 617 | const char *dm_tree_node_get_name(struct dm_tree_node *node) |
3d0480ed AK |
618 | { |
619 | return node->info.exists ? node->name : ""; | |
620 | } | |
621 | ||
b4f1578f | 622 | const char *dm_tree_node_get_uuid(struct dm_tree_node *node) |
3d0480ed AK |
623 | { |
624 | return node->info.exists ? node->uuid : ""; | |
625 | } | |
626 | ||
b4f1578f | 627 | const struct dm_info *dm_tree_node_get_info(struct dm_tree_node *node) |
3d0480ed AK |
628 | { |
629 | return &node->info; | |
630 | } | |
631 | ||
b4f1578f | 632 | void *dm_tree_node_get_context(struct dm_tree_node *node) |
165e4a11 AK |
633 | { |
634 | return node->context; | |
635 | } | |
636 | ||
b4f1578f | 637 | int dm_tree_node_num_children(struct dm_tree_node *node, uint32_t inverted) |
3d0480ed AK |
638 | { |
639 | if (inverted) { | |
b4f1578f | 640 | if (_nodes_are_linked(&node->dtree->root, node)) |
3d0480ed AK |
641 | return 0; |
642 | return list_size(&node->used_by); | |
643 | } | |
644 | ||
b4f1578f | 645 | if (_nodes_are_linked(node, &node->dtree->root)) |
3d0480ed AK |
646 | return 0; |
647 | ||
648 | return list_size(&node->uses); | |
649 | } | |
650 | ||
2b69db1f AK |
651 | /* |
652 | * Returns 1 if no prefix supplied | |
653 | */ | |
654 | static int _uuid_prefix_matches(const char *uuid, const char *uuid_prefix, size_t uuid_prefix_len) | |
655 | { | |
656 | if (!uuid_prefix) | |
657 | return 1; | |
658 | ||
659 | if (!strncmp(uuid, uuid_prefix, uuid_prefix_len)) | |
660 | return 1; | |
661 | ||
662 | /* Handle transition: active device uuids might be missing the prefix */ | |
663 | if (uuid_prefix_len <= 4) | |
664 | return 0; | |
665 | ||
87f98002 | 666 | if (!strncmp(uuid, UUID_PREFIX, sizeof(UUID_PREFIX) - 1)) |
872dea04 AK |
667 | return 0; |
668 | ||
87f98002 | 669 | if (strncmp(uuid_prefix, UUID_PREFIX, sizeof(UUID_PREFIX) - 1)) |
2b69db1f AK |
670 | return 0; |
671 | ||
87f98002 | 672 | if (!strncmp(uuid, uuid_prefix + sizeof(UUID_PREFIX) - 1, uuid_prefix_len - (sizeof(UUID_PREFIX) - 1))) |
2b69db1f AK |
673 | return 1; |
674 | ||
675 | return 0; | |
676 | } | |
677 | ||
690a5da2 AK |
678 | /* |
679 | * Returns 1 if no children. | |
680 | */ | |
b4f1578f | 681 | static int _children_suspended(struct dm_tree_node *node, |
690a5da2 AK |
682 | uint32_t inverted, |
683 | const char *uuid_prefix, | |
684 | size_t uuid_prefix_len) | |
685 | { | |
686 | struct list *list; | |
b4f1578f | 687 | struct dm_tree_link *dlink; |
690a5da2 AK |
688 | const struct dm_info *dinfo; |
689 | const char *uuid; | |
690 | ||
691 | if (inverted) { | |
b4f1578f | 692 | if (_nodes_are_linked(&node->dtree->root, node)) |
690a5da2 AK |
693 | return 1; |
694 | list = &node->used_by; | |
695 | } else { | |
b4f1578f | 696 | if (_nodes_are_linked(node, &node->dtree->root)) |
690a5da2 AK |
697 | return 1; |
698 | list = &node->uses; | |
699 | } | |
700 | ||
701 | list_iterate_items(dlink, list) { | |
b4f1578f | 702 | if (!(uuid = dm_tree_node_get_uuid(dlink->node))) { |
690a5da2 AK |
703 | stack; |
704 | continue; | |
705 | } | |
706 | ||
707 | /* Ignore if it doesn't belong to this VG */ | |
2b69db1f | 708 | if (!_uuid_prefix_matches(uuid, uuid_prefix, uuid_prefix_len)) |
690a5da2 AK |
709 | continue; |
710 | ||
b4f1578f AK |
711 | if (!(dinfo = dm_tree_node_get_info(dlink->node))) { |
712 | stack; /* FIXME Is this normal? */ | |
690a5da2 AK |
713 | return 0; |
714 | } | |
715 | ||
716 | if (!dinfo->suspended) | |
717 | return 0; | |
718 | } | |
719 | ||
720 | return 1; | |
721 | } | |
722 | ||
3d0480ed AK |
723 | /* |
724 | * Set major and minor to zero for root of tree. | |
725 | */ | |
b4f1578f | 726 | struct dm_tree_node *dm_tree_find_node(struct dm_tree *dtree, |
3d0480ed AK |
727 | uint32_t major, |
728 | uint32_t minor) | |
729 | { | |
730 | if (!major && !minor) | |
b4f1578f | 731 | return &dtree->root; |
3d0480ed | 732 | |
b4f1578f | 733 | return _find_dm_tree_node(dtree, major, minor); |
3d0480ed AK |
734 | } |
735 | ||
165e4a11 AK |
736 | /* |
737 | * Set uuid to NULL for root of tree. | |
738 | */ | |
b4f1578f | 739 | struct dm_tree_node *dm_tree_find_node_by_uuid(struct dm_tree *dtree, |
165e4a11 AK |
740 | const char *uuid) |
741 | { | |
742 | if (!uuid || !*uuid) | |
b4f1578f | 743 | return &dtree->root; |
165e4a11 | 744 | |
b4f1578f | 745 | return _find_dm_tree_node_by_uuid(dtree, uuid); |
165e4a11 AK |
746 | } |
747 | ||
3d0480ed AK |
748 | /* |
749 | * First time set *handle to NULL. | |
750 | * Set inverted to invert the tree. | |
751 | */ | |
b4f1578f AK |
752 | struct dm_tree_node *dm_tree_next_child(void **handle, |
753 | struct dm_tree_node *parent, | |
3d0480ed AK |
754 | uint32_t inverted) |
755 | { | |
756 | struct list **dlink = (struct list **) handle; | |
757 | struct list *use_list; | |
758 | ||
759 | if (inverted) | |
760 | use_list = &parent->used_by; | |
761 | else | |
762 | use_list = &parent->uses; | |
763 | ||
764 | if (!*dlink) | |
765 | *dlink = list_first(use_list); | |
766 | else | |
767 | *dlink = list_next(use_list, *dlink); | |
768 | ||
b4f1578f | 769 | return (*dlink) ? list_item(*dlink, struct dm_tree_link)->node : NULL; |
3d0480ed AK |
770 | } |
771 | ||
3e8c6b73 | 772 | /* |
a6d97ede | 773 | * Deactivate a device with its dependencies if the uuid prefix matches. |
3e8c6b73 | 774 | */ |
db208f51 AK |
775 | static int _info_by_dev(uint32_t major, uint32_t minor, int with_open_count, |
776 | struct dm_info *info) | |
3e8c6b73 AK |
777 | { |
778 | struct dm_task *dmt; | |
779 | int r; | |
780 | ||
781 | if (!(dmt = dm_task_create(DM_DEVICE_INFO))) { | |
782 | log_error("_info_by_dev: dm_task creation failed"); | |
783 | return 0; | |
784 | } | |
785 | ||
786 | if (!dm_task_set_major(dmt, major) || !dm_task_set_minor(dmt, minor)) { | |
787 | log_error("_info_by_dev: Failed to set device number"); | |
788 | dm_task_destroy(dmt); | |
789 | return 0; | |
790 | } | |
791 | ||
db208f51 AK |
792 | if (!with_open_count && !dm_task_no_open_count(dmt)) |
793 | log_error("Failed to disable open_count"); | |
794 | ||
3e8c6b73 AK |
795 | if ((r = dm_task_run(dmt))) |
796 | r = dm_task_get_info(dmt, info); | |
797 | ||
798 | dm_task_destroy(dmt); | |
799 | ||
800 | return r; | |
801 | } | |
802 | ||
803 | static int _deactivate_node(const char *name, uint32_t major, uint32_t minor) | |
804 | { | |
805 | struct dm_task *dmt; | |
806 | int r; | |
807 | ||
808 | log_verbose("Removing %s (%" PRIu32 ":%" PRIu32 ")", name, major, minor); | |
809 | ||
810 | if (!(dmt = dm_task_create(DM_DEVICE_REMOVE))) { | |
811 | log_error("Deactivation dm_task creation failed for %s", name); | |
812 | return 0; | |
813 | } | |
814 | ||
815 | if (!dm_task_set_major(dmt, major) || !dm_task_set_minor(dmt, minor)) { | |
816 | log_error("Failed to set device number for %s deactivation", name); | |
817 | dm_task_destroy(dmt); | |
818 | return 0; | |
819 | } | |
820 | ||
821 | if (!dm_task_no_open_count(dmt)) | |
822 | log_error("Failed to disable open_count"); | |
823 | ||
824 | r = dm_task_run(dmt); | |
825 | ||
165e4a11 AK |
826 | /* FIXME Until kernel returns actual name so dm-ioctl.c can handle it */ |
827 | rm_dev_node(name); | |
828 | ||
db208f51 AK |
829 | /* FIXME Remove node from tree or mark invalid? */ |
830 | ||
831 | dm_task_destroy(dmt); | |
832 | ||
833 | return r; | |
834 | } | |
835 | ||
165e4a11 AK |
836 | static int _rename_node(const char *old_name, const char *new_name, uint32_t major, uint32_t minor) |
837 | { | |
838 | struct dm_task *dmt; | |
839 | int r = 0; | |
840 | ||
841 | log_verbose("Renaming %s (%" PRIu32 ":%" PRIu32 ") to %s", old_name, major, minor, new_name); | |
842 | ||
843 | if (!(dmt = dm_task_create(DM_DEVICE_RENAME))) { | |
844 | log_error("Rename dm_task creation failed for %s", old_name); | |
845 | return 0; | |
846 | } | |
847 | ||
848 | if (!dm_task_set_name(dmt, old_name)) { | |
849 | log_error("Failed to set name for %s rename.", old_name); | |
850 | goto out; | |
851 | } | |
852 | ||
b4f1578f AK |
853 | if (!dm_task_set_newname(dmt, new_name)) |
854 | goto_out; | |
165e4a11 AK |
855 | |
856 | if (!dm_task_no_open_count(dmt)) | |
857 | log_error("Failed to disable open_count"); | |
858 | ||
859 | r = dm_task_run(dmt); | |
860 | ||
861 | out: | |
862 | dm_task_destroy(dmt); | |
863 | ||
864 | return r; | |
865 | } | |
866 | ||
165e4a11 AK |
867 | /* FIXME Merge with _suspend_node? */ |
868 | static int _resume_node(const char *name, uint32_t major, uint32_t minor, | |
869 | struct dm_info *newinfo) | |
870 | { | |
871 | struct dm_task *dmt; | |
872 | int r; | |
873 | ||
874 | log_verbose("Resuming %s (%" PRIu32 ":%" PRIu32 ")", name, major, minor); | |
875 | ||
876 | if (!(dmt = dm_task_create(DM_DEVICE_RESUME))) { | |
877 | log_error("Suspend dm_task creation failed for %s", name); | |
878 | return 0; | |
879 | } | |
880 | ||
881 | if (!dm_task_set_major(dmt, major) || !dm_task_set_minor(dmt, minor)) { | |
882 | log_error("Failed to set device number for %s resumption.", name); | |
883 | dm_task_destroy(dmt); | |
884 | return 0; | |
885 | } | |
886 | ||
887 | if (!dm_task_no_open_count(dmt)) | |
888 | log_error("Failed to disable open_count"); | |
889 | ||
890 | if ((r = dm_task_run(dmt))) | |
891 | r = dm_task_get_info(dmt, newinfo); | |
892 | ||
893 | dm_task_destroy(dmt); | |
894 | ||
895 | return r; | |
896 | } | |
897 | ||
db208f51 AK |
898 | static int _suspend_node(const char *name, uint32_t major, uint32_t minor, |
899 | struct dm_info *newinfo) | |
900 | { | |
901 | struct dm_task *dmt; | |
902 | int r; | |
903 | ||
904 | log_verbose("Suspending %s (%" PRIu32 ":%" PRIu32 ")", name, major, minor); | |
905 | ||
906 | if (!(dmt = dm_task_create(DM_DEVICE_SUSPEND))) { | |
907 | log_error("Suspend dm_task creation failed for %s", name); | |
908 | return 0; | |
909 | } | |
910 | ||
911 | if (!dm_task_set_major(dmt, major) || !dm_task_set_minor(dmt, minor)) { | |
912 | log_error("Failed to set device number for %s suspension.", name); | |
913 | dm_task_destroy(dmt); | |
914 | return 0; | |
915 | } | |
916 | ||
917 | if (!dm_task_no_open_count(dmt)) | |
918 | log_error("Failed to disable open_count"); | |
919 | ||
920 | if ((r = dm_task_run(dmt))) | |
921 | r = dm_task_get_info(dmt, newinfo); | |
922 | ||
3e8c6b73 AK |
923 | dm_task_destroy(dmt); |
924 | ||
925 | return r; | |
926 | } | |
927 | ||
b4f1578f | 928 | int dm_tree_deactivate_children(struct dm_tree_node *dnode, |
a6d97ede AK |
929 | const char *uuid_prefix, |
930 | size_t uuid_prefix_len) | |
3e8c6b73 AK |
931 | { |
932 | void *handle = NULL; | |
b4f1578f | 933 | struct dm_tree_node *child = dnode; |
3e8c6b73 AK |
934 | struct dm_info info; |
935 | const struct dm_info *dinfo; | |
936 | const char *name; | |
937 | const char *uuid; | |
938 | ||
b4f1578f AK |
939 | while ((child = dm_tree_next_child(&handle, dnode, 0))) { |
940 | if (!(dinfo = dm_tree_node_get_info(child))) { | |
3e8c6b73 AK |
941 | stack; |
942 | continue; | |
943 | } | |
944 | ||
b4f1578f | 945 | if (!(name = dm_tree_node_get_name(child))) { |
3e8c6b73 AK |
946 | stack; |
947 | continue; | |
948 | } | |
949 | ||
b4f1578f | 950 | if (!(uuid = dm_tree_node_get_uuid(child))) { |
3e8c6b73 AK |
951 | stack; |
952 | continue; | |
953 | } | |
954 | ||
955 | /* Ignore if it doesn't belong to this VG */ | |
2b69db1f | 956 | if (!_uuid_prefix_matches(uuid, uuid_prefix, uuid_prefix_len)) |
3e8c6b73 | 957 | continue; |
3e8c6b73 AK |
958 | |
959 | /* Refresh open_count */ | |
db208f51 | 960 | if (!_info_by_dev(dinfo->major, dinfo->minor, 1, &info) || |
3e8c6b73 AK |
961 | !info.exists || info.open_count) |
962 | continue; | |
963 | ||
964 | if (!_deactivate_node(name, info.major, info.minor)) { | |
965 | log_error("Unable to deactivate %s (%" PRIu32 | |
966 | ":%" PRIu32 ")", name, info.major, | |
967 | info.minor); | |
968 | continue; | |
969 | } | |
970 | ||
b4f1578f AK |
971 | if (dm_tree_node_num_children(child, 0)) |
972 | dm_tree_deactivate_children(child, uuid_prefix, uuid_prefix_len); | |
3e8c6b73 AK |
973 | } |
974 | ||
975 | return 1; | |
976 | } | |
db208f51 | 977 | |
b4f1578f | 978 | int dm_tree_suspend_children(struct dm_tree_node *dnode, |
db208f51 AK |
979 | const char *uuid_prefix, |
980 | size_t uuid_prefix_len) | |
981 | { | |
982 | void *handle = NULL; | |
b4f1578f | 983 | struct dm_tree_node *child = dnode; |
db208f51 AK |
984 | struct dm_info info, newinfo; |
985 | const struct dm_info *dinfo; | |
986 | const char *name; | |
987 | const char *uuid; | |
988 | ||
690a5da2 | 989 | /* Suspend nodes at this level of the tree */ |
b4f1578f AK |
990 | while ((child = dm_tree_next_child(&handle, dnode, 0))) { |
991 | if (!(dinfo = dm_tree_node_get_info(child))) { | |
db208f51 AK |
992 | stack; |
993 | continue; | |
994 | } | |
995 | ||
b4f1578f | 996 | if (!(name = dm_tree_node_get_name(child))) { |
db208f51 AK |
997 | stack; |
998 | continue; | |
999 | } | |
1000 | ||
b4f1578f | 1001 | if (!(uuid = dm_tree_node_get_uuid(child))) { |
db208f51 AK |
1002 | stack; |
1003 | continue; | |
1004 | } | |
1005 | ||
1006 | /* Ignore if it doesn't belong to this VG */ | |
2b69db1f | 1007 | if (!_uuid_prefix_matches(uuid, uuid_prefix, uuid_prefix_len)) |
db208f51 AK |
1008 | continue; |
1009 | ||
690a5da2 AK |
1010 | /* Ensure immediate parents are already suspended */ |
1011 | if (!_children_suspended(child, 1, uuid_prefix, uuid_prefix_len)) | |
1012 | continue; | |
1013 | ||
db208f51 AK |
1014 | if (!_info_by_dev(dinfo->major, dinfo->minor, 0, &info) || |
1015 | !info.exists) | |
1016 | continue; | |
1017 | ||
1018 | if (!_suspend_node(name, info.major, info.minor, &newinfo)) { | |
1019 | log_error("Unable to suspend %s (%" PRIu32 | |
1020 | ":%" PRIu32 ")", name, info.major, | |
1021 | info.minor); | |
1022 | continue; | |
1023 | } | |
1024 | ||
1025 | /* Update cached info */ | |
1026 | child->info = newinfo; | |
690a5da2 AK |
1027 | } |
1028 | ||
1029 | /* Then suspend any child nodes */ | |
1030 | handle = NULL; | |
1031 | ||
b4f1578f AK |
1032 | while ((child = dm_tree_next_child(&handle, dnode, 0))) { |
1033 | if (!(uuid = dm_tree_node_get_uuid(child))) { | |
690a5da2 AK |
1034 | stack; |
1035 | continue; | |
1036 | } | |
1037 | ||
1038 | /* Ignore if it doesn't belong to this VG */ | |
87f98002 | 1039 | if (!_uuid_prefix_matches(uuid, uuid_prefix, uuid_prefix_len)) |
690a5da2 | 1040 | continue; |
db208f51 | 1041 | |
b4f1578f AK |
1042 | if (dm_tree_node_num_children(child, 0)) |
1043 | dm_tree_suspend_children(child, uuid_prefix, uuid_prefix_len); | |
db208f51 AK |
1044 | } |
1045 | ||
1046 | return 1; | |
1047 | } | |
1048 | ||
b4f1578f | 1049 | int dm_tree_activate_children(struct dm_tree_node *dnode, |
db208f51 AK |
1050 | const char *uuid_prefix, |
1051 | size_t uuid_prefix_len) | |
1052 | { | |
1053 | void *handle = NULL; | |
b4f1578f | 1054 | struct dm_tree_node *child = dnode; |
165e4a11 AK |
1055 | struct dm_info newinfo; |
1056 | const char *name; | |
db208f51 AK |
1057 | const char *uuid; |
1058 | ||
165e4a11 | 1059 | /* Activate children first */ |
b4f1578f AK |
1060 | while ((child = dm_tree_next_child(&handle, dnode, 0))) { |
1061 | if (!(uuid = dm_tree_node_get_uuid(child))) { | |
165e4a11 AK |
1062 | stack; |
1063 | continue; | |
db208f51 AK |
1064 | } |
1065 | ||
908db078 AK |
1066 | if (!_uuid_prefix_matches(uuid, uuid_prefix, uuid_prefix_len)) |
1067 | continue; | |
db208f51 | 1068 | |
b4f1578f AK |
1069 | if (dm_tree_node_num_children(child, 0)) |
1070 | dm_tree_activate_children(child, uuid_prefix, uuid_prefix_len); | |
165e4a11 | 1071 | |
b4f1578f | 1072 | if (!(name = dm_tree_node_get_name(child))) { |
165e4a11 AK |
1073 | stack; |
1074 | continue; | |
1075 | } | |
1076 | ||
1077 | /* Rename? */ | |
1078 | if (child->props.new_name) { | |
1079 | if (!_rename_node(name, child->props.new_name, child->info.major, child->info.minor)) { | |
1080 | log_error("Failed to rename %s (%" PRIu32 | |
1081 | ":%" PRIu32 ") to %s", name, child->info.major, | |
1082 | child->info.minor, child->props.new_name); | |
1083 | return 0; | |
1084 | } | |
1085 | child->name = child->props.new_name; | |
1086 | child->props.new_name = NULL; | |
1087 | } | |
1088 | ||
1089 | if (!child->info.inactive_table && !child->info.suspended) | |
1090 | continue; | |
1091 | ||
1092 | if (!_resume_node(name, child->info.major, child->info.minor, &newinfo)) { | |
1093 | log_error("Unable to resume %s (%" PRIu32 | |
1094 | ":%" PRIu32 ")", name, child->info.major, | |
1095 | child->info.minor); | |
1096 | continue; | |
1097 | } | |
1098 | ||
1099 | /* Update cached info */ | |
1100 | child->info = newinfo; | |
db208f51 AK |
1101 | } |
1102 | ||
165e4a11 AK |
1103 | handle = NULL; |
1104 | ||
1105 | return 1; | |
1106 | } | |
1107 | ||
b4f1578f | 1108 | static int _create_node(struct dm_tree_node *dnode) |
165e4a11 AK |
1109 | { |
1110 | int r = 0; | |
1111 | struct dm_task *dmt; | |
1112 | ||
1113 | log_verbose("Creating %s", dnode->name); | |
1114 | ||
1115 | if (!(dmt = dm_task_create(DM_DEVICE_CREATE))) { | |
1116 | log_error("Create dm_task creation failed for %s", dnode->name); | |
1117 | return 0; | |
1118 | } | |
1119 | ||
1120 | if (!dm_task_set_name(dmt, dnode->name)) { | |
1121 | log_error("Failed to set device name for %s", dnode->name); | |
1122 | goto out; | |
1123 | } | |
1124 | ||
1125 | if (!dm_task_set_uuid(dmt, dnode->uuid)) { | |
1126 | log_error("Failed to set uuid for %s", dnode->name); | |
1127 | goto out; | |
1128 | } | |
1129 | ||
1130 | if (dnode->props.major && | |
1131 | (!dm_task_set_major(dmt, dnode->props.major) || | |
1132 | !dm_task_set_minor(dmt, dnode->props.minor))) { | |
1133 | log_error("Failed to set device number for %s creation.", dnode->name); | |
1134 | goto out; | |
1135 | } | |
1136 | ||
1137 | if (dnode->props.read_only && !dm_task_set_ro(dmt)) { | |
1138 | log_error("Failed to set read only flag for %s", dnode->name); | |
1139 | goto out; | |
1140 | } | |
1141 | ||
1142 | if (!dm_task_no_open_count(dmt)) | |
1143 | log_error("Failed to disable open_count"); | |
1144 | ||
1145 | if ((r = dm_task_run(dmt))) | |
1146 | r = dm_task_get_info(dmt, &dnode->info); | |
1147 | ||
1148 | out: | |
1149 | dm_task_destroy(dmt); | |
1150 | ||
1151 | return r; | |
1152 | } | |
1153 | ||
1154 | ||
b4f1578f | 1155 | static int _build_dev_string(char *devbuf, size_t bufsize, struct dm_tree_node *node) |
165e4a11 AK |
1156 | { |
1157 | if (!dm_format_dev(devbuf, bufsize, node->info.major, node->info.minor)) { | |
1158 | log_error("Failed to format %s device number for %s as dm " | |
1159 | "target (%u,%u)", | |
1160 | node->name, node->uuid, node->info.major, node->info.minor); | |
1161 | return 0; | |
1162 | } | |
1163 | ||
1164 | return 1; | |
1165 | } | |
1166 | ||
1167 | static int _emit_areas_line(struct dm_task *dmt, struct load_segment *seg, char *params, size_t paramsize, int *pos) | |
1168 | { | |
1169 | struct seg_area *area; | |
1170 | char devbuf[10]; | |
1171 | int tw; | |
1172 | const char *prefix = ""; | |
1173 | ||
1174 | list_iterate_items(area, &seg->areas) { | |
b4f1578f AK |
1175 | if (!_build_dev_string(devbuf, sizeof(devbuf), area->dev_node)) |
1176 | return_0; | |
165e4a11 AK |
1177 | |
1178 | if ((tw = _dm_snprintf(params + *pos, paramsize - *pos, "%s%s %" PRIu64, | |
1179 | prefix, devbuf, area->offset)) < 0) { | |
b4f1578f | 1180 | stack; /* Out of space */ |
165e4a11 AK |
1181 | return -1; |
1182 | } | |
1183 | ||
1184 | prefix = " "; | |
1185 | *pos += tw; | |
1186 | } | |
1187 | ||
1188 | return 1; | |
1189 | } | |
1190 | ||
1191 | static int _emit_segment_line(struct dm_task *dmt, struct load_segment *seg, uint64_t *seg_start, char *params, size_t paramsize) | |
1192 | { | |
1193 | int pos = 0; | |
1194 | int tw; | |
1195 | int r; | |
1196 | char originbuf[10], cowbuf[10], logbuf[10]; | |
1197 | ||
1198 | switch(seg->type) { | |
1199 | case SEG_ERROR: | |
1200 | case SEG_ZERO: | |
1201 | params[0] = '\0'; | |
1202 | case SEG_LINEAR: | |
1203 | break; | |
1204 | case SEG_MIRRORED: | |
1205 | if (seg->clustered) { | |
1206 | if ((tw = _dm_snprintf(params + pos, paramsize - pos, "clustered ")) < 0) { | |
b4f1578f | 1207 | stack; /* Out of space */ |
165e4a11 AK |
1208 | return -1; |
1209 | } | |
1210 | pos += tw; | |
1211 | } | |
1212 | if (!seg->log) { | |
1213 | if ((tw = _dm_snprintf(params + pos, paramsize - pos, "core 1 ")) < 0) { | |
b4f1578f | 1214 | stack; /* Out of space */ |
165e4a11 AK |
1215 | return -1; |
1216 | } | |
1217 | pos += tw; | |
1218 | } else { | |
b4f1578f AK |
1219 | if (!_build_dev_string(logbuf, sizeof(logbuf), seg->log)) |
1220 | return_0; | |
165e4a11 | 1221 | if ((tw = _dm_snprintf(params + pos, paramsize - pos, "disk 2 %s ", logbuf)) < 0) { |
b4f1578f | 1222 | stack; /* Out of space */ |
165e4a11 AK |
1223 | return -1; |
1224 | } | |
1225 | pos += tw; | |
1226 | } | |
1227 | if ((tw = _dm_snprintf(params + pos, paramsize - pos, "%u %u ", seg->region_size, seg->mirror_area_count)) < 0) { | |
b4f1578f | 1228 | stack; /* Out of space */ |
165e4a11 AK |
1229 | return -1; |
1230 | } | |
1231 | pos += tw; | |
1232 | break; | |
1233 | case SEG_SNAPSHOT: | |
b4f1578f AK |
1234 | if (!_build_dev_string(originbuf, sizeof(originbuf), seg->origin)) |
1235 | return_0; | |
1236 | if (!_build_dev_string(cowbuf, sizeof(cowbuf), seg->cow)) | |
1237 | return_0; | |
165e4a11 AK |
1238 | if ((pos = _dm_snprintf(params, paramsize, "%s %s %c %d", |
1239 | originbuf, cowbuf, | |
1240 | seg->persistent ? 'P' : 'N', | |
1241 | seg->chunk_size)) < 0) { | |
b4f1578f | 1242 | stack; /* Out of space */ |
165e4a11 AK |
1243 | return -1; |
1244 | } | |
1245 | break; | |
1246 | case SEG_SNAPSHOT_ORIGIN: | |
b4f1578f AK |
1247 | if (!_build_dev_string(originbuf, sizeof(originbuf), seg->origin)) |
1248 | return_0; | |
165e4a11 AK |
1249 | if ((pos = _dm_snprintf(params, paramsize, "%s", |
1250 | originbuf)) < 0) { | |
b4f1578f | 1251 | stack; /* Out of space */ |
165e4a11 AK |
1252 | return -1; |
1253 | } | |
1254 | break; | |
1255 | case SEG_STRIPED: | |
1256 | if ((pos = _dm_snprintf(params, paramsize, "%u %u ", | |
1257 | seg->area_count, | |
1258 | seg->stripe_size)) < 0) { | |
b4f1578f | 1259 | stack; /* Out of space */ |
165e4a11 AK |
1260 | return -1; |
1261 | } | |
1262 | break; | |
1263 | } | |
1264 | ||
1265 | switch(seg->type) { | |
1266 | case SEG_ERROR: | |
1267 | case SEG_SNAPSHOT: | |
1268 | case SEG_SNAPSHOT_ORIGIN: | |
1269 | case SEG_ZERO: | |
1270 | break; | |
1271 | case SEG_LINEAR: | |
1272 | case SEG_MIRRORED: | |
1273 | case SEG_STRIPED: | |
1274 | if ((r = _emit_areas_line(dmt, seg, params, paramsize, &pos)) <= 0) { | |
1275 | stack; | |
1276 | return r; | |
1277 | } | |
1278 | break; | |
1279 | } | |
1280 | ||
1281 | log_debug("Adding target: %" PRIu64 " %" PRIu64 " %s %s", | |
1282 | *seg_start, seg->size, dm_segtypes[seg->type].target, params); | |
1283 | ||
b4f1578f AK |
1284 | if (!dm_task_add_target(dmt, *seg_start, seg->size, dm_segtypes[seg->type].target, params)) |
1285 | return_0; | |
165e4a11 AK |
1286 | |
1287 | *seg_start += seg->size; | |
1288 | ||
1289 | return 1; | |
1290 | } | |
1291 | ||
1292 | static int _emit_segment(struct dm_task *dmt, struct load_segment *seg, | |
1293 | uint64_t *seg_start) | |
1294 | { | |
1295 | char *params; | |
1296 | size_t paramsize = 4096; | |
1297 | int ret; | |
1298 | ||
1299 | do { | |
1300 | if (!(params = dm_malloc(paramsize))) { | |
1301 | log_error("Insufficient space for target parameters."); | |
1302 | return 0; | |
1303 | } | |
1304 | ||
1305 | ret = _emit_segment_line(dmt, seg, seg_start, params, paramsize); | |
1306 | dm_free(params); | |
1307 | ||
1308 | if (!ret) | |
1309 | stack; | |
1310 | ||
1311 | if (ret >= 0) | |
1312 | return ret; | |
1313 | ||
1314 | log_debug("Insufficient space in params[%" PRIsize_t | |
1315 | "] for target parameters.", paramsize); | |
1316 | ||
1317 | paramsize *= 2; | |
1318 | } while (paramsize < MAX_TARGET_PARAMSIZE); | |
1319 | ||
1320 | log_error("Target parameter size too big. Aborting."); | |
1321 | return 0; | |
1322 | } | |
1323 | ||
b4f1578f | 1324 | static int _load_node(struct dm_tree_node *dnode) |
165e4a11 AK |
1325 | { |
1326 | int r = 0; | |
1327 | struct dm_task *dmt; | |
1328 | struct load_segment *seg; | |
1329 | uint64_t seg_start = 0; | |
1330 | ||
1331 | log_verbose("Loading %s table", dnode->name); | |
1332 | ||
1333 | if (!(dmt = dm_task_create(DM_DEVICE_RELOAD))) { | |
1334 | log_error("Reload dm_task creation failed for %s", dnode->name); | |
1335 | return 0; | |
1336 | } | |
1337 | ||
1338 | if (!dm_task_set_major(dmt, dnode->info.major) || | |
1339 | !dm_task_set_minor(dmt, dnode->info.minor)) { | |
1340 | log_error("Failed to set device number for %s reload.", dnode->name); | |
1341 | goto out; | |
1342 | } | |
1343 | ||
1344 | if (dnode->props.read_only && !dm_task_set_ro(dmt)) { | |
1345 | log_error("Failed to set read only flag for %s", dnode->name); | |
1346 | goto out; | |
1347 | } | |
1348 | ||
1349 | if (!dm_task_no_open_count(dmt)) | |
1350 | log_error("Failed to disable open_count"); | |
1351 | ||
1352 | list_iterate_items(seg, &dnode->props.segs) | |
b4f1578f AK |
1353 | if (!_emit_segment(dmt, seg, &seg_start)) |
1354 | goto_out; | |
165e4a11 AK |
1355 | |
1356 | if ((r = dm_task_run(dmt))) | |
1357 | r = dm_task_get_info(dmt, &dnode->info); | |
1358 | ||
1359 | dnode->props.segment_count = 0; | |
1360 | ||
1361 | out: | |
1362 | dm_task_destroy(dmt); | |
1363 | ||
1364 | return r; | |
1365 | ||
1366 | } | |
1367 | ||
b4f1578f | 1368 | int dm_tree_preload_children(struct dm_tree_node *dnode, |
165e4a11 | 1369 | const char *uuid_prefix, |
e6a6954e | 1370 | size_t uuid_prefix_len) |
165e4a11 AK |
1371 | { |
1372 | void *handle = NULL; | |
b4f1578f | 1373 | struct dm_tree_node *child; |
165e4a11 AK |
1374 | struct dm_info newinfo; |
1375 | const char *name; | |
1376 | ||
1377 | /* Preload children first */ | |
b4f1578f | 1378 | while ((child = dm_tree_next_child(&handle, dnode, 0))) { |
165e4a11 AK |
1379 | /* Skip existing non-device-mapper devices */ |
1380 | if (!child->info.exists && child->info.major) | |
1381 | continue; | |
1382 | ||
1383 | /* Ignore if it doesn't belong to this VG */ | |
87f98002 AK |
1384 | if (child->info.exists && |
1385 | !_uuid_prefix_matches(child->uuid, uuid_prefix, uuid_prefix_len)) | |
165e4a11 AK |
1386 | continue; |
1387 | ||
b4f1578f | 1388 | if (dm_tree_node_num_children(child, 0)) |
e6a6954e | 1389 | dm_tree_preload_children(child, uuid_prefix, uuid_prefix_len); |
165e4a11 | 1390 | |
b4f1578f | 1391 | if (!(name = dm_tree_node_get_name(child))) { |
165e4a11 AK |
1392 | stack; |
1393 | continue; | |
1394 | } | |
1395 | ||
1396 | /* FIXME Cope if name exists with no uuid? */ | |
1397 | if (!child->info.exists) { | |
1398 | if (!_create_node(child)) { | |
1399 | stack; | |
1400 | return 0; | |
1401 | } | |
1402 | } | |
1403 | ||
1404 | if (!child->info.inactive_table && child->props.segment_count) { | |
1405 | if (!_load_node(child)) { | |
1406 | stack; | |
1407 | return 0; | |
1408 | } | |
1409 | } | |
1410 | ||
1411 | /* Resume device immediately if it has parents */ | |
abbca212 | 1412 | if (!dm_tree_node_num_children(child, 1)) |
165e4a11 AK |
1413 | continue; |
1414 | ||
1415 | if (!_resume_node(name, child->info.major, child->info.minor, &newinfo)) { | |
1416 | log_error("Unable to resume %s (%" PRIu32 | |
1417 | ":%" PRIu32 ")", name, child->info.major, | |
1418 | child->info.minor); | |
1419 | continue; | |
1420 | } | |
1421 | ||
1422 | /* Update cached info */ | |
1423 | child->info = newinfo; | |
1424 | } | |
1425 | ||
1426 | handle = NULL; | |
1427 | ||
1428 | return 1; | |
1429 | } | |
1430 | ||
165e4a11 AK |
1431 | /* |
1432 | * Returns 1 if unsure. | |
1433 | */ | |
b4f1578f | 1434 | int dm_tree_children_use_uuid(struct dm_tree_node *dnode, |
165e4a11 AK |
1435 | const char *uuid_prefix, |
1436 | size_t uuid_prefix_len) | |
1437 | { | |
1438 | void *handle = NULL; | |
b4f1578f | 1439 | struct dm_tree_node *child = dnode; |
165e4a11 AK |
1440 | const char *uuid; |
1441 | ||
b4f1578f AK |
1442 | while ((child = dm_tree_next_child(&handle, dnode, 0))) { |
1443 | if (!(uuid = dm_tree_node_get_uuid(child))) { | |
1444 | log_error("Failed to get uuid for dtree node."); | |
165e4a11 AK |
1445 | return 1; |
1446 | } | |
1447 | ||
87f98002 | 1448 | if (_uuid_prefix_matches(uuid, uuid_prefix, uuid_prefix_len)) |
165e4a11 AK |
1449 | return 1; |
1450 | ||
b4f1578f AK |
1451 | if (dm_tree_node_num_children(child, 0)) |
1452 | dm_tree_children_use_uuid(child, uuid_prefix, uuid_prefix_len); | |
165e4a11 AK |
1453 | } |
1454 | ||
1455 | return 0; | |
1456 | } | |
1457 | ||
1458 | /* | |
1459 | * Target functions | |
1460 | */ | |
b4f1578f | 1461 | static struct load_segment *_add_segment(struct dm_tree_node *dnode, unsigned type, uint64_t size) |
165e4a11 AK |
1462 | { |
1463 | struct load_segment *seg; | |
1464 | ||
b4f1578f AK |
1465 | if (!(seg = dm_pool_zalloc(dnode->dtree->mem, sizeof(*seg)))) { |
1466 | log_error("dtree node segment allocation failed"); | |
165e4a11 AK |
1467 | return NULL; |
1468 | } | |
1469 | ||
1470 | seg->type = type; | |
1471 | seg->size = size; | |
1472 | seg->area_count = 0; | |
1473 | list_init(&seg->areas); | |
1474 | seg->stripe_size = 0; | |
1475 | seg->persistent = 0; | |
1476 | seg->chunk_size = 0; | |
1477 | seg->cow = NULL; | |
1478 | seg->origin = NULL; | |
1479 | ||
1480 | list_add(&dnode->props.segs, &seg->list); | |
1481 | dnode->props.segment_count++; | |
1482 | ||
1483 | return seg; | |
1484 | } | |
1485 | ||
b4f1578f | 1486 | int dm_tree_node_add_snapshot_origin_target(struct dm_tree_node *dnode, |
165e4a11 AK |
1487 | uint64_t size, |
1488 | const char *origin_uuid) | |
1489 | { | |
1490 | struct load_segment *seg; | |
b4f1578f | 1491 | struct dm_tree_node *origin_node; |
165e4a11 | 1492 | |
b4f1578f AK |
1493 | if (!(seg = _add_segment(dnode, SEG_SNAPSHOT_ORIGIN, size))) |
1494 | return_0; | |
165e4a11 | 1495 | |
b4f1578f | 1496 | if (!(origin_node = dm_tree_find_node_by_uuid(dnode->dtree, origin_uuid))) { |
165e4a11 AK |
1497 | log_error("Couldn't find snapshot origin uuid %s.", origin_uuid); |
1498 | return 0; | |
1499 | } | |
1500 | ||
1501 | seg->origin = origin_node; | |
b4f1578f AK |
1502 | if (!_link_tree_nodes(dnode, origin_node)) |
1503 | return_0; | |
165e4a11 AK |
1504 | |
1505 | return 1; | |
1506 | } | |
1507 | ||
b4f1578f | 1508 | int dm_tree_node_add_snapshot_target(struct dm_tree_node *node, |
165e4a11 AK |
1509 | uint64_t size, |
1510 | const char *origin_uuid, | |
1511 | const char *cow_uuid, | |
1512 | int persistent, | |
1513 | uint32_t chunk_size) | |
1514 | { | |
1515 | struct load_segment *seg; | |
b4f1578f | 1516 | struct dm_tree_node *origin_node, *cow_node; |
165e4a11 | 1517 | |
b4f1578f AK |
1518 | if (!(seg = _add_segment(node, SEG_SNAPSHOT, size))) |
1519 | return_0; | |
165e4a11 | 1520 | |
b4f1578f | 1521 | if (!(origin_node = dm_tree_find_node_by_uuid(node->dtree, origin_uuid))) { |
165e4a11 AK |
1522 | log_error("Couldn't find snapshot origin uuid %s.", origin_uuid); |
1523 | return 0; | |
1524 | } | |
1525 | ||
1526 | seg->origin = origin_node; | |
b4f1578f AK |
1527 | if (!_link_tree_nodes(node, origin_node)) |
1528 | return_0; | |
165e4a11 | 1529 | |
b4f1578f | 1530 | if (!(cow_node = dm_tree_find_node_by_uuid(node->dtree, cow_uuid))) { |
165e4a11 AK |
1531 | log_error("Couldn't find snapshot origin uuid %s.", cow_uuid); |
1532 | return 0; | |
1533 | } | |
1534 | ||
1535 | seg->cow = cow_node; | |
b4f1578f AK |
1536 | if (!_link_tree_nodes(node, cow_node)) |
1537 | return_0; | |
165e4a11 AK |
1538 | |
1539 | seg->persistent = persistent ? 1 : 0; | |
1540 | seg->chunk_size = chunk_size; | |
1541 | ||
1542 | return 1; | |
1543 | } | |
1544 | ||
b4f1578f | 1545 | int dm_tree_node_add_error_target(struct dm_tree_node *node, |
165e4a11 AK |
1546 | uint64_t size) |
1547 | { | |
b4f1578f AK |
1548 | if (!_add_segment(node, SEG_ERROR, size)) |
1549 | return_0; | |
165e4a11 AK |
1550 | |
1551 | return 1; | |
1552 | } | |
1553 | ||
b4f1578f | 1554 | int dm_tree_node_add_zero_target(struct dm_tree_node *node, |
165e4a11 AK |
1555 | uint64_t size) |
1556 | { | |
b4f1578f AK |
1557 | if (!_add_segment(node, SEG_ZERO, size)) |
1558 | return_0; | |
165e4a11 AK |
1559 | |
1560 | return 1; | |
1561 | } | |
1562 | ||
b4f1578f | 1563 | int dm_tree_node_add_linear_target(struct dm_tree_node *node, |
165e4a11 AK |
1564 | uint64_t size) |
1565 | { | |
b4f1578f AK |
1566 | if (!_add_segment(node, SEG_LINEAR, size)) |
1567 | return_0; | |
165e4a11 AK |
1568 | |
1569 | return 1; | |
1570 | } | |
1571 | ||
b4f1578f | 1572 | int dm_tree_node_add_striped_target(struct dm_tree_node *node, |
165e4a11 AK |
1573 | uint64_t size, |
1574 | uint32_t stripe_size) | |
1575 | { | |
1576 | struct load_segment *seg; | |
1577 | ||
b4f1578f AK |
1578 | if (!(seg = _add_segment(node, SEG_STRIPED, size))) |
1579 | return_0; | |
165e4a11 AK |
1580 | |
1581 | seg->stripe_size = stripe_size; | |
1582 | ||
1583 | return 1; | |
1584 | } | |
1585 | ||
b4f1578f | 1586 | int dm_tree_node_add_mirror_target_log(struct dm_tree_node *node, |
165e4a11 AK |
1587 | uint32_t region_size, |
1588 | unsigned clustered, | |
1589 | const char *log_uuid, | |
1590 | unsigned area_count) | |
1591 | { | |
908db078 | 1592 | struct dm_tree_node *log_node = NULL; |
165e4a11 AK |
1593 | struct load_segment *seg; |
1594 | ||
1595 | if (!node->props.segment_count) { | |
1596 | log_error("Internal error: Attempt to add target area to missing segment."); | |
1597 | return 0; | |
1598 | } | |
1599 | ||
1600 | seg = list_item(list_last(&node->props.segs), struct load_segment); | |
1601 | ||
24b026e3 AK |
1602 | if (log_uuid) { |
1603 | if (!(log_node = dm_tree_find_node_by_uuid(node->dtree, log_uuid))) { | |
1604 | log_error("Couldn't find mirror log uuid %s.", log_uuid); | |
1605 | return 0; | |
1606 | } | |
1607 | if (!_link_tree_nodes(node, log_node)) | |
1608 | return_0; | |
165e4a11 AK |
1609 | } |
1610 | ||
1611 | seg->log = log_node; | |
165e4a11 AK |
1612 | seg->region_size = region_size; |
1613 | seg->clustered = clustered; | |
1614 | seg->mirror_area_count = area_count; | |
1615 | ||
1616 | return 1; | |
1617 | } | |
1618 | ||
b4f1578f | 1619 | int dm_tree_node_add_mirror_target(struct dm_tree_node *node, |
165e4a11 AK |
1620 | uint64_t size) |
1621 | { | |
1622 | struct load_segment *seg; | |
1623 | ||
b4f1578f AK |
1624 | if (!(seg = _add_segment(node, SEG_MIRRORED, size))) |
1625 | return_0; | |
165e4a11 AK |
1626 | |
1627 | return 1; | |
1628 | } | |
1629 | ||
b4f1578f | 1630 | static int _add_area(struct dm_tree_node *node, struct load_segment *seg, struct dm_tree_node *dev_node, uint64_t offset) |
165e4a11 AK |
1631 | { |
1632 | struct seg_area *area; | |
1633 | ||
b4f1578f | 1634 | if (!(area = dm_pool_zalloc(node->dtree->mem, sizeof (*area)))) { |
165e4a11 AK |
1635 | log_error("Failed to allocate target segment area."); |
1636 | return 0; | |
1637 | } | |
1638 | ||
1639 | area->dev_node = dev_node; | |
1640 | area->offset = offset; | |
1641 | ||
1642 | list_add(&seg->areas, &area->list); | |
1643 | seg->area_count++; | |
1644 | ||
1645 | return 1; | |
1646 | } | |
1647 | ||
b4f1578f | 1648 | int dm_tree_node_add_target_area(struct dm_tree_node *node, |
165e4a11 AK |
1649 | const char *dev_name, |
1650 | const char *uuid, | |
1651 | uint64_t offset) | |
1652 | { | |
1653 | struct load_segment *seg; | |
1654 | struct stat info; | |
b4f1578f | 1655 | struct dm_tree_node *dev_node; |
165e4a11 AK |
1656 | |
1657 | if ((!dev_name || !*dev_name) && (!uuid || !*uuid)) { | |
b4f1578f | 1658 | log_error("dm_tree_node_add_target_area called without device"); |
165e4a11 AK |
1659 | return 0; |
1660 | } | |
1661 | ||
1662 | if (uuid) { | |
b4f1578f | 1663 | if (!(dev_node = dm_tree_find_node_by_uuid(node->dtree, uuid))) { |
165e4a11 AK |
1664 | log_error("Couldn't find area uuid %s.", uuid); |
1665 | return 0; | |
1666 | } | |
b4f1578f AK |
1667 | if (!_link_tree_nodes(node, dev_node)) |
1668 | return_0; | |
165e4a11 AK |
1669 | } else { |
1670 | if (stat(dev_name, &info) < 0) { | |
1671 | log_error("Device %s not found.", dev_name); | |
1672 | return 0; | |
1673 | } | |
1674 | ||
1675 | if (!S_ISBLK(info.st_mode)) { | |
1676 | log_error("Device %s is not a block device.", dev_name); | |
1677 | return 0; | |
1678 | } | |
1679 | ||
1680 | /* FIXME Check correct macro use */ | |
b4f1578f AK |
1681 | if (!(dev_node = _add_dev(node->dtree, node, MAJOR(info.st_rdev), MINOR(info.st_rdev)))) |
1682 | return_0; | |
165e4a11 AK |
1683 | } |
1684 | ||
1685 | if (!node->props.segment_count) { | |
1686 | log_error("Internal error: Attempt to add target area to missing segment."); | |
1687 | return 0; | |
1688 | } | |
1689 | ||
1690 | seg = list_item(list_last(&node->props.segs), struct load_segment); | |
1691 | ||
b4f1578f AK |
1692 | if (!_add_area(node, seg, dev_node, offset)) |
1693 | return_0; | |
165e4a11 AK |
1694 | |
1695 | return 1; | |
db208f51 | 1696 | } |