68 lines
2.3 KiB
C++
68 lines
2.3 KiB
C++
|
#pragma once
|
||
|
|
|
||
|
|
#include <solanaceae/object_store/object_store.hpp>
|
||
|
|
|
||
|
|
#include <entt/container/dense_map.hpp>
|
||
|
|
|
||
|
|
#include "./util.hpp"
|
||
|
|
|
||
|
|
#include <cstdint>
|
||
|
|
#include <variant>
|
||
|
|
#include <vector>
|
||
|
|
|
||
|
|
struct SendingTransfers {
|
||
|
|
struct Entry {
|
||
|
|
struct Info {
|
||
|
|
// copy of info data
|
||
|
|
// too large?
|
||
|
|
std::vector<uint8_t> info_data;
|
||
|
|
};
|
||
|
|
|
||
|
|
struct Chunk {
|
||
|
|
ObjectHandle content;
|
||
|
|
size_t chunk_index; // <.< remove offset_into_file
|
||
|
|
//uint64_t offset_into_file;
|
||
|
|
// or data?
|
||
|
|
// if memmapped, this would be just a pointer
|
||
|
|
};
|
||
|
|
|
||
|
|
std::variant<Info, Chunk> v;
|
||
|
|
|
||
|
|
float time_since_activity {0.f};
|
||
|
|
|
||
|
|
bool isInfo(void) const { return std::holds_alternative<Info>(v); }
|
||
|
|
bool isChunk(void) const { return std::holds_alternative<Chunk>(v); }
|
||
|
|
|
||
|
|
Info& getInfo(void) { return std::get<Info>(v); }
|
||
|
|
const Info& getInfo(void) const { return std::get<Info>(v); }
|
||
|
|
Chunk& getChunk(void) { return std::get<Chunk>(v); }
|
||
|
|
const Chunk& getChunk(void) const { return std::get<Chunk>(v); }
|
||
|
|
|
||
|
|
};
|
||
|
|
|
||
|
|
// key is groupid + peerid
|
||
|
|
// TODO: replace with contact
|
||
|
|
entt::dense_map<uint64_t, entt::dense_map<uint8_t, Entry>> _data;
|
||
|
|
|
||
|
|
void tick(float delta);
|
||
|
|
|
||
|
|
Entry& emplaceInfo(uint32_t group_number, uint32_t peer_number, uint8_t transfer_id, const Entry::Info& info);
|
||
|
|
Entry& emplaceChunk(uint32_t group_number, uint32_t peer_number, uint8_t transfer_id, const Entry::Chunk& chunk);
|
||
|
|
|
||
|
|
bool containsPeer(uint32_t group_number, uint32_t peer_number) const { return _data.count(combine_ids(group_number, peer_number)); }
|
||
|
|
bool containsPeerTransfer(uint32_t group_number, uint32_t peer_number, uint8_t transfer_id) const;
|
||
|
|
// less reliable, since we dont keep the list of chunk idecies
|
||
|
|
bool containsChunk(ObjectHandle o, size_t chunk_idx) const;
|
||
|
|
bool containsPeerChunk(uint32_t group_number, uint32_t peer_number, ObjectHandle o, size_t chunk_idx) const;
|
||
|
|
|
||
|
|
auto& getPeer(uint32_t group_number, uint32_t peer_number) { return _data.at(combine_ids(group_number, peer_number)); }
|
||
|
|
auto& getTransfer(uint32_t group_number, uint32_t peer_number, uint8_t transfer_id) { return getPeer(group_number, peer_number).at(transfer_id); }
|
||
|
|
|
||
|
|
void removePeer(uint32_t group_number, uint32_t peer_number);
|
||
|
|
void removePeerTransfer(uint32_t group_number, uint32_t peer_number, uint8_t transfer_id);
|
||
|
|
|
||
|
|
size_t size(void) const;
|
||
|
|
size_t sizePeer(uint32_t group_number, uint32_t peer_number) const;
|
||
|
|
};
|
||
|
|
|