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(uint tile, uint seed)

    12

{

    13

	byte i;

    14

    15

	if (_opt.landscape == LT_NORMAL) {

    16

		return seed * 12 >> 8;

    17

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

    18

		return (seed >> 5) + 12;

    19

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

    20

		i = GetMapExtraBits(tile);

    21

		if (i == 0) {

    22

			return (seed >> 6) + 28;

    23

		} else if (i == 1) {

    24

			if (seed > 12)

    25

				return -1;

    26

			return 27;

    27

		} else {

    28

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

    29

		}

    30

	} else {

    31

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

    32

	}

    33

}

    34

    35

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

    36

{

    37

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

    38

	byte m5;

    39

    40

	if (tree >= 0) {

    41

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

    42

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

    43

    44

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

    45

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

    46

    47

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

    48

		_map3_hi[tile] = 0;		// no hedge

    49

    50

		// above snowline?

    51

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

    52

		{

    53

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

    54

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

    55

		}

    56

		else

    57

		{

    58

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

    59

		}

    60

    61

    62

		// make it tree class

    63

		SetTileType(tile, MP_TREES);

    64

	}

    65

}

    66

    67

static void DoPlaceMoreTrees(uint tile)

    68

{

    69

	int i = 1000;

    70

	int x,y;

    71

	uint cur_tile;

    72

	int dist;

    73

    74

	do {

    75

		uint32 r = Random();

    76

		x = (r & 0x1F) - 16;

    77

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

    78

    79

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

    80

    81

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

    82

    83

		/* Only on tiles within 13 squares from tile,

    84

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

    85

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

    86

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

    87

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

    88

		}

    89

	} while (--i);

    90

}

    91

    92

static void PlaceMoreTrees(void)

    93

{

    94

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

    95

	do {

    96

		DoPlaceMoreTrees(TILE_MASK(Random()));

    97

	} while (--i);

    98

}

    99

   100

void PlaceTreesRandomly(void)

   101

{

   102

	int i;

   103

	uint32 r;

   104

	uint tile;

   105

   106

	i = ScaleByMapSize(1000);

   107

	do {

   108

		r = Random();

   109

		tile = TILE_MASK(r);

   110

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

   111

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

   112

			PlaceTree(tile, r, 0);

   113

		}

   114

	} while (--i);

   115

   116

	/* place extra trees at rainforest area */

   117

	if (_opt.landscape == LT_DESERT) {

   118

		i = ScaleByMapSize(15000);

   119

   120

		do {

   121

			r = Random();

   122

			tile = TILE_MASK(r);

   123

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

   124

				PlaceTree(tile, r, 0);

   125

			}

   126

		} while (--i);

   127

	}

   128

}

   129

   130

void GenerateTrees(void)

   131

{

   132

	int i;

   133

   134

	if (_opt.landscape != LT_CANDY) {

   135

		PlaceMoreTrees();

   136

	}

   137

   138

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

   139

	do {

   140

		PlaceTreesRandomly();

   141

	} while (--i);

   142

}

   143

   144

/* Plant a tree

   145

 * p1 = tree type, -1 means random.

   146

 * p2 = end tile

   147

 */

   148

   149

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

   150

{

   151

	TileInfo ti;

   152

	int32 cost;

   153

	int sx,sy,x,y;

   154

	int treetype;

   155

   156

	SET_EXPENSES_TYPE(EXPENSES_OTHER);

   157

   158

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

   159

	sx = TileX(p2) * 16;

   160

	sy = TileY(p2) * 16;

   161

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

   162

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

   163

   164

	cost = 0; // total cost

   165

   166

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

   167

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

   168

			FindLandscapeHeight(&ti, x, y);

   169

			if (!EnsureNoVehicle(ti.tile))

   170

				continue;

   171

   172

			if (ti.type == MP_TREES) {

   173

				// no more space for trees?

   174

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

   175

					_error_message = STR_2803_TREE_ALREADY_HERE;

   176

					continue;

   177

				}

   178

   179

				if (flags & DC_EXEC) {

   180

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

   181

					MarkTileDirtyByTile(ti.tile);

   182

				}

   183

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

   184

				cost += _price.build_trees * 2;

   185

			} else {

   186

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

   187

					_error_message = STR_2804_SITE_UNSUITABLE;

   188

					continue;

   189

				}

   190

   191

				// it's expensive to clear farmland

   192

				if ((ti.map5 & 0x1F) == 0xF) cost += _price.clear_3;

   193

				else if ((ti.map5 & 0x1C) == 8) cost += _price.clear_2;

   194

   195

				if (flags & DC_EXEC) {

   196

					int m2;

   197

   198

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

   199

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

   200

						if (t != NULL)

   201

							ChangeTownRating(t, RATING_TREE_UP_STEP, RATING_TREE_MAXIMUM);

   202

					}

   203

					m2 = 0;

   204

					if ( (ti.map5 & 0x1C) == 4 ) {

   205

						m2 = 16;

   206

					} else if ( (ti.map5 & 0x1C) == 16 ) {

   207

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

   208

					}

   209

   210

					treetype = p1;

   211

					if (treetype == -1) {

   212

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

   213

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

   214

					}

   215

   216

					ModifyTile(ti.tile,

   217

						MP_SETTYPE(MP_TREES) |

   218

						MP_MAP2 | MP_MAP3LO | MP_MAP3HI_CLEAR | MP_MAP5,

   219

						m2, /* map2 */

   220

						treetype, /* map3lo */

   221

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

   222

					);

   223

   224

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

   225

						SetMapExtraBits(ti.tile, 2);

   226

					}

   227

				}

   228

				cost += _price.build_trees;

   229

			}

   230

		}

   231

	}

   232

   233

	if (cost == 0) return CMD_ERROR;

   234

	return cost;

   235

}

   236

   237

typedef struct TreeListEnt {

   238

	uint32 image;

   239

	byte x,y;

   240

} TreeListEnt;

   241

   242

   243

#include "table/tree_land.h"

   244

   245

   246

static void DrawTile_Trees(TileInfo *ti)

   247

{

   248

	uint16 m2;

   249

	const uint32 *s;

   250

	const byte *d;

   251

	byte z;

   252

	TreeListEnt te[4];

   253

   254

	m2 = _map2[ti->tile];

   255

   256

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

   257

		DrawClearLandTile(ti, 3);

   258

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

   259

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

   260

	} else {

   261

		DrawHillyLandTile(ti);

   262

	}

   263

   264

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

   265

   266

	z = ti->z;

   267

	if (ti->tileh != 0) {

   268

		z += 4;

   269

		if (ti->tileh & 0x10)

   270

			z += 4;

   271

	}

   272

   273

	{

   274

		uint16 tmp = ti->x;

   275

		uint index;

   276

   277

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

   278

		tmp -= ti->y;

   279

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

   280

		tmp -= ti->x;

   281

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

   282

		tmp += ti->y;

   283

   284

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

   285

   286

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

   287

   288

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

   289

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

   290

			index += 164 - 48;

   291

   292

		assert(index < lengthof(_tree_layout_sprite));

   293

		s = _tree_layout_sprite[index];

   294

	}

   295

   296

	StartSpriteCombine();

   297

   298

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

   299

	{

   300

		int i;

   301

   302

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

   303

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

   304

		do {

   305

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

   306

			if (_display_opt & DO_TRANS_BUILDINGS)

   307

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

   308

			te[i].image = image;

   309

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

   310

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

   311

			s++;

   312

			d+=2;

   313

		} while (i);

   314

   315

		/* draw them in a sorted way */

   316

		for(;;) {

   317

			byte min = 0xFF;

   318

			TreeListEnt *tep = NULL;

   319

   320

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

   321

			do {

   322

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

   323

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

   324

					tep = &te[i];

   325

				}

   326

			} while (i);

   327

   328

			if (tep == NULL)

   329

				break;

   330

   331

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

   332

			tep->image = 0;

   333

		}

   334

	}

   335

   336

	EndSpriteCombine();

   337

}

   338

   339

   340

static uint GetSlopeZ_Trees(TileInfo *ti) {

   341

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

   342

}

   343

   344

static uint GetSlopeTileh_Trees(TileInfo *ti) {

   345

	return ti->tileh;

   346

}

   347

   348

static int32 ClearTile_Trees(uint tile, byte flags) {

   349

	int num;

   350

   351

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

   352

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

   353

		if (t != NULL)

   354

			ChangeTownRating(t, RATING_TREE_DOWN_STEP, RATING_TREE_MINIMUM);

   355

	}

   356

   357

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

   358

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

   359

		num <<= 2;

   360

   361

	if (flags & DC_EXEC)

   362

		DoClearSquare(tile);

   363

   364

	return num * _price.remove_trees;

   365

}

   366

   367

static void GetAcceptedCargo_Trees(uint tile, AcceptedCargo ac)

   368

{

   369

	/* not used */

   370

}

   371

   372

static void GetTileDesc_Trees(uint tile, TileDesc *td)

   373

{

   374

	byte b;

   375

	StringID str;

   376

   377

	td->owner = _map_owner[tile];

   378

   379

	b = _map3_lo[tile];

   380

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

   381

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

   382

	(str=STR_280E_TREES, true);

   383

	td->str = str;

   384

}

   385

   386

static void AnimateTile_Trees(uint tile)

   387

{

   388

	/* not used */

   389

}

   390

   391

static SoundFx _desert_sounds[] = {

   392

	SND_42_LOON_BIRD,

   393

	SND_43_LION,

   394

	SND_44_MONKEYS,

   395

	SND_48_DISTANT_BIRD

   396

};

   397

   398

static void TileLoopTreesDesert(uint tile)

   399

{

   400

	byte b;

   401

   402

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

   403

		uint32 r;

   404

   405

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

   406

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

   407

		}

   408

	} else if (b == 1) {

   409

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

   410

			_map2[tile] &= 0xF;

   411

			_map2[tile] |= 0xE0;

   412

			MarkTileDirtyByTile(tile);

   413

		}

   414

	}

   415

}

   416

   417

static void TileLoopTreesAlps(uint tile)

   418

{

   419

	byte tmp, m2;

   420

	int k;

   421

   422

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

   423

	k = GetTileZ(tile) - _opt.snow_line;

   424

   425

	tmp = _map5[tile] & 0xF0;

   426

   427

	if (k < -8) {

   428

		/* snow_m2_down */

   429

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

   430

			return;

   431

		m2 = 0;

   432

	} else if (k == -8) {

   433

		/* snow_m1 */

   434

		m2 = 0x20;

   435

		if (tmp == m2)

   436

			return;

   437

	} else if (k < 8) {

   438

		/* snow_0 */

   439

		m2 = 0x60;

   440

		if (tmp == m2)

   441

			return;

   442

	} else if (k == 8) {

   443

		/* snow_p1 */

   444

		m2 = 0xA0;

   445

		if (tmp == m2)

   446

			return;

   447

	} else {

   448

		/* snow_p2_up */

   449

		if (tmp == 0xC0) {

   450

			uint32 r;

   451

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

   452

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

   453

			}

   454

			return;

   455

		} else {

   456

			m2 = 0xE0;

   457

		}

   458

	}

   459

   460

	_map2[tile] &= 0xF;

   461

	_map2[tile] |= m2;

   462

	MarkTileDirtyByTile(tile);

   463

}

   464

   465

static void TileLoop_Trees(uint tile)

   466

{

   467

	byte m5;

   468

	uint16 m2;

   469

   470

	static const TileIndexDiffC _tileloop_trees_dir[] = {

   471

		{-1, -1},

   472

		{ 0, -1},

   473

		{ 1, -1},

   474

		{-1,  0},

   475

		{ 1,  0},

   476

		{-1,  1},

   477

		{ 0,  1},

   478

		{ 1,  1}

   479

	};

   480

   481

	if (_opt.landscape == LT_DESERT) {

   482

		TileLoopTreesDesert(tile);

   483

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

   484

		TileLoopTreesAlps(tile);

   485

	}

   486

   487

	TileLoopClearHelper(tile);

   488

   489

	/* increase counter */

   490

	{

   491

		uint16 m2 = _map2[tile];

   492

		_map2[tile] = m2 = (m2 & 0xF0) | ((m2+1)&0xF);

   493

		if (m2 & 0xF)

   494

			return;

   495

	}

   496

   497

	m5 = _map5[tile];

   498

	if ((m5&7) == 3) {

   499

		/* regular sized tree */

   500

		if (_opt.landscape == LT_DESERT && _map3_lo[tile]!=0x1B && GetMapExtraBits(tile)==1) {

   501

			m5++; /* start destructing */

   502

		} else {

   503

			switch(Random() & 0x7) {

   504

			case 0: /* start destructing */

   505

				m5++;

   506

				break;

   507

   508

			case 1: /* add a tree */

   509

				if (m5 < 0xC0) {

   510

					m5 = (m5 + 0x40) & ~7;

   511

					break;

   512

				}

   513

				/* fall through */

   514

   515

			case 2: { /* add a neighbouring tree */

   516

				byte m3 = _map3_lo[tile];

   517

   518

				tile += ToTileIndexDiff(_tileloop_trees_dir[Random() & 7]);

   519