You cannot select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
openmw-tes3mp/components/bsa/bsa_file.hpp

175 lines
4.2 KiB
C++

/*
OpenMW - The completely unofficial reimplementation of Morrowind
Copyright (C) 2008-2010 Nicolay Korslund
Email: < korslund@gmail.com >
WWW: https://openmw.org/
This file (bsa_file.h) is part of the OpenMW package.
OpenMW is distributed as free software: you can redistribute it
and/or modify it under the terms of the GNU General Public License
version 3, as published by the Free Software Foundation.
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
version 3 along with this program. If not, see
https://www.gnu.org/licenses/ .
*/
#ifndef BSA_BSA_FILE_H
#define BSA_BSA_FILE_H
#include <cstdint>
#include <string>
#include <vector>
#include <map>
#include <components/misc/stringops.hpp>
#include <components/files/constrainedfilestream.hpp>
namespace Bsa
{
/**
This class is used to read "Bethesda Archive Files", or BSAs.
*/
class BSAFile
{
public:
4 years ago
#pragma pack(push)
#pragma pack(1)
struct Hash
{
uint32_t low, high;
};
#pragma pack(pop)
/// Represents one file entry in the archive
struct FileStruct
{
4 years ago
void setNameInfos(size_t index,
std::vector<char>* stringBuf
) {
namesOffset = static_cast<uint32_t>(index);
4 years ago
namesBuffer = stringBuf;
}
// File size and offset in file. We store the offset from the
// beginning of the file, not the offset into the data buffer
// (which is what is stored in the archive.)
uint32_t fileSize, offset;
4 years ago
Hash hash;
// Zero-terminated file name
4 years ago
const char* name() const { return &(*namesBuffer)[namesOffset]; };
uint32_t namesOffset = 0;
std::vector<char>* namesBuffer = nullptr;
};
typedef std::vector<FileStruct> FileList;
protected:
4 years ago
bool mHasChanged = false;
/// Table of files in this archive
FileList mFiles;
/// Filename string buffer
std::vector<char> mStringBuf;
/// True when an archive has been loaded
bool mIsLoaded;
/// Used for error messages
std::string mFilename;
/// Case insensitive string comparison
struct iltstr
{
4 years ago
bool operator()(const std::string& s1, const std::string& s2) const
{ return Misc::StringUtils::ciLess(s1, s2); }
};
/** A map used for fast file name lookup. The value is the index into
the files[] vector above. The iltstr ensures that file name
checks are case insensitive.
*/
typedef std::map<std::string, size_t, iltstr> Lookup;
Lookup mLookup;
/// Error handling
void fail(const std::string &msg);
/// Read header information from the input source
virtual void readHeader();
4 years ago
virtual void writeHeader();
/// Get the index of a given file name, or -1 if not found
/// @note Thread safe.
int getIndex(const char *str) const;
public:
/* -----------------------------------
* BSA management methods
* -----------------------------------
*/
BSAFile()
: mIsLoaded(false)
{ }
4 years ago
virtual ~BSAFile()
{
close();
}
/// Open an archive file.
void open(const std::string &file);
4 years ago
void close();
/* -----------------------------------
* Archive file routines
* -----------------------------------
*/
/// Check if a file exists
virtual bool exists(const char *file) const
{ return getIndex(file) != -1; }
/** Open a file contained in the archive. Throws an exception if the
file doesn't exist.
* @note Thread safe.
*/
virtual Files::IStreamPtr getFile(const char *file);
/** Open a file contained in the archive.
* @note Thread safe.
*/
virtual Files::IStreamPtr getFile(const FileStruct* file);
4 years ago
virtual void addFile(const std::string& filename, std::istream& file);
/// Get a list of all files
/// @note Thread safe.
const FileList &getList() const
{ return mFiles; }
4 years ago
const std::string& getFilename() const
{
return mFilename;
}
};
}
#endif