summaryrefslogtreecommitdiff
path: root/src/compression/rle.c
diff options
context:
space:
mode:
Diffstat (limited to 'src/compression/rle.c')
-rw-r--r--src/compression/rle.c72
1 files changed, 36 insertions, 36 deletions
diff --git a/src/compression/rle.c b/src/compression/rle.c
index 2adeae2..ee708ed 100644
--- a/src/compression/rle.c
+++ b/src/compression/rle.c
@@ -14,21 +14,21 @@
#include "compression/rle.h"
static void add_rle(unsigned int *rle,
- int v,int nsim,
- int *j,int min_rle)
+ int v,int nsim,
+ int *j,int min_rle)
{
if (nsim>min_rle)
{
/* Insert run-length */
unsigned int run=((unsigned int)nsim);
while (run>1)
- {
- if (run&0x1U)
- rle[(*j)++]=1;
- else
- rle[(*j)++]=0;
- run>>=1;
- }
+ {
+ if (run&0x1U)
+ rle[(*j)++]=1;
+ else
+ rle[(*j)++]=0;
+ run>>=1;
+ }
nsim=1;
}
while (nsim--)
@@ -39,8 +39,8 @@ static void add_rle(unsigned int *rle,
Acceptable inputs are about 16 bits (0-0xFFFF)
If input is 0-N output will be be values of 0-(N+2) */
void Ptngc_comp_conv_to_rle(unsigned int *vals, int nvals,
- unsigned int *rle, int *nrle,
- int min_rle)
+ unsigned int *rle, int *nrle,
+ int min_rle)
{
int i;
int j=0;
@@ -49,21 +49,21 @@ void Ptngc_comp_conv_to_rle(unsigned int *vals, int nvals,
for (i=0; i<nvals; i++)
{
if (!nsim)
- {
- v=vals[i];
- nsim=1;
- }
+ {
+ v=vals[i];
+ nsim=1;
+ }
else
- {
- if (v==vals[i])
- nsim++;
- else
- {
- add_rle(rle,v,nsim,&j,min_rle);
- nsim=1;
- v=vals[i];
- }
- }
+ {
+ if (v==vals[i])
+ nsim++;
+ else
+ {
+ add_rle(rle,v,nsim,&j,min_rle);
+ nsim=1;
+ v=vals[i];
+ }
+ }
}
if (nsim!=0)
add_rle(rle,v,nsim,&j,min_rle);
@@ -71,7 +71,7 @@ void Ptngc_comp_conv_to_rle(unsigned int *vals, int nvals,
}
void Ptngc_comp_conv_from_rle(unsigned int *rle,
- unsigned int *vals, int nvals)
+ unsigned int *vals, int nvals)
{
int i=0;
int j=0;
@@ -83,19 +83,19 @@ void Ptngc_comp_conv_from_rle(unsigned int *rle,
unsigned int v=rle[j++];
unsigned int hasrle=0;
while (v<2)
- {
- if (v)
- len|=mask;
- mask<<=1;
- hasrle=1;
- v=rle[j++];
- }
+ {
+ if (v)
+ len|=mask;
+ mask<<=1;
+ hasrle=1;
+ v=rle[j++];
+ }
if (!hasrle)
- len=1;
+ len=1;
else
- len|=mask;
+ len|=mask;
for (k=0; k<(int)len; k++)
- vals[i++]=v-2;
+ vals[i++]=v-2;
}
}
contact: Jan Huwald // Impressum