forked from Ivasoft/DSView
867 lines
26 KiB
C++
867 lines
26 KiB
C++
/*
|
|
* This file is part of the DSLogic-gui project.
|
|
* DSLogic-gui is based on PulseView.
|
|
*
|
|
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
|
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
|
*
|
|
* This program is free software; you can redistribute it and/or modify
|
|
* it under the terms of the GNU General Public License as published by
|
|
* the Free Software Foundation; either version 2 of the License, or
|
|
* (at your option) any later version.
|
|
*
|
|
* This program is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with this program; if not, write to the Free Software
|
|
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
|
*/
|
|
|
|
|
|
#include <extdef.h>
|
|
|
|
#include <assert.h>
|
|
#include <string.h>
|
|
#include <stdlib.h>
|
|
#include <math.h>
|
|
|
|
#include <boost/foreach.hpp>
|
|
|
|
#include "logicsnapshot.h"
|
|
|
|
using namespace boost;
|
|
using namespace std;
|
|
|
|
namespace pv {
|
|
namespace data {
|
|
|
|
const int LogicSnapshot::MipMapScalePower = 4;
|
|
const int LogicSnapshot::MipMapScaleFactor = 1 << MipMapScalePower;
|
|
const float LogicSnapshot::LogMipMapScaleFactor = logf(MipMapScaleFactor);
|
|
const uint64_t LogicSnapshot::MipMapDataUnit = 64*1024; // bytes
|
|
|
|
LogicSnapshot::LogicSnapshot(const sr_datafeed_logic &logic, uint64_t _total_sample_len, unsigned int channel_num) :
|
|
Snapshot(logic.unitsize, _total_sample_len, channel_num),
|
|
_last_append_sample(0)
|
|
{
|
|
boost::lock_guard<boost::recursive_mutex> lock(_mutex);
|
|
memset(_mip_map, 0, sizeof(_mip_map));
|
|
if (init(_total_sample_len * channel_num) == SR_OK)
|
|
append_payload(logic);
|
|
}
|
|
|
|
LogicSnapshot::~LogicSnapshot()
|
|
{
|
|
boost::lock_guard<boost::recursive_mutex> lock(_mutex);
|
|
BOOST_FOREACH(MipMapLevel &l, _mip_map)
|
|
free(l.data);
|
|
}
|
|
|
|
void LogicSnapshot::append_payload(
|
|
const sr_datafeed_logic &logic)
|
|
{
|
|
assert(_unit_size == logic.unitsize);
|
|
assert((logic.length % _unit_size) == 0);
|
|
|
|
boost::lock_guard<boost::recursive_mutex> lock(_mutex);
|
|
|
|
append_data(logic.data, logic.length / _unit_size);
|
|
|
|
// Generate the first mip-map from the data
|
|
append_payload_to_mipmap();
|
|
}
|
|
|
|
void LogicSnapshot::reallocate_mipmap_level(MipMapLevel &m)
|
|
{
|
|
const uint64_t new_data_length = ((m.length + MipMapDataUnit - 1) /
|
|
MipMapDataUnit) * MipMapDataUnit;
|
|
if (new_data_length > m.data_length)
|
|
{
|
|
m.data_length = new_data_length;
|
|
|
|
// Padding is added to allow for the uint64_t write word
|
|
m.data = realloc(m.data, new_data_length * _unit_size +
|
|
sizeof(uint64_t));
|
|
}
|
|
}
|
|
|
|
void LogicSnapshot::append_payload_to_mipmap()
|
|
{
|
|
MipMapLevel &m0 = _mip_map[0];
|
|
uint64_t prev_length;
|
|
const uint8_t *src_ptr;
|
|
uint8_t *dest_ptr;
|
|
uint64_t accumulator;
|
|
unsigned int diff_counter;
|
|
|
|
// Expand the data buffer to fit the new samples
|
|
prev_length = m0.length;
|
|
m0.length = _sample_count / MipMapScaleFactor;
|
|
|
|
// Break off if there are no new samples to compute
|
|
if (m0.length == prev_length)
|
|
return;
|
|
|
|
reallocate_mipmap_level(m0);
|
|
|
|
dest_ptr = (uint8_t*)m0.data + prev_length * _unit_size;
|
|
|
|
// Iterate through the samples to populate the first level mipmap
|
|
const uint8_t *const end_src_ptr = (uint8_t*)_data +
|
|
m0.length * _unit_size * MipMapScaleFactor;
|
|
for (src_ptr = (uint8_t*)_data +
|
|
prev_length * _unit_size * MipMapScaleFactor;
|
|
src_ptr < end_src_ptr;)
|
|
{
|
|
// Accumulate transitions which have occurred in this sample
|
|
accumulator = 0;
|
|
diff_counter = MipMapScaleFactor;
|
|
while (diff_counter-- > 0)
|
|
{
|
|
const uint64_t sample = *(uint64_t*)src_ptr;
|
|
accumulator |= _last_append_sample ^ sample;
|
|
_last_append_sample = sample;
|
|
src_ptr += _unit_size;
|
|
}
|
|
|
|
*(uint64_t*)dest_ptr = accumulator;
|
|
dest_ptr += _unit_size;
|
|
}
|
|
|
|
// Compute higher level mipmaps
|
|
for (unsigned int level = 1; level < ScaleStepCount; level++)
|
|
{
|
|
MipMapLevel &m = _mip_map[level];
|
|
const MipMapLevel &ml = _mip_map[level-1];
|
|
|
|
// Expand the data buffer to fit the new samples
|
|
prev_length = m.length;
|
|
m.length = ml.length / MipMapScaleFactor;
|
|
|
|
// Break off if there are no more samples to computed
|
|
if (m.length == prev_length)
|
|
break;
|
|
|
|
reallocate_mipmap_level(m);
|
|
|
|
// Subsample the level lower level
|
|
src_ptr = (uint8_t*)ml.data +
|
|
_unit_size * prev_length * MipMapScaleFactor;
|
|
const uint8_t *const end_dest_ptr =
|
|
(uint8_t*)m.data + _unit_size * m.length;
|
|
for (dest_ptr = (uint8_t*)m.data +
|
|
_unit_size * prev_length;
|
|
dest_ptr < end_dest_ptr;
|
|
dest_ptr += _unit_size)
|
|
{
|
|
accumulator = 0;
|
|
diff_counter = MipMapScaleFactor;
|
|
while (diff_counter-- > 0)
|
|
{
|
|
accumulator |= *(uint64_t*)src_ptr;
|
|
src_ptr += _unit_size;
|
|
}
|
|
|
|
*(uint64_t*)dest_ptr = accumulator;
|
|
}
|
|
}
|
|
}
|
|
|
|
uint64_t LogicSnapshot::get_sample(uint64_t index) const
|
|
{
|
|
assert(_data);
|
|
assert(index < _sample_count);
|
|
|
|
return *(uint64_t*)((uint8_t*)_data + index * _unit_size);
|
|
}
|
|
|
|
void LogicSnapshot::get_subsampled_edges(
|
|
std::vector<EdgePair> &edges,
|
|
uint64_t start, uint64_t end,
|
|
float min_length, int sig_index)
|
|
{
|
|
uint64_t index = start;
|
|
unsigned int level;
|
|
bool last_sample;
|
|
bool fast_forward;
|
|
|
|
assert(end <= get_sample_count());
|
|
assert(start <= end);
|
|
assert(min_length > 0);
|
|
assert(sig_index >= 0);
|
|
assert(sig_index < 64);
|
|
|
|
boost::lock_guard<boost::recursive_mutex> lock(_mutex);
|
|
|
|
const uint64_t block_length = (uint64_t)max(min_length, 1.0f);
|
|
const unsigned int min_level = max((int)floorf(logf(min_length) /
|
|
LogMipMapScaleFactor) - 1, 0);
|
|
const uint64_t sig_mask = 1ULL << sig_index;
|
|
|
|
if (!edges.empty())
|
|
edges.clear();
|
|
// Store the initial state
|
|
last_sample = (get_sample(start) & sig_mask) != 0;
|
|
edges.push_back(pair<int64_t, bool>(index++, last_sample));
|
|
|
|
while (index + block_length <= end)
|
|
{
|
|
//----- Continue to search -----//
|
|
level = min_level;
|
|
|
|
// 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)
|
|
{
|
|
// Search individual samples up to the beginning of
|
|
// the next first level mip map block
|
|
const uint64_t final_index = min(end,
|
|
pow2_ceil(index, MipMapScalePower));
|
|
|
|
for (; index < final_index &&
|
|
(index & ~(~0 << MipMapScalePower)) != 0;
|
|
index++)
|
|
{
|
|
const bool sample =
|
|
(get_sample(index) & sig_mask) != 0;
|
|
|
|
// If there was a change we cannot fast forward
|
|
if (sample != last_sample) {
|
|
fast_forward = false;
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
else
|
|
{
|
|
// If resolution is less than a mip map block,
|
|
// round up to the beginning of the mip-map block
|
|
// for this level of detail
|
|
const int min_level_scale_power =
|
|
(level + 1) * MipMapScalePower;
|
|
index = pow2_ceil(index, min_level_scale_power);
|
|
if (index >= end)
|
|
break;
|
|
|
|
// We can fast forward only if there was no change
|
|
const bool sample =
|
|
(get_sample(index) & sig_mask) != 0;
|
|
if (last_sample != sample)
|
|
fast_forward = false;
|
|
}
|
|
|
|
if (fast_forward) {
|
|
|
|
// Fast forward: This involves zooming out to higher
|
|
// levels of the mip map searching for changes, then
|
|
// zooming in on them to find the point where the edge
|
|
// begins.
|
|
|
|
// Slide right and zoom out at the beginnings of mip-map
|
|
// blocks until we encounter a change
|
|
while (1) {
|
|
const int level_scale_power =
|
|
(level + 1) * MipMapScalePower;
|
|
const uint64_t offset =
|
|
index >> level_scale_power;
|
|
|
|
// Check if we reached the last block at this
|
|
// level, or if there was a change in this block
|
|
if (offset >= _mip_map[level].length ||
|
|
(get_subsample(level, offset) &
|
|
sig_mask))
|
|
break;
|
|
|
|
if ((offset & ~(~0 << MipMapScalePower)) == 0) {
|
|
// If we are now at the beginning of a
|
|
// higher level mip-map block ascend one
|
|
// level
|
|
if (level + 1 >= ScaleStepCount ||
|
|
!_mip_map[level + 1].data)
|
|
break;
|
|
|
|
level++;
|
|
} else {
|
|
// Slide right to the beginning of the
|
|
// next mip map block
|
|
index = pow2_ceil(index + 1,
|
|
level_scale_power);
|
|
}
|
|
}
|
|
|
|
// Zoom in, and slide right until we encounter a change,
|
|
// and repeat until we reach min_level
|
|
while (1) {
|
|
assert(_mip_map[level].data);
|
|
|
|
const int level_scale_power =
|
|
(level + 1) * MipMapScalePower;
|
|
const uint64_t offset =
|
|
index >> level_scale_power;
|
|
|
|
// Check if we reached the last block at this
|
|
// level, or if there was a change in this block
|
|
if (offset >= _mip_map[level].length ||
|
|
(get_subsample(level, offset) &
|
|
sig_mask)) {
|
|
// Zoom in unless we reached the minimum
|
|
// zoom
|
|
if (level == min_level)
|
|
break;
|
|
|
|
level--;
|
|
} else {
|
|
// Slide right to the beginning of the
|
|
// next mip map block
|
|
index = pow2_ceil(index + 1,
|
|
level_scale_power);
|
|
}
|
|
}
|
|
|
|
// If individual samples within the limit of resolution,
|
|
// do a linear search for the next transition within the
|
|
// block
|
|
if (min_length < MipMapScaleFactor) {
|
|
for (; index < end; index++) {
|
|
const bool sample = (get_sample(index) &
|
|
sig_mask) != 0;
|
|
if (sample != last_sample)
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
//----- Store the edge -----//
|
|
|
|
// Take the last sample of the quanization block
|
|
const int64_t final_index = index + block_length;
|
|
if (index + block_length > end)
|
|
break;
|
|
|
|
// Store the final state
|
|
const bool final_sample =
|
|
(get_sample(final_index - 1) & sig_mask) != 0;
|
|
edges.push_back(pair<int64_t, bool>(index, final_sample));
|
|
|
|
index = final_index;
|
|
last_sample = final_sample;
|
|
}
|
|
|
|
// Add the final state
|
|
const bool end_sample = ((get_sample(end) & sig_mask) != 0);
|
|
if ((end != get_sample_count() - 1) ||
|
|
((end == get_sample_count() - 1) && end_sample != last_sample))
|
|
edges.push_back(pair<int64_t, bool>(end, end_sample));
|
|
|
|
if (end == get_sample_count() - 1)
|
|
edges.push_back(pair<int64_t, bool>(end + 1, ~last_sample));
|
|
}
|
|
|
|
int LogicSnapshot::get_first_edge(
|
|
uint64_t &edge_index, bool &edge,
|
|
uint64_t start, uint64_t end,
|
|
int sig_index, int edge_type,
|
|
int flag_index, int flag)
|
|
{
|
|
uint64_t index = start;
|
|
unsigned int level;
|
|
bool last_sample;
|
|
bool fast_forward;
|
|
|
|
assert(end <= get_sample_count());
|
|
assert(start <= end);
|
|
assert(sig_index >= 0);
|
|
assert(sig_index < 64);
|
|
|
|
boost::lock_guard<boost::recursive_mutex> lock(_mutex);
|
|
|
|
const uint64_t block_length = 1;
|
|
const unsigned int min_level = 0;
|
|
const uint64_t sig_mask = 1ULL << sig_index;
|
|
const uint64_t flag_mask = 1ULL << flag_index;
|
|
|
|
// Store the initial state
|
|
last_sample = (get_sample(start) & sig_mask) != 0;
|
|
|
|
while (index + block_length <= end)
|
|
{
|
|
//----- Continue to search -----//
|
|
level = min_level;
|
|
|
|
// We cannot fast-forward if there is no mip-map data at
|
|
// at the minimum level.
|
|
fast_forward = (_mip_map[level].data != NULL);
|
|
|
|
// Search individual samples up to the beginning of
|
|
// the next first level mip map block
|
|
uint64_t final_index = min(end,
|
|
pow2_ceil(index, MipMapScalePower));
|
|
|
|
for (; index < final_index &&
|
|
(index & ~(~0 << MipMapScalePower)) != 0;
|
|
index++)
|
|
{
|
|
const bool sample =
|
|
(get_sample(index) & sig_mask) != 0;
|
|
|
|
// If there was a change we cannot fast forward
|
|
if (sample != last_sample) {
|
|
fast_forward = false;
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (fast_forward) {
|
|
|
|
// Fast forward: This involves zooming out to higher
|
|
// levels of the mip map searching for changes, then
|
|
// zooming in on them to find the point where the edge
|
|
// begins.
|
|
|
|
// Slide right and zoom out at the beginnings of mip-map
|
|
// blocks until we encounter a change
|
|
while (1) {
|
|
const int level_scale_power =
|
|
(level + 1) * MipMapScalePower;
|
|
const uint64_t offset =
|
|
index >> level_scale_power;
|
|
|
|
// Check if we reached the last block at this
|
|
// level, or if there was a change in this block
|
|
if (offset >= _mip_map[level].length ||
|
|
(get_subsample(level, offset) &
|
|
sig_mask))
|
|
break;
|
|
|
|
if ((offset & ~(~0 << MipMapScalePower)) == 0) {
|
|
// If we are now at the beginning of a
|
|
// higher level mip-map block ascend one
|
|
// level
|
|
if (level + 1 >= ScaleStepCount ||
|
|
!_mip_map[level + 1].data)
|
|
break;
|
|
|
|
level++;
|
|
} else {
|
|
// Slide right to the beginning of the
|
|
// next mip map block
|
|
index = pow2_ceil(index + 1,
|
|
level_scale_power);
|
|
}
|
|
}
|
|
|
|
// Zoom in, and slide right until we encounter a change,
|
|
// and repeat until we reach min_level
|
|
while (1) {
|
|
assert(_mip_map[level].data);
|
|
|
|
const int level_scale_power =
|
|
(level + 1) * MipMapScalePower;
|
|
const uint64_t offset =
|
|
index >> level_scale_power;
|
|
|
|
// Check if we reached the last block at this
|
|
// level, or if there was a change in this block
|
|
if (offset >= _mip_map[level].length ||
|
|
(get_subsample(level, offset) &
|
|
sig_mask)) {
|
|
// Zoom in unless we reached the minimum
|
|
// zoom
|
|
if (level == min_level)
|
|
break;
|
|
|
|
level--;
|
|
} else {
|
|
// Slide right to the beginning of the
|
|
// next mip map block
|
|
index = pow2_ceil(index + 1,
|
|
level_scale_power);
|
|
}
|
|
}
|
|
|
|
// If individual samples within the limit of resolution,
|
|
// do a linear search for the next transition within the
|
|
// block
|
|
for (; index < end; index++) {
|
|
const bool sample = (get_sample(index) &
|
|
sig_mask) != 0;
|
|
if (sample != last_sample)
|
|
break;
|
|
}
|
|
}
|
|
|
|
//----- Store the edge -----//
|
|
|
|
// Take the last sample of the quanization block
|
|
final_index = index + block_length;
|
|
if (index + block_length > end)
|
|
break;
|
|
|
|
// Store the final state
|
|
const bool final_sample =
|
|
(get_sample(final_index - 1) & sig_mask) != 0;
|
|
if (final_index > 1) {
|
|
const bool final_flag_sample = ((get_sample(final_index - 1) & flag_mask) != 0);
|
|
const bool final_pre_flag_sample = ((get_sample(final_index - 2) & flag_mask) != 0);
|
|
if (final_sample != last_sample &&
|
|
((edge_type == -1) || final_sample == (edge_type != 0)) &&
|
|
((flag == -1) || (final_flag_sample == (flag != 0) && final_flag_sample == final_pre_flag_sample))) {
|
|
edge_index = index;
|
|
edge = final_sample;
|
|
return SR_OK;
|
|
}
|
|
}
|
|
|
|
index = final_index;
|
|
last_sample = final_sample;
|
|
}
|
|
|
|
// Add the final state
|
|
const bool end_sample = ((get_sample(end) & sig_mask) != 0);
|
|
const bool end_flag_sample = ((get_sample(end) & flag_mask) != 0);
|
|
const bool end_pre_flag_sample = ((get_sample(end - 1) & flag_mask) != 0);
|
|
if (end_sample != last_sample &&
|
|
((edge_type == -1) || end_sample == (edge_type != 0)) &&
|
|
((flag == -1) || (end_flag_sample == (flag != 0) && end_flag_sample == end_pre_flag_sample))) {
|
|
edge_index = end;
|
|
edge = end_sample;
|
|
return SR_OK;
|
|
} else {
|
|
return SR_ERR;
|
|
}
|
|
}
|
|
|
|
void LogicSnapshot::get_edges(
|
|
std::vector<EdgePair> &edges,
|
|
uint64_t start, uint64_t end, int sig_index, int edge_type)
|
|
{
|
|
uint64_t index = start;
|
|
unsigned int level;
|
|
bool last_sample;
|
|
bool fast_forward;
|
|
|
|
assert(end <= get_sample_count());
|
|
assert(start <= end);
|
|
assert(sig_index >= 0);
|
|
assert(sig_index < 64);
|
|
|
|
boost::lock_guard<boost::recursive_mutex> lock(_mutex);
|
|
|
|
const uint64_t block_length = 1;
|
|
const unsigned int min_level = 0;
|
|
const uint64_t sig_mask = 1ULL << sig_index;
|
|
|
|
if (!edges.empty())
|
|
edges.clear();
|
|
// Store the initial state
|
|
last_sample = (get_sample(start) & sig_mask) != 0;
|
|
|
|
while (index + block_length <= end)
|
|
{
|
|
//----- Continue to search -----//
|
|
level = min_level;
|
|
|
|
// We cannot fast-forward if there is no mip-map data at
|
|
// at the minimum level.
|
|
fast_forward = (_mip_map[level].data != NULL);
|
|
|
|
// Search individual samples up to the beginning of
|
|
// the next first level mip map block
|
|
uint64_t final_index = min(end,
|
|
pow2_ceil(index, MipMapScalePower));
|
|
|
|
for (; index < final_index &&
|
|
(index & ~(~0 << MipMapScalePower)) != 0;
|
|
index++)
|
|
{
|
|
const bool sample =
|
|
(get_sample(index) & sig_mask) != 0;
|
|
|
|
// If there was a change we cannot fast forward
|
|
if (sample != last_sample) {
|
|
fast_forward = false;
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (fast_forward) {
|
|
|
|
// Fast forward: This involves zooming out to higher
|
|
// levels of the mip map searching for changes, then
|
|
// zooming in on them to find the point where the edge
|
|
// begins.
|
|
|
|
// Slide right and zoom out at the beginnings of mip-map
|
|
// blocks until we encounter a change
|
|
while (1) {
|
|
const int level_scale_power =
|
|
(level + 1) * MipMapScalePower;
|
|
const uint64_t offset =
|
|
index >> level_scale_power;
|
|
|
|
// Check if we reached the last block at this
|
|
// level, or if there was a change in this block
|
|
if (offset >= _mip_map[level].length ||
|
|
(get_subsample(level, offset) &
|
|
sig_mask))
|
|
break;
|
|
|
|
if ((offset & ~(~0 << MipMapScalePower)) == 0) {
|
|
// If we are now at the beginning of a
|
|
// higher level mip-map block ascend one
|
|
// level
|
|
if (level + 1 >= ScaleStepCount ||
|
|
!_mip_map[level + 1].data)
|
|
break;
|
|
|
|
level++;
|
|
} else {
|
|
// Slide right to the beginning of the
|
|
// next mip map block
|
|
index = pow2_ceil(index + 1,
|
|
level_scale_power);
|
|
}
|
|
}
|
|
|
|
// Zoom in, and slide right until we encounter a change,
|
|
// and repeat until we reach min_level
|
|
while (1) {
|
|
assert(_mip_map[level].data);
|
|
|
|
const int level_scale_power =
|
|
(level + 1) * MipMapScalePower;
|
|
const uint64_t offset =
|
|
index >> level_scale_power;
|
|
|
|
// Check if we reached the last block at this
|
|
// level, or if there was a change in this block
|
|
if (offset >= _mip_map[level].length ||
|
|
(get_subsample(level, offset) &
|
|
sig_mask)) {
|
|
// Zoom in unless we reached the minimum
|
|
// zoom
|
|
if (level == min_level)
|
|
break;
|
|
|
|
level--;
|
|
} else {
|
|
// Slide right to the beginning of the
|
|
// next mip map block
|
|
index = pow2_ceil(index + 1,
|
|
level_scale_power);
|
|
}
|
|
}
|
|
|
|
// If individual samples within the limit of resolution,
|
|
// do a linear search for the next transition within the
|
|
// block
|
|
for (; index < end; index++) {
|
|
const bool sample = (get_sample(index) &
|
|
sig_mask) != 0;
|
|
if (sample != last_sample)
|
|
break;
|
|
}
|
|
}
|
|
|
|
//----- Store the edge -----//
|
|
|
|
// Take the last sample of the quanization block
|
|
final_index = index + block_length;
|
|
if (index + block_length > end)
|
|
break;
|
|
|
|
// Store the final state
|
|
const bool final_sample =
|
|
(get_sample(final_index - 1) & sig_mask) != 0;
|
|
if ((edge_type == -1) || (final_sample == (edge_type != 0)))
|
|
edges.push_back(pair<int64_t, bool>(final_index - 1, final_sample));
|
|
|
|
index = final_index;
|
|
last_sample = final_sample;
|
|
}
|
|
|
|
// Add the final state
|
|
const bool end_sample = ((get_sample(end) & sig_mask) != 0);
|
|
if ((end_sample != last_sample) &&
|
|
((edge_type == -1) || (end_sample == (edge_type != 0))))
|
|
edges.push_back(pair<int64_t, bool>(end, end_sample));
|
|
}
|
|
|
|
uint64_t LogicSnapshot::get_min_pulse(uint64_t start, uint64_t end, int sig_index)
|
|
{
|
|
uint64_t index = start;
|
|
unsigned int level;
|
|
bool last_sample;
|
|
bool fast_forward;
|
|
uint64_t last_index;
|
|
uint64_t min_pulse = end - start;
|
|
|
|
assert(end <= get_sample_count());
|
|
assert(start <= end);
|
|
assert(sig_index >= 0);
|
|
assert(sig_index < 64);
|
|
|
|
boost::lock_guard<boost::recursive_mutex> lock(_mutex);
|
|
|
|
const uint64_t block_length = 1;
|
|
const unsigned int min_level = 0;
|
|
const uint64_t sig_mask = 1ULL << sig_index;
|
|
|
|
// Store the initial state
|
|
last_index = start;
|
|
last_sample = (get_sample(start) & sig_mask) != 0;
|
|
|
|
while (index + block_length <= end)
|
|
{
|
|
//----- Continue to search -----//
|
|
level = min_level;
|
|
|
|
// We cannot fast-forward if there is no mip-map data at
|
|
// at the minimum level.
|
|
fast_forward = (_mip_map[level].data != NULL);
|
|
|
|
// Search individual samples up to the beginning of
|
|
// the next first level mip map block
|
|
uint64_t final_index = min(end,
|
|
pow2_ceil(index, MipMapScalePower));
|
|
|
|
for (; index < final_index &&
|
|
(index & ~(~0 << MipMapScalePower)) != 0;
|
|
index++)
|
|
{
|
|
const bool sample =
|
|
(get_sample(index) & sig_mask) != 0;
|
|
|
|
// If there was a change we cannot fast forward
|
|
if (sample != last_sample) {
|
|
fast_forward = false;
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (fast_forward) {
|
|
|
|
// Fast forward: This involves zooming out to higher
|
|
// levels of the mip map searching for changes, then
|
|
// zooming in on them to find the point where the edge
|
|
// begins.
|
|
|
|
// Slide right and zoom out at the beginnings of mip-map
|
|
// blocks until we encounter a change
|
|
while (1) {
|
|
const int level_scale_power =
|
|
(level + 1) * MipMapScalePower;
|
|
const uint64_t offset =
|
|
index >> level_scale_power;
|
|
|
|
// Check if we reached the last block at this
|
|
// level, or if there was a change in this block
|
|
if (offset >= _mip_map[level].length ||
|
|
(get_subsample(level, offset) &
|
|
sig_mask))
|
|
break;
|
|
|
|
if ((offset & ~(~0 << MipMapScalePower)) == 0) {
|
|
// If we are now at the beginning of a
|
|
// higher level mip-map block ascend one
|
|
// level
|
|
if (level + 1 >= ScaleStepCount ||
|
|
!_mip_map[level + 1].data)
|
|
break;
|
|
|
|
level++;
|
|
} else {
|
|
// Slide right to the beginning of the
|
|
// next mip map block
|
|
index = pow2_ceil(index + 1,
|
|
level_scale_power);
|
|
}
|
|
}
|
|
|
|
// Zoom in, and slide right until we encounter a change,
|
|
// and repeat until we reach min_level
|
|
while (1) {
|
|
assert(_mip_map[level].data);
|
|
|
|
const int level_scale_power =
|
|
(level + 1) * MipMapScalePower;
|
|
const uint64_t offset =
|
|
index >> level_scale_power;
|
|
|
|
// Check if we reached the last block at this
|
|
// level, or if there was a change in this block
|
|
if (offset >= _mip_map[level].length ||
|
|
(get_subsample(level, offset) &
|
|
sig_mask)) {
|
|
// Zoom in unless we reached the minimum
|
|
// zoom
|
|
if (level == min_level)
|
|
break;
|
|
|
|
level--;
|
|
} else {
|
|
// Slide right to the beginning of the
|
|
// next mip map block
|
|
index = pow2_ceil(index + 1,
|
|
level_scale_power);
|
|
}
|
|
}
|
|
|
|
// If individual samples within the limit of resolution,
|
|
// do a linear search for the next transition within the
|
|
// block
|
|
for (; index < end; index++) {
|
|
const bool sample = (get_sample(index) &
|
|
sig_mask) != 0;
|
|
if (sample != last_sample)
|
|
break;
|
|
}
|
|
}
|
|
|
|
//----- Store the edge -----//
|
|
|
|
// Take the last sample of the quanization block
|
|
final_index = index + block_length;
|
|
if (index + block_length > end)
|
|
break;
|
|
|
|
// get pulse width
|
|
const bool final_sample =
|
|
(get_sample(final_index - 1) & sig_mask) != 0;
|
|
min_pulse = min(index - last_index, min_pulse);
|
|
last_index = index;
|
|
if (min_pulse == 1)
|
|
break;
|
|
|
|
index = final_index;
|
|
last_sample = final_sample;
|
|
}
|
|
|
|
// Add the final state
|
|
min_pulse = min(end - last_index, min_pulse);
|
|
|
|
return min_pulse;
|
|
}
|
|
|
|
uint64_t LogicSnapshot::get_subsample(int level, uint64_t offset) const
|
|
{
|
|
assert(level >= 0);
|
|
assert(_mip_map[level].data);
|
|
return *(uint64_t*)((uint8_t*)_mip_map[level].data +
|
|
_unit_size * offset);
|
|
}
|
|
|
|
uint64_t LogicSnapshot::pow2_ceil(uint64_t x, unsigned int power)
|
|
{
|
|
const uint64_t p = 1 << power;
|
|
return (x + p - 1) / p * p;
|
|
}
|
|
|
|
} // namespace data
|
|
} // namespace pv
|