const sr_datafeed_logic &logic)
{
assert(_unit_size == logic.unitsize);
+ assert((logic.length % _unit_size) == 0);
lock_guard<recursive_mutex> lock(_mutex);
- append_data(logic.data, logic.length);
+ append_data(logic.data, logic.length / _unit_size);
// Generate the first mip-map from the data
append_payload_to_mipmap();
uint64_t LogicSnapshot::get_sample(uint64_t index) const
{
assert(_data);
- assert(index >= 0 && index < _sample_count);
+ assert(index < _sample_count);
return *(uint64_t*)((uint8_t*)_data + index * _unit_size);
}
bool last_sample;
bool fast_forward;
- assert(start >= 0);
assert(end <= get_sample_count());
assert(start <= end);
assert(min_length > 0);
{
//----- Continue to search -----//
level = min_level;
- fast_forward = true;
+
+ // We cannot fast-forward if there is no mip-map data at
+ // at the minimum level.
+ fast_forward = (_mip_map[level].data != NULL);
if (min_length < MipMapScaleFactor)
{
// We can fast forward only if there was no change
const bool sample =
(get_sample(index) & sig_mask) != 0;
- fast_forward = last_sample == sample;
+ if (last_sample != sample)
+ fast_forward = false;
}
if (fast_forward) {
(level + 1) * MipMapScalePower;
const uint64_t offset =
index >> level_scale_power;
- assert(offset >= 0);
// Check if we reached the last block at this
// level, or if there was a change in this block
(level + 1) * MipMapScalePower;
const uint64_t offset =
index >> level_scale_power;
- assert(offset >= 0);
// Check if we reached the last block at this
// level, or if there was a change in this block