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/>.
20 #ifndef PULSEVIEW_PV_DATA_LOGICSEGMENT_HPP
21 #define PULSEVIEW_PV_DATA_LOGICSEGMENT_HPP
23 #include "segment.hpp"
34 namespace LogicSegmentTest {
48 uint64_t sample_index, chunk_num, chunk_offs;
51 } SegmentLogicDataIterator;
53 class LogicSegment : public QObject, public Segment
66 static const unsigned int ScaleStepCount = 10;
67 static const int MipMapScalePower;
68 static const int MipMapScaleFactor;
69 static const float LogMipMapScaleFactor;
70 static const uint64_t MipMapDataUnit;
73 typedef std::pair<int64_t, bool> EdgePair;
76 LogicSegment(pv::data::Logic& owner, std::shared_ptr<sigrok::Logic> data, uint64_t samplerate);
78 virtual ~LogicSegment();
80 void append_payload(std::shared_ptr<sigrok::Logic> logic);
82 const uint8_t* get_samples(int64_t start_sample, int64_t end_sample) const;
84 SegmentLogicDataIterator* begin_sample_iteration(uint64_t start);
85 void continue_sample_iteration(SegmentLogicDataIterator* it, uint64_t increase);
86 void end_sample_iteration(SegmentLogicDataIterator* it);
89 uint64_t unpack_sample(const uint8_t *ptr) const;
90 void pack_sample(uint8_t *ptr, uint64_t value);
92 void reallocate_mipmap_level(MipMapLevel &m);
94 void append_payload_to_mipmap();
96 uint64_t get_unpacked_sample(uint64_t index) const;
100 * Parses a logic data segment to generate a list of transitions
101 * in a time interval to a given level of detail.
102 * @param[out] edges The vector to place the edges into.
103 * @param[in] start The start sample index.
104 * @param[in] end The end sample index.
105 * @param[in] min_length The minimum number of samples that
106 * can be resolved at this level of detail.
107 * @param[in] sig_index The index of the signal.
109 void get_subsampled_edges(std::vector<EdgePair> &edges,
110 uint64_t start, uint64_t end,
111 float min_length, int sig_index);
114 uint64_t get_subsample(int level, uint64_t offset) const;
116 static uint64_t pow2_ceil(uint64_t x, unsigned int power);
121 struct MipMapLevel mip_map_[ScaleStepCount];
122 uint64_t last_append_sample_;
124 friend struct LogicSegmentTest::Pow2;
125 friend struct LogicSegmentTest::Basic;
126 friend struct LogicSegmentTest::LargeData;
127 friend struct LogicSegmentTest::Pulses;
128 friend struct LogicSegmentTest::LongPulses;
134 #endif // PULSEVIEW_PV_DATA_LOGICSEGMENT_HPP