Add: INR currency (#8136)
[openttd-github.git] / src / pathfinder / npf / npf.cpp
blob34b85791bd79efaa13d5698f41f242a77e99cd74
1 /*
2 * This file is part of OpenTTD.
3 * OpenTTD is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, version 2.
4 * OpenTTD is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
5 * See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with OpenTTD. If not, see <http://www.gnu.org/licenses/>.
6 */
8 /** @file npf.cpp Implementation of the NPF pathfinder. */
10 #include "../../stdafx.h"
11 #include "../../network/network.h"
12 #include "../../viewport_func.h"
13 #include "../../ship.h"
14 #include "../../roadstop_base.h"
15 #include "../../vehicle_func.h"
16 #include "../pathfinder_func.h"
17 #include "../pathfinder_type.h"
18 #include "../follow_track.hpp"
19 #include "aystar.h"
21 #include "../../safeguards.h"
23 static const uint NPF_HASH_BITS = 12; ///< The size of the hash used in pathfinding. Just changing this value should be sufficient to change the hash size. Should be an even value.
24 /* Do no change below values */
25 static const uint NPF_HASH_SIZE = 1 << NPF_HASH_BITS;
26 static const uint NPF_HASH_HALFBITS = NPF_HASH_BITS / 2;
27 static const uint NPF_HASH_HALFMASK = (1 << NPF_HASH_HALFBITS) - 1;
29 /** Meant to be stored in AyStar.targetdata */
30 struct NPFFindStationOrTileData {
31 TileIndex dest_coords; ///< An indication of where the station is, for heuristic purposes, or the target tile
32 StationID station_index; ///< station index we're heading for, or INVALID_STATION when we're heading for a tile
33 bool reserve_path; ///< Indicates whether the found path should be reserved
34 StationType station_type; ///< The type of station we're heading for
35 bool not_articulated; ///< The (road) vehicle is not articulated
36 const Vehicle *v; ///< The vehicle we are pathfinding for
39 /** Indices into AyStar.userdata[] */
40 struct AyStarUserData {
41 Owner owner;
42 TransportType type;
43 RailTypes railtypes;
44 RoadTypes roadtypes;
45 uint subtype;
48 /** Indices into AyStarNode.userdata[] */
49 enum AyStarNodeUserDataType {
50 NPF_TRACKDIR_CHOICE = 0, ///< The trackdir chosen to get here
51 NPF_NODE_FLAGS,
54 /** Flags for AyStarNode.userdata[NPF_NODE_FLAGS]. Use NPFSetFlag() and NPFGetFlag() to use them. */
55 enum NPFNodeFlag {
56 NPF_FLAG_SEEN_SIGNAL, ///< Used to mark that a signal was seen on the way, for rail only
57 NPF_FLAG_2ND_SIGNAL, ///< Used to mark that two signals were seen, rail only
58 NPF_FLAG_3RD_SIGNAL, ///< Used to mark that three signals were seen, rail only
59 NPF_FLAG_REVERSE, ///< Used to mark that this node was reached from the second start node, if applicable
60 NPF_FLAG_LAST_SIGNAL_RED, ///< Used to mark that the last signal on this path was red
61 NPF_FLAG_LAST_SIGNAL_BLOCK, ///< Used to mark that the last signal on this path was a block signal
62 NPF_FLAG_IGNORE_START_TILE, ///< Used to mark that the start tile is invalid, and searching should start from the second tile on
63 NPF_FLAG_TARGET_RESERVED, ///< Used to mark that the possible reservation target is already reserved
64 NPF_FLAG_IGNORE_RESERVED, ///< Used to mark that reserved tiles should be considered impassable
67 /** Meant to be stored in AyStar.userpath */
68 struct NPFFoundTargetData {
69 uint best_bird_dist; ///< The best heuristic found. Is 0 if the target was found
70 uint best_path_dist; ///< The shortest path. Is UINT_MAX if no path is found
71 Trackdir best_trackdir; ///< The trackdir that leads to the shortest path/closest birds dist
72 AyStarNode node; ///< The node within the target the search led us to
73 bool res_okay; ///< True if a path reservation could be made
76 static AyStar _npf_aystar;
78 /* The cost of each trackdir. A diagonal piece is the full NPF_TILE_LENGTH,
79 * the shorter piece is sqrt(2)/2*NPF_TILE_LENGTH =~ 0.7071
81 #define NPF_STRAIGHT_LENGTH (uint)(NPF_TILE_LENGTH * STRAIGHT_TRACK_LENGTH)
82 static const uint _trackdir_length[TRACKDIR_END] = {
83 NPF_TILE_LENGTH, NPF_TILE_LENGTH, NPF_STRAIGHT_LENGTH, NPF_STRAIGHT_LENGTH, NPF_STRAIGHT_LENGTH, NPF_STRAIGHT_LENGTH,
84 0, 0,
85 NPF_TILE_LENGTH, NPF_TILE_LENGTH, NPF_STRAIGHT_LENGTH, NPF_STRAIGHT_LENGTH, NPF_STRAIGHT_LENGTH, NPF_STRAIGHT_LENGTH
88 /**
89 * Returns the current value of the given flag on the given AyStarNode.
91 static inline bool NPFGetFlag(const AyStarNode *node, NPFNodeFlag flag)
93 return HasBit(node->user_data[NPF_NODE_FLAGS], flag);
96 /**
97 * Sets the given flag on the given AyStarNode to the given value.
99 static inline void NPFSetFlag(AyStarNode *node, NPFNodeFlag flag, bool value)
101 SB(node->user_data[NPF_NODE_FLAGS], flag, 1, value);
104 bool CheckIgnoreFirstTile(const PathNode *node)
106 return (node->parent == nullptr && HasBit(node->node.user_data[NPF_NODE_FLAGS], NPF_FLAG_IGNORE_START_TILE));
110 * Calculates the minimum distance travelled to get from t0 to t1 when only
111 * using tracks (ie, only making 45 degree turns). Returns the distance in the
112 * NPF scale, ie the number of full tiles multiplied by NPF_TILE_LENGTH to
113 * prevent rounding.
115 static uint NPFDistanceTrack(TileIndex t0, TileIndex t1)
117 const uint dx = Delta(TileX(t0), TileX(t1));
118 const uint dy = Delta(TileY(t0), TileY(t1));
120 const uint straightTracks = 2 * min(dx, dy); // The number of straight (not full length) tracks
121 /* OPTIMISATION:
122 * Original: diagTracks = max(dx, dy) - min(dx,dy);
123 * Proof:
124 * (dx+dy) - straightTracks == (min + max) - straightTracks = min + max - 2 * min = max - min */
125 const uint diagTracks = dx + dy - straightTracks; // The number of diagonal (full tile length) tracks.
127 /* Don't factor out NPF_TILE_LENGTH below, this will round values and lose
128 * precision */
129 return diagTracks * NPF_TILE_LENGTH + straightTracks * NPF_TILE_LENGTH * STRAIGHT_TRACK_LENGTH;
133 * Calculates a hash value for use in the NPF.
134 * @param key1 The TileIndex of the tile to hash
135 * @param key2 The Trackdir of the track on the tile.
137 * @todo Think of a better hash.
139 static uint NPFHash(uint key1, uint key2)
141 /* TODO: think of a better hash? */
142 uint part1 = TileX(key1) & NPF_HASH_HALFMASK;
143 uint part2 = TileY(key1) & NPF_HASH_HALFMASK;
145 assert(IsValidTrackdir((Trackdir)key2));
146 assert(IsValidTile(key1));
147 return ((part1 << NPF_HASH_HALFBITS | part2) + (NPF_HASH_SIZE * key2 / TRACKDIR_END)) % NPF_HASH_SIZE;
150 static int32 NPFCalcZero(AyStar *as, AyStarNode *current, OpenListNode *parent)
152 return 0;
155 /* Calculates the heuristic to the target station or tile. For train stations, it
156 * takes into account the direction of approach.
158 static int32 NPFCalcStationOrTileHeuristic(AyStar *as, AyStarNode *current, OpenListNode *parent)
160 NPFFindStationOrTileData *fstd = (NPFFindStationOrTileData*)as->user_target;
161 NPFFoundTargetData *ftd = (NPFFoundTargetData*)as->user_path;
162 TileIndex from = current->tile;
163 TileIndex to = fstd->dest_coords;
164 uint dist;
165 AyStarUserData *user = (AyStarUserData *)as->user_data;
167 /* aim for the closest station tile */
168 if (fstd->station_index != INVALID_STATION) {
169 to = CalcClosestStationTile(fstd->station_index, from, fstd->station_type);
172 if (user->type == TRANSPORT_ROAD) {
173 /* Since roads only have diagonal pieces, we use manhattan distance here */
174 dist = DistanceManhattan(from, to) * NPF_TILE_LENGTH;
175 } else {
176 /* Ships and trains can also go diagonal, so the minimum distance is shorter */
177 dist = NPFDistanceTrack(from, to);
180 DEBUG(npf, 4, "Calculating H for: (%d, %d). Result: %d", TileX(current->tile), TileY(current->tile), dist);
182 if (dist < ftd->best_bird_dist) {
183 ftd->best_bird_dist = dist;
184 ftd->best_trackdir = (Trackdir)current->user_data[NPF_TRACKDIR_CHOICE];
186 return dist;
190 /* Fills AyStarNode.user_data[NPF_TRACKDIRCHOICE] with the chosen direction to
191 * get here, either getting it from the current choice or from the parent's
192 * choice */
193 static void NPFFillTrackdirChoice(AyStarNode *current, OpenListNode *parent)
195 if (parent->path.parent == nullptr) {
196 Trackdir trackdir = current->direction;
197 /* This is a first order decision, so we'd better save the
198 * direction we chose */
199 current->user_data[NPF_TRACKDIR_CHOICE] = trackdir;
200 DEBUG(npf, 6, "Saving trackdir: 0x%X", trackdir);
201 } else {
202 /* We've already made the decision, so just save our parent's decision */
203 current->user_data[NPF_TRACKDIR_CHOICE] = parent->path.node.user_data[NPF_TRACKDIR_CHOICE];
207 /* Will return the cost of the tunnel. If it is an entry, it will return the
208 * cost of that tile. If the tile is an exit, it will return the tunnel length
209 * including the exit tile. Requires that this is a Tunnel tile */
210 static uint NPFTunnelCost(AyStarNode *current)
212 DiagDirection exitdir = TrackdirToExitdir(current->direction);
213 TileIndex tile = current->tile;
214 if (GetTunnelBridgeDirection(tile) == ReverseDiagDir(exitdir)) {
215 /* We just popped out if this tunnel, since were
216 * facing the tunnel exit */
217 return NPF_TILE_LENGTH * (GetTunnelBridgeLength(current->tile, GetOtherTunnelEnd(current->tile)) + 1);
218 /* @todo: Penalty for tunnels? */
219 } else {
220 /* We are entering the tunnel, the enter tile is just a
221 * straight track */
222 return NPF_TILE_LENGTH;
226 static inline uint NPFBridgeCost(AyStarNode *current)
228 return NPF_TILE_LENGTH * GetTunnelBridgeLength(current->tile, GetOtherBridgeEnd(current->tile));
231 static uint NPFSlopeCost(AyStarNode *current)
233 TileIndex next = current->tile + TileOffsByDiagDir(TrackdirToExitdir(current->direction));
235 /* Get center of tiles */
236 int x1 = TileX(current->tile) * TILE_SIZE + TILE_SIZE / 2;
237 int y1 = TileY(current->tile) * TILE_SIZE + TILE_SIZE / 2;
238 int x2 = TileX(next) * TILE_SIZE + TILE_SIZE / 2;
239 int y2 = TileY(next) * TILE_SIZE + TILE_SIZE / 2;
241 int dx4 = (x2 - x1) / 4;
242 int dy4 = (y2 - y1) / 4;
244 /* Get the height on both sides of the tile edge.
245 * Avoid testing the height on the tile-center. This will fail for halftile-foundations.
247 int z1 = GetSlopePixelZ(x1 + dx4, y1 + dy4);
248 int z2 = GetSlopePixelZ(x2 - dx4, y2 - dy4);
250 if (z2 - z1 > 1) {
251 /* Slope up */
252 return _settings_game.pf.npf.npf_rail_slope_penalty;
254 return 0;
255 /* Should we give a bonus for slope down? Probably not, we
256 * could just subtract that bonus from the penalty, because
257 * there is only one level of steepness... */
260 static uint NPFReservedTrackCost(AyStarNode *current)
262 TileIndex tile = current->tile;
263 TrackBits track = TrackToTrackBits(TrackdirToTrack(current->direction));
264 TrackBits res = GetReservedTrackbits(tile);
266 if (NPFGetFlag(current, NPF_FLAG_3RD_SIGNAL) || NPFGetFlag(current, NPF_FLAG_LAST_SIGNAL_BLOCK) || ((res & track) == TRACK_BIT_NONE && !TracksOverlap(res | track))) return 0;
268 if (IsTileType(tile, MP_TUNNELBRIDGE)) {
269 DiagDirection exitdir = TrackdirToExitdir(current->direction);
270 if (GetTunnelBridgeDirection(tile) == ReverseDiagDir(exitdir)) {
271 return _settings_game.pf.npf.npf_rail_pbs_cross_penalty * (GetTunnelBridgeLength(tile, GetOtherTunnelBridgeEnd(tile)) + 1);
274 return _settings_game.pf.npf.npf_rail_pbs_cross_penalty;
278 * Mark tiles by mowing the grass when npf debug level >= 1.
279 * Will not work for multiplayer games, since it can (will) cause desyncs.
281 static void NPFMarkTile(TileIndex tile)
283 if (_debug_npf_level < 1 || _networking) return;
284 switch (GetTileType(tile)) {
285 case MP_RAILWAY:
286 /* DEBUG: mark visited tiles by mowing the grass under them ;-) */
287 if (!IsRailDepot(tile)) {
288 SetRailGroundType(tile, RAIL_GROUND_BARREN);
289 MarkTileDirtyByTile(tile);
291 break;
293 case MP_ROAD:
294 if (!IsRoadDepot(tile)) {
295 SetRoadside(tile, ROADSIDE_BARREN);
296 MarkTileDirtyByTile(tile);
298 break;
300 default:
301 break;
305 static Vehicle *CountShipProc(Vehicle *v, void *data)
307 uint *count = (uint *)data;
308 /* Ignore other vehicles (aircraft) and ships inside depot. */
309 if (v->type == VEH_SHIP && (v->vehstatus & VS_HIDDEN) == 0) (*count)++;
311 return nullptr;
314 static int32 NPFWaterPathCost(AyStar *as, AyStarNode *current, OpenListNode *parent)
316 /* TileIndex tile = current->tile; */
317 int32 cost = 0;
318 Trackdir trackdir = current->direction;
320 cost = _trackdir_length[trackdir]; // Should be different for diagonal tracks
322 if (IsBuoyTile(current->tile) && IsDiagonalTrackdir(trackdir)) {
323 cost += _settings_game.pf.npf.npf_buoy_penalty; // A small penalty for going over buoys
326 if (current->direction != NextTrackdir((Trackdir)parent->path.node.direction)) {
327 cost += _settings_game.pf.npf.npf_water_curve_penalty;
330 if (IsDockingTile(current->tile)) {
331 /* Check docking tile for occupancy */
332 uint count = 1;
333 HasVehicleOnPos(current->tile, &count, &CountShipProc);
334 cost += count * 3 * _trackdir_length[trackdir];
337 /* @todo More penalties? */
339 return cost;
342 /* Determine the cost of this node, for road tracks */
343 static int32 NPFRoadPathCost(AyStar *as, AyStarNode *current, OpenListNode *parent)
345 TileIndex tile = current->tile;
346 int32 cost = 0;
348 /* Determine base length */
349 switch (GetTileType(tile)) {
350 case MP_TUNNELBRIDGE:
351 cost = IsTunnel(tile) ? NPFTunnelCost(current) : NPFBridgeCost(current);
352 break;
354 case MP_ROAD:
355 cost = NPF_TILE_LENGTH;
356 /* Increase the cost for level crossings */
357 if (IsLevelCrossing(tile)) cost += _settings_game.pf.npf.npf_crossing_penalty;
358 break;
360 case MP_STATION: {
361 cost = NPF_TILE_LENGTH;
362 const RoadStop *rs = RoadStop::GetByTile(tile, GetRoadStopType(tile));
363 if (IsDriveThroughStopTile(tile)) {
364 /* Increase the cost for drive-through road stops */
365 cost += _settings_game.pf.npf.npf_road_drive_through_penalty;
366 DiagDirection dir = TrackdirToExitdir(current->direction);
367 if (!RoadStop::IsDriveThroughRoadStopContinuation(tile, tile - TileOffsByDiagDir(dir))) {
368 /* When we're the first road stop in a 'queue' of them we increase
369 * cost based on the fill percentage of the whole queue. */
370 const RoadStop::Entry *entry = rs->GetEntry(dir);
371 cost += entry->GetOccupied() * _settings_game.pf.npf.npf_road_dt_occupied_penalty / entry->GetLength();
373 } else {
374 /* Increase cost for filled road stops */
375 cost += _settings_game.pf.npf.npf_road_bay_occupied_penalty * (!rs->IsFreeBay(0) + !rs->IsFreeBay(1)) / 2;
377 break;
380 default:
381 break;
384 /* Determine extra costs */
386 /* Check for slope */
387 cost += NPFSlopeCost(current);
389 /* Check for turns. Road vehicles only really drive diagonal, turns are
390 * represented by non-diagonal tracks */
391 if (!IsDiagonalTrackdir(current->direction)) {
392 cost += _settings_game.pf.npf.npf_road_curve_penalty;
395 NPFMarkTile(tile);
396 DEBUG(npf, 4, "Calculating G for: (%d, %d). Result: %d", TileX(current->tile), TileY(current->tile), cost);
397 return cost;
401 /* Determine the cost of this node, for railway tracks */
402 static int32 NPFRailPathCost(AyStar *as, AyStarNode *current, OpenListNode *parent)
404 TileIndex tile = current->tile;
405 Trackdir trackdir = current->direction;
406 int32 cost = 0;
407 /* HACK: We create a OpenListNode manually, so we can call EndNodeCheck */
408 OpenListNode new_node;
410 /* Determine base length */
411 switch (GetTileType(tile)) {
412 case MP_TUNNELBRIDGE:
413 cost = IsTunnel(tile) ? NPFTunnelCost(current) : NPFBridgeCost(current);
414 break;
416 case MP_RAILWAY:
417 cost = _trackdir_length[trackdir]; // Should be different for diagonal tracks
418 break;
420 case MP_ROAD: // Railway crossing
421 cost = NPF_TILE_LENGTH;
422 break;
424 case MP_STATION:
425 /* We give a station tile a penalty. Logically we would only want to give
426 * station tiles that are not our destination this penalty. This would
427 * discourage trains to drive through busy stations. But, we can just
428 * give any station tile a penalty, because every possible route will get
429 * this penalty exactly once, on its end tile (if it's a station) and it
430 * will therefore not make a difference. */
431 cost = NPF_TILE_LENGTH + _settings_game.pf.npf.npf_rail_station_penalty;
433 if (IsRailWaypoint(tile)) {
434 NPFFindStationOrTileData *fstd = (NPFFindStationOrTileData*)as->user_target;
435 if (fstd->v->current_order.IsType(OT_GOTO_WAYPOINT) && GetStationIndex(tile) == fstd->v->current_order.GetDestination()) {
436 /* This waypoint is our destination; maybe this isn't an unreserved
437 * one, so check that and if so see that as the last signal being
438 * red. This way waypoints near stations should work better. */
439 const Train *train = Train::From(fstd->v);
440 CFollowTrackRail ft(train);
441 TileIndex t = tile;
442 Trackdir td = trackdir;
443 while (ft.Follow(t, td)) {
444 assert(t != ft.m_new_tile);
445 t = ft.m_new_tile;
446 if (KillFirstBit(ft.m_new_td_bits) != TRACKDIR_BIT_NONE) {
447 /* We encountered a junction; it's going to be too complex to
448 * handle this perfectly, so just bail out. There is no simple
449 * free path, so try the other possibilities. */
450 td = INVALID_TRACKDIR;
451 break;
453 td = RemoveFirstTrackdir(&ft.m_new_td_bits);
454 /* If this is a safe waiting position we're done searching for it */
455 if (IsSafeWaitingPosition(train, t, td, true, _settings_game.pf.forbid_90_deg)) break;
457 if (td == INVALID_TRACKDIR ||
458 !IsSafeWaitingPosition(train, t, td, true, _settings_game.pf.forbid_90_deg) ||
459 !IsWaitingPositionFree(train, t, td, _settings_game.pf.forbid_90_deg)) {
460 cost += _settings_game.pf.npf.npf_rail_lastred_penalty;
464 break;
466 default:
467 break;
470 /* Determine extra costs */
472 /* Check for signals */
473 if (IsTileType(tile, MP_RAILWAY)) {
474 if (HasSignalOnTrackdir(tile, trackdir)) {
475 SignalType sigtype = GetSignalType(tile, TrackdirToTrack(trackdir));
476 /* Ordinary track with signals */
477 if (GetSignalStateByTrackdir(tile, trackdir) == SIGNAL_STATE_RED) {
478 /* Signal facing us is red */
479 if (!NPFGetFlag(current, NPF_FLAG_SEEN_SIGNAL)) {
480 /* Penalize the first signal we
481 * encounter, if it is red */
483 /* Is this a presignal exit or combo? */
484 if (!IsPbsSignal(sigtype)) {
485 if (sigtype == SIGTYPE_EXIT || sigtype == SIGTYPE_COMBO) {
486 /* Penalise exit and combo signals differently (heavier) */
487 cost += _settings_game.pf.npf.npf_rail_firstred_exit_penalty;
488 } else {
489 cost += _settings_game.pf.npf.npf_rail_firstred_penalty;
493 /* Record the state of this signal. Path signals are assumed to
494 * be green as the signal state of them has no meaning for this. */
495 NPFSetFlag(current, NPF_FLAG_LAST_SIGNAL_RED, !IsPbsSignal(sigtype));
496 } else {
497 /* Record the state of this signal */
498 NPFSetFlag(current, NPF_FLAG_LAST_SIGNAL_RED, false);
500 if (NPFGetFlag(current, NPF_FLAG_SEEN_SIGNAL)) {
501 if (NPFGetFlag(current, NPF_FLAG_2ND_SIGNAL)) {
502 NPFSetFlag(current, NPF_FLAG_3RD_SIGNAL, true);
503 } else {
504 NPFSetFlag(current, NPF_FLAG_2ND_SIGNAL, true);
506 } else {
507 NPFSetFlag(current, NPF_FLAG_SEEN_SIGNAL, true);
509 NPFSetFlag(current, NPF_FLAG_LAST_SIGNAL_BLOCK, !IsPbsSignal(sigtype));
512 if (HasPbsSignalOnTrackdir(tile, ReverseTrackdir(trackdir)) && !NPFGetFlag(current, NPF_FLAG_3RD_SIGNAL)) {
513 cost += _settings_game.pf.npf.npf_rail_pbs_signal_back_penalty;
517 /* Penalise the tile if it is a target tile and the last signal was
518 * red */
519 /* HACK: We create a new_node here so we can call EndNodeCheck. Ugly as hell
520 * of course... */
521 new_node.path.node = *current;
522 if (as->EndNodeCheck(as, &new_node) == AYSTAR_FOUND_END_NODE && NPFGetFlag(current, NPF_FLAG_LAST_SIGNAL_RED)) {
523 cost += _settings_game.pf.npf.npf_rail_lastred_penalty;
526 /* Check for slope */
527 cost += NPFSlopeCost(current);
529 /* Check for turns */
530 if (current->direction != NextTrackdir((Trackdir)parent->path.node.direction)) {
531 cost += _settings_game.pf.npf.npf_rail_curve_penalty;
533 /* TODO, with realistic acceleration, also the amount of straight track between
534 * curves should be taken into account, as this affects the speed limit. */
536 /* Check for reverse in depot */
537 if (IsRailDepotTile(tile) && as->EndNodeCheck(as, &new_node) != AYSTAR_FOUND_END_NODE) {
538 /* Penalise any depot tile that is not the last tile in the path. This
539 * _should_ penalise every occurrence of reversing in a depot (and only
540 * that) */
541 cost += _settings_game.pf.npf.npf_rail_depot_reverse_penalty;
544 /* Check for occupied track */
545 cost += NPFReservedTrackCost(current);
547 NPFMarkTile(tile);
548 DEBUG(npf, 4, "Calculating G for: (%d, %d). Result: %d", TileX(current->tile), TileY(current->tile), cost);
549 return cost;
552 /* Will find any depot */
553 static int32 NPFFindDepot(const AyStar *as, const OpenListNode *current)
555 AyStarUserData *user = (AyStarUserData *)as->user_data;
556 /* It's not worth caching the result with NPF_FLAG_IS_TARGET here as below,
557 * since checking the cache not that much faster than the actual check */
558 return IsDepotTypeTile(current->path.node.tile, user->type) ?
559 AYSTAR_FOUND_END_NODE : AYSTAR_DONE;
562 /** Find any safe and free tile. */
563 static int32 NPFFindSafeTile(const AyStar *as, const OpenListNode *current)
565 const Train *v = Train::From(((NPFFindStationOrTileData *)as->user_target)->v);
567 return (IsSafeWaitingPosition(v, current->path.node.tile, current->path.node.direction, true, _settings_game.pf.forbid_90_deg) &&
568 IsWaitingPositionFree(v, current->path.node.tile, current->path.node.direction, _settings_game.pf.forbid_90_deg)) ?
569 AYSTAR_FOUND_END_NODE : AYSTAR_DONE;
572 /* Will find a station identified using the NPFFindStationOrTileData */
573 static int32 NPFFindStationOrTile(const AyStar *as, const OpenListNode *current)
575 NPFFindStationOrTileData *fstd = (NPFFindStationOrTileData*)as->user_target;
576 const AyStarNode *node = &current->path.node;
577 TileIndex tile = node->tile;
579 if (fstd->station_index == INVALID_STATION && tile == fstd->dest_coords) return AYSTAR_FOUND_END_NODE;
581 if (fstd->v->type == VEH_SHIP) {
582 /* Ships do not actually reach the destination station, so we check for a docking tile instead. */
583 if (IsDockingTile(tile) && IsShipDestinationTile(tile, fstd->station_index)) return AYSTAR_FOUND_END_NODE;
584 return AYSTAR_DONE;
587 if (IsTileType(tile, MP_STATION) && GetStationIndex(tile) == fstd->station_index) {
588 if (fstd->v->type == VEH_TRAIN) return AYSTAR_FOUND_END_NODE;
590 assert(fstd->v->type == VEH_ROAD);
591 /* Only if it is a valid station *and* we can stop there */
592 if (GetStationType(tile) == fstd->station_type && (fstd->not_articulated || IsDriveThroughStopTile(tile))) return AYSTAR_FOUND_END_NODE;
594 return AYSTAR_DONE;
598 * Find the node containing the first signal on the path.
600 * If the first signal is on the very first two tiles of the path,
601 * the second signal is returned. If no suitable signal is present, the
602 * last node of the path is returned.
604 static const PathNode *FindSafePosition(PathNode *path, const Train *v)
606 /* If there is no signal, reserve the whole path. */
607 PathNode *sig = path;
609 for (; path->parent != nullptr; path = path->parent) {
610 if (IsSafeWaitingPosition(v, path->node.tile, path->node.direction, true, _settings_game.pf.forbid_90_deg)) {
611 sig = path;
615 return sig;
619 * Lift the reservation of the tiles from @p start till @p end, excluding @p end itself.
621 static void ClearPathReservation(const PathNode *start, const PathNode *end)
623 bool first_run = true;
624 for (; start != end; start = start->parent) {
625 if (IsRailStationTile(start->node.tile) && first_run) {
626 SetRailStationPlatformReservation(start->node.tile, TrackdirToExitdir(start->node.direction), false);
627 } else {
628 UnreserveRailTrack(start->node.tile, TrackdirToTrack(start->node.direction));
630 first_run = false;
635 * To be called when @p current contains the (shortest route to) the target node.
636 * Will fill the contents of the NPFFoundTargetData using
637 * AyStarNode[NPF_TRACKDIR_CHOICE]. If requested, path reservation
638 * is done here.
640 static void NPFSaveTargetData(AyStar *as, OpenListNode *current)
642 AyStarUserData *user = (AyStarUserData *)as->user_data;
643 NPFFoundTargetData *ftd = (NPFFoundTargetData*)as->user_path;
644 ftd->best_trackdir = (Trackdir)current->path.node.user_data[NPF_TRACKDIR_CHOICE];
645 ftd->best_path_dist = current->g;
646 ftd->best_bird_dist = 0;
647 ftd->node = current->path.node;
648 ftd->res_okay = false;
650 if (as->user_target != nullptr && ((NPFFindStationOrTileData*)as->user_target)->reserve_path && user->type == TRANSPORT_RAIL) {
651 /* Path reservation is requested. */
652 const Train *v = Train::From(((NPFFindStationOrTileData *)as->user_target)->v);
654 const PathNode *target = FindSafePosition(&current->path, v);
655 ftd->node = target->node;
657 /* If the target is a station skip to platform end. */
658 if (IsRailStationTile(target->node.tile)) {
659 DiagDirection dir = TrackdirToExitdir(target->node.direction);
660 uint len = Station::GetByTile(target->node.tile)->GetPlatformLength(target->node.tile, dir);
661 TileIndex end_tile = TILE_ADD(target->node.tile, (len - 1) * TileOffsByDiagDir(dir));
663 /* Update only end tile, trackdir of a station stays the same. */
664 ftd->node.tile = end_tile;
665 if (!IsWaitingPositionFree(v, end_tile, target->node.direction, _settings_game.pf.forbid_90_deg)) return;
666 SetRailStationPlatformReservation(target->node.tile, dir, true);
667 SetRailStationReservation(target->node.tile, false);
668 } else {
669 if (!IsWaitingPositionFree(v, target->node.tile, target->node.direction, _settings_game.pf.forbid_90_deg)) return;
672 for (const PathNode *cur = target; cur->parent != nullptr; cur = cur->parent) {
673 if (!TryReserveRailTrack(cur->node.tile, TrackdirToTrack(cur->node.direction))) {
674 /* Reservation failed, undo. */
675 ClearPathReservation(target, cur);
676 return;
680 ftd->res_okay = true;
685 * Finds out if a given company's vehicles are allowed to enter a given tile.
686 * @param owner The owner of the vehicle.
687 * @param tile The tile that is about to be entered.
688 * @param enterdir The direction in which the vehicle wants to enter the tile.
689 * @return true if the vehicle can enter the tile.
690 * @todo This function should be used in other places than just NPF,
691 * maybe moved to another file too.
693 static bool CanEnterTileOwnerCheck(Owner owner, TileIndex tile, DiagDirection enterdir)
695 if (IsTileType(tile, MP_RAILWAY) || // Rail tile (also rail depot)
696 HasStationTileRail(tile) || // Rail station tile/waypoint
697 IsRoadDepotTile(tile) || // Road depot tile
698 IsStandardRoadStopTile(tile)) { // Road station tile (but not drive-through stops)
699 return IsTileOwner(tile, owner); // You need to own these tiles entirely to use them
702 switch (GetTileType(tile)) {
703 case MP_ROAD:
704 /* rail-road crossing : are we looking at the railway part? */
705 if (IsLevelCrossing(tile) &&
706 DiagDirToAxis(enterdir) != GetCrossingRoadAxis(tile)) {
707 return IsTileOwner(tile, owner); // Railway needs owner check, while the street is public
709 break;
711 case MP_TUNNELBRIDGE:
712 if (GetTunnelBridgeTransportType(tile) == TRANSPORT_RAIL) {
713 return IsTileOwner(tile, owner);
715 break;
717 default:
718 break;
721 return true; // no need to check
726 * Returns the direction the exit of the depot on the given tile is facing.
728 static DiagDirection GetDepotDirection(TileIndex tile, TransportType type)
730 assert(IsDepotTypeTile(tile, type));
732 switch (type) {
733 case TRANSPORT_RAIL: return GetRailDepotDirection(tile);
734 case TRANSPORT_ROAD: return GetRoadDepotDirection(tile);
735 case TRANSPORT_WATER: return GetShipDepotDirection(tile);
736 default: return INVALID_DIAGDIR; // Not reached
740 /** Tests if a tile is a road tile with a single tramtrack (tram can reverse) */
741 static DiagDirection GetSingleTramBit(TileIndex tile)
743 if (IsNormalRoadTile(tile)) {
744 RoadBits rb = GetRoadBits(tile, RTT_TRAM);
745 switch (rb) {
746 case ROAD_NW: return DIAGDIR_NW;
747 case ROAD_SW: return DIAGDIR_SW;
748 case ROAD_SE: return DIAGDIR_SE;
749 case ROAD_NE: return DIAGDIR_NE;
750 default: break;
753 return INVALID_DIAGDIR;
757 * Tests if a tile can be entered or left only from one side.
759 * Depots, non-drive-through roadstops, and tiles with single trambits are tested.
761 * @param tile The tile of interest.
762 * @param type The transporttype of the vehicle.
763 * @param subtype For TRANSPORT_ROAD the compatible RoadTypes of the vehicle.
764 * @return The single entry/exit-direction of the tile, or INVALID_DIAGDIR if there are more or less directions
766 static DiagDirection GetTileSingleEntry(TileIndex tile, TransportType type, uint subtype)
768 if (type != TRANSPORT_WATER && IsDepotTypeTile(tile, type)) return GetDepotDirection(tile, type);
770 if (type == TRANSPORT_ROAD) {
771 if (IsStandardRoadStopTile(tile)) return GetRoadStopDir(tile);
772 if ((RoadTramType)subtype == RTT_TRAM) return GetSingleTramBit(tile);
775 return INVALID_DIAGDIR;
779 * Tests if a vehicle must reverse on a tile.
781 * @param tile The tile of interest.
782 * @param dir The direction in which the vehicle drives on a tile.
783 * @param type The transporttype of the vehicle.
784 * @param subtype For TRANSPORT_ROAD the compatible RoadTypes of the vehicle.
785 * @return true iff the vehicle must reverse on the tile.
787 static inline bool ForceReverse(TileIndex tile, DiagDirection dir, TransportType type, uint subtype)
789 DiagDirection single_entry = GetTileSingleEntry(tile, type, subtype);
790 return single_entry != INVALID_DIAGDIR && single_entry != dir;
794 * Tests if a vehicle can enter a tile.
796 * @param tile The tile of interest.
797 * @param dir The direction in which the vehicle drives onto a tile.
798 * @param user Vehicle information.
799 * @return true iff the vehicle can enter the tile.
801 static bool CanEnterTile(TileIndex tile, DiagDirection dir, AyStarUserData *user)
803 /* Check tunnel entries and bridge ramps */
804 if (IsTileType(tile, MP_TUNNELBRIDGE) && GetTunnelBridgeDirection(tile) != dir) return false;
806 /* Test ownership */
807 if (!CanEnterTileOwnerCheck(user->owner, tile, dir)) return false;
809 /* check correct rail type (mono, maglev, etc) */
810 switch (user->type) {
811 case TRANSPORT_RAIL: {
812 RailType rail_type = GetTileRailType(tile);
813 if (!HasBit(user->railtypes, rail_type)) return false;
814 break;
817 case TRANSPORT_ROAD: {
818 RoadType road_type = GetRoadType(tile, (RoadTramType)user->subtype);
819 if (!HasBit(user->roadtypes, road_type)) return false;
820 break;
823 default: break;
826 /* Depots, standard roadstops and single tram bits can only be entered from one direction */
827 DiagDirection single_entry = GetTileSingleEntry(tile, user->type, user->subtype);
828 if (single_entry != INVALID_DIAGDIR && single_entry != ReverseDiagDir(dir)) return false;
830 return true;
834 * Returns the driveable Trackdirs on a tile.
836 * One-way-roads are taken into account. Signals are not tested.
838 * @param dst_tile The tile of interest.
839 * @param src_tile The originating tile.
840 * @param src_trackdir The direction the vehicle is currently moving.
841 * @param type The transporttype of the vehicle.
842 * @param subtype For TRANSPORT_ROAD the compatible RoadTypes of the vehicle.
843 * @return The Trackdirs the vehicle can continue moving on.
845 static TrackdirBits GetDriveableTrackdirBits(TileIndex dst_tile, TileIndex src_tile, Trackdir src_trackdir, TransportType type, uint subtype)
847 TrackdirBits trackdirbits = TrackStatusToTrackdirBits(GetTileTrackStatus(dst_tile, type, subtype));
849 if (trackdirbits == TRACKDIR_BIT_NONE && type == TRANSPORT_ROAD && (RoadTramType)subtype == RTT_TRAM) {
850 /* GetTileTrackStatus() returns 0 for single tram bits.
851 * As we cannot change it there (easily) without breaking something, change it here */
852 switch (GetSingleTramBit(dst_tile)) {
853 case DIAGDIR_NE:
854 case DIAGDIR_SW:
855 trackdirbits = TRACKDIR_BIT_X_NE | TRACKDIR_BIT_X_SW;
856 break;
858 case DIAGDIR_NW:
859 case DIAGDIR_SE:
860 trackdirbits = TRACKDIR_BIT_Y_NW | TRACKDIR_BIT_Y_SE;
861 break;
863 default: break;
867 DEBUG(npf, 4, "Next node: (%d, %d) [%d], possible trackdirs: 0x%X", TileX(dst_tile), TileY(dst_tile), dst_tile, trackdirbits);
869 /* Select only trackdirs we can reach from our current trackdir */
870 trackdirbits &= TrackdirReachesTrackdirs(src_trackdir);
872 /* Filter out trackdirs that would make 90 deg turns for trains */
873 if (type == TRANSPORT_RAIL && Rail90DegTurnDisallowed(GetTileRailType(src_tile), GetTileRailType(dst_tile))) {
874 trackdirbits &= ~TrackdirCrossesTrackdirs(src_trackdir);
877 DEBUG(npf, 6, "After filtering: (%d, %d), possible trackdirs: 0x%X", TileX(dst_tile), TileY(dst_tile), trackdirbits);
879 return trackdirbits;
883 /* Will just follow the results of GetTileTrackStatus concerning where we can
884 * go and where not. Uses AyStar.user_data[NPF_TYPE] as the transport type and
885 * an argument to GetTileTrackStatus. Will skip tunnels, meaning that the
886 * entry and exit are neighbours. Will fill
887 * AyStarNode.user_data[NPF_TRACKDIR_CHOICE] with an appropriate value, and
888 * copy AyStarNode.user_data[NPF_NODE_FLAGS] from the parent */
889 static void NPFFollowTrack(AyStar *aystar, OpenListNode *current)
891 AyStarUserData *user = (AyStarUserData *)aystar->user_data;
892 /* We leave src_tile on track src_trackdir in direction src_exitdir */
893 Trackdir src_trackdir = current->path.node.direction;
894 TileIndex src_tile = current->path.node.tile;
895 DiagDirection src_exitdir = TrackdirToExitdir(src_trackdir);
897 /* Information about the vehicle: TransportType (road/rail/water) and SubType (compatible rail/road types) */
898 TransportType type = user->type;
899 uint subtype = user->subtype;
901 /* Initialize to 0, so we can jump out (return) somewhere an have no neighbours */
902 aystar->num_neighbours = 0;
903 DEBUG(npf, 4, "Expanding: (%d, %d, %d) [%d]", TileX(src_tile), TileY(src_tile), src_trackdir, src_tile);
905 /* We want to determine the tile we arrive, and which choices we have there */
906 TileIndex dst_tile;
907 TrackdirBits trackdirbits;
909 /* Find dest tile */
910 /* Is src_tile valid, and can be used?
911 * When choosing track on a junction src_tile is the tile neighboured to the junction wrt. exitdir.
912 * But we must not check the validity of this move, as src_tile is totally unrelated to the move, if a roadvehicle reversed on a junction. */
913 if (CheckIgnoreFirstTile(&current->path)) {
914 /* Do not perform any checks that involve src_tile */
915 dst_tile = src_tile + TileOffsByDiagDir(src_exitdir);
916 trackdirbits = GetDriveableTrackdirBits(dst_tile, src_tile, src_trackdir, type, subtype);
917 } else if (IsTileType(src_tile, MP_TUNNELBRIDGE) && GetTunnelBridgeDirection(src_tile) == src_exitdir) {
918 /* We drive through the wormhole and arrive on the other side */
919 dst_tile = GetOtherTunnelBridgeEnd(src_tile);
920 trackdirbits = TrackdirToTrackdirBits(src_trackdir);
921 } else if (ForceReverse(src_tile, src_exitdir, type, subtype)) {
922 /* We can only reverse on this tile */
923 dst_tile = src_tile;
924 src_trackdir = ReverseTrackdir(src_trackdir);
925 trackdirbits = TrackdirToTrackdirBits(src_trackdir);
926 } else {
927 /* We leave src_tile in src_exitdir and reach dst_tile */
928 dst_tile = AddTileIndexDiffCWrap(src_tile, TileIndexDiffCByDiagDir(src_exitdir));
930 if (dst_tile != INVALID_TILE && IsNormalRoadTile(dst_tile) && !CanEnterTile(dst_tile, src_exitdir, user)) dst_tile = INVALID_TILE;
932 if (dst_tile == INVALID_TILE) {
933 /* We cannot enter the next tile. Road vehicles can reverse, others reach dead end */
934 if (type != TRANSPORT_ROAD || (RoadTramType)subtype == RTT_TRAM) return;
936 dst_tile = src_tile;
937 src_trackdir = ReverseTrackdir(src_trackdir);
940 trackdirbits = GetDriveableTrackdirBits(dst_tile, src_tile, src_trackdir, type, subtype);
942 if (trackdirbits == TRACKDIR_BIT_NONE) {
943 /* We cannot enter the next tile. Road vehicles can reverse, others reach dead end */
944 if (type != TRANSPORT_ROAD || (RoadTramType)subtype == RTT_TRAM) return;
946 dst_tile = src_tile;
947 src_trackdir = ReverseTrackdir(src_trackdir);
949 trackdirbits = GetDriveableTrackdirBits(dst_tile, src_tile, src_trackdir, type, subtype);
953 if (NPFGetFlag(&current->path.node, NPF_FLAG_IGNORE_RESERVED)) {
954 /* Mask out any reserved tracks. */
955 TrackBits reserved = GetReservedTrackbits(dst_tile);
956 trackdirbits &= ~TrackBitsToTrackdirBits(reserved);
958 Track t;
959 FOR_EACH_SET_TRACK(t, TrackdirBitsToTrackBits(trackdirbits)) {
960 if (TracksOverlap(reserved | TrackToTrackBits(t))) trackdirbits &= ~TrackToTrackdirBits(t);
964 /* Enumerate possible track */
965 uint i = 0;
966 while (trackdirbits != TRACKDIR_BIT_NONE) {
967 Trackdir dst_trackdir = RemoveFirstTrackdir(&trackdirbits);
968 DEBUG(npf, 5, "Expanded into trackdir: %d, remaining trackdirs: 0x%X", dst_trackdir, trackdirbits);
970 /* Tile with signals? */
971 if (IsTileType(dst_tile, MP_RAILWAY) && GetRailTileType(dst_tile) == RAIL_TILE_SIGNALS) {
972 if (HasSignalOnTrackdir(dst_tile, ReverseTrackdir(dst_trackdir)) && !HasSignalOnTrackdir(dst_tile, dst_trackdir) && IsOnewaySignal(dst_tile, TrackdirToTrack(dst_trackdir))) {
973 /* If there's a one-way signal not pointing towards us, stop going in this direction. */
974 break;
978 /* We've found ourselves a neighbour :-) */
979 AyStarNode *neighbour = &aystar->neighbours[i];
980 neighbour->tile = dst_tile;
981 neighbour->direction = dst_trackdir;
982 /* Save user data */
983 neighbour->user_data[NPF_NODE_FLAGS] = current->path.node.user_data[NPF_NODE_FLAGS];
984 NPFFillTrackdirChoice(neighbour, current);
986 i++;
988 aystar->num_neighbours = i;
992 * Plan a route to the specified target (which is checked by target_proc),
993 * from start1 and if not nullptr, from start2 as well. The type of transport we
994 * are checking is in type. reverse_penalty is applied to all routes that
995 * originate from the second start node.
996 * When we are looking for one specific target (optionally multiple tiles), we
997 * should use a good heuristic to perform aystar search. When we search for
998 * multiple targets that are spread around, we should perform a breadth first
999 * search by specifying CalcZero as our heuristic.
1001 static NPFFoundTargetData NPFRouteInternal(AyStarNode *start1, bool ignore_start_tile1, AyStarNode *start2, bool ignore_start_tile2, NPFFindStationOrTileData *target, AyStar_EndNodeCheck target_proc, AyStar_CalculateH heuristic_proc, AyStarUserData *user, uint reverse_penalty, bool ignore_reserved = false, int max_penalty = 0)
1003 int r;
1004 NPFFoundTargetData result;
1006 /* Initialize procs */
1007 _npf_aystar.max_path_cost = max_penalty;
1008 _npf_aystar.CalculateH = heuristic_proc;
1009 _npf_aystar.EndNodeCheck = target_proc;
1010 _npf_aystar.FoundEndNode = NPFSaveTargetData;
1011 _npf_aystar.GetNeighbours = NPFFollowTrack;
1012 switch (user->type) {
1013 default: NOT_REACHED();
1014 case TRANSPORT_RAIL: _npf_aystar.CalculateG = NPFRailPathCost; break;
1015 case TRANSPORT_ROAD: _npf_aystar.CalculateG = NPFRoadPathCost; break;
1016 case TRANSPORT_WATER: _npf_aystar.CalculateG = NPFWaterPathCost; break;
1019 /* Initialize Start Node(s) */
1020 start1->user_data[NPF_TRACKDIR_CHOICE] = INVALID_TRACKDIR;
1021 start1->user_data[NPF_NODE_FLAGS] = 0;
1022 NPFSetFlag(start1, NPF_FLAG_IGNORE_START_TILE, ignore_start_tile1);
1023 NPFSetFlag(start1, NPF_FLAG_IGNORE_RESERVED, ignore_reserved);
1024 _npf_aystar.AddStartNode(start1, 0);
1025 if (start2 != nullptr) {
1026 start2->user_data[NPF_TRACKDIR_CHOICE] = INVALID_TRACKDIR;
1027 start2->user_data[NPF_NODE_FLAGS] = 0;
1028 NPFSetFlag(start2, NPF_FLAG_IGNORE_START_TILE, ignore_start_tile2);
1029 NPFSetFlag(start2, NPF_FLAG_REVERSE, true);
1030 NPFSetFlag(start2, NPF_FLAG_IGNORE_RESERVED, ignore_reserved);
1031 _npf_aystar.AddStartNode(start2, reverse_penalty);
1034 /* Initialize result */
1035 result.best_bird_dist = UINT_MAX;
1036 result.best_path_dist = UINT_MAX;
1037 result.best_trackdir = INVALID_TRACKDIR;
1038 result.node.tile = INVALID_TILE;
1039 result.res_okay = false;
1040 _npf_aystar.user_path = &result;
1042 /* Initialize target */
1043 _npf_aystar.user_target = target;
1045 /* Initialize user_data */
1046 _npf_aystar.user_data = user;
1048 /* GO! */
1049 r = _npf_aystar.Main();
1050 assert(r != AYSTAR_STILL_BUSY);
1052 if (result.best_bird_dist != 0) {
1053 if (target != nullptr) {
1054 DEBUG(npf, 1, "Could not find route to tile 0x%X from 0x%X.", target->dest_coords, start1->tile);
1055 } else {
1056 /* Assumption: target == nullptr, so we are looking for a depot */
1057 DEBUG(npf, 1, "Could not find route to a depot from tile 0x%X.", start1->tile);
1061 return result;
1064 /* Will search as below, but with two start nodes, the second being the
1065 * reverse. Look at the NPF_FLAG_REVERSE flag in the result node to see which
1066 * direction was taken (NPFGetFlag(result.node, NPF_FLAG_REVERSE)) */
1067 static NPFFoundTargetData NPFRouteToStationOrTileTwoWay(TileIndex tile1, Trackdir trackdir1, bool ignore_start_tile1, TileIndex tile2, Trackdir trackdir2, bool ignore_start_tile2, NPFFindStationOrTileData *target, AyStarUserData *user)
1069 AyStarNode start1;
1070 AyStarNode start2;
1072 start1.tile = tile1;
1073 start2.tile = tile2;
1074 start1.direction = trackdir1;
1075 start2.direction = trackdir2;
1077 return NPFRouteInternal(&start1, ignore_start_tile1, (IsValidTile(tile2) ? &start2 : nullptr), ignore_start_tile2, target, NPFFindStationOrTile, NPFCalcStationOrTileHeuristic, user, 0);
1080 /* Will search from the given tile and direction, for a route to the given
1081 * station for the given transport type. See the declaration of
1082 * NPFFoundTargetData above for the meaning of the result. */
1083 static NPFFoundTargetData NPFRouteToStationOrTile(TileIndex tile, Trackdir trackdir, bool ignore_start_tile, NPFFindStationOrTileData *target, AyStarUserData *user)
1085 return NPFRouteToStationOrTileTwoWay(tile, trackdir, ignore_start_tile, INVALID_TILE, INVALID_TRACKDIR, false, target, user);
1088 /* Search using breadth first. Good for little track choice and inaccurate
1089 * heuristic, such as railway/road with two start nodes, the second being the reverse. Call
1090 * NPFGetFlag(result.node, NPF_FLAG_REVERSE) to see from which node the path
1091 * originated. All paths from the second node will have the given
1092 * reverse_penalty applied (NPF_TILE_LENGTH is the equivalent of one full
1093 * tile).
1095 static NPFFoundTargetData NPFRouteToDepotBreadthFirstTwoWay(TileIndex tile1, Trackdir trackdir1, bool ignore_start_tile1, TileIndex tile2, Trackdir trackdir2, bool ignore_start_tile2, NPFFindStationOrTileData *target, AyStarUserData *user, uint reverse_penalty, int max_penalty)
1097 AyStarNode start1;
1098 AyStarNode start2;
1100 start1.tile = tile1;
1101 start2.tile = tile2;
1102 start1.direction = trackdir1;
1103 start2.direction = trackdir2;
1105 /* perform a breadth first search. Target is nullptr,
1106 * since we are just looking for any depot...*/
1107 return NPFRouteInternal(&start1, ignore_start_tile1, (IsValidTile(tile2) ? &start2 : nullptr), ignore_start_tile2, target, NPFFindDepot, NPFCalcZero, user, reverse_penalty, false, max_penalty);
1110 void InitializeNPF()
1112 static bool first_init = true;
1113 if (first_init) {
1114 first_init = false;
1115 _npf_aystar.Init(NPFHash, NPF_HASH_SIZE);
1116 } else {
1117 _npf_aystar.Clear();
1119 _npf_aystar.loops_per_tick = 0;
1120 _npf_aystar.max_path_cost = 0;
1121 //_npf_aystar.max_search_nodes = 0;
1122 /* We will limit the number of nodes for now, until we have a better
1123 * solution to really fix performance */
1124 _npf_aystar.max_search_nodes = _settings_game.pf.npf.npf_max_search_nodes;
1127 static void NPFFillWithOrderData(NPFFindStationOrTileData *fstd, const Vehicle *v, bool reserve_path = false)
1129 /* Ships don't really reach their stations, but the tile in front. So don't
1130 * save the station id for ships. For roadvehs we don't store it either,
1131 * because multistop depends on vehicles actually reaching the exact
1132 * dest_tile, not just any stop of that station.
1133 * So only for train orders to stations we fill fstd->station_index, for all
1134 * others only dest_coords */
1135 if (v->current_order.IsType(OT_GOTO_STATION) || v->current_order.IsType(OT_GOTO_WAYPOINT)) {
1136 fstd->station_index = v->current_order.GetDestination();
1137 if (v->type == VEH_TRAIN) {
1138 fstd->station_type = v->current_order.IsType(OT_GOTO_STATION) ? STATION_RAIL : STATION_WAYPOINT;
1139 } else if (v->type == VEH_ROAD) {
1140 fstd->station_type = RoadVehicle::From(v)->IsBus() ? STATION_BUS : STATION_TRUCK;
1141 } else if (v->type == VEH_SHIP) {
1142 fstd->station_type = v->current_order.IsType(OT_GOTO_STATION) ? STATION_DOCK : STATION_BUOY;
1145 fstd->not_articulated = v->type == VEH_ROAD && !RoadVehicle::From(v)->HasArticulatedPart();
1146 /* Let's take the closest tile of the station as our target for vehicles */
1147 fstd->dest_coords = CalcClosestStationTile(fstd->station_index, v->tile, fstd->station_type);
1148 } else {
1149 fstd->dest_coords = v->dest_tile;
1150 fstd->station_index = INVALID_STATION;
1152 fstd->reserve_path = reserve_path;
1153 fstd->v = v;
1156 /*** Road vehicles ***/
1158 FindDepotData NPFRoadVehicleFindNearestDepot(const RoadVehicle *v, int max_penalty)
1160 Trackdir trackdir = v->GetVehicleTrackdir();
1162 AyStarUserData user = { v->owner, TRANSPORT_ROAD, RAILTYPES_NONE, v->compatible_roadtypes, GetRoadTramType(v->roadtype) };
1163 NPFFoundTargetData ftd = NPFRouteToDepotBreadthFirstTwoWay(v->tile, trackdir, false, INVALID_TILE, INVALID_TRACKDIR, false, nullptr, &user, 0, max_penalty);
1165 if (ftd.best_bird_dist != 0) return FindDepotData();
1167 /* Found target */
1168 /* Our caller expects a number of tiles, so we just approximate that
1169 * number by this. It might not be completely what we want, but it will
1170 * work for now :-) We can possibly change this when the old pathfinder
1171 * is removed. */
1172 return FindDepotData(ftd.node.tile, ftd.best_path_dist);
1175 Trackdir NPFRoadVehicleChooseTrack(const RoadVehicle *v, TileIndex tile, DiagDirection enterdir, bool &path_found)
1177 NPFFindStationOrTileData fstd;
1179 NPFFillWithOrderData(&fstd, v);
1180 Trackdir trackdir = DiagDirToDiagTrackdir(enterdir);
1182 AyStarUserData user = { v->owner, TRANSPORT_ROAD, RAILTYPES_NONE, v->compatible_roadtypes, GetRoadTramType(v->roadtype) };
1183 NPFFoundTargetData ftd = NPFRouteToStationOrTile(tile - TileOffsByDiagDir(enterdir), trackdir, true, &fstd, &user);
1185 assert(ftd.best_trackdir != INVALID_TRACKDIR);
1187 /* If ftd.best_bird_dist is 0, we found our target and ftd.best_trackdir contains
1188 * the direction we need to take to get there, if ftd.best_bird_dist is not 0,
1189 * we did not find our target, but ftd.best_trackdir contains the direction leading
1190 * to the tile closest to our target. */
1191 path_found = (ftd.best_bird_dist == 0);
1192 return ftd.best_trackdir;
1195 /*** Ships ***/
1197 Track NPFShipChooseTrack(const Ship *v, bool &path_found)
1199 NPFFindStationOrTileData fstd;
1200 Trackdir trackdir = v->GetVehicleTrackdir();
1201 assert(trackdir != INVALID_TRACKDIR); // Check that we are not in a depot
1203 NPFFillWithOrderData(&fstd, v);
1205 AyStarUserData user = { v->owner, TRANSPORT_WATER, RAILTYPES_NONE, ROADTYPES_NONE, 0 };
1206 NPFFoundTargetData ftd = NPFRouteToStationOrTile(v->tile, trackdir, true, &fstd, &user);
1208 assert(ftd.best_trackdir != INVALID_TRACKDIR);
1210 /* If ftd.best_bird_dist is 0, we found our target and ftd.best_trackdir contains
1211 * the direction we need to take to get there, if ftd.best_bird_dist is not 0,
1212 * we did not find our target, but ftd.best_trackdir contains the direction leading
1213 * to the tile closest to our target. */
1214 path_found = (ftd.best_bird_dist == 0);
1215 return TrackdirToTrack(ftd.best_trackdir);
1218 bool NPFShipCheckReverse(const Ship *v)
1220 NPFFindStationOrTileData fstd;
1221 NPFFoundTargetData ftd;
1223 NPFFillWithOrderData(&fstd, v);
1225 Trackdir trackdir = v->GetVehicleTrackdir();
1226 Trackdir trackdir_rev = ReverseTrackdir(trackdir);
1227 assert(trackdir != INVALID_TRACKDIR);
1228 assert(trackdir_rev != INVALID_TRACKDIR);
1230 AyStarUserData user = { v->owner, TRANSPORT_WATER, RAILTYPES_NONE, ROADTYPES_NONE, 0 };
1231 ftd = NPFRouteToStationOrTileTwoWay(v->tile, trackdir, false, v->tile, trackdir_rev, false, &fstd, &user);
1232 /* If we didn't find anything, just keep on going straight ahead, otherwise take the reverse flag */
1233 return ftd.best_bird_dist == 0 && NPFGetFlag(&ftd.node, NPF_FLAG_REVERSE);
1236 /*** Trains ***/
1238 FindDepotData NPFTrainFindNearestDepot(const Train *v, int max_penalty)
1240 const Train *last = v->Last();
1241 Trackdir trackdir = v->GetVehicleTrackdir();
1242 Trackdir trackdir_rev = ReverseTrackdir(last->GetVehicleTrackdir());
1243 NPFFindStationOrTileData fstd;
1244 fstd.v = v;
1245 fstd.reserve_path = false;
1247 assert(trackdir != INVALID_TRACKDIR);
1248 AyStarUserData user = { v->owner, TRANSPORT_RAIL, v->compatible_railtypes, ROADTYPES_NONE, 0 };
1249 NPFFoundTargetData ftd = NPFRouteToDepotBreadthFirstTwoWay(v->tile, trackdir, false, last->tile, trackdir_rev, false, &fstd, &user, NPF_INFINITE_PENALTY, max_penalty);
1250 if (ftd.best_bird_dist != 0) return FindDepotData();
1252 /* Found target */
1253 /* Our caller expects a number of tiles, so we just approximate that
1254 * number by this. It might not be completely what we want, but it will
1255 * work for now :-) We can possibly change this when the old pathfinder
1256 * is removed. */
1257 return FindDepotData(ftd.node.tile, ftd.best_path_dist, NPFGetFlag(&ftd.node, NPF_FLAG_REVERSE));
1260 bool NPFTrainFindNearestSafeTile(const Train *v, TileIndex tile, Trackdir trackdir, bool override_railtype)
1262 assert(v->type == VEH_TRAIN);
1264 NPFFindStationOrTileData fstd;
1265 fstd.v = v;
1266 fstd.reserve_path = true;
1268 AyStarNode start1;
1269 start1.tile = tile;
1270 start1.direction = trackdir;
1272 RailTypes railtypes = v->compatible_railtypes;
1273 if (override_railtype) railtypes |= GetRailTypeInfo(v->railtype)->compatible_railtypes;
1275 /* perform a breadth first search. Target is nullptr,
1276 * since we are just looking for any safe tile...*/
1277 AyStarUserData user = { v->owner, TRANSPORT_RAIL, railtypes, ROADTYPES_NONE, 0 };
1278 return NPFRouteInternal(&start1, true, nullptr, false, &fstd, NPFFindSafeTile, NPFCalcZero, &user, 0, true).res_okay;
1281 bool NPFTrainCheckReverse(const Train *v)
1283 NPFFindStationOrTileData fstd;
1284 NPFFoundTargetData ftd;
1285 const Train *last = v->Last();
1287 NPFFillWithOrderData(&fstd, v);
1289 Trackdir trackdir = v->GetVehicleTrackdir();
1290 Trackdir trackdir_rev = ReverseTrackdir(last->GetVehicleTrackdir());
1291 assert(trackdir != INVALID_TRACKDIR);
1292 assert(trackdir_rev != INVALID_TRACKDIR);
1294 AyStarUserData user = { v->owner, TRANSPORT_RAIL, v->compatible_railtypes, ROADTYPES_NONE, 0 };
1295 ftd = NPFRouteToStationOrTileTwoWay(v->tile, trackdir, false, last->tile, trackdir_rev, false, &fstd, &user);
1296 /* If we didn't find anything, just keep on going straight ahead, otherwise take the reverse flag */
1297 return ftd.best_bird_dist == 0 && NPFGetFlag(&ftd.node, NPF_FLAG_REVERSE);
1300 Track NPFTrainChooseTrack(const Train *v, bool &path_found, bool reserve_track, struct PBSTileInfo *target)
1302 NPFFindStationOrTileData fstd;
1303 NPFFillWithOrderData(&fstd, v, reserve_track);
1305 PBSTileInfo origin = FollowTrainReservation(v);
1306 assert(IsValidTrackdir(origin.trackdir));
1308 AyStarUserData user = { v->owner, TRANSPORT_RAIL, v->compatible_railtypes, ROADTYPES_NONE, 0 };
1309 NPFFoundTargetData ftd = NPFRouteToStationOrTile(origin.tile, origin.trackdir, true, &fstd, &user);
1311 if (target != nullptr) {
1312 target->tile = ftd.node.tile;
1313 target->trackdir = (Trackdir)ftd.node.direction;
1314 target->okay = ftd.res_okay;
1317 assert(ftd.best_trackdir != INVALID_TRACKDIR);
1319 /* If ftd.best_bird_dist is 0, we found our target and ftd.best_trackdir contains
1320 * the direction we need to take to get there, if ftd.best_bird_dist is not 0,
1321 * we did not find our target, but ftd.best_trackdir contains the direction leading
1322 * to the tile closest to our target. */
1323 path_found = (ftd.best_bird_dist == 0);
1324 /* Discard enterdir information, making it a normal track */
1325 return TrackdirToTrack(ftd.best_trackdir);