ScummVM/scummex
1
0
Fork 0
mirror of https://github.com/scummvm/scummex.git synced 2026-05-21 05:40:51 +00:00
Code Issues Packages Projects Releases Wiki Activity
Files
09445f3598c9775563f56b3ddece563fd7d2d09d
scummex/resource.cpp
T
yoshizf 753b7729ed Added a few blocks
2003-09-26 23:51:36 +00:00

918 lines
28 KiB
C++
Raw Blame History

/* ScummEX - Viewer for Scumm data files
* Copyright (C) 2003 Adrien Mercier
* Copyright (C) 2003 The ScummVM project
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*
* $Header: /Users/sev/projects/sc/s/scummvm/scummex/resource.cpp,v 1.19 2003/09/26 23:51:36 yoshizf Exp $
*
*/
#include <stdio.h>
#include "file.h"
#include "resource.h"
#include "scummex.h"
int v8 = 0;
Resource::Resource() {
stopflag = 0;
}
int Resource::searchOldBlocks(BlockTable *_blockTable, File& _input, int index, int level, int size) {
int32 curpos = 0;
if (size == 0)
size = _input.size();
while (curpos < size) {
curpos = _input.pos();
if (curpos >= size)
break;
_blockTable[index].blockSize = _input.readUint32LE();
_input.read(_blockTable[index].blockName, 2);
_blockTable[index].blockName[2] = '\0';
strcpy(_blockTable[index].blockType, _blockTable[index].blockName);
_blockTable[index].offset = _input.pos() - 6;
_blockTable[index].blockTypeID = getOldBlockType(_blockTable[index].blockName);
if (_blockTable[index].blockTypeID != -1) {
index = parseOldBlocks(_blockTable[index].blockName, _blockTable, _input, index, level);
curpos = _input.pos();
if (index == 0)
break;
if (stopflag == 1) {
stopflag = 0;
_input.seek(size, SEEK_SET);
return index;
}
}
curpos = _input.pos();
}
return index;
}
int Resource::searchBlocks(BlockTable *_blockTable, File& _input, int index, int level, int size) {
int32 curpos = 0;
int called = 0;
if (size != 0)
called = 1;
if (size == 0)
size = _input.size();
while (curpos < size) {
curpos = _input.pos();
if (curpos >= size)
break;
_input.read(_blockTable[index].blockName, 4);
_blockTable[index].blockName[4] = '\0';
strcpy(_blockTable[index].blockType, _blockTable[index].blockName);
_blockTable[index].offset = _input.pos() - 4;
//printf("block: %s offset: %d\n", _blockTable[index].blockName, _blockTable[index].offset);
_blockTable[index].blockTypeID = getBlockType(_blockTable[index].blockName);
if (_blockTable[index].blockTypeID != -1) {
index = parseBlocks(_blockTable[index].blockName, _blockTable, _input, index, level);
curpos = _input.pos();
if (index == 0)
break;
if (stopflag == 1) {
stopflag = 0;
_input.seek(size, SEEK_SET);
return index;
}
} else if (called) {
_input.seek(size, SEEK_SET);
return index;
}
curpos = _input.pos();
}
return index;
}
int Resource::parseBlocks(char *blockName, BlockTable *_blockTable, File& _input, int index, int level) {
int z = 0;
byte c;
char name[256];
int numFiles, number = 0;
int bufindex;
//uint blockOffset, blockSize;
byte temp[8];
int32 offset;
int16 code;
int len;
bool quit = 0;
strcpy(_blockTable[index].blockDescription, blocksInfo[_blockTable[index].blockTypeID].description);
switch(_blockTable[index].blockTypeID) {
case RNAM:
_blockTable[index].blockSize = _input.readUint32BE();
while (1) {
number = _input.readByte();
if (number == 0)
break;
_input.seek(9, SEEK_CUR);
}
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
index++;
break;
case LOFF:
_blockTable[index].blockSize = _input.readUint32BE();
numFiles = _input.readByte();
_blockTable[index].numFiles = numFiles;
// Getting LFLFs (rooms) offsets
for (int i=0; i<numFiles; i++) {
number = _input.readByte();
offset = _input.readUint32LE();
}
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
index++;
break;
case RMHD:
_blockTable[index].blockSize = _input.readUint32BE();
_blockTable[index].width = _input.readUint32LE();
switch(_blockTable[index].width) {
case 730:
_blockTable[index].width = _input.readUint16LE();
_blockTable[index].height = _input.readUint16LE();
_blockTable[index].localObjects = _input.readUint16LE();
break;
case 800:
_blockTable[index].width = _input.readUint32LE();
_blockTable[index].height = _input.readUint32LE();
_blockTable[index].localObjects = _input.readUint32LE();
break;
default:
_input.seek(-4, SEEK_CUR);
_blockTable[index].width = _input.readUint16LE();
_blockTable[index].height = _input.readUint16LE();
_blockTable[index].localObjects = _input.readUint16LE();
break;
}
_input.seek(_blockTable[index].offset + _blockTable[index].blockSize, SEEK_SET);
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
index++;
break;
case OBNA:
_blockTable[index].blockSize = _input.readUint32BE();
while (1) {
c = _input.readByte();
name[z++] = c;
if (c == 0)
break;
}
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
index++;
break;
case DROO:
case DSCR:
case DSOU:
case DCOS:
case DCHR:
case DOBJ:
_blockTable[index].blockSize = _input.readUint32BE();
_blockTable[index].numFiles = _input.readUint16LE();
_input.seek(_blockTable[index].offset + _blockTable[index].blockSize, SEEK_SET);
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
index++;
break;
case COMP:
numFiles = _input.readUint32BE();
_blockTable[index].numFiles = numFiles;
_input.readUint32BE();
_input.readUint32BE();
for (int j=0; j<numFiles; j++) {
_input.readUint32BE(); // dwOffset
_input.readUint32BE(); // dwSize
_input.readUint32BE(); // dwCodec
_input.readUint32BE(); // dwUnknown
}
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
index++;
stopflag = 1;
break;
case CLUT:
case APAL:
case NPAL:
_blockTable[index].blockSize = _input.readUint32BE();
_input.seek(256*3, SEEK_CUR);
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
index++;
break;
case OFFS:
_blockTable[index].blockSize = _input.readUint32BE();
for (uint32 j=0; j < ((_blockTable[index].blockSize-8) / 4); j++) {
offset = _input.readUint32LE();
}
//_input.seek(_blockTable[index].offset + _blockTable[index].blockSize, SEEK_SET);
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
index++;
break;
case RMIH:
_blockTable[index].blockSize = _input.readUint32BE();
int numZBuffer;
numZBuffer = _input.readUint16LE();
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
index++;
break;
case SMAP:
_blockTable[index].blockSize = _input.readUint32BE();
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
bufindex = index;
index++;
if (v8) {
level++;
index = searchBlocks(_blockTable, _input, index, level, _blockTable[index-1].blockSize + _blockTable[index-1].offset);
}
_input.seek(_blockTable[bufindex].offset + _blockTable[bufindex].blockSize, SEEK_SET);
break;
case AARY:
_blockTable[index].blockSize = _input.readUint32BE();
_blockTable[index].numFiles = _input.readUint16LE();
_input.seek(_blockTable[index].offset + _blockTable[index].blockSize, SEEK_SET);
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
index++;
break;
case IMHD:
_blockTable[index].blockSize = _input.readUint32BE();
_blockTable[index].width = _input.readUint32LE();
if (_blockTable[index].width == 730) {
_input.readUint16LE();
_blockTable[index].numFiles = _input.readUint16LE(); // Number of images
_input.readUint16LE(); // X Position
_input.readUint16LE(); // Y Position
_blockTable[index].width = _input.readUint16LE();
_blockTable[index].height = _input.readUint16LE();
} else {
_input.seek(_blockTable[index].offset + 48, SEEK_SET);
_blockTable[index].width = _input.readUint32LE();
if (_blockTable[index].width == 801) {
_blockTable[index].numFiles = _input.readUint32LE(); // Number of images
_input.readUint32LE(); // X Position
_input.readUint32LE(); // Y Position
_blockTable[index].width = _input.readUint32LE();
_blockTable[index].height = _input.readUint32LE();
} else {
_input.seek(_blockTable[index].offset + 10, SEEK_SET);
_blockTable[index].numFiles = _input.readUint16LE();
_input.readUint32BE(); // Number of Z-Buffers per Image
_input.readUint16LE(); // X Position
_input.readUint16LE(); // Y Position
_blockTable[index].width = _input.readUint16LE();
_blockTable[index].height = _input.readUint16LE();
}
}
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
_input.seek(_blockTable[index].offset + _blockTable[index].blockSize, SEEK_SET);
index++;
break;
case MCMP:
numFiles = _input.readUint16BE();
_blockTable[index].numFiles = numFiles;
for (int j=0; j<numFiles; j++) {
_input.readByte(); // nCodec
_input.readUint32BE(); // dwDecompSize
_input.readUint32BE(); // dwCompSize
}
number = _input.readUint16BE(); // nCodecs
number /= 5;
_input.seek(5*number, SEEK_CUR);
_blockTable[index].blockSize = _input.pos() - _blockTable[index].offset;
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
index++;
break;
case iMUS:
number = _input.readUint32BE(); // dwDecompSize
_blockTable[index].blockSize = 9;
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
index++;
level++;
index = searchBlocks(_blockTable, _input, index, level, _blockTable[index-1].blockSize + _blockTable[index-1].offset);
break;
case FRMT:
_blockTable[index].blockSize = _input.readUint32BE();
_input.readUint32BE(); // dwPosition
_input.readUint32BE(); // dwUnknown
_input.readUint32BE(); // dwBitsPerSample
number = _input.readUint32BE(); // dwSampleRate
_input.readUint32BE(); // nChannels
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
index++;
break;
case TEXT:
_blockTable[index].blockSize = _input.readUint32BE() + 8; // Name and size not included
_input.readUint32BE(); // Unknown
/*while (number < _blockTable[index].blockSize + _blockTable[index].offset) {
c = _input.readByte();
name[z++] = c;
number = _input.pos();
if (c == 0)
break;
}
printf("%s\n", name);*/
_input.seek(_blockTable[index].blockSize + _blockTable[index].offset, SEEK_SET);
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
index++;
break;
case REGN:
_blockTable[index].blockSize = _input.readUint32BE() + 8; // Name and size not included
_input.seek(_blockTable[index].blockSize + _blockTable[index].offset, SEEK_SET);
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
index++;
break;
case JUMP:
_blockTable[index].blockSize = _input.readUint32BE() + 8; // Name and size not included
_input.readUint32BE(); // Hook Position
_input.readUint32BE(); // Jump Destination
_input.readUint32BE(); // Hook ID
_input.readUint32BE(); // Unknown
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
index++;
break;
case DATA:
_input.readUint32BE(); // Decompressed Size
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
index++;
stopflag = 1;
break;
case STOP:
_blockTable[index].blockSize = _input.readUint32BE() + 8; // Name and size not included
_input.readUint32BE(); // Hook Position
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
index++;
break;
case SYNC:
_blockTable[index].blockSize = _input.readUint32BE() + 8; // Name and size not included
_input.readUint32BE(); // Hook Position
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
index++;
break;
case TRNS:
_blockTable[index].blockSize = _input.readUint32BE();
_blockTable[index].trans = _input.readUint16LE();
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
_input.seek(_blockTable[index].blockSize + _blockTable[index].offset, SEEK_SET);
index++;
break;
case MAXS:
_blockTable[index].blockSize = _input.readUint32BE();
_blockTable[index].variables = _input.readUint16LE();
_input.readUint16LE();
_blockTable[index].bitVariables = _input.readUint16LE();
_blockTable[index].localObjects = _input.readUint16LE();
_blockTable[index].arrays = _input.readUint16LE();
_blockTable[index].characters = _input.readUint16LE();
_input.readUint16LE();
_input.readUint16LE();
_blockTable[index].invObjects = _input.readUint16LE();
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
index++;
break;
case LB83:
offset = _input.readUint32BE();
numFiles = _input.readUint32BE();
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
_input.seek(offset, SEEK_SET);
index++;
level++;
// Files blocks
for (int i=index; i<numFiles+index; i++) {
char *tempname;
int z2;
z = 0;
for (z2 = 0; z2 < 8; z2++)
if ((c = _input.readByte()) != 0)
name[z++] = c;
name[z++] = '.';
for (z2 = 0; z2 < 4; z2++)
if ((c = _input.readByte()) != 0)
name[z++] = c;
name[z] = '\0';
strcpy(_blockTable[i].blockName, name);
_blockTable[i].offset = _input.readUint32BE();
_blockTable[i].blockSize = _input.readUint32BE();
_blockTable[i].blockTypeID = 25;
sprintf(_blockTable[i].blockDescription, "iMUSE Cue");
tempname = strtok(name, ".");
if (tempname != NULL) {
tempname = strtok(NULL, ".");
if (tempname != NULL) {
sprintf(_blockTable[i].blockType, ".%s", tempname);
}
} else {
sprintf(_blockTable[i].blockType, "Unknown");
}
}
index += numFiles;
level++;
for (int i=1; i<numFiles+1; i++) {
_gui->add_tree_elements(_blockTable[i].blockName, i, level-1, _blockTable[i].blockTypeID);
_input.seek(_blockTable[i].offset, SEEK_SET);
index = searchBlocks(_blockTable, _input, index, level, _blockTable[i].blockSize + _blockTable[i].offset);
_input.seek(_blockTable[i].blockSize + _blockTable[i].offset, SEEK_SET);
}
break;
case LABN:
_input.readUint32LE();
numFiles = _input.readUint32LE();
_blockTable[index].numFiles = numFiles;
_input.readUint32LE();
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
index++;
level++;
// Files blocks
for (int i=index; i<numFiles+index; i++) {
_input.readUint32LE();
_blockTable[i].blockTypeID = 24;
sprintf(_blockTable[i].blockDescription, " ");
_blockTable[i].offset = _input.readUint32LE();
_blockTable[i].blockSize = _input.readUint32LE();
_input.readUint32LE();
}
for (int i=index; i<numFiles+index; i++) {
char *tempname;
z = 0;
while(1) {
c = _input.readByte();
name[z++] = c;
if (c == 0) {
break;
}
}
strcpy(_blockTable[i].blockName, name);
tempname = strtok(name, ".");
while (tempname != NULL) {
tempname = strtok(NULL, ".");
if (tempname != NULL) {
sprintf(_blockTable[i].blockType, ".%s", tempname);
_blockTable[i].blockTypeID = getBlockType(tempname);
}
}
if (_blockTable[i].blockType == "") {
sprintf(_blockTable[i].blockType, "Unknown");
}
}
index += numFiles;
level++;
for (int i=1; i<numFiles+1; i++) {
_gui->add_tree_elements(_blockTable[i].blockName, i, level-1, _blockTable[i].blockTypeID);
_input.seek(_blockTable[i].offset, SEEK_SET);
index = searchBlocks(_blockTable, _input, index, level, _blockTable[i].blockSize + _blockTable[i].offset);
_input.seek(_blockTable[i].blockSize + _blockTable[i].offset, SEEK_SET);
}
break;
case IMAG:
case TBSTR:
v8 = 1;
_blockTable[index].blockSize = _input.readUint32BE();
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
bufindex = index;
index++;
level++;
index = searchBlocks(_blockTable, _input, index, level, _blockTable[index-1].blockSize + _blockTable[index-1].offset);
_input.seek(_blockTable[bufindex].offset + _blockTable[bufindex].blockSize, SEEK_SET);
break;
case RMSC:
case AKOS:
case ANIM:
case LECF:
case LFLF:
case ROOM:
case OBCD:
case IM00:
case IM01:
case IM02:
case IM03:
case IM04:
case IM05:
case IM06:
case IM07:
case IM08:
case IM09:
case RMIM:
case PALS:
case WRAP:
case OBIM:
case SOUN:
case ZPLN:
_blockTable[index].blockSize = _input.readUint32BE();
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
bufindex = index;
index++;
level++;
index = searchBlocks(_blockTable, _input, index, level, _blockTable[index-1].blockSize + _blockTable[index-1].offset);
_input.seek(_blockTable[bufindex].offset + _blockTable[bufindex].blockSize, SEEK_SET);
break;
case MAP:
_blockTable[index].blockSize = _input.readUint32BE();
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
index++;
level++;
index = searchBlocks(_blockTable, _input, index, level, _blockTable[index-1].blockSize + _blockTable[index-1].offset);
break;
case SOU:
_blockTable[index].blockSize = _input.readUint32BE();
if (_blockTable[index].blockSize == 0) {
_blockTable[index].blockSize = 8;
_input.seek(_blockTable[index].offset + _blockTable[index].blockSize, SEEK_SET);
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
index++;
return index;
}
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
bufindex = index;
index++;
level++;
index = searchBlocks(_blockTable, _input, index, level, _blockTable[index-1].blockSize + _blockTable[index-1].offset);
_input.seek(_blockTable[bufindex].offset + _blockTable[bufindex].blockSize, SEEK_SET);
break;
case IACT:
_blockTable[index].blockSize = _input.readUint32BE() + 8;
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
bufindex = index;
index++;
level++;
index = searchBlocks(_blockTable, _input, index, level, _blockTable[index-1].blockSize + _blockTable[index-1].offset);
_input.seek(_blockTable[bufindex].offset + _blockTable[bufindex].blockSize, SEEK_SET);
_input.read(_blockTable[index+1].blockName, 4);
_blockTable[index+1].blockName[4] = '\0';
_blockTable[index+1].blockTypeID = getBlockType(_blockTable[index+1].blockName);
if (_blockTable[index+1].blockTypeID != -1) {
_input.seek(-4, SEEK_CUR);
} else {
_blockTable[bufindex].blockSize += 1;
_input.seek(-3, SEEK_CUR);
}
break;
case FRME:
case SAUD:
_blockTable[index].blockSize = _input.readUint32BE() + 8;
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
bufindex = index;
index++;
level++;
index = searchBlocks(_blockTable, _input, index, level, _blockTable[index-1].blockSize + _blockTable[index-1].offset);
_input.seek(_blockTable[bufindex].offset + _blockTable[bufindex].blockSize, SEEK_SET);
break;
case PSAD:
_blockTable[index].blockSize = _input.readUint32BE() + 8;
_input.readUint16LE(); // Track id
_input.readUint16LE(); // Index
_input.readUint16LE(); // Max Frames
_input.readUint16LE(); // Flags
_input.readByte(); // Volume
_input.readByte(); // bal
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
bufindex = index;
index++;
level++;
index = searchBlocks(_blockTable, _input, index, level, _blockTable[index-1].blockSize + _blockTable[index-1].offset);
_input.seek(_blockTable[bufindex].offset + _blockTable[bufindex].blockSize, SEEK_SET);
break;
case AHDR:
case TRES:
case STRK:
case XPAL:
case ADL:
case ROL:
case FTCH:
case STOR:
_blockTable[index].blockSize = _input.readUint32BE() + 8;
_input.seek(_blockTable[index].offset + _blockTable[index].blockSize, SEEK_SET);
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
index++;
break;
case SPK:
_blockTable[index].blockSize = _input.readUint32BE() + 8;
stopflag = 1;
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
index++;
break;
case FOBJ:
_blockTable[index].blockSize = _input.readUint32BE() + 8;
_blockTable[index].variables = _input.readUint16LE(); // Codec
_input.readUint16BE(); // Left
_input.readUint16BE(); // Top
_blockTable[index].width = _input.readUint16LE(); // Width
_blockTable[index].height = _input.readUint16LE(); // Height
_input.readUint16BE();
_input.readUint16BE();
_input.seek(_blockTable[index].offset + _blockTable[index].blockSize, SEEK_SET);
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
index++;
break;
case SDAT:
_blockTable[index].blockSize = _input.readUint32BE();
stopflag = 1;
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
index++;
break;
case Crea:
_input.seek(22, SEEK_CUR);
offset = 0;
code = 0;
while (!quit) {
code = _input.readByte();
switch(code) {
case 0: quit = 1; break;
case 1: {
_input.read(&temp, 3);
len = (temp[0] | (temp[1] << 8) | (temp[2] << 16));
int rate = _input.readByte();
_input.readByte();
len -= 2;
if (rate == 0xa5 || rate == 0xa6) {
_blockTable[index].variables = 11025;
} else if (rate == 0xd2 || rate == 0xd3) {
_blockTable[index].variables = 22050;
} else {
_blockTable[index].variables = 1000000L / (256L - rate);
}
// FIXME some FT samples (ex. 362) has bad length, 2 bytes too short
_input.seek(len, SEEK_CUR);
} break;
case 5:
_input.seek(4, SEEK_CUR);
quit = 1;
break;
case 6: // begin of loop
_input.read(&temp, 3);
len = (temp[0] | (temp[1] << 8) | (temp[2] << 16));
_input.seek(len, SEEK_CUR);
break;
case 7: // end of loop
_input.read(&temp, 3);
len = (temp[0] | (temp[1] << 8) | (temp[2] << 16));
_input.seek(len, SEEK_CUR);
break;
default:
quit = 1;
break;
}
}
number = _input.pos();
_blockTable[index].blockSize = number - _blockTable[index].offset;
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
index++;
break;
case BOXD:
_blockTable[index].blockSize = _input.readUint32BE();
_blockTable[index].numFiles = _input.readUint16LE(); // Number of walkboxes
_input.seek(_blockTable[index].offset + _blockTable[index].blockSize, SEEK_SET);
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
index++;
break;
default:
_blockTable[index].blockSize = _input.readUint32BE();
_input.seek(_blockTable[index].offset + _blockTable[index].blockSize, SEEK_SET);
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
index++;
break;
}
return index;
}
int Resource::parseOldBlocks(char *blockName, BlockTable *_blockTable, File& _input, int index, int level) {
int numFiles, offset, number, bufindex;
strcpy(_blockTable[index].blockDescription, oldBlocksInfo[_blockTable[index].blockTypeID - 200].description);
switch(_blockTable[index].blockTypeID) {
case b0R:
case b0S:
case b0N:
case b0C:
numFiles = _input.readUint16LE();
_blockTable[index].numFiles = numFiles;
for (int i=0; i<numFiles; i++) {
number = _input.readByte();
offset = _input.readUint32LE();
}
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
index++;
break;
case b0O:
numFiles = _input.readUint16LE();
_blockTable[index].numFiles = numFiles;
for (int i=0; i<numFiles; i++) {
_input.readByte(); // Owner of object
}
_input.seek(_blockTable[index].blockSize + _blockTable[index].offset, SEEK_SET);
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
index++;
break;
case RO:
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
index++;
level++;
index = searchOldBlocks(_blockTable, _input, index, level, _blockTable[index-1].blockSize + _blockTable[index-1].offset);
break;
break;
case HD:
_blockTable[index].width = _input.readUint16LE();
_blockTable[index].height = _input.readUint16LE();
_blockTable[index].localObjects = _input.readUint16LE();
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
index++;
break;
case LE:
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
bufindex = index;
index++;
level++;
index = searchOldBlocks(_blockTable, _input, index, level, _blockTable[index-1].blockSize + _blockTable[index-1].offset);
_input.seek(_blockTable[bufindex].offset + _blockTable[bufindex].blockSize, SEEK_SET);
break;
case LF:
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
_input.seek(2, SEEK_CUR);
bufindex = index;
index++;
level++;
index = searchOldBlocks(_blockTable, _input, index, level, _blockTable[index-1].blockSize + _blockTable[index-1].offset);
_input.seek(_blockTable[bufindex].offset + _blockTable[bufindex].blockSize, SEEK_SET);
break;
case BX:
_blockTable[index].numFiles = _input.readByte(); // Number of boxes
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
_input.seek(_blockTable[index].blockSize + _blockTable[index].offset, SEEK_SET);
index++;
break;
default:
_gui->add_tree_elements(_blockTable[index].blockName, index, level, _blockTable[index].blockTypeID);
_input.seek(_blockTable[index].blockSize + _blockTable[index].offset, SEEK_SET);
index++;
break;
}
return index;
}
int Resource::getBlockType(char *tag) {
for (int i=0; i<119; i++) {
if(strstr(tag, blocksInfo[i].name)) {
return blocksInfo[i].id;
}
}
//printf("Unknown block: %s\n", tag);
//exit(1);
return -1;
}
int Resource::getOldBlockType(char *tag) {
for (int i=0; i<28; i++) {
if(strstr(tag, oldBlocksInfo[i].name)) {
return oldBlocksInfo[i].id;
}
}
return -1;
}
int Resource::findBlock(int direction, BlockTable * _blockTable, int id, ...)
{
va_list arg_ptr;
char *test;
int tempid;
tempid = id;
va_start(arg_ptr, id);
while ((test = (va_arg(arg_ptr, char *)))) {
id = tempid;
if (direction == 0) {
id -= 1;
while (id >= 0) {
if(strstr(test, _blockTable[id].blockName)) {
goto the_end;
}
id--;
}
}
if (direction == 1) {
id += 1;
// FIXME: Loop till infinity?? that can hardly be correct
while (1) {
if(strstr(test, _blockTable[id].blockName)) {
goto the_end;
}
id++;
}
}
}
the_end:
va_end(arg_ptr);
return test ? id : -1;
}
Reference in New Issue View Git Blame Copy Permalink