mirror of
https://github.com/libguestfs/libguestfs.git
synced 2026-03-21 22:53:37 +00:00
14fabcd88e
Replaces code such as: fd = open "test1.img" ftruncate fd, size close fd g.add_drive "test1.img" with the shorter and simpler: g.add_drive_scratch size
88 lines
2.4 KiB
Perl
Executable File
88 lines
2.4 KiB
Perl
Executable File
#!/usr/bin/perl
|
|
# Copyright (C) 2010 Red Hat Inc.
|
|
#
|
|
# This program is free software; you can redistribute it and/or modify
|
|
# it under the terms of the GNU General Public License as published by
|
|
# the Free Software Foundation; either version 2 of the License, or
|
|
# (at your option) any later version.
|
|
#
|
|
# This program is distributed in the hope that it will be useful,
|
|
# but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
# GNU General Public License for more details.
|
|
#
|
|
# You should have received a copy of the GNU General Public License
|
|
# along with this program; if not, write to the Free Software
|
|
# Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
|
|
# Test the discovery of relationships between LVM PVs, VGs and LVs.
|
|
|
|
use strict;
|
|
use warnings;
|
|
|
|
use Sys::Guestfs;
|
|
|
|
my $g = Sys::Guestfs->new ();
|
|
|
|
$g->add_drive_scratch (256 * 1024 * 1024);
|
|
$g->launch ();
|
|
|
|
# Create an arrangement of PVs, VGs and LVs.
|
|
$g->sfdiskM ("/dev/sda", [",127", "128,"]);
|
|
|
|
$g->pvcreate ("/dev/sda1");
|
|
$g->pvcreate ("/dev/sda2");
|
|
$g->vgcreate ("VG", ["/dev/sda1", "/dev/sda2"]);
|
|
|
|
$g->lvcreate ("LV1", "VG", 32);
|
|
$g->lvcreate ("LV2", "VG", 32);
|
|
$g->lvcreate ("LV3", "VG", 32);
|
|
|
|
# Now let's get the arrangement.
|
|
my @pvs = $g->pvs ();
|
|
my @lvs = $g->lvs ();
|
|
|
|
my %pvuuids;
|
|
foreach my $pv (@pvs) {
|
|
my $uuid = $g->pvuuid ($pv);
|
|
$pvuuids{$uuid} = $pv;
|
|
}
|
|
my %lvuuids;
|
|
foreach my $lv (@lvs) {
|
|
my $uuid = $g->lvuuid ($lv);
|
|
$lvuuids{$uuid} = $lv;
|
|
}
|
|
|
|
# In this case there is only one VG, called "VG", but in a real
|
|
# program you'd want to repeat these steps for each VG that you found.
|
|
my @pvuuids_in_VG = $g->vgpvuuids ("VG");
|
|
my @lvuuids_in_VG = $g->vglvuuids ("VG");
|
|
|
|
my @pvs_in_VG;
|
|
foreach my $uuid (@pvuuids_in_VG) {
|
|
push @pvs_in_VG, $pvuuids{$uuid};
|
|
}
|
|
@pvs_in_VG = sort @pvs_in_VG;
|
|
|
|
my @lvs_in_VG;
|
|
foreach my $uuid (@lvuuids_in_VG) {
|
|
push @lvs_in_VG, $lvuuids{$uuid};
|
|
}
|
|
@lvs_in_VG = sort @lvs_in_VG;
|
|
|
|
unless (@pvs_in_VG == 2 &&
|
|
$pvs_in_VG[0] =~ m{/dev/.da1} && $pvs_in_VG[1] =~ m{/dev/.da2}) {
|
|
die "unexpected set of PVs for volume group VG: [",
|
|
join (", ", @pvs_in_VG), "]\n"
|
|
}
|
|
|
|
unless (@lvs_in_VG == 3 &&
|
|
$lvs_in_VG[0] eq "/dev/VG/LV1" &&
|
|
$lvs_in_VG[1] eq "/dev/VG/LV2" &&
|
|
$lvs_in_VG[2] eq "/dev/VG/LV3") {
|
|
die "unexpected set of LVs for volume group VG: [",
|
|
join (", ", @lvs_in_VG), "]\n"
|
|
}
|
|
|
|
undef $g;
|