X-Git-Url: https://git.llucax.com/z.facultad/75.06/jacu.git/blobdiff_plain/aa8449b561daa87704778c0723371d67428fa216..3b71f7cd211e2f418bfae2aca562d90db1b3ced2:/src/blocksorting/main.c

diff --git a/src/blocksorting/main.c b/src/blocksorting/main.c
index f73ed12..8e23484 100644
--- a/src/blocksorting/main.c
+++ b/src/blocksorting/main.c
@@ -1,6 +1,42 @@
+/*----------------------------------------------------------------------------
+ *                   jacu - Just Another Compression Utility
+ *----------------------------------------------------------------------------
+ * This file is part of jacu.
+ *
+ * jacu is free software; you can redistribute it and/or modify it under the
+ * terms of the GNU General Public License as published by the Free Software
+ * Foundation; either version 2 of the License, or (at your option) any later
+ * version.
+ *
+ * jacu is distributed in the hope that it will be useful, but WITHOUT ANY
+ * WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
+ * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more
+ * details.
+ *
+ * You should have received a copy of the GNU General Public License along
+ * with jacu; if not, write to the Free Software Foundation, Inc., 59 Temple
+ * Place, Suite 330, Boston, MA  02111-1307  USA
+ *----------------------------------------------------------------------------
+ */
+
 
 #include "bs.h"
 
+void print_v(char *txt, char *data, Uint32 len)
+{
+	Uint32 i;
+
+	printf("%s", txt);
+	
+	for(i=0; i<len; i++) {
+		if (data[i] == '\n')
+			printf("#");
+		else
+			printf("%c", data[i]);
+	}
+	printf("\n");
+}
+
 int main(int argc, char *argv[])
 {
 	char *data; 
@@ -23,7 +59,7 @@ int main(int argc, char *argv[])
 	}
 
 	data = malloc(sizeof(char)*len);
-	salida = malloc(sizeof(char)*(len+1+sizeof(unsigned long int)*2));
+	salida = malloc(sizeof(char)*(len+1+sizeof(unsigned long int)));
 	orig = malloc(sizeof(char)*(len+1));
 
 	salida[len] = '\0';
@@ -31,22 +67,21 @@ int main(int argc, char *argv[])
 
 	bs = bs_create(len);
 
-	c = fgetc(fp);
 	total = 0;
 	while (!feof(fp)) {
 		i = 0;
-		while ((!feof(fp)) && (i < len)) {
-			data[i++] = c;
-			c = fgetc(fp);
-			total++;
-		}
+		i = bs_readblock(fp, data, len, 1);
+		
+		total += i;
+		
 		bs_solve(data, salida, bs, &k, i);
 
 		/* XXX ACA SALIDA DEBERIA PASAR A LA SIGUIENTE ETAPA XXX */
 		if (argc == 3) {
-			printf("BS : %s -> %ld\n", salida, k);
-			bs_restore(orig, salida, k, i);
-			printf("Orig : %s\n", orig);
+			bs_restore(orig, salida+sizeof(Uint32), k, i);
+			print_v("Leido     : ", data, i);
+			print_v("BS        : ", salida+sizeof(Uint32), i);
+			/*print_v("Restorado : ", orig, i);*/
 		} else
 			fwrite(salida, 1, i, stdout);
 	}