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"
31 using std::shared_ptr;
38 namespace LogicSegmentTest {
52 uint64_t sample_index, chunk_num, chunk_offs;
55 } SegmentLogicDataIterator;
57 class LogicSegment : public QObject, public Segment
70 static const unsigned int ScaleStepCount = 10;
71 static const int MipMapScalePower;
72 static const int MipMapScaleFactor;
73 static const float LogMipMapScaleFactor;
74 static const uint64_t MipMapDataUnit;
77 typedef pair<int64_t, bool> EdgePair;
80 LogicSegment(pv::data::Logic& owner, shared_ptr<sigrok::Logic> data, uint64_t samplerate);
82 virtual ~LogicSegment();
84 void append_payload(shared_ptr<sigrok::Logic> logic);
86 const uint8_t* get_samples(int64_t start_sample, int64_t end_sample) const;
88 SegmentLogicDataIterator* begin_sample_iteration(uint64_t start);
89 void continue_sample_iteration(SegmentLogicDataIterator* it, uint64_t increase);
90 void end_sample_iteration(SegmentLogicDataIterator* it);
93 uint64_t unpack_sample(const uint8_t *ptr) const;
94 void pack_sample(uint8_t *ptr, uint64_t value);
96 void reallocate_mipmap_level(MipMapLevel &m);
98 void append_payload_to_mipmap();
100 uint64_t get_unpacked_sample(uint64_t index) const;
104 * Parses a logic data segment to generate a list of transitions
105 * in a time interval to a given level of detail.
106 * @param[out] edges The vector to place the edges into.
107 * @param[in] start The start sample index.
108 * @param[in] end The end sample index.
109 * @param[in] min_length The minimum number of samples that
110 * can be resolved at this level of detail.
111 * @param[in] sig_index The index of the signal.
113 void get_subsampled_edges(vector<EdgePair> &edges,
114 uint64_t start, uint64_t end,
115 float min_length, int sig_index);
118 uint64_t get_subsample(int level, uint64_t offset) const;
120 static uint64_t pow2_ceil(uint64_t x, unsigned int power);
125 struct MipMapLevel mip_map_[ScaleStepCount];
126 uint64_t last_append_sample_;
128 friend struct LogicSegmentTest::Pow2;
129 friend struct LogicSegmentTest::Basic;
130 friend struct LogicSegmentTest::LargeData;
131 friend struct LogicSegmentTest::Pulses;
132 friend struct LogicSegmentTest::LongPulses;
138 #endif // PULSEVIEW_PV_DATA_LOGICSEGMENT_HPP