summaryrefslogtreecommitdiff
path: root/src/map.cpp
diff options
context:
space:
mode:
authorYohann Ferreira <yohann_dot_ferreira_at_orange_dot_efer>2011-03-10 18:28:49 +0100
committerAndrei Karas <akaras@inbox.ru>2011-03-11 02:53:52 +0200
commit0c6bf93ee13f0b3344079ebf4e60c5ec8323f0bd (patch)
tree321aebd02acd37ff3cf20bfab6ccf2b34b7d6181 /src/map.cpp
parente9364e8946f49cc7cd750185dd3f10f3857048a2 (diff)
downloadmv-0c6bf93ee13f0b3344079ebf4e60c5ec8323f0bd.tar.gz
mv-0c6bf93ee13f0b3344079ebf4e60c5ec8323f0bd.tar.bz2
mv-0c6bf93ee13f0b3344079ebf4e60c5ec8323f0bd.tar.xz
mv-0c6bf93ee13f0b3344079ebf4e60c5ec8323f0bd.zip
Wrap the open and closed list members in path finding.
This prevent some weird things happening in path finding when playing for a very long time. Reviewed-by: Thorbjorn.
Diffstat (limited to 'src/map.cpp')
-rw-r--r--src/map.cpp27
1 files changed, 22 insertions, 5 deletions
diff --git a/src/map.cpp b/src/map.cpp
index 467d12331..855570eb8 100644
--- a/src/map.cpp
+++ b/src/map.cpp
@@ -47,6 +47,7 @@
#include "utils/stringutils.h"
#include <queue>
+#include <limits.h>
#include <sys/stat.h>
@@ -385,8 +386,8 @@ Map::Map(int width, int height, int tileWidth, int tileHeight):
mMetaTiles = new MetaTile[size];
for (int i = 0; i < NB_BLOCKTYPES; i++)
{
- mOccupation[i] = new int[size];
- memset(mOccupation[i], 0, size * sizeof(int));
+ mOccupation[i] = new unsigned[size];
+ memset(mOccupation[i], 0, size * sizeof(unsigned));
}
mSpecialLayer = new SpecialLayer(width, height);
mTempLayer = new SpecialLayer(width, height, true);
@@ -770,7 +771,8 @@ void Map::blockTile(int x, int y, BlockType type)
const int tileNum = x + y * mWidth;
- if ((++mOccupation[type][tileNum]) > 0)
+ if (mOccupation[type][tileNum] < UINT_MAX &&
+ (++mOccupation[type][tileNum]) > 0)
{
switch (type)
{
@@ -983,6 +985,7 @@ Path Map::findPixelPath(int startPixelX, int startPixelY, int endPixelX,
Path Map::findPath(int startX, int startY, int destX, int destY,
unsigned char walkmask, int maxCost)
{
+ // The basic walking cost of a tile.
static int const basicCost = 100;
// Path to be built up (empty by default)
@@ -1142,8 +1145,22 @@ Path Map::findPath(int startX, int startY, int destX, int destY,
// Two new values to indicate whether a tile is on the open or closed list,
// this way we don't have to clear all the values between each pathfinding.
- mOnClosedList += 2;
- mOnOpenList += 2;
+ if (mOnOpenList > UINT_MAX - 2)
+ {
+ // We reset the list memebers value.
+ mOnClosedList = 1;
+ mOnOpenList = 2;
+
+ // Clean up the metaTiles
+ const int size = mWidth * mHeight;
+ for (int i = 0; i < size; ++i)
+ mMetaTiles[i].whichList = 0;
+ }
+ else
+ {
+ mOnClosedList += 2;
+ mOnOpenList += 2;
+ }
// If a path has been found, iterate backwards using the parent locations
// to extract it.