]> sourceware.org Git - lvm2.git/blame - libdm/libdm-deptree.c
Add preload support for thin and thin_pool
[lvm2.git] / libdm / libdm-deptree.c
CommitLineData
3d0480ed 1/*
4251236e 2 * Copyright (C) 2005-2011 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
b262f3e1
ZK
30#define REPLICATOR_LOCAL_SITE 0
31
4251236e
ZK
32#define THIN_MIN_DATA_SIZE 128
33#define THIN_MAX_DATA_SIZE 2097152
34#define THIN_MAX_DEVICE_ID ((1 << 24) - 1)
35
36#define QUOTE(x) #x
37
165e4a11
AK
38/* Supported segment types */
39enum {
12ca060e
MB
40 SEG_CRYPT,
41 SEG_ERROR,
165e4a11
AK
42 SEG_LINEAR,
43 SEG_MIRRORED,
b262f3e1
ZK
44 SEG_REPLICATOR,
45 SEG_REPLICATOR_DEV,
165e4a11
AK
46 SEG_SNAPSHOT,
47 SEG_SNAPSHOT_ORIGIN,
aa6f4e51 48 SEG_SNAPSHOT_MERGE,
165e4a11
AK
49 SEG_STRIPED,
50 SEG_ZERO,
4251236e
ZK
51 SEG_THIN_POOL,
52 SEG_THIN,
cac52ca4
JEB
53 SEG_RAID1,
54 SEG_RAID4,
55 SEG_RAID5_LA,
56 SEG_RAID5_RA,
57 SEG_RAID5_LS,
58 SEG_RAID5_RS,
59 SEG_RAID6_ZR,
60 SEG_RAID6_NR,
61 SEG_RAID6_NC,
62 SEG_LAST,
165e4a11 63};
b4f1578f 64
165e4a11
AK
65/* FIXME Add crypt and multipath support */
66
67struct {
68 unsigned type;
69 const char *target;
70} dm_segtypes[] = {
12ca060e 71 { SEG_CRYPT, "crypt" },
165e4a11
AK
72 { SEG_ERROR, "error" },
73 { SEG_LINEAR, "linear" },
74 { SEG_MIRRORED, "mirror" },
b262f3e1
ZK
75 { SEG_REPLICATOR, "replicator" },
76 { SEG_REPLICATOR_DEV, "replicator-dev" },
165e4a11
AK
77 { SEG_SNAPSHOT, "snapshot" },
78 { SEG_SNAPSHOT_ORIGIN, "snapshot-origin" },
aa6f4e51 79 { SEG_SNAPSHOT_MERGE, "snapshot-merge" },
165e4a11
AK
80 { SEG_STRIPED, "striped" },
81 { SEG_ZERO, "zero"},
4251236e
ZK
82 { SEG_THIN_POOL, "thin-pool"},
83 { SEG_THIN, "thin"},
cac52ca4
JEB
84 { SEG_RAID1, "raid1"},
85 { SEG_RAID4, "raid4"},
86 { SEG_RAID5_LA, "raid5_la"},
87 { SEG_RAID5_RA, "raid5_ra"},
88 { SEG_RAID5_LS, "raid5_ls"},
89 { SEG_RAID5_RS, "raid5_rs"},
90 { SEG_RAID6_ZR, "raid6_zr"},
91 { SEG_RAID6_NR, "raid6_nr"},
92 { SEG_RAID6_NC, "raid6_nc"},
ee05be08
ZK
93
94 /*
95 *WARNING: Since 'raid' target overloads this 1:1 mapping table
96 * for search do not add new enum elements past them!
97 */
cac52ca4
JEB
98 { SEG_RAID5_LS, "raid5"}, /* same as "raid5_ls" (default for MD also) */
99 { SEG_RAID6_ZR, "raid6"}, /* same as "raid6_zr" */
100 { SEG_LAST, NULL },
165e4a11
AK
101};
102
103/* Some segment types have a list of areas of other devices attached */
104struct seg_area {
2c44337b 105 struct dm_list list;
165e4a11 106
b4f1578f 107 struct dm_tree_node *dev_node;
165e4a11
AK
108
109 uint64_t offset;
b262f3e1
ZK
110
111 unsigned rsite_index; /* Replicator site index */
112 struct dm_tree_node *slog; /* Replicator sync log node */
113 uint64_t region_size; /* Replicator sync log size */
114 uint32_t flags; /* Replicator sync log flags */
115};
116
117/* Replicator-log has a list of sites */
118/* FIXME: maybe move to seg_area too? */
119struct replicator_site {
120 struct dm_list list;
121
122 unsigned rsite_index;
123 dm_replicator_mode_t mode;
124 uint32_t async_timeout;
125 uint32_t fall_behind_ios;
126 uint64_t fall_behind_data;
165e4a11
AK
127};
128
129/* Per-segment properties */
130struct load_segment {
2c44337b 131 struct dm_list list;
165e4a11
AK
132
133 unsigned type;
134
135 uint64_t size;
136
b262f3e1
ZK
137 unsigned area_count; /* Linear + Striped + Mirrored + Crypt + Replicator */
138 struct dm_list areas; /* Linear + Striped + Mirrored + Crypt + Replicator */
165e4a11 139
cac52ca4 140 uint32_t stripe_size; /* Striped + raid */
165e4a11
AK
141
142 int persistent; /* Snapshot */
143 uint32_t chunk_size; /* Snapshot */
b4f1578f
AK
144 struct dm_tree_node *cow; /* Snapshot */
145 struct dm_tree_node *origin; /* Snapshot + Snapshot origin */
aa6f4e51 146 struct dm_tree_node *merge; /* Snapshot */
165e4a11 147
b262f3e1 148 struct dm_tree_node *log; /* Mirror + Replicator */
cac52ca4 149 uint32_t region_size; /* Mirror + raid */
165e4a11
AK
150 unsigned clustered; /* Mirror */
151 unsigned mirror_area_count; /* Mirror */
dbcb64b8 152 uint32_t flags; /* Mirror log */
67b25ed4 153 char *uuid; /* Clustered mirror log */
12ca060e
MB
154
155 const char *cipher; /* Crypt */
156 const char *chainmode; /* Crypt */
157 const char *iv; /* Crypt */
158 uint64_t iv_offset; /* Crypt */
159 const char *key; /* Crypt */
b262f3e1
ZK
160
161 const char *rlog_type; /* Replicator */
162 struct dm_list rsites; /* Replicator */
163 unsigned rsite_count; /* Replicator */
164 unsigned rdevice_count; /* Replicator */
165 struct dm_tree_node *replicator;/* Replicator-dev */
166 uint64_t rdevice_index; /* Replicator-dev */
f439e65b 167
40e5fd8b 168 uint64_t rebuilds; /* raid */
4251236e
ZK
169
170 struct dm_tree_node *metadata; /* Thin_pool */
171 struct dm_tree_node *pool; /* Thin_pool, Thin */
172 uint32_t data_block_size; /* Thin_pool */
173 uint64_t low_water_mark; /* Thin_pool */
174 unsigned skip_block_zeroeing; /* Thin_pool */
175 uint32_t device_id; /* Thin */
176
165e4a11
AK
177};
178
179/* Per-device properties */
180struct load_properties {
181 int read_only;
182 uint32_t major;
183 uint32_t minor;
184
52b84409
AK
185 uint32_t read_ahead;
186 uint32_t read_ahead_flags;
187
165e4a11 188 unsigned segment_count;
bb875bb9 189 unsigned size_changed;
2c44337b 190 struct dm_list segs;
165e4a11
AK
191
192 const char *new_name;
566515c0
PR
193
194 /* If immediate_dev_node is set to 1, try to create the dev node
195 * as soon as possible (e.g. in preload stage even during traversal
196 * and processing of dm tree). This will also flush all stacked dev
197 * node operations, synchronizing with udev.
198 */
df390f17
AK
199 unsigned immediate_dev_node;
200
201 /*
202 * If the device size changed from zero and this is set,
203 * don't resume the device immediately, even if the device
204 * has parents. This works provided the parents do not
205 * validate the device size and is required by pvmove to
206 * avoid starting the mirror resync operation too early.
207 */
208 unsigned delay_resume_if_new;
165e4a11
AK
209};
210
211/* Two of these used to join two nodes with uses and used_by. */
b4f1578f 212struct dm_tree_link {
2c44337b 213 struct dm_list list;
b4f1578f 214 struct dm_tree_node *node;
165e4a11
AK
215};
216
b4f1578f
AK
217struct dm_tree_node {
218 struct dm_tree *dtree;
3d0480ed 219
40e5fd8b
AK
220 const char *name;
221 const char *uuid;
222 struct dm_info info;
3d0480ed 223
40e5fd8b
AK
224 struct dm_list uses; /* Nodes this node uses */
225 struct dm_list used_by; /* Nodes that use this node */
165e4a11 226
56c28292
AK
227 int activation_priority; /* 0 gets activated first */
228
f16aea9e
PR
229 uint16_t udev_flags; /* Udev control flags */
230
165e4a11
AK
231 void *context; /* External supplied context */
232
233 struct load_properties props; /* For creation/table (re)load */
76d1aec8
ZK
234
235 /*
236 * If presuspend of child node is needed
237 * Note: only direct child is allowed
238 */
239 struct dm_tree_node *presuspend_node;
3d0480ed
AK
240};
241
b4f1578f 242struct dm_tree {
a3f6b2ce
AK
243 struct dm_pool *mem;
244 struct dm_hash_table *devs;
165e4a11 245 struct dm_hash_table *uuids;
b4f1578f 246 struct dm_tree_node root;
c55b1410 247 int skip_lockfs; /* 1 skips lockfs (for non-snapshots) */
787200ef
PR
248 int no_flush; /* 1 sets noflush (mirrors/multipath) */
249 int retry_remove; /* 1 retries remove if not successful */
bd90c6b2 250 uint32_t cookie;
3d0480ed
AK
251};
252
b4f1578f 253struct dm_tree *dm_tree_create(void)
3d0480ed 254{
b4f1578f 255 struct dm_tree *dtree;
3d0480ed 256
ac0252ca 257 if (!(dtree = dm_zalloc(sizeof(*dtree)))) {
b4f1578f 258 log_error("dm_tree_create malloc failed");
3d0480ed
AK
259 return NULL;
260 }
261
b4f1578f 262 dtree->root.dtree = dtree;
2c44337b
AK
263 dm_list_init(&dtree->root.uses);
264 dm_list_init(&dtree->root.used_by);
c55b1410 265 dtree->skip_lockfs = 0;
b9ffd32c 266 dtree->no_flush = 0;
3d0480ed 267
b4f1578f
AK
268 if (!(dtree->mem = dm_pool_create("dtree", 1024))) {
269 log_error("dtree pool creation failed");
270 dm_free(dtree);
3d0480ed
AK
271 return NULL;
272 }
273
b4f1578f
AK
274 if (!(dtree->devs = dm_hash_create(8))) {
275 log_error("dtree hash creation failed");
276 dm_pool_destroy(dtree->mem);
277 dm_free(dtree);
3d0480ed
AK
278 return NULL;
279 }
280
b4f1578f
AK
281 if (!(dtree->uuids = dm_hash_create(32))) {
282 log_error("dtree uuid hash creation failed");
283 dm_hash_destroy(dtree->devs);
284 dm_pool_destroy(dtree->mem);
285 dm_free(dtree);
165e4a11
AK
286 return NULL;
287 }
288
b4f1578f 289 return dtree;
3d0480ed
AK
290}
291
b4f1578f 292void dm_tree_free(struct dm_tree *dtree)
3d0480ed 293{
b4f1578f 294 if (!dtree)
3d0480ed
AK
295 return;
296
b4f1578f
AK
297 dm_hash_destroy(dtree->uuids);
298 dm_hash_destroy(dtree->devs);
299 dm_pool_destroy(dtree->mem);
300 dm_free(dtree);
3d0480ed
AK
301}
302
04bde319
ZK
303static int _nodes_are_linked(const struct dm_tree_node *parent,
304 const struct dm_tree_node *child)
3d0480ed 305{
b4f1578f 306 struct dm_tree_link *dlink;
3d0480ed 307
2c44337b 308 dm_list_iterate_items(dlink, &parent->uses)
3d0480ed
AK
309 if (dlink->node == child)
310 return 1;
3d0480ed
AK
311
312 return 0;
313}
314
2c44337b 315static int _link(struct dm_list *list, struct dm_tree_node *node)
3d0480ed 316{
b4f1578f 317 struct dm_tree_link *dlink;
3d0480ed 318
b4f1578f
AK
319 if (!(dlink = dm_pool_alloc(node->dtree->mem, sizeof(*dlink)))) {
320 log_error("dtree link allocation failed");
3d0480ed
AK
321 return 0;
322 }
323
324 dlink->node = node;
2c44337b 325 dm_list_add(list, &dlink->list);
3d0480ed
AK
326
327 return 1;
328}
329
b4f1578f
AK
330static int _link_nodes(struct dm_tree_node *parent,
331 struct dm_tree_node *child)
3d0480ed
AK
332{
333 if (_nodes_are_linked(parent, child))
334 return 1;
335
336 if (!_link(&parent->uses, child))
337 return 0;
338
339 if (!_link(&child->used_by, parent))
340 return 0;
341
342 return 1;
343}
344
2c44337b 345static void _unlink(struct dm_list *list, struct dm_tree_node *node)
3d0480ed 346{
b4f1578f 347 struct dm_tree_link *dlink;
3d0480ed 348
2c44337b 349 dm_list_iterate_items(dlink, list)
3d0480ed 350 if (dlink->node == node) {
2c44337b 351 dm_list_del(&dlink->list);
3d0480ed
AK
352 break;
353 }
3d0480ed
AK
354}
355
b4f1578f
AK
356static void _unlink_nodes(struct dm_tree_node *parent,
357 struct dm_tree_node *child)
3d0480ed
AK
358{
359 if (!_nodes_are_linked(parent, child))
360 return;
361
362 _unlink(&parent->uses, child);
363 _unlink(&child->used_by, parent);
364}
365
b4f1578f 366static int _add_to_toplevel(struct dm_tree_node *node)
165e4a11 367{
b4f1578f 368 return _link_nodes(&node->dtree->root, node);
165e4a11
AK
369}
370
b4f1578f 371static void _remove_from_toplevel(struct dm_tree_node *node)
3d0480ed 372{
b1ebf028 373 _unlink_nodes(&node->dtree->root, node);
3d0480ed
AK
374}
375
b4f1578f 376static int _add_to_bottomlevel(struct dm_tree_node *node)
3d0480ed 377{
b4f1578f 378 return _link_nodes(node, &node->dtree->root);
3d0480ed
AK
379}
380
b4f1578f 381static void _remove_from_bottomlevel(struct dm_tree_node *node)
165e4a11 382{
b1ebf028 383 _unlink_nodes(node, &node->dtree->root);
165e4a11
AK
384}
385
b4f1578f 386static int _link_tree_nodes(struct dm_tree_node *parent, struct dm_tree_node *child)
165e4a11
AK
387{
388 /* Don't link to root node if child already has a parent */
f77736ca 389 if (parent == &parent->dtree->root) {
b4f1578f 390 if (dm_tree_node_num_children(child, 1))
165e4a11
AK
391 return 1;
392 } else
393 _remove_from_toplevel(child);
394
f77736ca 395 if (child == &child->dtree->root) {
b4f1578f 396 if (dm_tree_node_num_children(parent, 0))
165e4a11
AK
397 return 1;
398 } else
399 _remove_from_bottomlevel(parent);
400
401 return _link_nodes(parent, child);
402}
403
b4f1578f 404static struct dm_tree_node *_create_dm_tree_node(struct dm_tree *dtree,
3d0480ed
AK
405 const char *name,
406 const char *uuid,
165e4a11 407 struct dm_info *info,
f16aea9e
PR
408 void *context,
409 uint16_t udev_flags)
3d0480ed 410{
b4f1578f 411 struct dm_tree_node *node;
3d0480ed
AK
412 uint64_t dev;
413
b4f1578f
AK
414 if (!(node = dm_pool_zalloc(dtree->mem, sizeof(*node)))) {
415 log_error("_create_dm_tree_node alloc failed");
3d0480ed
AK
416 return NULL;
417 }
418
b4f1578f 419 node->dtree = dtree;
3d0480ed
AK
420
421 node->name = name;
422 node->uuid = uuid;
423 node->info = *info;
165e4a11 424 node->context = context;
f16aea9e 425 node->udev_flags = udev_flags;
56c28292 426 node->activation_priority = 0;
3d0480ed 427
2c44337b
AK
428 dm_list_init(&node->uses);
429 dm_list_init(&node->used_by);
430 dm_list_init(&node->props.segs);
3d0480ed
AK
431
432 dev = MKDEV(info->major, info->minor);
433
b4f1578f 434 if (!dm_hash_insert_binary(dtree->devs, (const char *) &dev,
3d0480ed 435 sizeof(dev), node)) {
b4f1578f
AK
436 log_error("dtree node hash insertion failed");
437 dm_pool_free(dtree->mem, node);
3d0480ed
AK
438 return NULL;
439 }
440
165e4a11 441 if (uuid && *uuid &&
b4f1578f
AK
442 !dm_hash_insert(dtree->uuids, uuid, node)) {
443 log_error("dtree uuid hash insertion failed");
444 dm_hash_remove_binary(dtree->devs, (const char *) &dev,
165e4a11 445 sizeof(dev));
b4f1578f 446 dm_pool_free(dtree->mem, node);
165e4a11
AK
447 return NULL;
448 }
449
3d0480ed
AK
450 return node;
451}
452
b4f1578f 453static struct dm_tree_node *_find_dm_tree_node(struct dm_tree *dtree,
3d0480ed
AK
454 uint32_t major, uint32_t minor)
455{
456 uint64_t dev = MKDEV(major, minor);
457
b4f1578f 458 return dm_hash_lookup_binary(dtree->devs, (const char *) &dev,
3d0480ed
AK
459 sizeof(dev));
460}
461
b4f1578f 462static struct dm_tree_node *_find_dm_tree_node_by_uuid(struct dm_tree *dtree,
165e4a11
AK
463 const char *uuid)
464{
87f98002
AK
465 struct dm_tree_node *node;
466
467 if ((node = dm_hash_lookup(dtree->uuids, uuid)))
468 return node;
469
470 if (strncmp(uuid, UUID_PREFIX, sizeof(UUID_PREFIX) - 1))
471 return NULL;
472
473 return dm_hash_lookup(dtree->uuids, uuid + sizeof(UUID_PREFIX) - 1);
165e4a11
AK
474}
475
a3f6b2ce 476static int _deps(struct dm_task **dmt, struct dm_pool *mem, uint32_t major, uint32_t minor,
3d0480ed
AK
477 const char **name, const char **uuid,
478 struct dm_info *info, struct dm_deps **deps)
479{
480 memset(info, 0, sizeof(*info));
481
482 if (!dm_is_dm_major(major)) {
483 *name = "";
484 *uuid = "";
485 *deps = NULL;
486 info->major = major;
487 info->minor = minor;
488 info->exists = 0;
165e4a11
AK
489 info->live_table = 0;
490 info->inactive_table = 0;
491 info->read_only = 0;
3d0480ed
AK
492 return 1;
493 }
494
495 if (!(*dmt = dm_task_create(DM_DEVICE_DEPS))) {
496 log_error("deps dm_task creation failed");
497 return 0;
498 }
499
b4f1578f
AK
500 if (!dm_task_set_major(*dmt, major)) {
501 log_error("_deps: failed to set major for (%" PRIu32 ":%" PRIu32 ")",
502 major, minor);
3d0480ed 503 goto failed;
b4f1578f 504 }
3d0480ed 505
b4f1578f
AK
506 if (!dm_task_set_minor(*dmt, minor)) {
507 log_error("_deps: failed to set minor for (%" PRIu32 ":%" PRIu32 ")",
508 major, minor);
3d0480ed 509 goto failed;
b4f1578f 510 }
3d0480ed 511
b4f1578f
AK
512 if (!dm_task_run(*dmt)) {
513 log_error("_deps: task run failed for (%" PRIu32 ":%" PRIu32 ")",
514 major, minor);
3d0480ed 515 goto failed;
b4f1578f 516 }
3d0480ed 517
b4f1578f
AK
518 if (!dm_task_get_info(*dmt, info)) {
519 log_error("_deps: failed to get info for (%" PRIu32 ":%" PRIu32 ")",
520 major, minor);
3d0480ed 521 goto failed;
b4f1578f 522 }
3d0480ed
AK
523
524 if (!info->exists) {
525 *name = "";
526 *uuid = "";
527 *deps = NULL;
528 } else {
529 if (info->major != major) {
b4f1578f 530 log_error("Inconsistent dtree major number: %u != %u",
3d0480ed
AK
531 major, info->major);
532 goto failed;
533 }
534 if (info->minor != minor) {
b4f1578f 535 log_error("Inconsistent dtree minor number: %u != %u",
3d0480ed
AK
536 minor, info->minor);
537 goto failed;
538 }
a3f6b2ce 539 if (!(*name = dm_pool_strdup(mem, dm_task_get_name(*dmt)))) {
3d0480ed
AK
540 log_error("name pool_strdup failed");
541 goto failed;
542 }
a3f6b2ce 543 if (!(*uuid = dm_pool_strdup(mem, dm_task_get_uuid(*dmt)))) {
3d0480ed
AK
544 log_error("uuid pool_strdup failed");
545 goto failed;
546 }
547 *deps = dm_task_get_deps(*dmt);
548 }
549
550 return 1;
551
552failed:
553 dm_task_destroy(*dmt);
554 return 0;
555}
556
b4f1578f
AK
557static struct dm_tree_node *_add_dev(struct dm_tree *dtree,
558 struct dm_tree_node *parent,
cda69e17
PR
559 uint32_t major, uint32_t minor,
560 uint16_t udev_flags)
3d0480ed
AK
561{
562 struct dm_task *dmt = NULL;
563 struct dm_info info;
564 struct dm_deps *deps = NULL;
565 const char *name = NULL;
566 const char *uuid = NULL;
b4f1578f 567 struct dm_tree_node *node = NULL;
3d0480ed 568 uint32_t i;
3d0480ed
AK
569 int new = 0;
570
571 /* Already in tree? */
b4f1578f
AK
572 if (!(node = _find_dm_tree_node(dtree, major, minor))) {
573 if (!_deps(&dmt, dtree->mem, major, minor, &name, &uuid, &info, &deps))
574 return_NULL;
3d0480ed 575
f16aea9e 576 if (!(node = _create_dm_tree_node(dtree, name, uuid, &info,
cda69e17 577 NULL, udev_flags)))
b4f1578f 578 goto_out;
3d0480ed
AK
579 new = 1;
580 }
581
165e4a11
AK
582 if (!_link_tree_nodes(parent, node)) {
583 node = NULL;
b4f1578f 584 goto_out;
165e4a11 585 }
3d0480ed
AK
586
587 /* If node was already in tree, no need to recurse. */
588 if (!new)
165e4a11 589 goto out;
3d0480ed
AK
590
591 /* Can't recurse if not a mapped device or there are no dependencies */
592 if (!node->info.exists || !deps->count) {
b4f1578f
AK
593 if (!_add_to_bottomlevel(node)) {
594 stack;
165e4a11 595 node = NULL;
b4f1578f 596 }
165e4a11 597 goto out;
3d0480ed
AK
598 }
599
600 /* Add dependencies to tree */
601 for (i = 0; i < deps->count; i++)
b4f1578f 602 if (!_add_dev(dtree, node, MAJOR(deps->device[i]),
cda69e17 603 MINOR(deps->device[i]), udev_flags)) {
165e4a11 604 node = NULL;
b4f1578f 605 goto_out;
165e4a11 606 }
3d0480ed 607
3d0480ed
AK
608out:
609 if (dmt)
610 dm_task_destroy(dmt);
611
165e4a11
AK
612 return node;
613}
614
b4f1578f 615static int _node_clear_table(struct dm_tree_node *dnode)
165e4a11
AK
616{
617 struct dm_task *dmt;
618 struct dm_info *info;
619 const char *name;
620 int r;
621
622 if (!(info = &dnode->info)) {
b4f1578f 623 log_error("_node_clear_table failed: missing info");
165e4a11
AK
624 return 0;
625 }
626
b4f1578f
AK
627 if (!(name = dm_tree_node_get_name(dnode))) {
628 log_error("_node_clear_table failed: missing name");
165e4a11
AK
629 return 0;
630 }
631
632 /* Is there a table? */
633 if (!info->exists || !info->inactive_table)
634 return 1;
635
10d0d9c7
AK
636// FIXME Get inactive deps. If any dev referenced has 1 opener and no live table, remove it after the clear.
637
165e4a11
AK
638 log_verbose("Clearing inactive table %s (%" PRIu32 ":%" PRIu32 ")",
639 name, info->major, info->minor);
640
641 if (!(dmt = dm_task_create(DM_DEVICE_CLEAR))) {
165e4a11
AK
642 log_error("Table clear dm_task creation failed for %s", name);
643 return 0;
644 }
645
646 if (!dm_task_set_major(dmt, info->major) ||
647 !dm_task_set_minor(dmt, info->minor)) {
648 log_error("Failed to set device number for %s table clear", name);
649 dm_task_destroy(dmt);
650 return 0;
651 }
652
653 r = dm_task_run(dmt);
654
655 if (!dm_task_get_info(dmt, info)) {
b4f1578f 656 log_error("_node_clear_table failed: info missing after running task for %s", name);
165e4a11
AK
657 r = 0;
658 }
659
660 dm_task_destroy(dmt);
661
3d0480ed
AK
662 return r;
663}
664
b4f1578f 665struct dm_tree_node *dm_tree_add_new_dev(struct dm_tree *dtree,
165e4a11
AK
666 const char *name,
667 const char *uuid,
668 uint32_t major, uint32_t minor,
669 int read_only,
670 int clear_inactive,
671 void *context)
672{
b4f1578f 673 struct dm_tree_node *dnode;
165e4a11
AK
674 struct dm_info info;
675 const char *name2;
676 const char *uuid2;
677
678 /* Do we need to add node to tree? */
b4f1578f
AK
679 if (!(dnode = dm_tree_find_node_by_uuid(dtree, uuid))) {
680 if (!(name2 = dm_pool_strdup(dtree->mem, name))) {
165e4a11
AK
681 log_error("name pool_strdup failed");
682 return NULL;
683 }
b4f1578f 684 if (!(uuid2 = dm_pool_strdup(dtree->mem, uuid))) {
165e4a11
AK
685 log_error("uuid pool_strdup failed");
686 return NULL;
687 }
688
689 info.major = 0;
690 info.minor = 0;
691 info.exists = 0;
692 info.live_table = 0;
693 info.inactive_table = 0;
694 info.read_only = 0;
695
f16aea9e
PR
696 if (!(dnode = _create_dm_tree_node(dtree, name2, uuid2, &info,
697 context, 0)))
b4f1578f 698 return_NULL;
165e4a11
AK
699
700 /* Attach to root node until a table is supplied */
b4f1578f
AK
701 if (!_add_to_toplevel(dnode) || !_add_to_bottomlevel(dnode))
702 return_NULL;
165e4a11
AK
703
704 dnode->props.major = major;
705 dnode->props.minor = minor;
706 dnode->props.new_name = NULL;
bb875bb9 707 dnode->props.size_changed = 0;
165e4a11
AK
708 } else if (strcmp(name, dnode->name)) {
709 /* Do we need to rename node? */
b4f1578f 710 if (!(dnode->props.new_name = dm_pool_strdup(dtree->mem, name))) {
165e4a11
AK
711 log_error("name pool_strdup failed");
712 return 0;
713 }
714 }
715
716 dnode->props.read_only = read_only ? 1 : 0;
52b84409
AK
717 dnode->props.read_ahead = DM_READ_AHEAD_AUTO;
718 dnode->props.read_ahead_flags = 0;
165e4a11 719
b4f1578f
AK
720 if (clear_inactive && !_node_clear_table(dnode))
721 return_NULL;
165e4a11
AK
722
723 dnode->context = context;
f16aea9e 724 dnode->udev_flags = 0;
165e4a11
AK
725
726 return dnode;
727}
728
f16aea9e
PR
729struct dm_tree_node *dm_tree_add_new_dev_with_udev_flags(struct dm_tree *dtree,
730 const char *name,
731 const char *uuid,
732 uint32_t major,
733 uint32_t minor,
734 int read_only,
735 int clear_inactive,
736 void *context,
737 uint16_t udev_flags)
738{
739 struct dm_tree_node *node;
740
741 if ((node = dm_tree_add_new_dev(dtree, name, uuid, major, minor, read_only,
742 clear_inactive, context)))
743 node->udev_flags = udev_flags;
744
745 return node;
746}
747
748
52b84409
AK
749void dm_tree_node_set_read_ahead(struct dm_tree_node *dnode,
750 uint32_t read_ahead,
751 uint32_t read_ahead_flags)
08e64ce5 752{
52b84409
AK
753 dnode->props.read_ahead = read_ahead;
754 dnode->props.read_ahead_flags = read_ahead_flags;
755}
756
76d1aec8
ZK
757void dm_tree_node_set_presuspend_node(struct dm_tree_node *node,
758 struct dm_tree_node *presuspend_node)
759{
760 node->presuspend_node = presuspend_node;
761}
762
b4f1578f 763int dm_tree_add_dev(struct dm_tree *dtree, uint32_t major, uint32_t minor)
3d0480ed 764{
cda69e17
PR
765 return _add_dev(dtree, &dtree->root, major, minor, 0) ? 1 : 0;
766}
767
768int dm_tree_add_dev_with_udev_flags(struct dm_tree *dtree, uint32_t major,
769 uint32_t minor, uint16_t udev_flags)
770{
771 return _add_dev(dtree, &dtree->root, major, minor, udev_flags) ? 1 : 0;
3d0480ed
AK
772}
773
04bde319 774const char *dm_tree_node_get_name(const struct dm_tree_node *node)
3d0480ed
AK
775{
776 return node->info.exists ? node->name : "";
777}
778
04bde319 779const char *dm_tree_node_get_uuid(const struct dm_tree_node *node)
3d0480ed
AK
780{
781 return node->info.exists ? node->uuid : "";
782}
783
04bde319 784const struct dm_info *dm_tree_node_get_info(const struct dm_tree_node *node)
3d0480ed
AK
785{
786 return &node->info;
787}
788
04bde319 789void *dm_tree_node_get_context(const struct dm_tree_node *node)
165e4a11
AK
790{
791 return node->context;
792}
793
04bde319 794int dm_tree_node_size_changed(const struct dm_tree_node *dnode)
eb91c4ee
MB
795{
796 return dnode->props.size_changed;
797}
798
04bde319 799int dm_tree_node_num_children(const struct dm_tree_node *node, uint32_t inverted)
3d0480ed
AK
800{
801 if (inverted) {
b4f1578f 802 if (_nodes_are_linked(&node->dtree->root, node))
3d0480ed 803 return 0;
2c44337b 804 return dm_list_size(&node->used_by);
3d0480ed
AK
805 }
806
b4f1578f 807 if (_nodes_are_linked(node, &node->dtree->root))
3d0480ed
AK
808 return 0;
809
2c44337b 810 return dm_list_size(&node->uses);
3d0480ed
AK
811}
812
2b69db1f
AK
813/*
814 * Returns 1 if no prefix supplied
815 */
816static int _uuid_prefix_matches(const char *uuid, const char *uuid_prefix, size_t uuid_prefix_len)
817{
818 if (!uuid_prefix)
819 return 1;
820
821 if (!strncmp(uuid, uuid_prefix, uuid_prefix_len))
822 return 1;
823
824 /* Handle transition: active device uuids might be missing the prefix */
825 if (uuid_prefix_len <= 4)
826 return 0;
827
87f98002 828 if (!strncmp(uuid, UUID_PREFIX, sizeof(UUID_PREFIX) - 1))
872dea04
AK
829 return 0;
830
87f98002 831 if (strncmp(uuid_prefix, UUID_PREFIX, sizeof(UUID_PREFIX) - 1))
2b69db1f
AK
832 return 0;
833
87f98002 834 if (!strncmp(uuid, uuid_prefix + sizeof(UUID_PREFIX) - 1, uuid_prefix_len - (sizeof(UUID_PREFIX) - 1)))
2b69db1f
AK
835 return 1;
836
837 return 0;
838}
839
690a5da2
AK
840/*
841 * Returns 1 if no children.
842 */
b4f1578f 843static int _children_suspended(struct dm_tree_node *node,
690a5da2
AK
844 uint32_t inverted,
845 const char *uuid_prefix,
846 size_t uuid_prefix_len)
847{
2c44337b 848 struct dm_list *list;
b4f1578f 849 struct dm_tree_link *dlink;
690a5da2
AK
850 const struct dm_info *dinfo;
851 const char *uuid;
852
853 if (inverted) {
b4f1578f 854 if (_nodes_are_linked(&node->dtree->root, node))
690a5da2
AK
855 return 1;
856 list = &node->used_by;
857 } else {
b4f1578f 858 if (_nodes_are_linked(node, &node->dtree->root))
690a5da2
AK
859 return 1;
860 list = &node->uses;
861 }
862
2c44337b 863 dm_list_iterate_items(dlink, list) {
b4f1578f 864 if (!(uuid = dm_tree_node_get_uuid(dlink->node))) {
690a5da2
AK
865 stack;
866 continue;
867 }
868
869 /* Ignore if it doesn't belong to this VG */
2b69db1f 870 if (!_uuid_prefix_matches(uuid, uuid_prefix, uuid_prefix_len))
690a5da2
AK
871 continue;
872
76d1aec8
ZK
873 /* Ignore if parent node wants to presuspend this node */
874 if (dlink->node->presuspend_node == node)
875 continue;
876
b4f1578f
AK
877 if (!(dinfo = dm_tree_node_get_info(dlink->node))) {
878 stack; /* FIXME Is this normal? */
690a5da2
AK
879 return 0;
880 }
881
882 if (!dinfo->suspended)
883 return 0;
884 }
885
886 return 1;
887}
888
3d0480ed
AK
889/*
890 * Set major and minor to zero for root of tree.
891 */
b4f1578f 892struct dm_tree_node *dm_tree_find_node(struct dm_tree *dtree,
3d0480ed
AK
893 uint32_t major,
894 uint32_t minor)
895{
896 if (!major && !minor)
b4f1578f 897 return &dtree->root;
3d0480ed 898
b4f1578f 899 return _find_dm_tree_node(dtree, major, minor);
3d0480ed
AK
900}
901
165e4a11
AK
902/*
903 * Set uuid to NULL for root of tree.
904 */
b4f1578f 905struct dm_tree_node *dm_tree_find_node_by_uuid(struct dm_tree *dtree,
165e4a11
AK
906 const char *uuid)
907{
908 if (!uuid || !*uuid)
b4f1578f 909 return &dtree->root;
165e4a11 910
b4f1578f 911 return _find_dm_tree_node_by_uuid(dtree, uuid);
165e4a11
AK
912}
913
3d0480ed
AK
914/*
915 * First time set *handle to NULL.
916 * Set inverted to invert the tree.
917 */
b4f1578f 918struct dm_tree_node *dm_tree_next_child(void **handle,
04bde319
ZK
919 const struct dm_tree_node *parent,
920 uint32_t inverted)
3d0480ed 921{
2c44337b 922 struct dm_list **dlink = (struct dm_list **) handle;
04bde319 923 const struct dm_list *use_list;
3d0480ed
AK
924
925 if (inverted)
926 use_list = &parent->used_by;
927 else
928 use_list = &parent->uses;
929
930 if (!*dlink)
2c44337b 931 *dlink = dm_list_first(use_list);
3d0480ed 932 else
2c44337b 933 *dlink = dm_list_next(use_list, *dlink);
3d0480ed 934
2c44337b 935 return (*dlink) ? dm_list_item(*dlink, struct dm_tree_link)->node : NULL;
3d0480ed
AK
936}
937
3e8c6b73 938/*
a6d97ede 939 * Deactivate a device with its dependencies if the uuid prefix matches.
3e8c6b73 940 */
db208f51
AK
941static int _info_by_dev(uint32_t major, uint32_t minor, int with_open_count,
942 struct dm_info *info)
3e8c6b73
AK
943{
944 struct dm_task *dmt;
945 int r;
946
947 if (!(dmt = dm_task_create(DM_DEVICE_INFO))) {
948 log_error("_info_by_dev: dm_task creation failed");
949 return 0;
950 }
951
952 if (!dm_task_set_major(dmt, major) || !dm_task_set_minor(dmt, minor)) {
953 log_error("_info_by_dev: Failed to set device number");
954 dm_task_destroy(dmt);
955 return 0;
956 }
957
db208f51
AK
958 if (!with_open_count && !dm_task_no_open_count(dmt))
959 log_error("Failed to disable open_count");
960
3e8c6b73
AK
961 if ((r = dm_task_run(dmt)))
962 r = dm_task_get_info(dmt, info);
963
964 dm_task_destroy(dmt);
965
966 return r;
967}
968
125712be
PR
969static int _check_device_not_in_use(struct dm_info *info)
970{
971 if (!info->exists)
972 return 1;
973
974 /* If sysfs is not used, use open_count information only. */
c3e5b497
PR
975 if (!*dm_sysfs_dir()) {
976 if (info->open_count) {
977 log_error("Device %" PRIu32 ":%" PRIu32 " in use",
978 info->major, info->minor);
979 return 0;
980 }
981
982 return 1;
983 }
125712be
PR
984
985 if (dm_device_has_holders(info->major, info->minor)) {
986 log_error("Device %" PRIu32 ":%" PRIu32 " is used "
987 "by another device.", info->major, info->minor);
988 return 0;
989 }
990
991 if (dm_device_has_mounted_fs(info->major, info->minor)) {
992 log_error("Device %" PRIu32 ":%" PRIu32 " contains "
993 "a filesystem in use.", info->major, info->minor);
994 return 0;
995 }
996
997 return 1;
998}
999
f3ef15ef
ZK
1000/* Check if all parent nodes of given node have open_count == 0 */
1001static int _node_has_closed_parents(struct dm_tree_node *node,
1002 const char *uuid_prefix,
1003 size_t uuid_prefix_len)
1004{
1005 struct dm_tree_link *dlink;
1006 const struct dm_info *dinfo;
1007 struct dm_info info;
1008 const char *uuid;
1009
1010 /* Iterate through parents of this node */
1011 dm_list_iterate_items(dlink, &node->used_by) {
1012 if (!(uuid = dm_tree_node_get_uuid(dlink->node))) {
1013 stack;
1014 continue;
1015 }
1016
1017 /* Ignore if it doesn't belong to this VG */
1018 if (!_uuid_prefix_matches(uuid, uuid_prefix, uuid_prefix_len))
1019 continue;
1020
1021 if (!(dinfo = dm_tree_node_get_info(dlink->node))) {
1022 stack; /* FIXME Is this normal? */
1023 return 0;
1024 }
1025
1026 /* Refresh open_count */
1027 if (!_info_by_dev(dinfo->major, dinfo->minor, 1, &info) ||
1028 !info.exists)
1029 continue;
1030
eb418883
ZK
1031 if (info.open_count) {
1032 log_debug("Node %s %d:%d has open_count %d", uuid_prefix,
1033 dinfo->major, dinfo->minor, info.open_count);
f3ef15ef 1034 return 0;
eb418883 1035 }
f3ef15ef
ZK
1036 }
1037
1038 return 1;
1039}
1040
f16aea9e 1041static int _deactivate_node(const char *name, uint32_t major, uint32_t minor,
787200ef 1042 uint32_t *cookie, uint16_t udev_flags, int retry)
3e8c6b73
AK
1043{
1044 struct dm_task *dmt;
bd90c6b2 1045 int r = 0;
3e8c6b73
AK
1046
1047 log_verbose("Removing %s (%" PRIu32 ":%" PRIu32 ")", name, major, minor);
1048
1049 if (!(dmt = dm_task_create(DM_DEVICE_REMOVE))) {
1050 log_error("Deactivation dm_task creation failed for %s", name);
1051 return 0;
1052 }
1053
1054 if (!dm_task_set_major(dmt, major) || !dm_task_set_minor(dmt, minor)) {
1055 log_error("Failed to set device number for %s deactivation", name);
bd90c6b2 1056 goto out;
3e8c6b73
AK
1057 }
1058
1059 if (!dm_task_no_open_count(dmt))
1060 log_error("Failed to disable open_count");
1061
f16aea9e 1062 if (!dm_task_set_cookie(dmt, cookie, udev_flags))
bd90c6b2
AK
1063 goto out;
1064
787200ef
PR
1065
1066 if (retry)
1067 dm_task_retry_remove(dmt);
1068
3e8c6b73
AK
1069 r = dm_task_run(dmt);
1070
0437bccc
AK
1071 /* FIXME Until kernel returns actual name so dm-iface.c can handle it */
1072 rm_dev_node(name, dmt->cookie_set && !(udev_flags & DM_UDEV_DISABLE_DM_RULES_FLAG),
9032898e 1073 dmt->cookie_set && (udev_flags & DM_UDEV_DISABLE_LIBRARY_FALLBACK));
165e4a11 1074
db208f51
AK
1075 /* FIXME Remove node from tree or mark invalid? */
1076
bd90c6b2 1077out:
db208f51
AK
1078 dm_task_destroy(dmt);
1079
1080 return r;
1081}
1082
bd90c6b2 1083static int _rename_node(const char *old_name, const char *new_name, uint32_t major,
f16aea9e 1084 uint32_t minor, uint32_t *cookie, uint16_t udev_flags)
165e4a11
AK
1085{
1086 struct dm_task *dmt;
1087 int r = 0;
1088
1089 log_verbose("Renaming %s (%" PRIu32 ":%" PRIu32 ") to %s", old_name, major, minor, new_name);
1090
1091 if (!(dmt = dm_task_create(DM_DEVICE_RENAME))) {
1092 log_error("Rename dm_task creation failed for %s", old_name);
1093 return 0;
1094 }
1095
1096 if (!dm_task_set_name(dmt, old_name)) {
1097 log_error("Failed to set name for %s rename.", old_name);
1098 goto out;
1099 }
1100
b4f1578f 1101 if (!dm_task_set_newname(dmt, new_name))
40e5fd8b 1102 goto_out;
165e4a11
AK
1103
1104 if (!dm_task_no_open_count(dmt))
1105 log_error("Failed to disable open_count");
1106
f16aea9e 1107 if (!dm_task_set_cookie(dmt, cookie, udev_flags))
bd90c6b2
AK
1108 goto out;
1109
165e4a11
AK
1110 r = dm_task_run(dmt);
1111
1112out:
1113 dm_task_destroy(dmt);
1114
1115 return r;
1116}
1117
165e4a11
AK
1118/* FIXME Merge with _suspend_node? */
1119static int _resume_node(const char *name, uint32_t major, uint32_t minor,
52b84409 1120 uint32_t read_ahead, uint32_t read_ahead_flags,
f16aea9e 1121 struct dm_info *newinfo, uint32_t *cookie,
1840aa09 1122 uint16_t udev_flags, int already_suspended)
165e4a11
AK
1123{
1124 struct dm_task *dmt;
bd90c6b2 1125 int r = 0;
165e4a11
AK
1126
1127 log_verbose("Resuming %s (%" PRIu32 ":%" PRIu32 ")", name, major, minor);
1128
1129 if (!(dmt = dm_task_create(DM_DEVICE_RESUME))) {
1130 log_error("Suspend dm_task creation failed for %s", name);
1131 return 0;
1132 }
1133
0b7d16bc
AK
1134 /* FIXME Kernel should fill in name on return instead */
1135 if (!dm_task_set_name(dmt, name)) {
1136 log_error("Failed to set readahead device name for %s", name);
bd90c6b2 1137 goto out;
0b7d16bc
AK
1138 }
1139
165e4a11
AK
1140 if (!dm_task_set_major(dmt, major) || !dm_task_set_minor(dmt, minor)) {
1141 log_error("Failed to set device number for %s resumption.", name);
bd90c6b2 1142 goto out;
165e4a11
AK
1143 }
1144
1145 if (!dm_task_no_open_count(dmt))
1146 log_error("Failed to disable open_count");
1147
52b84409
AK
1148 if (!dm_task_set_read_ahead(dmt, read_ahead, read_ahead_flags))
1149 log_error("Failed to set read ahead");
1150
f16aea9e 1151 if (!dm_task_set_cookie(dmt, cookie, udev_flags))
bd90c6b2
AK
1152 goto out;
1153
1840aa09
AK
1154 if ((r = dm_task_run(dmt))) {
1155 if (already_suspended)
1156 dec_suspended();
165e4a11 1157 r = dm_task_get_info(dmt, newinfo);
1840aa09 1158 }
165e4a11 1159
bd90c6b2 1160out:
165e4a11
AK
1161 dm_task_destroy(dmt);
1162
1163 return r;
1164}
1165
db208f51 1166static int _suspend_node(const char *name, uint32_t major, uint32_t minor,
b9ffd32c 1167 int skip_lockfs, int no_flush, struct dm_info *newinfo)
db208f51
AK
1168{
1169 struct dm_task *dmt;
1170 int r;
1171
b9ffd32c
AK
1172 log_verbose("Suspending %s (%" PRIu32 ":%" PRIu32 ")%s%s",
1173 name, major, minor,
1174 skip_lockfs ? "" : " with filesystem sync",
6e1898a5 1175 no_flush ? "" : " with device flush");
db208f51
AK
1176
1177 if (!(dmt = dm_task_create(DM_DEVICE_SUSPEND))) {
1178 log_error("Suspend dm_task creation failed for %s", name);
1179 return 0;
1180 }
1181
1182 if (!dm_task_set_major(dmt, major) || !dm_task_set_minor(dmt, minor)) {
1183 log_error("Failed to set device number for %s suspension.", name);
1184 dm_task_destroy(dmt);
1185 return 0;
1186 }
1187
1188 if (!dm_task_no_open_count(dmt))
1189 log_error("Failed to disable open_count");
1190
c55b1410
AK
1191 if (skip_lockfs && !dm_task_skip_lockfs(dmt))
1192 log_error("Failed to set skip_lockfs flag.");
1193
b9ffd32c
AK
1194 if (no_flush && !dm_task_no_flush(dmt))
1195 log_error("Failed to set no_flush flag.");
1196
1840aa09
AK
1197 if ((r = dm_task_run(dmt))) {
1198 inc_suspended();
db208f51 1199 r = dm_task_get_info(dmt, newinfo);
1840aa09 1200 }
db208f51 1201
3e8c6b73
AK
1202 dm_task_destroy(dmt);
1203
1204 return r;
1205}
1206
18e0f934
AK
1207/*
1208 * FIXME Don't attempt to deactivate known internal dependencies.
1209 */
1210static int _dm_tree_deactivate_children(struct dm_tree_node *dnode,
1211 const char *uuid_prefix,
1212 size_t uuid_prefix_len,
1213 unsigned level)
3e8c6b73 1214{
b7eb2ad0 1215 int r = 1;
3e8c6b73 1216 void *handle = NULL;
b4f1578f 1217 struct dm_tree_node *child = dnode;
3e8c6b73
AK
1218 struct dm_info info;
1219 const struct dm_info *dinfo;
1220 const char *name;
1221 const char *uuid;
1222
b4f1578f
AK
1223 while ((child = dm_tree_next_child(&handle, dnode, 0))) {
1224 if (!(dinfo = dm_tree_node_get_info(child))) {
3e8c6b73
AK
1225 stack;
1226 continue;
1227 }
1228
b4f1578f 1229 if (!(name = dm_tree_node_get_name(child))) {
3e8c6b73
AK
1230 stack;
1231 continue;
1232 }
1233
b4f1578f 1234 if (!(uuid = dm_tree_node_get_uuid(child))) {
3e8c6b73
AK
1235 stack;
1236 continue;
1237 }
1238
1239 /* Ignore if it doesn't belong to this VG */
2b69db1f 1240 if (!_uuid_prefix_matches(uuid, uuid_prefix, uuid_prefix_len))
3e8c6b73 1241 continue;
3e8c6b73
AK
1242
1243 /* Refresh open_count */
db208f51 1244 if (!_info_by_dev(dinfo->major, dinfo->minor, 1, &info) ||
f55021f4 1245 !info.exists)
3e8c6b73
AK
1246 continue;
1247
125712be
PR
1248 if (!_check_device_not_in_use(&info))
1249 continue;
1250
f3ef15ef 1251 /* Also checking open_count in parent nodes of presuspend_node */
125712be 1252 if ((child->presuspend_node &&
f3ef15ef
ZK
1253 !_node_has_closed_parents(child->presuspend_node,
1254 uuid_prefix, uuid_prefix_len))) {
18e0f934
AK
1255 /* Only report error from (likely non-internal) dependency at top level */
1256 if (!level) {
1257 log_error("Unable to deactivate open %s (%" PRIu32
1258 ":%" PRIu32 ")", name, info.major,
1259 info.minor);
1260 r = 0;
1261 }
f55021f4
AK
1262 continue;
1263 }
1264
76d1aec8
ZK
1265 /* Suspend child node first if requested */
1266 if (child->presuspend_node &&
1267 !dm_tree_suspend_children(child, uuid_prefix, uuid_prefix_len))
1268 continue;
1269
f16aea9e 1270 if (!_deactivate_node(name, info.major, info.minor,
787200ef
PR
1271 &child->dtree->cookie, child->udev_flags,
1272 child->dtree->retry_remove)) {
3e8c6b73
AK
1273 log_error("Unable to deactivate %s (%" PRIu32
1274 ":%" PRIu32 ")", name, info.major,
1275 info.minor);
b7eb2ad0 1276 r = 0;
3e8c6b73 1277 continue;
f4249251
AK
1278 } else if (info.suspended)
1279 dec_suspended();
3e8c6b73 1280
18e0f934
AK
1281 if (dm_tree_node_num_children(child, 0)) {
1282 if (!_dm_tree_deactivate_children(child, uuid_prefix, uuid_prefix_len, level + 1))
b7eb2ad0 1283 return_0;
18e0f934 1284 }
3e8c6b73
AK
1285 }
1286
b7eb2ad0 1287 return r;
3e8c6b73 1288}
db208f51 1289
18e0f934
AK
1290int dm_tree_deactivate_children(struct dm_tree_node *dnode,
1291 const char *uuid_prefix,
1292 size_t uuid_prefix_len)
1293{
1294 return _dm_tree_deactivate_children(dnode, uuid_prefix, uuid_prefix_len, 0);
1295}
1296
c55b1410
AK
1297void dm_tree_skip_lockfs(struct dm_tree_node *dnode)
1298{
1299 dnode->dtree->skip_lockfs = 1;
1300}
1301
b9ffd32c
AK
1302void dm_tree_use_no_flush_suspend(struct dm_tree_node *dnode)
1303{
1304 dnode->dtree->no_flush = 1;
1305}
1306
787200ef
PR
1307void dm_tree_retry_remove(struct dm_tree_node *dnode)
1308{
1309 dnode->dtree->retry_remove = 1;
1310}
1311
b4f1578f 1312int dm_tree_suspend_children(struct dm_tree_node *dnode,
08e64ce5
ZK
1313 const char *uuid_prefix,
1314 size_t uuid_prefix_len)
db208f51 1315{
68085c93 1316 int r = 1;
db208f51 1317 void *handle = NULL;
b4f1578f 1318 struct dm_tree_node *child = dnode;
db208f51
AK
1319 struct dm_info info, newinfo;
1320 const struct dm_info *dinfo;
1321 const char *name;
1322 const char *uuid;
1323
690a5da2 1324 /* Suspend nodes at this level of the tree */
b4f1578f
AK
1325 while ((child = dm_tree_next_child(&handle, dnode, 0))) {
1326 if (!(dinfo = dm_tree_node_get_info(child))) {
db208f51
AK
1327 stack;
1328 continue;
1329 }
1330
b4f1578f 1331 if (!(name = dm_tree_node_get_name(child))) {
db208f51
AK
1332 stack;
1333 continue;
1334 }
1335
b4f1578f 1336 if (!(uuid = dm_tree_node_get_uuid(child))) {
db208f51
AK
1337 stack;
1338 continue;
1339 }
1340
1341 /* Ignore if it doesn't belong to this VG */
2b69db1f 1342 if (!_uuid_prefix_matches(uuid, uuid_prefix, uuid_prefix_len))
db208f51
AK
1343 continue;
1344
690a5da2
AK
1345 /* Ensure immediate parents are already suspended */
1346 if (!_children_suspended(child, 1, uuid_prefix, uuid_prefix_len))
1347 continue;
1348
db208f51 1349 if (!_info_by_dev(dinfo->major, dinfo->minor, 0, &info) ||
b700541f 1350 !info.exists || info.suspended)
db208f51
AK
1351 continue;
1352
c55b1410 1353 if (!_suspend_node(name, info.major, info.minor,
b9ffd32c
AK
1354 child->dtree->skip_lockfs,
1355 child->dtree->no_flush, &newinfo)) {
db208f51
AK
1356 log_error("Unable to suspend %s (%" PRIu32
1357 ":%" PRIu32 ")", name, info.major,
1358 info.minor);
68085c93 1359 r = 0;
db208f51
AK
1360 continue;
1361 }
1362
1363 /* Update cached info */
1364 child->info = newinfo;
690a5da2
AK
1365 }
1366
1367 /* Then suspend any child nodes */
1368 handle = NULL;
1369
b4f1578f
AK
1370 while ((child = dm_tree_next_child(&handle, dnode, 0))) {
1371 if (!(uuid = dm_tree_node_get_uuid(child))) {
690a5da2
AK
1372 stack;
1373 continue;
1374 }
1375
1376 /* Ignore if it doesn't belong to this VG */
87f98002 1377 if (!_uuid_prefix_matches(uuid, uuid_prefix, uuid_prefix_len))
690a5da2 1378 continue;
db208f51 1379
b4f1578f 1380 if (dm_tree_node_num_children(child, 0))
68085c93
MS
1381 if (!dm_tree_suspend_children(child, uuid_prefix, uuid_prefix_len))
1382 return_0;
db208f51
AK
1383 }
1384
68085c93 1385 return r;
db208f51
AK
1386}
1387
b4f1578f 1388int dm_tree_activate_children(struct dm_tree_node *dnode,
db208f51
AK
1389 const char *uuid_prefix,
1390 size_t uuid_prefix_len)
1391{
2ca6b865 1392 int r = 1;
db208f51 1393 void *handle = NULL;
b4f1578f 1394 struct dm_tree_node *child = dnode;
165e4a11
AK
1395 struct dm_info newinfo;
1396 const char *name;
db208f51 1397 const char *uuid;
56c28292 1398 int priority;
db208f51 1399
165e4a11 1400 /* Activate children first */
b4f1578f
AK
1401 while ((child = dm_tree_next_child(&handle, dnode, 0))) {
1402 if (!(uuid = dm_tree_node_get_uuid(child))) {
165e4a11
AK
1403 stack;
1404 continue;
db208f51
AK
1405 }
1406
908db078
AK
1407 if (!_uuid_prefix_matches(uuid, uuid_prefix, uuid_prefix_len))
1408 continue;
db208f51 1409
b4f1578f 1410 if (dm_tree_node_num_children(child, 0))
2ca6b865
MS
1411 if (!dm_tree_activate_children(child, uuid_prefix, uuid_prefix_len))
1412 return_0;
56c28292 1413 }
165e4a11 1414
56c28292 1415 handle = NULL;
165e4a11 1416
aa6f4e51 1417 for (priority = 0; priority < 3; priority++) {
56c28292
AK
1418 while ((child = dm_tree_next_child(&handle, dnode, 0))) {
1419 if (!(uuid = dm_tree_node_get_uuid(child))) {
1420 stack;
1421 continue;
165e4a11 1422 }
165e4a11 1423
56c28292
AK
1424 if (!_uuid_prefix_matches(uuid, uuid_prefix, uuid_prefix_len))
1425 continue;
165e4a11 1426
56c28292
AK
1427 if (priority != child->activation_priority)
1428 continue;
165e4a11 1429
56c28292
AK
1430 if (!(name = dm_tree_node_get_name(child))) {
1431 stack;
1432 continue;
1433 }
1434
1435 /* Rename? */
1436 if (child->props.new_name) {
bd90c6b2 1437 if (!_rename_node(name, child->props.new_name, child->info.major,
f16aea9e
PR
1438 child->info.minor, &child->dtree->cookie,
1439 child->udev_flags)) {
56c28292
AK
1440 log_error("Failed to rename %s (%" PRIu32
1441 ":%" PRIu32 ") to %s", name, child->info.major,
1442 child->info.minor, child->props.new_name);
1443 return 0;
1444 }
1445 child->name = child->props.new_name;
1446 child->props.new_name = NULL;
1447 }
1448
1449 if (!child->info.inactive_table && !child->info.suspended)
1450 continue;
1451
bafa2f39 1452 if (!_resume_node(child->name, child->info.major, child->info.minor,
bd90c6b2 1453 child->props.read_ahead, child->props.read_ahead_flags,
1840aa09 1454 &newinfo, &child->dtree->cookie, child->udev_flags, child->info.suspended)) {
56c28292 1455 log_error("Unable to resume %s (%" PRIu32
bafa2f39 1456 ":%" PRIu32 ")", child->name, child->info.major,
56c28292 1457 child->info.minor);
2ca6b865 1458 r = 0;
56c28292
AK
1459 continue;
1460 }
1461
1462 /* Update cached info */
1463 child->info = newinfo;
1464 }
db208f51
AK
1465 }
1466
165e4a11
AK
1467 handle = NULL;
1468
2ca6b865 1469 return r;
165e4a11
AK
1470}
1471
b4f1578f 1472static int _create_node(struct dm_tree_node *dnode)
165e4a11
AK
1473{
1474 int r = 0;
1475 struct dm_task *dmt;
1476
1477 log_verbose("Creating %s", dnode->name);
1478
1479 if (!(dmt = dm_task_create(DM_DEVICE_CREATE))) {
1480 log_error("Create dm_task creation failed for %s", dnode->name);
1481 return 0;
1482 }
1483
1484 if (!dm_task_set_name(dmt, dnode->name)) {
1485 log_error("Failed to set device name for %s", dnode->name);
1486 goto out;
1487 }
1488
1489 if (!dm_task_set_uuid(dmt, dnode->uuid)) {
1490 log_error("Failed to set uuid for %s", dnode->name);
1491 goto out;
1492 }
1493
1494 if (dnode->props.major &&
1495 (!dm_task_set_major(dmt, dnode->props.major) ||
1496 !dm_task_set_minor(dmt, dnode->props.minor))) {
1497 log_error("Failed to set device number for %s creation.", dnode->name);
1498 goto out;
1499 }
1500
1501 if (dnode->props.read_only && !dm_task_set_ro(dmt)) {
1502 log_error("Failed to set read only flag for %s", dnode->name);
1503 goto out;
1504 }
1505
1506 if (!dm_task_no_open_count(dmt))
1507 log_error("Failed to disable open_count");
1508
1509 if ((r = dm_task_run(dmt)))
1510 r = dm_task_get_info(dmt, &dnode->info);
1511
1512out:
1513 dm_task_destroy(dmt);
1514
1515 return r;
1516}
1517
1518
b4f1578f 1519static int _build_dev_string(char *devbuf, size_t bufsize, struct dm_tree_node *node)
165e4a11
AK
1520{
1521 if (!dm_format_dev(devbuf, bufsize, node->info.major, node->info.minor)) {
40e5fd8b
AK
1522 log_error("Failed to format %s device number for %s as dm "
1523 "target (%u,%u)",
1524 node->name, node->uuid, node->info.major, node->info.minor);
1525 return 0;
165e4a11
AK
1526 }
1527
1528 return 1;
1529}
1530
ffa9b6a5
ZK
1531/* simplify string emiting code */
1532#define EMIT_PARAMS(p, str...)\
7b6c011c
AK
1533do {\
1534 int w;\
1535 if ((w = dm_snprintf(params + p, paramsize - (size_t) p, str)) < 0) {\
1536 stack; /* Out of space */\
1537 return -1;\
1538 }\
1539 p += w;\
1540} while (0)
ffa9b6a5 1541
3c74075f
JEB
1542/*
1543 * _emit_areas_line
1544 *
1545 * Returns: 1 on success, 0 on failure
1546 */
08f1ddea 1547static int _emit_areas_line(struct dm_task *dmt __attribute__((unused)),
4dcaa230
AK
1548 struct load_segment *seg, char *params,
1549 size_t paramsize, int *pos)
165e4a11
AK
1550{
1551 struct seg_area *area;
7d7d93ac 1552 char devbuf[DM_FORMAT_DEV_BUFSIZE];
609faae9 1553 unsigned first_time = 1;
db3c1ac1 1554 const char *logtype, *synctype;
b262f3e1 1555 unsigned log_parm_count;
165e4a11 1556
2c44337b 1557 dm_list_iterate_items(area, &seg->areas) {
b262f3e1
ZK
1558 switch (seg->type) {
1559 case SEG_REPLICATOR_DEV:
6d04311e
JEB
1560 if (!_build_dev_string(devbuf, sizeof(devbuf), area->dev_node))
1561 return_0;
1562
b262f3e1
ZK
1563 EMIT_PARAMS(*pos, " %d 1 %s", area->rsite_index, devbuf);
1564 if (first_time)
1565 EMIT_PARAMS(*pos, " nolog 0");
1566 else {
1567 /* Remote devices */
1568 log_parm_count = (area->flags &
1569 (DM_NOSYNC | DM_FORCESYNC)) ? 2 : 1;
1570
1571 if (!area->slog) {
1572 devbuf[0] = 0; /* Only core log parameters */
1573 logtype = "core";
1574 } else {
1575 devbuf[0] = ' '; /* Extra space before device name */
1576 if (!_build_dev_string(devbuf + 1,
1577 sizeof(devbuf) - 1,
1578 area->slog))
1579 return_0;
1580 logtype = "disk";
1581 log_parm_count++; /* Extra sync log device name parameter */
1582 }
1583
1584 EMIT_PARAMS(*pos, " %s %u%s %" PRIu64, logtype,
1585 log_parm_count, devbuf, area->region_size);
1586
db3c1ac1
AK
1587 synctype = (area->flags & DM_NOSYNC) ?
1588 " nosync" : (area->flags & DM_FORCESYNC) ?
1589 " sync" : NULL;
b262f3e1 1590
db3c1ac1
AK
1591 if (synctype)
1592 EMIT_PARAMS(*pos, "%s", synctype);
b262f3e1
ZK
1593 }
1594 break;
cac52ca4
JEB
1595 case SEG_RAID1:
1596 case SEG_RAID4:
1597 case SEG_RAID5_LA:
1598 case SEG_RAID5_RA:
1599 case SEG_RAID5_LS:
1600 case SEG_RAID5_RS:
1601 case SEG_RAID6_ZR:
1602 case SEG_RAID6_NR:
1603 case SEG_RAID6_NC:
6d04311e
JEB
1604 if (!area->dev_node) {
1605 EMIT_PARAMS(*pos, " -");
1606 break;
1607 }
1608 if (!_build_dev_string(devbuf, sizeof(devbuf), area->dev_node))
1609 return_0;
1610
cac52ca4
JEB
1611 EMIT_PARAMS(*pos, " %s", devbuf);
1612 break;
b262f3e1 1613 default:
6d04311e
JEB
1614 if (!_build_dev_string(devbuf, sizeof(devbuf), area->dev_node))
1615 return_0;
1616
b262f3e1
ZK
1617 EMIT_PARAMS(*pos, "%s%s %" PRIu64, first_time ? "" : " ",
1618 devbuf, area->offset);
1619 }
609faae9
AK
1620
1621 first_time = 0;
165e4a11
AK
1622 }
1623
1624 return 1;
1625}
1626
b262f3e1
ZK
1627static int _replicator_emit_segment_line(const struct load_segment *seg, char *params,
1628 size_t paramsize, int *pos)
1629{
1630 const struct load_segment *rlog_seg;
1631 struct replicator_site *rsite;
1632 char rlogbuf[DM_FORMAT_DEV_BUFSIZE];
1633 unsigned parm_count;
1634
1635 if (!seg->log || !_build_dev_string(rlogbuf, sizeof(rlogbuf), seg->log))
1636 return_0;
1637
1638 rlog_seg = dm_list_item(dm_list_last(&seg->log->props.segs),
1639 struct load_segment);
1640
1641 EMIT_PARAMS(*pos, "%s 4 %s 0 auto %" PRIu64,
1642 seg->rlog_type, rlogbuf, rlog_seg->size);
1643
1644 dm_list_iterate_items(rsite, &seg->rsites) {
1645 parm_count = (rsite->fall_behind_data
1646 || rsite->fall_behind_ios
1647 || rsite->async_timeout) ? 4 : 2;
1648
1649 EMIT_PARAMS(*pos, " blockdev %u %u %s", parm_count, rsite->rsite_index,
1650 (rsite->mode == DM_REPLICATOR_SYNC) ? "synchronous" : "asynchronous");
1651
1652 if (rsite->fall_behind_data)
1653 EMIT_PARAMS(*pos, " data %" PRIu64, rsite->fall_behind_data);
1654 else if (rsite->fall_behind_ios)
1655 EMIT_PARAMS(*pos, " ios %" PRIu32, rsite->fall_behind_ios);
1656 else if (rsite->async_timeout)
1657 EMIT_PARAMS(*pos, " timeout %" PRIu32, rsite->async_timeout);
1658 }
1659
1660 return 1;
1661}
1662
3c74075f 1663/*
3c74075f
JEB
1664 * Returns: 1 on success, 0 on failure
1665 */
beecb1e1
ZK
1666static int _mirror_emit_segment_line(struct dm_task *dmt, struct load_segment *seg,
1667 char *params, size_t paramsize)
165e4a11 1668{
8f26e18c
JEB
1669 int block_on_error = 0;
1670 int handle_errors = 0;
1671 int dm_log_userspace = 0;
1672 struct utsname uts;
dbcb64b8 1673 unsigned log_parm_count;
b39fdcf4 1674 int pos = 0, parts;
7d7d93ac 1675 char logbuf[DM_FORMAT_DEV_BUFSIZE];
dbcb64b8 1676 const char *logtype;
b39fdcf4 1677 unsigned kmaj = 0, kmin = 0, krel = 0;
165e4a11 1678
b39fdcf4
MB
1679 if (uname(&uts) == -1) {
1680 log_error("Cannot read kernel release version.");
1681 return 0;
1682 }
1683
1684 /* Kernels with a major number of 2 always had 3 parts. */
1685 parts = sscanf(uts.release, "%u.%u.%u", &kmaj, &kmin, &krel);
1686 if (parts < 1 || (kmaj < 3 && parts < 3)) {
1687 log_error("Wrong kernel release version %s.", uts.release);
30a65310
ZK
1688 return 0;
1689 }
67b25ed4 1690
8f26e18c
JEB
1691 if ((seg->flags & DM_BLOCK_ON_ERROR)) {
1692 /*
1693 * Originally, block_on_error was an argument to the log
1694 * portion of the mirror CTR table. It was renamed to
1695 * "handle_errors" and now resides in the 'features'
1696 * section of the mirror CTR table (i.e. at the end).
1697 *
1698 * We can identify whether to use "block_on_error" or
1699 * "handle_errors" by the dm-mirror module's version
1700 * number (>= 1.12) or by the kernel version (>= 2.6.22).
1701 */
ba61f848 1702 if (KERNEL_VERSION(kmaj, kmin, krel) >= KERNEL_VERSION(2, 6, 22))
8f26e18c
JEB
1703 handle_errors = 1;
1704 else
1705 block_on_error = 1;
1706 }
1707
1708 if (seg->clustered) {
1709 /* Cluster mirrors require a UUID */
1710 if (!seg->uuid)
1711 return_0;
1712
1713 /*
1714 * Cluster mirrors used to have their own log
1715 * types. Now they are accessed through the
1716 * userspace log type.
1717 *
1718 * The dm-log-userspace module was added to the
1719 * 2.6.31 kernel.
1720 */
ba61f848 1721 if (KERNEL_VERSION(kmaj, kmin, krel) >= KERNEL_VERSION(2, 6, 31))
8f26e18c
JEB
1722 dm_log_userspace = 1;
1723 }
1724
1725 /* Region size */
1726 log_parm_count = 1;
1727
1728 /* [no]sync, block_on_error etc. */
1729 log_parm_count += hweight32(seg->flags);
311d6d81 1730
8f26e18c
JEB
1731 /* "handle_errors" is a feature arg now */
1732 if (handle_errors)
1733 log_parm_count--;
1734
1735 /* DM_CORELOG does not count in the param list */
1736 if (seg->flags & DM_CORELOG)
1737 log_parm_count--;
1738
1739 if (seg->clustered) {
1740 log_parm_count++; /* For UUID */
1741
1742 if (!dm_log_userspace)
ffa9b6a5 1743 EMIT_PARAMS(pos, "clustered-");
49b95a5e
JEB
1744 else
1745 /* For clustered-* type field inserted later */
1746 log_parm_count++;
8f26e18c 1747 }
dbcb64b8 1748
8f26e18c
JEB
1749 if (!seg->log)
1750 logtype = "core";
1751 else {
1752 logtype = "disk";
1753 log_parm_count++;
1754 if (!_build_dev_string(logbuf, sizeof(logbuf), seg->log))
1755 return_0;
1756 }
dbcb64b8 1757
8f26e18c
JEB
1758 if (dm_log_userspace)
1759 EMIT_PARAMS(pos, "userspace %u %s clustered-%s",
1760 log_parm_count, seg->uuid, logtype);
1761 else
ffa9b6a5 1762 EMIT_PARAMS(pos, "%s %u", logtype, log_parm_count);
dbcb64b8 1763
8f26e18c
JEB
1764 if (seg->log)
1765 EMIT_PARAMS(pos, " %s", logbuf);
1766
1767 EMIT_PARAMS(pos, " %u", seg->region_size);
dbcb64b8 1768
8f26e18c
JEB
1769 if (seg->clustered && !dm_log_userspace)
1770 EMIT_PARAMS(pos, " %s", seg->uuid);
67b25ed4 1771
8f26e18c
JEB
1772 if ((seg->flags & DM_NOSYNC))
1773 EMIT_PARAMS(pos, " nosync");
1774 else if ((seg->flags & DM_FORCESYNC))
1775 EMIT_PARAMS(pos, " sync");
dbcb64b8 1776
8f26e18c
JEB
1777 if (block_on_error)
1778 EMIT_PARAMS(pos, " block_on_error");
1779
1780 EMIT_PARAMS(pos, " %u ", seg->mirror_area_count);
1781
5f3325fc 1782 if (_emit_areas_line(dmt, seg, params, paramsize, &pos) <= 0)
3c74075f 1783 return_0;
dbcb64b8 1784
8f26e18c
JEB
1785 if (handle_errors)
1786 EMIT_PARAMS(pos, " 1 handle_errors");
ffa9b6a5 1787
3c74075f 1788 return 1;
8f26e18c
JEB
1789}
1790
cac52ca4
JEB
1791static int _raid_emit_segment_line(struct dm_task *dmt, uint32_t major,
1792 uint32_t minor, struct load_segment *seg,
1793 uint64_t *seg_start, char *params,
1794 size_t paramsize)
1795{
f439e65b 1796 uint32_t i, *tmp;
cac52ca4
JEB
1797 int param_count = 1; /* mandatory 'chunk size'/'stripe size' arg */
1798 int pos = 0;
1799
1800 if ((seg->flags & DM_NOSYNC) || (seg->flags & DM_FORCESYNC))
1801 param_count++;
1802
1803 if (seg->region_size)
1804 param_count += 2;
1805
f439e65b
JEB
1806 tmp = (uint32_t *)(&seg->rebuilds); /* rebuilds is 64-bit */
1807 param_count += 2 * hweight32(tmp[0]);
1808 param_count += 2 * hweight32(tmp[1]);
1809
cac52ca4
JEB
1810 if ((seg->type == SEG_RAID1) && seg->stripe_size)
1811 log_error("WARNING: Ignoring RAID1 stripe size");
1812
1813 EMIT_PARAMS(pos, "%s %d %u", dm_segtypes[seg->type].target,
1814 param_count, seg->stripe_size);
1815
1816 if (seg->flags & DM_NOSYNC)
1817 EMIT_PARAMS(pos, " nosync");
1818 else if (seg->flags & DM_FORCESYNC)
1819 EMIT_PARAMS(pos, " sync");
1820
1821 if (seg->region_size)
1822 EMIT_PARAMS(pos, " region_size %u", seg->region_size);
1823
f439e65b
JEB
1824 for (i = 0; i < (seg->area_count / 2); i++)
1825 if (seg->rebuilds & (1 << i))
1826 EMIT_PARAMS(pos, " rebuild %u", i);
1827
cac52ca4
JEB
1828 /* Print number of metadata/data device pairs */
1829 EMIT_PARAMS(pos, " %u", seg->area_count/2);
1830
1831 if (_emit_areas_line(dmt, seg, params, paramsize, &pos) <= 0)
1832 return_0;
1833
1834 return 1;
1835}
1836
8f26e18c
JEB
1837static int _emit_segment_line(struct dm_task *dmt, uint32_t major,
1838 uint32_t minor, struct load_segment *seg,
1839 uint64_t *seg_start, char *params,
1840 size_t paramsize)
1841{
1842 int pos = 0;
1843 int r;
cac52ca4 1844 int target_type_is_raid = 0;
8f26e18c 1845 char originbuf[DM_FORMAT_DEV_BUFSIZE], cowbuf[DM_FORMAT_DEV_BUFSIZE];
4251236e 1846 char pool[DM_FORMAT_DEV_BUFSIZE], metadata[DM_FORMAT_DEV_BUFSIZE];
dbcb64b8 1847
8f26e18c
JEB
1848 switch(seg->type) {
1849 case SEG_ERROR:
1850 case SEG_ZERO:
1851 case SEG_LINEAR:
1852 break;
1853 case SEG_MIRRORED:
1854 /* Mirrors are pretty complicated - now in separate function */
beecb1e1 1855 r = _mirror_emit_segment_line(dmt, seg, params, paramsize);
3c74075f
JEB
1856 if (!r)
1857 return_0;
165e4a11 1858 break;
b262f3e1
ZK
1859 case SEG_REPLICATOR:
1860 if ((r = _replicator_emit_segment_line(seg, params, paramsize,
1861 &pos)) <= 0) {
1862 stack;
1863 return r;
1864 }
1865 break;
1866 case SEG_REPLICATOR_DEV:
1867 if (!seg->replicator || !_build_dev_string(originbuf,
1868 sizeof(originbuf),
1869 seg->replicator))
1870 return_0;
1871
1872 EMIT_PARAMS(pos, "%s %" PRIu64, originbuf, seg->rdevice_index);
1873 break;
165e4a11 1874 case SEG_SNAPSHOT:
aa6f4e51 1875 case SEG_SNAPSHOT_MERGE:
b4f1578f
AK
1876 if (!_build_dev_string(originbuf, sizeof(originbuf), seg->origin))
1877 return_0;
1878 if (!_build_dev_string(cowbuf, sizeof(cowbuf), seg->cow))
1879 return_0;
ffa9b6a5
ZK
1880 EMIT_PARAMS(pos, "%s %s %c %d", originbuf, cowbuf,
1881 seg->persistent ? 'P' : 'N', seg->chunk_size);
165e4a11
AK
1882 break;
1883 case SEG_SNAPSHOT_ORIGIN:
b4f1578f
AK
1884 if (!_build_dev_string(originbuf, sizeof(originbuf), seg->origin))
1885 return_0;
ffa9b6a5 1886 EMIT_PARAMS(pos, "%s", originbuf);
165e4a11
AK
1887 break;
1888 case SEG_STRIPED:
609faae9 1889 EMIT_PARAMS(pos, "%u %u ", seg->area_count, seg->stripe_size);
165e4a11 1890 break;
12ca060e 1891 case SEG_CRYPT:
609faae9 1892 EMIT_PARAMS(pos, "%s%s%s%s%s %s %" PRIu64 " ", seg->cipher,
12ca060e
MB
1893 seg->chainmode ? "-" : "", seg->chainmode ?: "",
1894 seg->iv ? "-" : "", seg->iv ?: "", seg->key,
1895 seg->iv_offset != DM_CRYPT_IV_DEFAULT ?
1896 seg->iv_offset : *seg_start);
1897 break;
cac52ca4
JEB
1898 case SEG_RAID1:
1899 case SEG_RAID4:
1900 case SEG_RAID5_LA:
1901 case SEG_RAID5_RA:
1902 case SEG_RAID5_LS:
1903 case SEG_RAID5_RS:
1904 case SEG_RAID6_ZR:
1905 case SEG_RAID6_NR:
1906 case SEG_RAID6_NC:
1907 target_type_is_raid = 1;
1908 r = _raid_emit_segment_line(dmt, major, minor, seg, seg_start,
1909 params, paramsize);
1910 if (!r)
1911 return_0;
1912
1913 break;
4251236e
ZK
1914 case SEG_THIN_POOL:
1915 if (!_build_dev_string(metadata, sizeof(metadata), seg->metadata))
1916 return_0;
1917 if (!_build_dev_string(pool, sizeof(pool), seg->pool))
1918 return_0;
1919 EMIT_PARAMS(pos, "%s %s %d %" PRIu64 " %s", metadata, pool,
1920 seg->data_block_size, seg->low_water_mark,
1921 seg->skip_block_zeroeing ? "1 skip_block_zeroing" : "");
1922 break;
1923 case SEG_THIN:
1924 if (!_build_dev_string(pool, sizeof(pool), seg->pool))
1925 return_0;
1926 EMIT_PARAMS(pos, "%s %d", pool, seg->device_id);
1927 break;
165e4a11
AK
1928 }
1929
1930 switch(seg->type) {
1931 case SEG_ERROR:
b262f3e1 1932 case SEG_REPLICATOR:
165e4a11
AK
1933 case SEG_SNAPSHOT:
1934 case SEG_SNAPSHOT_ORIGIN:
aa6f4e51 1935 case SEG_SNAPSHOT_MERGE:
165e4a11 1936 case SEG_ZERO:
4251236e
ZK
1937 case SEG_THIN_POOL:
1938 case SEG_THIN:
165e4a11 1939 break;
12ca060e 1940 case SEG_CRYPT:
165e4a11 1941 case SEG_LINEAR:
b262f3e1 1942 case SEG_REPLICATOR_DEV:
165e4a11
AK
1943 case SEG_STRIPED:
1944 if ((r = _emit_areas_line(dmt, seg, params, paramsize, &pos)) <= 0) {
1945 stack;
1946 return r;
1947 }
b6793963
AK
1948 if (!params[0]) {
1949 log_error("No parameters supplied for %s target "
1950 "%u:%u.", dm_segtypes[seg->type].target,
812e10ac 1951 major, minor);
b6793963
AK
1952 return 0;
1953 }
165e4a11
AK
1954 break;
1955 }
1956
4b2cae46
AK
1957 log_debug("Adding target to (%" PRIu32 ":%" PRIu32 "): %" PRIu64
1958 " %" PRIu64 " %s %s", major, minor,
f439e65b
JEB
1959 *seg_start, seg->size, target_type_is_raid ? "raid" :
1960 dm_segtypes[seg->type].target, params);
165e4a11 1961
cac52ca4
JEB
1962 if (!dm_task_add_target(dmt, *seg_start, seg->size,
1963 target_type_is_raid ? "raid" :
1964 dm_segtypes[seg->type].target, params))
b4f1578f 1965 return_0;
165e4a11
AK
1966
1967 *seg_start += seg->size;
1968
1969 return 1;
1970}
1971
ffa9b6a5
ZK
1972#undef EMIT_PARAMS
1973
4b2cae46
AK
1974static int _emit_segment(struct dm_task *dmt, uint32_t major, uint32_t minor,
1975 struct load_segment *seg, uint64_t *seg_start)
165e4a11
AK
1976{
1977 char *params;
1978 size_t paramsize = 4096;
1979 int ret;
1980
1981 do {
1982 if (!(params = dm_malloc(paramsize))) {
1983 log_error("Insufficient space for target parameters.");
1984 return 0;
1985 }
1986
12ea7cb1 1987 params[0] = '\0';
4b2cae46
AK
1988 ret = _emit_segment_line(dmt, major, minor, seg, seg_start,
1989 params, paramsize);
165e4a11
AK
1990 dm_free(params);
1991
1992 if (!ret)
1993 stack;
1994
1995 if (ret >= 0)
1996 return ret;
1997
1998 log_debug("Insufficient space in params[%" PRIsize_t
1999 "] for target parameters.", paramsize);
2000
2001 paramsize *= 2;
2002 } while (paramsize < MAX_TARGET_PARAMSIZE);
2003
2004 log_error("Target parameter size too big. Aborting.");
2005 return 0;
2006}
2007
b4f1578f 2008static int _load_node(struct dm_tree_node *dnode)
165e4a11
AK
2009{
2010 int r = 0;
2011 struct dm_task *dmt;
2012 struct load_segment *seg;
df390f17 2013 uint64_t seg_start = 0, existing_table_size;
165e4a11 2014
4b2cae46
AK
2015 log_verbose("Loading %s table (%" PRIu32 ":%" PRIu32 ")", dnode->name,
2016 dnode->info.major, dnode->info.minor);
165e4a11
AK
2017
2018 if (!(dmt = dm_task_create(DM_DEVICE_RELOAD))) {
2019 log_error("Reload dm_task creation failed for %s", dnode->name);
2020 return 0;
2021 }
2022
2023 if (!dm_task_set_major(dmt, dnode->info.major) ||
2024 !dm_task_set_minor(dmt, dnode->info.minor)) {
2025 log_error("Failed to set device number for %s reload.", dnode->name);
2026 goto out;
2027 }
2028
2029 if (dnode->props.read_only && !dm_task_set_ro(dmt)) {
2030 log_error("Failed to set read only flag for %s", dnode->name);
2031 goto out;
2032 }
2033
2034 if (!dm_task_no_open_count(dmt))
2035 log_error("Failed to disable open_count");
2036
2c44337b 2037 dm_list_iterate_items(seg, &dnode->props.segs)
4b2cae46
AK
2038 if (!_emit_segment(dmt, dnode->info.major, dnode->info.minor,
2039 seg, &seg_start))
b4f1578f 2040 goto_out;
165e4a11 2041
ec289b64
AK
2042 if (!dm_task_suppress_identical_reload(dmt))
2043 log_error("Failed to suppress reload of identical tables.");
2044
2045 if ((r = dm_task_run(dmt))) {
165e4a11 2046 r = dm_task_get_info(dmt, &dnode->info);
ec289b64
AK
2047 if (r && !dnode->info.inactive_table)
2048 log_verbose("Suppressed %s identical table reload.",
2049 dnode->name);
bb875bb9 2050
df390f17 2051 existing_table_size = dm_task_get_existing_table_size(dmt);
bb875bb9 2052 if ((dnode->props.size_changed =
df390f17 2053 (existing_table_size == seg_start) ? 0 : 1)) {
bb875bb9 2054 log_debug("Table size changed from %" PRIu64 " to %"
df390f17 2055 PRIu64 " for %s", existing_table_size,
bb875bb9 2056 seg_start, dnode->name);
df390f17
AK
2057 /*
2058 * Kernel usually skips size validation on zero-length devices
2059 * now so no need to preload them.
2060 */
2061 /* FIXME In which kernel version did this begin? */
2062 if (!existing_table_size && dnode->props.delay_resume_if_new)
2063 dnode->props.size_changed = 0;
2064 }
ec289b64 2065 }
165e4a11
AK
2066
2067 dnode->props.segment_count = 0;
2068
2069out:
2070 dm_task_destroy(dmt);
2071
2072 return r;
165e4a11
AK
2073}
2074
b4f1578f 2075int dm_tree_preload_children(struct dm_tree_node *dnode,
bb875bb9
AK
2076 const char *uuid_prefix,
2077 size_t uuid_prefix_len)
165e4a11 2078{
2ca6b865 2079 int r = 1;
165e4a11 2080 void *handle = NULL;
b4f1578f 2081 struct dm_tree_node *child;
165e4a11 2082 struct dm_info newinfo;
566515c0 2083 int update_devs_flag = 0;
165e4a11
AK
2084
2085 /* Preload children first */
b4f1578f 2086 while ((child = dm_tree_next_child(&handle, dnode, 0))) {
165e4a11
AK
2087 /* Skip existing non-device-mapper devices */
2088 if (!child->info.exists && child->info.major)
2089 continue;
2090
2091 /* Ignore if it doesn't belong to this VG */
87f98002
AK
2092 if (child->info.exists &&
2093 !_uuid_prefix_matches(child->uuid, uuid_prefix, uuid_prefix_len))
165e4a11
AK
2094 continue;
2095
b4f1578f 2096 if (dm_tree_node_num_children(child, 0))
2ca6b865
MS
2097 if (!dm_tree_preload_children(child, uuid_prefix, uuid_prefix_len))
2098 return_0;
165e4a11 2099
165e4a11
AK
2100 /* FIXME Cope if name exists with no uuid? */
2101 if (!child->info.exists) {
2102 if (!_create_node(child)) {
2103 stack;
2104 return 0;
2105 }
2106 }
2107
2108 if (!child->info.inactive_table && child->props.segment_count) {
2109 if (!_load_node(child)) {
2110 stack;
2111 return 0;
2112 }
2113 }
2114
eb91c4ee
MB
2115 /* Propagate device size change change */
2116 if (child->props.size_changed)
2117 dnode->props.size_changed = 1;
2118
bb875bb9 2119 /* Resume device immediately if it has parents and its size changed */
3776c494 2120 if (!dm_tree_node_num_children(child, 1) || !child->props.size_changed)
165e4a11
AK
2121 continue;
2122
7707ea90
AK
2123 if (!child->info.inactive_table && !child->info.suspended)
2124 continue;
2125
fc795d87 2126 if (!_resume_node(child->name, child->info.major, child->info.minor,
bd90c6b2 2127 child->props.read_ahead, child->props.read_ahead_flags,
1840aa09
AK
2128 &newinfo, &child->dtree->cookie, child->udev_flags,
2129 child->info.suspended)) {
165e4a11 2130 log_error("Unable to resume %s (%" PRIu32
fc795d87 2131 ":%" PRIu32 ")", child->name, child->info.major,
165e4a11 2132 child->info.minor);
2ca6b865 2133 r = 0;
165e4a11
AK
2134 continue;
2135 }
2136
2137 /* Update cached info */
2138 child->info = newinfo;
566515c0
PR
2139
2140 /*
2141 * Prepare for immediate synchronization with udev and flush all stacked
2142 * dev node operations if requested by immediate_dev_node property. But
2143 * finish processing current level in the tree first.
2144 */
2145 if (child->props.immediate_dev_node)
2146 update_devs_flag = 1;
2147
165e4a11
AK
2148 }
2149
2150 handle = NULL;
2151
566515c0
PR
2152 if (update_devs_flag) {
2153 if (!dm_udev_wait(dm_tree_get_cookie(dnode)))
2154 stack;
2155 dm_tree_set_cookie(dnode, 0);
566515c0
PR
2156 }
2157
2ca6b865 2158 return r;
165e4a11
AK
2159}
2160
165e4a11
AK
2161/*
2162 * Returns 1 if unsure.
2163 */
b4f1578f 2164int dm_tree_children_use_uuid(struct dm_tree_node *dnode,
165e4a11
AK
2165 const char *uuid_prefix,
2166 size_t uuid_prefix_len)
2167{
2168 void *handle = NULL;
b4f1578f 2169 struct dm_tree_node *child = dnode;
165e4a11
AK
2170 const char *uuid;
2171
b4f1578f
AK
2172 while ((child = dm_tree_next_child(&handle, dnode, 0))) {
2173 if (!(uuid = dm_tree_node_get_uuid(child))) {
2174 log_error("Failed to get uuid for dtree node.");
165e4a11
AK
2175 return 1;
2176 }
2177
87f98002 2178 if (_uuid_prefix_matches(uuid, uuid_prefix, uuid_prefix_len))
165e4a11
AK
2179 return 1;
2180
b4f1578f
AK
2181 if (dm_tree_node_num_children(child, 0))
2182 dm_tree_children_use_uuid(child, uuid_prefix, uuid_prefix_len);
165e4a11
AK
2183 }
2184
2185 return 0;
2186}
2187
2188/*
2189 * Target functions
2190 */
b4f1578f 2191static struct load_segment *_add_segment(struct dm_tree_node *dnode, unsigned type, uint64_t size)
165e4a11
AK
2192{
2193 struct load_segment *seg;
2194
b4f1578f
AK
2195 if (!(seg = dm_pool_zalloc(dnode->dtree->mem, sizeof(*seg)))) {
2196 log_error("dtree node segment allocation failed");
165e4a11
AK
2197 return NULL;
2198 }
2199
2200 seg->type = type;
2201 seg->size = size;
2202 seg->area_count = 0;
2c44337b 2203 dm_list_init(&seg->areas);
165e4a11
AK
2204 seg->stripe_size = 0;
2205 seg->persistent = 0;
2206 seg->chunk_size = 0;
2207 seg->cow = NULL;
2208 seg->origin = NULL;
aa6f4e51 2209 seg->merge = NULL;
165e4a11 2210
2c44337b 2211 dm_list_add(&dnode->props.segs, &seg->list);
165e4a11
AK
2212 dnode->props.segment_count++;
2213
2214 return seg;
2215}
2216
b4f1578f 2217int dm_tree_node_add_snapshot_origin_target(struct dm_tree_node *dnode,
40e5fd8b
AK
2218 uint64_t size,
2219 const char *origin_uuid)
165e4a11
AK
2220{
2221 struct load_segment *seg;
b4f1578f 2222 struct dm_tree_node *origin_node;
165e4a11 2223
b4f1578f
AK
2224 if (!(seg = _add_segment(dnode, SEG_SNAPSHOT_ORIGIN, size)))
2225 return_0;
165e4a11 2226
b4f1578f 2227 if (!(origin_node = dm_tree_find_node_by_uuid(dnode->dtree, origin_uuid))) {
165e4a11
AK
2228 log_error("Couldn't find snapshot origin uuid %s.", origin_uuid);
2229 return 0;
2230 }
2231
2232 seg->origin = origin_node;
b4f1578f
AK
2233 if (!_link_tree_nodes(dnode, origin_node))
2234 return_0;
165e4a11 2235
56c28292
AK
2236 /* Resume snapshot origins after new snapshots */
2237 dnode->activation_priority = 1;
2238
165e4a11
AK
2239 return 1;
2240}
2241
aa6f4e51
MS
2242static int _add_snapshot_target(struct dm_tree_node *node,
2243 uint64_t size,
2244 const char *origin_uuid,
2245 const char *cow_uuid,
2246 const char *merge_uuid,
2247 int persistent,
2248 uint32_t chunk_size)
165e4a11
AK
2249{
2250 struct load_segment *seg;
aa6f4e51
MS
2251 struct dm_tree_node *origin_node, *cow_node, *merge_node;
2252 unsigned seg_type;
2253
2254 seg_type = !merge_uuid ? SEG_SNAPSHOT : SEG_SNAPSHOT_MERGE;
165e4a11 2255
aa6f4e51 2256 if (!(seg = _add_segment(node, seg_type, size)))
b4f1578f 2257 return_0;
165e4a11 2258
b4f1578f 2259 if (!(origin_node = dm_tree_find_node_by_uuid(node->dtree, origin_uuid))) {
165e4a11
AK
2260 log_error("Couldn't find snapshot origin uuid %s.", origin_uuid);
2261 return 0;
2262 }
2263
2264 seg->origin = origin_node;
b4f1578f
AK
2265 if (!_link_tree_nodes(node, origin_node))
2266 return_0;
165e4a11 2267
b4f1578f 2268 if (!(cow_node = dm_tree_find_node_by_uuid(node->dtree, cow_uuid))) {
aa6f4e51 2269 log_error("Couldn't find snapshot COW device uuid %s.", cow_uuid);
165e4a11
AK
2270 return 0;
2271 }
2272
2273 seg->cow = cow_node;
b4f1578f
AK
2274 if (!_link_tree_nodes(node, cow_node))
2275 return_0;
165e4a11
AK
2276
2277 seg->persistent = persistent ? 1 : 0;
2278 seg->chunk_size = chunk_size;
2279
aa6f4e51
MS
2280 if (merge_uuid) {
2281 if (!(merge_node = dm_tree_find_node_by_uuid(node->dtree, merge_uuid))) {
2282 /* not a pure error, merging snapshot may have been deactivated */
2283 log_verbose("Couldn't find merging snapshot uuid %s.", merge_uuid);
2284 } else {
2285 seg->merge = merge_node;
2286 /* must not link merging snapshot, would undermine activation_priority below */
2287 }
2288
2289 /* Resume snapshot-merge (acting origin) after other snapshots */
2290 node->activation_priority = 1;
2291 if (seg->merge) {
2292 /* Resume merging snapshot after snapshot-merge */
2293 seg->merge->activation_priority = 2;
2294 }
2295 }
2296
165e4a11
AK
2297 return 1;
2298}
2299
aa6f4e51
MS
2300
2301int dm_tree_node_add_snapshot_target(struct dm_tree_node *node,
2302 uint64_t size,
2303 const char *origin_uuid,
2304 const char *cow_uuid,
2305 int persistent,
2306 uint32_t chunk_size)
2307{
2308 return _add_snapshot_target(node, size, origin_uuid, cow_uuid,
2309 NULL, persistent, chunk_size);
2310}
2311
2312int dm_tree_node_add_snapshot_merge_target(struct dm_tree_node *node,
2313 uint64_t size,
2314 const char *origin_uuid,
2315 const char *cow_uuid,
2316 const char *merge_uuid,
2317 uint32_t chunk_size)
2318{
2319 return _add_snapshot_target(node, size, origin_uuid, cow_uuid,
2320 merge_uuid, 1, chunk_size);
2321}
2322
b4f1578f 2323int dm_tree_node_add_error_target(struct dm_tree_node *node,
40e5fd8b 2324 uint64_t size)
165e4a11 2325{
b4f1578f
AK
2326 if (!_add_segment(node, SEG_ERROR, size))
2327 return_0;
165e4a11
AK
2328
2329 return 1;
2330}
2331
b4f1578f 2332int dm_tree_node_add_zero_target(struct dm_tree_node *node,
40e5fd8b 2333 uint64_t size)
165e4a11 2334{
b4f1578f
AK
2335 if (!_add_segment(node, SEG_ZERO, size))
2336 return_0;
165e4a11
AK
2337
2338 return 1;
2339}
2340
b4f1578f 2341int dm_tree_node_add_linear_target(struct dm_tree_node *node,
40e5fd8b 2342 uint64_t size)
165e4a11 2343{
b4f1578f
AK
2344 if (!_add_segment(node, SEG_LINEAR, size))
2345 return_0;
165e4a11
AK
2346
2347 return 1;
2348}
2349
b4f1578f 2350int dm_tree_node_add_striped_target(struct dm_tree_node *node,
40e5fd8b
AK
2351 uint64_t size,
2352 uint32_t stripe_size)
165e4a11
AK
2353{
2354 struct load_segment *seg;
2355
b4f1578f
AK
2356 if (!(seg = _add_segment(node, SEG_STRIPED, size)))
2357 return_0;
165e4a11
AK
2358
2359 seg->stripe_size = stripe_size;
2360
2361 return 1;
2362}
2363
12ca060e
MB
2364int dm_tree_node_add_crypt_target(struct dm_tree_node *node,
2365 uint64_t size,
2366 const char *cipher,
2367 const char *chainmode,
2368 const char *iv,
2369 uint64_t iv_offset,
2370 const char *key)
2371{
2372 struct load_segment *seg;
2373
2374 if (!(seg = _add_segment(node, SEG_CRYPT, size)))
2375 return_0;
2376
2377 seg->cipher = cipher;
2378 seg->chainmode = chainmode;
2379 seg->iv = iv;
2380 seg->iv_offset = iv_offset;
2381 seg->key = key;
2382
2383 return 1;
2384}
2385
b4f1578f 2386int dm_tree_node_add_mirror_target_log(struct dm_tree_node *node,
165e4a11 2387 uint32_t region_size,
08e64ce5 2388 unsigned clustered,
165e4a11 2389 const char *log_uuid,
ce7ed2c0
AK
2390 unsigned area_count,
2391 uint32_t flags)
165e4a11 2392{
908db078 2393 struct dm_tree_node *log_node = NULL;
165e4a11
AK
2394 struct load_segment *seg;
2395
2396 if (!node->props.segment_count) {
b8175c33 2397 log_error(INTERNAL_ERROR "Attempt to add target area to missing segment.");
165e4a11
AK
2398 return 0;
2399 }
2400
2c44337b 2401 seg = dm_list_item(dm_list_last(&node->props.segs), struct load_segment);
165e4a11 2402
24b026e3 2403 if (log_uuid) {
67b25ed4
AK
2404 if (!(seg->uuid = dm_pool_strdup(node->dtree->mem, log_uuid))) {
2405 log_error("log uuid pool_strdup failed");
2406 return 0;
2407 }
df390f17
AK
2408 if ((flags & DM_CORELOG))
2409 /* For pvmove: immediate resume (for size validation) isn't needed. */
2410 node->props.delay_resume_if_new = 1;
2411 else {
9723090c
AK
2412 if (!(log_node = dm_tree_find_node_by_uuid(node->dtree, log_uuid))) {
2413 log_error("Couldn't find mirror log uuid %s.", log_uuid);
2414 return 0;
2415 }
2416
566515c0
PR
2417 if (clustered)
2418 log_node->props.immediate_dev_node = 1;
2419
0a99713e
AK
2420 /* The kernel validates the size of disk logs. */
2421 /* FIXME Propagate to any devices below */
2422 log_node->props.delay_resume_if_new = 0;
2423
9723090c
AK
2424 if (!_link_tree_nodes(node, log_node))
2425 return_0;
2426 }
165e4a11
AK
2427 }
2428
2429 seg->log = log_node;
165e4a11
AK
2430 seg->region_size = region_size;
2431 seg->clustered = clustered;
2432 seg->mirror_area_count = area_count;
dbcb64b8 2433 seg->flags = flags;
165e4a11
AK
2434
2435 return 1;
2436}
2437
b4f1578f 2438int dm_tree_node_add_mirror_target(struct dm_tree_node *node,
40e5fd8b 2439 uint64_t size)
165e4a11 2440{
cbecd3cd 2441 if (!_add_segment(node, SEG_MIRRORED, size))
b4f1578f 2442 return_0;
165e4a11
AK
2443
2444 return 1;
2445}
2446
cac52ca4
JEB
2447int dm_tree_node_add_raid_target(struct dm_tree_node *node,
2448 uint64_t size,
2449 const char *raid_type,
2450 uint32_t region_size,
2451 uint32_t stripe_size,
f439e65b 2452 uint64_t rebuilds,
cac52ca4
JEB
2453 uint64_t reserved2)
2454{
2455 int i;
2456 struct load_segment *seg = NULL;
2457
2458 for (i = 0; dm_segtypes[i].target && !seg; i++)
2459 if (!strcmp(raid_type, dm_segtypes[i].target))
2460 if (!(seg = _add_segment(node,
2461 dm_segtypes[i].type, size)))
2462 return_0;
2463
b2fa9b43
JEB
2464 if (!seg)
2465 return_0;
2466
cac52ca4
JEB
2467 seg->region_size = region_size;
2468 seg->stripe_size = stripe_size;
2469 seg->area_count = 0;
f439e65b 2470 seg->rebuilds = rebuilds;
cac52ca4
JEB
2471
2472 return 1;
2473}
2474
b262f3e1
ZK
2475int dm_tree_node_add_replicator_target(struct dm_tree_node *node,
2476 uint64_t size,
2477 const char *rlog_uuid,
2478 const char *rlog_type,
2479 unsigned rsite_index,
2480 dm_replicator_mode_t mode,
2481 uint32_t async_timeout,
2482 uint64_t fall_behind_data,
2483 uint32_t fall_behind_ios)
2484{
2485 struct load_segment *rseg;
2486 struct replicator_site *rsite;
2487
2488 /* Local site0 - adds replicator segment and links rlog device */
2489 if (rsite_index == REPLICATOR_LOCAL_SITE) {
2490 if (node->props.segment_count) {
2491 log_error(INTERNAL_ERROR "Attempt to add replicator segment to already used node.");
2492 return 0;
2493 }
2494
2495 if (!(rseg = _add_segment(node, SEG_REPLICATOR, size)))
2496 return_0;
2497
2498 if (!(rseg->log = dm_tree_find_node_by_uuid(node->dtree, rlog_uuid))) {
2499 log_error("Missing replicator log uuid %s.", rlog_uuid);
2500 return 0;
2501 }
2502
2503 if (!_link_tree_nodes(node, rseg->log))
2504 return_0;
2505
2506 if (strcmp(rlog_type, "ringbuffer") != 0) {
2507 log_error("Unsupported replicator log type %s.", rlog_type);
2508 return 0;
2509 }
2510
2511 if (!(rseg->rlog_type = dm_pool_strdup(node->dtree->mem, rlog_type)))
2512 return_0;
2513
2514 dm_list_init(&rseg->rsites);
2515 rseg->rdevice_count = 0;
2516 node->activation_priority = 1;
2517 }
2518
2519 /* Add site to segment */
2520 if (mode == DM_REPLICATOR_SYNC
2521 && (async_timeout || fall_behind_ios || fall_behind_data)) {
2522 log_error("Async parameters passed for synchronnous replicator.");
2523 return 0;
2524 }
2525
2526 if (node->props.segment_count != 1) {
2527 log_error(INTERNAL_ERROR "Attempt to add remote site area before setting replicator log.");
2528 return 0;
2529 }
2530
2531 rseg = dm_list_item(dm_list_last(&node->props.segs), struct load_segment);
2532 if (rseg->type != SEG_REPLICATOR) {
2533 log_error(INTERNAL_ERROR "Attempt to use non replicator segment %s.",
2534 dm_segtypes[rseg->type].target);
2535 return 0;
2536 }
2537
2538 if (!(rsite = dm_pool_zalloc(node->dtree->mem, sizeof(*rsite)))) {
2539 log_error("Failed to allocate remote site segment.");
2540 return 0;
2541 }
2542
2543 dm_list_add(&rseg->rsites, &rsite->list);
2544 rseg->rsite_count++;
2545
2546 rsite->mode = mode;
2547 rsite->async_timeout = async_timeout;
2548 rsite->fall_behind_data = fall_behind_data;
2549 rsite->fall_behind_ios = fall_behind_ios;
2550 rsite->rsite_index = rsite_index;
2551
2552 return 1;
2553}
2554
2555/* Appends device node to Replicator */
2556int dm_tree_node_add_replicator_dev_target(struct dm_tree_node *node,
2557 uint64_t size,
2558 const char *replicator_uuid,
2559 uint64_t rdevice_index,
2560 const char *rdev_uuid,
2561 unsigned rsite_index,
2562 const char *slog_uuid,
2563 uint32_t slog_flags,
2564 uint32_t slog_region_size)
2565{
2566 struct seg_area *area;
2567 struct load_segment *rseg;
2568 struct load_segment *rep_seg;
2569
2570 if (rsite_index == REPLICATOR_LOCAL_SITE) {
2571 /* Site index for local target */
2572 if (!(rseg = _add_segment(node, SEG_REPLICATOR_DEV, size)))
2573 return_0;
2574
2575 if (!(rseg->replicator = dm_tree_find_node_by_uuid(node->dtree, replicator_uuid))) {
2576 log_error("Missing replicator uuid %s.", replicator_uuid);
2577 return 0;
2578 }
2579
2580 /* Local slink0 for replicator must be always initialized first */
2581 if (rseg->replicator->props.segment_count != 1) {
2582 log_error(INTERNAL_ERROR "Attempt to use non replicator segment.");
2583 return 0;
2584 }
2585
2586 rep_seg = dm_list_item(dm_list_last(&rseg->replicator->props.segs), struct load_segment);
2587 if (rep_seg->type != SEG_REPLICATOR) {
2588 log_error(INTERNAL_ERROR "Attempt to use non replicator segment %s.",
2589 dm_segtypes[rep_seg->type].target);
2590 return 0;
2591 }
2592 rep_seg->rdevice_count++;
2593
2594 if (!_link_tree_nodes(node, rseg->replicator))
2595 return_0;
2596
2597 rseg->rdevice_index = rdevice_index;
2598 } else {
2599 /* Local slink0 for replicator must be always initialized first */
2600 if (node->props.segment_count != 1) {
2601 log_error(INTERNAL_ERROR "Attempt to use non replicator-dev segment.");
2602 return 0;
2603 }
2604
2605 rseg = dm_list_item(dm_list_last(&node->props.segs), struct load_segment);
2606 if (rseg->type != SEG_REPLICATOR_DEV) {
2607 log_error(INTERNAL_ERROR "Attempt to use non replicator-dev segment %s.",
2608 dm_segtypes[rseg->type].target);
2609 return 0;
2610 }
2611 }
2612
2613 if (!(slog_flags & DM_CORELOG) && !slog_uuid) {
2614 log_error("Unspecified sync log uuid.");
2615 return 0;
2616 }
2617
2618 if (!dm_tree_node_add_target_area(node, NULL, rdev_uuid, 0))
2619 return_0;
2620
2621 area = dm_list_item(dm_list_last(&rseg->areas), struct seg_area);
2622
2623 if (!(slog_flags & DM_CORELOG)) {
2624 if (!(area->slog = dm_tree_find_node_by_uuid(node->dtree, slog_uuid))) {
2625 log_error("Couldn't find sync log uuid %s.", slog_uuid);
2626 return 0;
2627 }
2628
2629 if (!_link_tree_nodes(node, area->slog))
2630 return_0;
2631 }
2632
2633 area->flags = slog_flags;
2634 area->region_size = slog_region_size;
2635 area->rsite_index = rsite_index;
2636
2637 return 1;
2638}
2639
4251236e
ZK
2640int dm_tree_node_add_thin_pool_target(struct dm_tree_node *node,
2641 uint64_t size,
2642 uint64_t transation_id,
2643 const char *pool_uuid,
2644 const char *metadata_uuid,
2645 uint32_t data_block_size,
2646 uint64_t low_water_mark,
2647 unsigned skip_block_zeroeing)
2648{
2649 struct load_segment *seg;
2650
2651 if (data_block_size < THIN_MIN_DATA_SIZE) {
2652 log_error("Data block size %d is lower then "
2653 QUOTE(THIN_MIN_DATA_SIZE) " sectors.",
2654 data_block_size);
2655 return 0;
2656 }
2657
2658 if (data_block_size > THIN_MAX_DATA_SIZE) {
2659 log_error("Data block size %d is higher then "
2660 QUOTE(THIN_MAX_DATA_SIZE) " sectors.",
2661 data_block_size);
2662 return 0;
2663 }
2664
2665 if (!(seg = _add_segment(node, SEG_THIN_POOL, size)))
2666 return_0;
2667
2668 if (!(seg->metadata = dm_tree_find_node_by_uuid(node->dtree, metadata_uuid))) {
2669 log_error("Missing metadata uuid %s.", metadata_uuid);
2670 return 0;
2671 }
2672
2673 if (!_link_tree_nodes(node, seg->metadata))
2674 return_0;
2675
2676 if (!(seg->pool = dm_tree_find_node_by_uuid(node->dtree, pool_uuid))) {
2677 log_error("Missing pool uuid %s.", pool_uuid);
2678 return 0;
2679 }
2680
2681 if (!_link_tree_nodes(node, seg->pool))
2682 return_0;
2683
2684 seg->data_block_size = data_block_size;
2685 seg->low_water_mark = low_water_mark;
2686 seg->skip_block_zeroeing = skip_block_zeroeing;
2687
2688 return 1;
2689}
2690
2691int dm_tree_node_add_thin_target(struct dm_tree_node *node,
2692 uint64_t size,
2693 uint64_t transation_id,
2694 const char *thin_pool_uuid,
2695 uint32_t device_id)
2696{
2697 struct load_segment *seg;
2698
2699 if (device_id > THIN_MAX_DEVICE_ID) {
2700 log_error("Device id %d is higher then " QUOTE(THIN_MAX_DEVICE_ID) ".",
2701 device_id);
2702 return 0;
2703 }
2704
2705 if (!(seg = _add_segment(node, SEG_THIN, size)))
2706 return_0;
2707
2708 if (!(seg->pool = dm_tree_find_node_by_uuid(node->dtree, thin_pool_uuid))) {
2709 log_error("Missing thin pool uuid %s.", thin_pool_uuid);
2710 return 0;
2711 }
2712
2713 if (!_link_tree_nodes(node, seg->pool))
2714 return_0;
2715
2716 return 1;
2717}
2718
b4f1578f 2719static int _add_area(struct dm_tree_node *node, struct load_segment *seg, struct dm_tree_node *dev_node, uint64_t offset)
165e4a11
AK
2720{
2721 struct seg_area *area;
2722
b4f1578f 2723 if (!(area = dm_pool_zalloc(node->dtree->mem, sizeof (*area)))) {
165e4a11
AK
2724 log_error("Failed to allocate target segment area.");
2725 return 0;
2726 }
2727
2728 area->dev_node = dev_node;
2729 area->offset = offset;
2730
2c44337b 2731 dm_list_add(&seg->areas, &area->list);
165e4a11
AK
2732 seg->area_count++;
2733
2734 return 1;
2735}
2736
b4f1578f 2737int dm_tree_node_add_target_area(struct dm_tree_node *node,
40e5fd8b
AK
2738 const char *dev_name,
2739 const char *uuid,
2740 uint64_t offset)
165e4a11
AK
2741{
2742 struct load_segment *seg;
2743 struct stat info;
b4f1578f 2744 struct dm_tree_node *dev_node;
165e4a11
AK
2745
2746 if ((!dev_name || !*dev_name) && (!uuid || !*uuid)) {
b4f1578f 2747 log_error("dm_tree_node_add_target_area called without device");
165e4a11
AK
2748 return 0;
2749 }
2750
2751 if (uuid) {
b4f1578f 2752 if (!(dev_node = dm_tree_find_node_by_uuid(node->dtree, uuid))) {
165e4a11
AK
2753 log_error("Couldn't find area uuid %s.", uuid);
2754 return 0;
2755 }
b4f1578f
AK
2756 if (!_link_tree_nodes(node, dev_node))
2757 return_0;
165e4a11 2758 } else {
6d04311e 2759 if (stat(dev_name, &info) < 0) {
165e4a11
AK
2760 log_error("Device %s not found.", dev_name);
2761 return 0;
2762 }
2763
40e5fd8b 2764 if (!S_ISBLK(info.st_mode)) {
165e4a11
AK
2765 log_error("Device %s is not a block device.", dev_name);
2766 return 0;
2767 }
2768
2769 /* FIXME Check correct macro use */
cda69e17
PR
2770 if (!(dev_node = _add_dev(node->dtree, node, MAJOR(info.st_rdev),
2771 MINOR(info.st_rdev), 0)))
b4f1578f 2772 return_0;
165e4a11
AK
2773 }
2774
2775 if (!node->props.segment_count) {
b8175c33 2776 log_error(INTERNAL_ERROR "Attempt to add target area to missing segment.");
165e4a11
AK
2777 return 0;
2778 }
2779
2c44337b 2780 seg = dm_list_item(dm_list_last(&node->props.segs), struct load_segment);
165e4a11 2781
b4f1578f
AK
2782 if (!_add_area(node, seg, dev_node, offset))
2783 return_0;
165e4a11
AK
2784
2785 return 1;
db208f51 2786}
bd90c6b2 2787
6d04311e
JEB
2788int dm_tree_node_add_null_area(struct dm_tree_node *node, uint64_t offset)
2789{
2790 struct load_segment *seg;
2791
2792 seg = dm_list_item(dm_list_last(&node->props.segs), struct load_segment);
2793
415c0690
AK
2794 switch (seg->type) {
2795 case SEG_RAID1:
2796 case SEG_RAID4:
2797 case SEG_RAID5_LA:
2798 case SEG_RAID5_RA:
2799 case SEG_RAID5_LS:
2800 case SEG_RAID5_RS:
2801 case SEG_RAID6_ZR:
2802 case SEG_RAID6_NR:
2803 case SEG_RAID6_NC:
2804 break;
2805 default:
2806 log_error("dm_tree_node_add_null_area() called on an unsupported segment type");
2807 return 0;
2808 }
2809
6d04311e
JEB
2810 if (!_add_area(node, seg, NULL, offset))
2811 return_0;
2812
2813 return 1;
2814}
2815
bd90c6b2
AK
2816void dm_tree_set_cookie(struct dm_tree_node *node, uint32_t cookie)
2817{
2818 node->dtree->cookie = cookie;
2819}
2820
2821uint32_t dm_tree_get_cookie(struct dm_tree_node *node)
2822{
2823 return node->dtree->cookie;
2824}
This page took 0.408775 seconds and 5 git commands to generate.