1

/* $Id$ */

     2

     3

#include "stdafx.h"

     4

#include "openttd.h"

     6

#include "table/strings.h"

     7

#include "table/sprites.h"

     8

#include "table/tree_land.h"

     9

#include "functions.h"

    10

#include "map.h"

    11

#include "tile.h"

    12

#include "viewport.h"

    13

#include "command.h"

    14

#include "town.h"

    15

#include "sound.h"

    16

#include "variables.h"

    17

    18

static int GetRandomTreeType(TileIndex tile, uint seed)

    19

{

    20

	switch (_opt.landscape) {

    21

		case LT_NORMAL:

    22

			return seed * 12 >> 8;

    23

    24

		case LT_HILLY:

    25

			return (seed >> 5) + 12;

    26

    27

		case LT_DESERT:

    28

			switch (GetMapExtraBits(tile)) {

    29

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

    30

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

    31

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

    32

			}

    33

    34

		default:

    35

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

    36

	}

    37

}

    38

    39

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

    40

{

    41

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

    42

	byte m5;

    43

    44

	if (tree >= 0) {

    45

		SetTileType(tile, MP_TREES);

    46

    47

		m5 = GB(r, 16, 8);

    48

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

    49

    50

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

    51

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

    52

    53

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

    54

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

    55

    56

		// above snowline?

    57

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

    58

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

    59

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

    60

		} else {

    61

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

    62

		}

    63

	}

    64

}

    65

    66

static void DoPlaceMoreTrees(TileIndex tile)

    67

{

    68

	uint i;

    69

    70

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

    71

		uint32 r = Random();

    72

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

    73

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

    74

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

    75

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

    76

    81

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

    82

		}

    83

	}

    84

}

    85

    86

static void PlaceMoreTrees(void)

    87

{

    88

	uint i = ScaleByMapSize(GB(Random(), 0, 5) + 25);

    89

	do {

    90

		DoPlaceMoreTrees(RandomTile());

    91

	} while (--i);

    92

}

    93

    94

void PlaceTreesRandomly(void)

    95

{

    96

	uint i;

    97

    98

	i = ScaleByMapSize(1000);

    99

	do {

   100

		uint32 r = Random();

   101

		TileIndex tile = RandomTileSeed(r);

   105

			PlaceTree(tile, r, 0);

   106

		}

   107

	} while (--i);

   108

   109

	/* place extra trees at rainforest area */

   110

	if (_opt.landscape == LT_DESERT) {

   111

		i = ScaleByMapSize(15000);

   112

   113

		do {

   114

			uint32 r = Random();

   115

			TileIndex tile = RandomTileSeed(r);

   116

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

   117

				PlaceTree(tile, r, 0);

   118

			}

   119

		} while (--i);

   120

	}

   121

}

   122

   123

void GenerateTrees(void)

   124

{

   125

	uint i;

   126

   127

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

   128

   129

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

   130

		PlaceTreesRandomly();

   131

	}

   132

}

   133

   134

/** Plant a tree.

   135

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

   136

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

   137

 * @param p2 end tile of area-drag

   138

 */

   139

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

   140

{

   141

	int32 cost;

   142

	int sx, sy, x, y;

   143

   144

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

   145

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

   146

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

   147

   148

	SET_EXPENSES_TYPE(EXPENSES_OTHER);

   149

   150

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

   151

	sx = TileX(p2);

   152

	sy = TileY(p2);

   153

	ex /= 16; ey /= 16;

   154

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

   155

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

   156

   157

	cost = 0; // total cost

   158

   159

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

   160

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

   161

			TileIndex tile = TileXY(x, y);

   162

   163

			if (!EnsureNoVehicle(tile)) continue;

   164

   165

			switch (GetTileType(tile)) {

   166

				case MP_TREES:

   167

					// no more space for trees?

   168

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

   169

						_error_message = STR_2803_TREE_ALREADY_HERE;

   170

						continue;

   171

					}

   172

   173

					if (flags & DC_EXEC) {

   174

						_m[tile].m5 += 0x40;

   175

						MarkTileDirtyByTile(tile);

   176

					}

   177

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

   178

					cost += _price.build_trees * 2;

   179

					break;

   180

   181

				case MP_CLEAR:

   182

					if (!IsTileOwner(tile, OWNER_NONE)) {

   183

						_error_message = STR_2804_SITE_UNSUITABLE;

   184

						continue;

   185

					}

   186

   192

   193

					if (flags & DC_EXEC) {

   194

						int treetype;

   195

						int m2;

   196

   197

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

   198

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

   199

							if (t != NULL)

   200

								ChangeTownRating(t, RATING_TREE_UP_STEP, RATING_TREE_MAXIMUM);

   201

						}

   202

   207

						}

   208

   209

						treetype = p1;

   210

						if (treetype == -1) {

   211

							treetype = GetRandomTreeType(tile, GB(Random(), 24, 8));

   212

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

   213

						}

   214

   215

						ModifyTile(tile,

   216

							MP_SETTYPE(MP_TREES) |

   217

							MP_MAP2 | MP_MAP3LO | MP_MAP3HI_CLEAR | MP_MAP5,

   218

							m2, /* map2 */

   219

							treetype, /* map3lo */

   220

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

   221

						);

   222

   223

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

   224

							SetMapExtraBits(tile, 2);

   225

					}

   226

					cost += _price.build_trees;

   227

					break;

   228

   229

				default:

   230

					_error_message = STR_2804_SITE_UNSUITABLE;

   231

					break;

   232

			}

   233

		}

   234

	}

   235

   236

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

   237

}

   238

   239

typedef struct TreeListEnt {

   240

	uint32 image;

   241

	byte x,y;

   242

} TreeListEnt;

   243

   244

static void DrawTile_Trees(TileInfo *ti)

   245

{

   246

	uint16 m2;

   247

	const uint32 *s;

   248

	const TreePos* d;

   249

	byte z;

   250

   251

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

   252

   253

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

   254

		DrawClearLandTile(ti, 3);

   255

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

   256

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

   257

	} else {

   258

		DrawHillyLandTile(ti);

   259

	}

   260

   261

	DrawClearLandFence(ti);

   262

   263

	z = ti->z;

   264

	if (ti->tileh != 0) {

   265

		z += 4;

   266

		if (IsSteepTileh(ti->tileh))

   267

			z += 4;

   268

	}

   269

   270

	{

   271

		uint16 tmp = ti->x;

   272

		uint index;

   273

   274

		tmp = ROR(tmp, 2);

   275

		tmp -= ti->y;

   276

		tmp = ROR(tmp, 3);

   277

		tmp -= ti->x;

   278

		tmp = ROR(tmp, 1);

   279

		tmp += ti->y;

   280

   281

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

   282

   283

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

   284

   285

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

   286

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

   287

			index += 164 - 48;

   288

   289

		assert(index < lengthof(_tree_layout_sprite));

   290

		s = _tree_layout_sprite[index];

   291

	}

   292

   293

	StartSpriteCombine();

   294

   295

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

   296

		TreeListEnt te[4];

   297

		uint i;

   298

   299

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

   300

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

   301

		do {

   302

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

   303

			if (_display_opt & DO_TRANS_BUILDINGS) MAKE_TRANSPARENT(image);

   304

			te[i].image = image;

   305

			te[i].x = d->x;

   306

			te[i].y = d->y;

   307

			s++;

   308

			d++;

   309

		} while (i);

   310

   311

		/* draw them in a sorted way */

   312

		for (;;) {

   313

			byte min = 0xFF;

   314

			TreeListEnt *tep = NULL;

   315

   316

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

   317

			do {

   318

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

   319

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

   320

					tep = &te[i];

   321

				}

   322

			} while (i);

   323

   324

			if (tep == NULL) break;

   325

   326

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

   327

			tep->image = 0;

   328

		}

   329

	}

   330

   331

	EndSpriteCombine();

   332

}

   333

   334

   335

static uint GetSlopeZ_Trees(const TileInfo* ti)

   336

{

   337

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

   338

}

   339

   340

static uint GetSlopeTileh_Trees(const TileInfo* ti)

   341

{

   342

	return ti->tileh;

   343

}

   344

   345

static int32 ClearTile_Trees(TileIndex tile, byte flags)

   346

{

   347

	uint num;

   348

   349

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

   350

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

   351

		if (t != NULL)

   352

			ChangeTownRating(t, RATING_TREE_DOWN_STEP, RATING_TREE_MINIMUM);

   353

	}

   354

   355

	num = GB(_m[tile].m5, 6, 2) + 1;

   356

	if (IS_INT_INSIDE(_m[tile].m3, 20, 26 + 1)) num *= 4;

   357

   358

	if (flags & DC_EXEC) DoClearSquare(tile);

   359

   360

	return num * _price.remove_trees;

   361

}

   362

   363

static void GetAcceptedCargo_Trees(TileIndex tile, AcceptedCargo ac)

   364

{

   365

	/* not used */

   366

}

   367

   368

static void GetTileDesc_Trees(TileIndex tile, TileDesc *td)

   369

{

   370

	byte b;

   371

	StringID str;

   372

   373

	td->owner = GetTileOwner(tile);

   374

   375

	b = _m[tile].m3;

   376

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

   377

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

   378

	(str=STR_280E_TREES, true);

   379

	td->str = str;

   380

}

   381

   382

static void AnimateTile_Trees(TileIndex tile)

   383

{

   384

	/* not used */

   385

}

   386

   387

static void TileLoopTreesDesert(TileIndex tile)

   388

{

   389

	static const SoundFx forest_sounds[] = {

   390

		SND_42_LOON_BIRD,

   391

		SND_43_LION,

   392

		SND_44_MONKEYS,

   393

		SND_48_DISTANT_BIRD

   394

	};

   395

   396

	byte b = GetMapExtraBits(tile);

   397

   398

	if (b == 2) {

   399

		uint32 r = Random();

   400

   401

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

   402

	} else if (b == 1) {

   403

		if (GB(_m[tile].m2, 4, 2) != 2) {

   404

			SB(_m[tile].m2, 4, 2, 2);

   405

			SB(_m[tile].m2, 6, 2, 3);

   406

			MarkTileDirtyByTile(tile);

   407

		}

   408

	}

   409

}

   410

   411

static void TileLoopTreesAlps(TileIndex tile)

   412

{

   413

	byte tmp, m2;

   414

	int k;

   415

   416

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

   417

	k = GetTileZ(tile) - _opt.snow_line;

   418

   419

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

   420

   421

	if (k < -8) {

   422

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

   423

		m2 = 0; // no snow

   424

	} else if (k == -8) {

   425

		m2 = 0x20; // 1/4 snow

   426

		if (tmp == m2) return;

   427

	} else if (k == 0) {

   428

		m2 = 0x60;// 1/2 snow

   429

		if (tmp == m2) return;

   430

	} else if (k == 8) {

   431

		m2 = 0xA0; // 3/4 snow

   432

		if (tmp == m2) return;

   433

	} else {

   434

		if (tmp == 0xE0) {

   435

			uint32 r = Random();

   436

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

   437

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

   438

			}

   439

			return;

   440

		} else {

   441

			m2 = 0xE0; // full snow

   442

		}

   443

	}

   444

   445

	_m[tile].m2 &= 0xF;

   446

	_m[tile].m2 |= m2;

   447

	MarkTileDirtyByTile(tile);

   448

}

   449

   450

static void TileLoop_Trees(TileIndex tile)

   451

{

   452

	byte m5;

   453

   454

	static const TileIndexDiffC _tileloop_trees_dir[] = {

   455

		{-1, -1},

   456

		{ 0, -1},

   457

		{ 1, -1},

   458

		{-1,  0},

   459

		{ 1,  0},

   460

		{-1,  1},

   461

		{ 0,  1},

   462

		{ 1,  1}

   463

	};

   464

   465

	if (_opt.landscape == LT_DESERT) {

   466

		TileLoopTreesDesert(tile);

   467

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

   468

		TileLoopTreesAlps(tile);

   469

	}

   470

   471

	TileLoopClearHelper(tile);

   472

   473

	/* increase counter */

   474

	AB(_m[tile].m2, 0, 4, 1);

   475

	if (GB(_m[tile].m2, 0, 4) != 0) return;

   476

   477

	m5 = _m[tile].m5;

   478

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

   479

		/* regular sized tree */

   480

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

   481

			m5++; /* start destructing */

   482

		} else {

   483

			switch (GB(Random(), 0, 3)) {

   484

			case 0: /* start destructing */

   485

				m5++;

   486

				break;

   487

   488

			case 1: /* add a tree */

   489

				if (m5 < 0xC0) {

   490

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

   491

					break;

   492

				}

   493

				/* fall through */

   494

   495

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

   496

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