TigerTree.hh

Go to the documentation of this file.

 
#ifndef TIGERTREE_HH
#define TIGERTREE_HH
 
#include <string>
#include <cstdint>
#include <ctime>
#include <functional>
 
namespace openmsx {
 
struct TigerHash;
 
class TTData
{
public:
        [[nodiscard]] virtual uint8_t* getData(size_t offset, size_t size) = 0;
 
        [[nodiscard]] virtual bool isCacheStillValid(time_t& time) = 0;
 
protected:
        ~TTData() = default;
};
 
struct TTCacheEntry;
 
class TigerTree
{
public:
        static constexpr size_t BLOCK_SIZE = 1024;
 
        TigerTree(TTData& data, size_t dataSize, const std::string& name);
 
        [[nodiscard]] const TigerHash& calcHash(const std::function<void(size_t, size_t)>& progressCallback);
 
        void notifyChange(size_t offset, size_t len, time_t time);
 
private:
        // functions to navigate in binary tree
        struct Node {
                Node(size_t n_, size_t l_) : n(n_), l(l_) {}
                size_t n; // node number
                size_t l; // level number
        };
        [[nodiscard]] Node getTop() const;
        [[nodiscard]] Node getLeaf(size_t block) const;
        [[nodiscard]] Node getParent(Node node) const;
        [[nodiscard]] Node getLeftChild(Node node) const;
        [[nodiscard]] Node getRightChild(Node node) const;
 
        [[nodiscard]] const TigerHash& calcHash(Node node, const std::function<void(size_t, size_t)>& progressCallback);
 
private:
        TTData& data;
        const size_t dataSize;
        TTCacheEntry& entry;
};
 
} // namespace openmsx
 
#endif