1

/* $Id$ */

     2

     3

/** @file yapf_base.hpp */

     4

     5

#ifndef  YAPF_BASE_HPP

     6

#define  YAPF_BASE_HPP

     7

     8

#include "../debug.h"

     9

    10

extern int _total_pf_time_us;

    11

    12

/** CYapfBaseT - A-star type path finder base class.

    13

 *  Derive your own pathfinder from it. You must provide the following template argument:

    14

 *    Types      - used as collection of local types used in pathfinder

    15

 *

    16

 * Requirements for the Types struct:

    17

 *  ----------------------------------

    18

 *  The following types must be defined in the 'Types' argument:

    19

 *    - Types::Tpf - your pathfinder derived from CYapfBaseT

    20

 *    - Types::NodeList - open/closed node list (look at CNodeList_HashTableT)

    21

 *  NodeList needs to have defined local type Titem - defines the pathfinder node type.

    22

 *  Node needs to define local type Key - the node key in the collection ()

    23

 *

    24

 *  For node list you can use template class CNodeList_HashTableT, for which

    25

 *  you need to declare only your node type. Look at test_yapf.h for an example.

    26

 *

    27

 *

    28

 *  Requrements to your pathfinder class derived from CYapfBaseT:

    29

 *  -------------------------------------------------------------

    30

 *  Your pathfinder derived class needs to implement following methods:

    31

 *    FORCEINLINE void PfSetStartupNodes()

    32

 *    FORCEINLINE void PfFollowNode(Node& org)

    33

 *    FORCEINLINE bool PfCalcCost(Node& n)

    34

 *    FORCEINLINE bool PfCalcEstimate(Node& n)

    35

 *    FORCEINLINE bool PfDetectDestination(Node& n)

    36

 *

    37

 *  For more details about those methods, look at the end of CYapfBaseT

    38

 *  declaration. There are some examples. For another example look at

    39

 *  test_yapf.h (part or unittest project).

    40

 */

    41

template <class Types>

    42

class CYapfBaseT {

    43

public:

    44

	typedef typename Types::Tpf Tpf;           ///< the pathfinder class (derived from THIS class)

    46

	typedef typename Types::NodeList NodeList; ///< our node list

    47

	typedef typename NodeList::Titem Node;     ///< this will be our node type

    48

	typedef typename Node::Key Key;            ///< key to hash tables

    49

    50

    51

	NodeList             m_nodes;              ///< node list multi-container

    52

protected:

    53

	Node*                m_pBestDestNode;      ///< pointer to the destination node found at last round

    54

	Node*                m_pBestIntermediateNode; ///< here should be node closest to the destination if path not found

    55

	const YapfSettings  *m_settings;           ///< current settings (_patches.yapf)

    56

	int                  m_max_search_nodes;   ///< maximum number of nodes we are allowed to visit before we give up

    57

	const Vehicle*       m_veh;                ///< vehicle that we are trying to drive

    58

    59

	int                  m_stats_cost_calcs;   ///< stats - how many node's costs were calculated

    60

	int                  m_stats_cache_hits;   ///< stats - how many node's costs were reused from cache

    61

    62

public:

    63

	CPerformanceTimer    m_perf_cost;          ///< stats - total CPU time of this run

    64

	CPerformanceTimer    m_perf_slope_cost;    ///< stats - slope calculation CPU time

    65

	CPerformanceTimer    m_perf_ts_cost;       ///< stats - GetTrackStatus() CPU time

    66

	CPerformanceTimer    m_perf_other_cost;    ///< stats - other CPU time

    67

    68

public:

    69

	int                  m_num_steps;          ///< this is there for debugging purposes (hope it doesn't hurt)

    70

    71

public:

    72

	/// default constructor

    73

	FORCEINLINE CYapfBaseT()

    74

		: m_pBestDestNode(NULL)

    75

		, m_pBestIntermediateNode(NULL)

    76

		, m_settings(&_patches.yapf)

    77

		, m_max_search_nodes(PfGetSettings().max_search_nodes)

    78

		, m_veh(NULL)

    79

		, m_stats_cost_calcs(0)

    80

		, m_stats_cache_hits(0)

    81

		, m_num_steps(0)

    82

	{

    83

	}

    84

    85

	/// default destructor

    86

	~CYapfBaseT() {}

    87

    88

protected:

    89

	/// to access inherited path finder

    90

	FORCEINLINE Tpf& Yapf() {return *static_cast<Tpf*>(this);}

    91

    92

public:

    93

	/// return current settings (can be custom - player based - but later)

    94

	FORCEINLINE const YapfSettings& PfGetSettings() const

    95

	{

    96

		return *m_settings;

    97

	}

    98

    99

	/** Main pathfinder routine:

   100

	 *   - set startup node(s)

   101

	 *   - main loop that stops if:

   102

	 *      - the destination was found

   103

	 *      - or the open list is empty (no route to destination).

   104

	 *      - or the maximum amount of loops reached - m_max_search_nodes (default = 10000)

   105

	 * @return true if the path was found */

   106

	inline bool FindPath(const Vehicle *v)

   107

	{

   108

		m_veh = v;

   109

   110

#ifndef NO_DEBUG_MESSAGES

   111

		CPerformanceTimer perf;

   112

		perf.Start();

   113

#endif /* !NO_DEBUG_MESSAGES */

   114

   115

		Yapf().PfSetStartupNodes();

   116

   117

		while (true) {

   118

			m_num_steps++;

   119

			Node *n = m_nodes.GetBestOpenNode();

   120

			if (n == NULL) break;

   121

   122

			// if the best open node was worse than the best path found, we can finish

   123

			if (m_pBestDestNode != NULL && m_pBestDestNode->GetCost() < n->GetCostEstimate())

   124

				break;

   125

   126

			Yapf().PfFollowNode(*n);

   127

			if (m_max_search_nodes == 0 || m_nodes.ClosedCount() < m_max_search_nodes) {

   128

				m_nodes.PopOpenNode(n->GetKey());

   129

				m_nodes.InsertClosedNode(*n);

   130

			} else {

   131

				m_pBestDestNode = m_pBestIntermediateNode;

   132

				break;

   133

			}

   134

		}

   135

   136

		bool bDestFound = (m_pBestDestNode != NULL) && (m_pBestDestNode != m_pBestIntermediateNode);

   137

   138

#ifndef NO_DEBUG_MESSAGES

   139

		perf.Stop();

   140

		if (_debug_yapf_level >= 3) {

   141

			int t = perf.Get(1000000);

   142

			_total_pf_time_us += t;

   143

   144

			UnitID veh_idx = (m_veh != NULL) ? m_veh->unitnumber : 0;

   145

			char ttc = Yapf().TransportTypeChar();

   146

			float cache_hit_ratio = (m_stats_cache_hits == 0) ? 0.0f : ((float)m_stats_cache_hits / (float)(m_stats_cache_hits + m_stats_cost_calcs) * 100.0f);

   147

			int cost = bDestFound ? m_pBestDestNode->m_cost : -1;

   148

			int dist = bDestFound ? m_pBestDestNode->m_estimate - m_pBestDestNode->m_cost : -1;

   149

   150

			DEBUG(yapf, 3, "[YAPF%c]%c%4d- %d us - %d rounds - %d open - %d closed - CHR %4.1f%% - c%d(sc%d, ts%d, o%d) -- ",

   151

			  ttc, bDestFound ? '-' : '!', veh_idx, t, m_num_steps, m_nodes.OpenCount(), m_nodes.ClosedCount(),

   152

			  cache_hit_ratio, cost, dist, m_perf_cost.Get(1000000), m_perf_slope_cost.Get(1000000),

   153

			  m_perf_ts_cost.Get(1000000), m_perf_other_cost.Get(1000000)

   154

			);

   155

		}

   156

#endif /* !NO_DEBUG_MESSAGES */

   157

		return bDestFound;

   158

	}

   159

   160

	/** If path was found return the best node that has reached the destination. Otherwise

   161

	 *  return the best visited node (which was nearest to the destination).

   162

	 */

   163

	FORCEINLINE Node& GetBestNode()

   164

	{

   165

		return (m_pBestDestNode != NULL) ? *m_pBestDestNode : *m_pBestIntermediateNode;

   166

	}

   167

   168

	/** Calls NodeList::CreateNewNode() - allocates new node that can be filled and used

   169

	 *  as argument for AddStartupNode() or AddNewNode()

   170

	 */

   171

	FORCEINLINE Node& CreateNewNode()

   172

	{

   173

		Node& node = *m_nodes.CreateNewNode();

   174

		return node;

   175

	}

   176

   177

	/** Add new node (created by CreateNewNode and filled with data) into open list */

   178

	FORCEINLINE void AddStartupNode(Node& n)

   179

	{

   180

		Yapf().PfNodeCacheFetch(n);

   181

		// insert the new node only if it is not there

   182

		if (m_nodes.FindOpenNode(n.m_key) == NULL) {

   183

			m_nodes.InsertOpenNode(n);

   184

		} else {

   185

			// if we are here, it means that node is already there - how it is possible?

   186

			//   probably the train is in the position that both its ends point to the same tile/exit-dir

   187

			//   very unlikely, but it happened

   188

		}

   189

	}

   190

   191

	/** add multiple nodes - direct children of the given node */

   193

	{

   196

			Trackdir td = (Trackdir)FindFirstBit2x64(rtds);

   197

			Node& n = Yapf().CreateNewNode();

   200

		}

   201

	}

   202

   203

	/** AddNewNode() - called by Tderived::PfFollowNode() for each child node.

   204

	 *  Nodes are evaluated here and added into open list */

   206

	{

   207

		// evaluate the node

   208

		bool bCached = Yapf().PfNodeCacheFetch(n);

   209

		if (!bCached) {

   210

			m_stats_cost_calcs++;

   211

		} else {

   212

			m_stats_cache_hits++;

   213

		}

   214

   216

   217

		if (bCached) {

   218

			Yapf().PfNodeCacheFlush(n);

   219

		}

   220

   221

		if (bValid) bValid = Yapf().PfCalcEstimate(n);

   222

   223

		// have the cost or estimate callbacks marked this node as invalid?

   224

		if (!bValid) return;

   225

   226

		// detect the destination

   227

		bool bDestination = Yapf().PfDetectDestination(n);

   228

		if (bDestination) {

   229

			if (m_pBestDestNode == NULL || n < *m_pBestDestNode) {

   230

				m_pBestDestNode = &n;

   231

			}

   232

			m_nodes.FoundBestNode(n);

   233

			return;

   234

		}

   235

   236

		if (m_max_search_nodes > 0 && (m_pBestIntermediateNode == NULL || (m_pBestIntermediateNode->GetCostEstimate() - m_pBestIntermediateNode->GetCost()) > (n.GetCostEstimate() - n.GetCost()))) {

   237

			m_pBestIntermediateNode = &n;

   238

		}

   239

   240

		// check new node against open list

   241

		Node* openNode = m_nodes.FindOpenNode(n.GetKey());

   242

		if (openNode != NULL) {

   243

			// another node exists with the same key in the open list

   244

			// is it better than new one?

   245

			if (n.GetCostEstimate() < openNode->GetCostEstimate()) {

   246

				// update the old node by value from new one

   247

				m_nodes.PopOpenNode(n.GetKey());

   248

				*openNode = n;

   249

				// add the updated old node back to open list

   250

				m_nodes.InsertOpenNode(*openNode);

   251

			}

   252

			return;

   253

		}

   254

   255

		// check new node against closed list

   256

		Node* closedNode = m_nodes.FindClosedNode(n.GetKey());

   257

		if (closedNode != NULL) {

   258

			// another node exists with the same key in the closed list

   259

			// is it better than new one?

   260

			int node_est = n.GetCostEstimate();

   261

			int closed_est = closedNode->GetCostEstimate();

   262

			if (node_est < closed_est) {

   263

				// If this assert occurs, you have probably problem in

   264

				// your Tderived::PfCalcCost() or Tderived::PfCalcEstimate().

   265

				// The problem could be:

   266

				//  - PfCalcEstimate() gives too large numbers

   267

				//  - PfCalcCost() gives too small numbers

   268

				//  - You have used negative cost penalty in some cases (cost bonus)

   269

				assert(0);

   270

   271

				return;

   272

			}

   273

			return;

   274

		}

   275

		// the new node is really new

   276

		// add it to the open list

   277

		m_nodes.InsertOpenNode(n);

   278

	}

   279

   280

	const Vehicle* GetVehicle() const {return m_veh;}

   281

   282

	// methods that should be implemented at derived class Types::Tpf (derived from CYapfBaseT)

   283

   284

#if 0

   285

	/** Example: PfSetStartupNodes() - set source (origin) nodes */

   286

	FORCEINLINE void PfSetStartupNodes()

   287

	{

   288

		// example:

   289

		Node& n1 = *base::m_nodes.CreateNewNode();

   290

		.

   291

		. // setup node members here

   292

		.

   293

		base::m_nodes.InsertOpenNode(n1);

   294

	}

   295

   296

	/** Example: PfFollowNode() - set following (child) nodes of the given node */

   297

	FORCEINLINE void PfFollowNode(Node& org)

   298

	{

   299

		for (each follower of node org) {

   300

			Node& n = *base::m_nodes.CreateNewNode();

   301

			.

   302

			. // setup node members here

   303

			.

   304

			n.m_parent   = &org; // set node's parent to allow back tracking

   305

			AddNewNode(n);

   306

		}

   307

	}

   308

   309

	/** Example: PfCalcCost() - set path cost from origin to the given node */

   310

	FORCEINLINE bool PfCalcCost(Node& n)

   311

	{

   312

		// evaluate last step cost

   313

		int cost = ...;

   314

		// set the node cost as sum of parent's cost and last step cost

   315

		n.m_cost = n.m_parent->m_cost + cost;

   316

		return true; // true if node is valid follower (i.e. no obstacle was found)

   317

	}

   318

   319

	/** Example: PfCalcEstimate() - set path cost estimate from origin to the target through given node */

   320

	FORCEINLINE bool PfCalcEstimate(Node& n)

   321

	{

   322

		// evaluate the distance to our destination

   323

		int distance = ...;

   324

		// set estimate as sum of cost from origin + distance to the target

   325

		n.m_estimate = n.m_cost + distance;

   326

		return true; // true if node is valid (i.e. not too far away :)

   327

	}

   328

   329

	/** Example: PfDetectDestination() - return true if the given node is our destination */

   330

	FORCEINLINE bool PfDetectDestination(Node& n)

   331

	{

   332

		bool bDest = (n.m_key.m_x == m_x2) && (n.m_key.m_y == m_y2);

   333

		return bDest;

   334

	}

   335

#endif

   336

};

   337

   338

#endif /* YAPF_BASE_HPP */