1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
|
/* GNU ddrescue - Data recovery tool
Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012
Antonio Diaz Diaz.
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 3 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, see <http://www.gnu.org/licenses/>.
*/
#define _FILE_OFFSET_BITS 64
#include <algorithm>
#include <climits>
#include <cstdio>
#include <string>
#include <vector>
#include <stdint.h>
#include "block.h"
#include "ddrescue.h"
namespace {
void input_pos_error( const long long pos, const long long isize )
{
char buf[80];
snprintf( buf, sizeof buf, "can't start reading at pos %lld", pos );
show_error( buf );
snprintf( buf, sizeof buf, "input file is only %lld bytes long", isize );
show_error( buf );
}
} // end namespace
// Align pos to next boundary if size is big enough
//
void Block::align_pos( const int alignment )
{
if( alignment > 1 )
{
const int disp = alignment - ( pos_ % alignment );
if( disp < alignment && disp < size_ )
{ pos_ += disp; size_ -= disp; }
}
}
// Align end to previous boundary if size is big enough
//
void Block::align_end( const int alignment )
{
if( alignment > 1 && size_ > 0 )
{
const long long new_end = end() - ( end() % alignment );
if( pos_ < new_end ) size_ = new_end - pos_;
}
}
void Block::crop( const Block & b )
{
const long long p = std::max( pos_, b.pos_ );
const long long s = std::max( 0LL, std::min( end(), b.end() ) - p );
pos_ = p; size_ = s;
}
bool Block::join( const Block & b )
{
if( this->follows( b ) ) pos_ = b.pos_;
else if( !b.follows( *this ) ) return false;
size_ += b.size_;
if( size_ < 0 || size_ > LLONG_MAX - pos_ )
internal_error( "size overflow joining two Blocks" );
return true;
}
Block Block::split( long long pos, const int hardbs )
{
if( hardbs > 1 ) pos -= pos % hardbs;
if( pos_ < pos && end() > pos )
{
const Block b( pos_, pos - pos_ );
pos_ = pos; size_ -= b.size_;
return b;
}
return Block( 0, 0 );
}
void Domain::crop( const Block & b )
{
for( unsigned i = block_vector.size(); i > 0; )
{
--i;
block_vector[i].crop( b );
if( block_vector[i].size() <= 0 )
block_vector.erase( block_vector.begin() + i );
}
}
bool Domain::crop_by_file_size( const long long isize )
{
if( isize > 0 )
for( unsigned i = 0; i < block_vector.size(); ++i )
{
if( block_vector[i].pos() >= isize )
{
if( i == 0 )
{ input_pos_error( block_vector[i].pos(), isize ); return false; }
block_vector.erase( block_vector.begin() + i, block_vector.end() );
break;
}
if( block_vector[i].end() > isize )
block_vector[i].size( isize - block_vector[i].pos() );
}
return true;
}
|
