ClickHouse/dbms/include/DB/IO/UncompressedCache.h

83 lines
1.8 KiB
C++
Raw Normal View History

#pragma once
#include <DB/Common/LRUCache.h>
#include <DB/Common/SipHash.h>
#include <DB/Common/ProfileEvents.h>
#include <DB/IO/BufferWithOwnMemory.h>
#include <DB/Interpreters/AggregationCommon.h>
namespace ProfileEvents
{
extern const Event UncompressedCacheHits;
extern const Event UncompressedCacheMisses;
extern const Event UncompressedCacheWeightLost;
}
namespace DB
{
struct UncompressedCacheCell
{
Memory data;
size_t compressed_size;
};
2014-03-28 14:36:24 +00:00
struct UncompressedSizeWeightFunction
{
size_t operator()(const UncompressedCacheCell & x) const
{
return x.data.size();
}
};
/** Cache of decompressed blocks for implementation of CachedCompressedReadBuffer. thread-safe.
*/
2014-03-28 14:36:24 +00:00
class UncompressedCache : public LRUCache<UInt128, UncompressedCacheCell, UInt128TrivialHash, UncompressedSizeWeightFunction>
{
private:
using Base = LRUCache<UInt128, UncompressedCacheCell, UInt128TrivialHash, UncompressedSizeWeightFunction>;
public:
2014-03-28 14:36:24 +00:00
UncompressedCache(size_t max_size_in_bytes)
: Base(max_size_in_bytes) {}
/// Calculate key from path to file and offset.
static UInt128 hash(const String & path_to_file, size_t offset)
{
UInt128 key;
SipHash hash;
hash.update(path_to_file.data(), path_to_file.size() + 1);
hash.update(reinterpret_cast<const char *>(&offset), sizeof(offset));
hash.get128(key.first, key.second);
return key;
}
MappedPtr get(const Key & key)
{
MappedPtr res = Base::get(key);
if (res)
ProfileEvents::increment(ProfileEvents::UncompressedCacheHits);
else
ProfileEvents::increment(ProfileEvents::UncompressedCacheMisses);
return res;
}
void set(const Key & key, MappedPtr mapped)
{
Base::set(key, mapped);
ProfileEvents::increment(ProfileEvents::UncompressedCacheWeightLost, current_weight_lost);
current_weight_lost = 0;
}
};
using UncompressedCachePtr = std::shared_ptr<UncompressedCache>;
}