blob: f1a7e079d25192e03c603e3b8a4c5fc89f337b66 (
plain)
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
|
/*
* Copyright (c) 2007 innoSysTec (R) GmbH, Germany. All rights reserved.
* Original author: Edmund Wagner
* Creation date: 31.05.2007
*
* Source: $HeadURL$
* Last changed: $LastChangedDate$
*
* the unrar licence applies to all junrar source and binary distributions
* you are not allowed to use this source to re-create the RAR compression algorithm
*
* Here some html entities which can be used for escaping javadoc tags:
* "&": "&" or "&"
* "<": "<" or "<"
* ">": ">" or ">"
* "@": "@"
*/
package org.fox.ttcomics2.junrar.unpack.vm;
public class BitInput {
public static final int MAX_SIZE = 0x8000;
protected int inAddr;
protected int inBit;
protected byte[] inBuf;
public BitInput() {
inBuf = new byte[MAX_SIZE];
}
public void InitBitInput() {
inAddr = 0;
inBit = 0;
}
public void addbits(int Bits) {
Bits += inBit;
inAddr += Bits >> 3;
inBit = Bits & 7;
}
public int getbits() {
// int BitField=0;
// BitField|=(int)(inBuf[inAddr] << 16)&0xFF0000;
// BitField|=(int)(inBuf[inAddr+1] << 8)&0xff00;
// BitField|=(int)(inBuf[inAddr+2])&0xFF;
// BitField >>>= (8-inBit);
// return (BitField & 0xffff);
return (((((inBuf[inAddr] & 0xff) << 16) +
((inBuf[inAddr + 1] & 0xff) << 8) +
((inBuf[inAddr + 2] & 0xff))) >>> (8 - inBit)) & 0xffff);
}
public void faddbits(int Bits) {
addbits(Bits);
}
public int fgetbits() {
return (getbits());
}
public boolean Overflow(int IncPtr) {
return (inAddr + IncPtr >= MAX_SIZE);
}
public byte[] getInBuf() {
return inBuf;
}
}
|
