1

/* $Id$ */

     2

     3

/** @file town.h */

     4

     5

#ifndef TOWN_H

     6

#define TOWN_H

     7

     8

#include "oldpool.h"

    11

    12

enum {

    13

	HOUSE_NO_CLASS   = 0,

    14

	NEW_HOUSE_OFFSET = 110,

    15

	HOUSE_MAX        = 512,

    16

	INVALID_TOWN     = 0xFFFF,

    17

	INVALID_HOUSE_ID = 0xFFFF,

    18

    19

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

    20

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

    21

	HOUSE_CLASS_MAX  = HOUSE_MAX - NEW_HOUSE_OFFSET + 1,

    22

};

    23

    24

enum BuildingFlags {

    25

	TILE_NO_FLAG         =       0,

    26

	TILE_SIZE_1x1        = 1U << 0,

    27

	TILE_NOT_SLOPED      = 1U << 1,

    28

	TILE_SIZE_2x1        = 1U << 2,

    29

	TILE_SIZE_1x2        = 1U << 3,

    30

	TILE_SIZE_2x2        = 1U << 4,

    31

	BUILDING_IS_ANIMATED = 1U << 5,

    32

	BUILDING_IS_CHURCH   = 1U << 6,

    33

	BUILDING_IS_STADIUM  = 1U << 7,

    34

	BUILDING_HAS_1_TILE  = TILE_SIZE_1x1 | TILE_SIZE_2x1 | TILE_SIZE_1x2 | TILE_SIZE_2x2,

    35

	BUILDING_2_TILES_X   = TILE_SIZE_2x1 | TILE_SIZE_2x2,

    36

	BUILDING_2_TILES_Y   = TILE_SIZE_1x2 | TILE_SIZE_2x2,

    37

	BUILDING_HAS_4_TILES = TILE_SIZE_2x2,

    38

};

    39

    40

DECLARE_ENUM_AS_BIT_SET(BuildingFlags)

    41

    42

enum HouseZones {                  ///< Bit  Value       Meaning

    43

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

    44

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

    45

	HZ_ZON2              = 0x0002,

    46

	HZ_ZON3              = 0x0004,

    47

	HZ_ZON4              = 0x0008,

    48

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

    49

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

    50

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

    51

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

    52

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

    53

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

    54

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

    55

};

    56

    57

DECLARE_ENUM_AS_BIT_SET(HouseZones)

    58

    59

enum HouseExtraFlags {

    60

	NO_EXTRA_FLAG            =       0,

    61

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

    62

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

    63

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

    64

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

    65

};

    66

    67

DECLARE_ENUM_AS_BIT_SET(HouseExtraFlags)

    68

    69

typedef uint16 HouseID;

    70

typedef uint16 HouseClassID;

    71

    72

struct BuildingCounts {

    73

	uint8 id_count[HOUSE_MAX];

    74

	uint8 class_count[HOUSE_CLASS_MAX];

    75

};

    76

    77

struct Town;

    78

DECLARE_OLD_POOL(Town, Town, 3, 8000)

    79

    80

struct Town : PoolItem<Town, TownID, &_Town_pool> {

    81

	TileIndex xy;

    82

    83

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

    84

	uint16 num_houses;

    85

	uint32 population;

    86

    87

	/* Town name */

    88

	uint32 townnamegrfid;

    89

	uint16 townnametype;

    90

	uint32 townnameparts;

    91

    92

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

    93

	ViewportSign sign;

    94

    95

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

    96

	 * bit 0 = Building funds received

    97

	 * bit 1 = CHURCH

    98

	 * bit 2 = STADIUM */

    99

	byte flags12;

   100

   101

	/* Which players have a statue? */

   102

	byte statues;

   103

   104

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

   105

	byte have_ratings;

   106

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

   107

	PlayerByte exclusivity;      ///< which player has exslusivity

   108

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

   109

	int16 ratings[MAX_PLAYERS];

   110

   111

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

   112

	uint32 max_pass;

   113

	uint32 max_mail;

   114

	uint32 new_max_pass;

   115

	uint32 new_max_mail;

   116

	uint32 act_pass;

   117

	uint32 act_mail;

   118

	uint32 new_act_pass;

   119

	uint32 new_act_mail;

   120

   121

	/* Amount of passengers that were transported. */

   122

	byte pct_pass_transported;

   123

	byte pct_mail_transported;

   124

   125

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

   126

	uint16 act_food;

   127

	uint16 act_water;

   128

	uint16 new_act_food;

   129

	uint16 new_act_water;

   130

   131

	/* Time until we rebuild a house. */

   132

	uint16 time_until_rebuild;

   133

   134

	/* When to grow town next time. */

   135

	uint16 grow_counter;

   136

	int16 growth_rate;

   137

   138

	/* Fund buildings program in action? */

   139

	byte fund_buildings_months;

   140

   141

	/* Fund road reconstruction in action? */

   142

	byte road_build_months;

   143

   144

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

   145

	bool larger_town;

   146

   147

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

   148

	uint16 radius[5];

   149

   150

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

   151

	BuildingCounts building_counts;

   152

   153

	/**

   154

	 * Creates a new town

   155

	 */

   156

	Town(TileIndex tile = 0);

   157

   158

	/** Destroy the town */

   159

	~Town();

   160

   161

	inline bool IsValid() const { return this->xy != 0; }

   162

};

   163

   164

struct HouseSpec {

   165

	/* Standard properties */

   166

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

   167

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

   168

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

   169

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

   170

	StringID building_name;            ///< building name

   171

	uint16 remove_rating_decrease;     ///< rating decrease if removed

   172

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

   173

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

   174

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

   175

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

   176

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

   177

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

   178

   179

	/* NewHouses properties */

   180

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

   181

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

   182

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

   183

	uint16 callback_mask;              ///< House callback flags

   184

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

   185

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

   186

	HouseExtraFlags extra_flags;       ///< some more flags

   187

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

   188

	byte animation_frames;             ///< number of animation frames

   189

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

   190

	byte processing_time;              ///< Periodic refresh multiplier

   191

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

   192

   193

	/* grf file related properties*/

   194

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

   195

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

   196

};

   197

   198

enum TownSizeMode {

   199

	TSM_RANDOM,

   200

	TSM_FIXED,

   201

	TSM_CITY

   202

};

   203

   204

VARDEF HouseSpec _house_specs[HOUSE_MAX];

   205

   206

uint32 GetWorldPopulation();

   207

   208

void UpdateTownVirtCoord(Town *t);

   209

void UpdateAllTownVirtCoords();

   210

void InitializeTown();

   211

void ShowTownViewWindow(TownID town);

   212

void ExpandTown(Town *t);

   213

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

   214

   215

enum {

   216

	ROAD_REMOVE = 0,

   217

	UNMOVEABLE_REMOVE = 1,

   218

	TUNNELBRIDGE_REMOVE = 1,

   219

	INDUSTRY_REMOVE = 2

   220

};

   221

   222

enum {

   223

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

   224

	 * MAXIMUM RATINGS BOUNDARIES */

   225

	RATING_MINIMUM     = -1000,

   226

	RATING_APPALLING   =  -400,

   227

	RATING_VERYPOOR    =  -200,

   228

	RATING_POOR        =     0,

   229

	RATING_MEDIOCRE    =   200,

   230

	RATING_GOOD        =   400,

   231

	RATING_VERYGOOD    =   600,

   232

	RATING_EXCELLENT   =   800,

   233

	RATING_OUTSTANDING =  1000,         ///< OUTSTANDING

   234

   235

	RATING_MAXIMUM = RATING_OUTSTANDING,

   236

   237

	/* RATINGS AFFECTING NUMBERS */

   238

	RATING_TREE_DOWN_STEP = -35,

   239

	RATING_TREE_MINIMUM   = RATING_MINIMUM,

   240

	RATING_TREE_UP_STEP   = 7,

   241

	RATING_TREE_MAXIMUM   = 220,

   242

   243

	RATING_TUNNEL_BRIDGE_DOWN_STEP = -250,

   244

	RATING_TUNNEL_BRIDGE_MINIMUM   = 0,

   245

   246

	RATING_INDUSTRY_DOWN_STEP = -1500,

   247

	RATING_INDUSTRY_MINIMUM   = RATING_MINIMUM,

   248

   249

	RATING_ROAD_DOWN_STEP = -50,

   250

	RATING_ROAD_MINIMUM   = -100,

   251

	RATING_HOUSE_MINIMUM  = RATING_MINIMUM,

   252

   253

	RATING_BRIBE_UP_STEP = 200,

   254

	RATING_BRIBE_MAXIMUM = 800,

   255

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

   256

};

   257

   258

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

   259

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

   260

 * in TTD. */

   261

static const byte TOWN_GROWTH_FREQUENCY = 70;

   262

   263

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

   264

 * construction. */

   265

static const byte TOWN_HOUSE_COMPLETED = 3;

   266

   267

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

   268

 * IT simply states what bit is used for.

   269

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

   270

 * per town, NO MATTER the population of it.

   271

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

   272

 */

   273

enum {

   274

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

   275

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

   276

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

   277

};

   278

   279

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

   280

   281

VARDEF const Town** _town_sort;

   282

   283

static inline HouseSpec *GetHouseSpecs(HouseID house_id)

   284

{

   285

	assert(house_id < HOUSE_MAX);

   286

	return &_house_specs[house_id];

   287

}

   288

   289

/**

   290

 * Check if a TownID is valid.

   291

 * @param index to inquiry in the pool of town

   292

 * @return true if it exists

   293

 */

   294

static inline bool IsValidTownID(TownID index)

   295

{

   296

	return index < GetTownPoolSize() && GetTown(index)->IsValid();

   297

}

   298

   299

VARDEF uint _total_towns;

   300

   301

static inline TownID GetMaxTownIndex()

   302

{

   303

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

   304

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

   305

	 *  _really_ returns the highest index. Now it just returns

   306

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

   307

	 */

   308

	return GetTownPoolSize() - 1;

   309

}

   310

   311

static inline uint GetNumTowns()

   312

{

   313

	return _total_towns;

   314

}

   315

   316

/**

   317

 * Return a random valid town.

   318

 */

   319

static inline Town *GetRandomTown()

   320

{

   321

	int num = RandomRange(GetNumTowns());

   322

	TownID index = INVALID_TOWN;

   323

   324

	while (num >= 0) {

   325

		num--;

   326

   327

		index++;

   328

		/* Make sure we have a valid town */

   329

		while (!IsValidTownID(index)) {

   330

			index++;

   331

			assert(index <= GetMaxTownIndex());

   332

		}

   333

	}

   334

   335

	return GetTown(index);

   336

}

   337

   338

Town* CalcClosestTownFromTile(TileIndex tile, uint threshold);

   339

   340

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

   341

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

   342

   343

VARDEF bool _town_sort_dirty;

   344

VARDEF byte _town_sort_order;

   345

   346

VARDEF Town *_cleared_town;

   347

VARDEF int _cleared_town_rating;

   348

   349

uint OriginalTileRandomiser(uint x, uint y);

   350

void ResetHouses();

   351

   352

void ClearTownHouse(Town *t, TileIndex tile);

   359

   360

#endif /* TOWN_H */