summaryrefslogtreecommitdiff
path: root/lib/test_user_copy.c
diff options
context:
space:
mode:
authorHarald Geyer <harald@ccbib.org>2016-01-17 19:13:30 +0300
committerJonathan Cameron <jic23@kernel.org>2016-01-30 19:27:13 +0300
commit155a57593d38cf7153c01cc037373462aa1e1cc1 (patch)
treede4f9ded1e226936c8f9f37fc093f85621d23b87 /lib/test_user_copy.c
parent22acc120a141ce0a3b6e98799d15970ef687bc70 (diff)
downloadlinux-155a57593d38cf7153c01cc037373462aa1e1cc1.tar.xz
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>
Diffstat (limited to 'lib/test_user_copy.c')
0 files changed, 0 insertions, 0 deletions