mirror of
https://github.com/libretro/scummvm.git
synced 2024-12-28 04:34:50 +00:00
342 lines
8.1 KiB
C++
342 lines
8.1 KiB
C++
/* ScummVM - Graphic Adventure Engine
|
|
*
|
|
* ScummVM is the legal property of its developers, whose names
|
|
* are too numerous to list here. Please refer to the COPYRIGHT
|
|
* file distributed with this source distribution.
|
|
*
|
|
* 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
|
|
*
|
|
* $URL$
|
|
* $Id$
|
|
*
|
|
*/
|
|
|
|
#include "cruise/cruise_main.h"
|
|
#include "common/endian.h"
|
|
#include "common/util.h"
|
|
|
|
namespace Cruise {
|
|
|
|
uint8 *ctpVar17;
|
|
|
|
Common::Array<CtStruct> polyStructNorm;
|
|
Common::Array<CtStruct> polyStructExp;
|
|
Common::Array<CtStruct> *polyStructs = NULL;
|
|
Common::Array<CtStruct> *polyStruct = NULL;
|
|
|
|
int currentWalkBoxCenterX;
|
|
int currentWalkBoxCenterY;
|
|
int currentWalkBoxCenterXBis;
|
|
int currentWalkBoxCenterYBis;
|
|
|
|
int ctpVarUnk;
|
|
uint8 walkboxTable[0x12];
|
|
|
|
int computeDistance(int varX, int varY, int paramX, int paramY) {
|
|
int diffX = ABS(paramX - varX);
|
|
int diffY = ABS(paramY - varY);
|
|
|
|
if (diffX > diffY) {
|
|
diffY = diffX;
|
|
}
|
|
|
|
return (diffY);
|
|
}
|
|
|
|
// this function process path finding coordinates
|
|
void computeAllDistance(int16 table[][10], short int coordCount) {
|
|
for (int i = 0; i < coordCount; i++) {
|
|
int x1 = ctp_routeCoords[i][0];
|
|
int y1 = ctp_routeCoords[i][1];
|
|
|
|
for (int j = 0; j < ctp_routes[i][0]; j++) {
|
|
int p = ctp_routes[i][j+1];
|
|
|
|
int x2 = ctp_routeCoords[p][0];
|
|
int y2 = ctp_routeCoords[p][1];
|
|
|
|
table[i][p] = computeDistance(x1, y1, x2, y2);
|
|
}
|
|
}
|
|
}
|
|
|
|
void getWalkBoxCenter(int n, int16 table[][40]) {
|
|
int minX = 1000;
|
|
int minY = 1000;
|
|
int maxX = -1;
|
|
int maxY = -1;
|
|
|
|
for (int i = 0; i < table[n][0]; i++) {
|
|
int x = table[n][i*2+1];
|
|
int y = table[n][i*2+2];
|
|
|
|
if (x < minX)
|
|
minX = x;
|
|
|
|
if (x > maxX)
|
|
maxX = x;
|
|
|
|
if (y < minY)
|
|
minY = y;
|
|
|
|
if (y > maxY)
|
|
maxY = y;
|
|
}
|
|
|
|
currentWalkBoxCenterX = ((maxX - minX) / 2) + minX;
|
|
currentWalkBoxCenterY = ((maxY - minY) / 2) + minY;
|
|
}
|
|
|
|
// ax dx bx
|
|
void renderCTPWalkBox(int16 *walkboxData, int hotPointX, int hotPointY, int X, int Y, int scale) {
|
|
int numPoints;
|
|
int i;
|
|
int16 *destination;
|
|
|
|
int startX = X - ((upscaleValue(hotPointX, scale) + 0x8000) >> 16);
|
|
// int startY = Y - ((upscaleValue(hotPointY, scale) + 0x8000) >> 16);
|
|
|
|
numPoints = *(walkboxData++);
|
|
|
|
destination = polyBuffer2;
|
|
|
|
for (i = 0; i < numPoints; i++) {
|
|
int pointX = *(walkboxData++);
|
|
int pointY = *(walkboxData++);
|
|
|
|
int scaledX = ((upscaleValue(pointX, scale) + 0x8000) >> 16) + startX;
|
|
int scaledY = ((upscaleValue(pointY, scale) + 0x8000) >> 16) + startX;
|
|
|
|
*(destination++) = scaledX;
|
|
*(destination++) = scaledY;
|
|
}
|
|
|
|
m_color = 0;
|
|
ctpVarUnk = 0;
|
|
|
|
for (i = 0; i < numPoints; i++) {
|
|
walkboxTable[i] = i;
|
|
}
|
|
|
|
drawPolyMode2((unsigned char *)walkboxTable, numPoints);
|
|
}
|
|
|
|
// this process the walkboxes
|
|
void makeCtStruct(Common::Array<CtStruct> &lst, int16 table[][40], int num, int z) {
|
|
int minX = 1000;
|
|
int maxX = -1;
|
|
|
|
if (table[num][0] < 1)
|
|
return;
|
|
|
|
getWalkBoxCenter(num, table);
|
|
|
|
currentWalkBoxCenterXBis = currentWalkBoxCenterX;
|
|
currentWalkBoxCenterYBis = currentWalkBoxCenterY;
|
|
|
|
renderCTPWalkBox(&table[num][0], currentWalkBoxCenterX, currentWalkBoxCenterY, currentWalkBoxCenterX, currentWalkBoxCenterY, z + 0x200);
|
|
|
|
lst.push_back(CtStruct());
|
|
CtStruct &ct = lst[lst.size() - 1];
|
|
|
|
int16* XArray = XMIN_XMAX;
|
|
int minY = *XArray++;
|
|
|
|
int i = 0;
|
|
|
|
while (*XArray >= 0) {
|
|
int x1 = *XArray++;
|
|
int x2 = *XArray++;
|
|
|
|
if (x1 < minX)
|
|
minX = x1;
|
|
|
|
if (x2 > maxX)
|
|
maxX = x2;
|
|
|
|
ct.slices.push_back(CtEntry(x1, x2));
|
|
i++;
|
|
}
|
|
|
|
ct.num = num;
|
|
ct.colour = walkboxColor[num];
|
|
ct.bounds.left = minX;
|
|
ct.bounds.right = maxX;
|
|
ct.bounds.top = minY;
|
|
ct.bounds.bottom = minY + i;
|
|
}
|
|
|
|
int getNode(int nodeResult[2], int nodeId) {
|
|
if (nodeId < 0 || nodeId >= ctp_routeCoordCount)
|
|
return -1;
|
|
|
|
nodeResult[0] = ctp_routeCoords[nodeId][0];
|
|
nodeResult[1] = ctp_routeCoords[nodeId][1];
|
|
|
|
return 0;
|
|
}
|
|
|
|
int setNodeColor(int nodeIdx, int nodeColor) {
|
|
if (nodeIdx < 0 || nodeIdx >= ctp_routeCoordCount)
|
|
return -1;
|
|
|
|
int oldColor = walkboxColor[nodeIdx];
|
|
|
|
if (nodeColor == -1)
|
|
return
|
|
|
|
walkboxColor[nodeIdx] = nodeColor;
|
|
|
|
return oldColor;
|
|
}
|
|
|
|
int setNodeState(int nodeIdx, int nodeState) {
|
|
if (nodeIdx < 0 || nodeIdx >= ctp_routeCoordCount)
|
|
return -1;
|
|
|
|
int oldState = walkboxState[nodeIdx];
|
|
|
|
if (nodeState == -1)
|
|
return
|
|
|
|
walkboxState[nodeIdx] = nodeState;
|
|
|
|
return oldState;
|
|
}
|
|
|
|
int initCt(const char *ctpName) {
|
|
uint8 *dataPointer; // ptr2
|
|
char fileType[5]; // string2
|
|
short int segementSizeTable[7]; // tempTable
|
|
|
|
if (!loadCtFromSave) {
|
|
for (int i = 0; i < 10; i++) {
|
|
persoTable[i] = NULL;
|
|
}
|
|
}
|
|
uint8* ptr = NULL;
|
|
if (!loadFileSub1(&ptr, ctpName, 0)) {
|
|
free(ptr);
|
|
return (-18);
|
|
}
|
|
|
|
dataPointer = ptr;
|
|
|
|
fileType[4] = 0;
|
|
memcpy(fileType, dataPointer, 4); // get the file type, first 4 bytes of the CTP file
|
|
dataPointer += 4;
|
|
|
|
if (strcmp(fileType, "CTP ")) {
|
|
free(ptr);
|
|
return (0);
|
|
}
|
|
|
|
ctp_routeCoordCount = (int16)READ_BE_UINT16(dataPointer); // get the number of nods
|
|
dataPointer += 2;
|
|
|
|
for (int i = 0; i < 7; i++) {
|
|
segementSizeTable[i] = (int16)READ_BE_UINT16(dataPointer);
|
|
dataPointer += 2;
|
|
}
|
|
|
|
// get the path-finding coordinates
|
|
ASSERT((segementSizeTable[0] % 4) == 0);
|
|
for (int i = 0; i < segementSizeTable[0] / 4; i++) {
|
|
ctp_routeCoords[i][0] = (int16)READ_BE_UINT16(dataPointer);
|
|
dataPointer += 2;
|
|
ctp_routeCoords[i][1] = (int16)READ_BE_UINT16(dataPointer);
|
|
dataPointer += 2;
|
|
}
|
|
|
|
// get the path-finding line informations (indexing the routeCoords array)
|
|
ASSERT((segementSizeTable[1] % 20) == 0);
|
|
for (int i = 0; i < segementSizeTable[1] / 20; i++) {
|
|
for (int j = 0; j < 10; j++) {
|
|
ctp_routes[i][j] = (int16)READ_BE_UINT16(dataPointer);
|
|
dataPointer += 2;
|
|
}
|
|
}
|
|
|
|
// read polygons
|
|
ASSERT((segementSizeTable[2] % 80) == 0);
|
|
for (int i = 0; i < segementSizeTable[2] / 80; i++) {
|
|
for (int j = 0; j < 40; j++) {
|
|
ctp_walkboxTable[i][j] = (int16)READ_BE_UINT16(dataPointer);
|
|
dataPointer += 2;
|
|
}
|
|
}
|
|
|
|
if (loadCtFromSave) {
|
|
// loading from save, ignore the initial values
|
|
dataPointer += segementSizeTable[3];
|
|
dataPointer += segementSizeTable[4];
|
|
} else {
|
|
// get the walkbox type
|
|
// Type: 0x00 - non walkable, 0x01 - walkable, 0x02 - exit zone
|
|
ASSERT((segementSizeTable[3] % 2) == 0);
|
|
for (int i = 0; i < segementSizeTable[3] / 2; i++) {
|
|
walkboxColor[i] = (int16)READ_BE_UINT16(dataPointer);
|
|
dataPointer += 2;
|
|
}
|
|
|
|
// change indicator, walkbox type can change, i.e. blocked by object (values are either 0x00 or 0x01)
|
|
ASSERT((segementSizeTable[4] % 2) == 0);
|
|
for (int i = 0; i < segementSizeTable[4] / 2; i++) {
|
|
walkboxState[i] = (int16)READ_BE_UINT16(dataPointer);
|
|
dataPointer += 2;
|
|
}
|
|
}
|
|
|
|
//
|
|
ASSERT((segementSizeTable[5] % 2) == 0);
|
|
for (int i = 0; i < segementSizeTable[5] / 2; i++) {
|
|
walkboxColorIndex[i] = (int16)READ_BE_UINT16(dataPointer);
|
|
dataPointer += 2;
|
|
}
|
|
|
|
//
|
|
ASSERT((segementSizeTable[6] % 2) == 0);
|
|
for (int i = 0; i < segementSizeTable[6] / 2; i++) {
|
|
walkboxZoom[i] = (int16)READ_BE_UINT16(dataPointer);
|
|
dataPointer += 2;
|
|
}
|
|
free(ptr);
|
|
|
|
if (ctpName != currentCtpName)
|
|
strcpy(currentCtpName, ctpName);
|
|
|
|
numberOfWalkboxes = segementSizeTable[6] / 2; // get the number of walkboxes
|
|
|
|
computeAllDistance(distanceTable, ctp_routeCoordCount); // process path-finding stuff
|
|
|
|
// Load the polyStructNorm list
|
|
|
|
for (int i = numberOfWalkboxes - 1; i >= 0; i--) {
|
|
makeCtStruct(polyStructNorm, ctp_walkboxTable, i, 0);
|
|
}
|
|
|
|
// Load the polyStructExp list
|
|
|
|
for (int i = numberOfWalkboxes - 1; i >= 0; i--) {
|
|
makeCtStruct(polyStructExp, ctp_walkboxTable, i, walkboxZoom[i] * 20);
|
|
}
|
|
|
|
polyStruct = polyStructs = &polyStructNorm;
|
|
|
|
return (1);
|
|
}
|
|
|
|
} // End of namespace Cruise
|