1

/* $Id$ */

     2

     3

/** @file pathfind.cpp */

     4

     5

#include "stdafx.h"

     6

#include "openttd.h"

     7

#include "bridge_map.h"

     8

#include "station_map.h"

     9

#include "depot.h"

    10

#include "tile_cmd.h"

    11

#include "landscape.h"

    12

#include "pathfind.h"

    13

#include "rail_type.h"

    14

#include "debug.h"

    15

#include "tunnel_map.h"

    16

#include "settings_type.h"

    17

#include "depot.h"

    18

#include "tunnelbridge_map.h"

    19

#include "core/random_func.hpp"

    21

#include "tunnelbridge.h"

    22

    23

/* remember which tiles we have already visited so we don't visit them again. */

    24

static bool TPFSetTileBit(TrackPathFinder *tpf, TileIndex tile, int dir)

    25

{

    26

	uint hash, val, offs;

    27

	TrackPathFinderLink *link, *new_link;

    28

	uint bits = 1 << dir;

    29

    30

	if (tpf->disable_tile_hash)

    31

		return true;

    32

    33

	hash = PATHFIND_HASH_TILE(tile);

    34

    35

	val = tpf->hash_head[hash];

    36

    37

	if (val == 0) {

    38

		/* unused hash entry, set the appropriate bit in it and return true

    39

		 * to indicate that a bit was set. */

    40

		tpf->hash_head[hash] = bits;

    41

		tpf->hash_tile[hash] = tile;

    42

		return true;

    43

	} else if (!(val & 0x8000)) {

    44

		/* single tile */

    45

    46

		if (tile == tpf->hash_tile[hash]) {

    47

			/* found another bit for the same tile,

    48

			 * check if this bit is already set, if so, return false */

    49

			if (val & bits)

    50

				return false;

    51

    52

			/* otherwise set the bit and return true to indicate that the bit

    53

			 * was set */

    54

			tpf->hash_head[hash] = val | bits;

    55

			return true;

    56

		} else {

    57

			/* two tiles with the same hash, need to make a link */

    58

    59

			/* allocate a link. if out of links, handle this by returning

    60

			 * that a tile was already visisted. */

    61

			if (tpf->num_links_left == 0) {

    62

				return false;

    63

			}

    64

			tpf->num_links_left--;

    65

			link = tpf->new_link++;

    66

    67

			/* move the data that was previously in the hash_??? variables

    68

			 * to the link struct, and let the hash variables point to the link */

    69

			link->tile = tpf->hash_tile[hash];

    70

			tpf->hash_tile[hash] = PATHFIND_GET_LINK_OFFS(tpf, link);

    71

    72

			link->flags = tpf->hash_head[hash];

    73

			tpf->hash_head[hash] = 0xFFFF; // multi link

    74

    75

			link->next = 0xFFFF;

    76

		}

    77

	} else {

    78

		/* a linked list of many tiles,

    79

		 * find the one corresponding to the tile, if it exists.

    80

		 * otherwise make a new link */

    81

    82

		offs = tpf->hash_tile[hash];

    83

		do {

    84

			link = PATHFIND_GET_LINK_PTR(tpf, offs);

    85

			if (tile == link->tile) {

    86

				/* found the tile in the link list,

    87

				 * check if the bit was alrady set, if so return false to indicate that the

    88

				 * bit was already set */

    89

				if (link->flags & bits)

    90

					return false;

    91

				link->flags |= bits;

    92

				return true;

    93

			}

    94

		} while ((offs=link->next) != 0xFFFF);

    95

	}

    96

    97

	/* get here if we need to add a new link to link,

    98

	 * first, allocate a new link, in the same way as before */

    99

	if (tpf->num_links_left == 0) {

   100

			return false;

   101

	}

   102

	tpf->num_links_left--;

   103

	new_link = tpf->new_link++;

   104

   105

	/* then fill the link with the new info, and establish a ptr from the old

   106

	 * link to the new one */

   107

	new_link->tile = tile;

   108

	new_link->flags = bits;

   109

	new_link->next = 0xFFFF;

   110

   111

	link->next = PATHFIND_GET_LINK_OFFS(tpf, new_link);

   112

	return true;

   113

}

   114

   115

static const byte _bits_mask[4] = {

   116

	0x19,

   117

	0x16,

   118

	0x25,

   119

	0x2A,

   120

};

   121

   122

static const DiagDirection _tpf_new_direction[14] = {

   123

	DIAGDIR_NE, DIAGDIR_SE, DIAGDIR_NE, DIAGDIR_SE, DIAGDIR_SW, DIAGDIR_SE,

   124

	INVALID_DIAGDIR, INVALID_DIAGDIR,

   125

	DIAGDIR_SW, DIAGDIR_NW, DIAGDIR_NW, DIAGDIR_SW, DIAGDIR_NW, DIAGDIR_NE,

   126

};

   127

   128

static const DiagDirection _tpf_prev_direction[14] = {

   129

	DIAGDIR_NE, DIAGDIR_SE, DIAGDIR_SE, DIAGDIR_NE, DIAGDIR_SE, DIAGDIR_SW,

   130

	INVALID_DIAGDIR, INVALID_DIAGDIR,

   131

	DIAGDIR_SW, DIAGDIR_NW, DIAGDIR_SW, DIAGDIR_NW, DIAGDIR_NE, DIAGDIR_NW,

   132

};

   133

   134

   135

static const byte _otherdir_mask[4] = {

   136

	0x10,

   137

	0,

   138

	0x5,

   139

	0x2A,

   140

};

   141

   142

static void TPFMode2(TrackPathFinder* tpf, TileIndex tile, DiagDirection direction)

   143

{

   144

	RememberData rd;

   145

   146

	assert(tpf->tracktype == TRANSPORT_WATER);

   147

   148

	/* This addition will sometimes overflow by a single tile.

   149

	 * The use of TILE_MASK here makes sure that we still point at a valid

   150

	 * tile, and then this tile will be in the sentinel row/col, so GetTileTrackStatus will fail. */

   151

	tile = TILE_MASK(tile + TileOffsByDiagDir(direction));

   152

   153

	if (++tpf->rd.cur_length > 50)

   154

		return;

   155

   156

	TrackStatus ts = GetTileTrackStatus(tile, tpf->tracktype, tpf->sub_type);

   157

	TrackBits bits = (TrackBits)(TrackStatusToTrackBits(ts) & _bits_mask[direction]);

   158

	if (bits == TRACK_BIT_NONE) return;

   159

   160

	assert(TileX(tile) != MapMaxX() && TileY(tile) != MapMaxY());

   161

   162

	bool only_one_track = true;

   163

	do {

   164

		Track track = RemoveFirstTrack(&bits);

   165

		if (bits != TRACK_BIT_NONE) only_one_track = false;

   166

		rd = tpf->rd;

   167

   168

		/* Change direction 4 times only */

   169

		if (!only_one_track && track != tpf->rd.last_choosen_track) {

   170

			if (++tpf->rd.depth > 4) {

   171

				tpf->rd = rd;

   172

				return;

   173

			}

   174

			tpf->rd.last_choosen_track = track;

   175

		}

   176

   177

		tpf->the_dir = (Trackdir)(track + (HasBit(_otherdir_mask[direction], track) ? 8 : 0));

   178

   179

		if (!tpf->enum_proc(tile, tpf->userdata, tpf->the_dir, tpf->rd.cur_length)) {

   180

			TPFMode2(tpf, tile, _tpf_new_direction[tpf->the_dir]);

   181

		}

   182

   183

		tpf->rd = rd;

   184

	} while (bits != TRACK_BIT_NONE);

   185

   186

}

   187

   188

/**

   189

 * Checks if any vehicle can enter/leave tile in given diagdir

   190

 * Checks only for rail/road depots and road non-drivethrough stations

   191

 * @param tile tile to check

   192

 * @param side side of tile we are trying to leave/enter

   193

 * @param tracktype type of transport

   194

 * @pre tile has trackbit at that diagdir

   195

 * @return true iff vehicle can enter/leve the tile in given side

   196

 */

   197

static inline bool CanAccessTileInDir(TileIndex tile, DiagDirection side, TransportType tracktype)

   198

{

   199

	if (tracktype == TRANSPORT_RAIL) {

   200

		/* depot from wrong side */

   201

		if (IsTileDepotType(tile, TRANSPORT_RAIL) && GetRailDepotDirection(tile) != side) return false;

   202

	} else if (tracktype == TRANSPORT_ROAD) {

   203

		/* depot from wrong side */

   204

		if (IsTileDepotType(tile, TRANSPORT_ROAD) && GetRoadDepotDirection(tile) != side) return false;

   205

		/* non-driverthrough road station from wrong side */

   206

		if (IsStandardRoadStopTile(tile) && GetRoadStopDir(tile) != side) return false;

   207

	}

   208

   209

	return true;

   210

}

   211

   212

static const uint16 _tpfmode1_and[4] = { 0x1009, 0x16, 0x520, 0x2A00 };

   213

   214

static void TPFMode1(TrackPathFinder* tpf, TileIndex tile, DiagDirection direction)

   215

{

   216

	const TileIndex tile_org = tile;

   217

   218

	if (IsTileType(tile, MP_TUNNELBRIDGE)) {

   219

		/* wrong track type */

   220

		if (GetTunnelBridgeTransportType(tile) != tpf->tracktype) return;

   221

   222

		DiagDirection dir = GetTunnelBridgeDirection(tile);

   223

		/* entering tunnel / bridge? */

   224

		if (dir == direction) {

   225

			TileIndex endtile = GetOtherTunnelBridgeEnd(tile);

   226

   227

			tpf->rd.cur_length += GetTunnelBridgeLength(tile, endtile) + 1;

   228

   229

			TPFSetTileBit(tpf, tile, 14);

   230

			TPFSetTileBit(tpf, endtile, 14);

   231

   232

			tile = endtile;

   233

		} else {

   234

			/* leaving tunnel / bridge? */

   235

			if (ReverseDiagDir(dir) != direction) return;

   236

		}

   237

	} else {

   238

		/* can we leave tile in this dir? */

   239

		if (!CanAccessTileInDir(tile, direction, tpf->tracktype)) return;

   240

	}

   241

   242

	tile += TileOffsByDiagDir(direction);

   243

   244

	/* can we enter tile in this dir? */

   245

	if (!CanAccessTileInDir(tile, ReverseDiagDir(direction), tpf->tracktype)) return;

   246

   247

	/* Check if the new tile is a tunnel or bridge head and that the direction

   248

	 * and transport type match */

   249

	if (IsTileType(tile, MP_TUNNELBRIDGE)) {

   250

		if (GetTunnelBridgeDirection(tile) != direction ||

   251

				GetTunnelBridgeTransportType(tile) != tpf->tracktype) {

   252

			return;

   253

		}

   254

	}

   255

   256

	uint32 bits = TrackStatusToTrackdirBits(GetTileTrackStatus(tile, tpf->tracktype, tpf->sub_type));

   257

   258

	/* Check in case of rail if the owner is the same */

   259

	if (tpf->tracktype == TRANSPORT_RAIL) {

   260

		if (bits != 0 && TrackStatusToTrackdirBits(GetTileTrackStatus(tile_org, TRANSPORT_RAIL, 0)) != TRACKDIR_BIT_NONE) {

   261

			if (GetTileOwner(tile_org) != GetTileOwner(tile)) return;

   262

		}

   263

	}

   264

   265

	tpf->rd.cur_length++;

   266

   267

	if ((byte)bits != tpf->var2) {

   268

		bits &= _tpfmode1_and[direction];

   269

		bits |= bits >> 8;

   270

	}

   271

	bits &= 0xBF;

   272

   273

	if (bits != 0) {

   274

		if (!tpf->disable_tile_hash || (tpf->rd.cur_length <= 64 && (KillFirstBit(bits) == 0 || ++tpf->rd.depth <= 7))) {

   275

			do {

   276

				int i = FIND_FIRST_BIT(bits);

   277

				bits = KillFirstBit(bits);

   278

   279

				tpf->the_dir = (Trackdir)((_otherdir_mask[direction] & (byte)(1 << i)) ? (i + 8) : i);

   280

				RememberData rd = tpf->rd;

   281

   282

				/* make sure we are not leaving from invalid side */

   283

				if (TPFSetTileBit(tpf, tile, tpf->the_dir) && CanAccessTileInDir(tile, TrackdirToExitdir(tpf->the_dir), tpf->tracktype) &&

   284

						!tpf->enum_proc(tile, tpf->userdata, tpf->the_dir, tpf->rd.cur_length) ) {

   285

					TPFMode1(tpf, tile, _tpf_new_direction[tpf->the_dir]);

   286

				}

   287

				tpf->rd = rd;

   288

			} while (bits != 0);

   289

		}

   290

	}

   291

}

   292

   293

void FollowTrack(TileIndex tile, uint16 flags, uint sub_type, DiagDirection direction, TPFEnumProc *enum_proc, TPFAfterProc *after_proc, void *data)

   294

{

   296

   298

   299

	/* initialize path finder variables */

   304

   308

   310

   312

   313

   316

   317

	if (HasBit(flags, 11)) {

   320

	} else {

   321

		/* clear the hash_heads */

   324

	}

   325

   327

}

   328

   329

struct StackedItem {

   330

	TileIndex tile;

   331

	uint16 cur_length; ///< This is the current length to this tile.

   332

	uint16 priority;   ///< This is the current length + estimated length to the goal.

   333

	TrackdirByte track;

   334

	byte depth;

   335

	byte state;

   336

	byte first_track;

   337

};

   338

   339

static const Trackdir _new_trackdir[6][4] = {

   340

{TRACKDIR_X_NE,    INVALID_TRACKDIR, TRACKDIR_X_SW,    INVALID_TRACKDIR,},

   341

{INVALID_TRACKDIR, TRACKDIR_Y_SE,    INVALID_TRACKDIR, TRACKDIR_Y_NW,},

   342

{INVALID_TRACKDIR, TRACKDIR_UPPER_E, TRACKDIR_UPPER_W, INVALID_TRACKDIR,},

   343

{TRACKDIR_LOWER_E, INVALID_TRACKDIR, INVALID_TRACKDIR, TRACKDIR_LOWER_W,},

   344

{TRACKDIR_LEFT_N,  TRACKDIR_LEFT_S,  INVALID_TRACKDIR, INVALID_TRACKDIR,},

   345

{INVALID_TRACKDIR, INVALID_TRACKDIR, TRACKDIR_RIGHT_S, TRACKDIR_RIGHT_N,},

   346

};

   347

   348

struct HashLink {

   349

	TileIndex tile;

   350

	uint16 typelength;

   351

	uint16 next;

   352

};

   353

   354

struct NewTrackPathFinder {

   355

	NTPEnumProc *enum_proc;

   356

	void *userdata;

   357

	TileIndex dest;

   358

   359

	TransportType tracktype;

   360

	RailTypes railtypes;

   361

	uint maxlength;

   362

   363

	HashLink *new_link;

   364

	uint num_links_left;

   365

   366

	uint nstack;

   367

	StackedItem stack[256];     ///< priority queue of stacked items

   368

   369

	uint16 hash_head[0x400];    ///< hash heads. 0 means unused. 0xFFFC = length, 0x3 = dir

   370

	TileIndex hash_tile[0x400]; ///< tiles. or links.

   371

   372

	HashLink links[0x400];      ///< hash links

   373

   374

};

   375

#define NTP_GET_LINK_OFFS(tpf, link) ((byte*)(link) - (byte*)tpf->links)

   376

#define NTP_GET_LINK_PTR(tpf, link_offs) (HashLink*)((byte*)tpf->links + (link_offs))

   377

   378

#define ARR(i) tpf->stack[(i)-1]

   379

   380

/** called after a new element was added in the queue at the last index.

   381

 * move it down to the proper position */

   382

static inline void HeapifyUp(NewTrackPathFinder *tpf)

   383

{

   384

	StackedItem si;

   385

	int i = ++tpf->nstack;

   386

   387

	while (i != 1 && ARR(i).priority < ARR(i>>1).priority) {

   388

		/* the child element is larger than the parent item.

   389

		 * swap the child item and the parent item. */

   390

		si = ARR(i); ARR(i) = ARR(i >> 1); ARR(i >> 1) = si;

   391

		i >>= 1;

   392

	}

   393

}

   394

   395

/** called after the element 0 was eaten. fill it with a new element */

   396

static inline void HeapifyDown(NewTrackPathFinder *tpf)

   397

{

   398

	StackedItem si;

   399

	int i = 1, j;

   400

	int n;

   401

   402

	assert(tpf->nstack > 0);

   403

	n = --tpf->nstack;

   404

   405

	if (n == 0) return; // heap is empty so nothing to do?

   406

   407

	/* copy the last item to index 0. we use it as base for heapify. */

   408

	ARR(1) = ARR(n + 1);

   409

   410

	while ((j = i * 2) <= n) {

   411

		/* figure out which is smaller of the children. */

   412

		if (j != n && ARR(j).priority > ARR(j + 1).priority)

   413

			j++; // right item is smaller

   414

   415

		assert(i <= n && j <= n);

   416

		if (ARR(i).priority <= ARR(j).priority)

   417

			break; // base elem smaller than smallest, done!

   418

   419

		/* swap parent with the child */

   420

		si = ARR(i); ARR(i) = ARR(j); ARR(j) = si;

   421

		i = j;

   422

	}

   423

}

   424

   425

/** mark a tile as visited and store the length of the path.

   426

 * if we already had a better path to this tile, return false.

   427

 * otherwise return true. */

   428

static bool NtpVisit(NewTrackPathFinder* tpf, TileIndex tile, DiagDirection dir, uint length)

   429

{

   430

	uint hash,head;

   431

	HashLink *link, *new_link;

   432

   433

	assert(length < 16384-1);

   434

   435

	hash = PATHFIND_HASH_TILE(tile);

   436

   437

	/* never visited before? */

   438

	if ((head=tpf->hash_head[hash]) == 0) {

   439

		tpf->hash_tile[hash] = tile;

   440

		tpf->hash_head[hash] = dir | (length << 2);

   441

		return true;

   442

	}

   443

   444

	if (head != 0xffff) {

   445

		if (tile == tpf->hash_tile[hash] && (head & 0x3) == (uint)dir) {

   446

   447

			/* longer length */

   448

			if (length >= (head >> 2)) return false;

   449

   450

			tpf->hash_head[hash] = dir | (length << 2);

   451

			return true;

   452

		}

   453

		/* two tiles with the same hash, need to make a link

   454

		 * allocate a link. if out of links, handle this by returning

   455

		 * that a tile was already visisted. */

   456

		if (tpf->num_links_left == 0) {

   457

			DEBUG(ntp, 1, "No links left");

   458

			return false;

   459

		}

   460

   461

		tpf->num_links_left--;

   462

		link = tpf->new_link++;

   463

   464

		/* move the data that was previously in the hash_??? variables

   465

		 * to the link struct, and let the hash variables point to the link */

   466

		link->tile = tpf->hash_tile[hash];

   467

		tpf->hash_tile[hash] = NTP_GET_LINK_OFFS(tpf, link);

   468

   469

		link->typelength = tpf->hash_head[hash];

   470

		tpf->hash_head[hash] = 0xFFFF; // multi link

   471

		link->next = 0xFFFF;

   472

	} else {

   473

		/* a linked list of many tiles,

   474

		 * find the one corresponding to the tile, if it exists.

   475

		 * otherwise make a new link */

   476

   477

		uint offs = tpf->hash_tile[hash];

   478

		do {

   479

			link = NTP_GET_LINK_PTR(tpf, offs);

   480

			if (tile == link->tile && (link->typelength & 0x3U) == (uint)dir) {

   481

				if (length >= (uint)(link->typelength >> 2)) return false;

   482

				link->typelength = dir | (length << 2);

   483

				return true;

   484

			}

   485

		} while ((offs = link->next) != 0xFFFF);

   486

	}

   487

   488

	/* get here if we need to add a new link to link,

   489

	 * first, allocate a new link, in the same way as before */

   490

	if (tpf->num_links_left == 0) {

   491

		DEBUG(ntp, 1, "No links left");

   492

		return false;

   493

	}

   494

	tpf->num_links_left--;

   495

	new_link = tpf->new_link++;

   496

   497

	/* then fill the link with the new info, and establish a ptr from the old