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 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359
|
/*********************************************************************/
// dar - disk archive - a backup/restoration program
// Copyright (C) 2002-2020 Denis Corbin
//
// 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.
//
// to contact the author : http://dar.linux.free.fr/email.html
/*********************************************************************/
#include "../my_config.h"
extern "C"
{
// to allow compilation under Cygwin we need <sys/types.h>
// else Cygwin's <netinet/in.h> lack __int16_t symbol !?!
#if HAVE_SYS_TYPES_H
#include <sys/types.h>
#endif
#if HAVE_NETINET_IN_H
#include <netinet/in.h>
#endif
#if HAVE_ARPA_INET_H
#include <arpa/inet.h>
#endif
} // end extern "C"
#include <string>
#include <new>
#include "zapette.hpp"
#include "infinint.hpp"
#include "tools.hpp"
#include "trivial_sar.hpp"
#include "sar.hpp"
#include "zapette_protocol.hpp"
using namespace std;
namespace libdar
{
zapette::zapette(const shared_ptr<user_interaction> & dialog,
generic_file *input,
generic_file *output,
bool by_the_end) : generic_file(gf_read_only), mem_ui(dialog)
{
if(input == nullptr)
throw SRC_BUG;
if(output == nullptr)
throw SRC_BUG;
if(input->get_mode() == gf_write_only)
throw Erange("zapette::zapette", gettext("Cannot read on input"));
if(output->get_mode() == gf_read_only)
throw Erange("zapette::zapette", gettext("Cannot write on output"));
in = input;
out = output;
position = 0;
serial_counter = 0;
contextual::set_info_status(CONTEXT_INIT);
//////////////////////////////
// retreiving the file size
//
S_I tmp = 0;
make_transfert(REQUEST_SIZE_SPECIAL_ORDER, REQUEST_OFFSET_GET_FILESIZE, nullptr, "", tmp, file_size);
//////////////////////////////
// positionning cursor for next read
// depending on the by_the_end value
//
try
{
if(by_the_end)
{
try
{
skip_to_eof();
}
catch(Erange & e)
{
string tmp = e.get_message();
get_ui().printf(gettext("Failed driving dar_slave to the end of archive: %S. Trying to open the archive from the first bytes"), &tmp);
skip(0);
}
}
else
skip(0);
}
catch(...)
{
terminate();
throw;
}
}
zapette::~zapette()
{
try
{
terminate();
}
catch(...)
{
// ignore all exceptions
}
delete in;
delete out;
}
void zapette::inherited_terminate()
{
S_I tmp = 0;
make_transfert(REQUEST_SIZE_SPECIAL_ORDER, REQUEST_OFFSET_END_TRANSMIT, nullptr, "", tmp, file_size);
}
bool zapette::skip(const infinint & pos)
{
if(is_terminated())
throw SRC_BUG;
if(pos >= file_size)
{
position = file_size;
return false;
}
else
{
position = pos;
return true;
}
}
bool zapette::skip_relative(S_I x)
{
if(is_terminated())
throw SRC_BUG;
if(x >= 0)
{
position += x;
if(position > file_size)
{
position = file_size;
return false;
}
else
return true;
}
else
if(infinint(-x) > position)
{
position = 0;
return false;
}
else
{
position -= (-x); // implicit conversion of "-x" to infinint (positive)
return true;
}
}
void zapette::set_info_status(const std::string & s)
{
infinint val;
S_I tmp = 0;
if(is_terminated())
throw SRC_BUG;
make_transfert(REQUEST_SIZE_SPECIAL_ORDER, REQUEST_OFFSET_CHANGE_CONTEXT_STATUS, nullptr, s, tmp, val);
contextual::set_info_status(s);
}
bool zapette::is_an_old_start_end_archive() const
{
infinint val;
S_I tmp = 0;
if(is_terminated())
throw SRC_BUG;
make_transfert(REQUEST_SIZE_SPECIAL_ORDER, REQUEST_IS_OLD_START_END_ARCHIVE, nullptr, "", tmp, val);
return val == 1;
}
const label & zapette::get_data_name() const
{
static label data_name;
infinint arg;
S_I lu = data_name.size(); // used to specify the amount of space allocated for the answer
if(is_terminated())
throw SRC_BUG;
make_transfert(REQUEST_SIZE_SPECIAL_ORDER, REQUEST_GET_DATA_NAME, data_name.data(), "", lu, arg);
if(lu != (S_I)data_name.size())
throw Erange("zapette::get_data_name", gettext("Uncomplete answer received from peer"));
return data_name;
}
infinint zapette::get_first_slice_header_size() const
{
infinint ret;
S_I tmp;
if(is_terminated())
throw SRC_BUG;
make_transfert(REQUEST_SIZE_SPECIAL_ORDER, REQUEST_FIRST_SLICE_HEADER_SIZE, nullptr, "", tmp, ret);
return ret;
}
infinint zapette::get_non_first_slice_header_size() const
{
infinint ret;
S_I tmp = 0;
if(is_terminated())
throw SRC_BUG;
make_transfert(REQUEST_SIZE_SPECIAL_ORDER, REQUEST_OTHER_SLICE_HEADER_SIZE, nullptr, "", tmp, ret);
return ret;
}
U_I zapette::inherited_read(char *a, U_I size)
{
static const U_16 max_short = ~0;
U_I lu = 0;
if(size > 0)
{
infinint not_used;
U_16 pas;
S_I ret;
do
{
if(size - lu > max_short)
pas = max_short;
else
pas = size - lu;
make_transfert(pas, position, a+lu, "", ret, not_used);
position += ret;
lu += ret;
}
while(lu < size && ret != 0);
}
return lu;
}
void zapette::inherited_write(const char *a, U_I size)
{
throw SRC_BUG; // zapette is read-only
}
void zapette::make_transfert(U_16 size, const infinint &offset, char *data, const string & info, S_I & lu, infinint & arg) const
{
request req;
answer ans;
// building the request
req.serial_num = const_cast<char &>(serial_counter)++; // may loopback to 0
req.offset = offset;
req.size = size;
req.info = info;
req.write(out);
if(req.size == REQUEST_SIZE_SPECIAL_ORDER)
size = lu;
// reading the answer
do
{
ans.read(in, data, size);
if(ans.serial_num != req.serial_num)
get_ui().pause(gettext("Communication problem with peer, retry ?"));
}
while(ans.serial_num != req.serial_num);
// argument affectation
switch(ans.type)
{
case ANSWER_TYPE_DATA:
lu = ans.size;
arg = 0;
break;
case ANSWER_TYPE_INFININT:
lu = 0;
arg = ans.arg;
break;
default: // might be a transmission error do to weak transport layer
throw Erange("zapette::make_transfert", gettext("Incoherent answer from peer"));
}
// sanity checks
if(req.size == REQUEST_SIZE_SPECIAL_ORDER)
{
if(req.offset == REQUEST_OFFSET_END_TRANSMIT)
{
if(ans.size != 0 && ans.type != ANSWER_TYPE_DATA)
get_ui().message(gettext("Bad answer from peer, while closing connection"));
}
else if(req.offset == REQUEST_OFFSET_GET_FILESIZE)
{
if(ans.size != 0 && ans.type != ANSWER_TYPE_INFININT)
throw Erange("zapette::make_transfert", gettext("Incoherent answer from peer"));
}
else if(req.offset == REQUEST_OFFSET_CHANGE_CONTEXT_STATUS)
{
if(ans.arg != 1)
throw Erange("zapette::make_transfert", gettext("Unexpected answer from slave, communication problem or bug may hang the operation"));
}
else if(req.offset == REQUEST_IS_OLD_START_END_ARCHIVE)
{
if(ans.type != ANSWER_TYPE_INFININT || (ans.arg != 0 && ans.arg != 1) )
throw Erange("zapetee::make_transfert", gettext("Unexpected answer from slave, communication problem or bug may hang the operation"));
}
else if(req.offset == REQUEST_GET_DATA_NAME)
{
if(ans.type != ANSWER_TYPE_DATA && lu != (S_I)(label::common_size()))
throw Erange("zapetee::make_transfert", gettext("Unexpected answer from slave, communication problem or bug may hang the operation"));
}
else if(req.offset == REQUEST_FIRST_SLICE_HEADER_SIZE)
{
if(ans.size != 0 && ans.type != ANSWER_TYPE_INFININT)
throw Erange("zapette::make_transfert", gettext("Incoherent answer from peer"));
}
else if(req.offset == REQUEST_OTHER_SLICE_HEADER_SIZE)
{
if(ans.size != 0 && ans.type != ANSWER_TYPE_INFININT)
throw Erange("zapette::make_transfert", gettext("Incoherent answer from peer"));
}
else
throw Erange("zapette::make_transfert", gettext("Corrupted data read from pipe"));
}
}
} // end of namespace
|