| commit | 155a57593d38cf7153c01cc037373462aa1e1cc1 | [log] [tgz] |
|---|---|---|
| author | Harald Geyer <harald@ccbib.org> | Sun Jan 17 16:13:30 2016 +0000 |
| committer | Jonathan Cameron <jic23@kernel.org> | Sat Jan 30 16:27:13 2016 +0000 |
| tree | de4f9ded1e226936c8f9f37fc093f85621d23b87 | |
| parent | 22acc120a141ce0a3b6e98799d15970ef687bc70 [diff] |
iio: dht11: Simplify decoding algorithm The new algorithm uses a 'one size fits em all' threshold, which should be easier to understand and debug. I believe there are no regressions compared to the old adaptive threshold algorithm. I don't remember why I chose the old algorithm when I initially wrote the driver. Signed-off-by: Harald Geyer <harald@ccbib.org> Signed-off-by: Jonathan Cameron <jic23@kernel.org>