Aegisub/src/block_cache.h

204 lines
6.4 KiB
C
Raw Normal View History

// Copyright (c) 2009, Niels Martin Hansen
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// * Redistributions of source code must retain the above copyright notice,
// this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above copyright notice,
// this list of conditions and the following disclaimer in the documentation
// and/or other materials provided with the distribution.
// * Neither the name of the Aegisub Group nor the names of its contributors
// may be used to endorse or promote products derived from this software
// without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
// ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
// LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
// CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
// SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
// CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
// ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
// POSSIBILITY OF SUCH DAMAGE.
//
// Aegisub Project http://www.aegisub.org/
/// @file block_cache.h
/// @ingroup utility
/// @brief Template class for creating caches for blocks of data
#pragma once
#include <algorithm>
#include <list>
#include <vector>
/// @class DataBlockCache
/// @brief Cache for blocks of data in a stream or similar
/// @tparam BlockT Type of blocks to store
/// @tparam MacroblockExponent Controls the number of blocks per macroblock, for tuning memory usage
/// @tparam BlockFactoryT Type of block factory, see BasicDataBlockFactory class for detail on these
2014-07-16 20:58:27 +02:00
template <typename BlockT, int MacroblockExponent, typename BlockFactoryT>
class DataBlockCache {
/// Type of an array of blocks
2013-10-27 15:15:39 +01:00
typedef std::vector<typename BlockFactoryT::BlockType> BlockArray;
struct MacroBlock {
/// This macroblock's position in the age list
/// Is valid iff blocks.size() > 0
typename std::list<MacroBlock*>::iterator position;
/// The blocks contained in the macroblock
BlockArray blocks;
};
/// Type of an array of macro blocks
typedef std::vector<MacroBlock> MacroBlockArray;
/// The data in the cache
MacroBlockArray data;
/// Type of a list of macro blocks
typedef std::list<MacroBlock*> AgeList;
/// The data sorted by how long it's been since they were used
AgeList age;
/// Number of blocks per macroblock
size_t macroblock_size;
/// Bitmask to extract the inside-macroblock index for a block by bitwise and
size_t macroblock_index_mask;
/// Current size of the cache in bytes
size_t size = 0;
/// Factory object for blocks
BlockFactoryT factory;
/// @brief Dispose of all blocks in a macroblock and mark it empty
/// @param mb_index Index of macroblock to clear
void KillMacroBlock(MacroBlock &mb)
{
if (mb.blocks.empty())
return;
auto& ba = mb.blocks;
size -= (ba.size() - std::count(ba.begin(), ba.end(), nullptr)) * factory.GetBlockSize();
ba.clear();
age.erase(mb.position);
}
public:
/// @brief Constructor
/// @param block_count Total number of blocks the cache will manage
/// @param factory Factory object to use for producing blocks
///
/// Note that the block_count is the maximum block index the cache will ever see,
/// it is an error to request a block number greater than block_count.
///
/// The factory object passed must respond well to copying.
DataBlockCache(size_t block_count, BlockFactoryT factory = BlockFactoryT())
2013-11-21 18:13:36 +01:00
: factory(std::move(factory))
{
SetBlockCount(block_count);
}
DataBlockCache(DataBlockCache&&) = default;
DataBlockCache& operator=(DataBlockCache&&) = default;
/// @brief Change the number of blocks in cache
/// @param block_count New number of blocks to hold
///
/// This will completely de-allocate the cache and re-allocate it with the new block count.
void SetBlockCount(size_t block_count)
{
if (data.size() > 0)
Age(0);
macroblock_size = 1UL << MacroblockExponent;
macroblock_index_mask = macroblock_size - 1;
2013-10-27 15:15:39 +01:00
data.resize((block_count + macroblock_size - 1) >> MacroblockExponent);
size = 0;
}
/// @brief Clean up the cache
/// @param max_size Target maximum size of the cache in bytes
///
/// Passing a max_size of 0 (zero) causes the cache to be completely flushed
/// in a fast manner.
///
/// The max_size is not a hard limit, the cache size might somewhat exceed the max
/// after the aging operation, though it shouldn't be by much.
void Age(size_t max_size)
{
// Quick way out: get rid of everything
if (max_size == 0)
{
2013-10-27 15:15:39 +01:00
size_t block_count = data.size();
data.clear();
2013-11-03 15:21:02 +01:00
data.resize(block_count);
2013-10-27 15:15:39 +01:00
age.clear();
size = 0;
return;
}
// Remove old entries until we're under the max size
while (size > max_size) {
// When size > 0, age should never be empty
assert(!age.empty());
KillMacroBlock(*age.back());
}
}
/// @brief Obtain a data block from the cache
/// @param i Index of the block to retrieve
/// @param[out] created On return, tells whether the returned block was created during the operation
/// @return A pointer to the block in cache
///
/// It is legal to pass 0 (null) for created, in this case nothing is returned in it.
BlockT& Get(size_t i, bool *created = nullptr)
{
size_t mbi = i >> MacroblockExponent;
assert(mbi < data.size());
auto &mb = data[mbi];
// Move this macroblock to the front of the age list
2013-10-27 15:15:39 +01:00
if (mb.blocks.empty())
{
mb.blocks.resize(macroblock_size);
age.push_front(&mb);
}
else if (mb.position != begin(age))
age.splice(begin(age), age, mb.position);
mb.position = age.begin();
size_t block_index = i & macroblock_index_mask;
assert(block_index < mb.blocks.size());
2013-10-27 15:15:39 +01:00
BlockT *b = mb.blocks[block_index].get();
if (!b)
{
2013-10-27 15:15:39 +01:00
mb.blocks[block_index] = factory.ProduceBlock(i);
b = mb.blocks[block_index].get();
2013-11-21 18:13:36 +01:00
assert(b != nullptr);
size += factory.GetBlockSize();
if (created) *created = true;
}
else
if (created) *created = false;
return *b;
}
};