2 * This file is part of the PulseView project.
4 * Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 2 of the License, or
9 * (at your option) any later version.
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, see <http://www.gnu.org/licenses/>.
28 #include "logicsegment.hpp"
30 #include <libsigrokcxx/libsigrokcxx.hpp>
32 using std::lock_guard;
33 using std::recursive_mutex;
36 using std::shared_ptr;
44 const int LogicSegment::MipMapScalePower = 4;
45 const int LogicSegment::MipMapScaleFactor = 1 << MipMapScalePower;
46 const float LogicSegment::LogMipMapScaleFactor = logf(MipMapScaleFactor);
47 const uint64_t LogicSegment::MipMapDataUnit = 64 * 1024; // bytes
49 LogicSegment::LogicSegment(pv::data::Logic& owner, unsigned int unit_size,
50 uint64_t samplerate) :
51 Segment(samplerate, unit_size),
53 last_append_sample_(0)
55 memset(mip_map_, 0, sizeof(mip_map_));
58 LogicSegment::~LogicSegment()
60 lock_guard<recursive_mutex> lock(mutex_);
61 for (MipMapLevel &l : mip_map_)
65 uint64_t LogicSegment::unpack_sample(const uint8_t *ptr) const
67 #ifdef HAVE_UNALIGNED_LITTLE_ENDIAN_ACCESS
68 return *(uint64_t*)ptr;
73 value |= ((uint64_t)ptr[7]) << 56;
76 value |= ((uint64_t)ptr[6]) << 48;
79 value |= ((uint64_t)ptr[5]) << 40;
82 value |= ((uint64_t)ptr[4]) << 32;
85 value |= ((uint32_t)ptr[3]) << 24;
88 value |= ((uint32_t)ptr[2]) << 16;
103 void LogicSegment::pack_sample(uint8_t *ptr, uint64_t value)
105 #ifdef HAVE_UNALIGNED_LITTLE_ENDIAN_ACCESS
106 *(uint64_t*)ptr = value;
108 switch (unit_size_) {
110 ptr[7] = value >> 56;
113 ptr[6] = value >> 48;
116 ptr[5] = value >> 40;
119 ptr[4] = value >> 32;
122 ptr[3] = value >> 24;
125 ptr[2] = value >> 16;
139 void LogicSegment::append_payload(shared_ptr<sigrok::Logic> logic)
141 assert(unit_size_ == logic->unit_size());
142 assert((logic->data_length() % unit_size_) == 0);
144 append_payload(logic->data_pointer(), logic->data_length());
147 void LogicSegment::append_payload(void *data, uint64_t data_size)
149 assert((data_size % unit_size_) == 0);
151 lock_guard<recursive_mutex> lock(mutex_);
153 uint64_t prev_sample_count = sample_count_;
154 uint64_t sample_count = data_size / unit_size_;
156 append_samples(data, sample_count);
158 // Generate the first mip-map from the data
159 append_payload_to_mipmap();
161 if (sample_count > 1)
162 owner_.notify_samples_added(this, prev_sample_count + 1,
163 prev_sample_count + 1 + sample_count);
165 owner_.notify_samples_added(this, prev_sample_count + 1,
166 prev_sample_count + 1);
169 void LogicSegment::get_samples(int64_t start_sample,
170 int64_t end_sample, uint8_t* dest) const
172 assert(start_sample >= 0);
173 assert(start_sample <= (int64_t)sample_count_);
174 assert(end_sample >= 0);
175 assert(end_sample <= (int64_t)sample_count_);
176 assert(start_sample <= end_sample);
177 assert(dest != nullptr);
179 lock_guard<recursive_mutex> lock(mutex_);
181 get_raw_samples(start_sample, (end_sample - start_sample), dest);
184 SegmentLogicDataIterator* LogicSegment::begin_sample_iteration(uint64_t start)
186 return (SegmentLogicDataIterator*)begin_raw_sample_iteration(start);
189 void LogicSegment::continue_sample_iteration(SegmentLogicDataIterator* it, uint64_t increase)
191 Segment::continue_raw_sample_iteration((SegmentRawDataIterator*)it, increase);
194 void LogicSegment::end_sample_iteration(SegmentLogicDataIterator* it)
196 Segment::end_raw_sample_iteration((SegmentRawDataIterator*)it);
199 void LogicSegment::reallocate_mipmap_level(MipMapLevel &m)
201 lock_guard<recursive_mutex> lock(mutex_);
203 const uint64_t new_data_length = ((m.length + MipMapDataUnit - 1) /
204 MipMapDataUnit) * MipMapDataUnit;
206 if (new_data_length > m.data_length) {
207 m.data_length = new_data_length;
209 // Padding is added to allow for the uint64_t write word
210 m.data = realloc(m.data, new_data_length * unit_size_ +
215 void LogicSegment::append_payload_to_mipmap()
217 MipMapLevel &m0 = mip_map_[0];
218 uint64_t prev_length;
220 SegmentRawDataIterator* it;
221 uint64_t accumulator;
222 unsigned int diff_counter;
224 // Expand the data buffer to fit the new samples
225 prev_length = m0.length;
226 m0.length = sample_count_ / MipMapScaleFactor;
228 // Break off if there are no new samples to compute
229 if (m0.length == prev_length)
232 reallocate_mipmap_level(m0);
234 dest_ptr = (uint8_t*)m0.data + prev_length * unit_size_;
236 // Iterate through the samples to populate the first level mipmap
237 uint64_t start_sample = prev_length * MipMapScaleFactor;
238 uint64_t end_sample = m0.length * MipMapScaleFactor;
240 it = begin_raw_sample_iteration(start_sample);
241 for (uint64_t i = start_sample; i < end_sample;) {
242 // Accumulate transitions which have occurred in this sample
244 diff_counter = MipMapScaleFactor;
245 while (diff_counter-- > 0) {
246 const uint64_t sample = unpack_sample(it->value);
247 accumulator |= last_append_sample_ ^ sample;
248 last_append_sample_ = sample;
249 continue_raw_sample_iteration(it, 1);
253 pack_sample(dest_ptr, accumulator);
254 dest_ptr += unit_size_;
256 end_raw_sample_iteration(it);
258 // Compute higher level mipmaps
259 for (unsigned int level = 1; level < ScaleStepCount; level++) {
260 MipMapLevel &m = mip_map_[level];
261 const MipMapLevel &ml = mip_map_[level - 1];
263 // Expand the data buffer to fit the new samples
264 prev_length = m.length;
265 m.length = ml.length / MipMapScaleFactor;
267 // Break off if there are no more samples to be computed
268 if (m.length == prev_length)
271 reallocate_mipmap_level(m);
273 // Subsample the lower level
274 const uint8_t* src_ptr = (uint8_t*)ml.data +
275 unit_size_ * prev_length * MipMapScaleFactor;
276 const uint8_t *const end_dest_ptr =
277 (uint8_t*)m.data + unit_size_ * m.length;
279 for (dest_ptr = (uint8_t*)m.data +
280 unit_size_ * prev_length;
281 dest_ptr < end_dest_ptr;
282 dest_ptr += unit_size_) {
284 diff_counter = MipMapScaleFactor;
285 while (diff_counter-- > 0) {
286 accumulator |= unpack_sample(src_ptr);
287 src_ptr += unit_size_;
290 pack_sample(dest_ptr, accumulator);
295 uint64_t LogicSegment::get_unpacked_sample(uint64_t index) const
297 assert(index < sample_count_);
299 uint8_t* data = new uint8_t[unit_size_];
300 get_raw_samples(index, 1, data);
301 uint64_t sample = unpack_sample(data);
307 void LogicSegment::get_subsampled_edges(
308 vector<EdgePair> &edges,
309 uint64_t start, uint64_t end,
310 float min_length, int sig_index)
312 uint64_t index = start;
317 assert(end <= get_sample_count());
318 assert(start <= end);
319 assert(min_length > 0);
320 assert(sig_index >= 0);
321 assert(sig_index < 64);
323 lock_guard<recursive_mutex> lock(mutex_);
325 const uint64_t block_length = (uint64_t)max(min_length, 1.0f);
326 const unsigned int min_level = max((int)floorf(logf(min_length) /
327 LogMipMapScaleFactor) - 1, 0);
328 const uint64_t sig_mask = 1ULL << sig_index;
330 // Store the initial state
331 last_sample = (get_unpacked_sample(start) & sig_mask) != 0;
332 edges.emplace_back(index++, last_sample);
334 while (index + block_length <= end) {
335 //----- Continue to search -----//
338 // We cannot fast-forward if there is no mip-map data at
339 // at the minimum level.
340 fast_forward = (mip_map_[level].data != nullptr);
342 if (min_length < MipMapScaleFactor) {
343 // Search individual samples up to the beginning of
344 // the next first level mip map block
345 const uint64_t final_index = min(end,
346 pow2_ceil(index, MipMapScalePower));
348 for (; index < final_index &&
349 (index & ~((uint64_t)(~0) << MipMapScalePower)) != 0;
352 (get_unpacked_sample(index) & sig_mask) != 0;
354 // If there was a change we cannot fast forward
355 if (sample != last_sample) {
356 fast_forward = false;
361 // If resolution is less than a mip map block,
362 // round up to the beginning of the mip-map block
363 // for this level of detail
364 const int min_level_scale_power =
365 (level + 1) * MipMapScalePower;
366 index = pow2_ceil(index, min_level_scale_power);
370 // We can fast forward only if there was no change
372 (get_unpacked_sample(index) & sig_mask) != 0;
373 if (last_sample != sample)
374 fast_forward = false;
379 // Fast forward: This involves zooming out to higher
380 // levels of the mip map searching for changes, then
381 // zooming in on them to find the point where the edge
384 // Slide right and zoom out at the beginnings of mip-map
385 // blocks until we encounter a change
387 const int level_scale_power =
388 (level + 1) * MipMapScalePower;
389 const uint64_t offset =
390 index >> level_scale_power;
392 // Check if we reached the last block at this
393 // level, or if there was a change in this block
394 if (offset >= mip_map_[level].length ||
395 (get_subsample(level, offset) &
399 if ((offset & ~((uint64_t)(~0) << MipMapScalePower)) == 0) {
400 // If we are now at the beginning of a
401 // higher level mip-map block ascend one
403 if (level + 1 >= ScaleStepCount ||
404 !mip_map_[level + 1].data)
409 // Slide right to the beginning of the
410 // next mip map block
411 index = pow2_ceil(index + 1,
416 // Zoom in, and slide right until we encounter a change,
417 // and repeat until we reach min_level
419 assert(mip_map_[level].data);
421 const int level_scale_power =
422 (level + 1) * MipMapScalePower;
423 const uint64_t offset =
424 index >> level_scale_power;
426 // Check if we reached the last block at this
427 // level, or if there was a change in this block
428 if (offset >= mip_map_[level].length ||
429 (get_subsample(level, offset) &
431 // Zoom in unless we reached the minimum
433 if (level == min_level)
438 // Slide right to the beginning of the
439 // next mip map block
440 index = pow2_ceil(index + 1,
445 // If individual samples within the limit of resolution,
446 // do a linear search for the next transition within the
448 if (min_length < MipMapScaleFactor) {
449 for (; index < end; index++) {
450 const bool sample = (get_unpacked_sample(index) &
452 if (sample != last_sample)
458 //----- Store the edge -----//
460 // Take the last sample of the quanization block
461 const int64_t final_index = index + block_length;
462 if (index + block_length > end)
465 // Store the final state
466 const bool final_sample =
467 (get_unpacked_sample(final_index - 1) & sig_mask) != 0;
468 edges.emplace_back(index, final_sample);
471 last_sample = final_sample;
474 // Add the final state
475 const bool end_sample = get_unpacked_sample(end) & sig_mask;
476 if (last_sample != end_sample)
477 edges.emplace_back(end, end_sample);
478 edges.emplace_back(end + 1, end_sample);
481 uint64_t LogicSegment::get_subsample(int level, uint64_t offset) const
484 assert(mip_map_[level].data);
485 return unpack_sample((uint8_t*)mip_map_[level].data +
486 unit_size_ * offset);
489 uint64_t LogicSegment::pow2_ceil(uint64_t x, unsigned int power)
491 const uint64_t p = 1 << power;
492 return (x + p - 1) / p * p;