2002-01-07 18:08:28 +03:00
/*
2004-03-30 23:35:44 +04:00
* Copyright ( C ) 2001 - 2004 Sistina Software , Inc . All rights reserved .
2017-02-03 22:39:40 +03:00
* Copyright ( C ) 2004 - 2017 Red Hat , Inc . All rights reserved .
2002-01-07 18:08:28 +03:00
*
2004-03-30 23:35:44 +04:00
* This file is part of LVM2 .
*
* This copyrighted material is made available to anyone wishing to use ,
* modify , copy , or redistribute it subject to the terms and conditions
2007-08-21 00:55:30 +04:00
* of the GNU Lesser General Public License v .2 .1 .
2004-03-30 23:35:44 +04:00
*
2007-08-21 00:55:30 +04:00
* You should have received a copy of the GNU Lesser General Public License
2004-03-30 23:35:44 +04:00
* along with this program ; if not , write to the Free Software Foundation ,
2016-01-21 13:49:46 +03:00
* Inc . , 51 Franklin Street , Fifth Floor , Boston , MA 02110 - 1301 USA
2002-01-07 18:08:28 +03:00
*/
2018-05-14 12:30:20 +03:00
# include "lib/misc/lib.h"
# include "lib/config/defaults.h"
# include "lib/metadata/metadata.h"
# include "lib/metadata/lv_alloc.h"
# include "lib/metadata/pv_alloc.h"
# include "lib/datastruct/str_list.h"
# include "lib/metadata/segtype.h"
2003-09-01 23:55:16 +04:00
/*
* Attempt to merge two adjacent segments .
2004-05-05 01:25:57 +04:00
* Currently only supports striped segments on AREA_PV .
2008-01-30 17:00:02 +03:00
* Returns success if successful , in which case ' first '
2003-09-01 23:55:16 +04:00
* gets adjusted to contain both areas .
*/
static int _merge ( struct lv_segment * first , struct lv_segment * second )
{
2004-05-05 01:25:57 +04:00
if ( ! first | | ! second | | first - > segtype ! = second - > segtype | |
2010-04-09 05:00:10 +04:00
! first - > segtype - > ops - > merge_segments )
return 0 ;
2003-09-01 23:55:16 +04:00
2004-05-05 01:25:57 +04:00
return first - > segtype - > ops - > merge_segments ( first , second ) ;
2002-01-07 18:08:28 +03:00
}
2002-01-10 14:18:08 +03:00
int lv_merge_segments ( struct logical_volume * lv )
2002-01-07 18:08:28 +03:00
{
2008-11-04 01:14:30 +03:00
struct dm_list * segh , * t ;
pvmove: Enable all-or-nothing (atomic) pvmoves
pvmove can be used to move single LVs by name or multiple LVs that
lie within the specified PV range (e.g. /dev/sdb1:0-1000). When
moving more than one LV, the portions of those LVs that are in the
range to be moved are added to a new temporary pvmove LV. The LVs
then point to the range in the pvmove LV, rather than the PV
range.
Example 1:
We have two LVs in this example. After they were
created, the first LV was grown, yeilding two segments
in LV1. So, there are two LVs with a total of three
segments.
Before pvmove:
--------- --------- ---------
| LV1s0 | | LV2s0 | | LV1s1 |
--------- --------- ---------
| | |
-------------------------------------
PV | 000 - 255 | 256 - 511 | 512 - 767 |
-------------------------------------
After pvmove inserts the temporary pvmove LV:
--------- --------- ---------
| LV1s0 | | LV2s0 | | LV1s1 |
--------- --------- ---------
| | |
-------------------------------------
pvmove0 | seg 0 | seg 1 | seg 2 |
-------------------------------------
| | |
-------------------------------------
PV | 000 - 255 | 256 - 511 | 512 - 767 |
-------------------------------------
Each of the affected LV segments now point to a
range of blocks in the pvmove LV, which purposefully
corresponds to the segments moved from the original
LVs into the temporary pvmove LV.
The current implementation goes on from here to mirror the temporary
pvmove LV by segment. Further, as the pvmove LV is activated, only
one of its segments is actually mirrored (i.e. "moving") at a time.
The rest are either complete or not addressed yet. If the pvmove
is aborted, those segments that are completed will remain on the
destination and those that are not yet addressed or in the process
of moving will stay on the source PV. Thus, it is possible to have
a partially completed move - some LVs (or certain segments of LVs)
on the source PV and some on the destination.
Example 2:
What 'example 1' might look if it was half-way
through the move.
--------- --------- ---------
| LV1s0 | | LV2s0 | | LV1s1 |
--------- --------- ---------
| | |
-------------------------------------
pvmove0 | seg 0 | seg 1 | seg 2 |
-------------------------------------
| | |
| -------------------------
source PV | | 256 - 511 | 512 - 767 |
| -------------------------
| ||
-------------------------
dest PV | 000 - 255 | 256 - 511 |
-------------------------
This update allows the user to specify that they would like the
pvmove mirror created "by LV" rather than "by segment". That is,
the pvmove LV becomes an image in an encapsulating mirror along
with the allocated copy image.
Example 3:
A pvmove that is performed "by LV" rather than "by segment".
--------- ---------
| LV1s0 | | LV2s0 |
--------- ---------
| |
-------------------------
pvmove0 | * LV-level mirror * |
-------------------------
/ \
pvmove_mimage0 / pvmove_mimage1
------------------------- -------------------------
| seg 0 | seg 1 | | seg 0 | seg 1 |
------------------------- -------------------------
| | | |
------------------------- -------------------------
| 000 - 255 | 256 - 511 | | 000 - 255 | 256 - 511 |
------------------------- -------------------------
source PV dest PV
The thing that differentiates a pvmove done in this way and a simple
"up-convert" from linear to mirror is the preservation of the
distinct segments. A normal up-convert would simply allocate the
necessary space with no regard for segment boundaries. The pvmove
operation must preserve the segments because they are the critical
boundary between the segments of the LVs being moved. So, when the
pvmove copy image is allocated, all corresponding segments must be
allocated. The code that merges ajoining segments that are part of
the same LV when the metadata is written must also be avoided in
this case. This method of mirroring is unique enough to warrant its
own definitional macro, MIRROR_BY_SEGMENTED_LV. This joins the two
existing macros: MIRROR_BY_SEG (for original pvmove) and MIRROR_BY_LV
(for user created mirrors).
The advantages of performing pvmove in this way is that all of the
LVs affected can be moved together. It is an all-or-nothing approach
that leaves all LV segments on the source PV if the move is aborted.
Additionally, a mirror log can be used (in the future) to provide tracking
of progress; allowing the copy to continue where it left off in the event
there is a deactivation.
2014-06-18 07:59:36 +04:00
struct lv_segment * seg , * current , * prev = NULL ;
2002-01-07 18:08:28 +03:00
2014-06-20 14:41:20 +04:00
/*
* Don ' t interfere with pvmoves as they rely upon two LVs
* having a matching segment structure .
*/
2014-09-16 00:33:53 +04:00
if ( lv_is_locked ( lv ) | | lv_is_pvmove ( lv ) )
2004-08-18 02:09:02 +04:00
return 1 ;
2014-09-16 00:33:53 +04:00
if ( lv_is_mirror_image ( lv ) & &
pvmove: Enable all-or-nothing (atomic) pvmoves
pvmove can be used to move single LVs by name or multiple LVs that
lie within the specified PV range (e.g. /dev/sdb1:0-1000). When
moving more than one LV, the portions of those LVs that are in the
range to be moved are added to a new temporary pvmove LV. The LVs
then point to the range in the pvmove LV, rather than the PV
range.
Example 1:
We have two LVs in this example. After they were
created, the first LV was grown, yeilding two segments
in LV1. So, there are two LVs with a total of three
segments.
Before pvmove:
--------- --------- ---------
| LV1s0 | | LV2s0 | | LV1s1 |
--------- --------- ---------
| | |
-------------------------------------
PV | 000 - 255 | 256 - 511 | 512 - 767 |
-------------------------------------
After pvmove inserts the temporary pvmove LV:
--------- --------- ---------
| LV1s0 | | LV2s0 | | LV1s1 |
--------- --------- ---------
| | |
-------------------------------------
pvmove0 | seg 0 | seg 1 | seg 2 |
-------------------------------------
| | |
-------------------------------------
PV | 000 - 255 | 256 - 511 | 512 - 767 |
-------------------------------------
Each of the affected LV segments now point to a
range of blocks in the pvmove LV, which purposefully
corresponds to the segments moved from the original
LVs into the temporary pvmove LV.
The current implementation goes on from here to mirror the temporary
pvmove LV by segment. Further, as the pvmove LV is activated, only
one of its segments is actually mirrored (i.e. "moving") at a time.
The rest are either complete or not addressed yet. If the pvmove
is aborted, those segments that are completed will remain on the
destination and those that are not yet addressed or in the process
of moving will stay on the source PV. Thus, it is possible to have
a partially completed move - some LVs (or certain segments of LVs)
on the source PV and some on the destination.
Example 2:
What 'example 1' might look if it was half-way
through the move.
--------- --------- ---------
| LV1s0 | | LV2s0 | | LV1s1 |
--------- --------- ---------
| | |
-------------------------------------
pvmove0 | seg 0 | seg 1 | seg 2 |
-------------------------------------
| | |
| -------------------------
source PV | | 256 - 511 | 512 - 767 |
| -------------------------
| ||
-------------------------
dest PV | 000 - 255 | 256 - 511 |
-------------------------
This update allows the user to specify that they would like the
pvmove mirror created "by LV" rather than "by segment". That is,
the pvmove LV becomes an image in an encapsulating mirror along
with the allocated copy image.
Example 3:
A pvmove that is performed "by LV" rather than "by segment".
--------- ---------
| LV1s0 | | LV2s0 |
--------- ---------
| |
-------------------------
pvmove0 | * LV-level mirror * |
-------------------------
/ \
pvmove_mimage0 / pvmove_mimage1
------------------------- -------------------------
| seg 0 | seg 1 | | seg 0 | seg 1 |
------------------------- -------------------------
| | | |
------------------------- -------------------------
| 000 - 255 | 256 - 511 | | 000 - 255 | 256 - 511 |
------------------------- -------------------------
source PV dest PV
The thing that differentiates a pvmove done in this way and a simple
"up-convert" from linear to mirror is the preservation of the
distinct segments. A normal up-convert would simply allocate the
necessary space with no regard for segment boundaries. The pvmove
operation must preserve the segments because they are the critical
boundary between the segments of the LVs being moved. So, when the
pvmove copy image is allocated, all corresponding segments must be
allocated. The code that merges ajoining segments that are part of
the same LV when the metadata is written must also be avoided in
this case. This method of mirroring is unique enough to warrant its
own definitional macro, MIRROR_BY_SEGMENTED_LV. This joins the two
existing macros: MIRROR_BY_SEG (for original pvmove) and MIRROR_BY_LV
(for user created mirrors).
The advantages of performing pvmove in this way is that all of the
LVs affected can be moved together. It is an all-or-nothing approach
that leaves all LV segments on the source PV if the move is aborted.
Additionally, a mirror log can be used (in the future) to provide tracking
of progress; allowing the copy to continue where it left off in the event
there is a deactivation.
2014-06-18 07:59:36 +04:00
( seg = get_only_segment_using_this_lv ( lv ) ) & &
2014-09-16 00:33:53 +04:00
( lv_is_locked ( seg - > lv ) | | lv_is_pvmove ( seg - > lv ) ) )
pvmove: Enable all-or-nothing (atomic) pvmoves
pvmove can be used to move single LVs by name or multiple LVs that
lie within the specified PV range (e.g. /dev/sdb1:0-1000). When
moving more than one LV, the portions of those LVs that are in the
range to be moved are added to a new temporary pvmove LV. The LVs
then point to the range in the pvmove LV, rather than the PV
range.
Example 1:
We have two LVs in this example. After they were
created, the first LV was grown, yeilding two segments
in LV1. So, there are two LVs with a total of three
segments.
Before pvmove:
--------- --------- ---------
| LV1s0 | | LV2s0 | | LV1s1 |
--------- --------- ---------
| | |
-------------------------------------
PV | 000 - 255 | 256 - 511 | 512 - 767 |
-------------------------------------
After pvmove inserts the temporary pvmove LV:
--------- --------- ---------
| LV1s0 | | LV2s0 | | LV1s1 |
--------- --------- ---------
| | |
-------------------------------------
pvmove0 | seg 0 | seg 1 | seg 2 |
-------------------------------------
| | |
-------------------------------------
PV | 000 - 255 | 256 - 511 | 512 - 767 |
-------------------------------------
Each of the affected LV segments now point to a
range of blocks in the pvmove LV, which purposefully
corresponds to the segments moved from the original
LVs into the temporary pvmove LV.
The current implementation goes on from here to mirror the temporary
pvmove LV by segment. Further, as the pvmove LV is activated, only
one of its segments is actually mirrored (i.e. "moving") at a time.
The rest are either complete or not addressed yet. If the pvmove
is aborted, those segments that are completed will remain on the
destination and those that are not yet addressed or in the process
of moving will stay on the source PV. Thus, it is possible to have
a partially completed move - some LVs (or certain segments of LVs)
on the source PV and some on the destination.
Example 2:
What 'example 1' might look if it was half-way
through the move.
--------- --------- ---------
| LV1s0 | | LV2s0 | | LV1s1 |
--------- --------- ---------
| | |
-------------------------------------
pvmove0 | seg 0 | seg 1 | seg 2 |
-------------------------------------
| | |
| -------------------------
source PV | | 256 - 511 | 512 - 767 |
| -------------------------
| ||
-------------------------
dest PV | 000 - 255 | 256 - 511 |
-------------------------
This update allows the user to specify that they would like the
pvmove mirror created "by LV" rather than "by segment". That is,
the pvmove LV becomes an image in an encapsulating mirror along
with the allocated copy image.
Example 3:
A pvmove that is performed "by LV" rather than "by segment".
--------- ---------
| LV1s0 | | LV2s0 |
--------- ---------
| |
-------------------------
pvmove0 | * LV-level mirror * |
-------------------------
/ \
pvmove_mimage0 / pvmove_mimage1
------------------------- -------------------------
| seg 0 | seg 1 | | seg 0 | seg 1 |
------------------------- -------------------------
| | | |
------------------------- -------------------------
| 000 - 255 | 256 - 511 | | 000 - 255 | 256 - 511 |
------------------------- -------------------------
source PV dest PV
The thing that differentiates a pvmove done in this way and a simple
"up-convert" from linear to mirror is the preservation of the
distinct segments. A normal up-convert would simply allocate the
necessary space with no regard for segment boundaries. The pvmove
operation must preserve the segments because they are the critical
boundary between the segments of the LVs being moved. So, when the
pvmove copy image is allocated, all corresponding segments must be
allocated. The code that merges ajoining segments that are part of
the same LV when the metadata is written must also be avoided in
this case. This method of mirroring is unique enough to warrant its
own definitional macro, MIRROR_BY_SEGMENTED_LV. This joins the two
existing macros: MIRROR_BY_SEG (for original pvmove) and MIRROR_BY_LV
(for user created mirrors).
The advantages of performing pvmove in this way is that all of the
LVs affected can be moved together. It is an all-or-nothing approach
that leaves all LV segments on the source PV if the move is aborted.
Additionally, a mirror log can be used (in the future) to provide tracking
of progress; allowing the copy to continue where it left off in the event
there is a deactivation.
2014-06-18 07:59:36 +04:00
return 1 ;
2008-11-04 01:14:30 +03:00
dm_list_iterate_safe ( segh , t , & lv - > segments ) {
current = dm_list_item ( segh , struct lv_segment ) ;
2002-01-07 18:08:28 +03:00
if ( _merge ( prev , current ) )
2008-11-04 01:14:30 +03:00
dm_list_del ( & current - > list ) ;
2002-01-07 18:08:28 +03:00
else
prev = current ;
}
return 1 ;
}
2010-04-01 16:14:20 +04:00
# define ERROR_MAX 100
# define inc_error_count \
if ( error_count + + > ERROR_MAX ) \
goto out
2018-04-19 18:35:48 +03:00
# define seg_error(msg) do { \
2016-12-20 17:59:11 +03:00
log_error ( " LV %s, segment %u invalid: %s for %s segment. " , \
seg - > lv - > name , seg_count , ( msg ) , lvseg_name ( seg ) ) ; \
if ( ( * error_count ) + + > ERROR_MAX ) \
return ; \
2018-04-19 18:35:48 +03:00
} while ( 0 )
2016-12-20 17:59:11 +03:00
2016-07-27 19:17:29 +03:00
/*
* RAID segment property checks .
*
* Checks in here shall catch any
* bogus segment structure setup .
*/
2018-04-19 18:35:48 +03:00
# define raid_seg_error(msg) do { \
2016-07-27 19:17:29 +03:00
log_error ( " LV %s invalid: %s for %s segment " , \
seg - > lv - > name , ( msg ) , lvseg_name ( seg ) ) ; \
if ( ( * error_count ) + + > ERROR_MAX ) \
return ; \
2018-04-19 18:35:48 +03:00
} while ( 0 )
2016-07-27 19:17:29 +03:00
2018-04-19 18:35:48 +03:00
# define raid_seg_error_val(msg, val) do { \
2016-07-27 19:17:29 +03:00
log_error ( " LV %s invalid: %s (is %u) for %s segment " , \
seg - > lv - > name , ( msg ) , ( val ) , lvseg_name ( seg ) ) ; \
if ( ( * error_count ) + + > ERROR_MAX ) \
return ; \
2018-04-19 18:35:48 +03:00
} while ( 0 )
2016-07-27 19:17:29 +03:00
2017-11-15 23:24:44 +03:00
/* Check segment LV for reshape flags. */
static int _check_raid_seg_reshape_flags ( struct lv_segment * seg )
{
return ( ( seg - > lv - > status & LV_RESHAPE ) | |
( seg - > lv - > status & LV_RESHAPE_DELTA_DISKS_MINUS ) | |
( seg - > lv - > status & LV_RESHAPE_DELTA_DISKS_PLUS ) ) ;
}
2016-07-27 19:17:29 +03:00
/* Check raid0 segment properties in @seg */
static void _check_raid0_seg ( struct lv_segment * seg , int * error_count )
{
if ( seg_is_raid0_meta ( seg ) & &
! seg - > meta_areas )
raid_seg_error ( " no meta areas " ) ;
2016-08-04 23:13:36 +03:00
if ( ! seg_is_raid0_meta ( seg ) & &
seg - > meta_areas )
raid_seg_error ( " meta areas " ) ;
2016-07-27 19:17:29 +03:00
if ( ! seg - > stripe_size )
raid_seg_error ( " zero stripe size " ) ;
if ( ! is_power_of_2 ( seg - > stripe_size ) )
raid_seg_error_val ( " non power of 2 stripe size " , seg - > stripe_size ) ;
if ( seg - > region_size )
raid_seg_error_val ( " non-zero region_size " , seg - > region_size ) ;
if ( seg - > writebehind )
raid_seg_error_val ( " non-zero write behind " , seg - > writebehind ) ;
if ( seg - > min_recovery_rate )
raid_seg_error_val ( " non-zero min recovery rate " , seg - > min_recovery_rate ) ;
if ( seg - > max_recovery_rate )
raid_seg_error_val ( " non-zero max recovery rate " , seg - > max_recovery_rate ) ;
2017-10-09 16:21:51 +03:00
if ( ( seg - > lv - > status & LV_RESHAPE_DATA_OFFSET ) | | seg - > data_offset > 1 )
2017-07-15 01:50:19 +03:00
raid_seg_error_val ( " data_offset " , seg - > data_offset ) ;
2017-11-15 23:24:44 +03:00
if ( _check_raid_seg_reshape_flags ( seg ) )
raid_seg_error ( " reshape " ) ;
2016-07-27 19:17:29 +03:00
}
/* Check RAID @seg for non-zero, power of 2 region size and min recovery rate <= max */
static void _check_raid_region_recovery ( struct lv_segment * seg , int * error_count )
{
if ( ! seg - > region_size )
raid_seg_error ( " zero region_size " ) ;
if ( ! is_power_of_2 ( seg - > region_size ) )
raid_seg_error_val ( " non power of 2 region size " , seg - > region_size ) ;
2016-07-28 00:20:58 +03:00
/* min/max recovery rate may be zero but min may not be larger than max if set */
if ( seg - > max_recovery_rate & &
seg - > min_recovery_rate > seg - > max_recovery_rate )
2016-08-02 16:27:13 +03:00
raid_seg_error_val ( " min recovery larger than max recovery " , seg - > min_recovery_rate ) ;
2016-07-27 19:17:29 +03:00
}
/* Check raid1 segment properties in @seg */
static void _check_raid1_seg ( struct lv_segment * seg , int * error_count )
{
if ( ! seg - > meta_areas )
raid_seg_error ( " no meta areas " ) ;
if ( seg - > stripe_size )
raid_seg_error_val ( " non-zero stripe size " , seg - > stripe_size ) ;
2017-10-09 15:00:46 +03:00
if ( ( seg - > lv - > status & LV_RESHAPE_DATA_OFFSET ) | | seg - > data_offset > 1 )
2017-07-15 01:50:19 +03:00
raid_seg_error_val ( " data_offset " , seg - > data_offset ) ;
2017-11-15 23:24:44 +03:00
if ( _check_raid_seg_reshape_flags ( seg ) )
raid_seg_error ( " reshape " ) ;
2016-07-27 19:17:29 +03:00
_check_raid_region_recovery ( seg , error_count ) ;
}
/* Check raid4/5/6/10 segment properties in @seg */
static void _check_raid45610_seg ( struct lv_segment * seg , int * error_count )
{
/* Checks applying to any raid4/5/6/10 */
2017-02-07 14:25:26 +03:00
/*
* Allow raid4 + raid5_n to get activated w / o metadata .
*
* This is mandatory during conversion between them ,
* because switching the dedicated parity SubLVs
* beginning < - > end changes the roles of all SubLVs
* which the kernel would reject .
*/
2017-02-03 22:39:40 +03:00
if ( ! ( seg_is_raid4 ( seg ) | | seg_is_raid5_n ( seg ) ) & & ! seg - > meta_areas )
2016-07-27 19:17:29 +03:00
raid_seg_error ( " no meta areas " ) ;
if ( ! seg - > stripe_size )
raid_seg_error ( " zero stripe size " ) ;
if ( ! is_power_of_2 ( seg - > stripe_size ) )
raid_seg_error_val ( " non power of 2 stripe size " , seg - > stripe_size ) ;
_check_raid_region_recovery ( seg , error_count ) ;
/* END: checks applying to any raid4/5/6/10 */
2017-10-09 17:13:45 +03:00
if ( seg - > data_offset > 1 ) {
if ( seg - > lv - > status & LV_RESHAPE_DATA_OFFSET ) {
if ( seg - > data_offset & ( seg - > lv - > vg - > extent_size - 1 ) )
raid_seg_error_val ( " data_offset " , seg - > data_offset ) ;
} else
2017-08-14 16:00:15 +03:00
raid_seg_error_val ( " data_offset " , seg - > data_offset ) ;
2017-10-09 17:13:45 +03:00
}
2017-07-15 01:50:19 +03:00
2016-07-27 19:17:29 +03:00
/* Specific checks per raid level */
if ( seg_is_raid4 ( seg ) | |
seg_is_any_raid5 ( seg ) ) {
/*
* To allow for takeover between the MD raid1 and
* raid4 / 5 personalities , exactly 2 areas ( i . e . DataLVs )
* can be mirrored by all raid1 , raid4 and raid5 personalities .
* Hence allow a minimum of 2 areas .
*/
if ( seg - > area_count < 2 )
raid_seg_error_val ( " minimum 2 areas required " , seg - > area_count ) ;
} else if ( seg_is_any_raid6 ( seg ) ) {
/*
* FIXME : MD raid6 supports a minimum of 4 areas .
* LVM requests a minimum of 5 due to easier
* processing of SubLVs to replace .
*
* Once that obstacle got removed , allow for a minimum of 4.
*/
if ( seg - > area_count < 5 )
raid_seg_error_val ( " minimum 5 areas required " , seg - > area_count ) ;
} else if ( seg_is_raid10 ( seg ) ) {
/*
* FIXME : raid10 area_count minimum has to change to 2 once we
* support data_copies and odd numbers of stripes
*/
if ( seg - > area_count < 4 )
raid_seg_error_val ( " minimum 4 areas required " , seg - > area_count ) ;
if ( seg - > writebehind )
raid_seg_error_val ( " non-zero writebehind " , seg - > writebehind ) ;
}
}
/* Check any non-RAID segment struct members in @seg and increment @error_count for any bogus ones */
static void _check_non_raid_seg_members ( struct lv_segment * seg , int * error_count )
{
if ( seg - > origin ) /* snap and thin */
raid_seg_error ( " non-zero origin LV " ) ;
if ( seg - > cow ) /* snap */
raid_seg_error ( " non-zero cow LV " ) ;
if ( ! dm_list_empty ( & seg - > origin_list ) ) /* snap */
raid_seg_error ( " non-zero origin_list " ) ;
/* .... more members? */
}
2018-11-01 01:05:08 +03:00
static void _check_raid_sublvs ( struct lv_segment * seg , int * error_count )
{
unsigned s ;
for ( s = 0 ; s < seg - > area_count ; s + + ) {
if ( seg_type ( seg , s ) ! = AREA_LV )
raid_seg_error ( " no raid image SubLV " ) ;
if ( ( seg_lv ( seg , s ) - > status & LVM_WRITE ) & &
! ( seg - > lv - > status & LV_ACTIVATION_SKIP ) & &
lv_is_visible ( seg_lv ( seg , s ) ) )
raid_seg_error ( " visible raid image LV " ) ;
if ( ! seg_is_raid_with_meta ( seg ) | | ! seg - > meta_areas )
continue ;
if ( seg_metatype ( seg , s ) ! = AREA_LV )
raid_seg_error ( " no raid meta SubLV " ) ;
else if ( ! ( seg - > lv - > status & LV_ACTIVATION_SKIP ) & &
lv_is_visible ( seg_metalv ( seg , s ) ) )
raid_seg_error ( " visible raid meta LV " ) ;
}
}
2016-07-27 19:17:29 +03:00
/*
2017-05-24 14:47:45 +03:00
* Check RAID segment struct members of @ seg for acceptable
2016-07-27 19:17:29 +03:00
* properties and increment @ error_count for any bogus ones .
*/
static void _check_raid_seg ( struct lv_segment * seg , int * error_count )
{
uint32_t area_len , s ;
/* General checks applying to all RAIDs */
if ( ! seg - > area_count )
raid_seg_error ( " zero area count " ) ;
if ( ! seg - > areas )
raid_seg_error ( " zero areas " ) ;
2017-02-24 02:50:00 +03:00
if ( seg - > extents_copied > seg - > len )
2016-07-28 00:09:54 +03:00
raid_seg_error_val ( " extents_copied too large " , seg - > extents_copied ) ;
2016-08-12 20:14:28 +03:00
/* Default < 10, change once raid1 split shift and rename SubLVs works! */
if ( seg_is_raid1 ( seg ) ) {
if ( seg - > area_count > DEFAULT_RAID1_MAX_IMAGES ) {
log_error ( " LV %s invalid: maximum supported areas %u (is %u) for %s segment " ,
seg - > lv - > name , DEFAULT_RAID1_MAX_IMAGES , seg - > area_count , lvseg_name ( seg ) ) ;
if ( ( * error_count ) + + > ERROR_MAX )
return ;
}
} else if ( seg - > area_count > DEFAULT_RAID_MAX_IMAGES ) {
2016-07-27 19:17:29 +03:00
log_error ( " LV %s invalid: maximum supported areas %u (is %u) for %s segment " ,
2016-08-12 20:14:28 +03:00
seg - > lv - > name , DEFAULT_RAID_MAX_IMAGES , seg - > area_count , lvseg_name ( seg ) ) ;
2016-07-27 19:17:29 +03:00
if ( ( * error_count ) + + > ERROR_MAX )
return ;
}
/* FIXME: should we check any non-RAID segment struct members at all? */
_check_non_raid_seg_members ( seg , error_count ) ;
/* Check for any DataLV flaws like non-existing ones or size variations */
for ( area_len = s = 0 ; s < seg - > area_count ; s + + ) {
if ( seg_type ( seg , s ) ! = AREA_LV )
raid_seg_error ( " no DataLV " ) ;
if ( ! lv_is_raid_image ( seg_lv ( seg , s ) ) )
raid_seg_error ( " DataLV without RAID image flag " ) ;
if ( area_len & &
area_len ! = seg_lv ( seg , s ) - > le_count ) {
raid_seg_error_val ( " DataLV size variations " ,
seg_lv ( seg , s ) - > le_count ) ;
} else
area_len = seg_lv ( seg , s ) - > le_count ;
}
/* Check for any MetaLV flaws like non-existing ones or size variations */
if ( seg - > meta_areas )
for ( area_len = s = 0 ; s < seg - > area_count ; s + + ) {
2018-11-01 01:05:08 +03:00
if ( seg_metatype ( seg , s ) = = AREA_UNASSIGNED )
continue ;
2016-08-04 23:13:36 +03:00
if ( seg_metatype ( seg , s ) ! = AREA_LV ) {
2016-07-27 19:17:29 +03:00
raid_seg_error ( " no MetaLV " ) ;
2016-08-04 23:13:36 +03:00
continue ;
}
2018-11-01 01:05:08 +03:00
2016-07-27 19:17:29 +03:00
if ( ! lv_is_raid_metadata ( seg_metalv ( seg , s ) ) )
raid_seg_error ( " MetaLV without RAID metadata flag " ) ;
if ( area_len & &
area_len ! = seg_metalv ( seg , s ) - > le_count ) {
raid_seg_error_val ( " MetaLV size variations " ,
seg_metalv ( seg , s ) - > le_count ) ;
} else
area_len = seg_metalv ( seg , s ) - > le_count ;
}
/* END: general checks applying to all RAIDs */
/* Specific segment type checks from here on */
if ( seg_is_any_raid0 ( seg ) )
_check_raid0_seg ( seg , error_count ) ;
else if ( seg_is_raid1 ( seg ) )
_check_raid1_seg ( seg , error_count ) ;
else if ( seg_is_raid4 ( seg ) | |
seg_is_any_raid5 ( seg ) | |
2016-07-28 00:14:46 +03:00
seg_is_any_raid6 ( seg ) | |
2016-07-27 19:17:29 +03:00
seg_is_raid10 ( seg ) )
_check_raid45610_seg ( seg , error_count ) ;
else
raid_seg_error ( " bogus RAID segment type " ) ;
2018-11-01 01:05:08 +03:00
_check_raid_sublvs ( seg , error_count ) ;
2016-07-27 19:17:29 +03:00
}
/* END: RAID segment property checks. */
2016-12-20 17:59:11 +03:00
static void _check_lv_segment ( struct logical_volume * lv , struct lv_segment * seg ,
unsigned seg_count , int * error_count )
{
struct lv_segment * seg2 ;
2018-08-17 23:45:52 +03:00
struct lv_segment * cache_setting_seg = NULL ;
int no_metadata_format = 0 ;
2016-12-20 17:59:11 +03:00
if ( lv_is_mirror_image ( lv ) & &
( ! ( seg2 = find_mirror_seg ( seg ) ) | | ! seg_is_mirrored ( seg2 ) ) )
seg_error ( " mirror image is not mirrored " ) ;
if ( seg_is_cache ( seg ) ) {
if ( ! lv_is_cache ( lv ) )
seg_error ( " is not flagged as cache LV " ) ;
if ( ! seg - > pool_lv ) {
seg_error ( " is missing cache pool LV " ) ;
2019-01-30 18:55:34 +03:00
} else if ( ! lv_is_cache_pool ( seg - > pool_lv ) & & ! lv_is_cache_vol ( seg - > pool_lv ) )
2016-12-20 17:59:11 +03:00
seg_error ( " is not referencing cache pool LV " ) ;
} else { /* !cache */
if ( seg - > cleaner_policy )
seg_error ( " sets cleaner_policy " ) ;
}
2019-01-30 18:55:34 +03:00
if ( lv_is_cache ( lv ) & & seg - > pool_lv & & lv_is_cache_vol ( seg - > pool_lv ) ) {
2018-08-17 23:45:52 +03:00
cache_setting_seg = seg ;
no_metadata_format = 1 ;
}
else if ( lv_is_cache_pool ( lv ) )
cache_setting_seg = seg ;
if ( cache_setting_seg ) {
if ( ! dm_list_empty ( & cache_setting_seg - > lv - > segs_using_this_lv ) ) {
switch ( cache_setting_seg - > cache_metadata_format ) {
2017-02-26 23:22:43 +03:00
case CACHE_METADATA_FORMAT_2 :
case CACHE_METADATA_FORMAT_1 :
break ;
default :
seg_error ( " has invalid cache metadata format " ) ;
}
2018-08-17 23:45:52 +03:00
switch ( cache_setting_seg - > cache_mode ) {
2016-12-20 17:59:11 +03:00
case CACHE_MODE_WRITETHROUGH :
case CACHE_MODE_WRITEBACK :
case CACHE_MODE_PASSTHROUGH :
break ;
default :
2018-04-19 18:35:48 +03:00
seg_error ( " has invalid cache's feature flag " ) ;
2016-12-20 17:59:11 +03:00
}
2018-08-17 23:45:52 +03:00
if ( ! cache_setting_seg - > policy_name )
2016-12-20 17:59:11 +03:00
seg_error ( " is missing cache policy name " ) ;
}
2018-08-17 23:45:52 +03:00
if ( ! validate_cache_chunk_size ( lv - > vg - > cmd , cache_setting_seg - > chunk_size ) )
2017-03-05 19:41:16 +03:00
seg_error ( " has invalid chunk size. " ) ;
2018-08-17 23:45:52 +03:00
if ( cache_setting_seg - > lv - > status & LV_METADATA_FORMAT ) {
if ( cache_setting_seg - > cache_metadata_format ! = CACHE_METADATA_FORMAT_2 )
2017-02-26 23:22:43 +03:00
seg_error ( " sets METADATA_FORMAT flag " ) ;
2018-08-17 23:45:52 +03:00
}
if ( ! no_metadata_format & &
( cache_setting_seg - > cache_metadata_format = = CACHE_METADATA_FORMAT_2 ) & &
! ( cache_setting_seg - > lv - > status & LV_METADATA_FORMAT ) )
2017-02-26 23:22:43 +03:00
seg_error ( " is missing METADATA_FORMAT flag " ) ;
2018-08-17 23:45:52 +03:00
} else {
2017-02-26 23:22:43 +03:00
if ( seg - > cache_metadata_format )
seg_error ( " sets cache metadata format " ) ;
2016-12-20 17:59:11 +03:00
if ( seg - > cache_mode )
seg_error ( " sets cache mode " ) ;
if ( seg - > policy_name )
seg_error ( " sets policy name " ) ;
if ( seg - > policy_settings )
seg_error ( " sets policy settings " ) ;
2017-02-26 23:22:43 +03:00
if ( seg - > lv - > status & LV_METADATA_FORMAT )
seg_error ( " sets METADATA_FORMAT flag " ) ;
2016-12-20 17:59:11 +03:00
}
if ( ! seg_can_error_when_full ( seg ) & & lv_is_error_when_full ( lv ) )
seg_error ( " does not support flag ERROR_WHEN_FULL. " ) ;
if ( seg_is_mirrored ( seg ) ) {
/* Check mirror log - which is attached to the mirrored seg */
if ( seg - > log_lv ) {
if ( ! lv_is_mirror_log ( seg - > log_lv ) )
seg_error ( " log LV is not a mirror log " ) ;
if ( ! ( seg2 = first_seg ( seg - > log_lv ) ) | | ( find_mirror_seg ( seg2 ) ! = seg ) )
seg_error ( " log LV does not point back to mirror segment " ) ;
}
2018-04-19 18:38:04 +03:00
if ( seg_is_mirror ( seg ) ) {
if ( ! seg - > region_size )
seg_error ( " region size is zero " ) ;
else if ( seg - > region_size > seg - > lv - > size )
seg_error ( " region size is bigger then LV itself " ) ;
else if ( ! is_power_of_2 ( seg - > region_size ) )
seg_error ( " region size is non power of 2 " ) ;
}
2016-12-20 17:59:11 +03:00
} else { /* !mirrored */
if ( seg - > log_lv ) {
if ( lv_is_raid_image ( lv ) )
seg_error ( " log LV is not a mirror log or a RAID image " ) ;
}
}
if ( seg_is_raid ( seg ) )
_check_raid_seg ( seg , error_count ) ;
2017-11-15 23:24:44 +03:00
else if ( ! lv_is_raid_type ( lv ) & &
_check_raid_seg_reshape_flags ( seg ) )
seg_error ( " reshape " ) ;
2016-12-20 17:59:11 +03:00
if ( seg_is_pool ( seg ) ) {
if ( ( seg - > area_count ! = 1 ) | | ( seg_type ( seg , 0 ) ! = AREA_LV ) ) {
seg_error ( " is missing a pool data LV " ) ;
} else if ( ! ( seg2 = first_seg ( seg_lv ( seg , 0 ) ) ) | | ( find_pool_seg ( seg2 ) ! = seg ) )
seg_error ( " data LV does not refer back to pool LV " ) ;
if ( ! seg - > metadata_lv ) {
seg_error ( " is missing a pool metadata LV " ) ;
} else if ( ! ( seg2 = first_seg ( seg - > metadata_lv ) ) | | ( find_pool_seg ( seg2 ) ! = seg ) )
seg_error ( " metadata LV does not refer back to pool LV " ) ;
} else { /* !thin_pool && !cache_pool */
if ( seg - > metadata_lv )
seg_error ( " must not have pool metadata LV set " ) ;
}
if ( seg_is_thin_pool ( seg ) ) {
if ( ! lv_is_thin_pool ( lv ) )
seg_error ( " is not flagged as thin pool LV " ) ;
if ( lv_is_thin_volume ( lv ) )
seg_error ( " is a thin volume that must not contain thin pool segment " ) ;
2017-03-05 19:41:16 +03:00
if ( ! validate_thin_pool_chunk_size ( lv - > vg - > cmd , seg - > chunk_size ) )
seg_error ( " has invalid chunk size. " ) ;
2017-03-03 22:46:13 +03:00
if ( seg - > zero_new_blocks ! = THIN_ZERO_YES & &
seg - > zero_new_blocks ! = THIN_ZERO_NO )
seg_error ( " zero_new_blocks is invalid " ) ;
2016-12-20 17:59:11 +03:00
} else { /* !thin_pool */
2017-03-03 22:46:13 +03:00
if ( seg - > zero_new_blocks ! = THIN_ZERO_UNSELECTED )
2016-12-20 17:59:11 +03:00
seg_error ( " sets zero_new_blocks " ) ;
2017-03-03 22:46:13 +03:00
if ( seg - > discards ! = THIN_DISCARDS_UNSELECTED )
2016-12-20 17:59:11 +03:00
seg_error ( " sets discards " ) ;
if ( ! dm_list_empty ( & seg - > thin_messages ) )
seg_error ( " sets thin_messages list " ) ;
}
if ( seg_is_thin_volume ( seg ) ) {
if ( ! lv_is_thin_volume ( lv ) )
seg_error ( " is not flagged as thin volume LV " ) ;
if ( lv_is_thin_pool ( lv ) )
seg_error ( " is a thin pool that must not contain thin volume segment " ) ;
if ( ! seg - > pool_lv ) {
seg_error ( " is missing thin pool LV " ) ;
} else if ( ! lv_is_thin_pool ( seg - > pool_lv ) )
seg_error ( " is not referencing thin pool LV " ) ;
if ( seg - > device_id > DM_THIN_MAX_DEVICE_ID )
seg_error ( " has too large device id " ) ;
if ( seg - > external_lv & &
! lv_is_external_origin ( seg - > external_lv ) )
seg_error ( " external LV is not flagged as a external origin LV " ) ;
if ( seg - > merge_lv ) {
if ( ! lv_is_thin_volume ( seg - > merge_lv ) )
seg_error ( " merge LV is not flagged as a thin LV " ) ;
if ( ! lv_is_merging_origin ( seg - > merge_lv ) )
seg_error ( " merge LV is not flagged as merging " ) ;
}
} else { /* !thin */
if ( seg - > device_id )
seg_error ( " sets device_id " ) ;
if ( seg - > external_lv )
seg_error ( " sets external LV " ) ;
if ( seg - > merge_lv )
seg_error ( " sets merge LV " ) ;
if ( seg - > indirect_origin )
seg_error ( " sets indirect_origin LV " ) ;
}
2018-06-29 12:13:43 +03:00
if ( seg_is_vdo_pool ( seg ) ) {
if ( ! lv_is_vdo_pool ( lv ) )
seg_error ( " is not flagged as VDO pool LV " ) ;
if ( ( seg - > area_count ! = 1 ) | | ( seg_type ( seg , 0 ) ! = AREA_LV ) ) {
seg_error ( " is missing a VDO pool data LV " ) ;
} else if ( ! lv_is_vdo_pool_data ( seg_lv ( seg , 0 ) ) )
seg_error ( " is not VDO pool data LV " ) ;
} else { /* !VDO pool */
if ( seg - > vdo_pool_header_size )
seg_error ( " sets vdo_pool_header_size " ) ;
if ( seg - > vdo_pool_virtual_extents )
seg_error ( " sets vdo_pool_virtual_extents " ) ;
}
if ( seg_is_vdo ( seg ) ) {
if ( ! lv_is_vdo ( lv ) )
seg_error ( " is not flagged as VDO LV " ) ;
if ( ! seg_lv ( seg , 0 ) )
seg_error ( " is missing VDO pool LV " ) ;
else if ( ! lv_is_vdo_pool ( seg_lv ( seg , 0 ) ) )
seg_error ( " is not referencing VDO pool LV " ) ;
}
2016-12-20 17:59:11 +03:00
/* Some multi-seg vars excluded here */
if ( ! seg_is_cache ( seg ) & &
! seg_is_thin_volume ( seg ) ) {
if ( seg - > pool_lv )
seg_error ( " sets pool LV " ) ;
}
if ( ! seg_is_pool ( seg ) & &
2016-12-23 14:40:40 +03:00
/* FIXME: format_pool/import_export.c _add_linear_seg() sets chunk_size */
! seg_is_linear ( seg ) & &
2018-08-17 23:45:52 +03:00
! seg_is_snapshot ( seg ) & &
! seg_is_cache ( seg ) ) {
2016-12-20 17:59:11 +03:00
if ( seg - > chunk_size )
seg_error ( " sets chunk_size " ) ;
}
if ( ! seg_is_thin_pool ( seg ) & &
! seg_is_thin_volume ( seg ) ) {
if ( seg - > transaction_id )
seg_error ( " sets transaction_id " ) ;
}
if ( ! seg_unknown ( seg ) ) {
if ( seg - > segtype_private )
seg_error ( " set segtype_private " ) ;
}
}
2003-09-01 23:55:16 +04:00
/*
* Verify that an LV ' s segments are consecutive , complete and don ' t overlap .
*/
2005-10-28 01:51:28 +04:00
int check_lv_segments ( struct logical_volume * lv , int complete_vg )
2002-01-11 02:21:07 +03:00
{
2005-10-28 01:51:28 +04:00
struct lv_segment * seg , * seg2 ;
2003-09-01 23:55:16 +04:00
uint32_t le = 0 ;
2016-12-20 17:59:11 +03:00
unsigned seg_count = 0 , seg_found , external_lv_found = 0 ;
2017-02-24 02:50:00 +03:00
uint32_t data_rimage_count , s ;
2008-01-16 22:00:59 +03:00
struct seg_list * sl ;
2016-03-01 17:32:01 +03:00
struct glv_list * glvl ;
2010-04-01 16:14:20 +04:00
int error_count = 0 ;
2003-09-01 23:55:16 +04:00
2016-12-20 17:59:11 +03:00
dm_list_iterate_items ( seg , & lv - > segments ) {
seg_count + + ;
2011-09-08 20:41:18 +04:00
2016-12-20 17:59:11 +03:00
if ( seg - > lv ! = lv ) {
log_error ( " LV %s invalid: segment %u is referencing different LV. " ,
lv - > name , seg_count ) ;
2011-09-08 20:41:18 +04:00
inc_error_count ;
}
2003-09-01 23:55:16 +04:00
if ( seg - > le ! = le ) {
log_error ( " LV %s invalid: segment %u should begin at "
" LE % " PRIu32 " (found % " PRIu32 " ). " ,
lv - > name , seg_count , le , seg - > le ) ;
2010-04-01 16:14:20 +04:00
inc_error_count ;
2005-06-01 20:51:55 +04:00
}
2017-02-24 02:50:00 +03:00
data_rimage_count = seg - > area_count - seg - > segtype - > parity_devs ;
/* FIXME: raid varies seg->area_len? */
if ( seg - > len ! = seg - > area_len & &
seg - > len ! = seg - > area_len * data_rimage_count ) {
log_error ( " LV %s: segment %u with len=%u "
" has inconsistent area_len %u " ,
lv - > name , seg_count , seg - > len , seg - > area_len ) ;
2010-04-01 16:14:20 +04:00
inc_error_count ;
2015-01-13 17:23:03 +03:00
}
2007-11-07 19:33:12 +03:00
if ( seg_is_snapshot ( seg ) ) {
if ( seg - > cow & & seg - > cow = = seg - > origin ) {
log_error ( " LV %s: segment %u has same LV %s for "
" both origin and snapshot " ,
lv - > name , seg_count , seg - > cow - > name ) ;
2010-04-01 16:14:20 +04:00
inc_error_count ;
2007-11-07 19:33:12 +03:00
}
}
2016-12-20 17:59:11 +03:00
if ( complete_vg )
_check_lv_segment ( lv , seg , seg_count , & error_count ) ;
2005-06-01 20:51:55 +04:00
for ( s = 0 ; s < seg - > area_count ; s + + ) {
2005-06-14 21:54:48 +04:00
if ( seg_type ( seg , s ) = = AREA_UNASSIGNED ) {
log_error ( " LV %s: segment %u has unassigned "
" area %u. " ,
lv - > name , seg_count , s ) ;
2010-04-01 16:14:20 +04:00
inc_error_count ;
2005-06-14 21:54:48 +04:00
} else if ( seg_type ( seg , s ) = = AREA_PV ) {
2005-06-01 20:51:55 +04:00
if ( ! seg_pvseg ( seg , s ) | |
seg_pvseg ( seg , s ) - > lvseg ! = seg | |
seg_pvseg ( seg , s ) - > lv_area ! = s ) {
log_error ( " LV %s: segment %u has "
" inconsistent PV area %u " ,
lv - > name , seg_count , s ) ;
2010-04-01 16:14:20 +04:00
inc_error_count ;
2005-06-01 20:51:55 +04:00
}
} else {
if ( ! seg_lv ( seg , s ) | |
seg_lv ( seg , s ) - > vg ! = lv - > vg | |
seg_lv ( seg , s ) = = lv ) {
log_error ( " LV %s: segment %u has "
" inconsistent LV area %u " ,
lv - > name , seg_count , s ) ;
2010-04-01 16:14:20 +04:00
inc_error_count ;
2005-06-01 20:51:55 +04:00
}
2005-10-27 23:58:22 +04:00
2005-10-28 01:51:28 +04:00
if ( complete_vg & & seg_lv ( seg , s ) & &
2014-09-16 00:33:53 +04:00
lv_is_mirror_image ( seg_lv ( seg , s ) ) & &
2007-07-10 22:50:03 +04:00
( ! ( seg2 = find_seg_by_le ( seg_lv ( seg , s ) ,
seg_le ( seg , s ) ) ) | |
2008-01-16 22:00:59 +03:00
find_mirror_seg ( seg2 ) ! = seg ) ) {
2005-10-27 23:58:22 +04:00
log_error ( " LV %s: segment %u mirror "
" image %u missing mirror ptr " ,
lv - > name , seg_count , s ) ;
2010-04-01 16:14:20 +04:00
inc_error_count ;
2005-10-27 23:58:22 +04:00
}
2005-06-14 21:54:48 +04:00
/* FIXME I don't think this ever holds?
2005-06-01 20:51:55 +04:00
if ( seg_le ( seg , s ) ! = le ) {
log_error ( " LV %s: segment %u has "
" inconsistent LV area %u "
" size " ,
lv - > name , seg_count , s ) ;
2010-04-01 16:14:20 +04:00
inc_error_count ;
2005-06-01 20:51:55 +04:00
}
2005-06-14 21:54:48 +04:00
*/
2008-01-16 22:00:59 +03:00
seg_found = 0 ;
2008-11-04 01:14:30 +03:00
dm_list_iterate_items ( sl , & seg_lv ( seg , s ) - > segs_using_this_lv )
2008-01-16 22:00:59 +03:00
if ( sl - > seg = = seg )
seg_found + + ;
2011-08-03 02:07:20 +04:00
2008-01-16 22:00:59 +03:00
if ( ! seg_found ) {
2012-03-12 18:41:42 +04:00
log_error ( " LV %s segment %u uses LV %s, "
2008-01-16 22:00:59 +03:00
" but missing ptr from %s to %s " ,
lv - > name , seg_count ,
seg_lv ( seg , s ) - > name ,
seg_lv ( seg , s ) - > name , lv - > name ) ;
2010-04-01 16:14:20 +04:00
inc_error_count ;
2008-01-16 22:00:59 +03:00
} else if ( seg_found > 1 ) {
log_error ( " LV %s has duplicated links "
2012-03-12 18:41:42 +04:00
" to LV %s segment %u " ,
2008-01-16 22:00:59 +03:00
seg_lv ( seg , s ) - > name ,
lv - > name , seg_count ) ;
2010-04-01 16:14:20 +04:00
inc_error_count ;
2008-01-16 22:00:59 +03:00
}
2005-06-01 20:51:55 +04:00
}
2011-06-09 23:36:16 +04:00
2011-08-03 02:07:20 +04:00
if ( complete_vg & &
seg_is_mirrored ( seg ) & & ! seg_is_raid ( seg ) & &
2011-06-09 23:36:16 +04:00
seg_type ( seg , s ) = = AREA_LV & &
seg_lv ( seg , s ) - > le_count ! = seg - > area_len ) {
log_error ( " LV %s: mirrored LV segment %u has "
" wrong size %u (should be %u). " ,
lv - > name , s , seg_lv ( seg , s ) - > le_count ,
seg - > area_len ) ;
inc_error_count ;
}
2003-09-01 23:55:16 +04:00
}
le + = seg - > len ;
}
2016-12-20 17:59:11 +03:00
if ( le ! = lv - > le_count ) {
log_error ( " LV %s: inconsistent LE count %u != %u " ,
lv - > name , le , lv - > le_count ) ;
inc_error_count ;
}
2017-10-30 16:34:30 +03:00
if ( ! le ) {
log_error ( " LV %s: has no segment. " , lv - > name ) ;
inc_error_count ;
}
2008-11-04 01:14:30 +03:00
dm_list_iterate_items ( sl , & lv - > segs_using_this_lv ) {
2008-01-16 22:00:59 +03:00
seg = sl - > seg ;
seg_found = 0 ;
for ( s = 0 ; s < seg - > area_count ; s + + ) {
if ( seg_type ( seg , s ) ! = AREA_LV )
continue ;
if ( lv = = seg_lv ( seg , s ) )
seg_found + + ;
2017-02-03 22:39:40 +03:00
if ( seg - > meta_areas & & seg_is_raid_with_meta ( seg ) & & ( lv = = seg_metalv ( seg , s ) ) )
2011-08-03 02:07:20 +04:00
seg_found + + ;
2008-01-16 22:00:59 +03:00
}
if ( seg - > log_lv = = lv )
seg_found + + ;
2018-08-27 22:53:09 +03:00
if ( seg - > metadata_lv = = lv | | seg - > pool_lv = = lv | | seg - > writecache = = lv )
2011-09-08 20:41:18 +04:00
seg_found + + ;
2013-02-21 13:25:44 +04:00
if ( seg_is_thin_volume ( seg ) & & ( seg - > origin = = lv | | seg - > external_lv = = lv ) )
2011-11-07 15:03:47 +04:00
seg_found + + ;
2016-05-24 02:57:48 +03:00
2008-01-16 22:00:59 +03:00
if ( ! seg_found ) {
2008-01-26 03:30:28 +03:00
log_error ( " LV %s is used by LV %s:% " PRIu32 " -% " PRIu32
" , but missing ptr from %s to %s " ,
2008-01-16 22:00:59 +03:00
lv - > name , seg - > lv - > name , seg - > le ,
2008-01-26 03:30:28 +03:00
seg - > le + seg - > len - 1 ,
2008-01-16 22:00:59 +03:00
seg - > lv - > name , lv - > name ) ;
2010-04-01 16:14:20 +04:00
inc_error_count ;
2008-01-16 22:00:59 +03:00
} else if ( seg_found ! = sl - > count ) {
2012-03-12 18:41:42 +04:00
log_error ( " Reference count mismatch: LV %s has %u "
2008-01-26 03:30:28 +03:00
" links to LV %s:% " PRIu32 " -% " PRIu32
2012-03-12 18:41:42 +04:00
" , which has %u links " ,
2008-01-26 03:30:28 +03:00
lv - > name , sl - > count , seg - > lv - > name , seg - > le ,
seg - > le + seg - > len - 1 , seg_found ) ;
2010-04-01 16:14:20 +04:00
inc_error_count ;
2008-01-16 22:00:59 +03:00
}
2008-02-22 16:22:44 +03:00
seg_found = 0 ;
2008-11-04 01:14:30 +03:00
dm_list_iterate_items ( seg2 , & seg - > lv - > segments )
2016-05-24 02:57:48 +03:00
if ( seg = = seg2 ) {
2008-02-22 16:22:44 +03:00
seg_found + + ;
break ;
}
2016-05-24 02:57:48 +03:00
2008-02-22 16:22:44 +03:00
if ( ! seg_found ) {
log_error ( " LV segment %s:% " PRIu32 " -% " PRIu32
2010-03-31 16:06:30 +04:00
" is incorrectly listed as being used by LV %s " ,
2008-02-22 16:22:44 +03:00
seg - > lv - > name , seg - > le , seg - > le + seg - > len - 1 ,
lv - > name ) ;
2010-04-01 16:14:20 +04:00
inc_error_count ;
2016-03-01 17:32:01 +03:00
}
2016-12-20 17:59:11 +03:00
/* Validation of external origin counter */
if ( seg - > external_lv = = lv )
external_lv_found + + ;
2016-03-01 17:32:01 +03:00
}
dm_list_iterate_items ( glvl , & lv - > indirect_glvs ) {
if ( glvl - > glv - > is_historical ) {
if ( glvl - > glv - > historical - > indirect_origin ! = lv - > this_glv ) {
log_error ( " LV %s is indirectly used by historical LV %s "
" but that historical LV does not point back to LV %s " ,
lv - > name , glvl - > glv - > historical - > name , lv - > name ) ;
inc_error_count ;
}
} else {
if ( ! ( seg = first_seg ( glvl - > glv - > live ) ) | |
seg - > indirect_origin ! = lv - > this_glv ) {
log_error ( " LV %s is indirectly used by LV %s "
" but that LV does not point back to LV %s " ,
lv - > name , glvl - > glv - > live - > name , lv - > name ) ;
inc_error_count ;
}
2008-02-22 16:22:44 +03:00
}
2008-01-16 22:00:59 +03:00
}
2016-12-20 17:59:11 +03:00
/* Check LV flags match first segment type */
if ( complete_vg ) {
if ( ( seg_count ! = 1 ) & &
( lv_is_cache ( lv ) | |
lv_is_cache_pool ( lv ) | |
lv_is_raid ( lv ) | |
lv_is_snapshot ( lv ) | |
lv_is_thin_pool ( lv ) | |
lv_is_thin_volume ( lv ) ) ) {
log_error ( " LV %s must have exactly one segment. " ,
lv - > name ) ;
inc_error_count ;
}
if ( lv_is_pool_data ( lv ) & &
( ! ( seg2 = first_seg ( lv ) ) | | ! ( seg2 = find_pool_seg ( seg2 ) ) | |
seg2 - > area_count ! = 1 | | seg_type ( seg2 , 0 ) ! = AREA_LV | |
seg_lv ( seg2 , 0 ) ! = lv ) ) {
log_error ( " LV %s: segment 1 pool data LV does not point back to same LV " ,
lv - > name ) ;
inc_error_count ;
}
if ( lv_is_thin_pool_metadata ( lv ) & & ! strstr ( lv - > name , " _tmeta " ) ) {
log_error ( " LV %s: thin pool metadata LV does not use _tmeta. " ,
lv - > name ) ;
inc_error_count ;
} else if ( lv_is_cache_pool_metadata ( lv ) & & ! strstr ( lv - > name , " _cmeta " ) ) {
log_error ( " LV %s: cache pool metadata LV does not use _cmeta. " ,
lv - > name ) ;
inc_error_count ;
}
if ( lv_is_external_origin ( lv ) ) {
if ( lv - > external_count ! = external_lv_found ) {
log_error ( " LV %s: external origin count does not match. " ,
lv - > name ) ;
inc_error_count ;
}
if ( lv - > status & LVM_WRITE ) {
log_error ( " LV %s: external origin cant't be writable. " ,
lv - > name ) ;
inc_error_count ;
}
}
2005-06-01 20:51:55 +04:00
}
2010-04-01 16:14:20 +04:00
out :
return ! error_count ;
2002-01-11 02:21:07 +03:00
}
2003-09-01 23:55:16 +04:00
2003-09-15 22:22:50 +04:00
/*
* Split the supplied segment at the supplied logical extent
2004-08-18 02:09:02 +04:00
* NB Use LE numbering that works across stripes PV1 : 0 , 2 , 4 PV2 : 1 , 3 , 5 etc .
2003-09-15 22:22:50 +04:00
*/
static int _lv_split_segment ( struct logical_volume * lv , struct lv_segment * seg ,
uint32_t le )
{
struct lv_segment * split_seg ;
uint32_t s ;
uint32_t offset = le - seg - > le ;
2004-08-18 02:09:02 +04:00
uint32_t area_offset ;
2003-09-15 22:22:50 +04:00
2005-05-09 20:59:01 +04:00
if ( ! seg_can_split ( seg ) ) {
2004-05-05 01:25:57 +04:00
log_error ( " Unable to split the %s segment at LE % " PRIu32
2014-10-20 20:40:39 +04:00
" in LV %s " , lvseg_name ( seg ) , le , lv - > name ) ;
2003-09-15 22:22:50 +04:00
return 0 ;
}
/* Clone the existing segment */
2011-10-23 20:02:01 +04:00
if ( ! ( split_seg = alloc_lv_segment ( seg - > segtype ,
2017-02-24 02:50:00 +03:00
seg - > lv , seg - > le , seg - > len , seg - > reshape_len ,
2005-04-22 19:44:00 +04:00
seg - > status , seg - > stripe_size ,
2014-10-26 10:13:59 +03:00
seg - > log_lv ,
2017-02-24 02:50:00 +03:00
seg - > area_count , seg - > area_len , seg - > data_copies ,
2005-06-01 20:51:55 +04:00
seg - > chunk_size , seg - > region_size ,
2010-04-08 04:28:57 +04:00
seg - > extents_copied , seg - > pvmove_source_seg ) ) ) {
2005-04-22 19:44:00 +04:00
log_error ( " Couldn't allocate cloned LV segment. " ) ;
2003-09-15 22:22:50 +04:00
return 0 ;
}
2010-03-31 21:23:18 +04:00
if ( ! str_list_dup ( lv - > vg - > vgmem , & split_seg - > tags , & seg - > tags ) ) {
2004-03-08 20:19:15 +03:00
log_error ( " LV segment tags duplication failed " ) ;
return 0 ;
}
2003-09-15 22:22:50 +04:00
/* In case of a striped segment, the offset has to be / stripes */
2004-08-18 02:09:02 +04:00
area_offset = offset ;
2005-05-09 20:59:01 +04:00
if ( seg_is_striped ( seg ) )
2004-08-18 02:09:02 +04:00
area_offset / = seg - > area_count ;
2003-09-15 22:22:50 +04:00
2005-05-03 21:28:23 +04:00
split_seg - > area_len - = area_offset ;
seg - > area_len = area_offset ;
split_seg - > len - = offset ;
seg - > len = offset ;
split_seg - > le = seg - > le + seg - > len ;
2003-09-15 22:22:50 +04:00
/* Adjust the PV mapping */
for ( s = 0 ; s < seg - > area_count ; s + + ) {
2005-06-01 20:51:55 +04:00
seg_type ( split_seg , s ) = seg_type ( seg , s ) ;
2005-05-03 21:28:23 +04:00
2003-09-15 22:22:50 +04:00
/* Split area at the offset */
2005-06-01 20:51:55 +04:00
switch ( seg_type ( seg , s ) ) {
2003-09-15 22:22:50 +04:00
case AREA_LV :
2008-01-16 22:00:59 +03:00
if ( ! set_lv_segment_area_lv ( split_seg , s , seg_lv ( seg , s ) ,
seg_le ( seg , s ) + seg - > area_len , 0 ) )
return_0 ;
2013-01-08 02:30:29 +04:00
log_debug_alloc ( " Split %s:%u[%u] at %u: %s LE %u " , lv - > name ,
seg - > le , s , le , seg_lv ( seg , s ) - > name ,
seg_le ( split_seg , s ) ) ;
2003-09-15 22:22:50 +04:00
break ;
case AREA_PV :
2005-07-12 23:40:59 +04:00
if ( ! ( seg_pvseg ( split_seg , s ) =
assign_peg_to_lvseg ( seg_pv ( seg , s ) ,
2005-06-01 20:51:55 +04:00
seg_pe ( seg , s ) +
2005-05-03 21:28:23 +04:00
seg - > area_len ,
2005-06-01 20:51:55 +04:00
seg_pvseg ( seg , s ) - > len -
2005-05-03 21:28:23 +04:00
seg - > area_len ,
2008-01-30 16:19:47 +03:00
split_seg , s ) ) )
return_0 ;
2013-01-08 02:30:29 +04:00
log_debug_alloc ( " Split %s:%u[%u] at %u: %s PE %u " , lv - > name ,
seg - > le , s , le ,
dev_name ( seg_dev ( seg , s ) ) ,
seg_pe ( split_seg , s ) ) ;
2003-09-15 22:22:50 +04:00
break ;
2005-06-14 21:54:48 +04:00
case AREA_UNASSIGNED :
log_error ( " Unassigned area %u found in segment " , s ) ;
2003-09-15 22:22:50 +04:00
return 0 ;
}
}
/* Add split off segment to the list _after_ the original one */
2008-11-04 01:14:30 +03:00
dm_list_add_h ( & seg - > list , & split_seg - > list ) ;
2003-09-15 22:22:50 +04:00
return 1 ;
}
/*
* Ensure there ' s a segment boundary at the given logical extent
*/
int lv_split_segment ( struct logical_volume * lv , uint32_t le )
{
struct lv_segment * seg ;
if ( ! ( seg = find_seg_by_le ( lv , le ) ) ) {
log_error ( " Segment with extent % " PRIu32 " in LV %s not found " ,
le , lv - > name ) ;
return 0 ;
}
/* This is a segment start already */
if ( le = = seg - > le )
return 1 ;
2008-01-30 16:19:47 +03:00
if ( ! _lv_split_segment ( lv , seg , le ) )
return_0 ;
2003-09-15 22:22:50 +04:00
2008-01-30 16:19:47 +03:00
if ( ! vg_validate ( lv - > vg ) )
return_0 ;
2005-07-12 23:40:59 +04:00
2003-09-15 22:22:50 +04:00
return 1 ;
}
