mirror of
https://github.com/2006-Scape/2006Scape.git
synced 2026-07-03 00:31:51 +00:00
199 lines
4.7 KiB
Java
199 lines
4.7 KiB
Java
// Decompiled by Jad v1.5.8f. Copyright 2001 Pavel Kouznetsov.
|
|
// Jad home page: http://www.kpdus.com/jad.html
|
|
// Decompiler options: packimports(3)
|
|
|
|
import java.io.IOException;
|
|
import java.io.RandomAccessFile;
|
|
|
|
final class Decompressor {
|
|
|
|
public Decompressor(RandomAccessFile randomaccessfile, RandomAccessFile randomaccessfile1, int j) {
|
|
anInt311 = j;
|
|
dataFile = randomaccessfile;
|
|
indexFile = randomaccessfile1;
|
|
}
|
|
|
|
public synchronized byte[] decompress(int i) {
|
|
try {
|
|
seekTo(indexFile, i * 6);
|
|
int l;
|
|
for (int j = 0; j < 6; j += l) {
|
|
l = indexFile.read(buffer, j, 6 - j);
|
|
if (l == -1) {
|
|
return null;
|
|
}
|
|
}
|
|
|
|
int i1 = ((buffer[0] & 0xff) << 16) + ((buffer[1] & 0xff) << 8) + (buffer[2] & 0xff);
|
|
int j1 = ((buffer[3] & 0xff) << 16) + ((buffer[4] & 0xff) << 8) + (buffer[5] & 0xff);
|
|
// if(i1 < 0 || i1 > 0x7a120)
|
|
// return null;
|
|
if (j1 <= 0 || j1 > dataFile.length() / 520L) {
|
|
return null;
|
|
}
|
|
byte abyte0[] = new byte[i1];
|
|
int k1 = 0;
|
|
for (int l1 = 0; k1 < i1; l1++) {
|
|
if (j1 == 0) {
|
|
return null;
|
|
}
|
|
seekTo(dataFile, j1 * 520);
|
|
int k = 0;
|
|
int i2 = i1 - k1;
|
|
if (i2 > 512) {
|
|
i2 = 512;
|
|
}
|
|
int j2;
|
|
for (; k < i2 + 8; k += j2) {
|
|
j2 = dataFile.read(buffer, k, i2 + 8 - k);
|
|
if (j2 == -1) {
|
|
return null;
|
|
}
|
|
}
|
|
|
|
int k2 = ((buffer[0] & 0xff) << 8) + (buffer[1] & 0xff);
|
|
int l2 = ((buffer[2] & 0xff) << 8) + (buffer[3] & 0xff);
|
|
int i3 = ((buffer[4] & 0xff) << 16) + ((buffer[5] & 0xff) << 8) + (buffer[6] & 0xff);
|
|
int j3 = buffer[7] & 0xff;
|
|
if (k2 != i || l2 != l1 || j3 != anInt311) {
|
|
return null;
|
|
}
|
|
if (i3 < 0 || i3 > dataFile.length() / 520L) {
|
|
return null;
|
|
}
|
|
for (int k3 = 0; k3 < i2; k3++) {
|
|
abyte0[k1++] = buffer[k3 + 8];
|
|
}
|
|
|
|
j1 = i3;
|
|
}
|
|
|
|
return abyte0;
|
|
} catch (IOException _ex) {
|
|
return null;
|
|
}
|
|
}
|
|
|
|
public synchronized boolean method234(int i, byte abyte0[], int j)
|
|
{
|
|
boolean flag = method235(true, j, i, abyte0);
|
|
if(!flag)
|
|
flag = method235(false, j, i, abyte0);
|
|
return flag;
|
|
}
|
|
|
|
private synchronized boolean method235(boolean flag, int j, int k, byte abyte0[]) {
|
|
try {
|
|
int l;
|
|
if (flag) {
|
|
seekTo(indexFile, j * 6);
|
|
int k1;
|
|
for (int i1 = 0; i1 < 6; i1 += k1) {
|
|
k1 = indexFile.read(buffer, i1, 6 - i1);
|
|
if (k1 == -1) {
|
|
return false;
|
|
}
|
|
}
|
|
|
|
l = ((buffer[3] & 0xff) << 16) + ((buffer[4] & 0xff) << 8) + (buffer[5] & 0xff);
|
|
if (l <= 0 || l > dataFile.length() / 520L) {
|
|
return false;
|
|
}
|
|
} else {
|
|
l = (int) ((dataFile.length() + 519L) / 520L);
|
|
if (l == 0) {
|
|
l = 1;
|
|
}
|
|
}
|
|
buffer[0] = (byte) (k >> 16);
|
|
buffer[1] = (byte) (k >> 8);
|
|
buffer[2] = (byte) k;
|
|
buffer[3] = (byte) (l >> 16);
|
|
buffer[4] = (byte) (l >> 8);
|
|
buffer[5] = (byte) l;
|
|
seekTo(indexFile, j * 6);
|
|
indexFile.write(buffer, 0, 6);
|
|
int j1 = 0;
|
|
for (int l1 = 0; j1 < k; l1++) {
|
|
int i2 = 0;
|
|
if (flag) {
|
|
seekTo(dataFile, l * 520);
|
|
int j2;
|
|
int l2;
|
|
for (j2 = 0; j2 < 8; j2 += l2) {
|
|
l2 = dataFile.read(buffer, j2, 8 - j2);
|
|
if (l2 == -1) {
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (j2 == 8) {
|
|
int i3 = ((buffer[0] & 0xff) << 8) + (buffer[1] & 0xff);
|
|
int j3 = ((buffer[2] & 0xff) << 8) + (buffer[3] & 0xff);
|
|
i2 = ((buffer[4] & 0xff) << 16) + ((buffer[5] & 0xff) << 8) + (buffer[6] & 0xff);
|
|
int k3 = buffer[7] & 0xff;
|
|
if (i3 != j || j3 != l1 || k3 != anInt311) {
|
|
return false;
|
|
}
|
|
if (i2 < 0 || i2 > dataFile.length() / 520L) {
|
|
return false;
|
|
}
|
|
}
|
|
}
|
|
if (i2 == 0) {
|
|
flag = false;
|
|
i2 = (int) ((dataFile.length() + 519L) / 520L);
|
|
if (i2 == 0) {
|
|
i2++;
|
|
}
|
|
if (i2 == l) {
|
|
i2++;
|
|
}
|
|
}
|
|
if (k - j1 <= 512) {
|
|
i2 = 0;
|
|
}
|
|
buffer[0] = (byte) (j >> 8);
|
|
buffer[1] = (byte) j;
|
|
buffer[2] = (byte) (l1 >> 8);
|
|
buffer[3] = (byte) l1;
|
|
buffer[4] = (byte) (i2 >> 16);
|
|
buffer[5] = (byte) (i2 >> 8);
|
|
buffer[6] = (byte) i2;
|
|
buffer[7] = (byte) anInt311;
|
|
seekTo(dataFile, l * 520);
|
|
dataFile.write(buffer, 0, 8);
|
|
int k2 = k - j1;
|
|
if (k2 > 512) {
|
|
k2 = 512;
|
|
}
|
|
dataFile.write(abyte0, j1, k2);
|
|
j1 += k2;
|
|
l = i2;
|
|
}
|
|
|
|
return true;
|
|
} catch (IOException _ex) {
|
|
return false;
|
|
}
|
|
}
|
|
|
|
private synchronized void seekTo(RandomAccessFile randomaccessfile, int j) throws IOException {
|
|
if (j < 0 || j > 0x3c00000) {
|
|
System.out.println("Badseek - pos:" + j + " len:" + randomaccessfile.length());
|
|
j = 0x3c00000;
|
|
try {
|
|
Thread.sleep(1000L);
|
|
} catch (Exception _ex) {
|
|
}
|
|
}
|
|
randomaccessfile.seek(j);
|
|
}
|
|
|
|
private static final byte[] buffer = new byte[520];
|
|
private final RandomAccessFile dataFile;
|
|
private final RandomAccessFile indexFile;
|
|
private final int anInt311;
|
|
|
|
}
|