1

#ifndef NPF_H

     2

#define NPF_H

     3

     4

#include "openttd.h"

     5

#include "aystar.h"

     6

#include "vehicle.h"

     7

#include "tile.h"

     8

#include "rail.h"

     9

    10

//mowing grass

    11

enum {

    12

	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. */

    13

	/* Do no change below values */

    14

	NPF_HASH_SIZE = 1 << NPF_HASH_BITS,

    15

	NPF_HASH_HALFBITS = NPF_HASH_BITS / 2,

    16

	NPF_HASH_HALFMASK = (1 << NPF_HASH_HALFBITS) - 1

    17

};

    18

    19

enum {

    20

	/** This penalty is the equivalent of "inifite", which means that paths that

    21

	 * get this penalty will be chosen, but only if there is no other route

    22

	 * without it. Be careful with not applying this penalty to often, or the

    23

	 * total path cost might overflow..

    24

	 * For now, this is just a Very Big Penalty, we might actually implement

    25

	 * this in a nicer way :-)

    26

	 */

    27

	NPF_INFINITE_PENALTY = 1000 * NPF_TILE_LENGTH

    28

};

    29

    30

typedef struct NPFFindStationOrTileData { /* Meant to be stored in AyStar.targetdata */

    31

	TileIndex dest_coords; /* An indication of where the station is, for heuristic purposes, or the target tile */

    32

	int station_index; /* station index we're heading for, or -1 when we're heading for a tile */

    33

} NPFFindStationOrTileData;

    34

    35

enum { /* Indices into AyStar.userdata[] */

    36

	NPF_TYPE = 0, /* Contains a TransportTypes value */

    37

	NPF_OWNER, /* Contains an Owner value */

    38

};

    39

    40

enum { /* Indices into AyStarNode.userdata[] */

    41

	NPF_TRACKDIR_CHOICE = 0, /* The trackdir chosen to get here */

    42

	NPF_NODE_FLAGS,

    43

};

    44

typedef enum { /* Flags for AyStarNode.userdata[NPF_NODE_FLAGS]. Use NPFGetBit() and NPFGetBit() to use them. */

    45

	NPF_FLAG_SEEN_SIGNAL, /* Used to mark that a signal was seen on the way, for rail only */

    46

	NPF_FLAG_REVERSE, /* Used to mark that this node was reached from the second start node, if applicable */

    47

	NPF_FLAG_LAST_SIGNAL_RED, /* Used to mark that the last signal on this path was red */

    48

} NPFNodeFlag;

    49

    50

typedef struct NPFFoundTargetData { /* Meant to be stored in AyStar.userpath */

    51

	uint best_bird_dist; /* The best heuristic found. Is 0 if the target was found */

    52

	uint best_path_dist; /* The shortest path. Is (uint)-1 if no path is found */

    53

	Trackdir best_trackdir; /* The trackdir that leads to the shortest path/closest birds dist */

    54

	AyStarNode node; /* The node within the target the search led us to */

    55

} NPFFoundTargetData;

    56

    57

/* These functions below are _not_ re-entrant, in favor of speed! */

    58

    59

/* Will search from the given tile and direction, for a route to the given

    60

 * station for the given transport type. See the declaration of

    61

 * NPFFoundTargetData above for the meaning of the result. */

    62

NPFFoundTargetData NPFRouteToStationOrTile(TileIndex tile, Trackdir trackdir, NPFFindStationOrTileData* target, TransportType type, Owner owner);

    63

/* Will search as above, but with two start nodes, the second being the

    64

 * reverse. Look at the NPF_FLAG_REVERSE flag in the result node to see which

    65

 * direction was taken (NPFGetBit(result.node, NPF_FLAG_REVERSE)) */

    66

NPFFoundTargetData NPFRouteToStationOrTileTwoWay(TileIndex tile1, Trackdir trackdir1, TileIndex tile2, Trackdir trackdir2, NPFFindStationOrTileData* target, TransportType type, Owner owner);

    67

    68

/* Will search a route to the closest depot. */

    69

    70

/* Search using breadth first. Good for little track choice and inaccurate

    71

 * heuristic, such as railway/road.*/

    72

NPFFoundTargetData NPFRouteToDepotBreadthFirst(TileIndex tile, Trackdir trackdir, TransportType type, Owner owner);

    73

/* Same as above but with two start nodes, the second being the reverse. Call

    74

 * NPFGetBit(result.node, NPF_FLAG_REVERSE) to see from which node the path

    75

 * orginated. All pathfs from the second node will have the given

    76

 * reverse_penalty applied (NPF_TILE_LENGTH is the equivalent of one full

    77

 * tile).

    78

 */

    79

NPFFoundTargetData NPFRouteToDepotBreadthFirstTwoWay(TileIndex tile1, Trackdir trackdir1, TileIndex tile2, Trackdir trackdir2, TransportType type, Owner owner, uint reverse_penalty);

    80

/* Search by trying each depot in order of Manhattan Distance. Good for lots

    81

 * of choices and accurate heuristics, such as water. */

    82

NPFFoundTargetData NPFRouteToDepotTrialError(TileIndex tile, Trackdir trackdir, TransportType type, Owner owner);

    83

    84

void NPFFillWithOrderData(NPFFindStationOrTileData* fstd, Vehicle* v);

    85

    86

    87

/*

    88

 * Functions to manipulate the various NPF related flags on an AyStarNode.

    89

 */

    90

    91

/**

    92

 * Returns the current value of the given flag on the given AyStarNode.

    93

 */

    94

static inline bool NPFGetFlag(const AyStarNode* node, NPFNodeFlag flag)

    95

{

    96

	return HASBIT(node->user_data[NPF_NODE_FLAGS], flag);

    97

}

    98

    99

/**

   100

 * Sets the given flag on the given AyStarNode to the given value.

   101

 */

   102

static inline void NPFSetFlag(AyStarNode* node, NPFNodeFlag flag, bool value)

   103

{

   104

	if (value)

   105

		SETBIT(node->user_data[NPF_NODE_FLAGS], flag);

   106

	else

   107

		CLRBIT(node->user_data[NPF_NODE_FLAGS], flag);

   108

}

   109

   110

#endif // NPF_H