/* Aplico el BlockSorting */
bs_solve(data, salida, bs, &k, i);
- /*printf("BS k=%ld\n", *(Uint32 *)(salida+sizeof(Uint32)));
- printf("PageSize = %ld\n", *(Uint32 *)salida);
-
- printf("Antes de MTF = %ld [", i);
- {
- int ii;
- for(ii=0; ii<(i+sizeof(Uint32)); ii++)
- printf("(%c)", salida[ii+sizeof(Uint32)]);
- printf("]\n");
- }*/
-
/* Le aplico el MTF, salteo el tamaƱo del bloque para que no se pierda. */
mtf = jacu_mtf(salida+sizeof(Uint32), i+sizeof(Uint32), &z, &z_len);
-/*
- printf("MTF Z (len=%d) = [", z_len);
- {
- int ii;
- for(ii=0; ii<z_len; ii++)
- printf("(%c)", z[ii]);
- printf("]\n");
-
- }*/
+
/* Si me lo piden, aplico ZG. */
if (zflag) {
size_t len;
z = malloc(sizeof(unsigned char)*z_len);
moredata = shuff_decode_chunk(shuff,z,z_len,&decoded);
- /*printf("MTF Z (len=%d) = [", z_len);
- {
- int ii;
- for(ii=0; ii<z_len; ii++)
- printf("(%c)", z[ii]);
- printf("]\n");
-
- }*/
-
block = malloc(block_size*sizeof(unsigned char)+sizeof(Uint32));
orig = malloc(block_size*sizeof(unsigned char));
moredata = shuff_decode_chunk(shuff,block,block_size+sizeof(Uint32),&decoded);
- /*printf("Antes MTF_inv = [");
- {
- int ii;
- for(ii=0; ii<block_size+sizeof(Uint32); ii++)
- printf("(%c)", block[ii]);
- printf("]\n");
- }*/
- /* Hago el MTF inverso */
mtf = jacu_mtf_inv(z, block, block_size*sizeof(unsigned char)+sizeof(Uint32));
- /*printf("Luego de MTF Inv= [");
- {
- int ii;
- for(ii=0; ii<block_size+sizeof(Uint32); ii++)
- printf("(%c)", mtf[ii]);
- printf("]\n");
- }*/
-
/* Luego de hacer el MTF inverso ya puedo recuperar el k */
memcpy(&k, mtf, sizeof(Uint32));