OpenTTD
linkgraphjob.cpp
Go to the documentation of this file.
1 /* $Id$ */
2 
3 /*
4  * This file is part of OpenTTD.
5  * 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.
6  * 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.
7  * 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/>.
8  */
9 
12 #include "../stdafx.h"
13 #include "../core/pool_func.hpp"
14 #include "../window_func.h"
15 #include "linkgraphjob.h"
16 #include "linkgraphschedule.h"
17 
18 #include "../safeguards.h"
19 
20 /* Initialize the link-graph-job-pool */
23 
24 
29 /* static */ Path *Path::invalid_path = new Path(INVALID_NODE, true);
30 
38  /* Copying the link graph here also copies its index member.
39  * This is on purpose. */
40  link_graph(orig),
41  settings(_settings_game.linkgraph),
42  join_date(_date + _settings_game.linkgraph.recalc_time)
43 {
44 }
45 
50 void LinkGraphJob::EraseFlows(NodeID from)
51 {
52  for (NodeID node_id = 0; node_id < this->Size(); ++node_id) {
53  (*this)[node_id].Flows().erase(from);
54  }
55 }
56 
62 {
63  if (!StartNewThread(&this->thread, "ottd:linkgraph", &(LinkGraphSchedule::Run), this)) {
64  /* Of course this will hang a bit.
65  * On the other hand, if you want to play games which make this hang noticeably
66  * on a platform without threads then you'll probably get other problems first.
67  * OK:
68  * If someone comes and tells me that this hangs for him/her, I'll implement a
69  * smaller grained "Step" method for all handlers and add some more ticks where
70  * "Step" is called. No problem in principle. */
72  }
73 }
74 
79 {
80  if (this->thread.joinable()) {
81  this->thread.join();
82  }
83 }
84 
89 {
90  this->JoinThread();
91 
92  /* Don't update stuff from other pools, when everything is being removed.
93  * Accessing other pools may be invalid. */
94  if (CleaningPool()) return;
95 
96  /* Link graph has been merged into another one. */
97  if (!LinkGraph::IsValidID(this->link_graph.index)) return;
98 
99  uint size = this->Size();
100  for (NodeID node_id = 0; node_id < size; ++node_id) {
101  Node from = (*this)[node_id];
102 
103  /* The station can have been deleted. Remove all flows originating from it then. */
104  Station *st = Station::GetIfValid(from.Station());
105  if (st == nullptr) {
106  this->EraseFlows(node_id);
107  continue;
108  }
109 
110  /* Link graph merging and station deletion may change around IDs. Make
111  * sure that everything is still consistent or ignore it otherwise. */
112  GoodsEntry &ge = st->goods[this->Cargo()];
113  if (ge.link_graph != this->link_graph.index || ge.node != node_id) {
114  this->EraseFlows(node_id);
115  continue;
116  }
117 
119  FlowStatMap &flows = from.Flows();
120 
121  for (EdgeIterator it(from.Begin()); it != from.End(); ++it) {
122  if (from[it->first].Flow() == 0) continue;
123  StationID to = (*this)[it->first].Station();
124  Station *st2 = Station::GetIfValid(to);
125  if (st2 == nullptr || st2->goods[this->Cargo()].link_graph != this->link_graph.index ||
126  st2->goods[this->Cargo()].node != it->first ||
127  (*lg)[node_id][it->first].LastUpdate() == INVALID_DATE) {
128  /* Edge has been removed. Delete flows. */
129  StationIDStack erased = flows.DeleteFlows(to);
130  /* Delete old flows for source stations which have been deleted
131  * from the new flows. This avoids flow cycles between old and
132  * new flows. */
133  while (!erased.IsEmpty()) ge.flows.erase(erased.Pop());
134  } else if ((*lg)[node_id][it->first].LastUnrestrictedUpdate() == INVALID_DATE) {
135  /* Edge is fully restricted. */
136  flows.RestrictFlows(to);
137  }
138  }
139 
140  /* Swap shares and invalidate ones that are completely deleted. Don't
141  * really delete them as we could then end up with unroutable cargo
142  * somewhere. Do delete them and also reroute relevant cargo if
143  * automatic distribution has been turned off for that cargo. */
144  for (FlowStatMap::iterator it(ge.flows.begin()); it != ge.flows.end();) {
145  FlowStatMap::iterator new_it = flows.find(it->first);
146  if (new_it == flows.end()) {
147  if (_settings_game.linkgraph.GetDistributionType(this->Cargo()) != DT_MANUAL) {
148  it->second.Invalidate();
149  ++it;
150  } else {
151  FlowStat shares(INVALID_STATION, 1);
152  it->second.SwapShares(shares);
153  ge.flows.erase(it++);
154  for (FlowStat::SharesMap::const_iterator shares_it(shares.GetShares()->begin());
155  shares_it != shares.GetShares()->end(); ++shares_it) {
156  RerouteCargo(st, this->Cargo(), shares_it->second, st->index);
157  }
158  }
159  } else {
160  it->second.SwapShares(new_it->second);
161  flows.erase(new_it);
162  ++it;
163  }
164  }
165  ge.flows.insert(flows.begin(), flows.end());
166  InvalidateWindowData(WC_STATION_VIEW, st->index, this->Cargo());
167  }
168 }
169 
176 {
177  uint size = this->Size();
178  this->nodes.resize(size);
179  this->edges.Resize(size, size);
180  for (uint i = 0; i < size; ++i) {
181  this->nodes[i].Init(this->link_graph[i].Supply());
182  EdgeAnnotation *node_edges = this->edges[i];
183  for (uint j = 0; j < size; ++j) {
184  node_edges[j].Init();
185  }
186  }
187 }
188 
193 {
194  this->demand = 0;
195  this->flow = 0;
196  this->unsatisfied_demand = 0;
197 }
198 
205 {
206  this->undelivered_supply = supply;
207  new (&this->flows) FlowStatMap;
208  new (&this->paths) PathList;
209 }
210 
219 void Path::Fork(Path *base, uint cap, int free_cap, uint dist)
220 {
221  this->capacity = min(base->capacity, cap);
222  this->free_capacity = min(base->free_capacity, free_cap);
223  this->distance = base->distance + dist;
224  assert(this->distance > 0);
225  if (this->parent != base) {
226  this->Detach();
227  this->parent = base;
228  this->parent->num_children++;
229  }
230  this->origin = base->origin;
231 }
232 
241 uint Path::AddFlow(uint new_flow, LinkGraphJob &job, uint max_saturation)
242 {
243  if (this->parent != nullptr) {
244  LinkGraphJob::Edge edge = job[this->parent->node][this->node];
245  if (max_saturation != UINT_MAX) {
246  uint usable_cap = edge.Capacity() * max_saturation / 100;
247  if (usable_cap > edge.Flow()) {
248  new_flow = min(new_flow, usable_cap - edge.Flow());
249  } else {
250  return 0;
251  }
252  }
253  new_flow = this->parent->AddFlow(new_flow, job, max_saturation);
254  if (this->flow == 0 && new_flow > 0) {
255  job[this->parent->node].Paths().push_front(this);
256  }
257  edge.AddFlow(new_flow);
258  }
259  this->flow += new_flow;
260  return new_flow;
261 }
262 
268 Path::Path(NodeID n, bool source) :
269  distance(source ? 0 : UINT_MAX),
270  capacity(source ? UINT_MAX : 0),
271  free_capacity(source ? INT_MAX : INT_MIN),
272  flow(0), node(n), origin(source ? n : INVALID_NODE),
273  num_children(0), parent(nullptr)
274 {}
275 
GameSettings _settings_game
Game settings of a running game or the scenario editor.
Definition: settings.cpp:81
void Init()
Initialize a linkgraph job edge.
Minimal stack that uses a pool to avoid pointers.
int free_capacity
This capacity is min(edge.capacity - edge.flow) for the current run of Dijkstra.
Definition: linkgraphjob.h:428
std::thread thread
Thread the job is running in or a default-constructed thread if it&#39;s running in the main thread...
Definition: linkgraphjob.h:62
A job edge.
Definition: linkgraphjob.h:77
Annotation for a link graph edge.
Definition: linkgraphjob.h:36
static Titem * Get(size_t index)
Returns Titem with given index.
Definition: pool_type.hpp:246
LinkGraphJobPool _link_graph_job_pool("LinkGraphJob")
The actual pool with link graph jobs.
uint Flow() const
Get the total flow on the edge.
Definition: linkgraphjob.h:105
fluid_settings_t * settings
FluidSynth settings handle.
Definition: fluidsynth.cpp:22
StationIDStack DeleteFlows(StationID via)
Delete all flows at a station for specific cargo and destination.
Stores station stats for a single cargo.
Definition: station_base.h:172
Tindex index
Index of this pool item.
Definition: pool_type.hpp:147
Manual distribution. No link graph calculations are run.
void AddFlow(uint f)
Increase the flow on this leg only by the specified amount.
Definition: linkgraphjob.h:393
StationID Station() const
Get ID of station belonging to wrapped node.
Definition: linkgraph.h:159
GoodsEntry goods[NUM_CARGO]
Goods at this station.
Definition: station_base.h:481
A connected component of a link graph.
Definition: linkgraph.h:40
bool StartNewThread(std::thread *thr, const char *name, TFn &&_Fx, TArgs &&... _Ax)
Start a new thread.
Definition: thread.h:50
void Init(uint supply)
Initialize a Linkgraph job node.
void RestrictFlows(StationID via)
Restrict all flows at a station for specific cargo and destination.
bool IsEmpty() const
Check if the stack is empty.
void Init()
Initialize the link graph job: Resize nodes and edges and populate them.
void Fork(Path *base, uint cap, int free_cap, uint dist)
Add this path as a new child to the given base path, thus making this path a "fork" of the base path...
void Resize(uint new_width, uint new_height)
Set the size to a specific width and height, preserving item positions as far as possible in the proc...
LinkGraphID link_graph
Link graph this station belongs to.
Definition: station_base.h:259
Path(NodeID n, bool source=false)
Create a leg of a path in the link graph.
uint distance
Sum(distance of all legs up to this one).
Definition: linkgraphjob.h:426
static const Date INVALID_DATE
Representation of an invalid date.
Definition: date_type.h:110
A leg of a path in the link graph.
Definition: linkgraphjob.h:344
Declaration of link graph schedule used for cargo distribution.
uint num_children
Number of child legs that have been forked from this path.
Definition: linkgraphjob.h:432
Titem Pop()
Pop an item from the stack.
NodeID node
ID of node in link graph referring to this goods entry.
Definition: station_base.h:260
Link graph job node.
Definition: linkgraphjob.h:184
Station view; Window numbers:
Definition: window_type.h:340
static Path * invalid_path
Static instance of an invalid path.
Definition: linkgraphjob.h:346
Declaration of link graph job classes used for cargo distribution.
static T min(const T a, const T b)
Returns the minimum of two values.
Definition: math_func.hpp:42
uint capacity
This capacity is min(capacity) fom all edges.
Definition: linkgraphjob.h:427
void SpawnThread()
Spawn a thread if possible and run the link graph job in the thread.
NodeID origin
Link graph node this path originates from.
Definition: linkgraphjob.h:431
void AddFlow(uint flow)
Add some flow.
Definition: linkgraphjob.h:111
Base class for all pools.
Definition: pool_type.hpp:83
CargoID Cargo() const
Get the cargo of the underlying link graph.
Definition: linkgraphjob.h:318
FlowStatMap flows
Planned flows through this station.
Definition: station_base.h:261
#define INSTANTIATE_POOL_METHODS(name)
Force instantiation of pool methods so we don&#39;t get linker errors.
Definition: pool_func.hpp:226
static bool CleaningPool()
Returns current state of pool cleaning - yes or no.
Definition: pool_type.hpp:225
const LinkGraph link_graph
Link graph to by analyzed. Is copied when job is started and mustn&#39;t be modified later.
Definition: linkgraphjob.h:60
static void Run(LinkGraphJob *job)
Run all handlers for the given Job.
FlowStatMap & Flows()
Get the flows running through this node.
Definition: linkgraphjob.h:232
void EraseFlows(NodeID from)
Erase all flows originating at a specific node.
void JoinThread()
Join the calling thread with this job&#39;s thread if threading is enabled.
void RerouteCargo(Station *st, CargoID c, StationID avoid, StationID avoid2)
Reroute cargo of type c at station st or in any vehicles unloading there.
const SharesMap * GetShares() const
Get the actual shares as a const pointer so that they can be iterated over.
Definition: station_base.h:94
EdgeIterator End() const
Iterator for the "end" of the edge array.
Definition: linkgraphjob.h:220
Iterator for job edges.
Definition: linkgraphjob.h:147
uint Size() const
Get the size of the underlying link graph.
Definition: linkgraphjob.h:312
Flow statistics telling how much flow should be sent along a link.
Definition: station_base.h:38
LinkGraphJob()
Bare constructor, only for save/load.
Definition: linkgraphjob.h:269
static bool IsValidID(size_t index)
Tests whether given index can be used to get valid (non-nullptr) Titem.
Definition: pool_type.hpp:235
Flow descriptions by origin stations.
Definition: station_base.h:154
EdgeAnnotationMatrix edges
Extra edge data necessary for link graph calculation.
Definition: linkgraphjob.h:65
uint Capacity() const
Get edge&#39;s capacity.
Definition: linkgraph.h:93
Date _date
Current date in days (day counter)
Definition: date.cpp:28
NodeAnnotationVector nodes
Extra node data necessary for link graph calculation.
Definition: linkgraphjob.h:64
EdgeIterator Begin() const
Iterator for the "begin" of the edge array.
Definition: linkgraphjob.h:213
Station data structure.
Definition: station_base.h:452
~LinkGraphJob()
Join the link graph job and destroy it.
LinkGraphSettings linkgraph
settings for link graph calculations
Class for calculation jobs to be run on link graphs.
Definition: linkgraphjob.h:31
void InvalidateWindowData(WindowClass cls, WindowNumber number, int data, bool gui_scope)
Mark window data of the window of a given class and specific window number as invalid (in need of re-...
Definition: window.cpp:3300
static Station * GetIfValid(size_t index)
Returns station if the index is a valid index for this station type.