1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467
|
/* $Id: libdynamite.c,v 1.2 2003/08/22 15:44:04 twogood Exp $ */
#include "libdynamite.h"
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
/*
This code probably looks really bad to anyone that is experienced with
(de)compression algorithms. But it works.
*/
#define DEBUG 0
#if DEBUG
#include <stdio.h>
#endif
#define BUFFER_SIZE 0x8000
#define MAX_DICTIONARY_SIZE 0x1000
#define BIT_0 1
#define BIT_8 0x100
#define FREE(ptr) { if (ptr) { free(ptr); ptr = NULL; } }
typedef struct _Dynamite
{
DynamiteResult status;
/* external connections */
dynamite_reader reader;
dynamite_writer writer;
void* cookie;
/* bit reader */
uint8_t* buffer;
size_t size;
size_t offset;
int byte;
int bit;
/* dictionary */
uint8_t* dictionary;
int dictionary_bits;
int dictionary_size;
int window_offset;
/* debug */
size_t bytes_written;
} Dynamite;
static size_t dynamite_read(Dynamite* dynamite, void* buffer, size_t size)/*{{{*/
{
return dynamite->reader(buffer, size, dynamite->cookie);
}/*}}}*/
static size_t dynamite_write(Dynamite* dynamite, void* buffer, size_t size)/*{{{*/
{
return dynamite->writer(buffer, size, dynamite->cookie);
}/*}}}*/
static bool dynamite_read_header(Dynamite* dynamite)/*{{{*/
{
bool success = false;
uint8_t header[2];
if (sizeof(header) != dynamite_read(dynamite, header, sizeof(header)))
goto exit;
dynamite->dictionary_bits = header[1];
switch (header[0])
{
case 0:
/* ok! */
break;
case 1:
/* encoded literal representation, not (yet) supported, fall through */
dynamite->status = DYNAMITE_NOT_IMPLEMENTED;
goto exit;
default:
/* not compressed with this algorithm! */
dynamite->status = DYNAMITE_BAD_FORMAT;
goto exit;
}
switch (dynamite->dictionary_bits)
{
case 4:
dynamite->dictionary_size = 0x400;
break;
case 5:
dynamite->dictionary_size = 0x800;
break;
case 6:
dynamite->dictionary_size = 0x1000;
break;
default:
/* not compressed with this algorithm! */
dynamite->status = DYNAMITE_BAD_FORMAT;
goto exit;
}
success = true;
exit:
return success;
}/*}}}*/
bool dynamite_get_new_buffer(Dynamite* dynamite)/*{{{*/
{
dynamite->size = dynamite_read(dynamite, dynamite->buffer, BUFFER_SIZE);
dynamite->offset = 0;
dynamite->byte = dynamite->buffer[dynamite->offset];
if (0 == dynamite->size)
{
dynamite->status = DYNAMITE_READ_ERROR;
return false;
}
else
return true;
}/*}}}*/
static unsigned dynamite_read_bit(Dynamite* dynamite)/*{{{*/
{
/* XXX: this could probably be optimized */
unsigned result;
if (dynamite->bit == 8)
{
dynamite->offset++;
if (dynamite->offset == dynamite->size)
{
dynamite_get_new_buffer(dynamite);
}
else
{
dynamite->byte = dynamite->buffer[dynamite->offset];
}
dynamite->bit = 0;
}
result = dynamite->byte & 1;
dynamite->byte >>= 1;
dynamite->bit++;
return result;
}/*}}}*/
static unsigned dynamite_read_bits_little_endian(Dynamite* dynamite, int count)/*{{{*/
{
/* XXX: this could probably be optimized */
int i;
unsigned result = 0;
unsigned bit = 1;
for (i = 0; i < count; i++)
{
if (dynamite_read_bit(dynamite))
result |= bit;
bit <<= 1;
}
return result;
}/*}}}*/
static unsigned dynamite_read_bits_big_endian(Dynamite* dynamite, int count)/*{{{*/
{
/* XXX: this could probably be optimized */
int i;
unsigned result = 0;
for (i = 0; i < count; i++)
{
result <<= 1;
result |= dynamite_read_bit(dynamite);
}
return result;
}/*}}}*/
static int dynamite_get_copy_length(Dynamite* dynamite)/*{{{*/
{
unsigned bits;
bits = dynamite_read_bits_big_endian(dynamite, 2);
switch (bits)
{
case 0: /* 00 */
bits = dynamite_read_bits_big_endian(dynamite, 2);
switch (bits)/*{{{*/
{
case 0: /* 0000 */
bits = dynamite_read_bits_big_endian(dynamite, 2);
switch (bits)
{
case 0: /* 000000 */
if (dynamite_read_bit(dynamite)) /* 0000001 */
{
return 136 + dynamite_read_bits_little_endian(dynamite, 7);
}
else /* 0000000 */
{
return 264 + dynamite_read_bits_little_endian(dynamite, 8);
}
case 1: /* 000001 */
return 72 + dynamite_read_bits_little_endian(dynamite, 6);
case 2: /* 000010 */
return 40 + dynamite_read_bits_little_endian(dynamite, 5);
case 3: /* 000011 */
return 24 + dynamite_read_bits_little_endian(dynamite, 4);
default:
abort();
}
case 1: /* 0001 */
if (dynamite_read_bit(dynamite))
return 12 + dynamite_read_bits_little_endian(dynamite, 2);
else
return 16 + dynamite_read_bits_little_endian(dynamite, 3);
case 2: /* 0010 */
if (dynamite_read_bit(dynamite)) /* 00101 */
return 9;
else /* 00100 */
return 10 + dynamite_read_bit(dynamite);
case 3: /* 0011 */
return 8;
default:
abort();
}/*}}}*/
case 1: /* 01 */
if (dynamite_read_bit(dynamite))
return 5; /* 011 */
else /* 010 */
{
if (dynamite_read_bit(dynamite))
return 6; /* 0101 */
else
return 7; /* 0100 */
}
case 2: /* 10 */
if (dynamite_read_bit(dynamite))
return 2; /* 101 */
else
return 4; /* 100 */
case 3:
return 3;
default:
abort();
}
}/*}}}*/
static unsigned dynamite_get_upper_offset_bits(Dynamite* dynamite)/*{{{*/
{
unsigned bits;
bits = dynamite_read_bits_big_endian(dynamite, 2);
switch (bits)
{
case 0: /* 00 */
if (dynamite_read_bit(dynamite)) /* 001 */
{
bits = dynamite_read_bits_big_endian(dynamite, 4);
return 0x27 - bits;
}
else /* 000 */
{
if (dynamite_read_bit(dynamite)) /* 0001 */
{
bits = dynamite_read_bits_big_endian(dynamite, 3);
return 0x2f - bits;
}
else /* 0000 */
{
bits = dynamite_read_bits_big_endian(dynamite, 4);
return 0x3f - bits;
}
}
case 1: /* 01 */
bits = dynamite_read_bits_big_endian(dynamite, 4);
if (bits)
return 0x16 - bits;
else
return 0x17 - dynamite_read_bit(dynamite);
case 2: /* 10 */
bits = dynamite_read_bit(dynamite) << 1;
bits |= dynamite_read_bit(dynamite);
switch (bits)
{
case 0: /* 1000 */
if (dynamite_read_bit(dynamite))
return 5;
else
return 6;
case 1: /* 1001 */
if (dynamite_read_bit(dynamite))
return 3;
else
return 4;
case 2: /* 1010 */
return 2;
case 3: /* 1011 */
return 1;
default:
abort();
}
case 3: /* 11 */
return 0;
default:
abort();
}
}/*}}}*/
static int dynamite_get_offset(Dynamite* dynamite, int length)/*{{{*/
{
unsigned lower_bit_count;
int result = 0;
if (2 == length)
lower_bit_count = 2;
else
lower_bit_count = dynamite->dictionary_bits;
result = dynamite_get_upper_offset_bits(dynamite) << lower_bit_count;
result |= dynamite_read_bits_little_endian(dynamite, lower_bit_count);
return result;
}/*}}}*/
static void dynamite_add_to_dictionary(Dynamite* dynamite, uint8_t byte)/*{{{*/
{
dynamite->window_offset = (dynamite->window_offset + 1) % dynamite->dictionary_size;
dynamite->dictionary[dynamite->window_offset] = byte;
}/*}}}*/
static uint8_t dynamite_get_from_dictionary(Dynamite* dynamite, int offset)/*{{{*/
{
size_t window_offset = dynamite->window_offset;
if (offset > window_offset)
{
window_offset += dynamite->dictionary_size;
}
return dynamite->dictionary[window_offset - offset];
}/*}}}*/
static bool dynamite_write_byte(Dynamite* dynamite, uint8_t byte)/*{{{*/
{
#if DEBUG
fprintf(stderr, "%02x ", byte);
#endif
dynamite_add_to_dictionary(dynamite, byte);
if (1 == dynamite_write(dynamite, &byte, 1))
{
dynamite->bytes_written++;
return true;
}
else
{
dynamite->status = DYNAMITE_WRITE_ERROR;
return false;
}
}/*}}}*/
DynamiteResult dynamite_explode(dynamite_reader reader, dynamite_writer writer, void* cookie)
{
Dynamite dynamite;
memset(&dynamite, 0, sizeof(Dynamite));
dynamite.status = DYNAMITE_UNEXPECTED_ERROR;
dynamite.reader = reader;
dynamite.writer = writer;
dynamite.cookie = cookie;
dynamite.buffer = malloc(BUFFER_SIZE);
if (!dynamite_read_header(&dynamite))
goto exit;
if (!dynamite_get_new_buffer(&dynamite))
goto exit;
dynamite.status = DYNAMITE_SUCCESS;
dynamite.dictionary = malloc(dynamite.dictionary_size);
memset(dynamite.dictionary, 0, dynamite.dictionary_size);
while (DYNAMITE_SUCCESS == dynamite.status)
{
#if DEBUG
fprintf(stderr, "%08x: ", dynamite.bytes_written);
#endif
if (dynamite_read_bit(&dynamite))
{
/* Control token */
int length = dynamite_get_copy_length(&dynamite);
assert(length <= 519);
if (519 == length)
{
/* finished */
break;
}
else
{
int offset = dynamite_get_offset(&dynamite, length);
#if DEBUG
fprintf(stderr, "Copying %i bytes from offset %i\n", length, offset);
#endif
while (length)
{
dynamite_write_byte(&dynamite, dynamite_get_from_dictionary(&dynamite, offset));
length--;
}
}
}
else
{
/*
Literal token
*/
/* TODO: handle encoded representation too */
uint8_t byte = dynamite_read_bits_little_endian(&dynamite, 8) /*& 0xff*/;
dynamite_write_byte(&dynamite, byte);
}
#if DEBUG
if (dynamite.bytes_written > 0x20)
abort();
#endif
#if DEBUG
fprintf(stderr, "\n");
#endif
}
exit:
FREE(dynamite.buffer);
FREE(dynamite.dictionary);
return dynamite.status;
}
|