]> sigrok.org Git - libsigrokdecode.git/blame - decoders/transitioncounter/transitioncounter.py
srd: PDs: More cosmetics.
[libsigrokdecode.git] / decoders / transitioncounter / transitioncounter.py
CommitLineData
1c6fa20f
UH
1##
2## This file is part of the sigrok project.
3##
4## Copyright (C) 2010 Uwe Hermann <uwe@hermann-uwe.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, write to the Free Software
18## Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
19##
ad2dc0de 20
156509ca
UH
21# Transition counter protocol decoder
22
677d597b 23import sigrokdecode as srd
1c8ac5bf 24
677d597b 25class Decoder(srd.Decoder):
a2c2afd9 26 api_version = 1
2b7d0e2b 27 id = 'transitioncounter'
b41ae47f 28 name = 'Transition counter'
3d3da57d 29 longname = 'Pin transition counter'
b41ae47f
UH
30 desc = 'Counts rising/falling edges in the signal.'
31 longdesc = '...'
b41ae47f
UH
32 license = 'gplv2+'
33 inputs = ['logic']
34 outputs = ['transitioncounts']
9a12a6e7 35 probes = []
b77614bc 36 optional_probes = []
b41ae47f 37 options = {}
dbbee4bf
UH
38 annotations = [
39 ['TODO', 'TODO'],
40 ]
b41ae47f 41
3643fc3f 42 def __init__(self, **kwargs):
f9b3b245 43 self.channels = -1
b41ae47f 44 self.lastsample = None
b41ae47f 45
3643fc3f 46 def start(self, metadata):
56202222
UH
47 # self.out_proto = self.add(srd.OUTPUT_PROTO, 'transitioncounter')
48 self.out_ann = self.add(srd.OUTPUT_ANN, 'transitioncounter')
3643fc3f 49
b41ae47f
UH
50 def report(self):
51 pass
52
2b9837d9 53 def decode(self, ss, es, data):
b41ae47f 54
f9b3b245
UH
55 for (samplenum, s) in data:
56
57 # ...
58 if self.channels == -1:
59 self.channels = len(s)
60 self.oldbit = [0] * self.channels
61 self.transitions = [0] * self.channels
62 self.rising = [0] * self.channels
63 self.falling = [0] * self.channels
b41ae47f
UH
64
65 # Optimization: Skip identical samples (no transitions).
66 if self.lastsample == s:
67 continue
68
69 # Upon the first sample, store the initial values.
70 if self.lastsample == None:
71 self.lastsample = s
72 for i in range(self.channels):
f9b3b245 73 self.oldbit[i] = self.lastsample[i]
b41ae47f
UH
74
75 # Iterate over all channels/probes in this sample.
76 # Count rising and falling edges for each channel.
77 for i in range(self.channels):
f9b3b245 78 curbit = s[i]
ad2dc0de 79 # Optimization: Skip identical bits (no transitions).
b41ae47f 80 if self.oldbit[i] == curbit:
ad2dc0de 81 continue
b41ae47f
UH
82 elif (self.oldbit[i] == 0 and curbit == 1):
83 self.rising[i] += 1
84 elif (self.oldbit[i] == 1 and curbit == 0):
85 self.falling[i] += 1
86 self.oldbit[i] = curbit
87
88 # Save the current sample as 'lastsample' for the next round.
89 self.lastsample = s
90
91 # Total number of transitions = rising + falling edges.
92 for i in range(self.channels):
93 self.transitions[i] = self.rising[i] + self.falling[i]
94
95 # TODO: Which output format?
96 # TODO: How to only output something after the last chunk of data?
97 outdata = []
98 for i in range(self.channels):
7f7ea759
UH
99 outdata.append([self.transitions[i], self.rising[i],
100 self.falling[i]])
862f6f27
UH
101
102 if outdata != []:
c9b24fc3 103 # self.put(0, 0, self.out_proto, out_proto)
dbbee4bf 104 self.put(0, 0, self.out_ann, [0, [str(outdata)]])
2b7d0e2b 105