]>
Commit | Line | Data |
---|---|---|
1 | /* | |
2 | * This file is part of the sigrok 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, write to the Free Software | |
18 | * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA | |
19 | */ | |
20 | ||
21 | #include "datasnapshot.h" | |
22 | ||
23 | #include <utility> | |
24 | #include <vector> | |
25 | ||
26 | namespace LogicDataSnapshotTest { | |
27 | class Basic; | |
28 | class LargeData; | |
29 | } | |
30 | ||
31 | class LogicDataSnapshot : public DataSnapshot | |
32 | { | |
33 | private: | |
34 | struct MipMapLevel | |
35 | { | |
36 | uint64_t length; | |
37 | uint64_t data_length; | |
38 | void *data; | |
39 | }; | |
40 | ||
41 | private: | |
42 | static const int ScaleStepCount = 10; | |
43 | static const int MipMapScalePower; | |
44 | static const int MipMapScaleFactor; | |
45 | static const float LogMipMapScaleFactor; | |
46 | static const uint64_t MipMapDataUnit; | |
47 | ||
48 | public: | |
49 | typedef std::pair<int64_t, bool> EdgePair; | |
50 | ||
51 | public: | |
52 | LogicDataSnapshot(const sr_datafeed_logic &logic); | |
53 | ||
54 | virtual ~LogicDataSnapshot(); | |
55 | ||
56 | void append_payload(const sr_datafeed_logic &logic); | |
57 | ||
58 | private: | |
59 | void reallocate_mip_map(MipMapLevel &m); | |
60 | ||
61 | void append_payload_to_mipmap(); | |
62 | ||
63 | public: | |
64 | uint64_t get_sample(uint64_t index) const; | |
65 | ||
66 | /** | |
67 | * Parses a logic data snapshot to generate a list of transitions | |
68 | * in a time interval to a given level of detail. | |
69 | * @param[out] edges The vector to place the edges into. | |
70 | * @param[in] start The start sample index. | |
71 | * @param[in] end The end sample index. | |
72 | * @param[in] min_length The minimum number of samples that | |
73 | * can be resolved at this level of detail. | |
74 | * @param[in] sig_index The index of the signal. | |
75 | **/ | |
76 | void get_subsampled_edges(std::vector<EdgePair> &edges, | |
77 | int64_t start, int64_t end, | |
78 | float min_length, int sig_index); | |
79 | ||
80 | private: | |
81 | ||
82 | static inline int64_t pow2_ceil(int64_t x, int power); | |
83 | ||
84 | private: | |
85 | struct MipMapLevel _mip_map[ScaleStepCount]; | |
86 | uint64_t _last_append_sample; | |
87 | ||
88 | friend class LogicDataSnapshotTest::Basic; | |
89 | friend class LogicDataSnapshotTest::LargeData; | |
90 | }; |