1

#include "stdafx.h"

     2

#include "ttd.h"

     3

#include "table/strings.h"

     5

#include "map.h"

     6

#include "tile.h"

     7

#include "viewport.h"

     8

#include "command.h"

     9

#include "town.h"

    10

#include "sound.h"

    11

    12

static int GetRandomTreeType(TileIndex tile, uint seed)

    13

{

    14

	switch (_opt.landscape) {

    15

		case LT_NORMAL:

    16

			return seed * 12 >> 8;

    17

    18

		case LT_HILLY:

    19

			return (seed >> 5) + 12;

    20

    21

		case LT_DESERT:

    22

			switch (GetMapExtraBits(tile)) {

    23

				case 0:

    24

					return (seed >> 6) + 28;

    25

    26

				case 1:

    27

					return (seed > 12) ? -1 : 27;

    28

    29

				default:

    30

					return (seed * 7 >> 8) + 20;

    31

			}

    32

    33

		default:

    34

			return (seed * 9 >> 8) + 32;

    35

	}

    36

}

    37

    38

static void PlaceTree(uint tile, uint32 r, byte m5_or)

    39

{

    40

	int tree = GetRandomTreeType(tile, (r >> 24));

    41

	byte m5;

    42

    43

	if (tree >= 0) {

    44

		m5 = (byte)(r >> 16);

    45

		if ((m5 & 0x7) == 7) m5--; // there is no growth state 7

    46

    47

		_map5[tile] = m5 & 0x07;	// growth state;

    48

		_map5[tile] |=  m5 & 0xC0;	// amount of trees

    49

    50

		_map3_lo[tile] = tree;		// set type of tree

    51

		_map3_hi[tile] = 0;		// no hedge

    52

    53

		// above snowline?

    54

		if (_opt.landscape == LT_HILLY && GetTileZ(tile) > _opt.snow_line) {

    55

			_map2[tile] = 0xE0;	// set land type to snow

    56

			_map2[tile] |= (byte)(r >> 24)&0x07; // randomize counter

    57

		}

    58

		else

    59

		{

    60

			_map2[tile] = (byte)(r >> 24)&0x1F; // randomize counter and ground

    61

		}

    62

    63

    64

		// make it tree class

    65

		SetTileType(tile, MP_TREES);

    66

	}

    67

}

    68

    69

static void DoPlaceMoreTrees(uint tile)

    70

{

    71

	int i = 1000;

    72

	int x,y;

    73

	uint cur_tile;

    74

	int dist;

    75

    76

	do {

    77

		uint32 r = Random();

    78

		x = (r & 0x1F) - 16;

    79

		y = ((r>>8) & 0x1F) - 16;

    80

    81

		dist = myabs(x) + myabs(y);

    82

    83

		cur_tile = TILE_MASK(tile + TILE_XY(x,y));

    84

    85

		/* Only on tiles within 13 squares from tile,

    86

		    on clear tiles, and NOT on farm-tiles or rocks */

    87

		if (dist <= 13 && IsTileType(cur_tile, MP_CLEAR) &&

    88

			 (_map5[cur_tile] & 0x1F) != 0x0F && (_map5[cur_tile] & 0x1C) != 8) {

    89

			PlaceTree(cur_tile, r, dist <= 6 ? 0xC0 : 0);

    90

		}

    91

	} while (--i);

    92

}

    93

    94

static void PlaceMoreTrees(void)

    95

{

    96

	int i = ScaleByMapSize((Random() & 0x1F) + 25);

    97

	do {

    98

		DoPlaceMoreTrees(TILE_MASK(Random()));

    99

	} while (--i);

   100

}

   101

   102

void PlaceTreesRandomly(void)

   103

{

   104

	int i;

   105

	uint32 r;

   106

	uint tile;

   107

   108

	i = ScaleByMapSize(1000);

   109

	do {

   110

		r = Random();

   111

		tile = TILE_MASK(r);

   112

		/* Only on clear tiles, and NOT on farm-tiles or rocks */

   113

		if (IsTileType(tile, MP_CLEAR) && (_map5[tile] & 0x1F) != 0x0F && (_map5[tile] & 0x1C) != 8) {

   114

			PlaceTree(tile, r, 0);

   115

		}

   116

	} while (--i);

   117

   118

	/* place extra trees at rainforest area */

   119

	if (_opt.landscape == LT_DESERT) {

   120

		i = ScaleByMapSize(15000);

   121

   122

		do {

   123

			r = Random();

   124

			tile = TILE_MASK(r);

   125

			if (IsTileType(tile, MP_CLEAR) && GetMapExtraBits(tile) == 2) {

   126

				PlaceTree(tile, r, 0);

   127

			}

   128

		} while (--i);

   129

	}

   130

}

   131

   132

void GenerateTrees(void)

   133

{

   134

	int i;

   135

   136

	if (_opt.landscape != LT_CANDY) {

   137

		PlaceMoreTrees();

   138

	}

   139

   140

	i = _opt.landscape == LT_HILLY ? 15 : 6;

   141

	do {

   142

		PlaceTreesRandomly();

   143

	} while (--i);

   144

}

   145

   150

 */

   151

int32 CmdPlantTree(int ex, int ey, uint32 flags, uint32 p1, uint32 p2)

   152

{

   153

	int32 cost;

   154

	int sx;

   155

	int sy;

   156

	int x;

   157

	int y;

   158

   162

   163

	SET_EXPENSES_TYPE(EXPENSES_OTHER);

   164

   165

	// make sure sx,sy are smaller than ex,ey

   166

	sx = TileX(p2) * 16;

   167

	sy = TileY(p2) * 16;

   168

	if (ex < sx) intswap(ex, sx);

   169

	if (ey < sy) intswap(ey, sy);

   170

   171

	cost = 0; // total cost

   172

   173

	for (x = sx; x <= ex; x += 16) {

   174

		for (y = sy; y <= ey; y += 16) {

   175

			TileInfo ti;

   176

   177

			FindLandscapeHeight(&ti, x, y);

   178

			if (!EnsureNoVehicle(ti.tile))

   179

				continue;

   180

   181

			switch (ti.type) {

   182

				case MP_TREES:

   183

					// no more space for trees?

   184

					if (_game_mode != GM_EDITOR && (ti.map5 & 0xC0) == 0xC0) {

   185

						_error_message = STR_2803_TREE_ALREADY_HERE;

   186

						continue;

   187

					}

   188

   189

					if (flags & DC_EXEC) {

   190

						_map5[ti.tile] = ti.map5 + 0x40;

   191

						MarkTileDirtyByTile(ti.tile);

   192

					}

   193

					// 2x as expensive to add more trees to an existing tile

   194

					cost += _price.build_trees * 2;

   195

					break;

   196

   197

				case MP_CLEAR:

   198

					if (_map_owner[ti.tile] != OWNER_NONE) {

   199

						_error_message = STR_2804_SITE_UNSUITABLE;

   200

						continue;

   201

					}

   202

   203

					// it's expensive to clear farmland

   204

					if ((ti.map5 & 0x1F) == 0xF)

   205

						cost += _price.clear_3;

   206

					else if ((ti.map5 & 0x1C) == 8)

   207

						cost += _price.clear_2;

   208

   209

					if (flags & DC_EXEC) {

   210

						int treetype;

   211

						int m2;

   212

   213

						if (_game_mode != GM_EDITOR && _current_player < MAX_PLAYERS) {

   214

							Town *t = ClosestTownFromTile(ti.tile, _patches.dist_local_authority);

   215

							if (t != NULL)

   216

								ChangeTownRating(t, RATING_TREE_UP_STEP, RATING_TREE_MAXIMUM);

   217

						}

   218

   219

						switch (ti.map5 & 0x1C) {

   220

							case 0x04:

   221

								m2 = 16;

   222

								break;

   223

   224

							case 0x10:

   225

								m2 = ((ti.map5 & 3) << 6) | 0x20;

   226

								break;

   227

   228

							default:

   229

								m2 = 0;

   230

								break;

   231

						}

   232

   233

						treetype = p1;

   234

						if (treetype == -1) {

   235

							treetype = GetRandomTreeType(ti.tile, Random() >> 24);

   236

							if (treetype == -1) treetype = 27;

   237

						}

   238

   239

						ModifyTile(ti.tile,

   240

							MP_SETTYPE(MP_TREES) |

   241

							MP_MAP2 | MP_MAP3LO | MP_MAP3HI_CLEAR | MP_MAP5,

   242

							m2, /* map2 */

   243

							treetype, /* map3lo */

   244

							_game_mode == GM_EDITOR ? 3 : 0 /* map5 */

   245

						);

   246

   247

						if (_game_mode == GM_EDITOR && IS_BYTE_INSIDE(treetype, 0x14, 0x1B))

   248

							SetMapExtraBits(ti.tile, 2);

   249

					}

   250

					cost += _price.build_trees;

   251

					break;

   252

   253

				default:

   254

					_error_message = STR_2804_SITE_UNSUITABLE;

   255

					break;

   256

			}

   257

		}

   258

	}

   259

   261

}

   262

   263

typedef struct TreeListEnt {

   264

	uint32 image;

   265

	byte x,y;

   266

} TreeListEnt;

   267

   268

static void DrawTile_Trees(TileInfo *ti)

   269

{

   270

	uint16 m2;

   271

	const uint32 *s;

   272

	const byte *d;

   273

	byte z;

   274

	TreeListEnt te[4];

   275

   276

	m2 = _map2[ti->tile];

   277

   278

	if ( (m2&0x30) == 0) {

   279

		DrawClearLandTile(ti, 3);

   280

	} else if ((m2&0x30) == 0x20) {

   281

		DrawGroundSprite(_tree_sprites_1[m2 >> 6] + _tileh_to_sprite[ti->tileh]);

   282

	} else {

   283

		DrawHillyLandTile(ti);

   284

	}

   285

   286

	DrawClearLandFence(ti, _map3_hi[ti->tile] >> 2);

   287

   288

	z = ti->z;

   289

	if (ti->tileh != 0) {

   290

		z += 4;

   291

		if (ti->tileh & 0x10)

   292

			z += 4;

   293

	}

   294

   295

	{

   296

		uint16 tmp = ti->x;

   297

		uint index;

   298

   299

		tmp = (tmp >> 2) | (tmp << 14);

   300

		tmp -= ti->y;

   301

		tmp = (tmp >> 3) | (tmp << 13);

   302

		tmp -= ti->x;

   303

		tmp = (tmp >> 1) | (tmp << 15);

   304

		tmp += ti->y;

   305

   306

		d = _tree_layout_xy[(tmp & 0x30) >> 4];

   307

   308

		index = ((tmp>>6)&3) + (_map3_lo[ti->tile]<<2);

   309

   310

		/* different tree styles above one of the grounds */

   311

		if ((m2 & 0xB0) == 0xA0 && index >= 48 && index < 80)

   312

			index += 164 - 48;

   313

   314

		assert(index < lengthof(_tree_layout_sprite));

   315

		s = _tree_layout_sprite[index];

   316

	}

   317

   318

	StartSpriteCombine();

   319

   320

	if (!(_display_opt & DO_TRANS_BUILDINGS) || !_patches.invisible_trees)

   321

	{

   322

		int i;

   323

   324

		/* put the trees to draw in a list */

   325

		i = (ti->map5 >> 6) + 1;

   326

		do {

   327

			uint32 image = s[0] + (--i==0 ? (ti->map5 & 7) : 3);

   328

			if (_display_opt & DO_TRANS_BUILDINGS)

   329

				image = (image & 0x3FFF) | 0x3224000;

   330

			te[i].image = image;

   331

			te[i].x = d[0];

   332

			te[i].y = d[1];

   333

			s++;

   334

			d+=2;

   335

		} while (i);

   336

   337

		/* draw them in a sorted way */

   338

		for(;;) {

   339

			byte min = 0xFF;

   340

			TreeListEnt *tep = NULL;

   341

   342

			i = (ti->map5 >> 6) + 1;

   343

			do {

   344

				if (te[--i].image!=0 && (byte)(te[i].x + te[i].y) < min) {

   345

					min = te[i].x + te[i].y;

   346

					tep = &te[i];

   347

				}

   348

			} while (i);

   349

   350

			if (tep == NULL)

   351

				break;

   352

   353

			AddSortableSpriteToDraw(tep->image, ti->x + tep->x, ti->y + tep->y, 5, 5, 0x10, z);

   354

			tep->image = 0;

   355

		}

   356

	}

   357

   358

	EndSpriteCombine();

   359

}

   360

   361

   362

static uint GetSlopeZ_Trees(TileInfo *ti) {

   363

	return GetPartialZ(ti->x&0xF, ti->y&0xF, ti->tileh) + ti->z;

   364

}

   365

   366

static uint GetSlopeTileh_Trees(TileInfo *ti) {

   367

	return ti->tileh;

   368

}

   369

   370

static int32 ClearTile_Trees(uint tile, byte flags) {

   371

	int num;

   372

   373

	if (flags & DC_EXEC && _current_player < MAX_PLAYERS) {

   374

		Town *t = ClosestTownFromTile(tile, _patches.dist_local_authority);

   375

		if (t != NULL)

   376

			ChangeTownRating(t, RATING_TREE_DOWN_STEP, RATING_TREE_MINIMUM);

   377

	}

   378

   379

	num = (_map5[tile] >> 6) + 1;

   380

	if ( (byte)(_map3_lo[tile]-0x14) <= (0x1A-0x14))

   381

		num <<= 2;

   382

   383

	if (flags & DC_EXEC)

   384

		DoClearSquare(tile);

   385

   386

	return num * _price.remove_trees;

   387

}

   388

   389

static void GetAcceptedCargo_Trees(uint tile, AcceptedCargo ac)

   390

{

   391

	/* not used */

   392

}

   393

   394

static void GetTileDesc_Trees(uint tile, TileDesc *td)

   395

{

   396

	byte b;

   397

	StringID str;

   398

   399

	td->owner = _map_owner[tile];

   400

   401

	b = _map3_lo[tile];

   402

	(str=STR_2810_CACTUS_PLANTS, b==0x1B) ||

   403

	(str=STR_280F_RAINFOREST, IS_BYTE_INSIDE(b, 0x14, 0x1A+1)) ||

   404

	(str=STR_280E_TREES, true);

   405

	td->str = str;

   406

}

   407

   408

static void AnimateTile_Trees(uint tile)

   409

{

   410

	/* not used */

   411

}

   412

   413

static SoundFx _desert_sounds[] = {

   414

	SND_42_LOON_BIRD,

   415

	SND_43_LION,

   416

	SND_44_MONKEYS,

   417

	SND_48_DISTANT_BIRD

   418

};

   419

   420

static void TileLoopTreesDesert(uint tile)

   421

{

   422

	byte b;

   423

   424

	if ((b=GetMapExtraBits(tile)) == 2) {

   425

		uint32 r;

   426

   427

		if (CHANCE16I(1,200,r=Random())) {

   428

			SndPlayTileFx(_desert_sounds[(r >> 16) & 3], tile);

   429

		}

   430

	} else if (b == 1) {

   431

		if ((_map2[tile] & 0x30) != 0x20) {

   432

			_map2[tile] &= 0xF;

   433

			_map2[tile] |= 0xE0;

   434

			MarkTileDirtyByTile(tile);

   435

		}

   436

	}

   437

}

   438

   439

static void TileLoopTreesAlps(uint tile)

   440

{

   441

	byte tmp, m2;

   442

	int k;

   443

   444

	/* distance from snow line, in steps of 8 */

   445

	k = GetTileZ(tile) - _opt.snow_line;

   446

   447

	tmp = _map5[tile] & 0xF0;

   448

   449

	if (k < -8) {

   450

		/* snow_m2_down */

   451

		if ((tmp&0x30) != 0x20)

   452

			return;

   453

		m2 = 0;

   454

	} else if (k == -8) {

   455

		/* snow_m1 */

   456

		m2 = 0x20;

   457

		if (tmp == m2)

   458

			return;

   459

	} else if (k < 8) {

   460

		/* snow_0 */

   461

		m2 = 0x60;

   462

		if (tmp == m2)

   463

			return;

   464

	} else if (k == 8) {

   465

		/* snow_p1 */

   466

		m2 = 0xA0;

   467

		if (tmp == m2)

   468

			return;

   469

	} else {

   470

		/* snow_p2_up */

   471

		if (tmp == 0xC0) {

   472

			uint32 r;

   473

			if (CHANCE16I(1,200,r=Random())) {

   474

				SndPlayTileFx((r & 0x80000000) ? SND_39_HEAVY_WIND : SND_34_WIND, tile);

   475

			}

   476

			return;

   477

		} else {

   478

			m2 = 0xE0;

   479

		}

   480

	}

   481

   482

	_map2[tile] &= 0xF;

   483

	_map2[tile] |= m2;

   484

	MarkTileDirtyByTile(tile);

   485

}

   486

   487

static void TileLoop_Trees(uint tile)

   488

{

   489

	byte m5;

   490

	uint16 m2;

   491

   492

	static const TileIndexDiffC _tileloop_trees_dir[] = {

   493

		{-1, -1},

   494

		{ 0, -1},

   495

		{ 1, -1},

   496

		{-1,  0},

   497

		{ 1,  0},

   498

		{-1,  1},

   499

		{ 0,  1},

   500

		{ 1,  1}

   501

	};

   502

   503

	if (_opt.landscape == LT_DESERT) {

   504

		TileLoopTreesDesert(tile);

   505

	} else if (_opt.landscape == LT_HILLY) {

   506

		TileLoopTreesAlps(tile);

   507

	}

   508

   509

	TileLoopClearHelper(tile);

   510

   511

	/* increase counter */