From: Gerhard Sittig <redacted>
Date: Fri, 26 May 2017 00:16:28 +0000 (+0200)
Subject: asix-sigma: Comment on RLE decompression upon data retrieval
X-Git-Tag: libsigrok-0.5.0~34
X-Git-Url: https://sigrok.org/gitaction?a=commitdiff_plain;h=468f17f2d673ebf250f72fa114f261b86da1aab7;p=libsigrok.git

asix-sigma: Comment on RLE decompression upon data retrieval

Rephrase and shorten a comment on how RLE decompression works. Drop the
part of the comment which is not related to (de-)compression.
---

diff --git a/src/hardware/asix-sigma/protocol.c b/src/hardware/asix-sigma/protocol.c
index 1f2b2a63..6fda3908 100644
--- a/src/hardware/asix-sigma/protocol.c
+++ b/src/hardware/asix-sigma/protocol.c
@@ -857,15 +857,9 @@ static void sigma_decode_dram_cluster(struct sigma_dram_cluster *dram_cluster,
 	logic.data = samples;
 
 	/*
-	 * First of all, send Sigrok a copy of the last sample from
-	 * previous cluster as many times as needed to make up for
-	 * the differential characteristics of data we get from the
-	 * Sigma. Sigrok needs one sample of data per period.
-	 *
-	 * One DRAM cluster contains a timestamp and seven samples,
-	 * the units of timestamp are "devc->period_ps" , the first
-	 * sample in the cluster happens at the time of the timestamp
-	 * and the remaining samples happen at timestamp +1...+6 .
+	 * If this cluster is not adjacent to the previously received
+	 * cluster, then send the appropriate number of samples with the
+	 * previous values to the sigrok session. This "decodes RLE".
 	 */
 	for (ts = 0; ts < tsdiff; ts++) {
 		i = ts % 1024;