2 ## This file is part of the libsigrokdecode project.
4 ## Copyright (C) 2018 Stefan BrĂ¼ns <stefan.bruens@rwth-aachen.de>
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.
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.
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/>.
20 import sigrokdecode as srd
22 PIN_DATA, PIN_RESET = range(2)
23 ROW_EDGE, ROW_WORD, ROW_RESET = range(3)
25 class Decoder(srd.Decoder):
29 longname = 'Edge counter'
30 desc = 'Count number of edges.'
35 {'id': 'data', 'name': 'Data', 'desc': 'Data line'},
38 {'id': 'reset', 'name': 'Reset', 'desc': 'Reset line'},
41 ('edge_count', 'Edge count'),
42 ('word_count', 'Word count'),
43 ('word_reset', 'Word reset'),
46 ('edge_counts', 'Edges', (ROW_EDGE,)),
47 ('word_counts', 'Words', (ROW_WORD,)),
48 ('word_resets', 'Word resets', (ROW_RESET,)),
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 {'id': 'edge_off', 'desc': 'Edge counter value after start/reset', 'default': 0},
57 {'id': 'word_off', 'desc': 'Word counter value after start/reset', 'default': 0},
58 {'id': 'dead_cycles', 'desc': 'Ignore this many edges after reset', 'default': 0},
67 def metadata(self, key, value):
68 if key == srd.SRD_CONF_SAMPLERATE:
69 self.samplerate = value
72 self.out_ann = self.register(srd.OUTPUT_ANN)
74 def putc(self, cls, ss, annlist):
75 self.put(ss, self.samplenum, self.out_ann, [cls, annlist])
78 opt_edge_map = {'rising': 'r', 'falling': 'f', 'any': 'e'}
80 data_edge = self.options['data_edge']
81 divider = self.options['divider']
84 reset_edge = self.options['reset_edge']
86 condition = [{PIN_DATA: opt_edge_map[data_edge]}]
87 have_reset = self.has_channel(PIN_RESET)
89 cond_reset = len(condition)
90 condition.append({PIN_RESET: opt_edge_map[reset_edge]})
92 edge_count = int(self.options['edge_off'])
94 word_count = int(self.options['word_off'])
101 if have_reset and self.matched[cond_reset]:
102 edge_count = int(self.options['edge_off'])
104 word_count = int(self.options['word_off'])
106 self.putc(ROW_RESET, now, ['Word reset', 'Reset', 'Rst', 'R'])
107 dead_count = int(self.options['dead_cycles'])
116 # Implementation note: In the absence of a RESET condition
117 # before the first data edge, any arbitrary choice of where
118 # to start the annotation is valid. One may choose to emit a
119 # narrow annotation (where ss=es), or assume that the cycle
120 # which corresponds to the counter value started at sample
121 # number 0. We decided to go with the latter here, to avoid
122 # narrow annotations (see bug #1210). None of this matters in
123 # the presence of a RESET condition in the input stream.
124 if edge_start is None:
126 if word_start is None:
130 self.putc(ROW_EDGE, edge_start, ["{:d}".format(edge_count)])
133 if divider and (edge_count % divider) == 0:
135 self.putc(ROW_WORD, word_start, ["{:d}".format(word_count)])