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"
29 using std::enable_shared_from_this;
31 using std::shared_ptr;
38 namespace LogicSegmentTest {
51 class LogicSegment : public Segment, public enable_shared_from_this<Segment>
56 typedef pair<int64_t, bool> EdgePair;
58 static const unsigned int ScaleStepCount = 10;
59 static const int MipMapScalePower;
60 static const int MipMapScaleFactor;
61 static const float LogMipMapScaleFactor;
62 static const uint64_t MipMapDataUnit;
73 LogicSegment(pv::data::Logic& owner, uint32_t segment_id,
74 unsigned int unit_size, uint64_t samplerate);
76 virtual ~LogicSegment();
79 * Using enable_shared_from_this prevents the normal use of shared_ptr
80 * instances by users of LogicSegment instances. Instead, shared_ptrs may
81 * only be created by the instance itself.
82 * See https://en.cppreference.com/w/cpp/memory/enable_shared_from_this
84 shared_ptr<const LogicSegment> get_shared_ptr() const;
86 void append_payload(shared_ptr<sigrok::Logic> logic);
87 void append_payload(void *data, uint64_t data_size);
89 void get_samples(int64_t start_sample, int64_t end_sample, uint8_t* dest) const;
92 * Parses a logic data segment to generate a list of transitions
93 * in a time interval to a given level of detail.
94 * @param[out] edges The vector to place the edges into.
95 * @param[in] start The start sample index.
96 * @param[in] end The end sample index.
97 * @param[in] min_length The minimum number of samples that
98 * can be resolved at this level of detail.
99 * @param[in] sig_index The index of the signal.
101 void get_subsampled_edges(vector<EdgePair> &edges,
102 uint64_t start, uint64_t end,
103 float min_length, int sig_index, bool first_change_only = false);
105 void get_surrounding_edges(vector<EdgePair> &dest,
106 uint64_t origin_sample, float min_length, int sig_index);
109 uint64_t unpack_sample(const uint8_t *ptr) const;
110 void pack_sample(uint8_t *ptr, uint64_t value);
112 void reallocate_mipmap_level(MipMapLevel &m);
114 void append_payload_to_mipmap();
116 uint64_t get_unpacked_sample(uint64_t index) const;
118 template <class T> void downsampleTmain(const T*&in, T &acc, T &prev);
119 template <class T> void downsampleT(const uint8_t *in, uint8_t *&out, uint64_t len);
120 void downsampleGeneric(const uint8_t *in, uint8_t *&out, uint64_t len);
123 uint64_t get_subsample(int level, uint64_t offset) const;
125 static uint64_t pow2_ceil(uint64_t x, unsigned int power);
130 struct MipMapLevel mip_map_[ScaleStepCount];
131 uint64_t last_append_sample_;
132 uint64_t last_append_accumulator_;
133 uint64_t last_append_extra_;
135 friend struct LogicSegmentTest::Pow2;
136 friend struct LogicSegmentTest::Basic;
137 friend struct LogicSegmentTest::LargeData;
138 friend struct LogicSegmentTest::Pulses;
139 friend struct LogicSegmentTest::LongPulses;
145 #endif // PULSEVIEW_PV_DATA_LOGICSEGMENT_HPP