]>
Commit | Line | Data |
---|---|---|
1 | ## | |
2 | ## This file is part of the libsigrokdecode project. | |
3 | ## | |
4 | ## Copyright (C) 2018 Stefan BrĂ¼ns <stefan.bruens@rwth-aachen.de> | |
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 | import sigrokdecode as srd | |
21 | ||
22 | PIN_DATA, PIN_RESET = range(2) | |
23 | ROW_EDGE, ROW_WORD, ROW_RESET = range(3) | |
24 | ||
25 | class Decoder(srd.Decoder): | |
26 | api_version = 3 | |
27 | id = 'counter' | |
28 | name = 'Counter' | |
29 | longname = 'Edge counter' | |
30 | desc = 'Count number of edges.' | |
31 | license = 'gplv2+' | |
32 | inputs = ['logic'] | |
33 | outputs = [] | |
34 | channels = ( | |
35 | {'id': 'data', 'name': 'Data', 'desc': 'Data line'}, | |
36 | ) | |
37 | optional_channels = ( | |
38 | {'id': 'reset', 'name': 'Reset', 'desc': 'Reset line'}, | |
39 | ) | |
40 | annotations = ( | |
41 | ('edge_count', 'Edge count'), | |
42 | ('word_count', 'Word count'), | |
43 | ('word_reset', 'Word reset'), | |
44 | ) | |
45 | annotation_rows = ( | |
46 | ('edge_counts', 'Edges', (ROW_EDGE,)), | |
47 | ('word_counts', 'Words', (ROW_WORD,)), | |
48 | ('word_resets', 'Word resets', (ROW_RESET,)), | |
49 | ) | |
50 | options = ( | |
51 | {'id': 'data_edge', 'desc': 'Edges to count (data)', 'default': 'any', | |
52 | 'values': ('any', 'rising', 'falling')}, | |
53 | {'id': 'divider', 'desc': 'Count divider (word width)', 'default': 0}, | |
54 | {'id': 'reset_edge', 'desc': 'Edge which clears counters (reset)', | |
55 | 'default': 'falling', 'values': ('rising', 'falling')}, | |
56 | ) | |
57 | ||
58 | def __init__(self): | |
59 | self.reset() | |
60 | ||
61 | def reset(self): | |
62 | pass | |
63 | ||
64 | def metadata(self, key, value): | |
65 | if key == srd.SRD_CONF_SAMPLERATE: | |
66 | self.samplerate = value | |
67 | ||
68 | def start(self): | |
69 | self.out_ann = self.register(srd.OUTPUT_ANN) | |
70 | ||
71 | def putc(self, cls, ss, annlist): | |
72 | self.put(ss, self.samplenum, self.out_ann, [cls, annlist]) | |
73 | ||
74 | def decode(self): | |
75 | opt_edge_map = {'rising': 'r', 'falling': 'f', 'any': 'e'} | |
76 | ||
77 | data_edge = self.options['data_edge'] | |
78 | divider = self.options['divider'] | |
79 | if divider < 0: | |
80 | divider = 0 | |
81 | reset_edge = self.options['reset_edge'] | |
82 | ||
83 | condition = [{PIN_DATA: opt_edge_map[data_edge]}] | |
84 | have_reset = self.has_channel(PIN_RESET) | |
85 | if have_reset: | |
86 | cond_reset = len(condition) | |
87 | condition.append({PIN_RESET: opt_edge_map[reset_edge]}) | |
88 | ||
89 | edge_count = 0 | |
90 | edge_start = None | |
91 | word_count = 0 | |
92 | word_start = None | |
93 | while True: | |
94 | self.wait(condition) | |
95 | now = self.samplenum | |
96 | ||
97 | if have_reset and self.matched[cond_reset]: | |
98 | edge_count = 0 | |
99 | edge_start = now | |
100 | word_count = 0 | |
101 | word_start = now | |
102 | self.putc(ROW_RESET, now, ['Word reset', 'Reset', 'Rst', 'R']) | |
103 | continue | |
104 | ||
105 | # Implementation note: In the absence of a RESET condition | |
106 | # before the first data edge, any arbitrary choice of where | |
107 | # to start the annotation is valid. One may choose to emit a | |
108 | # narrow annotation (where ss=es), or assume that the cycle | |
109 | # which corresponds to the counter value started at sample | |
110 | # number 0. We decided to go with the latter here, to avoid | |
111 | # narrow annotations (see bug #1210). None of this matters in | |
112 | # the presence of a RESET condition in the input stream. | |
113 | if edge_start is None: | |
114 | edge_start = 0 | |
115 | if word_start is None: | |
116 | word_start = 0 | |
117 | ||
118 | edge_count += 1 | |
119 | self.putc(ROW_EDGE, edge_start, ["{:d}".format(edge_count)]) | |
120 | edge_start = now | |
121 | ||
122 | if divider and (edge_count % divider) == 0: | |
123 | word_count += 1 | |
124 | self.putc(ROW_WORD, word_start, ["{:d}".format(word_count)]) | |
125 | word_start = now |