wok annotate memtest/stuff/unlzma.S @ rev 24046

memtest,plop: tune lzma compression (again)
author Pascal Bellard <pascal.bellard@slitaz.org>
date Fri May 07 14:52:36 2021 +0000 (2021-05-07)
parents 1421f93cc28a
children 4e5765b0f66e
rev   line source
pascal@13287 1 // #define RC_NORMALIZE if (Range < kTopValue) { Range <<= 8; Code = (Code << 8) | RC_READ_BYTE; }
pascal@13287 2 //
pascal@13287 3 // #define IfBit0(p) RC_NORMALIZE; bound = (Range >> kNumBitModelTotalBits) * *(p); if (Code < bound)
pascal@13287 4 // #define UpdateBit0(p) Range = bound; *(p) += (kBitModelTotal - *(p)) >> kNumMoveBits;
pascal@13287 5 // #define UpdateBit1(p) Range -= bound; Code -= bound; *(p) -= (*(p)) >> kNumMoveBits;
pascal@13287 6 //
pascal@13287 7 //#define RC_GET_BIT2(p, mi, A0, A1) IfBit0(p) \
pascal@13287 8 // { UpdateBit0(p); mi <<= 1; A0; } else \
pascal@13287 9 // { UpdateBit1(p); mi = (mi + mi) + 1; A1; }
pascal@13287 10 //
pascal@13287 11 // #define RC_GET_BIT(p, mi) RC_GET_BIT2(p, mi, ; , ;)
pascal@13287 12 //
pascal@13287 13 // #define RangeDecoderBitTreeDecode(probs, numLevels, res) \
pascal@13287 14 // { int i = numLevels; res = 1; \
pascal@13287 15 // do { CProb *p = probs + res; RC_GET_BIT(p, res) } while(--i != 0); \
pascal@13287 16 // res -= (1 << numLevels); }
pascal@13287 17 /*
pascal@13287 18 * Compression with : lzma e src dst -eos -pb2 -lp0 -lc3
pascal@13287 19 */
pascal@13287 20
pascal@13287 21 #define PROP_PB 2
pascal@13287 22 #define PROP_LP 0
pascal@13287 23 #define PROP_LC 3
pascal@13287 24 #define PROPS (PROP_LC+(PROP_LP*9)+(PROP_PB*45))
pascal@13287 25
pascal@13287 26 // static const Byte *Buffer;
pascal@13287 27 // static UInt32 bound, Code, Range;
pascal@13287 28
pascal@13287 29 /*
pascal@13287 30 * Buffer register DS:SI
pascal@13287 31 * all var based ws=ss:bp
pascal@13287 32 */
pascal@13287 33
pascal@13287 34 rep0 = -4 // long
pascal@13287 35 rep1 = rep0-4 // long
pascal@13287 36 rep2 = rep0-8 // long
pascal@13287 37 rep3 = rep0-12 // long
pascal@13287 38 state = -17 // byte, 0..11
pascal@13287 39 posState = state-1 // byte, 0..15
pascal@13287 40 posState2 = posState-1 // byte, 0..15
pascal@13287 41 scratched = rep0-16 // byte = 1
pascal@13287 42 Code = -24 // long
pascal@13287 43 outStream = -28 // long
pascal@13287 44 nowPos = outStream // long
pascal@13287 45 Range = Code-8 // long
pascal@13287 46 #define LOCALS 32
pascal@13287 47
pascal@13287 48 // int LzmaDecode(CLzmaDecoderState *vs,
pascal@13287 49 // const unsigned char *inStream,
pascal@13287 50 // unsigned char *outStream)
pascal@13287 51 // {
pascal@13287 52 // CProb *p = vs->Probs;
pascal@13287 53 // SizeT nowPos = 0;
pascal@13287 54 // #define posStateMask = (1 << (vs->Properties.pb)) - 1;
pascal@13287 55 // #define literalPosMask = (1 << (vs->Properties.lp)) - 1;
pascal@13287 56 // int lc = vs->Properties.lc, state = 0, len = 0;
pascal@13287 57 // UInt32 rep0 = 1, rep1 = 1, rep2 = 1, rep3 = 1;
pascal@13287 58 //
pascal@13287 59 // {
pascal@13287 60 // UInt32 i, numProbs = Literal /*1846*/
pascal@13287 61 // + ((UInt32)LZMA_LIT_SIZE /*768*/ << (lc + vs->Properties.lp));
pascal@13287 62 // for (i = 0; i < numProbs; i++) p[i] = kBitModelTotal /*2048*/ >> 1;
pascal@13287 63
pascal@13287 64 #define WS (1846+(768<<(PROP_LC+PROP_LP)))
pascal@13287 65 #if (WS+WS+LOCALS) >= 65000
pascal@13287 66 /* MAX WS = (1846+(768<<(8+4))) > 3MB! */
pascal@13287 67 #error invalid (lc,lp,pb) : out of memory
pascal@13287 68 #endif
pascal@13287 69
pascal@13287 70 ws1 = WS
pascal@13287 71 ws2 = ws1*2
pascal@13287 72 ws = ws2+LOCALS+15
pascal@13287 73
pascal@13287 74 #ifndef FLAT32
pascal@13287 75 #define AX %ax
pascal@13287 76 #define BX %bx
pascal@13287 77 #define CX %cx
pascal@13287 78 #define DX %dx
pascal@13287 79 #define SI %si
pascal@13287 80 #define DI %di
pascal@13287 81 #define BP %bp
pascal@13287 82 #define SP %sp
pascal@13287 83 #define CWD cwd
pascal@13287 84 #else
pascal@13287 85 #define AX %eax
pascal@13287 86 #define BX %ebx
pascal@13287 87 #define CX %ecx
pascal@13287 88 #define DX %edx
pascal@13287 89 #define SI %esi
pascal@13287 90 #define DI %edi
pascal@13287 91 #define BP %ebp
pascal@13287 92 #define SP %esp
pascal@13287 93 #define CWD cdq
pascal@13287 94 #endif
pascal@13287 95 /*
pascal@13287 96 * LzmaDecode:
pascal@13287 97 #ifndef FLAT32
pascal@13287 98 * input ds:si=inStream, es:di=outStream
pascal@13287 99 * output outStream[], ds:si, es:di
pascal@13287 100 .code 16
pascal@13287 101 #else
pascal@13287 102 * input esi=inStream, edi=outStream
pascal@13287 103 * output outStream[], esi, edi
pascal@13287 104 .code 32
pascal@13287 105 #endif
pascal@13287 106 */
pascal@13287 107
pascal@13287 108 mov $ws1, CX
pascal@20184 109 #ifdef ONLY8086
pascal@20184 110 movw $2048/2, %ax
pascal@20184 111 lzd1:
pascal@20184 112 pushw %ax
pascal@20184 113 #else
pascal@13287 114 lzd1:
pascal@13287 115 pushw $2048/2
pascal@20184 116 #endif
pascal@13287 117 loop lzd1
pascal@13287 118 mov SP, BP
pascal@13287 119 movb $((LOCALS+3)/4)*2, %cl
pascal@20184 120 #ifdef ONLY8086
pascal@20184 121 movw $1, %ax
pascal@20184 122 cwd
pascal@20184 123 initlocals:
pascal@20184 124 pushw %dx
pascal@20184 125 pushw %ax
pascal@20184 126 #else
pascal@13287 127 initlocals:
pascal@13287 128 pushl $1
pascal@20184 129 #endif
pascal@13287 130 loop initlocals
pascal@13287 131
pascal@19391 132 #if !defined(FLAT32) && !defined(FLAT16OUT)
pascal@13287 133 movb $4, %cl
pascal@13287 134 movw %es, %bx
pascal@13287 135 shrw %cl, %bx
pascal@13287 136 movw %es, %dx
pascal@13287 137 shlw %cl, %dx
pascal@13287 138 addw %dx, %di
pascal@13287 139 movw %di, outStream(%bp)
pascal@13287 140 adcb %bh, outStream+2(%bp)
pascal@13287 141 incw %cx
pascal@13287 142 #else
pascal@13287 143 movb $5, %cl
pascal@19391 144 mov DI, outStream(BP)
pascal@13287 145 #endif
pascal@13287 146
pascal@13287 147 // Byte previousByte = 0;
pascal@13287 148 xor BX, BX
pascal@13287 149
pascal@13287 150 // #define RC_INIT(buffer)
pascal@13287 151 // Buffer = buffer; Code = 0; Range = 0xFFFFFFFF;
pascal@13287 152 // { int i; for(i=0; i<5; i++) { Code = (Code<<8) | RC_READ_BYTE; }}
pascal@13287 153 // }
pascal@13287 154 // RC_INIT(inStream);
pascal@13287 155
pascal@17410 156 #ifndef NO_LZMA_HEADER
pascal@17410 157 #ifdef CHECK_LZMA_HEADER
pascal@17410 158 cmp.w $0x5A4C, (SI) // lzip header ('LZIP' version:1 dicobits:1)
pascal@17410 159 je lzip_header
pascal@17412 160 cmp.w $0x5D, (SI) // lzma header (0x5D dicosz:4 orgsz:8)
pascal@17410 161 jne no_header
pascal@17410 162 add $13-6, SI // skip lzma header
pascal@17410 163 lzip_header:
pascal@17410 164 add $6, SI // skip lzip header
pascal@17410 165 no_header:
pascal@17410 166 #else
pascal@17410 167 add $13, SI // skip lzma header (0x5D dicosz:4 orgsz:8)
pascal@17410 168 #endif
pascal@17410 169 #endif
pascal@13287 170 setrep:
pascal@13287 171 call RC_LOAD_BYTE
pascal@13287 172 decb Range(BP)
pascal@13287 173 loop setrep
pascal@13287 174
pascal@13287 175 lzdmainlp:
pascal@13287 176 // while(1) {
pascal@13287 177 // CProb *prob;
pascal@13287 178 // int posState = (int)((nowPos) & posStateMask);
pascal@13287 179 //
pascal@13287 180 // prob = p + IsMatch /*0*/ + (state << kNumPosBitsMax /*4*/) + posState;
pascal@13287 181 // if (Bit0(prob)) { /* char */
pascal@13287 182
pascal@13287 183 xor DX, DX
pascal@13287 184 call Bit1state // Bit1(dx + (state << kNumPosBitsMax /*4*/) + posState)
pascal@13287 185 mov $state, DI
pascal@13287 186 jc lzdstring
pascal@13287 187
pascal@13287 188 // prob = p + Literal /*1846*/ + (LZMA_LIT_SIZE /*768*/ *
pascal@13287 189 // ((((nowPos) & literalPosMask) << lc) + (previousByte >> (8 - lc))));
pascal@13287 190
pascal@13287 191 #if PROP_LC != 0
pascal@20184 192 # ifdef ONLY8086
pascal@20184 193 movb $8-PROP_LC, %cl
pascal@20184 194 shrb %cl, %bl
pascal@20184 195 # else
pascal@13287 196 shrb $8-PROP_LC, %bl
pascal@20184 197 # endif
pascal@24046 198 #else
pascal@24046 199 xor %bx,%bx
pascal@13287 200 #endif
pascal@13287 201
pascal@13287 202 #if PROP_LP != 0
pascal@13287 203 movb posState2(BP), %dl
pascal@24046 204 # if PROP_LC != 0
pascal@24046 205 # ifdef ONLY8086
pascal@20184 206 movb $PROP_LC, %cl
pascal@20184 207 shl %cl, DX
pascal@24046 208 # else
pascal@13287 209 shl $PROP_LC, DX
pascal@24046 210 # endif
pascal@24046 211 movb $0, %bh
pascal@20184 212 # endif
pascal@13287 213 add BX, DX
pascal@13287 214 #endif
pascal@13287 215
pascal@13287 216 movb $3, %ah
pascal@13287 217 mul BX // dx = 3*bh
pascal@13287 218 add $1846, AX
pascal@13287 219
pascal@13287 220 // int symbol = 1;
pascal@13287 221
pascal@13287 222 CWD
pascal@13287 223 inc DX // symbol = 1
pascal@13287 224 xchg AX, CX // save prob
pascal@13287 225
pascal@13287 226 // if (state >= kNumLitStates /*7*/) { /* previous was string */
pascal@13287 227 // if (state < 4) state = 0;
pascal@13287 228
pascal@13287 229 lzd6z:
pascal@13287 230 subb $3, (BP, DI)
pascal@13287 231
pascal@13287 232 // if (state < 4) state = 0;
pascal@13287 233
pascal@13287 234 jnc lzd6
pascal@13287 235 movb %dh, (BP, DI) // %dh = 0
pascal@13287 236
pascal@13287 237 lzd6:
pascal@13287 238 // else if (state < 10) state -= 3;
pascal@13287 239
pascal@13287 240 cmpb $10-3, (BP, DI)
pascal@13287 241
pascal@13287 242 // else state -= 6;
pascal@13287 243
pascal@13287 244 jnb lzd6z
pascal@13287 245 cmpb $7-3-1, (BP, DI)
pascal@13287 246 jbe lzd3
pascal@13287 247
pascal@13287 248 // int matchByte = outStream[nowPos - rep0];
pascal@13287 249
pascal@13287 250 call DicoRep02ESDI // %bl = outStream[nowPos - rep0];
pascal@13287 251
pascal@13287 252 // do {
pascal@13287 253 // int bit;
pascal@13287 254 // CProb *probLit;
pascal@13287 255 // matchByte <<= 1; bit = (matchByte & 0x100);
pascal@13287 256
pascal@13287 257 movb $1, %bh
pascal@13287 258 lzd4:
pascal@13287 259 shlb $1, %bl // matchByte <<= 1
pascal@13287 260 sbb DI, DI // save bit=C
pascal@13287 261
pascal@13287 262 // probLit = prob + 0x100 + bit + symbol;
pascal@13287 263
pascal@13287 264 mov CX, AX // restore prob
pascal@13287 265 adcb %bh, %ah // + bit + 0x100
pascal@13287 266
pascal@13287 267 // RC_GET_BIT2(probLit, symbol, if (bit) break, if (!bit) break)
pascal@13287 268
pascal@13287 269 call Bit1axdx // C,%ax = Bit1(prob+%ax)
pascal@13287 270 rclb $1, %dl // symbol <<= 1; symbol |= C
pascal@13287 271 jc lzd5 // if symbol >= 0x100
pascal@13287 272 cmp DI, AX
pascal@13287 273 jz lzd4 // if bit == Bit1(prob+%ax)
pascal@13287 274
pascal@13287 275 // } while (symbol < 0x100);
pascal@13287 276 // }
pascal@13287 277 lzd3:
pascal@13287 278 // while (symbol < 0x100) {
pascal@13287 279 // CProb *probLit = prob + symbol;
pascal@13287 280 // RC_GET_BIT(probLit, symbol)
pascal@13287 281 // }
pascal@13287 282
pascal@13287 283 xor BX, BX
pascal@13287 284 jmp lzd4
pascal@13287 285 lzd5:
pascal@13287 286
pascal@13287 287 // outStream[nowPos++] = previousByte = (Byte)symbol;
pascal@13287 288
pascal@13287 289 xchg AX, DX
pascal@13287 290 call outchar // %bl = outStream[nowPos++] = %al;
pascal@13287 291 jmp lzdmainlp
pascal@13287 292
pascal@13287 293 // }
pascal@13287 294
pascal@13287 295 lzdstring:
pascal@13287 296 mov $1, CX
pascal@13287 297
pascal@13287 298 // else { /* string */
pascal@13287 299 // prob = p + IsRep /*192*/ + state;
pascal@13287 300
pascal@13287 301 movb $192, %dl
pascal@13287 302 addb (BP, DI), %dl
pascal@13287 303 mov $rep0, DI
pascal@13287 304
pascal@13287 305 // if (Bit0(prob)) {
pascal@13287 306
pascal@13287 307 call Bit1dx // Bit1(prob)
pascal@13287 308 jc lzd8
pascal@13287 309
pascal@13287 310 // rep3 = rep2; rep2 = rep1; rep1 = rep0;
pascal@13287 311 // state = (state < kNumLitStates /*7*/) ? 0 : 3;
pascal@13287 312
pascal@13287 313 stc
pascal@13287 314
pascal@13287 315 // prob = p + LenCoder /*818*/;
pascal@13287 316
pascal@13287 317 mov $818, DX
pascal@13287 318
pascal@13287 319 // }
pascal@13287 320
pascal@13287 321 jmp lzd11a
pascal@13287 322
pascal@13287 323 // else {
pascal@13287 324 lzd8:
pascal@13287 325 // prob += kNumStates /*12*/;
pascal@13287 326 // if (Bit0(prob)) {
pascal@13287 327 call Bit1dx12 // prob += 12; Bit1(prob)
pascal@13287 328 jc lzd11
pascal@13287 329 // prob = p + IsRep0Long /*240*/ + (state << kNumPosBitsMax /*4*/)
pascal@13287 330 // + posState;
pascal@13287 331 movb $240, %dl // dh=0
pascal@13287 332
pascal@13287 333 // if (Bit0(prob)) {
pascal@13287 334
pascal@13287 335 call Bit1state // Bit1(dx + (state << kNumPosBitsMax /*4*/) + posState)
pascal@13287 336 jc lzd12
pascal@13287 337
pascal@13287 338 // // if (nowPos == 0) return LZMA_RESULT_DATA_ERROR;
pascal@13287 339 // state = (state < kNumLitStates /*7*/) ? 9 : 11;
pascal@13287 340
pascal@13287 341 movb $9, %dl
pascal@13287 342
pascal@13287 343 // len++; goto string;
pascal@13287 344 jmp lzd13string // ax = 0
pascal@13287 345 // }
pascal@13287 346 // }
pascal@13287 347 // else {
pascal@13287 348 lzd11:
pascal@13287 349 // UInt32 distance = rep1;
pascal@13287 350 // prob += kNumStates /*12*/;
pascal@13287 351 // if (!Bit0(prob)) {
pascal@13287 352
pascal@13287 353 call Bit1dx12 // prob += 12; Bit1(prob)
pascal@13287 354 jnc lzd11z
pascal@13287 355
pascal@13287 356 // prob += kNumStates /*12*/;
pascal@13287 357 // if (Bit0(prob)) distance = rep2;
pascal@13287 358
pascal@13287 359 call Bit1dx12 // prob += 12; Bit1(prob)
pascal@13287 360 lzd11a:
pascal@13287 361 adcb %cl, %cl
pascal@13287 362
pascal@13287 363 // else { distance = rep3; rep3 = rep2; }
pascal@13287 364 // rep2 = rep1;
pascal@13287 365 // }
pascal@13287 366 // rep1 = rep0; rep0 = distance;
pascal@13287 367
pascal@13287 368 lzd11z:
pascal@20184 369 # ifdef ONLY8086
pascal@20184 370 shl $1, CX
pascal@20184 371 shl $1, CX // 8->32 bits
pascal@20184 372 sub CX, DI // &rep[cx]
pascal@20184 373 movw (BP, DI), %ax
pascal@20184 374 pushw 2(BP, DI)
pascal@20184 375 rotreplp:
pascal@20184 376 movb 4(BP, DI), %bl
pascal@20184 377 movb %bl, (BP, DI)
pascal@20184 378 inc DI
pascal@20184 379 loop rotreplp
pascal@20184 380 popw %bx
pascal@20184 381 testb %dh, %dh
pascal@20184 382 jnz lzd10
pascal@20184 383 movw %ax, (BP, DI)
pascal@20184 384 movw %bx, 2(BP, DI)
pascal@20184 385 # else
pascal@13287 386 shl $2, CX // 8->32 bits
pascal@13287 387 sub CX, DI // &rep[cx]
pascal@13287 388 movl (BP, DI), %eax
pascal@13287 389 rotreplp:
pascal@13287 390 movb 4(BP, DI), %bl
pascal@13287 391 movb %bl, (BP, DI)
pascal@13287 392 inc DI
pascal@13287 393 loop rotreplp
pascal@13287 394 testb %dh, %dh
pascal@13287 395 jnz lzd10
pascal@13287 396 movl %eax, (BP, DI)
pascal@20184 397 # endif
pascal@13287 398
pascal@13287 399 // }
pascal@13287 400 lzd12:
pascal@13287 401 // state = (state < kNumLitStates /*7*/) ? 8 : 11;
pascal@13287 402
pascal@13287 403 movb $0x08, %cl
pascal@13287 404
pascal@13287 405 // prob = p + RepLenCoder /*1332*/;
pascal@13287 406
pascal@13287 407 mov $1332, DX
pascal@13287 408
pascal@13287 409 // }
pascal@13287 410 lzd10:
pascal@13287 411 push CX // CX = 0
pascal@13287 412
pascal@13287 413 // { /* get len */
pascal@13287 414 // int numBits, offset;
pascal@13287 415 // CProb *probLen = prob + LenChoice /*0*/;
pascal@13287 416 // numBits = kLenNumLowBits /*3*/;
pascal@13287 417
pascal@13287 418 movb $8, %cl // numBits : 3,3,8
pascal@13287 419
pascal@13287 420 // if (Bit0(probLen)) {
pascal@13287 421
pascal@13287 422 call Bit1dx // Bit1(prob)
pascal@13287 423 xchg AX, BX
pascal@13287 424 inc DX
pascal@13287 425 jnc lzd15 // bx=0
pascal@13287 426
pascal@13287 427 // probLen = prob + LenLow/*2*/ + (posState << kLenNumLowBits/*3*/);
pascal@13287 428 // offset = 0;
pascal@13287 429 // }
pascal@13287 430 // else {
pascal@13287 431 // probLen = prob + LenChoice2 /*1*/;
pascal@13287 432
pascal@13287 433 call Bit1dx // Bit1(prob)
pascal@13287 434 add AX, BX
pascal@13287 435
pascal@13287 436 #if PROP_PB != 0
pascal@13287 437 inc AX // ah=0
pascal@13287 438 #endif
pascal@13287 439 jc lzd16 // %ax=0, %bx=-2
pascal@13287 440 lzd15:
pascal@13287 441 #if PROP_PB != 0
pascal@13287 442 movb $8, %al
pascal@13287 443 mulb posState(BP)
pascal@13287 444 #endif
pascal@13287 445
pascal@13287 446 // if (Bit0(probLen)) {
pascal@13287 447 // probLen = prob + LenMid/*130*/ + (posState << kLenNumMidBits/*3*/);
pascal@13287 448
pascal@13287 449 movb $3, %cl // numBits : 3,3,8
pascal@13287 450 lzd16:
pascal@13287 451 #if PROP_PB != 0
pascal@13287 452 add $2-128-1, AX // probLen : 2,130,258
pascal@13287 453 #else
pascal@13287 454 mov $2-128-1, AX // probLen : 2,130,258
pascal@13287 455 #endif
pascal@13287 456 add DX, AX
pascal@13287 457 mov $-8+1, DX // offset : 0,8,16
pascal@13287 458 lzdargslp:
pascal@13287 459 add $8, DX
pascal@13287 460 add $128, AX
pascal@13287 461 inc BX
pascal@13287 462 jle lzdargslp // leave with bx=1
pascal@13287 463
pascal@13287 464 // offset = kLenNumLowSymbols /*8*/;
pascal@13287 465 // //numBits = kLenNumMidBits /*3*/;
pascal@13287 466 // }
pascal@13287 467 // else {
pascal@13287 468 // probLen = prob + LenHigh /*258*/;
pascal@13287 469 // offset = kLenNumLowSymbols /*8*/ + kLenNumMidSymbols /*8*/;
pascal@13287 470 // numBits = kLenNumHighBits /*8*/;
pascal@13287 471 // }
pascal@13287 472 // }
pascal@13287 473 // RangeDecoderBitTreeDecode(probLen, numBits, len); len += offset;
pascal@13287 474
pascal@13287 475 push DX
pascal@13287 476 call RangeDecoder // %ax=probs, %cx=numLevels, %ax=res
pascal@13287 477 pop DX
pascal@13287 478 add DX, AX // offset
pascal@13287 479 pop DX // 0
pascal@13287 480 lzd13string:
pascal@13287 481 push AX
pascal@13287 482
pascal@13287 483 // state = (state < kNumLitStates /*7*/) ? dl : dl|3;
pascal@13287 484
pascal@13287 485 movb $7, %cl
pascal@13287 486 cmpb %cl, state(BP)
pascal@13287 487 jb new_state
pascal@13287 488 orb $3, %dl
pascal@13287 489 new_state:
pascal@13287 490 movb %dl, state(BP)
pascal@13287 491
pascal@13287 492 // } /* get len */
pascal@13287 493 // if (state < 4) {
pascal@13287 494
pascal@13287 495 cmpb $4-1, %dl
pascal@13287 496 ja lzd19
pascal@13287 497
pascal@13287 498 // int posSlot;
pascal@13287 499 // state += kNumLitStates /*7*/;
pascal@13287 500
pascal@13287 501 addb %cl, state(BP)
pascal@13287 502
pascal@13287 503 // prob = p + PosSlot /*432*/ + (((len < kNumLenToPosStates /*4*/) ?
pascal@13287 504 // len : kNumLenToPosStates - 1) << kNumPosSlotBits /*6*/);
pascal@13287 505
pascal@13287 506 cmp $4+1, AX
pascal@13287 507 jb lzd21
pascal@13287 508 mov $3+1, AX
pascal@13287 509
pascal@13287 510 lzd21:
pascal@13287 511
pascal@13287 512 dec CX // cx = 6
pascal@13287 513 shl %cl, AX
pascal@13287 514 add $432-64, AX
pascal@13287 515
pascal@13287 516 // RangeDecoderBitTreeDecode(prob, kNumPosSlotBits /*6*/, posSlot);
pascal@13287 517
pascal@13287 518 call RangeDecoder // %ax=probs, %cx=numLevels, %ax=res
pascal@13287 519
pascal@13287 520 // if (posSlot >= kStartPosModelIndex /*4*/) {
pascal@13287 521 // int numDirectBits = ((posSlot >> 1) - 1);
pascal@13287 522
pascal@13287 523 #ifndef FLAT32
pascal@13287 524 movw %cx, 2(%bp, %di) // %cx = 0
pascal@13287 525 #endif
pascal@13287 526 mov AX, (BP, DI)
pascal@13287 527 mov AX, CX
pascal@13287 528 shrw $1, CX
pascal@13287 529 dec CX
pascal@13287 530 cmpb $4, %al
pascal@13287 531 jb lzd22
pascal@13287 532
pascal@13287 533 // rep0 = (2 | ((UInt32)posSlot & 1));
pascal@13287 534
pascal@13287 535 andb %bl, (BP, DI) // %bx=1
pascal@13287 536 orb $2, (BP, DI)
pascal@13287 537
pascal@13287 538 // if (posSlot < kEndPosModelIndex /*14*/) {
pascal@13287 539
pascal@13287 540 cmpb $14, %al
pascal@13287 541 jnb lzd23
pascal@13287 542
pascal@13287 543 // rep0 <<= numDirectBits;
pascal@13287 544
pascal@13287 545 neg AX
pascal@20184 546 # ifdef ONLY8086
pascal@20184 547 pushw %cx
pascal@20184 548 movb $0, %ch
pascal@20184 549 shllrep0:
pascal@20184 550 shlw $1, (BP, DI)
pascal@20184 551 rclw $1, 2(BP, DI)
pascal@20184 552 loop shllrep0
pascal@20184 553 popw %cx
pascal@20184 554 # else
pascal@13287 555 shll %cl, (BP, DI)
pascal@20184 556 # endif
pascal@13287 557 add (BP, DI), AX
pascal@13287 558
pascal@13287 559 // prob = p + SpecPos /*688*/ + rep0 - posSlot - 1;
pascal@13287 560
pascal@13287 561 add $687, AX
pascal@13287 562 jmp lzd24
pascal@13287 563
pascal@13287 564 // }
pascal@13287 565 // else {
pascal@13287 566 lzd23:
pascal@13287 567 // numDirectBits -= kNumAlignBits /*4*/;
pascal@13287 568 // do {
pascal@13287 569 // RC_NORMALIZE; Range >>= 1; rep0 <<= 1;
pascal@13287 570 // if (Code >= Range) { Code -= Range; rep0 |= 1; }
pascal@13287 571
pascal@13287 572 lzd23z:
pascal@13287 573 call RC_NORMALIZE
pascal@20184 574 # ifdef ONLY8086
pascal@20184 575 pushw %dx
pascal@20184 576 shrw $1, Range+2(BP)
pascal@20184 577 rcrw $1, Range(BP)
pascal@20184 578 movw Range(BP), %ax
pascal@20184 579 movw Range+2(BP), %dx
pascal@20184 580 cmpw Code+2(BP), %dx
pascal@20184 581 ja lzd25
pascal@20184 582 jb lzd25x
pascal@20184 583 cmpw Code(BP), %ax
pascal@20184 584 ja lzd25
pascal@20184 585 lzd25x:
pascal@20184 586 subw %ax, Code(BP)
pascal@20184 587 sbbw %dx, Code+2(BP)
pascal@20184 588 stc
pascal@20184 589 lzd25:
pascal@20184 590 popw %dx
pascal@20184 591 rclw $1, (BP, DI)
pascal@20184 592 rclw $1, 2(BP, DI)
pascal@20184 593 # else
pascal@13287 594 shrl $1, Range(BP)
pascal@13287 595 movl Range(BP), %eax
pascal@13287 596 cmpl Code(BP), %eax
pascal@13287 597 ja lzd25
pascal@13287 598 subl %eax, Code(BP)
pascal@13287 599 stc
pascal@13287 600 lzd25:
pascal@13287 601 rcll $1, (BP, DI)
pascal@20184 602 # endif
pascal@13287 603
pascal@13287 604 // } while (--numDirectBits != 0);
pascal@13287 605
pascal@13289 606 cmpb $4+1, %cl
pascal@13287 607 loopne lzd23z
pascal@13287 608
pascal@13287 609 // prob = p + Align /* 802 */; numDirectBits = kNumAlignBits /*4*/;
pascal@13287 610 // rep0 <<= numDirectBits;
pascal@13287 611
pascal@20184 612 # ifdef ONLY8086
pascal@20184 613 pushw %cx
pascal@20184 614 movb $0, %ch
pascal@20184 615 shlrep0:
pascal@20184 616 shlw $1, (BP, DI)
pascal@20184 617 rclw $1, 2(BP, DI)
pascal@20184 618 loop shlrep0
pascal@20184 619 popw %cx
pascal@20184 620 # else
pascal@13287 621 shll %cl, (BP, DI)
pascal@20184 622 # endif
pascal@13287 623 mov $802, AX
pascal@13287 624 // }
pascal@13287 625
pascal@13287 626 lzd24:
pascal@13287 627 call RangeDecoder // %ax=probs, %cx=numLevels, %ax=res
pascal@13287 628
pascal@13287 629 // {
pascal@13287 630 // int i = 1, mi = 1;
pascal@13287 631 // do {
pascal@13287 632 // CProb *prob3 = prob + mi;
pascal@13287 633 // RC_GET_BIT2(prob3, mi, ; , rep0 |= i);
pascal@13287 634
pascal@13287 635 orb %dh, (BP, DI) // update rep0 with DirectBits
pascal@13287 636
pascal@13287 637 // i <<= 1;
pascal@13287 638 // } while(--numDirectBits != 0);
pascal@13287 639 // }
pascal@13287 640 // } else rep0 = posSlot;
pascal@13287 641 lzd22:
pascal@13287 642 // if (++rep0 == (UInt32)(0)) break; /* EOF */
pascal@13287 643
pascal@20184 644 # ifdef ONLY8086
pascal@20184 645 incw (BP, DI)
pascal@20184 646 jnz lzd19
pascal@20184 647 incw 2(BP, DI)
pascal@20184 648 # else
pascal@13287 649 incl (BP, DI)
pascal@20184 650 # endif
pascal@13287 651
pascal@13287 652 lzd19:
pascal@13287 653 pop CX
pascal@13287 654 jz lzdone
pascal@13287 655
pascal@13287 656 // }
pascal@13287 657 // len += kMatchMinLen;/*2*/
pascal@13287 658
pascal@13287 659 inc CX
pascal@13287 660
pascal@13287 661 // string: // if (rep0 > nowPos) return LZMA_RESULT_DATA_ERROR;
pascal@13287 662 // do {
pascal@13287 663 lzd13z:
pascal@13287 664 // previousByte = outStream[nowPos - rep0];
pascal@13287 665 // outStream[nowPos++] = previousByte;
pascal@13287 666
pascal@13287 667 call outcharDico // %bl = outStream[nowPos++] = outStream[nowPos - rep0]
pascal@13287 668
pascal@13287 669 // } while(--len != 0);
pascal@13287 670
pascal@13287 671 loop lzd13z
pascal@13287 672
pascal@13287 673 // } /* char/string */
pascal@13287 674 // }
pascal@13287 675
pascal@13287 676 jmp lzdmainlp
pascal@13287 677
pascal@13287 678 lzdone:
pascal@13287 679 // //RC_NORMALIZE;
pascal@13287 680 // //*inSizeProcessed = (SizeT)(Buffer - inStream); *outSizeProcessed = nowPos;
pascal@13287 681 // return LZMA_RESULT_OK;
pascal@13287 682 call Dico2ESDI // set es & di (rep0 = 0)
pascal@13287 683 lea ws2(BP), SP // dealloc
pascal@13287 684 ret
pascal@13287 685 // }
pascal@13287 686
pascal@13287 687 // al = outStream[nowPos - rep0];
pascal@13287 688
pascal@13287 689 /*
pascal@13287 690 * output es:di, al
pascal@13287 691 * scratch bh, cl, flags
pascal@13287 692 */
pascal@13287 693
pascal@13287 694 DicoRep02ESDI:
pascal@13287 695 stc
pascal@13287 696
pascal@13287 697 // bl = outStream[nowPos];
pascal@13287 698
pascal@13287 699 /*
pascal@13287 700 * output es:di, bl
pascal@13287 701 * scratch bh, cl, flags
pascal@13287 702 */
pascal@13287 703
pascal@13287 704 Dico2ESDI:
pascal@19391 705 #if !defined(FLAT32) && !defined(FLAT16OUT)
pascal@20184 706 # ifdef ONLY8086
pascal@20184 707 pushw %ax
pascal@20184 708 movw nowPos(%bp), %bx
pascal@20184 709 movw nowPos+2(%bp), %ax
pascal@20184 710 jnc Dico2ESDIz
pascal@20184 711 subw rep0(%bp), %bx
pascal@20184 712 sbbw rep0+2(%bp), %ax
pascal@20184 713 Dico2ESDIz:
pascal@20184 714 movw $0xF, %di
pascal@20184 715 andw %bx, %di
pascal@20184 716 pushw %cx
pascal@20184 717 movb $4, %cl
pascal@20184 718 shrw %cl, %bx
pascal@20184 719 shlw %cl, %ax
pascal@20184 720 popw %cx
pascal@20184 721 addb %al, %bh
pascal@20184 722 popw %ax
pascal@20184 723 # else
pascal@13287 724 movl nowPos(%bp), %ebx
pascal@13287 725 jnc Dico2ESDIz
pascal@13287 726 subl rep0(%bp), %ebx
pascal@13287 727 Dico2ESDIz:
pascal@13287 728 movw %bx, %di
pascal@13287 729 xorw %bx, %bx
pascal@13287 730 shrl $4, %ebx
pascal@20184 731 # endif
pascal@13287 732 movw %bx, %es
pascal@19391 733 #else
pascal@19396 734 mov nowPos(BP), DI
pascal@19391 735 jnc Dico2ESDIz
pascal@19396 736 sub rep0(BP), DI
pascal@19391 737 Dico2ESDIz:
pascal@19391 738 #endif
pascal@19391 739 #ifdef FLAT32
pascal@19391 740 movb (DI), %bl
pascal@19391 741 #else
pascal@13287 742 movb %es:(%di), %bl
pascal@13287 743 #endif
pascal@13287 744 ret
pascal@13287 745
pascal@13287 746 outcharDico:
pascal@13287 747
pascal@13287 748 // bl = outStream[nowPos++] = outStream[nowPos - rep0]
pascal@13287 749
pascal@13287 750 /*
pascal@13287 751 * output es:di, bl
pascal@13287 752 * update nowPos
pascal@13287 753 * scratch ax, dx, bh, cl, flags
pascal@13287 754 */
pascal@13287 755
pascal@13287 756 call DicoRep02ESDI // %bl = outStream[nowPos - rep0]
pascal@13287 757 xchg AX, BX
pascal@13287 758 outchar:
pascal@13287 759
pascal@13287 760 // bl = outStream[nowPos++] = previousByte = al;
pascal@13287 761
pascal@13287 762 /*
pascal@13287 763 * output bl
pascal@13287 764 * update nowPos
pascal@13287 765 * scratch ax, dx, bh, di, cl, flags
pascal@13287 766 */
pascal@13287 767
pascal@13287 768 clc
pascal@13287 769 call Dico2ESDI
pascal@13287 770 stosb
pascal@13287 771 xchg AX, BX // previous byte
pascal@13287 772
pascal@13287 773 // int posState = (int)((nowPos) & posStateMask);
pascal@13287 774
pascal@13287 775 #if PROP_PB != 0 && PROP_LP != 0
pascal@13287 776 addw $0x0101, posState2(BP)
pascal@13287 777 andb $(((1 << PROP_PB) -1)<<8)+((1 << PROP_LP) -1), posState2(BP)
pascal@13287 778 #else
pascal@13287 779 # if PROP_PB != 0
pascal@13287 780 incb posState(BP)
pascal@13287 781 andb $((1 << PROP_PB) -1), posState(BP)
pascal@13287 782 # endif
pascal@13287 783 # if PROP_LP != 0
pascal@13287 784 incb posState2(BP)
pascal@13287 785 andb $((1 << PROP_LP) -1), posState2(BP)
pascal@13287 786 # endif
pascal@13287 787 #endif
pascal@20184 788 #ifdef ONLY8086
pascal@20184 789 incw nowPos(BP)
pascal@20184 790 jnz incnowPosDone
pascal@20184 791 incw nowPos+2(BP)
pascal@20184 792 incnowPosDone:
pascal@20184 793 #else
pascal@13287 794 incl nowPos(BP)
pascal@20184 795 #endif
pascal@13287 796 ret
pascal@13287 797
pascal@13287 798 //
pascal@13287 799 // #define RC_NORMALIZE if (Range < kTopValue)
pascal@13287 800 // { Range <<= 8; Code = (Code << 8) | RC_READ_BYTE; }
pascal@13287 801
pascal@13287 802 /*
pascal@13287 803 * update Range, Code, ds:si
pascal@13287 804 * scratch flags
pascal@13287 805 */
pascal@13287 806
pascal@13287 807 RC_NORMALIZE:
pascal@13287 808 cmpb $0, Range+3(BP)
pascal@13287 809 jne RC_NORMALIZE_1
pascal@13287 810 RC_LOAD_BYTE:
pascal@13287 811 push AX
pascal@20184 812 #ifdef ONLY8086
pascal@20184 813 movw Range+1(BP), %ax
pascal@20184 814 movw %ax, Range+2(BP)
pascal@20184 815 movw Code+1(BP), %ax
pascal@20184 816 movw %ax, Code+2(BP)
pascal@20184 817 xorw %ax, %ax
pascal@20184 818 movb Range(BP), %ah
pascal@20184 819 movw %ax, Range(BP)
pascal@20184 820 movb Code(BP), %ah
pascal@20184 821 movw %ax, Code(BP)
pascal@20184 822 #else
pascal@13287 823 shll $8, Range(BP)
pascal@13287 824 shll $8, Code(BP)
pascal@20184 825 #endif
pascal@19391 826 #if !defined(FLAT16) && !defined(FLAT32)
pascal@13287 827 testw %si, %si
pascal@13287 828 jns RC_READ_BYTE
pascal@13287 829 movw %ds, %ax
pascal@13287 830 incw %ax
pascal@13287 831 movw %ax, %ds
pascal@13287 832 addw $-16, %si
pascal@13287 833 RC_READ_BYTE:
pascal@13287 834 #endif
pascal@13287 835 lodsb
pascal@13287 836 movb %al, Code(BP)
pascal@13287 837 pop AX
pascal@13287 838 RC_NORMALIZE_1:
pascal@13287 839 ret
pascal@13287 840
pascal@13287 841 // Bit1(dx + (state << kNumPosBitsMax /*4*/) + posState)
pascal@13287 842
pascal@13287 843 Bit1state:
pascal@13287 844 movb $16, %al
pascal@13287 845 mulb state(BP)
pascal@13287 846 # if PROP_PB != 0
pascal@13287 847 addb posState(BP), %al
pascal@13287 848 # endif
pascal@13287 849 Bit1axdx:
pascal@13287 850 add DX, AX
pascal@13287 851 jmp Bit1
pascal@13287 852
pascal@13287 853 // prob += 12; Bit1(prob)
pascal@13287 854
pascal@13287 855 Bit1dx12:
pascal@13287 856 add $12, DX
pascal@13287 857 Bit1dx:
pascal@13287 858 mov DX, AX
pascal@13287 859
pascal@13287 860 // static int Bit1(CProb *p)
pascal@13287 861
pascal@13287 862 Bit1:
pascal@13287 863 /*
pascal@13287 864 * input ax=p
pascal@13287 865 * output C, ax
pascal@13287 866 * update bound, Range, Code, ds:si
pascal@13287 867 * scratch flags
pascal@13287 868 */
pascal@13287 869
pascal@13287 870 // {
pascal@13287 871 // RC_NORMALIZE;
pascal@13287 872
pascal@13287 873 call RC_NORMALIZE // kill %ax, update %si
pascal@13287 874
pascal@20184 875 #ifdef ONLY8086
pascal@20184 876 pushw %ax
pascal@20184 877 pushw %cx
pascal@20184 878 pushw %dx
pascal@20184 879 pushw %di
pascal@20184 880 #else
pascal@13289 881 pushal
pascal@20184 882 #endif
pascal@13287 883
pascal@13287 884 xchg AX, DI
pascal@13287 885 add DI, DI // short *
pascal@13287 886
pascal@13287 887
pascal@13287 888 // bound = (Range>>kNumBitModelTotalBits /*11*/) * *(p);
pascal@13287 889
pascal@20184 890 #ifdef ONLY8086
pascal@20184 891 movw Range(BP), %dx
pascal@20184 892 movw Range+2(BP), %ax
pascal@20184 893 movw $11, %cx
pascal@20184 894 shr11lp:
pascal@20184 895 shrw $1, %ax
pascal@20184 896 rcrw $1, %dx
pascal@20184 897 loop shr11lp
pascal@20184 898 movw %dx, %cx
pascal@20184 899 mulw (BP, DI)
pascal@20184 900 xchgw %ax, %cx
pascal@20184 901 mulw (BP, DI)
pascal@20184 902 addw %cx, %dx
pascal@20184 903 #else
pascal@13287 904 movl Range(BP), %eax
pascal@13287 905 shrl $11, %eax
pascal@13287 906 movzwl (BP, DI), %edx
pascal@13287 907 mull %edx
pascal@20184 908 #endif
pascal@13287 909
pascal@13287 910 // if (Code < bound) {
pascal@13287 911
pascal@20184 912 #ifdef ONLY8086
pascal@20184 913 cmpw Code+2(BP), %dx
pascal@20184 914 jb Bit1_1
pascal@20184 915 ja Bit1_1x
pascal@20184 916 cmpw Code(BP), %ax
pascal@20184 917 jbe Bit1_1
pascal@20184 918 Bit1_1x:
pascal@20184 919
pascal@20184 920 // Range = bound;
pascal@20184 921
pascal@20184 922 movw %ax, Range(BP)
pascal@20184 923 movw %dx, Range+2(BP)
pascal@20184 924 #else
pascal@13287 925 cmpl Code(BP), %eax
pascal@13287 926 jbe Bit1_1
pascal@13287 927
pascal@13287 928 // Range = bound;
pascal@13287 929
pascal@13287 930 movl %eax, Range(BP)
pascal@20184 931 #endif
pascal@13287 932
pascal@13287 933 // *(p) += (kBitModelTotal /*2048*/ - *(p)) >> kNumMoveBits /*5*/;
pascal@13287 934
pascal@13287 935 movw $2048, %ax
pascal@13287 936
pascal@13287 937 // return 0;
pascal@13287 938
pascal@13287 939 jmp Bit1_2
pascal@13287 940
pascal@13287 941 // }
pascal@13287 942 // else {
pascal@13287 943
pascal@13287 944 Bit1_1:
pascal@13287 945
pascal@13287 946 // Range -= bound; Code -= bound;
pascal@13287 947
pascal@20184 948 #ifdef ONLY8086
pascal@20184 949 subw %ax, Range(BP)
pascal@20184 950 sbbw %dx, Range+2(BP)
pascal@20184 951 subw %ax, Code(BP)
pascal@20184 952 sbbw %dx, Code+2(BP)
pascal@20184 953 #else
pascal@13287 954 subl %eax, Range(BP)
pascal@13287 955 subl %eax, Code(BP)
pascal@20184 956 #endif
pascal@13287 957
pascal@13287 958 // *(p) -= (*(p)) >> kNumMoveBits /*5*/;
pascal@13287 959
pascal@13287 960 movw $31, %ax
pascal@13287 961
pascal@13287 962 // return 1;
pascal@13287 963
pascal@13287 964 stc
pascal@13287 965 Bit1_2:
pascal@13287 966 pushf
pascal@13287 967 subw (BP, DI), %ax
pascal@20184 968 #ifdef ONLY8086
pascal@20184 969 movb $5, %cl
pascal@20184 970 sarw %cl, %ax
pascal@20184 971 #else
pascal@13287 972 sarw $5, %ax
pascal@20184 973 #endif
pascal@13287 974 addw %ax, (BP, DI)
pascal@13287 975 popf
pascal@20184 976 #ifdef ONLY8086
pascal@20184 977 popw %di
pascal@20184 978 popw %dx
pascal@20184 979 popw %cx
pascal@20184 980 popw %ax
pascal@20184 981 #else
pascal@13289 982 popal
pascal@20184 983 #endif
pascal@13287 984 sbb AX, AX
pascal@13287 985
pascal@13287 986 // }
pascal@13287 987 // }
pascal@13287 988
pascal@13287 989 ret
pascal@13287 990
pascal@13287 991 RangeDecoder:
pascal@13287 992
pascal@13287 993 /*
pascal@13287 994 * input ax=probs cx=numLevels (< 8) bx=1
pascal@13287 995 * output ax=res (backward), dh (forward)
pascal@13287 996 * update bound, Range, Code, ds:si
pascal@13287 997 * scratch flags, cx=0, dl
pascal@13287 998 */
pascal@13287 999
pascal@13287 1000 push BX
pascal@13287 1001
pascal@13287 1002 // { int i = numLevels; res = 1;
pascal@13287 1003 mov BX, DX // res = 1
pascal@13287 1004
pascal@13287 1005 // do { CProb *p = probs + res; RC_GET_BIT(p, res) } while(--i != 0);
pascal@13287 1006
pascal@13287 1007 RangeDecoder_1:
pascal@13287 1008 push AX
pascal@13287 1009 call Bit1axdx // C,%ax = Bit1(prob+%ax)
pascal@13287 1010 rclb $1, %dl // res <<= 1; res |= C
pascal@13287 1011 andb %bl, %al // current bit
pascal@13287 1012 orb %al, %bh // store in bh
pascal@13287 1013 shlb $1, %bl // update max
pascal@13287 1014 pop AX
pascal@13287 1015 loop RangeDecoder_1
pascal@13287 1016
pascal@13287 1017 // res -= (1 << numLevels); }
pascal@13287 1018
pascal@13287 1019 xchg AX, BX // move bh to dh
pascal@13287 1020 xchg AX, DX // and dl to al
pascal@13287 1021 sub %dl, %al // sub max
pascal@13287 1022 pop BX
pascal@13287 1023 ret