0
|
1 |
#include "stdafx.h"
|
|
2 |
#include "ttd.h"
|
|
3 |
#include <stdarg.h>
|
|
4 |
#include "gfx.h"
|
|
5 |
#include "viewport.h"
|
|
6 |
#include "command.h"
|
|
7 |
#include "vehicle.h"
|
|
8 |
|
|
9 |
byte _map_type_and_height[TILES_X * TILES_Y];
|
|
10 |
byte _map5[TILES_X * TILES_Y];
|
|
11 |
byte _map3_lo[TILES_X * TILES_Y];
|
|
12 |
byte _map3_hi[TILES_X * TILES_Y];
|
|
13 |
byte _map_owner[TILES_X * TILES_Y];
|
|
14 |
byte _map2[TILES_X * TILES_Y];
|
|
15 |
byte _map_extra_bits[TILES_X * TILES_Y/4];
|
|
16 |
|
|
17 |
extern const TileTypeProcs
|
|
18 |
_tile_type_clear_procs,
|
|
19 |
_tile_type_rail_procs,
|
|
20 |
_tile_type_road_procs,
|
|
21 |
_tile_type_town_procs,
|
|
22 |
_tile_type_trees_procs,
|
|
23 |
_tile_type_station_procs,
|
|
24 |
_tile_type_water_procs,
|
|
25 |
_tile_type_dummy_procs,
|
|
26 |
_tile_type_industry_procs,
|
|
27 |
_tile_type_tunnelbridge_procs,
|
|
28 |
_tile_type_unmovable_procs;
|
|
29 |
|
|
30 |
const TileTypeProcs * const _tile_type_procs[16] = {
|
|
31 |
&_tile_type_clear_procs,
|
|
32 |
&_tile_type_rail_procs,
|
|
33 |
&_tile_type_road_procs,
|
|
34 |
&_tile_type_town_procs,
|
|
35 |
&_tile_type_trees_procs,
|
|
36 |
&_tile_type_station_procs,
|
|
37 |
&_tile_type_water_procs,
|
|
38 |
&_tile_type_dummy_procs,
|
|
39 |
&_tile_type_industry_procs,
|
|
40 |
&_tile_type_tunnelbridge_procs,
|
|
41 |
&_tile_type_unmovable_procs,
|
|
42 |
};
|
|
43 |
|
|
44 |
/* landscape slope => sprite */
|
|
45 |
const byte _tileh_to_sprite[32] = {
|
|
46 |
0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,0,
|
|
47 |
0,0,0,0,0,0,0,16,0,0,0,17,0,15,18,0,
|
|
48 |
};
|
|
49 |
|
|
50 |
uint GetTileSlope(uint tile, int *h)
|
|
51 |
{
|
|
52 |
uint a,b,c,d,min;
|
|
53 |
int r;
|
|
54 |
|
|
55 |
if (GET_TILE_X(tile) == TILE_X_MAX || GET_TILE_Y(tile) == TILE_Y_MAX) {
|
|
56 |
if (h)
|
|
57 |
*h = 0;
|
|
58 |
return 0;
|
|
59 |
}
|
|
60 |
|
|
61 |
assert(tile < TILES_X * TILES_Y && GET_TILE_X(tile) != TILE_X_MAX && GET_TILE_Y(tile) != TILE_Y_MAX);
|
|
62 |
|
|
63 |
min = a = _map_type_and_height[tile] & 0xF;
|
|
64 |
b = _map_type_and_height[tile+TILE_XY(1,0)] & 0xF;
|
|
65 |
if (min >= b) min = b;
|
|
66 |
c = _map_type_and_height[tile+TILE_XY(0,1)] & 0xF;
|
|
67 |
if (min >= c) min = c;
|
|
68 |
d = _map_type_and_height[tile+TILE_XY(1,1)] & 0xF;
|
|
69 |
if (min >= d) min = d;
|
|
70 |
|
|
71 |
r = 0;
|
|
72 |
if ((a-=min)!=0) { r += (--a << 4) + 8; }
|
|
73 |
if ((c-=min)!=0) { r += (--c << 4) + 4; }
|
|
74 |
if ((d-=min)!=0) { r += (--d << 4) + 2; }
|
|
75 |
if ((b-=min)!=0) { r += (--b << 4) + 1; }
|
|
76 |
|
|
77 |
if (h != 0)
|
|
78 |
*h = min * 8;
|
|
79 |
|
|
80 |
return r;
|
|
81 |
}
|
|
82 |
|
|
83 |
int GetTileZ(uint tile)
|
|
84 |
{
|
|
85 |
int h;
|
|
86 |
GetTileSlope(tile, &h);
|
|
87 |
return h;
|
|
88 |
}
|
|
89 |
|
|
90 |
void FindLandscapeHeightByTile(TileInfo *ti, uint tile)
|
|
91 |
{
|
|
92 |
if (GET_TILE_X(tile) == TILE_X_MAX ||
|
|
93 |
GET_TILE_Y(tile) == TILE_Y_MAX) {
|
|
94 |
ti->tileh = 0;
|
|
95 |
ti->type = MP_STRANGE;
|
|
96 |
ti->tile = 0;
|
|
97 |
ti->map5 = 0;
|
|
98 |
ti->z = 0;
|
|
99 |
return;
|
|
100 |
}
|
|
101 |
|
|
102 |
ti->tile = tile;
|
|
103 |
ti->map5 = _map5[tile];
|
|
104 |
ti->type = GET_TILETYPE(tile);
|
|
105 |
ti->tileh = GetTileSlope(tile, &ti->z);
|
|
106 |
// ti->z = min * 8;
|
|
107 |
}
|
|
108 |
|
|
109 |
/* find the landscape height for the coordinates x y */
|
|
110 |
void FindLandscapeHeight(TileInfo *ti, uint x, uint y)
|
|
111 |
{
|
|
112 |
int tile;
|
|
113 |
|
|
114 |
ti->x = x;
|
|
115 |
ti->y = y;
|
|
116 |
|
|
117 |
if (x >= TILE_X_MAX*16-1 || y >= TILE_Y_MAX*16-1) {
|
|
118 |
ti->tileh = 0;
|
|
119 |
ti->type = MP_STRANGE;
|
|
120 |
ti->tile = 0;
|
|
121 |
ti->map5 = 0;
|
|
122 |
ti->z = 0;
|
|
123 |
return;
|
|
124 |
}
|
|
125 |
|
|
126 |
tile = TILE_FROM_XY(x,y);
|
|
127 |
FindLandscapeHeightByTile(ti, tile);
|
|
128 |
}
|
|
129 |
|
|
130 |
uint GetPartialZ(int x, int y, int corners)
|
|
131 |
{
|
|
132 |
int z = 0;
|
|
133 |
|
|
134 |
switch(corners) {
|
|
135 |
case 1:
|
|
136 |
if (x - y >= 0)
|
|
137 |
z = (x - y) >> 1;
|
|
138 |
break;
|
|
139 |
|
|
140 |
case 2:
|
|
141 |
y^=0xF;
|
|
142 |
if ( (x - y) >= 0)
|
|
143 |
z = (x - y) >> 1;
|
|
144 |
break;
|
|
145 |
|
|
146 |
case 3:
|
|
147 |
z = (x>>1) + 1;
|
|
148 |
break;
|
|
149 |
|
|
150 |
case 4:
|
|
151 |
if (y - x >= 0)
|
|
152 |
z = (y - x) >> 1;
|
|
153 |
break;
|
|
154 |
|
|
155 |
case 5:
|
|
156 |
case 10:
|
|
157 |
case 15:
|
|
158 |
z = 4;
|
|
159 |
break;
|
|
160 |
|
|
161 |
case 6:
|
|
162 |
z = (y>>1) + 1;
|
|
163 |
break;
|
|
164 |
|
|
165 |
case 7:
|
|
166 |
z = 8;
|
|
167 |
y^=0xF;
|
|
168 |
if (x - y < 0)
|
|
169 |
z += (x - y) >> 1;
|
|
170 |
break;
|
|
171 |
|
|
172 |
case 8:
|
|
173 |
y ^= 0xF;
|
|
174 |
if (y - x >= 0)
|
|
175 |
z = (y - x) >> 1;
|
|
176 |
break;
|
|
177 |
|
|
178 |
case 9:
|
|
179 |
z = (y^0xF)>>1;
|
|
180 |
break;
|
|
181 |
|
|
182 |
case 11:
|
|
183 |
z = 8;
|
|
184 |
if (x - y < 0)
|
|
185 |
z += (x - y) >> 1;
|
|
186 |
break;
|
|
187 |
|
|
188 |
case 12:
|
|
189 |
z = (x^0xF)>>1;
|
|
190 |
break;
|
|
191 |
|
|
192 |
case 13:
|
|
193 |
z = 8;
|
|
194 |
y ^= 0xF;
|
|
195 |
if (y - x < 0)
|
|
196 |
z += (y - x) >> 1;
|
|
197 |
break;
|
|
198 |
|
|
199 |
case 14:
|
|
200 |
z = 8;
|
|
201 |
if (y - x < 0)
|
|
202 |
z += (y - x) >> 1;
|
|
203 |
break;
|
|
204 |
|
|
205 |
case 23:
|
|
206 |
z = 1 + ((x+y)>>1);
|
|
207 |
break;
|
|
208 |
|
|
209 |
case 27:
|
|
210 |
z = 1 + ((x+(y^0xF))>>1);
|
|
211 |
break;
|
|
212 |
|
|
213 |
case 29:
|
|
214 |
z = 1 + (((x^0xF)+(y^0xF))>>1);
|
|
215 |
break;
|
|
216 |
|
|
217 |
case 30:
|
|
218 |
z = 1 + (((x^0xF)+(y^0xF))>>1);
|
|
219 |
break;
|
|
220 |
}
|
|
221 |
|
|
222 |
return z;
|
|
223 |
}
|
|
224 |
|
|
225 |
uint GetSlopeZ(int x, int y)
|
|
226 |
{
|
|
227 |
TileInfo ti;
|
|
228 |
// int z;
|
|
229 |
|
|
230 |
FindLandscapeHeight(&ti, x, y);
|
|
231 |
|
|
232 |
/*
|
|
233 |
z = ti.z;
|
|
234 |
x &= 0xF;
|
|
235 |
y &= 0xF;
|
|
236 |
|
|
237 |
|
|
238 |
assert(z < 256);
|
|
239 |
*/
|
|
240 |
|
|
241 |
return _tile_type_procs[ti.type]->get_slope_z_proc(&ti);
|
|
242 |
}
|
|
243 |
|
|
244 |
void DrawFoundation(TileInfo *ti, uint f)
|
|
245 |
{
|
|
246 |
if (f < 15) {
|
|
247 |
// leveled foundation
|
|
248 |
AddSortableSpriteToDraw(f + 0x3DE - 1, ti->x, ti->y, 16, 16, 7, ti->z);
|
|
249 |
ti->z += 8;
|
|
250 |
ti->tileh = 0;
|
|
251 |
OffsetGroundSprite(31, 1);
|
|
252 |
} else {
|
|
253 |
// inclined foundation
|
|
254 |
|
|
255 |
AddSortableSpriteToDraw(
|
|
256 |
HASBIT( (1<<1) | (1<<2) | (1<<4) | (1<<8), ti->tileh) ? (SPR_OPENTTD_BASE+17) + (f - 15) : ti->tileh + 0x3DE - 1,
|
|
257 |
ti->x, ti->y, 1, 1, 1, ti->z
|
|
258 |
);
|
|
259 |
|
|
260 |
ti->tileh = _inclined_tileh[f - 15];
|
|
261 |
OffsetGroundSprite(31, 9);
|
|
262 |
}
|
|
263 |
}
|
|
264 |
|
|
265 |
void DoClearSquare(uint tile)
|
|
266 |
{
|
|
267 |
ModifyTile(tile,
|
|
268 |
MP_SETTYPE(MP_CLEAR) |
|
|
269 |
MP_MAP2_CLEAR | MP_MAP3LO_CLEAR | MP_MAP3HI_CLEAR | MP_MAPOWNER | MP_MAP5,
|
|
270 |
OWNER_NONE, /* map_owner */
|
|
271 |
_generating_world ? 3 : 0 /* map5 */
|
|
272 |
);
|
|
273 |
}
|
|
274 |
|
|
275 |
uint32 GetTileTrackStatus(uint tile, int mode)
|
|
276 |
{
|
|
277 |
return _tile_type_procs[GET_TILETYPE(tile)]->get_tile_track_status_proc(tile, mode);
|
|
278 |
}
|
|
279 |
|
|
280 |
void ChangeTileOwner(uint tile, byte old_player, byte new_player)
|
|
281 |
{
|
|
282 |
_tile_type_procs[GET_TILETYPE(tile)]->change_tile_owner_proc(tile, old_player, new_player);
|
|
283 |
}
|
|
284 |
|
|
285 |
void GetAcceptedCargo(uint tile, AcceptedCargo *ac)
|
|
286 |
{
|
|
287 |
memset(ac, 0, sizeof(AcceptedCargo));
|
|
288 |
_tile_type_procs[GET_TILETYPE(tile)]->get_accepted_cargo_proc(tile, ac);
|
|
289 |
}
|
|
290 |
|
|
291 |
void AnimateTile(uint tile)
|
|
292 |
{
|
|
293 |
_tile_type_procs[GET_TILETYPE(tile)]->animate_tile_proc(tile);
|
|
294 |
}
|
|
295 |
|
|
296 |
void ClickTile(uint tile)
|
|
297 |
{
|
|
298 |
_tile_type_procs[GET_TILETYPE(tile)]->click_tile_proc(tile);
|
|
299 |
}
|
|
300 |
|
|
301 |
void DrawTile(TileInfo *ti)
|
|
302 |
{
|
|
303 |
_tile_type_procs[ti->type]->draw_tile_proc(ti);
|
|
304 |
}
|
|
305 |
|
|
306 |
void GetTileDesc(uint tile, TileDesc *td)
|
|
307 |
{
|
|
308 |
_tile_type_procs[GET_TILETYPE(tile)]->get_tile_desc_proc(tile, td);
|
|
309 |
}
|
|
310 |
|
|
311 |
/* Clear a piece of landscape
|
|
312 |
* p1 = 0,
|
|
313 |
* p2 = 0
|
|
314 |
*/
|
|
315 |
|
|
316 |
int32 CmdLandscapeClear(int x, int y, uint32 flags, uint32 p1, uint32 p2)
|
|
317 |
{
|
|
318 |
uint tile;
|
|
319 |
SET_EXPENSES_TYPE(EXPENSES_CONSTRUCTION);
|
|
320 |
|
|
321 |
tile = TILE_FROM_XY(x,y);
|
|
322 |
return _tile_type_procs[GET_TILETYPE(tile)]->clear_tile_proc(tile, flags);
|
|
323 |
}
|
|
324 |
|
|
325 |
// p1 = end tile
|
|
326 |
int32 CmdClearArea(int ex, int ey, uint32 flags, uint32 p1, uint32 p2)
|
|
327 |
{
|
|
328 |
int32 cost,ret, money;
|
|
329 |
int sx,sy;
|
|
330 |
int x,y;
|
|
331 |
bool success = false;
|
|
332 |
|
|
333 |
// make sure sx,sy are smaller than ex,ey
|
|
334 |
sx = GET_TILE_X(p1)*16;
|
|
335 |
sy = GET_TILE_Y(p1)*16;
|
|
336 |
if (ex < sx) intswap(ex, sx);
|
|
337 |
if (ey < sy) intswap(ey, sy);
|
|
338 |
|
|
339 |
money = GetAvailableMoneyForCommand();
|
|
340 |
cost = 0;
|
|
341 |
|
|
342 |
for(x=sx; x<=ex; x+=16) {
|
|
343 |
for(y=sy; y<=ey; y+=16) {
|
|
344 |
ret = DoCommandByTile(TILE_FROM_XY(x,y), 0, 0, flags &~DC_EXEC, CMD_LANDSCAPE_CLEAR);
|
|
345 |
if (ret == CMD_ERROR) continue;
|
|
346 |
cost += ret;
|
|
347 |
success = true;
|
|
348 |
|
|
349 |
if (flags & DC_EXEC) {
|
|
350 |
if ( ret>0 && (money -= ret) < 0) {
|
|
351 |
_additional_cash_required = ret;
|
|
352 |
return cost - ret;
|
|
353 |
}
|
|
354 |
DoCommandByTile(TILE_FROM_XY(x,y), 0, 0, flags, CMD_LANDSCAPE_CLEAR);
|
|
355 |
|
|
356 |
// draw explosion animation...
|
|
357 |
if ((x==sx || x==ex) && (y==sy || y==ey)) {
|
|
358 |
// big explosion in each corner, or small explosion for single tiles
|
|
359 |
CreateEffectVehicleAbove(x + 8,y + 8, 2, sy==ey && sx==ex ? EV_DEMOLISH : EV_CRASHED_SMOKE);
|
|
360 |
}
|
|
361 |
}
|
|
362 |
}
|
|
363 |
}
|
|
364 |
|
|
365 |
if (!success)
|
|
366 |
cost = CMD_ERROR;
|
|
367 |
return cost;
|
|
368 |
}
|
|
369 |
|
|
370 |
|
|
371 |
/* utility function used to modify a tile */
|
|
372 |
void CDECL ModifyTile(uint tile, uint flags, ...)
|
|
373 |
{
|
|
374 |
va_list va;
|
|
375 |
int i;
|
|
376 |
|
|
377 |
va_start(va, flags);
|
|
378 |
|
|
379 |
if ((i = (flags >> 8) & 0xF) != 0) {
|
|
380 |
_map_type_and_height[tile] = (_map_type_and_height[tile]&~0xF0)|((i-1) << 4);
|
|
381 |
}
|
|
382 |
|
|
383 |
if (flags & (MP_MAP2_CLEAR | MP_MAP2)) {
|
|
384 |
int x = 0;
|
|
385 |
if (flags & MP_MAP2) x = va_arg(va, int);
|
|
386 |
_map2[tile] = x;
|
|
387 |
}
|
|
388 |
|
|
389 |
if (flags & (MP_MAP3LO_CLEAR | MP_MAP3LO)) {
|
|
390 |
int x = 0;
|
|
391 |
if (flags & MP_MAP3LO) x = va_arg(va, int);
|
|
392 |
_map3_lo[tile] = x;
|
|
393 |
}
|
|
394 |
|
|
395 |
if (flags & (MP_MAP3HI_CLEAR | MP_MAP3HI)) {
|
|
396 |
int x = 0;
|
|
397 |
if (flags & MP_MAP3HI) x = va_arg(va, int);
|
|
398 |
_map3_hi[tile] = x;
|
|
399 |
}
|
|
400 |
|
|
401 |
if (flags & (MP_MAPOWNER|MP_MAPOWNER_CURRENT)) {
|
|
402 |
byte x = _current_player;
|
|
403 |
if (flags & MP_MAPOWNER) x = va_arg(va, int);
|
|
404 |
_map_owner[tile] = x;
|
|
405 |
}
|
|
406 |
|
|
407 |
if (flags & MP_MAP5) {
|
|
408 |
_map5[tile] = va_arg(va, int);
|
|
409 |
}
|
|
410 |
|
|
411 |
va_end(va);
|
|
412 |
|
|
413 |
if (!(flags & MP_NODIRTY))
|
|
414 |
MarkTileDirtyByTile(tile);
|
|
415 |
}
|
|
416 |
|
|
417 |
void SetMapExtraBits(uint tile, byte bits)
|
|
418 |
{
|
|
419 |
_map_extra_bits[tile >> 2] &= ~(3 << ((tile&3)*2));
|
|
420 |
_map_extra_bits[tile >> 2] |= (bits&3) << ((tile&3)*2);
|
|
421 |
}
|
|
422 |
|
|
423 |
uint GetMapExtraBits(uint tile)
|
|
424 |
{
|
|
425 |
return (_map_extra_bits[tile >> 2] >> (tile&3)*2)&3;
|
|
426 |
}
|
|
427 |
|
|
428 |
#define TILELOOP_BITS 4
|
|
429 |
#define TILELOOP_SIZE (1 << TILELOOP_BITS)
|
|
430 |
#define TILELOOP_ASSERTMASK ((TILELOOP_SIZE-1) + ((TILELOOP_SIZE-1) << TILE_X_BITS))
|
|
431 |
#define TILELOOP_CHKMASK (((1 << (TILE_X_BITS - TILELOOP_BITS))-1) << TILELOOP_BITS)
|
|
432 |
|
|
433 |
void RunTileLoop()
|
|
434 |
{
|
|
435 |
uint tile;
|
|
436 |
uint count;
|
|
437 |
|
|
438 |
tile = _cur_tileloop_tile;
|
|
439 |
|
|
440 |
assert( (tile & ~TILELOOP_ASSERTMASK) == 0);
|
|
441 |
count = (TILES_X/TILELOOP_SIZE) * (TILES_Y/TILELOOP_SIZE);
|
|
442 |
do {
|
|
443 |
_tile_type_procs[GET_TILETYPE(tile)]->tile_loop_proc(tile);
|
|
444 |
|
|
445 |
if ( GET_TILE_X(tile) < TILES_X - TILELOOP_SIZE) {
|
|
446 |
tile += TILELOOP_SIZE; /* no overflow */
|
|
447 |
} else {
|
|
448 |
tile = TILE_MASK(tile - TILELOOP_SIZE * (TILES_X/TILELOOP_SIZE-1) + TILE_XY(0, TILELOOP_SIZE)); /* x would overflow, also increase y */
|
|
449 |
}
|
|
450 |
} while (--count);
|
|
451 |
assert( (tile & ~TILELOOP_ASSERTMASK) == 0);
|
|
452 |
|
|
453 |
tile += 9;
|
|
454 |
if (tile & TILELOOP_CHKMASK)
|
|
455 |
tile = (tile + TILES_X) & TILELOOP_ASSERTMASK;
|
|
456 |
_cur_tileloop_tile = tile;
|
|
457 |
}
|
|
458 |
|
|
459 |
void InitializeLandscape()
|
|
460 |
{
|
|
461 |
int i;
|
|
462 |
|
|
463 |
memset(_map_owner, OWNER_NONE, sizeof(_map_owner));
|
|
464 |
memset(_map2, 0, sizeof(_map2));
|
|
465 |
memset(_map3_lo, 0, sizeof(_map3_lo));
|
|
466 |
memset(_map3_hi, 0, sizeof(_map3_hi));
|
|
467 |
memset(_map_extra_bits, 0, sizeof(_map_extra_bits));
|
|
468 |
memset(_map_type_and_height, MP_WATER << 4, sizeof(_map_type_and_height));
|
|
469 |
|
|
470 |
for(i=0; i!=TILES_Y-1; i++)
|
|
471 |
memset(_map_type_and_height + i*TILES_X, 0, TILES_X-1);
|
|
472 |
|
|
473 |
memset(_map5, 3, sizeof(_map5));
|
|
474 |
}
|
|
475 |
|
|
476 |
void ConvertGroundTilesIntoWaterTiles()
|
|
477 |
{
|
|
478 |
uint tile = 0;
|
|
479 |
int h;
|
|
480 |
|
|
481 |
while(true) {
|
|
482 |
if (IS_TILETYPE(tile, MP_CLEAR) && GetTileSlope(tile, &h) == 0 && h == 0) {
|
|
483 |
_map_type_and_height[tile] = MP_WATER << 4;
|
|
484 |
_map5[tile] = 0;
|
|
485 |
_map_owner[tile] = OWNER_WATER;
|
|
486 |
}
|
|
487 |
tile++;
|
|
488 |
if (GET_TILE_X(tile) == TILE_X_MAX) {
|
|
489 |
tile += TILE_XY(-TILE_X_MAX, 1);
|
|
490 |
if (GET_TILE_Y(tile) == TILE_Y_MAX)
|
|
491 |
break;
|
|
492 |
}
|
|
493 |
}
|
|
494 |
}
|
|
495 |
|
|
496 |
static const byte _genterrain_tbl_1[5] = { 10, 22, 33, 37, 4 };
|
|
497 |
static const byte _genterrain_tbl_2[5] = { 0, 0, 0, 0, 33 };
|
|
498 |
|
|
499 |
static void GenerateTerrain(int type, int flag)
|
|
500 |
{
|
|
501 |
uint32 r;
|
|
502 |
int x,y;
|
|
503 |
int w,h;
|
|
504 |
byte *p,*tile;
|
|
505 |
byte direction;
|
|
506 |
|
|
507 |
r = Random();
|
|
508 |
p = GetSpritePtr((((r >> 24) * _genterrain_tbl_1[type]) >> 8) + _genterrain_tbl_2[type] + 4845);
|
|
509 |
|
|
510 |
x = r & TILE_X_MAX;
|
|
511 |
y = (r >> TILE_X_BITS) & TILE_Y_MAX;
|
|
512 |
|
|
513 |
|
|
514 |
if (x < 2 || y < 2)
|
|
515 |
return;
|
|
516 |
|
|
517 |
direction = (byte)(r >> 22) & 3;
|
|
518 |
w = p[2];
|
|
519 |
h = p[1];
|
|
520 |
if (direction & 1) { w = p[1]; h = p[2]; }
|
|
521 |
p += 8;
|
|
522 |
|
|
523 |
if (flag & 4) {
|
|
524 |
if (!(flag & 2)) {
|
|
525 |
if (!(flag & 1)) {
|
|
526 |
if (x + y > 190)
|
|
527 |
return;
|
|
528 |
} else {
|
|
529 |
if (y < 30 + x)
|
|
530 |
return;
|
|
531 |
}
|
|
532 |
} else {
|
|
533 |
if (!(flag & 1)) {
|
|
534 |
if (x + y < 256)
|
|
535 |
return;
|
|
536 |
} else {
|
|
537 |
if (x < 30 + y)
|
|
538 |
return;
|
|
539 |
}
|
|
540 |
}
|
|
541 |
}
|
|
542 |
|
|
543 |
if (x + w >= TILE_X_MAX-1)
|
|
544 |
return;
|
|
545 |
|
|
546 |
if (y + h >= TILE_Y_MAX-1)
|
|
547 |
return;
|
|
548 |
|
|
549 |
tile = &_map_type_and_height[TILE_XY(x,y)];
|
|
550 |
|
|
551 |
if (direction == 0) {
|
|
552 |
do {
|
|
553 |
int w_cur = w;
|
|
554 |
byte *tile_cur = tile;
|
|
555 |
do {
|
|
556 |
if (*p >= *tile_cur) *tile_cur = *p;
|
|
557 |
p++;
|
|
558 |
tile_cur++;
|
|
559 |
} while (--w_cur != 0);
|
|
560 |
tile += TILE_XY(0,1);
|
|
561 |
} while (--h != 0);
|
|
562 |
} else if (direction == 1) {
|
|
563 |
do {
|
|
564 |
int h_cur = h;
|
|
565 |
byte *tile_cur = tile;
|
|
566 |
do {
|
|
567 |
if (*p >= *tile_cur) *tile_cur = *p;
|
|
568 |
p++;
|
|
569 |
tile_cur+=TILE_XY(0,1);
|
|
570 |
} while (--h_cur != 0);
|
|
571 |
tile++;
|
|
572 |
} while (--w != 0);
|
|
573 |
} else if (direction == 2) {
|
|
574 |
tile += w - 1;
|
|
575 |
do {
|
|
576 |
int w_cur = w;
|
|
577 |
byte *tile_cur = tile;
|
|
578 |
do {
|
|
579 |
if (*p >= *tile_cur) *tile_cur = *p;
|
|
580 |
p++;
|
|
581 |
tile_cur--;
|
|
582 |
} while (--w_cur != 0);
|
|
583 |
tile += TILE_XY(0,1);
|
|
584 |
} while (--h != 0);
|
|
585 |
} else {
|
|
586 |
tile += (h - 1) * TILE_XY(0,1);
|
|
587 |
do {
|
|
588 |
int h_cur = h;
|
|
589 |
byte *tile_cur = tile;
|
|
590 |
do {
|
|
591 |
if (*p >= *tile_cur) *tile_cur = *p;
|
|
592 |
p++;
|
|
593 |
tile_cur-=TILE_XY(0,1);
|
|
594 |
} while (--h_cur != 0);
|
|
595 |
tile++;
|
|
596 |
} while (--w != 0);
|
|
597 |
}
|
|
598 |
}
|
|
599 |
|
|
600 |
|
|
601 |
#include "table/genland.h"
|
|
602 |
|
|
603 |
static void CreateDesertOrRainForest()
|
|
604 |
{
|
|
605 |
uint tile;
|
|
606 |
const TileIndexDiff *data;
|
|
607 |
byte mt;
|
|
608 |
int i;
|
|
609 |
|
|
610 |
tile = 0;
|
|
611 |
do {
|
|
612 |
data = _make_desert_or_rainforest_data;
|
|
613 |
do {
|
|
614 |
if ((i = *data++) == MDORD_LAST) {
|
|
615 |
SetMapExtraBits(tile, 1);
|
|
616 |
break;
|
|
617 |
}
|
|
618 |
mt = _map_type_and_height[tile + i];
|
|
619 |
} while ((mt & 0xC) == 0 && (mt >> 4) != MP_WATER);
|
|
620 |
} while (++tile != TILES_X*TILES_Y);
|
|
621 |
|
|
622 |
for(i=0; i!=256; i++)
|
|
623 |
RunTileLoop();
|
|
624 |
|
|
625 |
tile = 0;
|
|
626 |
do {
|
|
627 |
data = _make_desert_or_rainforest_data;
|
|
628 |
do {
|
|
629 |
if ((i = *data++) == MDORD_LAST) {
|
|
630 |
SetMapExtraBits(tile, 2);
|
|
631 |
break;
|
|
632 |
}
|
|
633 |
} while ( !IS_TILETYPE(tile+i, MP_CLEAR) || (_map5[tile + i]&0x1C) != 0x14);
|
|
634 |
} while (++tile != TILES_X*TILES_Y);
|
|
635 |
}
|
|
636 |
|
|
637 |
void GenerateLandscape()
|
|
638 |
{
|
|
639 |
int i,flag;
|
|
640 |
uint32 r;
|
|
641 |
|
|
642 |
if (_opt.landscape == LT_HILLY) {
|
|
643 |
i = ((Random() & 0x7F) + 950) * LANDSCAPE_SIZE_FACTOR;
|
|
644 |
do {
|
|
645 |
GenerateTerrain(2, 0);
|
|
646 |
} while (--i);
|
|
647 |
|
|
648 |
r = Random();
|
|
649 |
flag = (r & 3) | 4;
|
|
650 |
i = (((r >> 16) & 0x7F) + 450) * LANDSCAPE_SIZE_FACTOR;
|
|
651 |
do {
|
|
652 |
GenerateTerrain(4, flag);
|
|
653 |
} while (--i);
|
|
654 |
} else if (_opt.landscape == LT_DESERT) {
|
|
655 |
i = ((Random()&0x7F) + 170) * LANDSCAPE_SIZE_FACTOR;
|
|
656 |
do {
|
|
657 |
GenerateTerrain(0, 0);
|
|
658 |
} while (--i);
|
|
659 |
|
|
660 |
r = Random();
|
|
661 |
flag = (r & 3) | 4;
|
|
662 |
i = (((r >> 16) & 0xFF) + 1700) * LANDSCAPE_SIZE_FACTOR;
|
|
663 |
do {
|
|
664 |
GenerateTerrain(0, flag);
|
|
665 |
} while (--i);
|
|
666 |
|
|
667 |
flag ^= 2;
|
|
668 |
|
|
669 |
i = ((Random() & 0x7F) + 410) * LANDSCAPE_SIZE_FACTOR;
|
|
670 |
do {
|
|
671 |
GenerateTerrain(3, flag);
|
|
672 |
} while (--i);
|
|
673 |
} else {
|
|
674 |
i = ((Random() & 0x7F) + (3 - _opt.diff.quantity_sea_lakes)*256 + 100) * LANDSCAPE_SIZE_FACTOR;
|
|
675 |
do {
|
|
676 |
GenerateTerrain(_opt.diff.terrain_type, 0);
|
|
677 |
} while (--i);
|
|
678 |
}
|
|
679 |
|
|
680 |
ConvertGroundTilesIntoWaterTiles();
|
|
681 |
|
|
682 |
if (_opt.landscape == LT_DESERT)
|
|
683 |
CreateDesertOrRainForest();
|
|
684 |
}
|
|
685 |
|
|
686 |
void OnTick_Town();
|
|
687 |
void OnTick_Trees();
|
|
688 |
void OnTick_Station();
|
|
689 |
void OnTick_Industry();
|
|
690 |
|
|
691 |
void OnTick_Players();
|
|
692 |
void OnTick_Train();
|
|
693 |
|
|
694 |
void CallLandscapeTick()
|
|
695 |
{
|
|
696 |
OnTick_Town();
|
|
697 |
OnTick_Trees();
|
|
698 |
OnTick_Station();
|
|
699 |
OnTick_Industry();
|
|
700 |
|
|
701 |
OnTick_Players();
|
|
702 |
OnTick_Train();
|
|
703 |
}
|
|
704 |
|
|
705 |
TileIndex AdjustTileCoordRandomly(TileIndex a, byte rng)
|
|
706 |
{
|
|
707 |
int rn = rng;
|
|
708 |
uint32 r = Random();
|
|
709 |
|
|
710 |
return TILE_XY(
|
|
711 |
GET_TILE_X(a) + ((byte)r * rn * 2 >> 8) - rn,
|
|
712 |
GET_TILE_Y(a) + ((byte)(r>>8) * rn * 2 >> 8) - rn
|
|
713 |
);
|
|
714 |
}
|
|
715 |
|
|
716 |
uint TileAddWrap(TileIndex tile, int add)
|
|
717 |
{
|
|
718 |
uint t = tile + add;
|
|
719 |
if (t < TILES_X * TILE_Y_MAX && GET_TILE_X(t) != TILE_X_MAX)
|
|
720 |
return t;
|
|
721 |
return TILE_WRAPPED;
|
|
722 |
}
|
|
723 |
|
|
724 |
bool IsValidTile(uint tile)
|
|
725 |
{
|
|
726 |
return (tile < TILES_X * TILE_Y_MAX && GET_TILE_X(tile) != TILE_X_MAX);
|
|
727 |
}
|