1

#include "stdafx.h"

     2

#include "openttd.h"

     3

#include "table/strings.h"

     4

#include "table/tree_land.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

    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

    70

{

    71

	int i = 1000;

    72

	int x,y;

    73

	int dist;

    74

    75

	do {

    76

		uint32 r = Random();

    79

		x = (r & 0x1F) - 16;

    80

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

    81

    82

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

    83

    84

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

    85

    86

		/* Only on tiles within 13 squares from tile,

    87

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

    88

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

    89

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

    90

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

    91

		}

    92

	} while (--i);

    93

}

    94

    95

static void PlaceMoreTrees(void)

    96

{

    97

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

    98

	do {

    99

		DoPlaceMoreTrees(TILE_MASK(Random()));

   100

	} while (--i);

   101

}

   102

   103

void PlaceTreesRandomly(void)

   104

{

   105

	int i;

   106

	uint32 r;

   108

   109

	i = ScaleByMapSize(1000);

   110

	do {

   111

		r = Random();

   112

		tile = TILE_MASK(r);

   113

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

   114

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

   115

			PlaceTree(tile, r, 0);

   116

		}

   117

	} while (--i);

   118

   119

	/* place extra trees at rainforest area */

   120

	if (_opt.landscape == LT_DESERT) {

   121

		i = ScaleByMapSize(15000);

   122

   123

		do {

   124

			r = Random();

   125

			tile = TILE_MASK(r);

   126

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

   127

				PlaceTree(tile, r, 0);

   128

			}

   129

		} while (--i);

   130

	}

   131

}

   132

   133

void GenerateTrees(void)

   134

{

   135

	int i;

   136

   137

	if (_opt.landscape != LT_CANDY) {

   138

		PlaceMoreTrees();

   139

	}

   140

   141

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

   142

	do {

   143

		PlaceTreesRandomly();

   144

	} while (--i);

   145

}

   146

   147

/** Plant a tree.

   148

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

   149

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

   150

 * @param p2 end tile of area-drag

   151

 */

   152

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

   153

{

   154

	int32 cost;

   155

	int sx;

   156

	int sy;

   157

	int x;

   158

	int y;

   159

   160

	if (p2 > MapSize()) return CMD_ERROR;

   161

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

   162

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

   163

   164

	SET_EXPENSES_TYPE(EXPENSES_OTHER);

   165

   166

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

   167

	sx = TileX(p2) * 16;

   168

	sy = TileY(p2) * 16;

   169

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

   170

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

   171

   172

	cost = 0; // total cost

   173

   174

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

   175

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

   176

			TileInfo ti;

   177

   178

			FindLandscapeHeight(&ti, x, y);

   179

			if (!EnsureNoVehicle(ti.tile))

   180

				continue;

   181

   182

			switch (ti.type) {

   183

				case MP_TREES:

   184

					// no more space for trees?

   185

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

   186

						_error_message = STR_2803_TREE_ALREADY_HERE;

   187

						continue;

   188

					}

   189

   190

					if (flags & DC_EXEC) {

   191

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

   192

						MarkTileDirtyByTile(ti.tile);

   193

					}

   194

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

   195

					cost += _price.build_trees * 2;

   196

					break;

   197

   198

				case MP_CLEAR:

   199

					if (!IsTileOwner(ti.tile, OWNER_NONE)) {

   200

						_error_message = STR_2804_SITE_UNSUITABLE;

   201

						continue;

   202

					}

   203

   204

					// it's expensive to clear farmland

   205

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

   206

						cost += _price.clear_3;

   207

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

   208

						cost += _price.clear_2;

   209

   210

					if (flags & DC_EXEC) {

   211

						int treetype;

   212

						int m2;

   213

   214

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

   215

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

   216

							if (t != NULL)

   217

								ChangeTownRating(t, RATING_TREE_UP_STEP, RATING_TREE_MAXIMUM);

   218

						}

   219

   220

						switch (ti.map5 & 0x1C) {

   221

							case 0x04:

   222

								m2 = 16;

   223

								break;

   224

   225

							case 0x10:

   226

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

   227

								break;

   228

   229

							default:

   230

								m2 = 0;

   231

								break;

   232

						}

   233

   234

						treetype = p1;

   235

						if (treetype == -1) {

   236

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

   237

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

   238

						}

   239

   240

						ModifyTile(ti.tile,

   241

							MP_SETTYPE(MP_TREES) |

   242

							MP_MAP2 | MP_MAP3LO | MP_MAP3HI_CLEAR | MP_MAP5,

   243

							m2, /* map2 */

   244

							treetype, /* map3lo */

   245

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

   246

						);

   247

   248

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

   249

							SetMapExtraBits(ti.tile, 2);

   250

					}

   251

					cost += _price.build_trees;

   252

					break;

   253

   254

				default:

   255

					_error_message = STR_2804_SITE_UNSUITABLE;

   256

					break;

   257

			}

   258

		}

   259

	}

   260

   261

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

   262

}

   263

   264

typedef struct TreeListEnt {

   265

	uint32 image;

   266

	byte x,y;

   267

} TreeListEnt;

   268

   269

static void DrawTile_Trees(TileInfo *ti)

   270

{

   271

	uint16 m2;

   272

	const uint32 *s;

   273

	const byte *d;

   274

	byte z;

   275

	TreeListEnt te[4];

   276

   277

	m2 = _map2[ti->tile];

   278

   279

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

   280

		DrawClearLandTile(ti, 3);

   281

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

   282

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

   283

	} else {

   284

		DrawHillyLandTile(ti);

   285

	}

   286

   287

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

   288

   289

	z = ti->z;

   290

	if (ti->tileh != 0) {

   291

		z += 4;

   292

		if (ti->tileh & 0x10)

   293

			z += 4;

   294

	}

   295

   296

	{

   297

		uint16 tmp = ti->x;

   298

		uint index;

   299

   300

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

   301

		tmp -= ti->y;

   302

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

   303

		tmp -= ti->x;

   304

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

   305

		tmp += ti->y;

   306

   307

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

   308

   309

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

   310

   311

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

   312

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

   313

			index += 164 - 48;

   314

   315

		assert(index < lengthof(_tree_layout_sprite));

   316

		s = _tree_layout_sprite[index];

   317

	}

   318

   319

	StartSpriteCombine();

   320

   321

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

   322

	{

   323

		int i;

   324

   325

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

   326

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

   327

		do {

   328

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

   329

			if (_display_opt & DO_TRANS_BUILDINGS)

   330

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

   331

			te[i].image = image;

   332

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

   333

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

   334

			s++;

   335

			d+=2;

   336

		} while (i);

   337

   338

		/* draw them in a sorted way */

   339

		for(;;) {

   340

			byte min = 0xFF;

   341

			TreeListEnt *tep = NULL;

   342

   343

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

   344

			do {

   345

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

   346

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

   347

					tep = &te[i];

   348

				}

   349

			} while (i);

   350

   351

			if (tep == NULL)

   352

				break;

   353

   354

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

   355

			tep->image = 0;

   356

		}

   357

	}

   358

   359

	EndSpriteCombine();

   360

}

   361

   362

   363

static uint GetSlopeZ_Trees(TileInfo *ti) {

   364

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

   365

}

   366

   367

static uint GetSlopeTileh_Trees(TileInfo *ti) {

   368

	return ti->tileh;

   369

}

   370

   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

   392

{

   393

	/* not used */

   394

}

   395

   397

{

   398

	byte b;

   399

	StringID str;

   400

   401

	td->owner = GetTileOwner(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

   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

   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

   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

   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

	}