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"
32 namespace LogicSegmentTest {
44 uint64_t sample_index, chunk_num, chunk_offs;
47 } SegmentLogicDataIterator;
49 class LogicSegment : public Segment
60 static const unsigned int ScaleStepCount = 10;
61 static const int MipMapScalePower;
62 static const int MipMapScaleFactor;
63 static const float LogMipMapScaleFactor;
64 static const uint64_t MipMapDataUnit;
67 typedef std::pair<int64_t, bool> EdgePair;
70 LogicSegment(std::shared_ptr<sigrok::Logic> logic, uint64_t samplerate);
72 virtual ~LogicSegment();
74 void append_payload(std::shared_ptr<sigrok::Logic> logic);
76 const uint8_t* get_samples(int64_t start_sample, int64_t end_sample) const;
78 SegmentLogicDataIterator* begin_sample_iteration(uint64_t start) const;
79 void continue_sample_iteration(SegmentLogicDataIterator* it, uint64_t increase) const;
80 void end_sample_iteration(SegmentLogicDataIterator* it) const;
83 uint64_t unpack_sample(const uint8_t *ptr) const;
84 void pack_sample(uint8_t *ptr, uint64_t value);
86 void reallocate_mipmap_level(MipMapLevel &m);
88 void append_payload_to_mipmap();
90 uint64_t get_unpacked_sample(uint64_t index) const;
94 * Parses a logic data segment to generate a list of transitions
95 * in a time interval to a given level of detail.
96 * @param[out] edges The vector to place the edges into.
97 * @param[in] start The start sample index.
98 * @param[in] end The end sample index.
99 * @param[in] min_length The minimum number of samples that
100 * can be resolved at this level of detail.
101 * @param[in] sig_index The index of the signal.
103 void get_subsampled_edges(std::vector<EdgePair> &edges,
104 uint64_t start, uint64_t end,
105 float min_length, int sig_index);
108 uint64_t get_subsample(int level, uint64_t offset) const;
110 static uint64_t pow2_ceil(uint64_t x, unsigned int power);
113 struct MipMapLevel mip_map_[ScaleStepCount];
114 uint64_t last_append_sample_;
116 friend struct LogicSegmentTest::Pow2;
117 friend struct LogicSegmentTest::Basic;
118 friend struct LogicSegmentTest::LargeData;
119 friend struct LogicSegmentTest::Pulses;
120 friend struct LogicSegmentTest::LongPulses;
126 #endif // PULSEVIEW_PV_DATA_LOGICSEGMENT_HPP