mirror of https://github.com/OpenTTD/OpenTTD
Fix: Do not send vehicles towards incomplete PF nodes
YAPF could end up in a situation where it sets the best intermediate node to a node whose construction is never finalized (i.e. it is never added to the open list). The content of the node would be overwritten in the next round, potentially sending the vehicle to an unwanted location.pull/9306/head
parent
7713c3e3cc
commit
0125ba82e8
|
@ -252,9 +252,9 @@ public:
|
|||
return;
|
||||
}
|
||||
|
||||
if (m_max_search_nodes > 0 && (m_pBestIntermediateNode == nullptr || (m_pBestIntermediateNode->GetCostEstimate() - m_pBestIntermediateNode->GetCost()) > (n.GetCostEstimate() - n.GetCost()))) {
|
||||
m_pBestIntermediateNode = &n;
|
||||
}
|
||||
/* The new node can be set as the best intermediate node only once we're
|
||||
* certain it will be finalized by being inserted into the open list. */
|
||||
bool set_intermediate = m_max_search_nodes > 0 && (m_pBestIntermediateNode == nullptr || (m_pBestIntermediateNode->GetCostEstimate() - m_pBestIntermediateNode->GetCost()) > (n.GetCostEstimate() - n.GetCost()));
|
||||
|
||||
/* check new node against open list */
|
||||
Node *openNode = m_nodes.FindOpenNode(n.GetKey());
|
||||
|
@ -267,6 +267,7 @@ public:
|
|||
*openNode = n;
|
||||
/* add the updated old node back to open list */
|
||||
m_nodes.InsertOpenNode(*openNode);
|
||||
if (set_intermediate) m_pBestIntermediateNode = openNode;
|
||||
}
|
||||
return;
|
||||
}
|
||||
|
@ -292,6 +293,7 @@ public:
|
|||
/* the new node is really new
|
||||
* add it to the open list */
|
||||
m_nodes.InsertOpenNode(n);
|
||||
if (set_intermediate) m_pBestIntermediateNode = &n;
|
||||
}
|
||||
|
||||
const VehicleType * GetVehicle() const
|
||||
|
|
Loading…
Reference in New Issue