]>
Commit | Line | Data |
---|---|---|
28a4c9c5 | 1 | /* |
b3f22de0 | 2 | * This file is part of the PulseView project. |
28a4c9c5 JH |
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/>. |
28a4c9c5 JH |
18 | */ |
19 | ||
cef18fc6 | 20 | #include <extdef.h> |
28a4c9c5 | 21 | |
eb8269e3 | 22 | #include <cassert> |
d9e71737 | 23 | #include <cmath> |
aca9aa83 UH |
24 | #include <cstdlib> |
25 | #include <cstring> | |
4ceab49a | 26 | |
7db61e77 | 27 | #include "logic.hpp" |
f3d66e52 | 28 | #include "logicsegment.hpp" |
f556bc6a | 29 | |
fe3a1c21 | 30 | #include <libsigrokcxx/libsigrokcxx.hpp> |
e8d00928 | 31 | |
3b68d03d JH |
32 | using std::lock_guard; |
33 | using std::recursive_mutex; | |
819f4c25 JH |
34 | using std::max; |
35 | using std::min; | |
e8d00928 | 36 | using std::shared_ptr; |
6f925ba9 | 37 | using std::vector; |
e8d00928 ML |
38 | |
39 | using sigrok::Logic; | |
28a4c9c5 | 40 | |
51e77110 | 41 | namespace pv { |
1b1ec774 | 42 | namespace data { |
51e77110 | 43 | |
f3d66e52 JH |
44 | const int LogicSegment::MipMapScalePower = 4; |
45 | const int LogicSegment::MipMapScaleFactor = 1 << MipMapScalePower; | |
46 | const float LogicSegment::LogMipMapScaleFactor = logf(MipMapScaleFactor); | |
c063290a | 47 | const uint64_t LogicSegment::MipMapDataUnit = 64 * 1024; // bytes |
4ceab49a | 48 | |
9d22929c SA |
49 | LogicSegment::LogicSegment(pv::data::Logic& owner, unsigned int unit_size, |
50 | uint64_t samplerate) : | |
51 | Segment(samplerate, unit_size), | |
52 | owner_(owner), | |
53 | last_append_sample_(0) | |
54 | { | |
55 | memset(mip_map_, 0, sizeof(mip_map_)); | |
56 | } | |
57 | ||
f3d66e52 | 58 | LogicSegment::~LogicSegment() |
4ceab49a | 59 | { |
8dbbc7f0 JH |
60 | lock_guard<recursive_mutex> lock(mutex_); |
61 | for (MipMapLevel &l : mip_map_) | |
4ceab49a JH |
62 | free(l.data); |
63 | } | |
64 | ||
f3d66e52 | 65 | uint64_t LogicSegment::unpack_sample(const uint8_t *ptr) const |
8cb71705 | 66 | { |
9df8453f MC |
67 | #ifdef HAVE_UNALIGNED_LITTLE_ENDIAN_ACCESS |
68 | return *(uint64_t*)ptr; | |
69 | #else | |
8cb71705 | 70 | uint64_t value = 0; |
2ad82c2e | 71 | switch (unit_size_) { |
8cb71705 MC |
72 | default: |
73 | value |= ((uint64_t)ptr[7]) << 56; | |
74 | /* FALLTHRU */ | |
75 | case 7: | |
76 | value |= ((uint64_t)ptr[6]) << 48; | |
77 | /* FALLTHRU */ | |
78 | case 6: | |
79 | value |= ((uint64_t)ptr[5]) << 40; | |
80 | /* FALLTHRU */ | |
81 | case 5: | |
82 | value |= ((uint64_t)ptr[4]) << 32; | |
83 | /* FALLTHRU */ | |
84 | case 4: | |
85 | value |= ((uint32_t)ptr[3]) << 24; | |
86 | /* FALLTHRU */ | |
87 | case 3: | |
88 | value |= ((uint32_t)ptr[2]) << 16; | |
89 | /* FALLTHRU */ | |
90 | case 2: | |
91 | value |= ptr[1] << 8; | |
92 | /* FALLTHRU */ | |
93 | case 1: | |
94 | value |= ptr[0]; | |
95 | /* FALLTHRU */ | |
96 | case 0: | |
97 | break; | |
98 | } | |
99 | return value; | |
9df8453f | 100 | #endif |
8cb71705 MC |
101 | } |
102 | ||
f3d66e52 | 103 | void LogicSegment::pack_sample(uint8_t *ptr, uint64_t value) |
8cb71705 | 104 | { |
9df8453f MC |
105 | #ifdef HAVE_UNALIGNED_LITTLE_ENDIAN_ACCESS |
106 | *(uint64_t*)ptr = value; | |
107 | #else | |
2ad82c2e | 108 | switch (unit_size_) { |
8cb71705 MC |
109 | default: |
110 | ptr[7] = value >> 56; | |
111 | /* FALLTHRU */ | |
112 | case 7: | |
113 | ptr[6] = value >> 48; | |
114 | /* FALLTHRU */ | |
115 | case 6: | |
116 | ptr[5] = value >> 40; | |
117 | /* FALLTHRU */ | |
118 | case 5: | |
119 | ptr[4] = value >> 32; | |
120 | /* FALLTHRU */ | |
121 | case 4: | |
122 | ptr[3] = value >> 24; | |
123 | /* FALLTHRU */ | |
124 | case 3: | |
125 | ptr[2] = value >> 16; | |
126 | /* FALLTHRU */ | |
127 | case 2: | |
128 | ptr[1] = value >> 8; | |
129 | /* FALLTHRU */ | |
130 | case 1: | |
131 | ptr[0] = value; | |
132 | /* FALLTHRU */ | |
133 | case 0: | |
134 | break; | |
135 | } | |
9df8453f | 136 | #endif |
8cb71705 MC |
137 | } |
138 | ||
7db61e77 | 139 | void LogicSegment::append_payload(shared_ptr<sigrok::Logic> logic) |
28a4c9c5 | 140 | { |
8dbbc7f0 JH |
141 | assert(unit_size_ == logic->unit_size()); |
142 | assert((logic->data_length() % unit_size_) == 0); | |
f556bc6a | 143 | |
9d22929c SA |
144 | append_payload(logic->data_pointer(), logic->data_length()); |
145 | } | |
146 | ||
147 | void LogicSegment::append_payload(void *data, uint64_t data_size) | |
148 | { | |
149 | assert((data_size % unit_size_) == 0); | |
150 | ||
8dbbc7f0 | 151 | lock_guard<recursive_mutex> lock(mutex_); |
7d29656f | 152 | |
7db61e77 | 153 | uint64_t prev_sample_count = sample_count_; |
9d22929c | 154 | uint64_t sample_count = data_size / unit_size_; |
7db61e77 | 155 | |
9d22929c | 156 | append_samples(data, sample_count); |
4ceab49a JH |
157 | |
158 | // Generate the first mip-map from the data | |
159 | append_payload_to_mipmap(); | |
7db61e77 SA |
160 | |
161 | if (sample_count > 1) | |
162 | owner_.notify_samples_added(this, prev_sample_count + 1, | |
163 | prev_sample_count + 1 + sample_count); | |
164 | else | |
165 | owner_.notify_samples_added(this, prev_sample_count + 1, | |
166 | prev_sample_count + 1); | |
4ceab49a JH |
167 | } |
168 | ||
b82243f7 SA |
169 | void LogicSegment::get_samples(int64_t start_sample, |
170 | int64_t end_sample, uint8_t* dest) const | |
ed990f11 | 171 | { |
ed990f11 | 172 | assert(start_sample >= 0); |
8dbbc7f0 | 173 | assert(start_sample <= (int64_t)sample_count_); |
ed990f11 | 174 | assert(end_sample >= 0); |
8dbbc7f0 | 175 | assert(end_sample <= (int64_t)sample_count_); |
ed990f11 | 176 | assert(start_sample <= end_sample); |
b82243f7 | 177 | assert(dest != nullptr); |
ed990f11 | 178 | |
8dbbc7f0 | 179 | lock_guard<recursive_mutex> lock(mutex_); |
ed990f11 | 180 | |
b82243f7 | 181 | get_raw_samples(start_sample, (end_sample - start_sample), dest); |
26a883ed SA |
182 | } |
183 | ||
c70e3464 | 184 | SegmentLogicDataIterator* LogicSegment::begin_sample_iteration(uint64_t start) |
26a883ed SA |
185 | { |
186 | return (SegmentLogicDataIterator*)begin_raw_sample_iteration(start); | |
187 | } | |
188 | ||
c70e3464 | 189 | void LogicSegment::continue_sample_iteration(SegmentLogicDataIterator* it, uint64_t increase) |
26a883ed SA |
190 | { |
191 | Segment::continue_raw_sample_iteration((SegmentRawDataIterator*)it, increase); | |
192 | } | |
193 | ||
c70e3464 | 194 | void LogicSegment::end_sample_iteration(SegmentLogicDataIterator* it) |
26a883ed SA |
195 | { |
196 | Segment::end_raw_sample_iteration((SegmentRawDataIterator*)it); | |
ed990f11 JH |
197 | } |
198 | ||
f3d66e52 | 199 | void LogicSegment::reallocate_mipmap_level(MipMapLevel &m) |
4ceab49a | 200 | { |
26a883ed SA |
201 | lock_guard<recursive_mutex> lock(mutex_); |
202 | ||
4ceab49a JH |
203 | const uint64_t new_data_length = ((m.length + MipMapDataUnit - 1) / |
204 | MipMapDataUnit) * MipMapDataUnit; | |
26a883ed | 205 | |
2ad82c2e | 206 | if (new_data_length > m.data_length) { |
4ceab49a | 207 | m.data_length = new_data_length; |
8fe60279 JH |
208 | |
209 | // Padding is added to allow for the uint64_t write word | |
8dbbc7f0 | 210 | m.data = realloc(m.data, new_data_length * unit_size_ + |
8fe60279 | 211 | sizeof(uint64_t)); |
4ceab49a JH |
212 | } |
213 | } | |
214 | ||
f3d66e52 | 215 | void LogicSegment::append_payload_to_mipmap() |
4ceab49a | 216 | { |
8dbbc7f0 | 217 | MipMapLevel &m0 = mip_map_[0]; |
4ceab49a | 218 | uint64_t prev_length; |
4ceab49a | 219 | uint8_t *dest_ptr; |
26a883ed | 220 | SegmentRawDataIterator* it; |
4ceab49a JH |
221 | uint64_t accumulator; |
222 | unsigned int diff_counter; | |
223 | ||
224 | // Expand the data buffer to fit the new samples | |
225 | prev_length = m0.length; | |
8dbbc7f0 | 226 | m0.length = sample_count_ / MipMapScaleFactor; |
4ceab49a JH |
227 | |
228 | // Break off if there are no new samples to compute | |
333d5bbc | 229 | if (m0.length == prev_length) |
4ceab49a JH |
230 | return; |
231 | ||
023887ca | 232 | reallocate_mipmap_level(m0); |
4ceab49a | 233 | |
8dbbc7f0 | 234 | dest_ptr = (uint8_t*)m0.data + prev_length * unit_size_; |
4ceab49a JH |
235 | |
236 | // Iterate through the samples to populate the first level mipmap | |
26a883ed SA |
237 | uint64_t start_sample = prev_length * MipMapScaleFactor; |
238 | uint64_t end_sample = m0.length * MipMapScaleFactor; | |
239 | ||
240 | it = begin_raw_sample_iteration(start_sample); | |
241 | for (uint64_t i = start_sample; i < end_sample;) { | |
4ceab49a JH |
242 | // Accumulate transitions which have occurred in this sample |
243 | accumulator = 0; | |
244 | diff_counter = MipMapScaleFactor; | |
2ad82c2e | 245 | while (diff_counter-- > 0) { |
26a883ed | 246 | const uint64_t sample = unpack_sample(it->value); |
8dbbc7f0 JH |
247 | accumulator |= last_append_sample_ ^ sample; |
248 | last_append_sample_ = sample; | |
26a883ed SA |
249 | continue_raw_sample_iteration(it, 1); |
250 | i++; | |
4ceab49a JH |
251 | } |
252 | ||
8cb71705 | 253 | pack_sample(dest_ptr, accumulator); |
8dbbc7f0 | 254 | dest_ptr += unit_size_; |
4ceab49a | 255 | } |
26a883ed | 256 | end_raw_sample_iteration(it); |
4ceab49a JH |
257 | |
258 | // Compute higher level mipmaps | |
2ad82c2e | 259 | for (unsigned int level = 1; level < ScaleStepCount; level++) { |
8dbbc7f0 | 260 | MipMapLevel &m = mip_map_[level]; |
c063290a | 261 | const MipMapLevel &ml = mip_map_[level - 1]; |
4ceab49a JH |
262 | |
263 | // Expand the data buffer to fit the new samples | |
264 | prev_length = m.length; | |
265 | m.length = ml.length / MipMapScaleFactor; | |
266 | ||
26a883ed | 267 | // Break off if there are no more samples to be computed |
333d5bbc | 268 | if (m.length == prev_length) |
4ceab49a JH |
269 | break; |
270 | ||
023887ca | 271 | reallocate_mipmap_level(m); |
4ceab49a | 272 | |
26a883ed SA |
273 | // Subsample the lower level |
274 | const uint8_t* src_ptr = (uint8_t*)ml.data + | |
8dbbc7f0 | 275 | unit_size_ * prev_length * MipMapScaleFactor; |
023887ca | 276 | const uint8_t *const end_dest_ptr = |
8dbbc7f0 | 277 | (uint8_t*)m.data + unit_size_ * m.length; |
26a883ed | 278 | |
333d5bbc | 279 | for (dest_ptr = (uint8_t*)m.data + |
2ad82c2e UH |
280 | unit_size_ * prev_length; |
281 | dest_ptr < end_dest_ptr; | |
282 | dest_ptr += unit_size_) { | |
4ceab49a JH |
283 | accumulator = 0; |
284 | diff_counter = MipMapScaleFactor; | |
2ad82c2e | 285 | while (diff_counter-- > 0) { |
8cb71705 | 286 | accumulator |= unpack_sample(src_ptr); |
8dbbc7f0 | 287 | src_ptr += unit_size_; |
4ceab49a JH |
288 | } |
289 | ||
8cb71705 | 290 | pack_sample(dest_ptr, accumulator); |
4ceab49a JH |
291 | } |
292 | } | |
28a4c9c5 | 293 | } |
2858b391 | 294 | |
26a883ed | 295 | uint64_t LogicSegment::get_unpacked_sample(uint64_t index) const |
2858b391 | 296 | { |
8dbbc7f0 | 297 | assert(index < sample_count_); |
2858b391 | 298 | |
b82243f7 SA |
299 | uint8_t* data = new uint8_t[unit_size_]; |
300 | get_raw_samples(index, 1, data); | |
26a883ed SA |
301 | uint64_t sample = unpack_sample(data); |
302 | delete[] data; | |
303 | ||
304 | return sample; | |
2858b391 JH |
305 | } |
306 | ||
f3d66e52 | 307 | void LogicSegment::get_subsampled_edges( |
6f925ba9 | 308 | vector<EdgePair> &edges, |
60b0c2da | 309 | uint64_t start, uint64_t end, |
0b02e057 | 310 | float min_length, int sig_index) |
2858b391 | 311 | { |
60b0c2da JH |
312 | uint64_t index = start; |
313 | unsigned int level; | |
7d0d64f9 JH |
314 | bool last_sample; |
315 | bool fast_forward; | |
0b02e057 | 316 | |
0b02e057 | 317 | assert(end <= get_sample_count()); |
2858b391 | 318 | assert(start <= end); |
0b02e057 | 319 | assert(min_length > 0); |
2858b391 | 320 | assert(sig_index >= 0); |
80d50141 | 321 | assert(sig_index < 64); |
2858b391 | 322 | |
8dbbc7f0 | 323 | lock_guard<recursive_mutex> lock(mutex_); |
7d29656f | 324 | |
60b0c2da JH |
325 | const uint64_t block_length = (uint64_t)max(min_length, 1.0f); |
326 | const unsigned int min_level = max((int)floorf(logf(min_length) / | |
0b02e057 | 327 | LogMipMapScaleFactor) - 1, 0); |
7d0d64f9 | 328 | const uint64_t sig_mask = 1ULL << sig_index; |
2858b391 | 329 | |
7d0d64f9 | 330 | // Store the initial state |
26a883ed | 331 | last_sample = (get_unpacked_sample(start) & sig_mask) != 0; |
326cf6fe | 332 | edges.emplace_back(index++, last_sample); |
2858b391 | 333 | |
2ad82c2e | 334 | while (index + block_length <= end) { |
7d0d64f9 | 335 | //----- Continue to search -----// |
0b02e057 | 336 | level = min_level; |
f06ab143 JH |
337 | |
338 | // We cannot fast-forward if there is no mip-map data at | |
339 | // at the minimum level. | |
4c60462b | 340 | fast_forward = (mip_map_[level].data != nullptr); |
2858b391 | 341 | |
2ad82c2e | 342 | if (min_length < MipMapScaleFactor) { |
0b02e057 JH |
343 | // Search individual samples up to the beginning of |
344 | // the next first level mip map block | |
7d0d64f9 | 345 | const uint64_t final_index = min(end, |
0b02e057 JH |
346 | pow2_ceil(index, MipMapScalePower)); |
347 | ||
333d5bbc | 348 | for (; index < final_index && |
c28fa62b | 349 | (index & ~((uint64_t)(~0) << MipMapScalePower)) != 0; |
2ad82c2e | 350 | index++) { |
0b02e057 | 351 | const bool sample = |
26a883ed | 352 | (get_unpacked_sample(index) & sig_mask) != 0; |
7d0d64f9 JH |
353 | |
354 | // If there was a change we cannot fast forward | |
333d5bbc | 355 | if (sample != last_sample) { |
7d0d64f9 | 356 | fast_forward = false; |
0b02e057 | 357 | break; |
7d0d64f9 | 358 | } |
0b02e057 | 359 | } |
2ad82c2e | 360 | } else { |
0b02e057 JH |
361 | // If resolution is less than a mip map block, |
362 | // round up to the beginning of the mip-map block | |
363 | // for this level of detail | |
364 | const int min_level_scale_power = | |
365 | (level + 1) * MipMapScalePower; | |
366 | index = pow2_ceil(index, min_level_scale_power); | |
333d5bbc | 367 | if (index >= end) |
0b02e057 JH |
368 | break; |
369 | ||
7d0d64f9 JH |
370 | // We can fast forward only if there was no change |
371 | const bool sample = | |
26a883ed | 372 | (get_unpacked_sample(index) & sig_mask) != 0; |
f06ab143 JH |
373 | if (last_sample != sample) |
374 | fast_forward = false; | |
0b02e057 JH |
375 | } |
376 | ||
333d5bbc | 377 | if (fast_forward) { |
7d0d64f9 JH |
378 | |
379 | // Fast forward: This involves zooming out to higher | |
380 | // levels of the mip map searching for changes, then | |
381 | // zooming in on them to find the point where the edge | |
382 | // begins. | |
383 | ||
384 | // Slide right and zoom out at the beginnings of mip-map | |
385 | // blocks until we encounter a change | |
1f1d55ce | 386 | while (true) { |
7d0d64f9 JH |
387 | const int level_scale_power = |
388 | (level + 1) * MipMapScalePower; | |
389 | const uint64_t offset = | |
390 | index >> level_scale_power; | |
7d0d64f9 JH |
391 | |
392 | // Check if we reached the last block at this | |
393 | // level, or if there was a change in this block | |
8dbbc7f0 | 394 | if (offset >= mip_map_[level].length || |
7d0d64f9 JH |
395 | (get_subsample(level, offset) & |
396 | sig_mask)) | |
0b02e057 JH |
397 | break; |
398 | ||
c28fa62b | 399 | if ((offset & ~((uint64_t)(~0) << MipMapScalePower)) == 0) { |
7d0d64f9 JH |
400 | // If we are now at the beginning of a |
401 | // higher level mip-map block ascend one | |
402 | // level | |
333d5bbc | 403 | if (level + 1 >= ScaleStepCount || |
8dbbc7f0 | 404 | !mip_map_[level + 1].data) |
7d0d64f9 JH |
405 | break; |
406 | ||
407 | level++; | |
408 | } else { | |
409 | // Slide right to the beginning of the | |
410 | // next mip map block | |
411 | index = pow2_ceil(index + 1, | |
412 | level_scale_power); | |
413 | } | |
0b02e057 | 414 | } |
7d0d64f9 JH |
415 | |
416 | // Zoom in, and slide right until we encounter a change, | |
417 | // and repeat until we reach min_level | |
1f1d55ce | 418 | while (true) { |
8dbbc7f0 | 419 | assert(mip_map_[level].data); |
7d0d64f9 JH |
420 | |
421 | const int level_scale_power = | |
422 | (level + 1) * MipMapScalePower; | |
423 | const uint64_t offset = | |
424 | index >> level_scale_power; | |
7d0d64f9 JH |
425 | |
426 | // Check if we reached the last block at this | |
427 | // level, or if there was a change in this block | |
8dbbc7f0 | 428 | if (offset >= mip_map_[level].length || |
2ad82c2e | 429 | (get_subsample(level, offset) & |
7d0d64f9 JH |
430 | sig_mask)) { |
431 | // Zoom in unless we reached the minimum | |
432 | // zoom | |
333d5bbc | 433 | if (level == min_level) |
7d0d64f9 JH |
434 | break; |
435 | ||
436 | level--; | |
437 | } else { | |
438 | // Slide right to the beginning of the | |
439 | // next mip map block | |
440 | index = pow2_ceil(index + 1, | |
441 | level_scale_power); | |
442 | } | |
0b02e057 | 443 | } |
0b02e057 | 444 | |
7d0d64f9 JH |
445 | // If individual samples within the limit of resolution, |
446 | // do a linear search for the next transition within the | |
447 | // block | |
333d5bbc UH |
448 | if (min_length < MipMapScaleFactor) { |
449 | for (; index < end; index++) { | |
26a883ed | 450 | const bool sample = (get_unpacked_sample(index) & |
7d0d64f9 | 451 | sig_mask) != 0; |
333d5bbc | 452 | if (sample != last_sample) |
7d0d64f9 JH |
453 | break; |
454 | } | |
0b02e057 JH |
455 | } |
456 | } | |
457 | ||
7d0d64f9 JH |
458 | //----- Store the edge -----// |
459 | ||
460 | // Take the last sample of the quanization block | |
461 | const int64_t final_index = index + block_length; | |
333d5bbc | 462 | if (index + block_length > end) |
7d0d64f9 JH |
463 | break; |
464 | ||
465 | // Store the final state | |
466 | const bool final_sample = | |
26a883ed | 467 | (get_unpacked_sample(final_index - 1) & sig_mask) != 0; |
326cf6fe | 468 | edges.emplace_back(index, final_sample); |
7d0d64f9 JH |
469 | |
470 | index = final_index; | |
471 | last_sample = final_sample; | |
2858b391 JH |
472 | } |
473 | ||
474 | // Add the final state | |
26a883ed | 475 | const bool end_sample = get_unpacked_sample(end) & sig_mask; |
175d6573 | 476 | if (last_sample != end_sample) |
326cf6fe UH |
477 | edges.emplace_back(end, end_sample); |
478 | edges.emplace_back(end + 1, end_sample); | |
2858b391 | 479 | } |
0b02e057 | 480 | |
f3d66e52 | 481 | uint64_t LogicSegment::get_subsample(int level, uint64_t offset) const |
b2bcbe51 JH |
482 | { |
483 | assert(level >= 0); | |
8dbbc7f0 JH |
484 | assert(mip_map_[level].data); |
485 | return unpack_sample((uint8_t*)mip_map_[level].data + | |
486 | unit_size_ * offset); | |
b2bcbe51 JH |
487 | } |
488 | ||
f3d66e52 | 489 | uint64_t LogicSegment::pow2_ceil(uint64_t x, unsigned int power) |
0b02e057 | 490 | { |
60b0c2da JH |
491 | const uint64_t p = 1 << power; |
492 | return (x + p - 1) / p * p; | |
0b02e057 | 493 | } |
51e77110 | 494 | |
1b1ec774 | 495 | } // namespace data |
51e77110 | 496 | } // namespace pv |