1

/* $Id$ */

     2

     3

/** @file town.h */

     4

     5

#ifndef TOWN_H

     6

#define TOWN_H

     7

     8

#include "oldpool.h"

     9

#include "player.h"

    10

#include "functions.h"

    11

#include "helpers.hpp"

    12

    13

enum {

    14

	HOUSE_NO_CLASS   = 0,

    15

	NEW_HOUSE_OFFSET = 110,

    16

	HOUSE_MAX        = 512,

    17

	INVALID_TOWN     = 0xFFFF,

    18

	INVALID_HOUSE_ID = 0xFFFF,

    19

    20

	/* There can only be as many classes as there are new houses, plus one for

    21

	 * NO_CLASS, as the original houses don't have classes. */

    22

	HOUSE_CLASS_MAX  = HOUSE_MAX - NEW_HOUSE_OFFSET + 1,

    23

};

    24

    25

enum BuildingFlags {

    26

	TILE_NO_FLAG         =       0,

    27

	TILE_SIZE_1x1        = 1U << 0,

    28

	TILE_NOT_SLOPED      = 1U << 1,

    29

	TILE_SIZE_2x1        = 1U << 2,

    30

	TILE_SIZE_1x2        = 1U << 3,

    31

	TILE_SIZE_2x2        = 1U << 4,

    32

	BUILDING_IS_ANIMATED = 1U << 5,

    33

	BUILDING_IS_CHURCH   = 1U << 6,

    34

	BUILDING_IS_STADIUM  = 1U << 7,

    35

	BUILDING_HAS_1_TILE  = TILE_SIZE_1x1 | TILE_SIZE_2x1 | TILE_SIZE_1x2 | TILE_SIZE_2x2,

    36

	BUILDING_2_TILES_X   = TILE_SIZE_2x1 | TILE_SIZE_2x2,

    37

	BUILDING_2_TILES_Y   = TILE_SIZE_1x2 | TILE_SIZE_2x2,

    38

	BUILDING_HAS_4_TILES = TILE_SIZE_2x2,

    39

};

    40

    41

DECLARE_ENUM_AS_BIT_SET(BuildingFlags)

    42

    43

enum HouseZones {                  ///< Bit  Value       Meaning

    44

	HZ_NOZNS             = 0x0000,  ///<       0          This is just to get rid of zeros, meaning none

    45

	HZ_ZON1              = 0x0001,  ///< 0..4 1,2,4,8,10  which town zones the building can be built in, Zone1 been the further suburb

    46

	HZ_ZON2              = 0x0002,

    47

	HZ_ZON3              = 0x0004,

    48

	HZ_ZON4              = 0x0008,

    49

	HZ_ZON5              = 0x0010,  ///<                  center of town

    50

	HZ_ZONALL            = 0x001F,  ///<       1F         This is just to englobe all above types at once

    51

	HZ_SUBARTC_ABOVE     = 0x0800,  ///< 11    800        can appear in sub-arctic climate above the snow line

    52

	HZ_TEMP              = 0x1000,  ///< 12   1000        can appear in temperate climate

    53

	HZ_SUBARTC_BELOW     = 0x2000,  ///< 13   2000        can appear in sub-arctic climate below the snow line

    54

	HZ_SUBTROPIC         = 0x4000,  ///< 14   4000        can appear in subtropical climate

    55

	HZ_TOYLND            = 0x8000   ///< 15   8000        can appear in toyland climate

    56

};

    57

    58

DECLARE_ENUM_AS_BIT_SET(HouseZones)

    59

    60

enum HouseExtraFlags {

    61

	NO_EXTRA_FLAG            =       0,

    62

	BUILDING_IS_HISTORICAL   = 1U << 0,  ///< this house will only appear during town generation in random games, thus the historical

    63

	BUILDING_IS_PROTECTED    = 1U << 1,  ///< towns and AI will not remove this house, while human players will be able tp

    64

	SYNCHRONISED_CALLBACK_1B = 1U << 2,  ///< synchronized callback 1B will be performed, on multi tile houses

    65

	CALLBACK_1A_RANDOM_BITS  = 1U << 3,  ///< callback 1A needs random bits

    66

};

    67

    68

DECLARE_ENUM_AS_BIT_SET(HouseExtraFlags)

    69

    70

typedef uint16 HouseID;

    71

typedef uint16 HouseClassID;

    72

    73

struct BuildingCounts {

    74

	uint8 id_count[HOUSE_MAX];

    75

	uint8 class_count[HOUSE_CLASS_MAX];

    76

};

    77

    78

struct Town {

    79

	TileIndex xy;

    80

    81

	/* Current population of people and amount of houses. */

    82

	uint16 num_houses;

    83

	uint32 population;

    84

    85

	/* Town name */

    86

	uint32 townnamegrfid;

    87

	uint16 townnametype;

    88

	uint32 townnameparts;

    89

    90

	/* NOSAVE: Location of name sign, UpdateTownVirtCoord updates this. */

    91

	ViewportSign sign;

    92

    93

	/* Makes sure we don't build certain house types twice.

    94

	 * bit 0 = Building funds received

    95

	 * bit 1 = CHURCH

    96

	 * bit 2 = STADIUM */

    97

	byte flags12;

    98

    99

	/* Which players have a statue? */

   100

	byte statues;

   101

   102

	/* Player ratings as well as a mask that determines which players have a rating. */

   103

	byte have_ratings;

   104

	uint8 unwanted[MAX_PLAYERS]; ///< how many months companies aren't wanted by towns (bribe)

   105

	PlayerByte exclusivity;      ///< which player has exslusivity

   106

	uint8 exclusive_counter;     ///< months till the exclusivity expires

   107

	int16 ratings[MAX_PLAYERS];

   108

   109

	/* Maximum amount of passengers and mail that can be transported. */

   110

	uint32 max_pass;

   111

	uint32 max_mail;

   112

	uint32 new_max_pass;

   113

	uint32 new_max_mail;

   114

	uint32 act_pass;

   115

	uint32 act_mail;

   116

	uint32 new_act_pass;

   117

	uint32 new_act_mail;

   118

   119

	/* Amount of passengers that were transported. */

   120

	byte pct_pass_transported;

   121

	byte pct_mail_transported;

   122

   123

	/* Amount of food and paper that was transported. Actually a bit mask would be enough. */

   124

	uint16 act_food;

   125

	uint16 act_water;

   126

	uint16 new_act_food;

   127

	uint16 new_act_water;

   128

   129

	/* Time until we rebuild a house. */

   130

	uint16 time_until_rebuild;

   131

   132

	/* When to grow town next time. */

   133

	uint16 grow_counter;

   134

	int16 growth_rate;

   135

   136

	/* Fund buildings program in action? */

   137

	byte fund_buildings_months;

   138

   139

	/* Fund road reconstruction in action? */

   140

	byte road_build_months;

   141

   142

	/* Index in town array */

   143

	TownID index;

   144

   145

	/* If this is a larger town, and should grow more quickly. */

   146

	bool larger_town;

   147

   148

	/* NOSAVE: UpdateTownRadius updates this given the house count. */

   149

	uint16 radius[5];

   150

   151

	/* NOSAVE: The number of each type of building in the town. */

   152

	BuildingCounts building_counts;

   153

};

   154

   155

struct HouseSpec {

   156

	/* Standard properties */

   157

	Year min_date;                     ///< introduction year of the house

   158

	Year max_date;                     ///< last year it can be built

   159

	byte population;                   ///< population (Zero on other tiles in multi tile house.)

   160

	byte removal_cost;                 ///< cost multiplier for removing it

   161

	StringID building_name;            ///< building name

   162

	uint16 remove_rating_decrease;     ///< rating decrease if removed

   163

	byte mail_generation;              ///< mail generation multiplier (tile based, as the acceptances below)

   164

	byte cargo_acceptance[3];          ///< acceptance level for the cargo slots

   165

	CargoID accepts_cargo[3];          ///< 3 input cargo slots

   166

	BuildingFlags building_flags;      ///< some flags that describe the house (size, stadium etc...)

   167

	HouseZones building_availability;  ///< where can it be built (climates, zones)

   168

	bool enabled;                      ///< the house is available to build (true by default, but can be disabled by newgrf)

   169

   170

	/* NewHouses properties */

   171

	HouseID substitute_id;             ///< which original house this one is based on

   172

	struct SpriteGroup *spritegroup;   ///< pointer to the different sprites of the house

   173

	HouseID override;                  ///< which house this one replaces

   174

	uint16 callback_mask;              ///< House callback flags

   175

	byte random_colour[4];             ///< 4 "random" colours

   176

	byte probability;                  ///< Relative probability of appearing (16 is the standard value)

   177

	HouseExtraFlags extra_flags;       ///< some more flags

   178

	HouseClassID class_id;             ///< defines the class this house has (grf file based) @See HouseGetVariable, prop 0x44

   179

	byte animation_frames;             ///< number of animation frames

   180

	byte animation_speed;              ///< amount of time between each of those frames

   181

	byte processing_time;              ///< Periodic refresh multiplier

   182

	byte minimum_life;                 ///< The minimum number of years this house will survive before the town rebuilds it

   183

   184

	/* grf file related properties*/

   185

	uint8 local_id;                    ///< id defined by the grf file for this house

   186

	const struct GRFFile *grffile;     ///< grf file that introduced this house

   187

};

   188

   189

enum TownSizeMode {

   190

	TSM_RANDOM,

   191

	TSM_FIXED,

   192

	TSM_CITY

   193

};

   194

   195

VARDEF HouseSpec _house_specs[HOUSE_MAX];

   196

   197

uint32 GetWorldPopulation();

   198

   199

void UpdateTownVirtCoord(Town *t);

   200

void InitializeTown();

   201

void ShowTownViewWindow(TownID town);

   202

void ExpandTown(Town *t);

   203

Town *CreateRandomTown(uint attempts, TownSizeMode mode, uint size);

   204

   205

enum {

   206

	ROAD_REMOVE = 0,

   207

	UNMOVEABLE_REMOVE = 1,

   208

	TUNNELBRIDGE_REMOVE = 1,

   209

	INDUSTRY_REMOVE = 2

   210

};

   211

   212

enum {

   213

	/* These refer to the maximums, so Appalling is -1000 to -400

   214

	 * MAXIMUM RATINGS BOUNDARIES */

   215

	RATING_MINIMUM     = -1000,

   216

	RATING_APPALLING   =  -400,

   217

	RATING_VERYPOOR    =  -200,

   218

	RATING_POOR        =     0,

   219

	RATING_MEDIOCRE    =   200,

   220

	RATING_GOOD        =   400,

   221

	RATING_VERYGOOD    =   600,

   222

	RATING_EXCELLENT   =   800,

   223

	RATING_OUTSTANDING =  1000,         ///< OUTSTANDING

   224

   225

	RATING_MAXIMUM = RATING_OUTSTANDING,

   226

   227

	/* RATINGS AFFECTING NUMBERS */

   228

	RATING_TREE_DOWN_STEP = -35,

   229

	RATING_TREE_MINIMUM   = RATING_MINIMUM,

   230

	RATING_TREE_UP_STEP   = 7,

   231

	RATING_TREE_MAXIMUM   = 220,

   232

   233

	RATING_TUNNEL_BRIDGE_DOWN_STEP = -250,

   234

	RATING_TUNNEL_BRIDGE_MINIMUM   = 0,

   235

   236

	RATING_INDUSTRY_DOWN_STEP = -1500,

   237

	RATING_INDUSTRY_MINIMUM   = RATING_MINIMUM,

   238

   239

	RATING_ROAD_DOWN_STEP = -50,

   240

	RATING_ROAD_MINIMUM   = -100,

   241

	RATING_HOUSE_MINIMUM  = RATING_MINIMUM,

   242

   243

	RATING_BRIBE_UP_STEP = 200,

   244

	RATING_BRIBE_MAXIMUM = 800,

   245

	RATING_BRIBE_DOWN_TO = -50        // XXX SHOULD BE SOMETHING LOWER?

   246

};

   247

   248

/** This is the number of ticks between towns being processed for building new

   249

 * houses or roads. This value originally came from the size of the town array

   250

 * in TTD. */

   251

static const byte TOWN_GROWTH_FREQUENCY = 70;

   252

   253

/** Simple value that indicates the house has reached the final stage of

   254

 * construction. */

   255

static const byte TOWN_HOUSE_COMPLETED = 3;

   256

   257

/** This enum is used in conjonction with town->flags12.

   258

 * IT simply states what bit is used for.

   259

 * It is pretty unrealistic (IMHO) to only have one church/stadium

   260

 * per town, NO MATTER the population of it.

   261

 * And there are 5 more bits available on flags12...

   262

 */

   263

enum {

   264

	TOWN_IS_FUNDED      = 0,   ///< Town has received some funds for

   265

	TOWN_HAS_CHURCH     = 1,   ///< There can be only one church by town.

   266

	TOWN_HAS_STADIUM    = 2    ///< There can be only one stadium by town.

   267

};

   268

   269

bool CheckforTownRating(uint32 flags, Town *t, byte type);

   270

   271

VARDEF const Town** _town_sort;

   272

   273

DECLARE_OLD_POOL(Town, Town, 3, 8000)

   274

   275

static inline HouseSpec *GetHouseSpecs(HouseID house_id)

   276

{

   277

	assert(house_id < HOUSE_MAX);

   278

	return &_house_specs[house_id];

   279

}

   280

   281

/**

   282

 * Check if a Town really exists.

   283

 * @param town to inquiry

   284

 * @return true if it exists

   285

 */

   286

static inline bool IsValidTown(const Town* town)

   287

{

   288

	return town->xy != 0;

   289

}

   290

   291

/**

   292

 * Check if a TownID is valid.

   293

 * @param index to inquiry in the pool of town

   294

 * @return true if it exists

   295

 */

   296

static inline bool IsValidTownID(TownID index)

   297

{

   298

	return index < GetTownPoolSize() && IsValidTown(GetTown(index));

   299

}

   300

   301

VARDEF uint _total_towns;

   302

   303

static inline TownID GetMaxTownIndex()

   304

{

   305

	/* TODO - This isn't the real content of the function, but

   306

	 *  with the new pool-system this will be replaced with one that

   307

	 *  _really_ returns the highest index. Now it just returns

   308

	 *  the next safe value we are sure about everything is below.

   309

	 */

   310

	return GetTownPoolSize() - 1;

   311

}

   312

   313

static inline uint GetNumTowns()

   314

{

   315

	return _total_towns;

   316

}

   317

   318

/**

   319

 * Return a random valid town.

   320

 */

   321

static inline Town *GetRandomTown()

   322

{

   323

	int num = RandomRange(GetNumTowns());

   324

	TownID index = INVALID_TOWN;

   325

   326

	while (num >= 0) {

   327

		num--;

   328

   329

		index++;

   330

		/* Make sure we have a valid town */

   331

		while (!IsValidTownID(index)) {

   332

			index++;

   333

			assert(index <= GetMaxTownIndex());

   334

		}

   335

	}

   336

   337

	return GetTown(index);

   338

}

   339

   340

void DestroyTown(Town *t);

   341

   342

static inline void DeleteTown(Town *t)

   343

{

   344

	DestroyTown(t);

   345

	t->xy = 0;

   346

}

   347

   348

Town* CalcClosestTownFromTile(TileIndex tile, uint threshold);

   349

   350

#define FOR_ALL_TOWNS_FROM(t, start) for (t = GetTown(start); t != NULL; t = (t->index + 1U < GetTownPoolSize()) ? GetTown(t->index + 1U) : NULL) if (IsValidTown(t))

   351

#define FOR_ALL_TOWNS(t) FOR_ALL_TOWNS_FROM(t, 0)

   352

   353

VARDEF bool _town_sort_dirty;

   354

VARDEF byte _town_sort_order;

   355

   356

VARDEF Town *_cleared_town;

   357

VARDEF int _cleared_town_rating;

   358

   359

uint OriginalTileRandomiser(uint x, uint y);

   360

void ResetHouses();

   361

   362

void ClearTownHouse(Town *t, TileIndex tile);

   363

   364

#endif /* TOWN_H */