]>
Commit | Line | Data |
---|---|---|
aba1dd16 JH |
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 | |
efdec55a | 17 | * along with this program; if not, see <http://www.gnu.org/licenses/>. |
aba1dd16 JH |
18 | */ |
19 | ||
20 | #include <extdef.h> | |
21 | ||
eb8269e3 | 22 | #include <cassert> |
d9e71737 | 23 | #include <cmath> |
aca9aa83 UH |
24 | #include <cstdlib> |
25 | #include <cstring> | |
adb2a97b | 26 | #include <memory> |
aba1dd16 | 27 | |
fda5b6e0 JH |
28 | #include <algorithm> |
29 | ||
7db61e77 | 30 | #include "analog.hpp" |
f3d66e52 | 31 | #include "analogsegment.hpp" |
aba1dd16 | 32 | |
3b68d03d JH |
33 | using std::lock_guard; |
34 | using std::recursive_mutex; | |
6f925ba9 | 35 | using std::make_pair; |
819f4c25 JH |
36 | using std::max; |
37 | using std::max_element; | |
38 | using std::min; | |
39 | using std::min_element; | |
6f925ba9 | 40 | using std::pair; |
adb2a97b | 41 | using std::unique_ptr; |
aba1dd16 JH |
42 | |
43 | namespace pv { | |
1b1ec774 | 44 | namespace data { |
aba1dd16 | 45 | |
f3d66e52 JH |
46 | const int AnalogSegment::EnvelopeScalePower = 4; |
47 | const int AnalogSegment::EnvelopeScaleFactor = 1 << EnvelopeScalePower; | |
c063290a | 48 | const float AnalogSegment::LogEnvelopeScaleFactor = logf(EnvelopeScaleFactor); |
51d3950f | 49 | const uint64_t AnalogSegment::EnvelopeDataUnit = 64 * 1024; // bytes |
fda5b6e0 | 50 | |
85a70280 SA |
51 | AnalogSegment::AnalogSegment(Analog& owner, uint32_t segment_id, uint64_t samplerate) : |
52 | Segment(segment_id, samplerate, sizeof(float)), | |
7db61e77 | 53 | owner_(owner), |
73e377fe SA |
54 | min_value_(0), |
55 | max_value_(0) | |
aba1dd16 | 56 | { |
8dbbc7f0 JH |
57 | lock_guard<recursive_mutex> lock(mutex_); |
58 | memset(envelope_levels_, 0, sizeof(envelope_levels_)); | |
aba1dd16 JH |
59 | } |
60 | ||
f3d66e52 | 61 | AnalogSegment::~AnalogSegment() |
fda5b6e0 | 62 | { |
8dbbc7f0 JH |
63 | lock_guard<recursive_mutex> lock(mutex_); |
64 | for (Envelope &e : envelope_levels_) | |
fda5b6e0 JH |
65 | free(e.samples); |
66 | } | |
67 | ||
f3d66e52 | 68 | void AnalogSegment::append_interleaved_samples(const float *data, |
bb2cdfff | 69 | size_t sample_count, size_t stride) |
aba1dd16 | 70 | { |
8dbbc7f0 | 71 | assert(unit_size_ == sizeof(float)); |
bb2cdfff | 72 | |
8dbbc7f0 | 73 | lock_guard<recursive_mutex> lock(mutex_); |
bb2cdfff | 74 | |
7db61e77 SA |
75 | uint64_t prev_sample_count = sample_count_; |
76 | ||
adb2a97b | 77 | // Deinterleave the samples and add them |
a00f8221 | 78 | unique_ptr<float[]> deint_data(new float[sample_count]); |
adb2a97b | 79 | float *deint_data_ptr = deint_data.get(); |
c063290a | 80 | for (uint32_t i = 0; i < sample_count; i++) { |
adb2a97b SA |
81 | *deint_data_ptr = (float)(*data); |
82 | deint_data_ptr++; | |
bb2cdfff JH |
83 | data += stride; |
84 | } | |
85 | ||
adb2a97b SA |
86 | append_samples(deint_data.get(), sample_count); |
87 | ||
fda5b6e0 JH |
88 | // Generate the first mip-map from the data |
89 | append_payload_to_envelope_levels(); | |
7db61e77 SA |
90 | |
91 | if (sample_count > 1) | |
92 | owner_.notify_samples_added(this, prev_sample_count + 1, | |
93 | prev_sample_count + 1 + sample_count); | |
94 | else | |
95 | owner_.notify_samples_added(this, prev_sample_count + 1, | |
96 | prev_sample_count + 1); | |
aba1dd16 JH |
97 | } |
98 | ||
b82243f7 SA |
99 | void AnalogSegment::get_samples(int64_t start_sample, int64_t end_sample, |
100 | float* dest) const | |
a8acb46e | 101 | { |
d3758367 | 102 | assert(start_sample >= 0); |
8dbbc7f0 | 103 | assert(start_sample < (int64_t)sample_count_); |
d3758367 | 104 | assert(end_sample >= 0); |
b21501d6 | 105 | assert(end_sample <= (int64_t)sample_count_); |
d3758367 | 106 | assert(start_sample <= end_sample); |
b82243f7 | 107 | assert(dest != nullptr); |
d3758367 | 108 | |
8dbbc7f0 | 109 | lock_guard<recursive_mutex> lock(mutex_); |
d3758367 | 110 | |
b82243f7 | 111 | get_raw_samples(start_sample, (end_sample - start_sample), (uint8_t*)dest); |
26a883ed SA |
112 | } |
113 | ||
6f925ba9 | 114 | const pair<float, float> AnalogSegment::get_min_max() const |
73e377fe | 115 | { |
6f925ba9 | 116 | return make_pair(min_value_, max_value_); |
73e377fe SA |
117 | } |
118 | ||
c70e3464 | 119 | SegmentAnalogDataIterator* AnalogSegment::begin_sample_iteration(uint64_t start) |
26a883ed SA |
120 | { |
121 | return (SegmentAnalogDataIterator*)begin_raw_sample_iteration(start); | |
122 | } | |
123 | ||
c70e3464 | 124 | void AnalogSegment::continue_sample_iteration(SegmentAnalogDataIterator* it, uint64_t increase) |
26a883ed SA |
125 | { |
126 | Segment::continue_raw_sample_iteration((SegmentRawDataIterator*)it, increase); | |
127 | } | |
128 | ||
c70e3464 | 129 | void AnalogSegment::end_sample_iteration(SegmentAnalogDataIterator* it) |
26a883ed SA |
130 | { |
131 | Segment::end_raw_sample_iteration((SegmentRawDataIterator*)it); | |
a8acb46e JH |
132 | } |
133 | ||
f3d66e52 | 134 | void AnalogSegment::get_envelope_section(EnvelopeSection &s, |
9320072d JH |
135 | uint64_t start, uint64_t end, float min_length) const |
136 | { | |
137 | assert(end <= get_sample_count()); | |
138 | assert(start <= end); | |
139 | assert(min_length > 0); | |
140 | ||
8dbbc7f0 | 141 | lock_guard<recursive_mutex> lock(mutex_); |
9320072d JH |
142 | |
143 | const unsigned int min_level = max((int)floorf(logf(min_length) / | |
144 | LogEnvelopeScaleFactor) - 1, 0); | |
145 | const unsigned int scale_power = (min_level + 1) * | |
146 | EnvelopeScalePower; | |
147 | start >>= scale_power; | |
148 | end >>= scale_power; | |
149 | ||
150 | s.start = start << scale_power; | |
151 | s.scale = 1 << scale_power; | |
152 | s.length = end - start; | |
153 | s.samples = new EnvelopeSample[s.length]; | |
8dbbc7f0 | 154 | memcpy(s.samples, envelope_levels_[min_level].samples + start, |
9320072d JH |
155 | s.length * sizeof(EnvelopeSample)); |
156 | } | |
157 | ||
f3d66e52 | 158 | void AnalogSegment::reallocate_envelope(Envelope &e) |
fda5b6e0 JH |
159 | { |
160 | const uint64_t new_data_length = ((e.length + EnvelopeDataUnit - 1) / | |
161 | EnvelopeDataUnit) * EnvelopeDataUnit; | |
2ad82c2e | 162 | if (new_data_length > e.data_length) { |
fda5b6e0 JH |
163 | e.data_length = new_data_length; |
164 | e.samples = (EnvelopeSample*)realloc(e.samples, | |
165 | new_data_length * sizeof(EnvelopeSample)); | |
166 | } | |
167 | } | |
168 | ||
f3d66e52 | 169 | void AnalogSegment::append_payload_to_envelope_levels() |
fda5b6e0 | 170 | { |
8dbbc7f0 | 171 | Envelope &e0 = envelope_levels_[0]; |
fda5b6e0 JH |
172 | uint64_t prev_length; |
173 | EnvelopeSample *dest_ptr; | |
26a883ed | 174 | SegmentRawDataIterator* it; |
fda5b6e0 JH |
175 | |
176 | // Expand the data buffer to fit the new samples | |
177 | prev_length = e0.length; | |
8dbbc7f0 | 178 | e0.length = sample_count_ / EnvelopeScaleFactor; |
fda5b6e0 | 179 | |
67b0df27 | 180 | // Calculate min/max values in case we have too few samples for an envelope |
8e15445c | 181 | const float old_min_value = min_value_, old_max_value = max_value_; |
67b0df27 SA |
182 | if (sample_count_ < EnvelopeScaleFactor) { |
183 | it = begin_raw_sample_iteration(0); | |
184 | for (uint64_t i = 0; i < sample_count_; i++) { | |
185 | const float sample = *((float*)it->value); | |
c063290a UH |
186 | if (sample < min_value_) |
187 | min_value_ = sample; | |
188 | if (sample > max_value_) | |
189 | max_value_ = sample; | |
67b0df27 SA |
190 | continue_raw_sample_iteration(it, 1); |
191 | } | |
192 | end_raw_sample_iteration(it); | |
193 | } | |
194 | ||
fda5b6e0 JH |
195 | // Break off if there are no new samples to compute |
196 | if (e0.length == prev_length) | |
197 | return; | |
198 | ||
199 | reallocate_envelope(e0); | |
200 | ||
201 | dest_ptr = e0.samples + prev_length; | |
202 | ||
203 | // Iterate through the samples to populate the first level mipmap | |
26a883ed | 204 | uint64_t start_sample = prev_length * EnvelopeScaleFactor; |
c063290a | 205 | uint64_t end_sample = e0.length * EnvelopeScaleFactor; |
26a883ed SA |
206 | |
207 | it = begin_raw_sample_iteration(start_sample); | |
208 | for (uint64_t i = start_sample; i < end_sample; i += EnvelopeScaleFactor) { | |
209 | const float* samples = (float*)it->value; | |
210 | ||
fda5b6e0 | 211 | const EnvelopeSample sub_sample = { |
26a883ed SA |
212 | *min_element(samples, samples + EnvelopeScaleFactor), |
213 | *max_element(samples, samples + EnvelopeScaleFactor), | |
fda5b6e0 JH |
214 | }; |
215 | ||
c063290a UH |
216 | if (sub_sample.min < min_value_) |
217 | min_value_ = sub_sample.min; | |
218 | if (sub_sample.max > max_value_) | |
219 | max_value_ = sub_sample.max; | |
73e377fe | 220 | |
26a883ed | 221 | continue_raw_sample_iteration(it, EnvelopeScaleFactor); |
fda5b6e0 JH |
222 | *dest_ptr++ = sub_sample; |
223 | } | |
26a883ed | 224 | end_raw_sample_iteration(it); |
fda5b6e0 JH |
225 | |
226 | // Compute higher level mipmaps | |
2ad82c2e | 227 | for (unsigned int level = 1; level < ScaleStepCount; level++) { |
8dbbc7f0 | 228 | Envelope &e = envelope_levels_[level]; |
c063290a | 229 | const Envelope &el = envelope_levels_[level - 1]; |
fda5b6e0 JH |
230 | |
231 | // Expand the data buffer to fit the new samples | |
232 | prev_length = e.length; | |
233 | e.length = el.length / EnvelopeScaleFactor; | |
234 | ||
26a883ed | 235 | // Break off if there are no more samples to be computed |
fda5b6e0 JH |
236 | if (e.length == prev_length) |
237 | break; | |
238 | ||
239 | reallocate_envelope(e); | |
240 | ||
26a883ed | 241 | // Subsample the lower level |
fda5b6e0 JH |
242 | const EnvelopeSample *src_ptr = |
243 | el.samples + prev_length * EnvelopeScaleFactor; | |
244 | const EnvelopeSample *const end_dest_ptr = e.samples + e.length; | |
26a883ed | 245 | |
fda5b6e0 | 246 | for (dest_ptr = e.samples + prev_length; |
2ad82c2e | 247 | dest_ptr < end_dest_ptr; dest_ptr++) { |
fda5b6e0 JH |
248 | const EnvelopeSample *const end_src_ptr = |
249 | src_ptr + EnvelopeScaleFactor; | |
250 | ||
251 | EnvelopeSample sub_sample = *src_ptr++; | |
2ad82c2e | 252 | while (src_ptr < end_src_ptr) { |
73e377fe | 253 | sub_sample.min = min(sub_sample.min, src_ptr->min);; |
fda5b6e0 JH |
254 | sub_sample.max = max(sub_sample.max, src_ptr->max); |
255 | src_ptr++; | |
256 | } | |
257 | ||
258 | *dest_ptr = sub_sample; | |
259 | } | |
260 | } | |
8e15445c SA |
261 | |
262 | // Notify if the min or max value changed | |
263 | if ((old_min_value != min_value_) || (old_max_value != max_value_)) | |
264 | owner_.min_max_changed(min_value_, max_value_); | |
fda5b6e0 JH |
265 | } |
266 | ||
1b1ec774 | 267 | } // namespace data |
aba1dd16 | 268 | } // namespace pv |