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
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
|
/*
* The Mana World
* Copyright 2004 The Mana World Development Team
*
* This file is part of The Mana World.
*
* The Mana World 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
* any later version.
*
* The Mana World 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 The Mana World; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
* $Id$
*/
#include "main.h"
#include "map.h"
#include "log.h"
#include "being.h"
#include <stdio.h>
#ifdef WIN32
#include <windows.h>
#else
#include "./net/win2linux.h"
#endif
Map tiledMap;
#define OLD_MAP_WIDTH 200
#define OLD_MAP_HEIGHT 200
/**
* Old tile structure. Used for loading the old map format.
*/
struct TILE {
/**
* Data field filled at follows:
*
* <pre>
* 1st byte: [1][1][1][1][1][1][1][1]
* 2nd byte: [1][1][2][2][2][2][2][2]
* 3rd byte: [2][2][2][2][3][3][3][3]
* 4th byte: [3][3][3][3][3][3][W][A]
* </pre>
*
* Legend:
* 1 - Ground layer (grass, water, ...)
* 2 - Fringe layer (decoration on top of ground layer, but below beings)
* 3 - Over layer (roofs, tree leaves, ...)
* W - Walkability flag
* A - Animated tile flag
*/
char data[4];
char flags;
};
/**
* Old map structure. Used for loading the old map format.
*/
struct MAP {
TILE tiles[OLD_MAP_WIDTH][OLD_MAP_HEIGHT];
char tileset[20];
char bg_music[20];
};
Tile::Tile():
whichList(0)
{
}
Map::Map():
width(200), height(200)
{
tiles = new Tile[width * height];
}
Map::~Map()
{
delete[] tiles;
}
bool Map::load(char *mapFile) {
FILE *file = fopen(mapFile, "r");
if (!file) {
warning(mapFile);
return false;
}
MAP oldMap;
fread(&oldMap, sizeof(MAP), 1, file);
fclose(file);
// Transfer tile data
int x, y;
for (y = 0; y < OLD_MAP_HEIGHT; y++) {
for (x = 0; x < OLD_MAP_WIDTH; x++) {
unsigned short id;
// Layer 0
id = MAKEWORD(oldMap.tiles[x][y].data[1] & 0x00c0,
oldMap.tiles[x][y].data[0]);
id >>= 6;
setTile(x, y, 0, id);
// Layer 1
id = MAKEWORD(oldMap.tiles[x][y].data[2] & 0x00f0,
oldMap.tiles[x][y].data[1] & 0x003f);
id >>= 4;
setTile(x, y, 1, id);
// Layer 2
id = MAKEWORD(oldMap.tiles[x][y].data[3] & 0x00fc,
oldMap.tiles[x][y].data[2] & 0x000f);
id >>= 2;
setTile(x, y, 2, id);
// Walkability
setWalk(x, y, (oldMap.tiles[x][y].data[3] & 0x0002) > 0);
}
}
return true;
}
void Map::setWalk(int x, int y, bool walkable) {
if (walkable) {
tiles[x + y * width].flags |= TILE_WALKABLE;
}
else {
tiles[x + y * width].flags &= ~TILE_WALKABLE;
}
}
bool Map::getWalk(int x, int y) {
bool ret = (tiles[x + y * width].flags & TILE_WALKABLE) != 0;
if (ret) {
// Check for colliding into a being
std::list<Being*>::iterator i = beings.begin();
while (i != beings.end() && ret) {
Being *being = (*i);
if (being->x == x && being->y == y) {
ret = false;
}
i++;
}
}
return ret;
}
void Map::setTile(int x, int y, int layer, int id)
{
tiles[x + y * width].layers[layer] = id;
}
int Map::getTile(int x, int y, int layer)
{
return tiles[x + y * width].layers[layer];
}
int Map::getWidth()
{
return width;
}
int Map::getHeight()
{
return height;
}
PATH_NODE *Map::findPath(int startX, int startY, int destX, int destY)
{
// Return when destination not walkable
if (!getWalk(destX, destY)) return NULL;
// No path found
return NULL;
}
|
