]> sigrok.org Git - pulseview.git/blame_incremental - pv/data/logicsegment.hpp
DecodeSignal: Unpause reliably
[pulseview.git] / pv / data / logicsegment.hpp
... / ...
CommitLineData
1/*
2 * This file is part of the PulseView project.
3 *
4 * Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
5 *
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.
10 *
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.
15 *
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/>.
18 */
19
20#ifndef PULSEVIEW_PV_DATA_LOGICSEGMENT_HPP
21#define PULSEVIEW_PV_DATA_LOGICSEGMENT_HPP
22
23#include "segment.hpp"
24
25#include <utility>
26#include <vector>
27
28#include <QObject>
29
30using std::pair;
31using std::shared_ptr;
32using std::vector;
33
34namespace sigrok {
35 class Logic;
36}
37
38namespace LogicSegmentTest {
39struct Pow2;
40struct Basic;
41struct LargeData;
42struct Pulses;
43struct LongPulses;
44}
45
46namespace pv {
47namespace data {
48
49class Logic;
50
51typedef struct {
52 uint64_t sample_index, chunk_num, chunk_offs;
53 uint8_t* chunk;
54 uint8_t* value;
55} SegmentLogicDataIterator;
56
57class LogicSegment : public Segment
58{
59 Q_OBJECT
60
61public:
62 typedef pair<int64_t, bool> EdgePair;
63
64 static const unsigned int ScaleStepCount = 10;
65 static const int MipMapScalePower;
66 static const int MipMapScaleFactor;
67 static const float LogMipMapScaleFactor;
68 static const uint64_t MipMapDataUnit;
69
70private:
71 struct MipMapLevel
72 {
73 uint64_t length;
74 uint64_t data_length;
75 void *data;
76 };
77
78public:
79 LogicSegment(pv::data::Logic& owner, uint32_t segment_id,
80 unsigned int unit_size, uint64_t samplerate);
81
82 virtual ~LogicSegment();
83
84 void append_payload(shared_ptr<sigrok::Logic> logic);
85 void append_payload(void *data, uint64_t data_size);
86
87 void get_samples(int64_t start_sample, int64_t end_sample, uint8_t* dest) const;
88
89 SegmentLogicDataIterator* begin_sample_iteration(uint64_t start);
90 void continue_sample_iteration(SegmentLogicDataIterator* it, uint64_t increase);
91 void end_sample_iteration(SegmentLogicDataIterator* it);
92
93private:
94 uint64_t unpack_sample(const uint8_t *ptr) const;
95 void pack_sample(uint8_t *ptr, uint64_t value);
96
97 void reallocate_mipmap_level(MipMapLevel &m);
98
99 void append_payload_to_mipmap();
100
101 uint64_t get_unpacked_sample(uint64_t index) const;
102
103public:
104 /**
105 * Parses a logic data segment to generate a list of transitions
106 * in a time interval to a given level of detail.
107 * @param[out] edges The vector to place the edges into.
108 * @param[in] start The start sample index.
109 * @param[in] end The end sample index.
110 * @param[in] min_length The minimum number of samples that
111 * can be resolved at this level of detail.
112 * @param[in] sig_index The index of the signal.
113 */
114 void get_subsampled_edges(vector<EdgePair> &edges,
115 uint64_t start, uint64_t end,
116 float min_length, int sig_index);
117
118private:
119 uint64_t get_subsample(int level, uint64_t offset) const;
120
121 static uint64_t pow2_ceil(uint64_t x, unsigned int power);
122
123private:
124 Logic& owner_;
125
126 struct MipMapLevel mip_map_[ScaleStepCount];
127 uint64_t last_append_sample_;
128
129 friend struct LogicSegmentTest::Pow2;
130 friend struct LogicSegmentTest::Basic;
131 friend struct LogicSegmentTest::LargeData;
132 friend struct LogicSegmentTest::Pulses;
133 friend struct LogicSegmentTest::LongPulses;
134};
135
136} // namespace data
137} // namespace pv
138
139#endif // PULSEVIEW_PV_DATA_LOGICSEGMENT_HPP