1

#include "stdafx.h"

     2

#include "ttd.h"

     3

#include "table/strings.h"

     4

#include "map.h"

     5

#include "tile.h"

     6

#include "viewport.h"

     7

#include "command.h"

     8

#include "town.h"

     9

#include "sound.h"

    10

    11

static int GetRandomTreeType(TileIndex tile, uint seed)

    12

{

    13

	switch (_opt.landscape) {

    14

		case LT_NORMAL:

    15

			return seed * 12 >> 8;

    16

    17

		case LT_HILLY:

    18

			return (seed >> 5) + 12;

    19

    20

		case LT_DESERT:

    21

			switch (GetMapExtraBits(tile)) {

    22

				case 0:

    23

					return (seed >> 6) + 28;

    24

    25

				case 1:

    26

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

    27

    28

				default:

    29

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

    30

			}

    31

    32

		default:

    33

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

    34

	}

    35

}

    36

    37

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

    38

{

    39

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

    40

	byte m5;

    41

    42

	if (tree >= 0) {

    43

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

    44

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

    45

    46

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

    47

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

    48

    49

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

    50

		_map3_hi[tile] = 0;		// no hedge

    51

    52

		// above snowline?

    54

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

    55

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

    56

		}

    57

		else

    58

		{

    59

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

    60

		}

    61

    62

    63

		// make it tree class

    64

		SetTileType(tile, MP_TREES);

    65

	}

    66

}

    67

    68

static void DoPlaceMoreTrees(uint tile)

    69

{

    70

	int i = 1000;

    71

	int x,y;

    72

	uint cur_tile;

    73

	int dist;

    74

    75

	do {

    76

		uint32 r = Random();

    77

		x = (r & 0x1F) - 16;

    78

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

    79

    80

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

    81

    82

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

    83

    84

		/* Only on tiles within 13 squares from tile,

    85

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

    86

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

    87

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

    88

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

    89

		}

    90

	} while (--i);

    91

}

    92

    93

static void PlaceMoreTrees(void)

    94

{

    95

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

    96

	do {

    97

		DoPlaceMoreTrees(TILE_MASK(Random()));

    98

	} while (--i);

    99

}

   100

   101

void PlaceTreesRandomly(void)

   102

{

   103

	int i;

   104

	uint32 r;

   105

	uint tile;

   106

   107

	i = ScaleByMapSize(1000);

   108

	do {

   109

		r = Random();

   110

		tile = TILE_MASK(r);

   111

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

   112

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

   113

			PlaceTree(tile, r, 0);

   114

		}

   115

	} while (--i);

   116

   117

	/* place extra trees at rainforest area */

   118

	if (_opt.landscape == LT_DESERT) {

   119

		i = ScaleByMapSize(15000);

   120

   121

		do {

   122

			r = Random();

   123

			tile = TILE_MASK(r);

   124

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

   125

				PlaceTree(tile, r, 0);

   126

			}

   127

		} while (--i);

   128

	}

   129

}

   130

   131

void GenerateTrees(void)

   132

{

   133

	int i;

   134

   135

	if (_opt.landscape != LT_CANDY) {

   136

		PlaceMoreTrees();

   137

	}

   138

   139

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

   140

	do {

   141

		PlaceTreesRandomly();

   142

	} while (--i);

   143

}

   144

   145

/* Plant a tree

   146

 * p1 = tree type, -1 means random.

   147

 * p2 = end tile

   148

 */

   149

   150

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

   151

{

   152

	int32 cost;

   153

	int sx;

   154

	int sy;

   155

	int x;

   156

	int y;

   157

   158

	if (p2 >= MapSize()) return CMD_ERROR;

   159

   160

	SET_EXPENSES_TYPE(EXPENSES_OTHER);

   161

   162

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

   163

	sx = TileX(p2) * 16;

   164

	sy = TileY(p2) * 16;

   165

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

   166

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

   167

   168

	cost = 0; // total cost

   169

   170

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

   171

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

   172

			TileInfo ti;

   173

   174

			FindLandscapeHeight(&ti, x, y);

   175

			if (!EnsureNoVehicle(ti.tile))

   176

				continue;

   177

   178

			switch (ti.type) {

   179

				case MP_TREES:

   180

					// no more space for trees?

   181

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

   182

						_error_message = STR_2803_TREE_ALREADY_HERE;

   183

						continue;

   184

					}

   185

   186

					if (flags & DC_EXEC) {

   187

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

   188

						MarkTileDirtyByTile(ti.tile);

   189

					}

   190

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

   191

					cost += _price.build_trees * 2;

   192

					break;

   193

   194

				case MP_CLEAR:

   195

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

   196

						_error_message = STR_2804_SITE_UNSUITABLE;

   197

						continue;

   198

					}

   199

   200

					// it's expensive to clear farmland

   201

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

   202

						cost += _price.clear_3;

   203

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

   204

						cost += _price.clear_2;

   205

   206

					if (flags & DC_EXEC) {

   207

						int treetype;

   208

						int m2;

   209

   210

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

   211

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

   212

							if (t != NULL)

   213

								ChangeTownRating(t, RATING_TREE_UP_STEP, RATING_TREE_MAXIMUM);

   214

						}

   215

   216

						switch (ti.map5 & 0x1C) {

   217

							case 0x04:

   218

								m2 = 16;

   219

								break;

   220

   221

							case 0x10:

   222

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

   223

								break;

   224

   225

							default:

   226

								m2 = 0;

   227

								break;

   228

						}

   229

   230

						treetype = p1;

   231

						if (treetype == -1) {

   232

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

   233

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

   234

						}

   235

   236

						ModifyTile(ti.tile,

   237

							MP_SETTYPE(MP_TREES) |

   238

							MP_MAP2 | MP_MAP3LO | MP_MAP3HI_CLEAR | MP_MAP5,

   239

							m2, /* map2 */

   240

							treetype, /* map3lo */

   241

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

   242

						);

   243

   244

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

   245

							SetMapExtraBits(ti.tile, 2);

   246

					}

   247

					cost += _price.build_trees;

   248

					break;

   249

   250

				default:

   251

					_error_message = STR_2804_SITE_UNSUITABLE;

   252

					break;

   253

			}

   254

		}

   255

	}

   256

   257

	if (cost == 0) return CMD_ERROR;

   258

	return cost;

   259

}

   260

   261

typedef struct TreeListEnt {

   262

	uint32 image;

   263

	byte x,y;

   264

} TreeListEnt;

   265

   266

   267

#include "table/tree_land.h"

   268

   269

   270

static void DrawTile_Trees(TileInfo *ti)

   271

{

   272

	uint16 m2;

   273

	const uint32 *s;

   274

	const byte *d;

   275

	byte z;

   276

	TreeListEnt te[4];

   277

   278

	m2 = _map2[ti->tile];

   279

   280

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

   281

		DrawClearLandTile(ti, 3);

   282

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

   283

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

   284

	} else {

   285

		DrawHillyLandTile(ti);

   286

	}

   287

   288

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

   289

   290

	z = ti->z;

   291

	if (ti->tileh != 0) {

   292

		z += 4;

   293

		if (ti->tileh & 0x10)

   294

			z += 4;

   295

	}

   296

   297

	{

   298

		uint16 tmp = ti->x;

   299

		uint index;

   300

   301

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

   302

		tmp -= ti->y;

   303

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

   304

		tmp -= ti->x;

   305

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

   306

		tmp += ti->y;

   307

   308

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

   309

   310

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

   311

   312

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

   313

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

   314

			index += 164 - 48;

   315

   316

		assert(index < lengthof(_tree_layout_sprite));

   317

		s = _tree_layout_sprite[index];

   318

	}

   319

   320

	StartSpriteCombine();

   321

   322

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

   323

	{

   324

		int i;

   325

   326

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

   327

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

   328

		do {

   329

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

   330

			if (_display_opt & DO_TRANS_BUILDINGS)

   331

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

   332

			te[i].image = image;

   333

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

   334

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

   335

			s++;

   336

			d+=2;

   337

		} while (i);

   338

   339

		/* draw them in a sorted way */

   340

		for(;;) {

   341

			byte min = 0xFF;

   342

			TreeListEnt *tep = NULL;

   343

   344

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

   345

			do {

   346

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

   347

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

   348

					tep = &te[i];

   349

				}

   350

			} while (i);

   351

   352

			if (tep == NULL)

   353

				break;

   354

   355

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

   356

			tep->image = 0;

   357

		}

   358

	}

   359

   360

	EndSpriteCombine();

   361

}

   362

   363

   364

static uint GetSlopeZ_Trees(TileInfo *ti) {

   365

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

   366

}

   367

   368

static uint GetSlopeTileh_Trees(TileInfo *ti) {

   369

	return ti->tileh;

   370

}

   371

   372

static int32 ClearTile_Trees(uint tile, byte flags) {

   373

	int num;

   374

   375

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

   376

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

   377

		if (t != NULL)

   378

			ChangeTownRating(t, RATING_TREE_DOWN_STEP, RATING_TREE_MINIMUM);

   379

	}

   380

   381

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

   382

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

   383

		num <<= 2;

   384

   385

	if (flags & DC_EXEC)

   386

		DoClearSquare(tile);

   387

   388

	return num * _price.remove_trees;

   389

}

   390

   391

static void GetAcceptedCargo_Trees(uint tile, AcceptedCargo ac)

   392

{

   393

	/* not used */

   394

}

   395

   396

static void GetTileDesc_Trees(uint tile, TileDesc *td)

   397

{

   398

	byte b;

   399

	StringID str;

   400

   401

	td->owner = _map_owner[tile];

   402

   403

	b = _map3_lo[tile];

   404

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

   405

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

   406

	(str=STR_280E_TREES, true);

   407

	td->str = str;

   408

}

   409

   410

static void AnimateTile_Trees(uint tile)

   411

{

   412

	/* not used */

   413

}

   414

   415

static SoundFx _desert_sounds[] = {

   416

	SND_42_LOON_BIRD,

   417

	SND_43_LION,

   418

	SND_44_MONKEYS,

   419

	SND_48_DISTANT_BIRD

   420

};

   421

   422

static void TileLoopTreesDesert(uint tile)

   423

{

   424

	byte b;

   425

   426

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

   427

		uint32 r;

   428

   429

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

   430

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

   431

		}

   432

	} else if (b == 1) {

   433

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

   434

			_map2[tile] &= 0xF;

   435

			_map2[tile] |= 0xE0;

   436

			MarkTileDirtyByTile(tile);

   437

		}

   438

	}

   439

}

   440

   441

static void TileLoopTreesAlps(uint tile)

   442

{

   443

	byte tmp, m2;

   444

	int k;

   445

   446

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

   447

	k = GetTileZ(tile) - _opt.snow_line;

   448

   449

	tmp = _map5[tile] & 0xF0;

   450

   451

	if (k < -8) {

   452

		/* snow_m2_down */

   453

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

   454

			return;

   455

		m2 = 0;

   456

	} else if (k == -8) {

   457

		/* snow_m1 */

   458

		m2 = 0x20;

   459

		if (tmp == m2)

   460

			return;

   461

	} else if (k < 8) {

   462

		/* snow_0 */

   463

		m2 = 0x60;

   464

		if (tmp == m2)

   465

			return;

   466

	} else if (k == 8) {

   467

		/* snow_p1 */

   468

		m2 = 0xA0;

   469

		if (tmp == m2)

   470

			return;

   471

	} else {

   472

		/* snow_p2_up */

   473

		if (tmp == 0xC0) {

   474

			uint32 r;

   475

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

   476

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

   477

			}

   478

			return;

   479

		} else {

   480

			m2 = 0xE0;

   481

		}

   482

	}

   483

   484

	_map2[tile] &= 0xF;

   485

	_map2[tile] |= m2;

   486

	MarkTileDirtyByTile(tile);

   487

}

   488

   489

static void TileLoop_Trees(uint tile)

   490

{

   491

	byte m5;

   492

	uint16 m2;

   493

   494

	static const TileIndexDiffC _tileloop_trees_dir[] = {

   495

		{-1, -1},

   496

		{ 0, -1},

   497

		{ 1, -1},

   498

		{-1,  0},

   499

		{ 1,  0},

   500

		{-1,  1},

   501

		{ 0,  1},

   502

		{ 1,  1}

   503

	};

   504

   505

	if (_opt.landscape == LT_DESERT) {

   506

		TileLoopTreesDesert(tile);

   507

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

   508

		TileLoopTreesAlps(tile);

   509

	}

   510

   511

	TileLoopClearHelper(tile);

   512

   513