1

/* $Id$ */

     2

     3

/** @file town.h */

     4

     5

#ifndef TOWN_H

     6

#define TOWN_H

     7

     8

#include "oldpool.h"

     9

#include "core/random_func.hpp"

    10

#include "cargo_type.h"

    11

#include "tile_type.h"

    12

#include "date_type.h"

    14

    15

enum {

    16

	HOUSE_NO_CLASS   = 0,

    17

	NEW_HOUSE_OFFSET = 110,

    18

	HOUSE_MAX        = 512,

    19

	INVALID_TOWN     = 0xFFFF,

    20

	INVALID_HOUSE_ID = 0xFFFF,

    21

    22

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

    23

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

    24

	HOUSE_CLASS_MAX  = HOUSE_MAX - NEW_HOUSE_OFFSET + 1,

    25

};

    26

    27

enum BuildingFlags {

    28

	TILE_NO_FLAG         =       0,

    29

	TILE_SIZE_1x1        = 1U << 0,

    30

	TILE_NOT_SLOPED      = 1U << 1,

    31

	TILE_SIZE_2x1        = 1U << 2,

    32

	TILE_SIZE_1x2        = 1U << 3,

    33

	TILE_SIZE_2x2        = 1U << 4,

    34

	BUILDING_IS_ANIMATED = 1U << 5,

    35

	BUILDING_IS_CHURCH   = 1U << 6,

    36

	BUILDING_IS_STADIUM  = 1U << 7,

    37

	BUILDING_HAS_1_TILE  = TILE_SIZE_1x1 | TILE_SIZE_2x1 | TILE_SIZE_1x2 | TILE_SIZE_2x2,

    38

	BUILDING_2_TILES_X   = TILE_SIZE_2x1 | TILE_SIZE_2x2,

    39

	BUILDING_2_TILES_Y   = TILE_SIZE_1x2 | TILE_SIZE_2x2,

    40

	BUILDING_HAS_4_TILES = TILE_SIZE_2x2,

    41

};

    42

    43

DECLARE_ENUM_AS_BIT_SET(BuildingFlags)

    44

    45

enum HouseZones {                  ///< Bit  Value       Meaning

    46

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

    47

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

    48

	HZ_ZON2              = 0x0002,

    49

	HZ_ZON3              = 0x0004,

    50

	HZ_ZON4              = 0x0008,

    51

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

    52

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

    53

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

    54

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

    55

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

    56

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

    57

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

    58

};

    59

    60

DECLARE_ENUM_AS_BIT_SET(HouseZones)

    61

    62

enum HouseExtraFlags {

    63

	NO_EXTRA_FLAG            =       0,

    64

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

    65

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

    66

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

    67

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

    68

};

    69

    70

DECLARE_ENUM_AS_BIT_SET(HouseExtraFlags)

    71

    72

struct BuildingCounts {

    73

	uint8 id_count[HOUSE_MAX];

    74

	uint8 class_count[HOUSE_CLASS_MAX];

    75

};

    76

    77

DECLARE_OLD_POOL(Town, Town, 3, 8000)

    78

    79

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

    80

	TileIndex xy;

    81

    82

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

    83

	uint16 num_houses;

    84

	uint32 population;

    85

    86

	/* Town name */

    87

	uint32 townnamegrfid;

    88

	uint16 townnametype;

    89

	uint32 townnameparts;

    90

    91

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

    92

	ViewportSign sign;

    93

    94

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

    95

	 * bit 0 = Building funds received

    96

	 * bit 1 = CHURCH

    97

	 * bit 2 = STADIUM */

    98

	byte flags12;

    99

   100

	/* Which players have a statue? */

   101

	byte statues;

   102

   103

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

   104

	byte have_ratings;

   105

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

   106

	PlayerByte exclusivity;      ///< which player has exslusivity

   107

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

   108

	int16 ratings[MAX_PLAYERS];

   109

   110

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

   111

	uint32 max_pass;

   112

	uint32 max_mail;

   113

	uint32 new_max_pass;

   114

	uint32 new_max_mail;

   115

	uint32 act_pass;

   116

	uint32 act_mail;

   117

	uint32 new_act_pass;

   118

	uint32 new_act_mail;

   119

   120

	/* Amount of passengers that were transported. */

   121

	byte pct_pass_transported;

   122

	byte pct_mail_transported;

   123

   124

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

   125

	uint16 act_food;

   126

	uint16 act_water;

   127

	uint16 new_act_food;

   128

	uint16 new_act_water;

   129

   130

	/* Time until we rebuild a house. */

   131

	uint16 time_until_rebuild;

   132

   133

	/* When to grow town next time. */

   134

	uint16 grow_counter;

   135

	int16 growth_rate;

   136

   137

	/* Fund buildings program in action? */

   138

	byte fund_buildings_months;

   139

   140

	/* Fund road reconstruction in action? */

   141

	byte road_build_months;

   142

   143

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

   144

	bool larger_town;

   145

   146

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

   147

	uint16 radius[5];

   148

   149

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

   150

	BuildingCounts building_counts;

   151

   152

	/**

   153

	 * Creates a new town

   154

	 */

   155

	Town(TileIndex tile = 0);

   156

   157

	/** Destroy the town */

   158

	~Town();

   159

   160

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

   161

};

   162

   163

struct HouseSpec {

   164

	/* Standard properties */

   165

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

   166

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

   167

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

   168

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

   169

	StringID building_name;            ///< building name

   170

	uint16 remove_rating_decrease;     ///< rating decrease if removed

   171

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

   172

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

   173

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

   174

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

   175

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

   176

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

   177

   178

	/* NewHouses properties */

   179

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

   180

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

   181

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

   182

	uint16 callback_mask;              ///< House callback flags

   183

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

   184

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

   185

	HouseExtraFlags extra_flags;       ///< some more flags

   186

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

   187

	byte animation_frames;             ///< number of animation frames

   188

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

   189

	byte processing_time;              ///< Periodic refresh multiplier

   190

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

   191

   192

	/* grf file related properties*/

   193

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

   194

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

   195

};

   196

   197

VARDEF HouseSpec _house_specs[HOUSE_MAX];

   198

   199

uint32 GetWorldPopulation();

   200

   201

void UpdateTownVirtCoord(Town *t);

   202

void UpdateAllTownVirtCoords();

   203

void InitializeTown();

   204

void ShowTownViewWindow(TownID town);

   205

void ExpandTown(Town *t);

   206

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

   207

   208

enum {

   209

	ROAD_REMOVE = 0,

   210

	UNMOVEABLE_REMOVE = 1,

   211

	TUNNELBRIDGE_REMOVE = 1,

   212

	INDUSTRY_REMOVE = 2

   213

};

   214

   215

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

   216

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

   217

 * in TTD. */

   218

static const byte TOWN_GROWTH_FREQUENCY = 70;

   219

   220

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

   221

 * construction. */

   222

static const byte TOWN_HOUSE_COMPLETED = 3;

   223

   224

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

   225

 * IT simply states what bit is used for.

   226

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

   227

 * per town, NO MATTER the population of it.

   228

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

   229

 */

   230

enum {

   231

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

   232

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

   233

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

   234

};

   235

   236

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

   237

   238

VARDEF const Town** _town_sort;

   239

   240

static inline HouseSpec *GetHouseSpecs(HouseID house_id)

   241

{

   242

	assert(house_id < HOUSE_MAX);

   243

	return &_house_specs[house_id];

   244

}

   245

   246

/**

   247

 * Check if a TownID is valid.

   248

 * @param index to inquiry in the pool of town

   249

 * @return true if it exists

   250

 */

   251

static inline bool IsValidTownID(TownID index)

   252

{

   253

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

   254

}

   255

   256

VARDEF uint _total_towns;

   257

   258

static inline TownID GetMaxTownIndex()

   259

{

   260

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

   261

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

   262

	 *  _really_ returns the highest index. Now it just returns

   263

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

   264

	 */

   265

	return GetTownPoolSize() - 1;

   266

}

   267

   268

static inline uint GetNumTowns()

   269

{

   270

	return _total_towns;

   271

}

   272

   273

/**

   274

 * Return a random valid town.

   275

 */

   276

static inline Town *GetRandomTown()

   277

{

   278

	int num = RandomRange(GetNumTowns());

   279

	TownID index = INVALID_TOWN;

   280

   281

	while (num >= 0) {

   282

		num--;

   283

   284

		index++;

   285

		/* Make sure we have a valid town */

   286

		while (!IsValidTownID(index)) {

   287

			index++;

   288

			assert(index <= GetMaxTownIndex());

   289

		}

   290

	}

   291

   292

	return GetTown(index);

   293

}

   294

   295

Town* CalcClosestTownFromTile(TileIndex tile, uint threshold);

   296

   297

#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())

   298

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

   299

   300

VARDEF bool _town_sort_dirty;

   301

VARDEF byte _town_sort_order;

   302

   303

VARDEF Town *_cleared_town;

   304

VARDEF int _cleared_town_rating;

   305

   306

uint OriginalTileRandomiser(uint x, uint y);

   307

void ResetHouses();

   308

   309

void ClearTownHouse(Town *t, TileIndex tile);

   310

void AfterLoadTown();

   311

void UpdateTownMaxPass(Town *t);

   312

bool CheckIfAuthorityAllows(TileIndex tile);

   313

Town *ClosestTownFromTile(TileIndex tile, uint threshold);

   314

void ChangeTownRating(Town *t, int add, int max);

   315

uint GetTownRadiusGroup(const Town* t, TileIndex tile);

   316

   317

#endif /* TOWN_H */