]>
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) | |
1f3033cb SA |
92 | owner_.notify_samples_added(shared_ptr<Segment>(shared_from_this()), |
93 | prev_sample_count + 1, prev_sample_count + 1 + sample_count); | |
7db61e77 | 94 | else |
1f3033cb SA |
95 | owner_.notify_samples_added(shared_ptr<Segment>(shared_from_this()), |
96 | prev_sample_count + 1, 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 | ||
65c92359 | 119 | float* AnalogSegment::get_iterator_value_ptr(SegmentDataIterator* it) |
26a883ed | 120 | { |
65c92359 | 121 | assert(it->sample_index <= (sample_count_ - 1)); |
26a883ed | 122 | |
65c92359 | 123 | return (float*)(it->chunk + it->chunk_offs); |
a8acb46e JH |
124 | } |
125 | ||
f3d66e52 | 126 | void AnalogSegment::get_envelope_section(EnvelopeSection &s, |
9320072d JH |
127 | uint64_t start, uint64_t end, float min_length) const |
128 | { | |
129 | assert(end <= get_sample_count()); | |
130 | assert(start <= end); | |
131 | assert(min_length > 0); | |
132 | ||
8dbbc7f0 | 133 | lock_guard<recursive_mutex> lock(mutex_); |
9320072d JH |
134 | |
135 | const unsigned int min_level = max((int)floorf(logf(min_length) / | |
136 | LogEnvelopeScaleFactor) - 1, 0); | |
137 | const unsigned int scale_power = (min_level + 1) * | |
138 | EnvelopeScalePower; | |
139 | start >>= scale_power; | |
140 | end >>= scale_power; | |
141 | ||
142 | s.start = start << scale_power; | |
143 | s.scale = 1 << scale_power; | |
144 | s.length = end - start; | |
145 | s.samples = new EnvelopeSample[s.length]; | |
8dbbc7f0 | 146 | memcpy(s.samples, envelope_levels_[min_level].samples + start, |
9320072d JH |
147 | s.length * sizeof(EnvelopeSample)); |
148 | } | |
149 | ||
f3d66e52 | 150 | void AnalogSegment::reallocate_envelope(Envelope &e) |
fda5b6e0 JH |
151 | { |
152 | const uint64_t new_data_length = ((e.length + EnvelopeDataUnit - 1) / | |
153 | EnvelopeDataUnit) * EnvelopeDataUnit; | |
2ad82c2e | 154 | if (new_data_length > e.data_length) { |
fda5b6e0 JH |
155 | e.data_length = new_data_length; |
156 | e.samples = (EnvelopeSample*)realloc(e.samples, | |
157 | new_data_length * sizeof(EnvelopeSample)); | |
158 | } | |
159 | } | |
160 | ||
f3d66e52 | 161 | void AnalogSegment::append_payload_to_envelope_levels() |
fda5b6e0 | 162 | { |
8dbbc7f0 | 163 | Envelope &e0 = envelope_levels_[0]; |
fda5b6e0 JH |
164 | uint64_t prev_length; |
165 | EnvelopeSample *dest_ptr; | |
65c92359 | 166 | SegmentDataIterator* it; |
fda5b6e0 JH |
167 | |
168 | // Expand the data buffer to fit the new samples | |
169 | prev_length = e0.length; | |
8dbbc7f0 | 170 | e0.length = sample_count_ / EnvelopeScaleFactor; |
fda5b6e0 | 171 | |
67b0df27 | 172 | // Calculate min/max values in case we have too few samples for an envelope |
8e15445c | 173 | const float old_min_value = min_value_, old_max_value = max_value_; |
67b0df27 | 174 | if (sample_count_ < EnvelopeScaleFactor) { |
65c92359 | 175 | it = begin_sample_iteration(0); |
67b0df27 | 176 | for (uint64_t i = 0; i < sample_count_; i++) { |
65c92359 | 177 | const float sample = *get_iterator_value_ptr(it); |
c063290a UH |
178 | if (sample < min_value_) |
179 | min_value_ = sample; | |
180 | if (sample > max_value_) | |
181 | max_value_ = sample; | |
65c92359 | 182 | continue_sample_iteration(it, 1); |
67b0df27 | 183 | } |
65c92359 | 184 | end_sample_iteration(it); |
67b0df27 SA |
185 | } |
186 | ||
fda5b6e0 JH |
187 | // Break off if there are no new samples to compute |
188 | if (e0.length == prev_length) | |
189 | return; | |
190 | ||
191 | reallocate_envelope(e0); | |
192 | ||
193 | dest_ptr = e0.samples + prev_length; | |
194 | ||
195 | // Iterate through the samples to populate the first level mipmap | |
26a883ed | 196 | uint64_t start_sample = prev_length * EnvelopeScaleFactor; |
c063290a | 197 | uint64_t end_sample = e0.length * EnvelopeScaleFactor; |
26a883ed | 198 | |
65c92359 | 199 | it = begin_sample_iteration(start_sample); |
26a883ed | 200 | for (uint64_t i = start_sample; i < end_sample; i += EnvelopeScaleFactor) { |
65c92359 | 201 | const float* samples = get_iterator_value_ptr(it); |
26a883ed | 202 | |
fda5b6e0 | 203 | const EnvelopeSample sub_sample = { |
26a883ed SA |
204 | *min_element(samples, samples + EnvelopeScaleFactor), |
205 | *max_element(samples, samples + EnvelopeScaleFactor), | |
fda5b6e0 JH |
206 | }; |
207 | ||
c063290a UH |
208 | if (sub_sample.min < min_value_) |
209 | min_value_ = sub_sample.min; | |
210 | if (sub_sample.max > max_value_) | |
211 | max_value_ = sub_sample.max; | |
73e377fe | 212 | |
65c92359 | 213 | continue_sample_iteration(it, EnvelopeScaleFactor); |
fda5b6e0 JH |
214 | *dest_ptr++ = sub_sample; |
215 | } | |
65c92359 | 216 | end_sample_iteration(it); |
fda5b6e0 JH |
217 | |
218 | // Compute higher level mipmaps | |
2ad82c2e | 219 | for (unsigned int level = 1; level < ScaleStepCount; level++) { |
8dbbc7f0 | 220 | Envelope &e = envelope_levels_[level]; |
c063290a | 221 | const Envelope &el = envelope_levels_[level - 1]; |
fda5b6e0 JH |
222 | |
223 | // Expand the data buffer to fit the new samples | |
224 | prev_length = e.length; | |
225 | e.length = el.length / EnvelopeScaleFactor; | |
226 | ||
26a883ed | 227 | // Break off if there are no more samples to be computed |
fda5b6e0 JH |
228 | if (e.length == prev_length) |
229 | break; | |
230 | ||
231 | reallocate_envelope(e); | |
232 | ||
26a883ed | 233 | // Subsample the lower level |
fda5b6e0 JH |
234 | const EnvelopeSample *src_ptr = |
235 | el.samples + prev_length * EnvelopeScaleFactor; | |
236 | const EnvelopeSample *const end_dest_ptr = e.samples + e.length; | |
26a883ed | 237 | |
fda5b6e0 | 238 | for (dest_ptr = e.samples + prev_length; |
2ad82c2e | 239 | dest_ptr < end_dest_ptr; dest_ptr++) { |
fda5b6e0 JH |
240 | const EnvelopeSample *const end_src_ptr = |
241 | src_ptr + EnvelopeScaleFactor; | |
242 | ||
243 | EnvelopeSample sub_sample = *src_ptr++; | |
2ad82c2e | 244 | while (src_ptr < end_src_ptr) { |
73e377fe | 245 | sub_sample.min = min(sub_sample.min, src_ptr->min);; |
fda5b6e0 JH |
246 | sub_sample.max = max(sub_sample.max, src_ptr->max); |
247 | src_ptr++; | |
248 | } | |
249 | ||
250 | *dest_ptr = sub_sample; | |
251 | } | |
252 | } | |
8e15445c SA |
253 | |
254 | // Notify if the min or max value changed | |
255 | if ((old_min_value != min_value_) || (old_max_value != max_value_)) | |
256 | owner_.min_max_changed(min_value_, max_value_); | |
fda5b6e0 JH |
257 | } |
258 | ||
1b1ec774 | 259 | } // namespace data |
aba1dd16 | 260 | } // namespace pv |