/usr/include/dar/slice_layout.hpp is in libdar-dev 2.5.3-1ubuntu1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | /*********************************************************************/
// dar - disk archive - a backup/restoration program
// Copyright (C) 2002-2052 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., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
//
// to contact the author : http://dar.linux.free.fr/email.html
/*********************************************************************/
/// \file slice_layout.hpp
/// \brief object describing the slicing of an archive
/// \ingroup Private
#ifndef SLICE_LAYOUT_HPP
#define SLICE_LAYOUT_HPP
#include <string>
#include <set>
#include "/usr/include/dar/libdar_my_config.h"
#include "/usr/include/dar/infinint.hpp"
#include "/usr/include/dar/generic_file.hpp"
#include "/usr/include/dar/on_pool.hpp"
namespace libdar
{
class slice_layout : public on_pool
{
public:
// field still exposed (slice_layout was a struct before being a class)
// we keep these fields as is for now
infinint first_size; //< size of the first slice
infinint other_size; //< maximum size of other slices
infinint first_slice_header; //< size of the slice header in the first slice
infinint other_slice_header; //< size of the slice header in the other slices
bool older_sar_than_v8; //< true if the archive format is older than version 8
void read(generic_file & f);
void write(generic_file & f) const;
void clear();
/// given a slice_layout and a archive offset, provides the corresponding slice and slice offset
///
/// \param[in] sl slice_layout
/// \param[in] offset input offset as if all slices were sticked toghether
/// \param[out] slice_num slice number where to find the given offset
/// \param[out] slice_offset offset in that slice where is the given offset
void which_slice(const infinint & offset,
infinint & slice_num,
infinint & slice_offset) const;
private:
static const char OLDER_THAN_V8 = '7';
static const char V8 = '8';
};
} // end of namespace
#endif
|