3

#include "stdafx.h"

     4

#include "openttd.h"

     5

#include "table/strings.h"

     6

#include "table/sprites.h"

     7

#include "table/tree_land.h"

     8

#include "functions.h"

     9

#include "map.h"

    10

#include "tile.h"

    11

#include "viewport.h"

    12

#include "command.h"

    13

#include "town.h"

    14

#include "sound.h"

    15

#include "variables.h"

    16

    17

static int GetRandomTreeType(TileIndex tile, uint seed)

    18

{

    19

	switch (_opt.landscape) {

    20

		case LT_NORMAL:

    21

			return seed * 12 >> 8;

    22

    23

		case LT_HILLY:

    24

			return (seed >> 5) + 12;

    25

    26

		case LT_DESERT:

    27

			switch (GetMapExtraBits(tile)) {

    28

				case 0:  return (seed >> 6) + 28;

    29

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

    30

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

    31

			}

    32

    33

		default:

    34

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

    35

	}

    36

}

    37

    38

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

    39

{

    40

	int tree = GetRandomTreeType(tile, GB(r, 24, 8));

    41

	byte m5;

    42

    43

	if (tree >= 0) {

    44

		SetTileType(tile, MP_TREES);

    45

    46

		m5 = GB(r, 16, 8);

    47

		if (GB(m5, 0, 3) == 7) m5--; // there is no growth state 7

    48

    49

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

    50

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

    51

    52

		_m[tile].m3 = tree;		// set type of tree

    53

		_m[tile].m4 = 0;		// no hedge

    54

    55

		// above snowline?

    56

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

    57

			_m[tile].m2 = 0xE0;	// set land type to snow

    58

			_m[tile].m2 |= GB(r, 24, 3); // randomize counter

    59

		} else {

    60

			_m[tile].m2 = GB(r, 24, 5); // randomize counter and ground

    61

		}

    62

	}

    63

}

    64

    65

static void DoPlaceMoreTrees(TileIndex tile)

    66

{

    67

	uint i;

    68

    69

	for (i = 0; i < 1000; i++) {

    70

		uint32 r = Random();

    71

		int x = GB(r, 0, 5) - 16;

    72

		int y = GB(r, 8, 5) - 16;

    73

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

    74

		TileIndex cur_tile = TILE_MASK(tile + TileDiffXY(x, y));

    75

    76

		/* Only on tiles within 13 squares from tile,

    77

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

    78

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

    79

			 (_m[cur_tile].m5 & 0x1F) != 0x0F && (_m[cur_tile].m5 & 0x1C) != 8) {

    80

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

    81

		}

    82

	}

    83

}

    84

    85

static void PlaceMoreTrees(void)

    86

{

    87

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

    88

	do {

    89

		DoPlaceMoreTrees(RandomTile());

    90

	} while (--i);

    91

}

    92

    93

void PlaceTreesRandomly(void)

    94

{

    95

	uint i;

    96

    97

	i = ScaleByMapSize(1000);

    98

	do {

    99

		uint32 r = Random();

   100

		TileIndex tile = RandomTileSeed(r);

   101

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

   102

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

   103

			PlaceTree(tile, r, 0);

   104

		}

   105

	} while (--i);

   106

   107

	/* place extra trees at rainforest area */

   108

	if (_opt.landscape == LT_DESERT) {

   109

		i = ScaleByMapSize(15000);

   110

   111

		do {

   112

			uint32 r = Random();

   113

			TileIndex tile = RandomTileSeed(r);

   114

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

   115

				PlaceTree(tile, r, 0);

   116

			}

   117

		} while (--i);

   118

	}

   119

}

   120

   121

void GenerateTrees(void)

   122

{

   123

	uint i;

   124

   125

	if (_opt.landscape != LT_CANDY) PlaceMoreTrees();

   126

   127

	for (i = _opt.landscape == LT_HILLY ? 15 : 6; i != 0; i--) {

   128

		PlaceTreesRandomly();

   129

	}

   130

}

   131

   132

/** Plant a tree.

   133

 * @param x,y start tile of area-drag of tree plantation

   134

 * @param p1 tree type, -1 means random.

   135

 * @param p2 end tile of area-drag

   136

 */

   137

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

   138

{

   139

	int32 cost;

   140

	int sx, sy, x, y;

   141

   142

	if (p2 > MapSize()) return CMD_ERROR;

   143

	/* Check the tree type. It can be random or some valid value within the current climate */

   144

	if (p1 != (uint)-1 && p1 - _tree_base_by_landscape[_opt.landscape] >= _tree_count_by_landscape[_opt.landscape]) return CMD_ERROR;

   145

   146

	SET_EXPENSES_TYPE(EXPENSES_OTHER);

   147

   148

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

   149

	sx = TileX(p2);

   150

	sy = TileY(p2);

   151

	ex /= 16; ey /= 16;

   152

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

   153

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

   154

   155

	cost = 0; // total cost

   156

   157

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

   158

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

   159

			TileIndex tile = TileXY(x, y);

   160

   161

			if (!EnsureNoVehicle(tile)) continue;

   162

   163

			switch (GetTileType(tile)) {

   164

				case MP_TREES:

   165

					// no more space for trees?

   166

					if (_game_mode != GM_EDITOR && (_m[tile].m5 & 0xC0) == 0xC0) {

   167

						_error_message = STR_2803_TREE_ALREADY_HERE;

   168

						continue;

   169

					}

   170

   171

					if (flags & DC_EXEC) {

   172

						_m[tile].m5 += 0x40;

   173

						MarkTileDirtyByTile(tile);

   174

					}

   175

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

   176

					cost += _price.build_trees * 2;

   177

					break;

   178

   179

				case MP_CLEAR:

   180

					if (!IsTileOwner(tile, OWNER_NONE)) {

   181

						_error_message = STR_2804_SITE_UNSUITABLE;

   182

						continue;

   183

					}

   184

   185

					// it's expensive to clear farmland

   186

					if ((_m[tile].m5 & 0x1F) == 0xF)

   187

						cost += _price.clear_3;

   188

					else if ((_m[tile].m5 & 0x1C) == 8)

   189

						cost += _price.clear_2;

   190

   191

					if (flags & DC_EXEC) {

   192

						int treetype;

   193

						int m2;

   194

   195

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

   196

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

   197

							if (t != NULL)

   198

								ChangeTownRating(t, RATING_TREE_UP_STEP, RATING_TREE_MAXIMUM);

   199

						}

   200

   201

						switch (_m[tile].m5 & 0x1C) {

   202

							case 0x04:

   203

								m2 = 16;

   204

								break;

   205

   206

							case 0x10:

   207

								m2 = ((_m[tile].m5 & 3) << 6) | 0x20;

   208

								break;

   209

   210

							default:

   211

								m2 = 0;

   212

								break;

   213

						}

   214

   215

						treetype = p1;

   216

						if (treetype == -1) {

   217

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

   218

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

   219

						}

   220

   221

						ModifyTile(tile,

   222

							MP_SETTYPE(MP_TREES) |

   223

							MP_MAP2 | MP_MAP3LO | MP_MAP3HI_CLEAR | MP_MAP5,

   224

							m2, /* map2 */

   225

							treetype, /* map3lo */

   226

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

   227

						);

   228

   229

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

   230

							SetMapExtraBits(tile, 2);

   231

					}

   232

					cost += _price.build_trees;

   233

					break;

   234

   235

				default:

   236

					_error_message = STR_2804_SITE_UNSUITABLE;

   237

					break;

   238

			}

   239

		}

   240

	}

   241

   242

	return (cost == 0) ? CMD_ERROR : cost;

   243

}

   244

   245

typedef struct TreeListEnt {

   246

	uint32 image;

   247

	byte x,y;

   248

} TreeListEnt;

   249

   250

static void DrawTile_Trees(TileInfo *ti)

   251

{

   252

	uint16 m2;

   253

	const uint32 *s;

   254

	const byte *d;

   255

	byte z;

   256

   257

	m2 = _m[ti->tile].m2;

   258

   259

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

   260

		DrawClearLandTile(ti, 3);

   261

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

   262

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

   263

	} else {

   264

		DrawHillyLandTile(ti);

   265

	}

   266

   267

	DrawClearLandFence(ti, _m[ti->tile].m4 >> 2);

   268

   269

	z = ti->z;

   270

	if (ti->tileh != 0) {

   271

		z += 4;

   272

		if (IsSteepTileh(ti->tileh))

   273

			z += 4;

   274

	}

   275

   276

	{

   277

		uint16 tmp = ti->x;

   278

		uint index;

   279

   280

		tmp = ROR(tmp, 2);

   281

		tmp -= ti->y;

   282

		tmp = ROR(tmp, 3);

   283

		tmp -= ti->x;

   284

		tmp = ROR(tmp, 1);

   285

		tmp += ti->y;

   286

   287

		d = _tree_layout_xy[GB(tmp, 4, 2)];

   288

   289

		index = GB(tmp, 6, 2) + (_m[ti->tile].m3 << 2);

   290

   291

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

   292

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

   293

			index += 164 - 48;

   294

   295

		assert(index < lengthof(_tree_layout_sprite));

   296

		s = _tree_layout_sprite[index];

   297

	}

   298

   299

	StartSpriteCombine();

   300

   301

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

   302

		TreeListEnt te[4];

   303

		uint i;

   304

   305

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

   306

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

   307

		do {

   308

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

   309

			if (_display_opt & DO_TRANS_BUILDINGS)

   310

				MAKE_TRANSPARENT(image);

   311

			te[i].image = image;

   312

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

   313

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

   314

			s++;

   315

			d += 2;

   316

		} while (i);

   317

   318

		/* draw them in a sorted way */

   319

		for(;;) {

   320

			byte min = 0xFF;

   321

			TreeListEnt *tep = NULL;

   322

   323

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

   324

			do {

   325

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

   326

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

   327

					tep = &te[i];

   328

				}

   329

			} while (i);

   330

   331

			if (tep == NULL) break;

   332

   333

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

   334

			tep->image = 0;

   335

		}

   336

	}

   337

   338

	EndSpriteCombine();

   339

}

   340

   341

   342

static uint GetSlopeZ_Trees(TileInfo *ti) {

   343

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

   344

}

   345

   346

static uint GetSlopeTileh_Trees(TileInfo *ti) {

   347

	return ti->tileh;

   348

}

   349

   350

static int32 ClearTile_Trees(TileIndex tile, byte flags)

   351

{

   352

	int num;

   353

   354

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

   355

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

   356

		if (t != NULL)

   357

			ChangeTownRating(t, RATING_TREE_DOWN_STEP, RATING_TREE_MINIMUM);

   358

	}

   359

   360

	num = (_m[tile].m5 >> 6) + 1;

   361

	if ( (byte)(_m[tile].m3-0x14) <= (0x1A-0x14))

   362

		num <<= 2;

   363

   364

	if (flags & DC_EXEC)

   365

		DoClearSquare(tile);

   366

   367

	return num * _price.remove_trees;

   368

}

   369

   370

static void GetAcceptedCargo_Trees(TileIndex tile, AcceptedCargo ac)

   371

{

   372

	/* not used */

   373

}

   374

   375

static void GetTileDesc_Trees(TileIndex tile, TileDesc *td)

   376

{

   377

	byte b;

   378

	StringID str;

   379

   380

	td->owner = GetTileOwner(tile);

   381

   382

	b = _m[tile].m3;

   383

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

   384

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

   385

	(str=STR_280E_TREES, true);

   386

	td->str = str;

   387

}

   388

   389

static void AnimateTile_Trees(TileIndex tile)

   390

{

   391

	/* not used */

   392

}

   393

   394

static SoundFx _desert_sounds[] = {

   395

	SND_42_LOON_BIRD,

   396

	SND_43_LION,

   397

	SND_44_MONKEYS,

   398

	SND_48_DISTANT_BIRD

   399

};

   400

   401

static void TileLoopTreesDesert(TileIndex tile)

   402

{

   403

	byte b;

   404

   405

	b = GetMapExtraBits(tile);

   406

	if (b == 2) {

   407

		uint32 r = Random();

   408

   409

		if (CHANCE16I(1,200, r)) SndPlayTileFx(_desert_sounds[GB(r, 16, 2)], tile);

   410

	} else if (b == 1) {

   411

		if ((_m[tile].m2 & 0x30) != 0x20) {

   412

			_m[tile].m2 &= 0xF;

   413

			_m[tile].m2 |= 0xE0;

   414

			MarkTileDirtyByTile(tile);

   415

		}

   416

	}

   417

}

   418

   419

static void TileLoopTreesAlps(TileIndex tile)

   420

{

   421

	byte tmp, m2;

   422

	int k;

   423

   424

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

   425

	k = GetTileZ(tile) - _opt.snow_line;

   426

   427

	tmp = _m[tile].m5 & 0xF0;

   428

   429

	if (k < -8) {

   430

		/* snow_m2_down */

   431

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

   432

		m2 = 0;

   433

	} else if (k == -8) {

   434

		/* snow_m1 */

   435

		m2 = 0x20;

   436

		if (tmp == m2) return;

   437

	} else if (k < 8) {

   438

		/* snow_0 */

   439

		m2 = 0x60;

   440

		if (tmp == m2) return;

   441

	} else if (k == 8) {

   442

		/* snow_p1 */

   443

		m2 = 0xA0;

   444

		if (tmp == m2) return;

   445

	} else {

   446

		/* snow_p2_up */

   447

		if (tmp == 0xC0) {

   448

			uint32 r = Random();

   449

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

   450

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

   451

			}

   452

			return;

   453

		} else {

   454

			m2 = 0xE0;

   455

		}

   456

	}

   457

   458

	_m[tile].m2 &= 0xF;

   459

	_m[tile].m2 |= m2;

   460

	MarkTileDirtyByTile(tile);

   461

}

   462

   463

static void TileLoop_Trees(TileIndex tile)

   464

{

   465

	byte m5;

   466

	uint16 m2;

   467

   468

	static const TileIndexDiffC _tileloop_trees_dir[] = {

   469

		{-1, -1},

   470

		{ 0, -1},

   471

		{ 1, -1},

   472

		{-1,  0},

   473

		{ 1,  0},

   474

		{-1,  1},

   475

		{ 0,  1},

   476

		{ 1,  1}

   477

	};

   478

   479

	if (_opt.landscape == LT_DESERT) {

   480

		TileLoopTreesDesert(tile);

   481

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

   482

		TileLoopTreesAlps(tile);

   483

	}

   484

   485

	TileLoopClearHelper(tile);

   486

   487

	/* increase counter */

   488

	{

   489

		uint16 m2 = _m[tile].m2;

   490

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

   491

		if ((m2 & 0xF) != 0) return;

   492

	}

   493

   494

	m5 = _m[tile].m5;

   495

	if (GB(m5, 0, 3) == 3) {

   496

		/* regular sized tree */

   497

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

   498

			m5++; /* start destructing */