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