wok-next annotate syslinux/stuff/extra/loadhigh.u @ rev 18783

syslinux: set tz command line argument
author Pascal Bellard <pascal.bellard@slitaz.org>
date Sun Jan 03 13:17:18 2016 +0100 (2016-01-03)
parents 924e6ea5da10
children 8ebcb0ded385
rev   line source
pascal@18757 1 --- core/fs/loadhigh.c
pascal@18757 2 +++ core/fs/loadhigh.c
pascal@18757 3 @@ -36,6 +36,11 @@
pascal@18757 4 #include <minmax.h>
pascal@18757 5 #include "core.h"
pascal@18757 6 #include "fs.h"
pascal@18757 7 +#define LZLOAD ".c32 modules can be compressed with lz4 or lzma"
pascal@18757 8 +#ifdef LZLOAD
pascal@18757 9 +#include "../unlz4.c"
pascal@18757 10 +#include "../unlzma.c"
pascal@18757 11 +#endif
pascal@18757 12
pascal@18757 13 #define MAX_CHUNK (1 << 20) /* 1 MB */
pascal@18757 14
pascal@18757 15 @@ -51,6 +56,10 @@
pascal@18757 16 uint32_t sector_mask;
pascal@18757 17 size_t pad;
pascal@18757 18 uint32_t retflags = 0;
pascal@18757 19 +#ifdef LZLOAD
pascal@18757 20 + char *unpacked = (char *) regs->edi.l;
pascal@18757 21 + size_t unpackedsz;
pascal@18757 22 +#endif
pascal@18757 23
pascal@18757 24 bytes = regs->eax.l;
pascal@18757 25 zero_mask = regs->edx.w[0];
pascal@18757 26 @@ -101,6 +110,27 @@
pascal@18757 27 break;
pascal@18757 28 }
pascal@18757 29 }
pascal@18757 30 +
pascal@18757 31 +#ifdef LZLOAD
pascal@18757 32 + unpackedsz = buf - unpacked;
pascal@18757 33 + switch (* (short *) unpacked) {
pascal@18757 34 + char *packed;
pascal@18757 35 + case 0x005D:
pascal@18757 36 + packed = unpacked + * (unsigned long *) (unpacked + 5)
pascal@18757 37 + - unpackedsz + 1024;
pascal@18757 38 +
pascal@18757 39 + if (packed < unpacked + 1024)
pascal@18757 40 + packed = unpacked + 1024;
pascal@18757 41 + memmove(packed, unpacked, unpackedsz);
pascal@18757 42 + unlzma(packed, unpacked, packed + unpackedsz /* head */);
pascal@18757 43 + buf = packed;
pascal@18757 44 + break;
pascal@18757 45 + case 0x2204:
pascal@18757 46 + case 0x2102:
pascal@18759 47 + buf = (char *) unlz4((unsigned char *) unpacked, (unsigned char *) buf);
pascal@18757 48 + break;
pascal@18757 49 + }
pascal@18757 50 +#endif
pascal@18757 51
pascal@18757 52 pad = (size_t)buf & zero_mask;
pascal@18757 53 if (pad)
pascal@18757 54 --- /dev/null
pascal@18757 55 +++ core/unlzma.c
pascal@18759 56 @@ -0,0 +1,385 @@
pascal@18757 57 +typedef unsigned char uint8_t;
pascal@18757 58 +typedef unsigned short uint16_t;
pascal@18757 59 +typedef unsigned uint32_t;
pascal@18757 60 +typedef unsigned long long uint64_t;
pascal@18757 61 +typedef unsigned size_t;
pascal@18757 62 +#define SWAP_LE32(x) (x)
pascal@18757 63 +#define SWAP_LE64(x) (x)
pascal@18757 64 +/* vi: set sw=4 ts=4: */
pascal@18757 65 +/*
pascal@18757 66 + * Small lzma deflate implementation.
pascal@18757 67 + * Copyright (C) 2006 Aurelien Jacobs <aurel@gnuage.org>
pascal@18757 68 + *
pascal@18757 69 + * Based on LzmaDecode.c from the LZMA SDK 4.22 (http://www.7-zip.org/)
pascal@18757 70 + * Copyright (C) 1999-2005 Igor Pavlov
pascal@18757 71 + *
pascal@18757 72 + * Licensed under GPLv2 or later, see file LICENSE in this source tree.
pascal@18757 73 + */
pascal@18757 74 +
pascal@18759 75 +#include <string.h>
pascal@18759 76 +
pascal@18757 77 +#define PACKED __attribute__ ((packed))
pascal@18757 78 +#define ALWAYS_INLINE inline
pascal@18757 79 +#define speed_inline
pascal@18757 80 +#define size_inline ALWAYS_INLINE
pascal@18757 81 +
pascal@18757 82 +
pascal@18757 83 +typedef struct {
pascal@18757 84 + uint8_t *ptr;
pascal@18757 85 +
pascal@18757 86 + uint32_t code;
pascal@18757 87 + uint32_t range;
pascal@18757 88 + uint32_t bound;
pascal@18757 89 +} rc_t;
pascal@18757 90 +
pascal@18757 91 +#define RC_TOP_BITS 24
pascal@18757 92 +#define RC_MOVE_BITS 5
pascal@18757 93 +#define RC_MODEL_TOTAL_BITS 11
pascal@18757 94 +
pascal@18757 95 +/* Called twice, but one callsite is in speed_inline'd rc_is_bit_1() */
pascal@18757 96 +static void rc_do_normalize(rc_t *rc)
pascal@18757 97 +{
pascal@18757 98 + rc->range <<= 8;
pascal@18757 99 + rc->code = (rc->code << 8) | *rc->ptr++;
pascal@18757 100 +}
pascal@18757 101 +
pascal@18757 102 +static ALWAYS_INLINE void rc_normalize(rc_t *rc)
pascal@18757 103 +{
pascal@18757 104 + if (rc->range < (1 << RC_TOP_BITS)) {
pascal@18757 105 + rc_do_normalize(rc);
pascal@18757 106 + }
pascal@18757 107 +}
pascal@18757 108 +
pascal@18757 109 +/* Called once */
pascal@18757 110 +static void rc_init(rc_t *rc) /*, int buffer_size) */
pascal@18757 111 +{
pascal@18757 112 + int i;
pascal@18757 113 +
pascal@18757 114 + rc->range = 0;
pascal@18757 115 + for (i = 0; i < 5; i++) {
pascal@18757 116 + rc_do_normalize(rc);
pascal@18757 117 + }
pascal@18757 118 + rc->range = 0xffffffff;
pascal@18757 119 +}
pascal@18757 120 +
pascal@18757 121 +/* rc_is_bit_1 is called 9 times */
pascal@18757 122 +static speed_inline int rc_is_bit_1(rc_t *rc, uint16_t *p)
pascal@18757 123 +{
pascal@18757 124 + rc_normalize(rc);
pascal@18757 125 + rc->bound = *p * (rc->range >> RC_MODEL_TOTAL_BITS);
pascal@18757 126 + if (rc->code < rc->bound) {
pascal@18757 127 + rc->range = rc->bound;
pascal@18757 128 + *p += ((1 << RC_MODEL_TOTAL_BITS) - *p) >> RC_MOVE_BITS;
pascal@18757 129 + return 0;
pascal@18757 130 + }
pascal@18757 131 + rc->range -= rc->bound;
pascal@18757 132 + rc->code -= rc->bound;
pascal@18757 133 + *p -= *p >> RC_MOVE_BITS;
pascal@18757 134 + return 1;
pascal@18757 135 +}
pascal@18757 136 +
pascal@18757 137 +/* Called 4 times in unlzma loop */
pascal@18757 138 +static ALWAYS_INLINE int rc_get_bit(rc_t *rc, uint16_t *p, int *symbol)
pascal@18757 139 +{
pascal@18757 140 + int ret = rc_is_bit_1(rc, p);
pascal@18757 141 + *symbol = *symbol * 2 + ret;
pascal@18757 142 + return ret;
pascal@18757 143 +}
pascal@18757 144 +
pascal@18757 145 +/* Called once */
pascal@18757 146 +static ALWAYS_INLINE int rc_direct_bit(rc_t *rc)
pascal@18757 147 +{
pascal@18757 148 + rc_normalize(rc);
pascal@18757 149 + rc->range >>= 1;
pascal@18757 150 + if (rc->code >= rc->range) {
pascal@18757 151 + rc->code -= rc->range;
pascal@18757 152 + return 1;
pascal@18757 153 + }
pascal@18757 154 + return 0;
pascal@18757 155 +}
pascal@18757 156 +
pascal@18757 157 +/* Called twice */
pascal@18757 158 +static speed_inline void
pascal@18757 159 +rc_bit_tree_decode(rc_t *rc, uint16_t *p, int num_levels, int *symbol)
pascal@18757 160 +{
pascal@18757 161 + int i = num_levels;
pascal@18757 162 +
pascal@18757 163 + *symbol = 1;
pascal@18757 164 + while (i--)
pascal@18757 165 + rc_get_bit(rc, p + *symbol, symbol);
pascal@18757 166 + *symbol -= 1 << num_levels;
pascal@18757 167 +}
pascal@18757 168 +
pascal@18757 169 +
pascal@18757 170 +typedef struct {
pascal@18757 171 + uint8_t pos;
pascal@18757 172 + uint32_t dict_size;
pascal@18757 173 + uint64_t dst_size;
pascal@18757 174 +} PACKED lzma_header_t;
pascal@18757 175 +
pascal@18757 176 +
pascal@18757 177 +/* #defines will force compiler to compute/optimize each one with each usage.
pascal@18757 178 + * Have heart and use enum instead. */
pascal@18757 179 +enum {
pascal@18757 180 + LZMA_BASE_SIZE = 1846,
pascal@18757 181 + LZMA_LIT_SIZE = 768,
pascal@18757 182 +
pascal@18757 183 + LZMA_NUM_POS_BITS_MAX = 4,
pascal@18757 184 +
pascal@18757 185 + LZMA_LEN_NUM_LOW_BITS = 3,
pascal@18757 186 + LZMA_LEN_NUM_MID_BITS = 3,
pascal@18757 187 + LZMA_LEN_NUM_HIGH_BITS = 8,
pascal@18757 188 +
pascal@18757 189 + LZMA_LEN_CHOICE = 0,
pascal@18757 190 + LZMA_LEN_CHOICE_2 = (LZMA_LEN_CHOICE + 1),
pascal@18757 191 + LZMA_LEN_LOW = (LZMA_LEN_CHOICE_2 + 1),
pascal@18757 192 + LZMA_LEN_MID = (LZMA_LEN_LOW \
pascal@18757 193 + + (1 << (LZMA_NUM_POS_BITS_MAX + LZMA_LEN_NUM_LOW_BITS))),
pascal@18757 194 + LZMA_LEN_HIGH = (LZMA_LEN_MID \
pascal@18757 195 + + (1 << (LZMA_NUM_POS_BITS_MAX + LZMA_LEN_NUM_MID_BITS))),
pascal@18757 196 + LZMA_NUM_LEN_PROBS = (LZMA_LEN_HIGH + (1 << LZMA_LEN_NUM_HIGH_BITS)),
pascal@18757 197 +
pascal@18757 198 + LZMA_NUM_STATES = 12,
pascal@18757 199 + LZMA_NUM_LIT_STATES = 7,
pascal@18757 200 +
pascal@18757 201 + LZMA_START_POS_MODEL_INDEX = 4,
pascal@18757 202 + LZMA_END_POS_MODEL_INDEX = 14,
pascal@18757 203 + LZMA_NUM_FULL_DISTANCES = (1 << (LZMA_END_POS_MODEL_INDEX >> 1)),
pascal@18757 204 +
pascal@18757 205 + LZMA_NUM_POS_SLOT_BITS = 6,
pascal@18757 206 + LZMA_NUM_LEN_TO_POS_STATES = 4,
pascal@18757 207 +
pascal@18757 208 + LZMA_NUM_ALIGN_BITS = 4,
pascal@18757 209 +
pascal@18757 210 + LZMA_MATCH_MIN_LEN = 2,
pascal@18757 211 +
pascal@18757 212 + LZMA_IS_MATCH = 0,
pascal@18757 213 + LZMA_IS_REP = (LZMA_IS_MATCH + (LZMA_NUM_STATES << LZMA_NUM_POS_BITS_MAX)),
pascal@18757 214 + LZMA_IS_REP_G0 = (LZMA_IS_REP + LZMA_NUM_STATES),
pascal@18757 215 + LZMA_IS_REP_G1 = (LZMA_IS_REP_G0 + LZMA_NUM_STATES),
pascal@18757 216 + LZMA_IS_REP_G2 = (LZMA_IS_REP_G1 + LZMA_NUM_STATES),
pascal@18757 217 + LZMA_IS_REP_0_LONG = (LZMA_IS_REP_G2 + LZMA_NUM_STATES),
pascal@18757 218 + LZMA_POS_SLOT = (LZMA_IS_REP_0_LONG \
pascal@18757 219 + + (LZMA_NUM_STATES << LZMA_NUM_POS_BITS_MAX)),
pascal@18757 220 + LZMA_SPEC_POS = (LZMA_POS_SLOT \
pascal@18757 221 + + (LZMA_NUM_LEN_TO_POS_STATES << LZMA_NUM_POS_SLOT_BITS)),
pascal@18757 222 + LZMA_ALIGN = (LZMA_SPEC_POS \
pascal@18757 223 + + LZMA_NUM_FULL_DISTANCES - LZMA_END_POS_MODEL_INDEX),
pascal@18757 224 + LZMA_LEN_CODER = (LZMA_ALIGN + (1 << LZMA_NUM_ALIGN_BITS)),
pascal@18757 225 + LZMA_REP_LEN_CODER = (LZMA_LEN_CODER + LZMA_NUM_LEN_PROBS),
pascal@18757 226 + LZMA_LITERAL = (LZMA_REP_LEN_CODER + LZMA_NUM_LEN_PROBS),
pascal@18757 227 +};
pascal@18757 228 +
pascal@18757 229 +
pascal@18757 230 +void unlzma(char *from, char *to, char *heap)
pascal@18757 231 +{
pascal@18757 232 + lzma_header_t header;
pascal@18757 233 + int lc, pb, lp;
pascal@18757 234 + uint32_t pos_state_mask;
pascal@18757 235 + uint32_t literal_pos_mask;
pascal@18757 236 + uint16_t *p;
pascal@18757 237 + rc_t *rc = (rc_t *) heap;
pascal@18757 238 + int i;
pascal@18757 239 + uint8_t *buffer = (void *) to;
pascal@18757 240 + uint8_t previous_byte = 0;
pascal@18757 241 + size_t buffer_pos = 0;
pascal@18757 242 + int len = 0;
pascal@18757 243 + int state = 0;
pascal@18757 244 + uint32_t rep0 = 1, rep1 = 1, rep2 = 1, rep3 = 1;
pascal@18757 245 +
pascal@18757 246 + memcpy(&header, from, sizeof(header));
pascal@18757 247 + from += sizeof(header);
pascal@18757 248 + heap += sizeof(*rc);
pascal@18757 249 + rc->ptr = (void *) from;
pascal@18757 250 +
pascal@18757 251 + i = header.pos / 9;
pascal@18757 252 + lc = header.pos % 9;
pascal@18757 253 + pb = i / 5;
pascal@18757 254 + lp = i % 5;
pascal@18757 255 + pos_state_mask = (1 << pb) - 1;
pascal@18757 256 + literal_pos_mask = (1 << lp) - 1;
pascal@18757 257 +
pascal@18757 258 + /* Example values from linux-3.3.4.tar.lzma:
pascal@18757 259 + * dict_size: 64M, dst_size: 2^64-1
pascal@18757 260 + */
pascal@18757 261 + header.dict_size = SWAP_LE32(header.dict_size);
pascal@18757 262 + header.dst_size = SWAP_LE64(header.dst_size);
pascal@18757 263 +
pascal@18757 264 + //if (header.dict_size == 0)
pascal@18757 265 + // header.dict_size++;
pascal@18757 266 +
pascal@18757 267 + rc_init(rc);
pascal@18757 268 +
pascal@18757 269 + {
pascal@18757 270 + int num_probs;
pascal@18757 271 +
pascal@18757 272 + num_probs = LZMA_BASE_SIZE + (LZMA_LIT_SIZE << (lc + lp));
pascal@18757 273 + //p = xmalloc(num_probs * sizeof(*p));
pascal@18757 274 + p = (void *) heap;
pascal@18757 275 + num_probs += LZMA_LITERAL - LZMA_BASE_SIZE;
pascal@18757 276 + for (i = 0; i < num_probs; i++)
pascal@18757 277 + p[i] = (1 << RC_MODEL_TOTAL_BITS) >> 1;
pascal@18757 278 + }
pascal@18757 279 +
pascal@18757 280 +
pascal@18757 281 + while (buffer_pos < header.dst_size) {
pascal@18757 282 + int pos_state = buffer_pos & pos_state_mask;
pascal@18757 283 + uint16_t *prob = p + LZMA_IS_MATCH + (state << LZMA_NUM_POS_BITS_MAX) + pos_state;
pascal@18757 284 +
pascal@18757 285 + if (!rc_is_bit_1(rc, prob)) {
pascal@18757 286 + static const char next_state[LZMA_NUM_STATES] =
pascal@18757 287 + { 0, 0, 0, 0, 1, 2, 3, 4, 5, 6, 4, 5 };
pascal@18757 288 + int mi = 1;
pascal@18757 289 +
pascal@18757 290 + prob = (p + LZMA_LITERAL
pascal@18757 291 + + (LZMA_LIT_SIZE * (((buffer_pos & literal_pos_mask) << lc)
pascal@18757 292 + + (previous_byte >> (8 - lc))
pascal@18757 293 + )
pascal@18757 294 + )
pascal@18757 295 + );
pascal@18757 296 +
pascal@18757 297 + if (state >= LZMA_NUM_LIT_STATES) {
pascal@18757 298 + int match_byte;
pascal@18757 299 + uint32_t pos = buffer_pos - rep0;
pascal@18757 300 +
pascal@18757 301 + while (pos >= header.dict_size)
pascal@18757 302 + pos += header.dict_size;
pascal@18757 303 + match_byte = buffer[pos];
pascal@18757 304 + do {
pascal@18757 305 + int bit;
pascal@18757 306 +
pascal@18757 307 + match_byte <<= 1;
pascal@18757 308 + bit = match_byte & 0x100;
pascal@18757 309 + bit ^= (rc_get_bit(rc, prob + 0x100 + bit + mi, &mi) << 8); /* 0x100 or 0 */
pascal@18757 310 + if (bit)
pascal@18757 311 + break;
pascal@18757 312 + } while (mi < 0x100);
pascal@18757 313 + }
pascal@18757 314 + while (mi < 0x100) {
pascal@18757 315 + rc_get_bit(rc, prob + mi, &mi);
pascal@18757 316 + }
pascal@18757 317 +
pascal@18757 318 + state = next_state[state];
pascal@18757 319 +
pascal@18757 320 + previous_byte = (uint8_t) mi;
pascal@18757 321 + len = 1;
pascal@18757 322 + goto one_byte2;
pascal@18757 323 + } else {
pascal@18757 324 + int num_bits;
pascal@18757 325 + int offset;
pascal@18757 326 + uint16_t *prob2;
pascal@18757 327 +#define prob_len prob2
pascal@18757 328 +
pascal@18757 329 + prob2 = p + LZMA_IS_REP + state;
pascal@18757 330 + if (!rc_is_bit_1(rc, prob2)) {
pascal@18757 331 + rep3 = rep2;
pascal@18757 332 + rep2 = rep1;
pascal@18757 333 + rep1 = rep0;
pascal@18757 334 + state = state < LZMA_NUM_LIT_STATES ? 0 : 3;
pascal@18757 335 + prob2 = p + LZMA_LEN_CODER;
pascal@18757 336 + } else {
pascal@18757 337 + prob2 += LZMA_IS_REP_G0 - LZMA_IS_REP;
pascal@18757 338 + if (!rc_is_bit_1(rc, prob2)) {
pascal@18757 339 + prob2 = (p + LZMA_IS_REP_0_LONG
pascal@18757 340 + + (state << LZMA_NUM_POS_BITS_MAX)
pascal@18757 341 + + pos_state
pascal@18757 342 + );
pascal@18757 343 + if (!rc_is_bit_1(rc, prob2)) {
pascal@18757 344 + state = state < LZMA_NUM_LIT_STATES ? 9 : 11;
pascal@18757 345 + len = 1;
pascal@18757 346 + goto string;
pascal@18757 347 + }
pascal@18757 348 + } else {
pascal@18757 349 + uint32_t distance;
pascal@18757 350 +
pascal@18757 351 + prob2 += LZMA_IS_REP_G1 - LZMA_IS_REP_G0;
pascal@18757 352 + distance = rep1;
pascal@18757 353 + if (rc_is_bit_1(rc, prob2)) {
pascal@18757 354 + prob2 += LZMA_IS_REP_G2 - LZMA_IS_REP_G1;
pascal@18757 355 + distance = rep2;
pascal@18757 356 + if (rc_is_bit_1(rc, prob2)) {
pascal@18757 357 + distance = rep3;
pascal@18757 358 + rep3 = rep2;
pascal@18757 359 + }
pascal@18757 360 + rep2 = rep1;
pascal@18757 361 + }
pascal@18757 362 + rep1 = rep0;
pascal@18757 363 + rep0 = distance;
pascal@18757 364 + }
pascal@18757 365 + state = state < LZMA_NUM_LIT_STATES ? 8 : 11;
pascal@18757 366 + prob2 = p + LZMA_REP_LEN_CODER;
pascal@18757 367 + }
pascal@18757 368 +
pascal@18757 369 + prob_len = prob2 + LZMA_LEN_CHOICE;
pascal@18757 370 + num_bits = LZMA_LEN_NUM_LOW_BITS;
pascal@18757 371 + if (!rc_is_bit_1(rc, prob_len)) {
pascal@18757 372 + prob_len += LZMA_LEN_LOW - LZMA_LEN_CHOICE
pascal@18757 373 + + (pos_state << LZMA_LEN_NUM_LOW_BITS);
pascal@18757 374 + offset = 0;
pascal@18757 375 + } else {
pascal@18757 376 + prob_len += LZMA_LEN_CHOICE_2 - LZMA_LEN_CHOICE;
pascal@18757 377 + if (!rc_is_bit_1(rc, prob_len)) {
pascal@18757 378 + prob_len += LZMA_LEN_MID - LZMA_LEN_CHOICE_2
pascal@18757 379 + + (pos_state << LZMA_LEN_NUM_MID_BITS);
pascal@18757 380 + offset = 1 << LZMA_LEN_NUM_LOW_BITS;
pascal@18757 381 + num_bits += LZMA_LEN_NUM_MID_BITS - LZMA_LEN_NUM_LOW_BITS;
pascal@18757 382 + } else {
pascal@18757 383 + prob_len += LZMA_LEN_HIGH - LZMA_LEN_CHOICE_2;
pascal@18757 384 + offset = ((1 << LZMA_LEN_NUM_LOW_BITS)
pascal@18757 385 + + (1 << LZMA_LEN_NUM_MID_BITS));
pascal@18757 386 + num_bits += LZMA_LEN_NUM_HIGH_BITS - LZMA_LEN_NUM_LOW_BITS;
pascal@18757 387 + }
pascal@18757 388 + }
pascal@18757 389 + rc_bit_tree_decode(rc, prob_len, num_bits, &len);
pascal@18757 390 + len += offset;
pascal@18757 391 +
pascal@18757 392 + if (state < 4) {
pascal@18757 393 + int pos_slot;
pascal@18757 394 + uint16_t *prob3;
pascal@18757 395 +
pascal@18757 396 + state += LZMA_NUM_LIT_STATES;
pascal@18757 397 + prob3 = p + LZMA_POS_SLOT +
pascal@18757 398 + ((len < LZMA_NUM_LEN_TO_POS_STATES ? len :
pascal@18757 399 + LZMA_NUM_LEN_TO_POS_STATES - 1)
pascal@18757 400 + << LZMA_NUM_POS_SLOT_BITS);
pascal@18757 401 + rc_bit_tree_decode(rc, prob3,
pascal@18757 402 + LZMA_NUM_POS_SLOT_BITS, &pos_slot);
pascal@18757 403 + rep0 = pos_slot;
pascal@18757 404 + if (pos_slot >= LZMA_START_POS_MODEL_INDEX) {
pascal@18757 405 + int i2, mi2, num_bits2 = (pos_slot >> 1) - 1;
pascal@18757 406 + rep0 = 2 | (pos_slot & 1);
pascal@18757 407 + if (pos_slot < LZMA_END_POS_MODEL_INDEX) {
pascal@18757 408 + rep0 <<= num_bits2;
pascal@18757 409 + prob3 = p + LZMA_SPEC_POS + rep0 - pos_slot - 1;
pascal@18757 410 + } else {
pascal@18757 411 + for (; num_bits2 != LZMA_NUM_ALIGN_BITS; num_bits2--)
pascal@18757 412 + rep0 = (rep0 << 1) | rc_direct_bit(rc);
pascal@18757 413 + rep0 <<= LZMA_NUM_ALIGN_BITS;
pascal@18757 414 + prob3 = p + LZMA_ALIGN;
pascal@18757 415 + }
pascal@18757 416 + i2 = 1;
pascal@18757 417 + mi2 = 1;
pascal@18757 418 + while (num_bits2--) {
pascal@18757 419 + if (rc_get_bit(rc, prob3 + mi2, &mi2))
pascal@18757 420 + rep0 |= i2;
pascal@18757 421 + i2 <<= 1;
pascal@18757 422 + }
pascal@18757 423 + }
pascal@18757 424 + if (++rep0 == 0)
pascal@18757 425 + break;
pascal@18757 426 + }
pascal@18757 427 +
pascal@18757 428 + len += LZMA_MATCH_MIN_LEN;
pascal@18757 429 + string:
pascal@18757 430 + do {
pascal@18757 431 + uint32_t pos = buffer_pos - rep0;
pascal@18757 432 + while (pos >= header.dict_size)
pascal@18757 433 + pos += header.dict_size;
pascal@18757 434 + previous_byte = buffer[pos];
pascal@18757 435 + one_byte2:
pascal@18757 436 + buffer[buffer_pos++] = previous_byte;
pascal@18757 437 + len--;
pascal@18757 438 + } while (len != 0 && buffer_pos < header.dst_size);
pascal@18757 439 + }
pascal@18757 440 + }
pascal@18757 441 +}
pascal@18757 442 --- /dev/null
pascal@18757 443 +++ core/unlz4.c
pascal@18759 444 @@ -0,0 +1,114 @@
pascal@18757 445 +/*
pascal@18757 446 + * Copyright (C) 2015, pascal.bellard@slitaz.org
pascal@18757 447 + *
pascal@18757 448 + * This program is free software; you can redistribute it and/or modify
pascal@18757 449 + * it under the terms of the GNU General Public License version 2 as
pascal@18757 450 + * published by the Free Software Foundation.
pascal@18757 451 + */
pascal@18757 452 +
pascal@18759 453 +#include <string.h>
pascal@18759 454 +
pascal@18757 455 +#define LZ4_MAGIC 0x184D2204 /* Spec 1.5.0 */
pascal@18757 456 +#define LZ4_LEGACY 0x184C2102
pascal@18757 457 +#define LZ4_SKIP(n) ((((n) - 0x184D2A50) >> 4) == 0)
pascal@18757 458 +
pascal@18757 459 +static unsigned lz4cnt(unsigned char **p, unsigned n)
pascal@18757 460 +{
pascal@18757 461 + int i;
pascal@18757 462 +
pascal@18757 463 + if (n == 0xF) do {
pascal@18757 464 + i = *(*p)++;
pascal@18757 465 + n += i;
pascal@18757 466 + } while (i == 0xFF);
pascal@18757 467 + return n;
pascal@18757 468 +}
pascal@18757 469 +
pascal@18759 470 +unsigned char *unlz4(unsigned char *from, unsigned char *end)
pascal@18757 471 +{
pascal@18757 472 + unsigned char *p, *end_chunk, *to, flags, mask;
pascal@18757 473 + long magic;
pascal@18757 474 + unsigned i, n, size;
pascal@18757 475 +
pascal@18757 476 + for (p = from, flags = size = 0; p < end;) {
pascal@18757 477 + while (1) {
pascal@18757 478 + magic = * (long *) p;
pascal@18757 479 + p += sizeof(long);
pascal@18757 480 + if (magic == LZ4_LEGACY) continue;
pascal@18757 481 + if (magic != LZ4_MAGIC) break;
pascal@18757 482 + flags = *p;
pascal@18757 483 + if (flags & 8) {
pascal@18757 484 + size = * (unsigned *) (p + 2);
pascal@18757 485 + goto sizefound;
pascal@18757 486 + }
pascal@18757 487 + p += 3; /* skip FLG BD HC */
pascal@18757 488 + }
pascal@18757 489 + if (LZ4_SKIP(magic)) {
pascal@18757 490 + p += 4 + * (long *) p;
pascal@18757 491 + continue;
pascal@18757 492 + }
pascal@18757 493 + mask = 4; /* Content checksum */
pascal@18757 494 + if (magic) {
pascal@18757 495 + if (magic > 0)
pascal@18757 496 + for (end_chunk = p + magic; p < end_chunk;) {
pascal@18757 497 + unsigned char token = *p++;
pascal@18757 498 +
pascal@18757 499 + n = lz4cnt(&p, token >> 4);
pascal@18757 500 + size += n;
pascal@18757 501 + p += n;
pascal@18757 502 + if (p >= end_chunk) break;
pascal@18757 503 + p += sizeof(unsigned short);
pascal@18757 504 + size += 4 + lz4cnt(&p, token & 0xF);
pascal@18757 505 + }
pascal@18757 506 + else {
pascal@18757 507 + magic &= 0x7FffFFff;
pascal@18757 508 + p += magic;
pascal@18757 509 + size += magic;
pascal@18757 510 + }
pascal@18757 511 + mask = 0x10; /* Block checksum */
pascal@18757 512 + }
pascal@18757 513 + if (flags & mask) p += 4; /* skip block checksum */
pascal@18757 514 + }
pascal@18757 515 +sizefound:
pascal@18757 516 + size += 16 - (p - from);
pascal@18757 517 + memmove(from + size, from, p - from);
pascal@18757 518 + for (to = from, p = from += size, end += size, flags = 0; p < end;) {
pascal@18757 519 + while (1) {
pascal@18757 520 + magic = * (long *) p;
pascal@18757 521 + p += sizeof(long);
pascal@18757 522 + if (magic == LZ4_LEGACY) continue;
pascal@18757 523 + if (magic != LZ4_MAGIC) break;
pascal@18757 524 + flags = *p;
pascal@18757 525 + if (flags & 8) p += 8; /* skip size */
pascal@18757 526 + p += 3; /* skip FLG BD HC */
pascal@18757 527 + }
pascal@18757 528 + if (LZ4_SKIP(magic)) {
pascal@18757 529 + p += 4 + * (long *) p;
pascal@18757 530 + continue;
pascal@18757 531 + }
pascal@18757 532 + mask = 4; /* Content checksum */
pascal@18757 533 + if (magic) {
pascal@18757 534 + if (magic > 0)
pascal@18757 535 + for (end_chunk = p + magic; p < end_chunk;) {
pascal@18758 536 + unsigned char *dico;
pascal@18757 537 + unsigned char token = *p++;
pascal@18757 538 +
pascal@18757 539 + n = lz4cnt(&p, token >> 4);
pascal@18757 540 + for (i = 0; i < n; i++)
pascal@18757 541 + *to++ = *p++;
pascal@18757 542 + if (p >= end_chunk) break;
pascal@18757 543 + dico = to - (* (unsigned short *) p);
pascal@18757 544 + p += sizeof(unsigned short);
pascal@18757 545 + n = 4 + lz4cnt(&p, token & 0xF);
pascal@18757 546 + for (i = 0; i < n; i++)
pascal@18757 547 + *to++ = *dico++;
pascal@18757 548 + }
pascal@18757 549 + else for (end_chunk = p + (magic & 0x7FffFFff);
pascal@18757 550 + p < end_chunk;) {
pascal@18757 551 + *to++ = *p++;
pascal@18757 552 + }
pascal@18757 553 + mask = 0x10; /* Block checksum */
pascal@18757 554 + }
pascal@18757 555 + if (flags & mask) p += 4; /* Skip checksum */
pascal@18757 556 + }
pascal@18757 557 + return to;
pascal@18757 558 +}