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.
This commit is contained in:
parent
13262b48c1
commit
468f17f2d6
|
@ -857,15 +857,9 @@ static void sigma_decode_dram_cluster(struct sigma_dram_cluster *dram_cluster,
|
||||||
logic.data = samples;
|
logic.data = samples;
|
||||||
|
|
||||||
/*
|
/*
|
||||||
* First of all, send Sigrok a copy of the last sample from
|
* If this cluster is not adjacent to the previously received
|
||||||
* previous cluster as many times as needed to make up for
|
* cluster, then send the appropriate number of samples with the
|
||||||
* the differential characteristics of data we get from the
|
* previous values to the sigrok session. This "decodes RLE".
|
||||||
* 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 .
|
|
||||||
*/
|
*/
|
||||||
for (ts = 0; ts < tsdiff; ts++) {
|
for (ts = 0; ts < tsdiff; ts++) {
|
||||||
i = ts % 1024;
|
i = ts % 1024;
|
||||||
|
|
Loading…
Reference in New Issue