OpenTTD
station_cmd.cpp
Go to the documentation of this file.
1 /* $Id: station_cmd.cpp 27225 2015-04-11 11:50:02Z planetmaker $ */
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 "aircraft.h"
14 #include "bridge_map.h"
15 #include "cmd_helper.h"
16 #include "viewport_func.h"
17 #include "command_func.h"
18 #include "town.h"
19 #include "news_func.h"
20 #include "train.h"
21 #include "ship.h"
22 #include "roadveh.h"
23 #include "industry.h"
24 #include "newgrf_cargo.h"
25 #include "newgrf_debug.h"
26 #include "newgrf_station.h"
27 #include "newgrf_canal.h" /* For the buoy */
29 #include "road_internal.h" /* For drawing catenary/checking road removal */
30 #include "autoslope.h"
31 #include "water.h"
32 #include "strings_func.h"
33 #include "clear_func.h"
34 #include "date_func.h"
35 #include "vehicle_func.h"
36 #include "string_func.h"
37 #include "animated_tile_func.h"
38 #include "elrail_func.h"
39 #include "station_base.h"
40 #include "roadstop_base.h"
41 #include "newgrf_railtype.h"
42 #include "waypoint_base.h"
43 #include "waypoint_func.h"
44 #include "pbs.h"
45 #include "debug.h"
46 #include "core/random_func.hpp"
47 #include "company_base.h"
48 #include "table/airporttile_ids.h"
49 #include "newgrf_airporttiles.h"
50 #include "order_backup.h"
51 #include "newgrf_house.h"
52 #include "company_gui.h"
54 #include "linkgraph/refresh.h"
55 #include "widgets/station_widget.h"
56 
57 #include "table/strings.h"
58 
59 #include "safeguards.h"
60 
66 /* static */ const FlowStat::SharesMap FlowStat::empty_sharesmap;
67 
75 {
76  assert(IsTileType(t, MP_STATION));
77 
78  /* If the tile isn't an airport there's no chance it's a hangar. */
79  if (!IsAirport(t)) return false;
80 
81  const Station *st = Station::GetByTile(t);
82  const AirportSpec *as = st->airport.GetSpec();
83 
84  for (uint i = 0; i < as->nof_depots; i++) {
85  if (st->airport.GetHangarTile(i) == t) return true;
86  }
87 
88  return false;
89 }
90 
98 template <class T>
99 CommandCost GetStationAround(TileArea ta, StationID closest_station, T **st)
100 {
101  ta.tile -= TileDiffXY(1, 1);
102  ta.w += 2;
103  ta.h += 2;
104 
105  /* check around to see if there's any stations there */
106  TILE_AREA_LOOP(tile_cur, ta) {
107  if (IsTileType(tile_cur, MP_STATION)) {
108  StationID t = GetStationIndex(tile_cur);
109  if (!T::IsValidID(t)) continue;
110 
111  if (closest_station == INVALID_STATION) {
112  closest_station = t;
113  } else if (closest_station != t) {
114  return_cmd_error(STR_ERROR_ADJOINS_MORE_THAN_ONE_EXISTING);
115  }
116  }
117  }
118  *st = (closest_station == INVALID_STATION) ? NULL : T::Get(closest_station);
119  return CommandCost();
120 }
121 
127 typedef bool (*CMSAMatcher)(TileIndex tile);
128 
136 {
137  int num = 0;
138 
139  for (int dx = -3; dx <= 3; dx++) {
140  for (int dy = -3; dy <= 3; dy++) {
141  TileIndex t = TileAddWrap(tile, dx, dy);
142  if (t != INVALID_TILE && cmp(t)) num++;
143  }
144  }
145 
146  return num;
147 }
148 
154 static bool CMSAMine(TileIndex tile)
155 {
156  /* No industry */
157  if (!IsTileType(tile, MP_INDUSTRY)) return false;
158 
159  const Industry *ind = Industry::GetByTile(tile);
160 
161  /* No extractive industry */
162  if ((GetIndustrySpec(ind->type)->life_type & INDUSTRYLIFE_EXTRACTIVE) == 0) return false;
163 
164  for (uint i = 0; i < lengthof(ind->produced_cargo); i++) {
165  /* The industry extracts something non-liquid, i.e. no oil or plastic, so it is a mine.
166  * Also the production of passengers and mail is ignored. */
167  if (ind->produced_cargo[i] != CT_INVALID &&
169  return true;
170  }
171  }
172 
173  return false;
174 }
175 
181 static bool CMSAWater(TileIndex tile)
182 {
183  return IsTileType(tile, MP_WATER) && IsWater(tile);
184 }
185 
191 static bool CMSATree(TileIndex tile)
192 {
193  return IsTileType(tile, MP_TREES);
194 }
195 
196 #define M(x) ((x) - STR_SV_STNAME)
197 
198 enum StationNaming {
199  STATIONNAMING_RAIL,
200  STATIONNAMING_ROAD,
201  STATIONNAMING_AIRPORT,
202  STATIONNAMING_OILRIG,
203  STATIONNAMING_DOCK,
204  STATIONNAMING_HELIPORT,
205 };
206 
209  uint32 free_names;
210  bool *indtypes;
211 };
212 
221 static bool FindNearIndustryName(TileIndex tile, void *user_data)
222 {
223  /* All already found industry types */
225  if (!IsTileType(tile, MP_INDUSTRY)) return false;
226 
227  /* If the station name is undefined it means that it doesn't name a station */
228  IndustryType indtype = GetIndustryType(tile);
229  if (GetIndustrySpec(indtype)->station_name == STR_UNDEFINED) return false;
230 
231  /* In all cases if an industry that provides a name is found two of
232  * the standard names will be disabled. */
233  sni->free_names &= ~(1 << M(STR_SV_STNAME_OILFIELD) | 1 << M(STR_SV_STNAME_MINES));
234  return !sni->indtypes[indtype];
235 }
236 
237 static StringID GenerateStationName(Station *st, TileIndex tile, StationNaming name_class)
238 {
239  static const uint32 _gen_station_name_bits[] = {
240  0, // STATIONNAMING_RAIL
241  0, // STATIONNAMING_ROAD
242  1U << M(STR_SV_STNAME_AIRPORT), // STATIONNAMING_AIRPORT
243  1U << M(STR_SV_STNAME_OILFIELD), // STATIONNAMING_OILRIG
244  1U << M(STR_SV_STNAME_DOCKS), // STATIONNAMING_DOCK
245  1U << M(STR_SV_STNAME_HELIPORT), // STATIONNAMING_HELIPORT
246  };
247 
248  const Town *t = st->town;
249  uint32 free_names = UINT32_MAX;
250 
251  bool indtypes[NUM_INDUSTRYTYPES];
252  memset(indtypes, 0, sizeof(indtypes));
253 
254  const Station *s;
255  FOR_ALL_STATIONS(s) {
256  if (s != st && s->town == t) {
257  if (s->indtype != IT_INVALID) {
258  indtypes[s->indtype] = true;
260  if (name != STR_UNDEFINED) {
261  /* Filter for other industrytypes with the same name */
262  for (IndustryType it = 0; it < NUM_INDUSTRYTYPES; it++) {
263  const IndustrySpec *indsp = GetIndustrySpec(it);
264  if (indsp->enabled && indsp->station_name == name) indtypes[it] = true;
265  }
266  }
267  continue;
268  }
269  uint str = M(s->string_id);
270  if (str <= 0x20) {
271  if (str == M(STR_SV_STNAME_FOREST)) {
272  str = M(STR_SV_STNAME_WOODS);
273  }
274  ClrBit(free_names, str);
275  }
276  }
277  }
278 
279  TileIndex indtile = tile;
280  StationNameInformation sni = { free_names, indtypes };
281  if (CircularTileSearch(&indtile, 7, FindNearIndustryName, &sni)) {
282  /* An industry has been found nearby */
283  IndustryType indtype = GetIndustryType(indtile);
284  const IndustrySpec *indsp = GetIndustrySpec(indtype);
285  /* STR_NULL means it only disables oil rig/mines */
286  if (indsp->station_name != STR_NULL) {
287  st->indtype = indtype;
288  return STR_SV_STNAME_FALLBACK;
289  }
290  }
291 
292  /* Oil rigs/mines name could be marked not free by looking for a near by industry. */
293  free_names = sni.free_names;
294 
295  /* check default names */
296  uint32 tmp = free_names & _gen_station_name_bits[name_class];
297  if (tmp != 0) return STR_SV_STNAME + FindFirstBit(tmp);
298 
299  /* check mine? */
300  if (HasBit(free_names, M(STR_SV_STNAME_MINES))) {
301  if (CountMapSquareAround(tile, CMSAMine) >= 2) {
302  return STR_SV_STNAME_MINES;
303  }
304  }
305 
306  /* check close enough to town to get central as name? */
307  if (DistanceMax(tile, t->xy) < 8) {
308  if (HasBit(free_names, M(STR_SV_STNAME))) return STR_SV_STNAME;
309 
310  if (HasBit(free_names, M(STR_SV_STNAME_CENTRAL))) return STR_SV_STNAME_CENTRAL;
311  }
312 
313  /* Check lakeside */
314  if (HasBit(free_names, M(STR_SV_STNAME_LAKESIDE)) &&
315  DistanceFromEdge(tile) < 20 &&
316  CountMapSquareAround(tile, CMSAWater) >= 5) {
317  return STR_SV_STNAME_LAKESIDE;
318  }
319 
320  /* Check woods */
321  if (HasBit(free_names, M(STR_SV_STNAME_WOODS)) && (
322  CountMapSquareAround(tile, CMSATree) >= 8 ||
324  ) {
325  return _settings_game.game_creation.landscape == LT_TROPIC ? STR_SV_STNAME_FOREST : STR_SV_STNAME_WOODS;
326  }
327 
328  /* check elevation compared to town */
329  int z = GetTileZ(tile);
330  int z2 = GetTileZ(t->xy);
331  if (z < z2) {
332  if (HasBit(free_names, M(STR_SV_STNAME_VALLEY))) return STR_SV_STNAME_VALLEY;
333  } else if (z > z2) {
334  if (HasBit(free_names, M(STR_SV_STNAME_HEIGHTS))) return STR_SV_STNAME_HEIGHTS;
335  }
336 
337  /* check direction compared to town */
338  static const int8 _direction_and_table[] = {
339  ~( (1 << M(STR_SV_STNAME_WEST)) | (1 << M(STR_SV_STNAME_EAST)) | (1 << M(STR_SV_STNAME_NORTH)) ),
340  ~( (1 << M(STR_SV_STNAME_SOUTH)) | (1 << M(STR_SV_STNAME_WEST)) | (1 << M(STR_SV_STNAME_NORTH)) ),
341  ~( (1 << M(STR_SV_STNAME_SOUTH)) | (1 << M(STR_SV_STNAME_EAST)) | (1 << M(STR_SV_STNAME_NORTH)) ),
342  ~( (1 << M(STR_SV_STNAME_SOUTH)) | (1 << M(STR_SV_STNAME_WEST)) | (1 << M(STR_SV_STNAME_EAST)) ),
343  };
344 
345  free_names &= _direction_and_table[
346  (TileX(tile) < TileX(t->xy)) +
347  (TileY(tile) < TileY(t->xy)) * 2];
348 
349  tmp = free_names & ((1 << 1) | (1 << 2) | (1 << 3) | (1 << 4) | (1 << 6) | (1 << 7) | (1 << 12) | (1 << 26) | (1 << 27) | (1 << 28) | (1 << 29) | (1 << 30));
350  return (tmp == 0) ? STR_SV_STNAME_FALLBACK : (STR_SV_STNAME + FindFirstBit(tmp));
351 }
352 #undef M
353 
360 {
361  uint threshold = 8;
362  Station *best_station = NULL;
363  Station *st;
364 
365  FOR_ALL_STATIONS(st) {
366  if (!st->IsInUse() && st->owner == _current_company) {
367  uint cur_dist = DistanceManhattan(tile, st->xy);
368 
369  if (cur_dist < threshold) {
370  threshold = cur_dist;
371  best_station = st;
372  }
373  }
374  }
375 
376  return best_station;
377 }
378 
379 
381 {
382  switch (type) {
383  case STATION_RAIL:
384  *ta = this->train_station;
385  return;
386 
387  case STATION_AIRPORT:
388  *ta = this->airport;
389  return;
390 
391  case STATION_TRUCK:
392  *ta = this->truck_station;
393  return;
394 
395  case STATION_BUS:
396  *ta = this->bus_station;
397  return;
398 
399  case STATION_DOCK:
400  case STATION_OILRIG:
401  ta->tile = this->dock_tile;
402  break;
403 
404  default: NOT_REACHED();
405  }
406 
407  ta->w = 1;
408  ta->h = 1;
409 }
410 
415 {
416  Point pt = RemapCoords2(TileX(this->xy) * TILE_SIZE, TileY(this->xy) * TILE_SIZE);
417 
418  pt.y -= 32 * ZOOM_LVL_BASE;
419  if ((this->facilities & FACIL_AIRPORT) && this->airport.type == AT_OILRIG) pt.y -= 16 * ZOOM_LVL_BASE;
420 
421  SetDParam(0, this->index);
422  SetDParam(1, this->facilities);
423  this->sign.UpdatePosition(pt.x, pt.y, STR_VIEWPORT_STATION);
424 
426 }
427 
430 {
431  BaseStation *st;
432 
433  FOR_ALL_BASE_STATIONS(st) {
434  st->UpdateVirtCoord();
435  }
436 }
437 
443 static uint GetAcceptanceMask(const Station *st)
444 {
445  uint mask = 0;
446 
447  for (CargoID i = 0; i < NUM_CARGO; i++) {
448  if (HasBit(st->goods[i].status, GoodsEntry::GES_ACCEPTANCE)) mask |= 1 << i;
449  }
450  return mask;
451 }
452 
457 static void ShowRejectOrAcceptNews(const Station *st, uint num_items, CargoID *cargo, StringID msg)
458 {
459  for (uint i = 0; i < num_items; i++) {
460  SetDParam(i + 1, CargoSpec::Get(cargo[i])->name);
461  }
462 
463  SetDParam(0, st->index);
465 }
466 
474 CargoArray GetProductionAroundTiles(TileIndex tile, int w, int h, int rad)
475 {
476  CargoArray produced;
477 
478  int x = TileX(tile);
479  int y = TileY(tile);
480 
481  /* expand the region by rad tiles on each side
482  * while making sure that we remain inside the board. */
483  int x2 = min(x + w + rad, MapSizeX());
484  int x1 = max(x - rad, 0);
485 
486  int y2 = min(y + h + rad, MapSizeY());
487  int y1 = max(y - rad, 0);
488 
489  assert(x1 < x2);
490  assert(y1 < y2);
491  assert(w > 0);
492  assert(h > 0);
493 
494  TileArea ta(TileXY(x1, y1), TileXY(x2 - 1, y2 - 1));
495 
496  /* Loop over all tiles to get the produced cargo of
497  * everything except industries */
498  TILE_AREA_LOOP(tile, ta) AddProducedCargo(tile, produced);
499 
500  /* Loop over the industries. They produce cargo for
501  * anything that is within 'rad' from their bounding
502  * box. As such if you have e.g. a oil well the tile
503  * area loop might not hit an industry tile while
504  * the industry would produce cargo for the station.
505  */
506  const Industry *i;
507  FOR_ALL_INDUSTRIES(i) {
508  if (!ta.Intersects(i->location)) continue;
509 
510  for (uint j = 0; j < lengthof(i->produced_cargo); j++) {
511  CargoID cargo = i->produced_cargo[j];
512  if (cargo != CT_INVALID) produced[cargo]++;
513  }
514  }
515 
516  return produced;
517 }
518 
527 CargoArray GetAcceptanceAroundTiles(TileIndex tile, int w, int h, int rad, uint32 *always_accepted)
528 {
529  CargoArray acceptance;
530  if (always_accepted != NULL) *always_accepted = 0;
531 
532  int x = TileX(tile);
533  int y = TileY(tile);
534 
535  /* expand the region by rad tiles on each side
536  * while making sure that we remain inside the board. */
537  int x2 = min(x + w + rad, MapSizeX());
538  int y2 = min(y + h + rad, MapSizeY());
539  int x1 = max(x - rad, 0);
540  int y1 = max(y - rad, 0);
541 
542  assert(x1 < x2);
543  assert(y1 < y2);
544  assert(w > 0);
545  assert(h > 0);
546 
547  for (int yc = y1; yc != y2; yc++) {
548  for (int xc = x1; xc != x2; xc++) {
549  TileIndex tile = TileXY(xc, yc);
550  AddAcceptedCargo(tile, acceptance, always_accepted);
551  }
552  }
553 
554  return acceptance;
555 }
556 
562 void UpdateStationAcceptance(Station *st, bool show_msg)
563 {
564  /* old accepted goods types */
565  uint old_acc = GetAcceptanceMask(st);
566 
567  /* And retrieve the acceptance. */
568  CargoArray acceptance;
569  if (!st->rect.IsEmpty()) {
570  acceptance = GetAcceptanceAroundTiles(
571  TileXY(st->rect.left, st->rect.top),
572  st->rect.right - st->rect.left + 1,
573  st->rect.bottom - st->rect.top + 1,
574  st->GetCatchmentRadius(),
575  &st->always_accepted
576  );
577  }
578 
579  /* Adjust in case our station only accepts fewer kinds of goods */
580  for (CargoID i = 0; i < NUM_CARGO; i++) {
581  uint amt = acceptance[i];
582 
583  /* Make sure the station can accept the goods type. */
584  bool is_passengers = IsCargoInClass(i, CC_PASSENGERS);
585  if ((!is_passengers && !(st->facilities & ~FACIL_BUS_STOP)) ||
586  (is_passengers && !(st->facilities & ~FACIL_TRUCK_STOP))) {
587  amt = 0;
588  }
589 
590  GoodsEntry &ge = st->goods[i];
591  SB(ge.status, GoodsEntry::GES_ACCEPTANCE, 1, amt >= 8);
593  (*LinkGraph::Get(ge.link_graph))[ge.node].SetDemand(amt / 8);
594  }
595  }
596 
597  /* Only show a message in case the acceptance was actually changed. */
598  uint new_acc = GetAcceptanceMask(st);
599  if (old_acc == new_acc) return;
600 
601  /* show a message to report that the acceptance was changed? */
602  if (show_msg && st->owner == _local_company && st->IsInUse()) {
603  /* List of accept and reject strings for different number of
604  * cargo types */
605  static const StringID accept_msg[] = {
606  STR_NEWS_STATION_NOW_ACCEPTS_CARGO,
607  STR_NEWS_STATION_NOW_ACCEPTS_CARGO_AND_CARGO,
608  };
609  static const StringID reject_msg[] = {
610  STR_NEWS_STATION_NO_LONGER_ACCEPTS_CARGO,
611  STR_NEWS_STATION_NO_LONGER_ACCEPTS_CARGO_OR_CARGO,
612  };
613 
614  /* Array of accepted and rejected cargo types */
615  CargoID accepts[2] = { CT_INVALID, CT_INVALID };
616  CargoID rejects[2] = { CT_INVALID, CT_INVALID };
617  uint num_acc = 0;
618  uint num_rej = 0;
619 
620  /* Test each cargo type to see if its acceptance has changed */
621  for (CargoID i = 0; i < NUM_CARGO; i++) {
622  if (HasBit(new_acc, i)) {
623  if (!HasBit(old_acc, i) && num_acc < lengthof(accepts)) {
624  /* New cargo is accepted */
625  accepts[num_acc++] = i;
626  }
627  } else {
628  if (HasBit(old_acc, i) && num_rej < lengthof(rejects)) {
629  /* Old cargo is no longer accepted */
630  rejects[num_rej++] = i;
631  }
632  }
633  }
634 
635  /* Show news message if there are any changes */
636  if (num_acc > 0) ShowRejectOrAcceptNews(st, num_acc, accepts, accept_msg[num_acc - 1]);
637  if (num_rej > 0) ShowRejectOrAcceptNews(st, num_rej, rejects, reject_msg[num_rej - 1]);
638  }
639 
640  /* redraw the station view since acceptance changed */
642 }
643 
644 static void UpdateStationSignCoord(BaseStation *st)
645 {
646  const StationRect *r = &st->rect;
647 
648  if (r->IsEmpty()) return; // no tiles belong to this station
649 
650  /* clamp sign coord to be inside the station rect */
651  st->xy = TileXY(ClampU(TileX(st->xy), r->left, r->right), ClampU(TileY(st->xy), r->top, r->bottom));
652  st->UpdateVirtCoord();
653 
654  if (!Station::IsExpected(st)) return;
655  Station *full_station = Station::From(st);
656  for (CargoID c = 0; c < NUM_CARGO; ++c) {
657  LinkGraphID lg = full_station->goods[c].link_graph;
658  if (!LinkGraph::IsValidID(lg)) continue;
659  (*LinkGraph::Get(lg))[full_station->goods[c].node].UpdateLocation(st->xy);
660  }
661 }
662 
672 static CommandCost BuildStationPart(Station **st, DoCommandFlag flags, bool reuse, TileArea area, StationNaming name_class)
673 {
674  /* Find a deleted station close to us */
675  if (*st == NULL && reuse) *st = GetClosestDeletedStation(area.tile);
676 
677  if (*st != NULL) {
678  if ((*st)->owner != _current_company) {
679  return_cmd_error(STR_ERROR_TOO_CLOSE_TO_ANOTHER_STATION);
680  }
681 
682  CommandCost ret = (*st)->rect.BeforeAddRect(area.tile, area.w, area.h, StationRect::ADD_TEST);
683  if (ret.Failed()) return ret;
684  } else {
685  /* allocate and initialize new station */
686  if (!Station::CanAllocateItem()) return_cmd_error(STR_ERROR_TOO_MANY_STATIONS_LOADING);
687 
688  if (flags & DC_EXEC) {
689  *st = new Station(area.tile);
690 
691  (*st)->town = ClosestTownFromTile(area.tile, UINT_MAX);
692  (*st)->string_id = GenerateStationName(*st, area.tile, name_class);
693 
695  SetBit((*st)->town->have_ratings, _current_company);
696  }
697  }
698  }
699  return CommandCost();
700 }
701 
709 {
710  if (!st->IsInUse()) {
711  st->delete_ctr = 0;
713  }
714  /* station remains but it probably lost some parts - station sign should stay in the station boundaries */
715  UpdateStationSignCoord(st);
716 }
717 
719 
729 CommandCost CheckBuildableTile(TileIndex tile, uint invalid_dirs, int &allowed_z, bool allow_steep, bool check_bridge = true)
730 {
731  if (check_bridge && IsBridgeAbove(tile)) {
732  return_cmd_error(STR_ERROR_MUST_DEMOLISH_BRIDGE_FIRST);
733  }
734 
736  if (ret.Failed()) return ret;
737 
738  int z;
739  Slope tileh = GetTileSlope(tile, &z);
740 
741  /* Prohibit building if
742  * 1) The tile is "steep" (i.e. stretches two height levels).
743  * 2) The tile is non-flat and the build_on_slopes switch is disabled.
744  */
745  if ((!allow_steep && IsSteepSlope(tileh)) ||
747  return_cmd_error(STR_ERROR_FLAT_LAND_REQUIRED);
748  }
749 
751  int flat_z = z + GetSlopeMaxZ(tileh);
752  if (tileh != SLOPE_FLAT) {
753  /* Forbid building if the tile faces a slope in a invalid direction. */
754  for (DiagDirection dir = DIAGDIR_BEGIN; dir != DIAGDIR_END; dir++) {
755  if (HasBit(invalid_dirs, dir) && !CanBuildDepotByTileh(dir, tileh)) {
756  return_cmd_error(STR_ERROR_FLAT_LAND_REQUIRED);
757  }
758  }
759  cost.AddCost(_price[PR_BUILD_FOUNDATION]);
760  }
761 
762  /* The level of this tile must be equal to allowed_z. */
763  if (allowed_z < 0) {
764  /* First tile. */
765  allowed_z = flat_z;
766  } else if (allowed_z != flat_z) {
767  return_cmd_error(STR_ERROR_FLAT_LAND_REQUIRED);
768  }
769 
770  return cost;
771 }
772 
780 {
782  int allowed_z = -1;
783 
784  TILE_AREA_LOOP(tile_cur, tile_area) {
785  CommandCost ret = CheckBuildableTile(tile_cur, 0, allowed_z, true);
786  if (ret.Failed()) return ret;
787  cost.AddCost(ret);
788 
789  ret = DoCommand(tile_cur, 0, 0, flags, CMD_LANDSCAPE_CLEAR);
790  if (ret.Failed()) return ret;
791  cost.AddCost(ret);
792  }
793 
794  return cost;
795 }
796 
811 static CommandCost CheckFlatLandRailStation(TileArea tile_area, DoCommandFlag flags, Axis axis, StationID *station, RailType rt, SmallVector<Train *, 4> &affected_vehicles, StationClassID spec_class, byte spec_index, byte plat_len, byte numtracks)
812 {
814  int allowed_z = -1;
815  uint invalid_dirs = 5 << axis;
816 
817  const StationSpec *statspec = StationClass::Get(spec_class)->GetSpec(spec_index);
818  bool slope_cb = statspec != NULL && HasBit(statspec->callback_mask, CBM_STATION_SLOPE_CHECK);
819 
820  TILE_AREA_LOOP(tile_cur, tile_area) {
821  CommandCost ret = CheckBuildableTile(tile_cur, invalid_dirs, allowed_z, false);
822  if (ret.Failed()) return ret;
823  cost.AddCost(ret);
824 
825  if (slope_cb) {
826  /* Do slope check if requested. */
827  ret = PerformStationTileSlopeCheck(tile_area.tile, tile_cur, statspec, axis, plat_len, numtracks);
828  if (ret.Failed()) return ret;
829  }
830 
831  /* if station is set, then we have special handling to allow building on top of already existing stations.
832  * so station points to INVALID_STATION if we can build on any station.
833  * Or it points to a station if we're only allowed to build on exactly that station. */
834  if (station != NULL && IsTileType(tile_cur, MP_STATION)) {
835  if (!IsRailStation(tile_cur)) {
836  return ClearTile_Station(tile_cur, DC_AUTO); // get error message
837  } else {
838  StationID st = GetStationIndex(tile_cur);
839  if (*station == INVALID_STATION) {
840  *station = st;
841  } else if (*station != st) {
842  return_cmd_error(STR_ERROR_ADJOINS_MORE_THAN_ONE_EXISTING);
843  }
844  }
845  } else {
846  /* Rail type is only valid when building a railway station; if station to
847  * build isn't a rail station it's INVALID_RAILTYPE. */
848  if (rt != INVALID_RAILTYPE &&
849  IsPlainRailTile(tile_cur) && !HasSignals(tile_cur) &&
850  HasPowerOnRail(GetRailType(tile_cur), rt)) {
851  /* Allow overbuilding if the tile:
852  * - has rail, but no signals
853  * - it has exactly one track
854  * - the track is in line with the station
855  * - the current rail type has power on the to-be-built type (e.g. convert normal rail to el rail)
856  */
857  TrackBits tracks = GetTrackBits(tile_cur);
858  Track track = RemoveFirstTrack(&tracks);
859  Track expected_track = HasBit(invalid_dirs, DIAGDIR_NE) ? TRACK_X : TRACK_Y;
860 
861  if (tracks == TRACK_BIT_NONE && track == expected_track) {
862  /* Check for trains having a reservation for this tile. */
863  if (HasBit(GetRailReservationTrackBits(tile_cur), track)) {
864  Train *v = GetTrainForReservation(tile_cur, track);
865  if (v != NULL) {
866  *affected_vehicles.Append() = v;
867  }
868  }
869  CommandCost ret = DoCommand(tile_cur, 0, track, flags, CMD_REMOVE_SINGLE_RAIL);
870  if (ret.Failed()) return ret;
871  cost.AddCost(ret);
872  /* With flags & ~DC_EXEC CmdLandscapeClear would fail since the rail still exists */
873  continue;
874  }
875  }
876  ret = DoCommand(tile_cur, 0, 0, flags, CMD_LANDSCAPE_CLEAR);
877  if (ret.Failed()) return ret;
878  cost.AddCost(ret);
879  }
880  }
881 
882  return cost;
883 }
884 
897 static CommandCost CheckFlatLandRoadStop(TileArea tile_area, DoCommandFlag flags, uint invalid_dirs, bool is_drive_through, bool is_truck_stop, Axis axis, StationID *station, RoadTypes rts)
898 {
900  int allowed_z = -1;
901 
902  TILE_AREA_LOOP(cur_tile, tile_area) {
903  CommandCost ret = CheckBuildableTile(cur_tile, invalid_dirs, allowed_z, !is_drive_through);
904  if (ret.Failed()) return ret;
905  cost.AddCost(ret);
906 
907  /* If station is set, then we have special handling to allow building on top of already existing stations.
908  * Station points to INVALID_STATION if we can build on any station.
909  * Or it points to a station if we're only allowed to build on exactly that station. */
910  if (station != NULL && IsTileType(cur_tile, MP_STATION)) {
911  if (!IsRoadStop(cur_tile)) {
912  return ClearTile_Station(cur_tile, DC_AUTO); // Get error message.
913  } else {
914  if (is_truck_stop != IsTruckStop(cur_tile) ||
915  is_drive_through != IsDriveThroughStopTile(cur_tile)) {
916  return ClearTile_Station(cur_tile, DC_AUTO); // Get error message.
917  }
918  /* Drive-through station in the wrong direction. */
919  if (is_drive_through && IsDriveThroughStopTile(cur_tile) && DiagDirToAxis(GetRoadStopDir(cur_tile)) != axis){
920  return_cmd_error(STR_ERROR_DRIVE_THROUGH_DIRECTION);
921  }
922  StationID st = GetStationIndex(cur_tile);
923  if (*station == INVALID_STATION) {
924  *station = st;
925  } else if (*station != st) {
926  return_cmd_error(STR_ERROR_ADJOINS_MORE_THAN_ONE_EXISTING);
927  }
928  }
929  } else {
930  bool build_over_road = is_drive_through && IsNormalRoadTile(cur_tile);
931  /* Road bits in the wrong direction. */
932  RoadBits rb = IsNormalRoadTile(cur_tile) ? GetAllRoadBits(cur_tile) : ROAD_NONE;
933  if (build_over_road && (rb & (axis == AXIS_X ? ROAD_Y : ROAD_X)) != 0) {
934  /* Someone was pedantic and *NEEDED* three fracking different error messages. */
935  switch (CountBits(rb)) {
936  case 1:
937  return_cmd_error(STR_ERROR_DRIVE_THROUGH_DIRECTION);
938 
939  case 2:
940  if (rb == ROAD_X || rb == ROAD_Y) return_cmd_error(STR_ERROR_DRIVE_THROUGH_DIRECTION);
941  return_cmd_error(STR_ERROR_DRIVE_THROUGH_CORNER);
942 
943  default: // 3 or 4
944  return_cmd_error(STR_ERROR_DRIVE_THROUGH_JUNCTION);
945  }
946  }
947 
948  RoadTypes cur_rts = IsNormalRoadTile(cur_tile) ? GetRoadTypes(cur_tile) : ROADTYPES_NONE;
949  uint num_roadbits = 0;
950  if (build_over_road) {
951  /* There is a road, check if we can build road+tram stop over it. */
952  if (HasBit(cur_rts, ROADTYPE_ROAD)) {
953  Owner road_owner = GetRoadOwner(cur_tile, ROADTYPE_ROAD);
954  if (road_owner == OWNER_TOWN) {
955  if (!_settings_game.construction.road_stop_on_town_road) return_cmd_error(STR_ERROR_DRIVE_THROUGH_ON_TOWN_ROAD);
957  CommandCost ret = CheckOwnership(road_owner);
958  if (ret.Failed()) return ret;
959  }
960  num_roadbits += CountBits(GetRoadBits(cur_tile, ROADTYPE_ROAD));
961  }
962 
963  /* There is a tram, check if we can build road+tram stop over it. */
964  if (HasBit(cur_rts, ROADTYPE_TRAM)) {
965  Owner tram_owner = GetRoadOwner(cur_tile, ROADTYPE_TRAM);
967  CommandCost ret = CheckOwnership(tram_owner);
968  if (ret.Failed()) return ret;
969  }
970  num_roadbits += CountBits(GetRoadBits(cur_tile, ROADTYPE_TRAM));
971  }
972 
973  /* Take into account existing roadbits. */
974  rts |= cur_rts;
975  } else {
976  ret = DoCommand(cur_tile, 0, 0, flags, CMD_LANDSCAPE_CLEAR);
977  if (ret.Failed()) return ret;
978  cost.AddCost(ret);
979  }
980 
981  uint roadbits_to_build = CountBits(rts) * 2 - num_roadbits;
982  cost.AddCost(_price[PR_BUILD_ROAD] * roadbits_to_build);
983  }
984  }
985 
986  return cost;
987 }
988 
997 {
998  TileArea cur_ta = st->train_station;
999 
1000  /* determine new size of train station region.. */
1001  int x = min(TileX(cur_ta.tile), TileX(new_ta.tile));
1002  int y = min(TileY(cur_ta.tile), TileY(new_ta.tile));
1003  new_ta.w = max(TileX(cur_ta.tile) + cur_ta.w, TileX(new_ta.tile) + new_ta.w) - x;
1004  new_ta.h = max(TileY(cur_ta.tile) + cur_ta.h, TileY(new_ta.tile) + new_ta.h) - y;
1005  new_ta.tile = TileXY(x, y);
1006 
1007  /* make sure the final size is not too big. */
1009  return_cmd_error(STR_ERROR_STATION_TOO_SPREAD_OUT);
1010  }
1011 
1012  return CommandCost();
1013 }
1014 
1015 static inline byte *CreateSingle(byte *layout, int n)
1016 {
1017  int i = n;
1018  do *layout++ = 0; while (--i);
1019  layout[((n - 1) >> 1) - n] = 2;
1020  return layout;
1021 }
1022 
1023 static inline byte *CreateMulti(byte *layout, int n, byte b)
1024 {
1025  int i = n;
1026  do *layout++ = b; while (--i);
1027  if (n > 4) {
1028  layout[0 - n] = 0;
1029  layout[n - 1 - n] = 0;
1030  }
1031  return layout;
1032 }
1033 
1041 void GetStationLayout(byte *layout, int numtracks, int plat_len, const StationSpec *statspec)
1042 {
1043  if (statspec != NULL && statspec->lengths >= plat_len &&
1044  statspec->platforms[plat_len - 1] >= numtracks &&
1045  statspec->layouts[plat_len - 1][numtracks - 1]) {
1046  /* Custom layout defined, follow it. */
1047  memcpy(layout, statspec->layouts[plat_len - 1][numtracks - 1],
1048  plat_len * numtracks);
1049  return;
1050  }
1051 
1052  if (plat_len == 1) {
1053  CreateSingle(layout, numtracks);
1054  } else {
1055  if (numtracks & 1) layout = CreateSingle(layout, plat_len);
1056  numtracks >>= 1;
1057 
1058  while (--numtracks >= 0) {
1059  layout = CreateMulti(layout, plat_len, 4);
1060  layout = CreateMulti(layout, plat_len, 6);
1061  }
1062  }
1063 }
1064 
1076 template <class T, StringID error_message>
1077 CommandCost FindJoiningBaseStation(StationID existing_station, StationID station_to_join, bool adjacent, TileArea ta, T **st)
1078 {
1079  assert(*st == NULL);
1080  bool check_surrounding = true;
1081 
1083  if (existing_station != INVALID_STATION) {
1084  if (adjacent && existing_station != station_to_join) {
1085  /* You can't build an adjacent station over the top of one that
1086  * already exists. */
1087  return_cmd_error(error_message);
1088  } else {
1089  /* Extend the current station, and don't check whether it will
1090  * be near any other stations. */
1091  *st = T::GetIfValid(existing_station);
1092  check_surrounding = (*st == NULL);
1093  }
1094  } else {
1095  /* There's no station here. Don't check the tiles surrounding this
1096  * one if the company wanted to build an adjacent station. */
1097  if (adjacent) check_surrounding = false;
1098  }
1099  }
1100 
1101  if (check_surrounding) {
1102  /* Make sure there are no similar stations around us. */
1103  CommandCost ret = GetStationAround(ta, existing_station, st);
1104  if (ret.Failed()) return ret;
1105  }
1106 
1107  /* Distant join */
1108  if (*st == NULL && station_to_join != INVALID_STATION) *st = T::GetIfValid(station_to_join);
1109 
1110  return CommandCost();
1111 }
1112 
1122 static CommandCost FindJoiningStation(StationID existing_station, StationID station_to_join, bool adjacent, TileArea ta, Station **st)
1123 {
1124  return FindJoiningBaseStation<Station, STR_ERROR_MUST_REMOVE_RAILWAY_STATION_FIRST>(existing_station, station_to_join, adjacent, ta, st);
1125 }
1126 
1136 CommandCost FindJoiningWaypoint(StationID existing_waypoint, StationID waypoint_to_join, bool adjacent, TileArea ta, Waypoint **wp)
1137 {
1138  return FindJoiningBaseStation<Waypoint, STR_ERROR_MUST_REMOVE_RAILWAYPOINT_FIRST>(existing_waypoint, waypoint_to_join, adjacent, ta, wp);
1139 }
1140 
1158 CommandCost CmdBuildRailStation(TileIndex tile_org, DoCommandFlag flags, uint32 p1, uint32 p2, const char *text)
1159 {
1160  /* Unpack parameters */
1161  RailType rt = Extract<RailType, 0, 4>(p1);
1162  Axis axis = Extract<Axis, 4, 1>(p1);
1163  byte numtracks = GB(p1, 8, 8);
1164  byte plat_len = GB(p1, 16, 8);
1165  bool adjacent = HasBit(p1, 24);
1166 
1167  StationClassID spec_class = Extract<StationClassID, 0, 8>(p2);
1168  byte spec_index = GB(p2, 8, 8);
1169  StationID station_to_join = GB(p2, 16, 16);
1170 
1171  /* Does the authority allow this? */
1172  CommandCost ret = CheckIfAuthorityAllowsNewStation(tile_org, flags);
1173  if (ret.Failed()) return ret;
1174 
1175  if (!ValParamRailtype(rt)) return CMD_ERROR;
1176 
1177  /* Check if the given station class is valid */
1178  if ((uint)spec_class >= StationClass::GetClassCount() || spec_class == STAT_CLASS_WAYP) return CMD_ERROR;
1179  if (spec_index >= StationClass::Get(spec_class)->GetSpecCount()) return CMD_ERROR;
1180  if (plat_len == 0 || numtracks == 0) return CMD_ERROR;
1181 
1182  int w_org, h_org;
1183  if (axis == AXIS_X) {
1184  w_org = plat_len;
1185  h_org = numtracks;
1186  } else {
1187  h_org = plat_len;
1188  w_org = numtracks;
1189  }
1190 
1191  bool reuse = (station_to_join != NEW_STATION);
1192  if (!reuse) station_to_join = INVALID_STATION;
1193  bool distant_join = (station_to_join != INVALID_STATION);
1194 
1195  if (distant_join && (!_settings_game.station.distant_join_stations || !Station::IsValidID(station_to_join))) return CMD_ERROR;
1196 
1198 
1199  /* these values are those that will be stored in train_tile and station_platforms */
1200  TileArea new_location(tile_org, w_org, h_org);
1201 
1202  /* Make sure the area below consists of clear tiles. (OR tiles belonging to a certain rail station) */
1203  StationID est = INVALID_STATION;
1204  SmallVector<Train *, 4> affected_vehicles;
1205  /* Clear the land below the station. */
1206  CommandCost cost = CheckFlatLandRailStation(new_location, flags, axis, &est, rt, affected_vehicles, spec_class, spec_index, plat_len, numtracks);
1207  if (cost.Failed()) return cost;
1208  /* Add construction expenses. */
1209  cost.AddCost((numtracks * _price[PR_BUILD_STATION_RAIL] + _price[PR_BUILD_STATION_RAIL_LENGTH]) * plat_len);
1210  cost.AddCost(numtracks * plat_len * RailBuildCost(rt));
1211 
1212  Station *st = NULL;
1213  ret = FindJoiningStation(est, station_to_join, adjacent, new_location, &st);
1214  if (ret.Failed()) return ret;
1215 
1216  ret = BuildStationPart(&st, flags, reuse, new_location, STATIONNAMING_RAIL);
1217  if (ret.Failed()) return ret;
1218 
1219  if (st != NULL && st->train_station.tile != INVALID_TILE) {
1220  CommandCost ret = CanExpandRailStation(st, new_location, axis);
1221  if (ret.Failed()) return ret;
1222  }
1223 
1224  /* Check if we can allocate a custom stationspec to this station */
1225  const StationSpec *statspec = StationClass::Get(spec_class)->GetSpec(spec_index);
1226  int specindex = AllocateSpecToStation(statspec, st, (flags & DC_EXEC) != 0);
1227  if (specindex == -1) return_cmd_error(STR_ERROR_TOO_MANY_STATION_SPECS);
1228 
1229  if (statspec != NULL) {
1230  /* Perform NewStation checks */
1231 
1232  /* Check if the station size is permitted */
1233  if (HasBit(statspec->disallowed_platforms, min(numtracks - 1, 7)) || HasBit(statspec->disallowed_lengths, min(plat_len - 1, 7))) {
1234  return CMD_ERROR;
1235  }
1236 
1237  /* Check if the station is buildable */
1238  if (HasBit(statspec->callback_mask, CBM_STATION_AVAIL)) {
1239  uint16 cb_res = GetStationCallback(CBID_STATION_AVAILABILITY, 0, 0, statspec, NULL, INVALID_TILE);
1240  if (cb_res != CALLBACK_FAILED && !Convert8bitBooleanCallback(statspec->grf_prop.grffile, CBID_STATION_AVAILABILITY, cb_res)) return CMD_ERROR;
1241  }
1242  }
1243 
1244  if (flags & DC_EXEC) {
1245  TileIndexDiff tile_delta;
1246  byte *layout_ptr;
1247  byte numtracks_orig;
1248  Track track;
1249 
1250  st->train_station = new_location;
1251  st->AddFacility(FACIL_TRAIN, new_location.tile);
1252 
1253  st->rect.BeforeAddRect(tile_org, w_org, h_org, StationRect::ADD_TRY);
1254 
1255  if (statspec != NULL) {
1256  /* Include this station spec's animation trigger bitmask
1257  * in the station's cached copy. */
1258  st->cached_anim_triggers |= statspec->animation.triggers;
1259  }
1260 
1261  tile_delta = (axis == AXIS_X ? TileDiffXY(1, 0) : TileDiffXY(0, 1));
1262  track = AxisToTrack(axis);
1263 
1264  layout_ptr = AllocaM(byte, numtracks * plat_len);
1265  GetStationLayout(layout_ptr, numtracks, plat_len, statspec);
1266 
1267  numtracks_orig = numtracks;
1268 
1269  Company *c = Company::Get(st->owner);
1270  TileIndex tile_track = tile_org;
1271  do {
1272  TileIndex tile = tile_track;
1273  int w = plat_len;
1274  do {
1275  byte layout = *layout_ptr++;
1276  if (IsRailStationTile(tile) && HasStationReservation(tile)) {
1277  /* Check for trains having a reservation for this tile. */
1279  if (v != NULL) {
1281  *affected_vehicles.Append() = v;
1283  for (; v->Next() != NULL; v = v->Next()) { }
1285  }
1286  }
1287 
1288  /* Railtype can change when overbuilding. */
1289  if (IsRailStationTile(tile)) {
1290  if (!IsStationTileBlocked(tile)) c->infrastructure.rail[GetRailType(tile)]--;
1291  c->infrastructure.station--;
1292  }
1293 
1294  /* Remove animation if overbuilding */
1295  DeleteAnimatedTile(tile);
1296  byte old_specindex = HasStationTileRail(tile) ? GetCustomStationSpecIndex(tile) : 0;
1297  MakeRailStation(tile, st->owner, st->index, axis, layout & ~1, rt);
1298  /* Free the spec if we overbuild something */
1299  DeallocateSpecFromStation(st, old_specindex);
1300 
1301  SetCustomStationSpecIndex(tile, specindex);
1302  SetStationTileRandomBits(tile, GB(Random(), 0, 4));
1303  SetAnimationFrame(tile, 0);
1304 
1305  if (!IsStationTileBlocked(tile)) c->infrastructure.rail[rt]++;
1306  c->infrastructure.station++;
1307 
1308  if (statspec != NULL) {
1309  /* Use a fixed axis for GetPlatformInfo as our platforms / numtracks are always the right way around */
1310  uint32 platinfo = GetPlatformInfo(AXIS_X, GetStationGfx(tile), plat_len, numtracks_orig, plat_len - w, numtracks_orig - numtracks, false);
1311 
1312  /* As the station is not yet completely finished, the station does not yet exist. */
1313  uint16 callback = GetStationCallback(CBID_STATION_TILE_LAYOUT, platinfo, 0, statspec, NULL, tile);
1314  if (callback != CALLBACK_FAILED) {
1315  if (callback < 8) {
1316  SetStationGfx(tile, (callback & ~1) + axis);
1317  } else {
1319  }
1320  }
1321 
1322  /* Trigger station animation -- after building? */
1323  TriggerStationAnimation(st, tile, SAT_BUILT);
1324  }
1325 
1326  tile += tile_delta;
1327  } while (--w);
1328  AddTrackToSignalBuffer(tile_track, track, _current_company);
1329  YapfNotifyTrackLayoutChange(tile_track, track);
1330  tile_track += tile_delta ^ TileDiffXY(1, 1); // perpendicular to tile_delta
1331  } while (--numtracks);
1332 
1333  for (uint i = 0; i < affected_vehicles.Length(); ++i) {
1334  /* Restore reservations of trains. */
1335  Train *v = affected_vehicles[i];
1337  TryPathReserve(v, true, true);
1338  for (; v->Next() != NULL; v = v->Next()) { }
1340  }
1341 
1342  /* Check whether we need to expand the reservation of trains already on the station. */
1343  TileArea update_reservation_area;
1344  if (axis == AXIS_X) {
1345  update_reservation_area = TileArea(tile_org, 1, numtracks_orig);
1346  } else {
1347  update_reservation_area = TileArea(tile_org, numtracks_orig, 1);
1348  }
1349 
1350  TILE_AREA_LOOP(tile, update_reservation_area) {
1351  /* Don't even try to make eye candy parts reserved. */
1352  if (IsStationTileBlocked(tile)) continue;
1353 
1354  DiagDirection dir = AxisToDiagDir(axis);
1355  TileIndexDiff tile_offset = TileOffsByDiagDir(dir);
1356  TileIndex platform_begin = tile;
1357  TileIndex platform_end = tile;
1358 
1359  /* We can only account for tiles that are reachable from this tile, so ignore primarily blocked tiles while finding the platform begin and end. */
1360  for (TileIndex next_tile = platform_begin - tile_offset; IsCompatibleTrainStationTile(next_tile, platform_begin); next_tile -= tile_offset) {
1361  platform_begin = next_tile;
1362  }
1363  for (TileIndex next_tile = platform_end + tile_offset; IsCompatibleTrainStationTile(next_tile, platform_end); next_tile += tile_offset) {
1364  platform_end = next_tile;
1365  }
1366 
1367  /* If there is at least on reservation on the platform, we reserve the whole platform. */
1368  bool reservation = false;
1369  for (TileIndex t = platform_begin; !reservation && t <= platform_end; t += tile_offset) {
1370  reservation = HasStationReservation(t);
1371  }
1372 
1373  if (reservation) {
1374  SetRailStationPlatformReservation(platform_begin, dir, true);
1375  }
1376  }
1377 
1378  st->MarkTilesDirty(false);
1379  st->UpdateVirtCoord();
1380  UpdateStationAcceptance(st, false);
1386  }
1387 
1388  return cost;
1389 }
1390 
1391 static void MakeRailStationAreaSmaller(BaseStation *st)
1392 {
1393  TileArea ta = st->train_station;
1394 
1395 restart:
1396 
1397  /* too small? */
1398  if (ta.w != 0 && ta.h != 0) {
1399  /* check the left side, x = constant, y changes */
1400  for (uint i = 0; !st->TileBelongsToRailStation(ta.tile + TileDiffXY(0, i));) {
1401  /* the left side is unused? */
1402  if (++i == ta.h) {
1403  ta.tile += TileDiffXY(1, 0);
1404  ta.w--;
1405  goto restart;
1406  }
1407  }
1408 
1409  /* check the right side, x = constant, y changes */
1410  for (uint i = 0; !st->TileBelongsToRailStation(ta.tile + TileDiffXY(ta.w - 1, i));) {
1411  /* the right side is unused? */
1412  if (++i == ta.h) {
1413  ta.w--;
1414  goto restart;
1415  }
1416  }
1417 
1418  /* check the upper side, y = constant, x changes */
1419  for (uint i = 0; !st->TileBelongsToRailStation(ta.tile + TileDiffXY(i, 0));) {
1420  /* the left side is unused? */
1421  if (++i == ta.w) {
1422  ta.tile += TileDiffXY(0, 1);
1423  ta.h--;
1424  goto restart;
1425  }
1426  }
1427 
1428  /* check the lower side, y = constant, x changes */
1429  for (uint i = 0; !st->TileBelongsToRailStation(ta.tile + TileDiffXY(i, ta.h - 1));) {
1430  /* the left side is unused? */
1431  if (++i == ta.w) {
1432  ta.h--;
1433  goto restart;
1434  }
1435  }
1436  } else {
1437  ta.Clear();
1438  }
1439 
1440  st->train_station = ta;
1441 }
1442 
1453 template <class T>
1454 CommandCost RemoveFromRailBaseStation(TileArea ta, SmallVector<T *, 4> &affected_stations, DoCommandFlag flags, Money removal_cost, bool keep_rail)
1455 {
1456  /* Count of the number of tiles removed */
1457  int quantity = 0;
1458  CommandCost total_cost(EXPENSES_CONSTRUCTION);
1459  /* Accumulator for the errors seen during clearing. If no errors happen,
1460  * and the quantity is 0 there is no station. Otherwise it will be one
1461  * of the other error that got accumulated. */
1463 
1464  /* Do the action for every tile into the area */
1465  TILE_AREA_LOOP(tile, ta) {
1466  /* Make sure the specified tile is a rail station */
1467  if (!HasStationTileRail(tile)) continue;
1468 
1469  /* If there is a vehicle on ground, do not allow to remove (flood) the tile */
1471  error.AddCost(ret);
1472  if (ret.Failed()) continue;
1473 
1474  /* Check ownership of station */
1475  T *st = T::GetByTile(tile);
1476  if (st == NULL) continue;
1477 
1478  if (_current_company != OWNER_WATER) {
1479  CommandCost ret = CheckOwnership(st->owner);
1480  error.AddCost(ret);
1481  if (ret.Failed()) continue;
1482  }
1483 
1484  /* If we reached here, the tile is valid so increase the quantity of tiles we will remove */
1485  quantity++;
1486 
1487  if (keep_rail || IsStationTileBlocked(tile)) {
1488  /* Don't refund the 'steel' of the track when we keep the
1489  * rail, or when the tile didn't have any rail at all. */
1490  total_cost.AddCost(-_price[PR_CLEAR_RAIL]);
1491  }
1492 
1493  if (flags & DC_EXEC) {
1494  /* read variables before the station tile is removed */
1495  uint specindex = GetCustomStationSpecIndex(tile);
1496  Track track = GetRailStationTrack(tile);
1497  Owner owner = GetTileOwner(tile);
1498  RailType rt = GetRailType(tile);
1499  Train *v = NULL;
1500 
1501  if (HasStationReservation(tile)) {
1502  v = GetTrainForReservation(tile, track);
1503  if (v != NULL) {
1504  /* Free train reservation. */
1507  Vehicle *temp = v;
1508  for (; temp->Next() != NULL; temp = temp->Next()) { }
1510  }
1511  }
1512 
1513  bool build_rail = keep_rail && !IsStationTileBlocked(tile);
1514  if (!build_rail && !IsStationTileBlocked(tile)) Company::Get(owner)->infrastructure.rail[rt]--;
1515 
1516  DoClearSquare(tile);
1517  DeleteNewGRFInspectWindow(GSF_STATIONS, tile);
1518  if (build_rail) MakeRailNormal(tile, owner, TrackToTrackBits(track), rt);
1519  Company::Get(owner)->infrastructure.station--;
1521 
1522  st->rect.AfterRemoveTile(st, tile);
1523  AddTrackToSignalBuffer(tile, track, owner);
1524  YapfNotifyTrackLayoutChange(tile, track);
1525 
1526  DeallocateSpecFromStation(st, specindex);
1527 
1528  affected_stations.Include(st);
1529 
1530  if (v != NULL) {
1531  /* Restore station reservation. */
1533  TryPathReserve(v, true, true);
1534  for (; v->Next() != NULL; v = v->Next()) { }
1536  }
1537  }
1538  }
1539 
1540  if (quantity == 0) return error.Failed() ? error : CommandCost(STR_ERROR_THERE_IS_NO_STATION);
1541 
1542  for (T **stp = affected_stations.Begin(); stp != affected_stations.End(); stp++) {
1543  T *st = *stp;
1544 
1545  /* now we need to make the "spanned" area of the railway station smaller
1546  * if we deleted something at the edges.
1547  * we also need to adjust train_tile. */
1548  MakeRailStationAreaSmaller(st);
1549  UpdateStationSignCoord(st);
1550 
1551  /* if we deleted the whole station, delete the train facility. */
1552  if (st->train_station.tile == INVALID_TILE) {
1553  st->facilities &= ~FACIL_TRAIN;
1555  st->UpdateVirtCoord();
1557  }
1558  }
1559 
1560  total_cost.AddCost(quantity * removal_cost);
1561  return total_cost;
1562 }
1563 
1575 CommandCost CmdRemoveFromRailStation(TileIndex start, DoCommandFlag flags, uint32 p1, uint32 p2, const char *text)
1576 {
1577  TileIndex end = p1 == 0 ? start : p1;
1578  if (start >= MapSize() || end >= MapSize()) return CMD_ERROR;
1579 
1580  TileArea ta(start, end);
1581  SmallVector<Station *, 4> affected_stations;
1582 
1583  CommandCost ret = RemoveFromRailBaseStation(ta, affected_stations, flags, _price[PR_CLEAR_STATION_RAIL], HasBit(p2, 0));
1584  if (ret.Failed()) return ret;
1585 
1586  /* Do all station specific functions here. */
1587  for (Station **stp = affected_stations.Begin(); stp != affected_stations.End(); stp++) {
1588  Station *st = *stp;
1589 
1591  st->MarkTilesDirty(false);
1593  }
1594 
1595  /* Now apply the rail cost to the number that we deleted */
1596  return ret;
1597 }
1598 
1610 CommandCost CmdRemoveFromRailWaypoint(TileIndex start, DoCommandFlag flags, uint32 p1, uint32 p2, const char *text)
1611 {
1612  TileIndex end = p1 == 0 ? start : p1;
1613  if (start >= MapSize() || end >= MapSize()) return CMD_ERROR;
1614 
1615  TileArea ta(start, end);
1616  SmallVector<Waypoint *, 4> affected_stations;
1617 
1618  return RemoveFromRailBaseStation(ta, affected_stations, flags, _price[PR_CLEAR_WAYPOINT_RAIL], HasBit(p2, 0));
1619 }
1620 
1621 
1629 template <class T>
1631 {
1632  /* Current company owns the station? */
1633  if (_current_company != OWNER_WATER) {
1634  CommandCost ret = CheckOwnership(st->owner);
1635  if (ret.Failed()) return ret;
1636  }
1637 
1638  /* determine width and height of platforms */
1639  TileArea ta = st->train_station;
1640 
1641  assert(ta.w != 0 && ta.h != 0);
1642 
1644  /* clear all areas of the station */
1645  TILE_AREA_LOOP(tile, ta) {
1646  /* only remove tiles that are actually train station tiles */
1647  if (!st->TileBelongsToRailStation(tile)) continue;
1648 
1650  if (ret.Failed()) return ret;
1651 
1652  cost.AddCost(_price[PR_CLEAR_STATION_RAIL]);
1653  if (flags & DC_EXEC) {
1654  /* read variables before the station tile is removed */
1655  Track track = GetRailStationTrack(tile);
1656  Owner owner = GetTileOwner(tile); // _current_company can be OWNER_WATER
1657  Train *v = NULL;
1658  if (HasStationReservation(tile)) {
1659  v = GetTrainForReservation(tile, track);
1660  if (v != NULL) FreeTrainTrackReservation(v);
1661  }
1662  if (!IsStationTileBlocked(tile)) Company::Get(owner)->infrastructure.rail[GetRailType(tile)]--;
1663  Company::Get(owner)->infrastructure.station--;
1664  DoClearSquare(tile);
1665  DeleteNewGRFInspectWindow(GSF_STATIONS, tile);
1666  AddTrackToSignalBuffer(tile, track, owner);
1667  YapfNotifyTrackLayoutChange(tile, track);
1668  if (v != NULL) TryPathReserve(v, true);
1669  }
1670  }
1671 
1672  if (flags & DC_EXEC) {
1673  st->rect.AfterRemoveRect(st, st->train_station);
1674 
1675  st->train_station.Clear();
1676 
1677  st->facilities &= ~FACIL_TRAIN;
1678 
1679  free(st->speclist);
1680  st->num_specs = 0;
1681  st->speclist = NULL;
1682  st->cached_anim_triggers = 0;
1683 
1686  st->UpdateVirtCoord();
1688  }
1689 
1690  return cost;
1691 }
1692 
1700 {
1701  /* if there is flooding, remove platforms tile by tile */
1702  if (_current_company == OWNER_WATER) {
1703  return DoCommand(tile, 0, 0, DC_EXEC, CMD_REMOVE_FROM_RAIL_STATION);
1704  }
1705 
1706  Station *st = Station::GetByTile(tile);
1707  CommandCost cost = RemoveRailStation(st, flags);
1708 
1709  if (flags & DC_EXEC) st->RecomputeIndustriesNear();
1710 
1711  return cost;
1712 }
1713 
1721 {
1722  /* if there is flooding, remove waypoints tile by tile */
1723  if (_current_company == OWNER_WATER) {
1724  return DoCommand(tile, 0, 0, DC_EXEC, CMD_REMOVE_FROM_RAIL_WAYPOINT);
1725  }
1726 
1727  return RemoveRailStation(Waypoint::GetByTile(tile), flags);
1728 }
1729 
1730 
1736 static RoadStop **FindRoadStopSpot(bool truck_station, Station *st)
1737 {
1738  RoadStop **primary_stop = (truck_station) ? &st->truck_stops : &st->bus_stops;
1739 
1740  if (*primary_stop == NULL) {
1741  /* we have no roadstop of the type yet, so write a "primary stop" */
1742  return primary_stop;
1743  } else {
1744  /* there are stops already, so append to the end of the list */
1745  RoadStop *stop = *primary_stop;
1746  while (stop->next != NULL) stop = stop->next;
1747  return &stop->next;
1748  }
1749 }
1750 
1752 
1762 static CommandCost FindJoiningRoadStop(StationID existing_stop, StationID station_to_join, bool adjacent, TileArea ta, Station **st)
1763 {
1764  return FindJoiningBaseStation<Station, STR_ERROR_MUST_REMOVE_ROAD_STOP_FIRST>(existing_stop, station_to_join, adjacent, ta, st);
1765 }
1766 
1783 CommandCost CmdBuildRoadStop(TileIndex tile, DoCommandFlag flags, uint32 p1, uint32 p2, const char *text)
1784 {
1785  bool type = HasBit(p2, 0);
1786  bool is_drive_through = HasBit(p2, 1);
1787  RoadTypes rts = Extract<RoadTypes, 2, 2>(p2);
1788  StationID station_to_join = GB(p2, 16, 16);
1789  bool reuse = (station_to_join != NEW_STATION);
1790  if (!reuse) station_to_join = INVALID_STATION;
1791  bool distant_join = (station_to_join != INVALID_STATION);
1792 
1793  uint8 width = (uint8)GB(p1, 0, 8);
1794  uint8 lenght = (uint8)GB(p1, 8, 8);
1795 
1796  /* Check if the requested road stop is too big */
1797  if (width > _settings_game.station.station_spread || lenght > _settings_game.station.station_spread) return_cmd_error(STR_ERROR_STATION_TOO_SPREAD_OUT);
1798  /* Check for incorrect width / length. */
1799  if (width == 0 || lenght == 0) return CMD_ERROR;
1800  /* Check if the first tile and the last tile are valid */
1801  if (!IsValidTile(tile) || TileAddWrap(tile, width - 1, lenght - 1) == INVALID_TILE) return CMD_ERROR;
1802 
1803  TileArea roadstop_area(tile, width, lenght);
1804 
1805  if (distant_join && (!_settings_game.station.distant_join_stations || !Station::IsValidID(station_to_join))) return CMD_ERROR;
1806 
1807  if (!HasExactlyOneBit(rts) || !HasRoadTypesAvail(_current_company, rts)) return CMD_ERROR;
1808 
1809  /* Trams only have drive through stops */
1810  if (!is_drive_through && HasBit(rts, ROADTYPE_TRAM)) return CMD_ERROR;
1811 
1812  DiagDirection ddir;
1813  Axis axis;
1814  if (is_drive_through) {
1815  /* By definition axis is valid, due to there being 2 axes and reading 1 bit. */
1816  axis = Extract<Axis, 6, 1>(p2);
1817  ddir = AxisToDiagDir(axis);
1818  } else {
1819  /* By definition ddir is valid, due to there being 4 diagonal directions and reading 2 bits. */
1820  ddir = Extract<DiagDirection, 6, 2>(p2);
1821  axis = DiagDirToAxis(ddir);
1822  }
1823 
1824  CommandCost ret = CheckIfAuthorityAllowsNewStation(tile, flags);
1825  if (ret.Failed()) return ret;
1826 
1827  /* Total road stop cost. */
1828  CommandCost cost(EXPENSES_CONSTRUCTION, roadstop_area.w * roadstop_area.h * _price[type ? PR_BUILD_STATION_TRUCK : PR_BUILD_STATION_BUS]);
1829  StationID est = INVALID_STATION;
1830  ret = CheckFlatLandRoadStop(roadstop_area, flags, is_drive_through ? 5 << axis : 1 << ddir, is_drive_through, type, axis, &est, rts);
1831  if (ret.Failed()) return ret;
1832  cost.AddCost(ret);
1833 
1834  Station *st = NULL;
1835  ret = FindJoiningRoadStop(est, station_to_join, HasBit(p2, 5), roadstop_area, &st);
1836  if (ret.Failed()) return ret;
1837 
1838  /* Check if this number of road stops can be allocated. */
1839  if (!RoadStop::CanAllocateItem(roadstop_area.w * roadstop_area.h)) return_cmd_error(type ? STR_ERROR_TOO_MANY_TRUCK_STOPS : STR_ERROR_TOO_MANY_BUS_STOPS);
1840 
1841  ret = BuildStationPart(&st, flags, reuse, roadstop_area, STATIONNAMING_ROAD);
1842  if (ret.Failed()) return ret;
1843 
1844  if (flags & DC_EXEC) {
1845  /* Check every tile in the area. */
1846  TILE_AREA_LOOP(cur_tile, roadstop_area) {
1847  RoadTypes cur_rts = GetRoadTypes(cur_tile);
1848  Owner road_owner = HasBit(cur_rts, ROADTYPE_ROAD) ? GetRoadOwner(cur_tile, ROADTYPE_ROAD) : _current_company;
1849  Owner tram_owner = HasBit(cur_rts, ROADTYPE_TRAM) ? GetRoadOwner(cur_tile, ROADTYPE_TRAM) : _current_company;
1850 
1851  if (IsTileType(cur_tile, MP_STATION) && IsRoadStop(cur_tile)) {
1852  RemoveRoadStop(cur_tile, flags);
1853  }
1854 
1855  RoadStop *road_stop = new RoadStop(cur_tile);
1856  /* Insert into linked list of RoadStops. */
1857  RoadStop **currstop = FindRoadStopSpot(type, st);
1858  *currstop = road_stop;
1859 
1860  if (type) {
1861  st->truck_station.Add(cur_tile);
1862  } else {
1863  st->bus_station.Add(cur_tile);
1864  }
1865 
1866  /* Initialize an empty station. */
1867  st->AddFacility((type) ? FACIL_TRUCK_STOP : FACIL_BUS_STOP, cur_tile);
1868 
1869  st->rect.BeforeAddTile(cur_tile, StationRect::ADD_TRY);
1870 
1871  RoadStopType rs_type = type ? ROADSTOP_TRUCK : ROADSTOP_BUS;
1872  if (is_drive_through) {
1873  /* Update company infrastructure counts. If the current tile is a normal
1874  * road tile, count only the new road bits needed to get a full diagonal road. */
1875  RoadType rt;
1876  FOR_EACH_SET_ROADTYPE(rt, cur_rts | rts) {
1877  Company *c = Company::GetIfValid(rt == ROADTYPE_ROAD ? road_owner : tram_owner);
1878  if (c != NULL) {
1879  c->infrastructure.road[rt] += 2 - (IsNormalRoadTile(cur_tile) && HasBit(cur_rts, rt) ? CountBits(GetRoadBits(cur_tile, rt)) : 0);
1881  }
1882  }
1883 
1884  MakeDriveThroughRoadStop(cur_tile, st->owner, road_owner, tram_owner, st->index, rs_type, rts | cur_rts, axis);
1885  road_stop->MakeDriveThrough();
1886  } else {
1887  /* Non-drive-through stop never overbuild and always count as two road bits. */
1888  Company::Get(st->owner)->infrastructure.road[FIND_FIRST_BIT(rts)] += 2;
1889  MakeRoadStop(cur_tile, st->owner, st->index, rs_type, rts, ddir);
1890  }
1891  Company::Get(st->owner)->infrastructure.station++;
1893 
1894  MarkTileDirtyByTile(cur_tile);
1895  }
1896  }
1897 
1898  if (st != NULL) {
1899  st->UpdateVirtCoord();
1900  UpdateStationAcceptance(st, false);
1905  }
1906  return cost;
1907 }
1908 
1909 
1910 static Vehicle *ClearRoadStopStatusEnum(Vehicle *v, void *)
1911 {
1912  if (v->type == VEH_ROAD) {
1913  /* Okay... we are a road vehicle on a drive through road stop.
1914  * But that road stop has just been removed, so we need to make
1915  * sure we are in a valid state... however, vehicles can also
1916  * turn on road stop tiles, so only clear the 'road stop' state
1917  * bits and only when the state was 'in road stop', otherwise
1918  * we'll end up clearing the turn around bits. */
1919  RoadVehicle *rv = RoadVehicle::From(v);
1921  }
1922 
1923  return NULL;
1924 }
1925 
1926 
1934 {
1935  Station *st = Station::GetByTile(tile);
1936 
1937  if (_current_company != OWNER_WATER) {
1938  CommandCost ret = CheckOwnership(st->owner);
1939  if (ret.Failed()) return ret;
1940  }
1941 
1942  bool is_truck = IsTruckStop(tile);
1943 
1944  RoadStop **primary_stop;
1945  RoadStop *cur_stop;
1946  if (is_truck) { // truck stop
1947  primary_stop = &st->truck_stops;
1948  cur_stop = RoadStop::GetByTile(tile, ROADSTOP_TRUCK);
1949  } else {
1950  primary_stop = &st->bus_stops;
1951  cur_stop = RoadStop::GetByTile(tile, ROADSTOP_BUS);
1952  }
1953 
1954  assert(cur_stop != NULL);
1955 
1956  /* don't do the check for drive-through road stops when company bankrupts */
1957  if (IsDriveThroughStopTile(tile) && (flags & DC_BANKRUPT)) {
1958  /* remove the 'going through road stop' status from all vehicles on that tile */
1959  if (flags & DC_EXEC) FindVehicleOnPos(tile, NULL, &ClearRoadStopStatusEnum);
1960  } else {
1962  if (ret.Failed()) return ret;
1963  }
1964 
1965  if (flags & DC_EXEC) {
1966  if (*primary_stop == cur_stop) {
1967  /* removed the first stop in the list */
1968  *primary_stop = cur_stop->next;
1969  /* removed the only stop? */
1970  if (*primary_stop == NULL) {
1971  st->facilities &= (is_truck ? ~FACIL_TRUCK_STOP : ~FACIL_BUS_STOP);
1972  }
1973  } else {
1974  /* tell the predecessor in the list to skip this stop */
1975  RoadStop *pred = *primary_stop;
1976  while (pred->next != cur_stop) pred = pred->next;
1977  pred->next = cur_stop->next;
1978  }
1979 
1980  /* Update company infrastructure counts. */
1981  RoadType rt;
1982  FOR_EACH_SET_ROADTYPE(rt, GetRoadTypes(tile)) {
1983  Company *c = Company::GetIfValid(GetRoadOwner(tile, rt));
1984  if (c != NULL) {
1985  c->infrastructure.road[rt] -= 2;
1987  }
1988  }
1989  Company::Get(st->owner)->infrastructure.station--;
1990 
1991  if (IsDriveThroughStopTile(tile)) {
1992  /* Clears the tile for us */
1993  cur_stop->ClearDriveThrough();
1994  } else {
1995  DoClearSquare(tile);
1996  }
1997 
1999  delete cur_stop;
2000 
2001  /* Make sure no vehicle is going to the old roadstop */
2002  RoadVehicle *v;
2003  FOR_ALL_ROADVEHICLES(v) {
2004  if (v->First() == v && v->current_order.IsType(OT_GOTO_STATION) &&
2005  v->dest_tile == tile) {
2007  }
2008  }
2009 
2010  st->rect.AfterRemoveTile(st, tile);
2011 
2012  st->UpdateVirtCoord();
2015 
2016  /* Update the tile area of the truck/bus stop */
2017  if (is_truck) {
2018  st->truck_station.Clear();
2019  for (const RoadStop *rs = st->truck_stops; rs != NULL; rs = rs->next) st->truck_station.Add(rs->xy);
2020  } else {
2021  st->bus_station.Clear();
2022  for (const RoadStop *rs = st->bus_stops; rs != NULL; rs = rs->next) st->bus_station.Add(rs->xy);
2023  }
2024  }
2025 
2026  return CommandCost(EXPENSES_CONSTRUCTION, _price[is_truck ? PR_CLEAR_STATION_TRUCK : PR_CLEAR_STATION_BUS]);
2027 }
2028 
2039 CommandCost CmdRemoveRoadStop(TileIndex tile, DoCommandFlag flags, uint32 p1, uint32 p2, const char *text)
2040 {
2041  uint8 width = (uint8)GB(p1, 0, 8);
2042  uint8 height = (uint8)GB(p1, 8, 8);
2043 
2044  /* Check for incorrect width / height. */
2045  if (width == 0 || height == 0) return CMD_ERROR;
2046  /* Check if the first tile and the last tile are valid */
2047  if (!IsValidTile(tile) || TileAddWrap(tile, width - 1, height - 1) == INVALID_TILE) return CMD_ERROR;
2048 
2049  TileArea roadstop_area(tile, width, height);
2050 
2052  CommandCost last_error(STR_ERROR_THERE_IS_NO_STATION);
2053  bool had_success = false;
2054 
2055  TILE_AREA_LOOP(cur_tile, roadstop_area) {
2056  /* Make sure the specified tile is a road stop of the correct type */
2057  if (!IsTileType(cur_tile, MP_STATION) || !IsRoadStop(cur_tile) || (uint32)GetRoadStopType(cur_tile) != GB(p2, 0, 1)) continue;
2058 
2059  /* Save the stop info before it is removed */
2060  bool is_drive_through = IsDriveThroughStopTile(cur_tile);
2061  RoadTypes rts = GetRoadTypes(cur_tile);
2062  RoadBits road_bits = IsDriveThroughStopTile(cur_tile) ?
2063  ((GetRoadStopDir(cur_tile) == DIAGDIR_NE) ? ROAD_X : ROAD_Y) :
2064  DiagDirToRoadBits(GetRoadStopDir(cur_tile));
2065 
2066  Owner road_owner = GetRoadOwner(cur_tile, ROADTYPE_ROAD);
2067  Owner tram_owner = GetRoadOwner(cur_tile, ROADTYPE_TRAM);
2068  CommandCost ret = RemoveRoadStop(cur_tile, flags);
2069  if (ret.Failed()) {
2070  last_error = ret;
2071  continue;
2072  }
2073  cost.AddCost(ret);
2074  had_success = true;
2075 
2076  /* If the stop was a drive-through stop replace the road */
2077  if ((flags & DC_EXEC) && is_drive_through) {
2078  MakeRoadNormal(cur_tile, road_bits, rts, ClosestTownFromTile(cur_tile, UINT_MAX)->index,
2079  road_owner, tram_owner);
2080 
2081  /* Update company infrastructure counts. */
2082  RoadType rt;
2083  FOR_EACH_SET_ROADTYPE(rt, rts) {
2084  Company *c = Company::GetIfValid(GetRoadOwner(cur_tile, rt));
2085  if (c != NULL) {
2086  c->infrastructure.road[rt] += CountBits(road_bits);
2088  }
2089  }
2090  }
2091  }
2092 
2093  return had_success ? cost : last_error;
2094 }
2095 
2103 {
2104  uint mindist = UINT_MAX;
2105 
2106  for (TileIndex cur_tile = it; cur_tile != INVALID_TILE; cur_tile = ++it) {
2107  mindist = min(mindist, DistanceManhattan(town_tile, cur_tile));
2108  }
2109 
2110  return mindist;
2111 }
2112 
2123 {
2124  /* 0 cannot be accounted, and 1 is the lowest that can be reduced from town.
2125  * So no need to go any further*/
2126  if (as->noise_level < 2) return as->noise_level;
2127 
2128  uint distance = GetMinimalAirportDistanceToTile(it, town_tile);
2129 
2130  /* The steps for measuring noise reduction are based on the "magical" (and arbitrary) 8 base distance
2131  * adding the town_council_tolerance 4 times, as a way to graduate, depending of the tolerance.
2132  * Basically, it says that the less tolerant a town is, the bigger the distance before
2133  * an actual decrease can be granted */
2134  uint8 town_tolerance_distance = 8 + (_settings_game.difficulty.town_council_tolerance * 4);
2135 
2136  /* now, we want to have the distance segmented using the distance judged bareable by town
2137  * This will give us the coefficient of reduction the distance provides. */
2138  uint noise_reduction = distance / town_tolerance_distance;
2139 
2140  /* If the noise reduction equals the airport noise itself, don't give it for free.
2141  * Otherwise, simply reduce the airport's level. */
2142  return noise_reduction >= as->noise_level ? 1 : as->noise_level - noise_reduction;
2143 }
2144 
2153 {
2154  Town *t, *nearest = NULL;
2155  uint add = as->size_x + as->size_y - 2; // GetMinimalAirportDistanceToTile can differ from DistanceManhattan by this much
2156  uint mindist = UINT_MAX - add; // prevent overflow
2157  FOR_ALL_TOWNS(t) {
2158  if (DistanceManhattan(t->xy, it) < mindist + add) { // avoid calling GetMinimalAirportDistanceToTile too often
2159  TileIterator *copy = it.Clone();
2160  uint dist = GetMinimalAirportDistanceToTile(*copy, t->xy);
2161  delete copy;
2162  if (dist < mindist) {
2163  nearest = t;
2164  mindist = dist;
2165  }
2166  }
2167  }
2168 
2169  return nearest;
2170 }
2171 
2172 
2175 {
2176  Town *t;
2177  const Station *st;
2178 
2179  FOR_ALL_TOWNS(t) t->noise_reached = 0;
2180 
2181  FOR_ALL_STATIONS(st) {
2182  if (st->airport.tile != INVALID_TILE && st->airport.type != AT_OILRIG) {
2183  const AirportSpec *as = st->airport.GetSpec();
2184  AirportTileIterator it(st);
2185  Town *nearest = AirportGetNearestTown(as, it);
2186  nearest->noise_reached += GetAirportNoiseLevelForTown(as, it, nearest->xy);
2187  }
2188  }
2189 }
2190 
2204 CommandCost CmdBuildAirport(TileIndex tile, DoCommandFlag flags, uint32 p1, uint32 p2, const char *text)
2205 {
2206  StationID station_to_join = GB(p2, 16, 16);
2207  bool reuse = (station_to_join != NEW_STATION);
2208  if (!reuse) station_to_join = INVALID_STATION;
2209  bool distant_join = (station_to_join != INVALID_STATION);
2210  byte airport_type = GB(p1, 0, 8);
2211  byte layout = GB(p1, 8, 8);
2212 
2213  if (distant_join && (!_settings_game.station.distant_join_stations || !Station::IsValidID(station_to_join))) return CMD_ERROR;
2214 
2215  if (airport_type >= NUM_AIRPORTS) return CMD_ERROR;
2216 
2217  CommandCost ret = CheckIfAuthorityAllowsNewStation(tile, flags);
2218  if (ret.Failed()) return ret;
2219 
2220  /* Check if a valid, buildable airport was chosen for construction */
2221  const AirportSpec *as = AirportSpec::Get(airport_type);
2222  if (!as->IsAvailable() || layout >= as->num_table) return CMD_ERROR;
2223 
2224  Direction rotation = as->rotation[layout];
2225  int w = as->size_x;
2226  int h = as->size_y;
2227  if (rotation == DIR_E || rotation == DIR_W) Swap(w, h);
2228  TileArea airport_area = TileArea(tile, w, h);
2229 
2231  return_cmd_error(STR_ERROR_STATION_TOO_SPREAD_OUT);
2232  }
2233 
2234  CommandCost cost = CheckFlatLand(airport_area, flags);
2235  if (cost.Failed()) return cost;
2236 
2237  /* The noise level is the noise from the airport and reduce it to account for the distance to the town center. */
2238  AirportTileTableIterator iter(as->table[layout], tile);
2239  Town *nearest = AirportGetNearestTown(as, iter);
2240  uint newnoise_level = GetAirportNoiseLevelForTown(as, iter, nearest->xy);
2241 
2242  /* Check if local auth would allow a new airport */
2243  StringID authority_refuse_message = STR_NULL;
2244  Town *authority_refuse_town = NULL;
2245 
2247  /* do not allow to build a new airport if this raise the town noise over the maximum allowed by town */
2248  if ((nearest->noise_reached + newnoise_level) > nearest->MaxTownNoise()) {
2249  authority_refuse_message = STR_ERROR_LOCAL_AUTHORITY_REFUSES_NOISE;
2250  authority_refuse_town = nearest;
2251  }
2252  } else {
2253  Town *t = ClosestTownFromTile(tile, UINT_MAX);
2254  uint num = 0;
2255  const Station *st;
2256  FOR_ALL_STATIONS(st) {
2257  if (st->town == t && (st->facilities & FACIL_AIRPORT) && st->airport.type != AT_OILRIG) num++;
2258  }
2259  if (num >= 2) {
2260  authority_refuse_message = STR_ERROR_LOCAL_AUTHORITY_REFUSES_AIRPORT;
2261  authority_refuse_town = t;
2262  }
2263  }
2264 
2265  if (authority_refuse_message != STR_NULL) {
2266  SetDParam(0, authority_refuse_town->index);
2267  return_cmd_error(authority_refuse_message);
2268  }
2269 
2270  Station *st = NULL;
2271  ret = FindJoiningStation(INVALID_STATION, station_to_join, HasBit(p2, 0), airport_area, &st);
2272  if (ret.Failed()) return ret;
2273 
2274  /* Distant join */
2275  if (st == NULL && distant_join) st = Station::GetIfValid(station_to_join);
2276 
2277  ret = BuildStationPart(&st, flags, reuse, airport_area, (GetAirport(airport_type)->flags & AirportFTAClass::AIRPLANES) ? STATIONNAMING_AIRPORT : STATIONNAMING_HELIPORT);
2278  if (ret.Failed()) return ret;
2279 
2280  if (st != NULL && st->airport.tile != INVALID_TILE) {
2281  return_cmd_error(STR_ERROR_TOO_CLOSE_TO_ANOTHER_AIRPORT);
2282  }
2283 
2284  for (AirportTileTableIterator iter(as->table[layout], tile); iter != INVALID_TILE; ++iter) {
2285  cost.AddCost(_price[PR_BUILD_STATION_AIRPORT]);
2286  }
2287 
2288  if (flags & DC_EXEC) {
2289  /* Always add the noise, so there will be no need to recalculate when option toggles */
2290  nearest->noise_reached += newnoise_level;
2291 
2292  st->AddFacility(FACIL_AIRPORT, tile);
2293  st->airport.type = airport_type;
2294  st->airport.layout = layout;
2295  st->airport.flags = 0;
2296  st->airport.rotation = rotation;
2297 
2298  st->rect.BeforeAddRect(tile, w, h, StationRect::ADD_TRY);
2299 
2300  for (AirportTileTableIterator iter(as->table[layout], tile); iter != INVALID_TILE; ++iter) {
2301  MakeAirport(iter, st->owner, st->index, iter.GetStationGfx(), WATER_CLASS_INVALID);
2302  SetStationTileRandomBits(iter, GB(Random(), 0, 4));
2303  st->airport.Add(iter);
2304 
2306  }
2307 
2308  /* Only call the animation trigger after all tiles have been built */
2309  for (AirportTileTableIterator iter(as->table[layout], tile); iter != INVALID_TILE; ++iter) {
2310  AirportTileAnimationTrigger(st, iter, AAT_BUILT);
2311  }
2312 
2314 
2315  Company::Get(st->owner)->infrastructure.airport++;
2317 
2318  st->UpdateVirtCoord();
2319  UpdateStationAcceptance(st, false);
2324 
2327  }
2328  }
2329 
2330  return cost;
2331 }
2332 
2340 {
2341  Station *st = Station::GetByTile(tile);
2342 
2343  if (_current_company != OWNER_WATER) {
2344  CommandCost ret = CheckOwnership(st->owner);
2345  if (ret.Failed()) return ret;
2346  }
2347 
2348  tile = st->airport.tile;
2349 
2351 
2352  const Aircraft *a;
2353  FOR_ALL_AIRCRAFT(a) {
2354  if (!a->IsNormalAircraft()) continue;
2355  if (a->targetairport == st->index && a->state != FLYING) return CMD_ERROR;
2356  }
2357 
2358  if (flags & DC_EXEC) {
2359  const AirportSpec *as = st->airport.GetSpec();
2360  /* The noise level is the noise from the airport and reduce it to account for the distance to the town center.
2361  * And as for construction, always remove it, even if the setting is not set, in order to avoid the
2362  * need of recalculation */
2363  AirportTileIterator it(st);
2364  Town *nearest = AirportGetNearestTown(as, it);
2365  nearest->noise_reached -= GetAirportNoiseLevelForTown(as, it, nearest->xy);
2366  }
2367 
2368  TILE_AREA_LOOP(tile_cur, st->airport) {
2369  if (!st->TileBelongsToAirport(tile_cur)) continue;
2370 
2371  CommandCost ret = EnsureNoVehicleOnGround(tile_cur);
2372  if (ret.Failed()) return ret;
2373 
2374  cost.AddCost(_price[PR_CLEAR_STATION_AIRPORT]);
2375 
2376  if (flags & DC_EXEC) {
2377  if (IsHangarTile(tile_cur)) OrderBackup::Reset(tile_cur, false);
2378  DeleteAnimatedTile(tile_cur);
2379  DoClearSquare(tile_cur);
2380  DeleteNewGRFInspectWindow(GSF_AIRPORTTILES, tile_cur);
2381  }
2382  }
2383 
2384  if (flags & DC_EXEC) {
2385  /* Clear the persistent storage. */
2386  delete st->airport.psa;
2387 
2388  for (uint i = 0; i < st->airport.GetNumHangars(); ++i) {
2391  );
2392  }
2393 
2394  st->rect.AfterRemoveRect(st, st->airport);
2395 
2396  st->airport.Clear();
2397  st->facilities &= ~FACIL_AIRPORT;
2398 
2400 
2403  }
2404 
2405  Company::Get(st->owner)->infrastructure.airport--;
2407 
2408  st->UpdateVirtCoord();
2411  DeleteNewGRFInspectWindow(GSF_AIRPORTS, st->index);
2412  }
2413 
2414  return cost;
2415 }
2416 
2426 CommandCost CmdOpenCloseAirport(TileIndex tile, DoCommandFlag flags, uint32 p1, uint32 p2, const char *text)
2427 {
2428  if (!Station::IsValidID(p1)) return CMD_ERROR;
2429  Station *st = Station::Get(p1);
2430 
2431  if (!(st->facilities & FACIL_AIRPORT) || st->owner == OWNER_NONE) return CMD_ERROR;
2432 
2433  CommandCost ret = CheckOwnership(st->owner);
2434  if (ret.Failed()) return ret;
2435 
2436  if (flags & DC_EXEC) {
2439  }
2440  return CommandCost();
2441 }
2442 
2449 bool HasStationInUse(StationID station, bool include_company, CompanyID company)
2450 {
2451  const Vehicle *v;
2452  FOR_ALL_VEHICLES(v) {
2453  if ((v->owner == company) == include_company) {
2454  const Order *order;
2455  FOR_VEHICLE_ORDERS(v, order) {
2456  if ((order->IsType(OT_GOTO_STATION) || order->IsType(OT_GOTO_WAYPOINT)) && order->GetDestination() == station) {
2457  return true;
2458  }
2459  }
2460  }
2461  }
2462  return false;
2463 }
2464 
2465 static const TileIndexDiffC _dock_tileoffs_chkaround[] = {
2466  {-1, 0},
2467  { 0, 0},
2468  { 0, 0},
2469  { 0, -1}
2470 };
2471 static const byte _dock_w_chk[4] = { 2, 1, 2, 1 };
2472 static const byte _dock_h_chk[4] = { 1, 2, 1, 2 };
2473 
2483 CommandCost CmdBuildDock(TileIndex tile, DoCommandFlag flags, uint32 p1, uint32 p2, const char *text)
2484 {
2485  StationID station_to_join = GB(p2, 16, 16);
2486  bool reuse = (station_to_join != NEW_STATION);
2487  if (!reuse) station_to_join = INVALID_STATION;
2488  bool distant_join = (station_to_join != INVALID_STATION);
2489 
2490  if (distant_join && (!_settings_game.station.distant_join_stations || !Station::IsValidID(station_to_join))) return CMD_ERROR;
2491 
2493  if (direction == INVALID_DIAGDIR) return_cmd_error(STR_ERROR_SITE_UNSUITABLE);
2494  direction = ReverseDiagDir(direction);
2495 
2496  /* Docks cannot be placed on rapids */
2497  if (HasTileWaterGround(tile)) return_cmd_error(STR_ERROR_SITE_UNSUITABLE);
2498 
2499  CommandCost ret = CheckIfAuthorityAllowsNewStation(tile, flags);
2500  if (ret.Failed()) return ret;
2501 
2502  if (IsBridgeAbove(tile)) return_cmd_error(STR_ERROR_MUST_DEMOLISH_BRIDGE_FIRST);
2503 
2504  ret = DoCommand(tile, 0, 0, flags, CMD_LANDSCAPE_CLEAR);
2505  if (ret.Failed()) return ret;
2506 
2507  TileIndex tile_cur = tile + TileOffsByDiagDir(direction);
2508 
2509  if (!IsTileType(tile_cur, MP_WATER) || !IsTileFlat(tile_cur)) {
2510  return_cmd_error(STR_ERROR_SITE_UNSUITABLE);
2511  }
2512 
2513  if (IsBridgeAbove(tile_cur)) return_cmd_error(STR_ERROR_MUST_DEMOLISH_BRIDGE_FIRST);
2514 
2515  /* Get the water class of the water tile before it is cleared.*/
2516  WaterClass wc = GetWaterClass(tile_cur);
2517 
2518  ret = DoCommand(tile_cur, 0, 0, flags, CMD_LANDSCAPE_CLEAR);
2519  if (ret.Failed()) return ret;
2520 
2521  tile_cur += TileOffsByDiagDir(direction);
2522  if (!IsTileType(tile_cur, MP_WATER) || !IsTileFlat(tile_cur)) {
2523  return_cmd_error(STR_ERROR_SITE_UNSUITABLE);
2524  }
2525 
2526  TileArea dock_area = TileArea(tile + ToTileIndexDiff(_dock_tileoffs_chkaround[direction]),
2527  _dock_w_chk[direction], _dock_h_chk[direction]);
2528 
2529  /* middle */
2530  Station *st = NULL;
2531  ret = FindJoiningStation(INVALID_STATION, station_to_join, HasBit(p1, 0), dock_area, &st);
2532  if (ret.Failed()) return ret;
2533 
2534  /* Distant join */
2535  if (st == NULL && distant_join) st = Station::GetIfValid(station_to_join);
2536 
2537  ret = BuildStationPart(&st, flags, reuse, dock_area, STATIONNAMING_DOCK);
2538  if (ret.Failed()) return ret;
2539 
2540  if (st != NULL && st->dock_tile != INVALID_TILE) return_cmd_error(STR_ERROR_TOO_CLOSE_TO_ANOTHER_DOCK);
2541 
2542  if (flags & DC_EXEC) {
2543  st->dock_tile = tile;
2544  st->AddFacility(FACIL_DOCK, tile);
2545 
2546  st->rect.BeforeAddRect(dock_area.tile, dock_area.w, dock_area.h, StationRect::ADD_TRY);
2547 
2548  /* If the water part of the dock is on a canal, update infrastructure counts.
2549  * This is needed as we've unconditionally cleared that tile before. */
2550  if (wc == WATER_CLASS_CANAL) {
2551  Company::Get(st->owner)->infrastructure.water++;
2552  }
2553  Company::Get(st->owner)->infrastructure.station += 2;
2555 
2556  MakeDock(tile, st->owner, st->index, direction, wc);
2557 
2558  st->UpdateVirtCoord();
2559  UpdateStationAcceptance(st, false);
2564  }
2565 
2566  return CommandCost(EXPENSES_CONSTRUCTION, _price[PR_BUILD_STATION_DOCK]);
2567 }
2568 
2576 {
2577  Station *st = Station::GetByTile(tile);
2578  CommandCost ret = CheckOwnership(st->owner);
2579  if (ret.Failed()) return ret;
2580 
2581  TileIndex docking_location = TILE_ADD(st->dock_tile, ToTileIndexDiff(GetDockOffset(st->dock_tile)));
2582 
2583  TileIndex tile1 = st->dock_tile;
2584  TileIndex tile2 = tile1 + TileOffsByDiagDir(GetDockDirection(tile1));
2585 
2586  ret = EnsureNoVehicleOnGround(tile1);
2587  if (ret.Succeeded()) ret = EnsureNoVehicleOnGround(tile2);
2588  if (ret.Failed()) return ret;
2589 
2590  if (flags & DC_EXEC) {
2591  DoClearSquare(tile1);
2592  MarkTileDirtyByTile(tile1);
2593  MakeWaterKeepingClass(tile2, st->owner);
2594 
2595  st->rect.AfterRemoveTile(st, tile1);
2596  st->rect.AfterRemoveTile(st, tile2);
2597 
2598  st->dock_tile = INVALID_TILE;
2599  st->facilities &= ~FACIL_DOCK;
2600 
2601  Company::Get(st->owner)->infrastructure.station -= 2;
2603 
2605  st->UpdateVirtCoord();
2608 
2609  /* All ships that were going to our station, can't go to it anymore.
2610  * Just clear the order, then automatically the next appropriate order
2611  * will be selected and in case of no appropriate order it will just
2612  * wander around the world. */
2613  Ship *s;
2614  FOR_ALL_SHIPS(s) {
2615  if (s->current_order.IsType(OT_LOADING) && s->tile == docking_location) {
2616  s->LeaveStation();
2617  }
2618 
2619  if (s->dest_tile == docking_location) {
2620  s->dest_tile = 0;
2621  s->current_order.Free();
2622  }
2623  }
2624  }
2625 
2626  return CommandCost(EXPENSES_CONSTRUCTION, _price[PR_CLEAR_STATION_DOCK]);
2627 }
2628 
2629 #include "table/station_land.h"
2630 
2631 const DrawTileSprites *GetStationTileLayout(StationType st, byte gfx)
2632 {
2633  return &_station_display_datas[st][gfx];
2634 }
2635 
2645 bool SplitGroundSpriteForOverlay(const TileInfo *ti, SpriteID *ground, RailTrackOffset *overlay_offset)
2646 {
2647  bool snow_desert;
2648  switch (*ground) {
2649  case SPR_RAIL_TRACK_X:
2650  snow_desert = false;
2651  *overlay_offset = RTO_X;
2652  break;
2653 
2654  case SPR_RAIL_TRACK_Y:
2655  snow_desert = false;
2656  *overlay_offset = RTO_Y;
2657  break;
2658 
2659  case SPR_RAIL_TRACK_X_SNOW:
2660  snow_desert = true;
2661  *overlay_offset = RTO_X;
2662  break;
2663 
2664  case SPR_RAIL_TRACK_Y_SNOW:
2665  snow_desert = true;
2666  *overlay_offset = RTO_Y;
2667  break;
2668 
2669  default:
2670  return false;
2671  }
2672 
2673  if (ti != NULL) {
2674  /* Decide snow/desert from tile */
2676  case LT_ARCTIC:
2677  snow_desert = (uint)ti->z > GetSnowLine() * TILE_HEIGHT;
2678  break;
2679 
2680  case LT_TROPIC:
2681  snow_desert = GetTropicZone(ti->tile) == TROPICZONE_DESERT;
2682  break;
2683 
2684  default:
2685  break;
2686  }
2687  }
2688 
2689  *ground = snow_desert ? SPR_FLAT_SNOW_DESERT_TILE : SPR_FLAT_GRASS_TILE;
2690  return true;
2691 }
2692 
2693 static void DrawTile_Station(TileInfo *ti)
2694 {
2695  const NewGRFSpriteLayout *layout = NULL;
2696  DrawTileSprites tmp_rail_layout;
2697  const DrawTileSprites *t = NULL;
2698  RoadTypes roadtypes;
2699  int32 total_offset;
2700  const RailtypeInfo *rti = NULL;
2701  uint32 relocation = 0;
2702  uint32 ground_relocation = 0;
2703  BaseStation *st = NULL;
2704  const StationSpec *statspec = NULL;
2705  uint tile_layout = 0;
2706 
2707  if (HasStationRail(ti->tile)) {
2708  rti = GetRailTypeInfo(GetRailType(ti->tile));
2709  roadtypes = ROADTYPES_NONE;
2710  total_offset = rti->GetRailtypeSpriteOffset();
2711 
2712  if (IsCustomStationSpecIndex(ti->tile)) {
2713  /* look for customization */
2714  st = BaseStation::GetByTile(ti->tile);
2715  statspec = st->speclist[GetCustomStationSpecIndex(ti->tile)].spec;
2716 
2717  if (statspec != NULL) {
2718  tile_layout = GetStationGfx(ti->tile);
2719 
2721  uint16 callback = GetStationCallback(CBID_STATION_SPRITE_LAYOUT, 0, 0, statspec, st, ti->tile);
2722  if (callback != CALLBACK_FAILED) tile_layout = (callback & ~1) + GetRailStationAxis(ti->tile);
2723  }
2724 
2725  /* Ensure the chosen tile layout is valid for this custom station */
2726  if (statspec->renderdata != NULL) {
2727  layout = &statspec->renderdata[tile_layout < statspec->tiles ? tile_layout : (uint)GetRailStationAxis(ti->tile)];
2728  if (!layout->NeedsPreprocessing()) {
2729  t = layout;
2730  layout = NULL;
2731  }
2732  }
2733  }
2734  }
2735  } else {
2736  roadtypes = IsRoadStop(ti->tile) ? GetRoadTypes(ti->tile) : ROADTYPES_NONE;
2737  total_offset = 0;
2738  }
2739 
2740  StationGfx gfx = GetStationGfx(ti->tile);
2741  if (IsAirport(ti->tile)) {
2742  gfx = GetAirportGfx(ti->tile);
2743  if (gfx >= NEW_AIRPORTTILE_OFFSET) {
2744  const AirportTileSpec *ats = AirportTileSpec::Get(gfx);
2745  if (ats->grf_prop.spritegroup[0] != NULL && DrawNewAirportTile(ti, Station::GetByTile(ti->tile), gfx, ats)) {
2746  return;
2747  }
2748  /* No sprite group (or no valid one) found, meaning no graphics associated.
2749  * Use the substitute one instead */
2750  assert(ats->grf_prop.subst_id != INVALID_AIRPORTTILE);
2751  gfx = ats->grf_prop.subst_id;
2752  }
2753  switch (gfx) {
2754  case APT_RADAR_GRASS_FENCE_SW:
2755  t = &_station_display_datas_airport_radar_grass_fence_sw[GetAnimationFrame(ti->tile)];
2756  break;
2757  case APT_GRASS_FENCE_NE_FLAG:
2758  t = &_station_display_datas_airport_flag_grass_fence_ne[GetAnimationFrame(ti->tile)];
2759  break;
2760  case APT_RADAR_FENCE_SW:
2761  t = &_station_display_datas_airport_radar_fence_sw[GetAnimationFrame(ti->tile)];
2762  break;
2763  case APT_RADAR_FENCE_NE:
2764  t = &_station_display_datas_airport_radar_fence_ne[GetAnimationFrame(ti->tile)];
2765  break;
2766  case APT_GRASS_FENCE_NE_FLAG_2:
2767  t = &_station_display_datas_airport_flag_grass_fence_ne_2[GetAnimationFrame(ti->tile)];
2768  break;
2769  }
2770  }
2771 
2772  Owner owner = GetTileOwner(ti->tile);
2773 
2774  PaletteID palette;
2775  if (Company::IsValidID(owner)) {
2776  palette = COMPANY_SPRITE_COLOUR(owner);
2777  } else {
2778  /* Some stations are not owner by a company, namely oil rigs */
2779  palette = PALETTE_TO_GREY;
2780  }
2781 
2782  if (layout == NULL && (t == NULL || t->seq == NULL)) t = GetStationTileLayout(GetStationType(ti->tile), gfx);
2783 
2784  /* don't show foundation for docks */
2785  if (ti->tileh != SLOPE_FLAT && !IsDock(ti->tile)) {
2786  if (statspec != NULL && HasBit(statspec->flags, SSF_CUSTOM_FOUNDATIONS)) {
2787  /* Station has custom foundations.
2788  * Check whether the foundation continues beyond the tile's upper sides. */
2789  uint edge_info = 0;
2790  int z;
2791  Slope slope = GetFoundationPixelSlope(ti->tile, &z);
2792  if (!HasFoundationNW(ti->tile, slope, z)) SetBit(edge_info, 0);
2793  if (!HasFoundationNE(ti->tile, slope, z)) SetBit(edge_info, 1);
2794  SpriteID image = GetCustomStationFoundationRelocation(statspec, st, ti->tile, tile_layout, edge_info);
2795  if (image == 0) goto draw_default_foundation;
2796 
2797  if (HasBit(statspec->flags, SSF_EXTENDED_FOUNDATIONS)) {
2798  /* Station provides extended foundations. */
2799 
2800  static const uint8 foundation_parts[] = {
2801  0, 0, 0, 0, // Invalid, Invalid, Invalid, SLOPE_SW
2802  0, 1, 2, 3, // Invalid, SLOPE_EW, SLOPE_SE, SLOPE_WSE
2803  0, 4, 5, 6, // Invalid, SLOPE_NW, SLOPE_NS, SLOPE_NWS
2804  7, 8, 9 // SLOPE_NE, SLOPE_ENW, SLOPE_SEN
2805  };
2806 
2807  AddSortableSpriteToDraw(image + foundation_parts[ti->tileh], PAL_NONE, ti->x, ti->y, 16, 16, 7, ti->z);
2808  } else {
2809  /* Draw simple foundations, built up from 8 possible foundation sprites. */
2810 
2811  /* Each set bit represents one of the eight composite sprites to be drawn.
2812  * 'Invalid' entries will not drawn but are included for completeness. */
2813  static const uint8 composite_foundation_parts[] = {
2814  /* Invalid (00000000), Invalid (11010001), Invalid (11100100), SLOPE_SW (11100000) */
2815  0x00, 0xD1, 0xE4, 0xE0,
2816  /* Invalid (11001010), SLOPE_EW (11001001), SLOPE_SE (11000100), SLOPE_WSE (11000000) */
2817  0xCA, 0xC9, 0xC4, 0xC0,
2818  /* Invalid (11010010), SLOPE_NW (10010001), SLOPE_NS (11100100), SLOPE_NWS (10100000) */
2819  0xD2, 0x91, 0xE4, 0xA0,
2820  /* SLOPE_NE (01001010), SLOPE_ENW (00001001), SLOPE_SEN (01000100) */
2821  0x4A, 0x09, 0x44
2822  };
2823 
2824  uint8 parts = composite_foundation_parts[ti->tileh];
2825 
2826  /* If foundations continue beyond the tile's upper sides then
2827  * mask out the last two pieces. */
2828  if (HasBit(edge_info, 0)) ClrBit(parts, 6);
2829  if (HasBit(edge_info, 1)) ClrBit(parts, 7);
2830 
2831  if (parts == 0) {
2832  /* We always have to draw at least one sprite to make sure there is a boundingbox and a sprite with the
2833  * correct offset for the childsprites.
2834  * So, draw the (completely empty) sprite of the default foundations. */
2835  goto draw_default_foundation;
2836  }
2837 
2839  for (int i = 0; i < 8; i++) {
2840  if (HasBit(parts, i)) {
2841  AddSortableSpriteToDraw(image + i, PAL_NONE, ti->x, ti->y, 16, 16, 7, ti->z);
2842  }
2843  }
2844  EndSpriteCombine();
2845  }
2846 
2847  OffsetGroundSprite(31, 1);
2849  } else {
2850 draw_default_foundation:
2852  }
2853  }
2854 
2855  if (IsBuoy(ti->tile)) {
2856  DrawWaterClassGround(ti);
2857  SpriteID sprite = GetCanalSprite(CF_BUOY, ti->tile);
2858  if (sprite != 0) total_offset = sprite - SPR_IMG_BUOY;
2859  } else if (IsDock(ti->tile) || (IsOilRig(ti->tile) && IsTileOnWater(ti->tile))) {
2860  if (ti->tileh == SLOPE_FLAT) {
2861  DrawWaterClassGround(ti);
2862  } else {
2863  assert(IsDock(ti->tile));
2864  TileIndex water_tile = ti->tile + TileOffsByDiagDir(GetDockDirection(ti->tile));
2865  WaterClass wc = GetWaterClass(water_tile);
2866  if (wc == WATER_CLASS_SEA) {
2867  DrawShoreTile(ti->tileh);
2868  } else {
2869  DrawClearLandTile(ti, 3);
2870  }
2871  }
2872  } else {
2873  if (layout != NULL) {
2874  /* Sprite layout which needs preprocessing */
2875  bool separate_ground = HasBit(statspec->flags, SSF_SEPARATE_GROUND);
2876  uint32 var10_values = layout->PrepareLayout(total_offset, rti->fallback_railtype, 0, 0, separate_ground);
2877  uint8 var10;
2878  FOR_EACH_SET_BIT(var10, var10_values) {
2879  uint32 var10_relocation = GetCustomStationRelocation(statspec, st, ti->tile, var10);
2880  layout->ProcessRegisters(var10, var10_relocation, separate_ground);
2881  }
2882  tmp_rail_layout.seq = layout->GetLayout(&tmp_rail_layout.ground);
2883  t = &tmp_rail_layout;
2884  total_offset = 0;
2885  } else if (statspec != NULL) {
2886  /* Simple sprite layout */
2887  ground_relocation = relocation = GetCustomStationRelocation(statspec, st, ti->tile, 0);
2888  if (HasBit(statspec->flags, SSF_SEPARATE_GROUND)) {
2889  ground_relocation = GetCustomStationRelocation(statspec, st, ti->tile, 1);
2890  }
2891  ground_relocation += rti->fallback_railtype;
2892  }
2893 
2894  SpriteID image = t->ground.sprite;
2895  PaletteID pal = t->ground.pal;
2896  RailTrackOffset overlay_offset;
2897  if (rti != NULL && rti->UsesOverlay() && SplitGroundSpriteForOverlay(ti, &image, &overlay_offset)) {
2898  SpriteID ground = GetCustomRailSprite(rti, ti->tile, RTSG_GROUND);
2899  DrawGroundSprite(image, PAL_NONE);
2900  DrawGroundSprite(ground + overlay_offset, PAL_NONE);
2901 
2902  if (_game_mode != GM_MENU && _settings_client.gui.show_track_reservation && HasStationReservation(ti->tile)) {
2903  SpriteID overlay = GetCustomRailSprite(rti, ti->tile, RTSG_OVERLAY);
2904  DrawGroundSprite(overlay + overlay_offset, PALETTE_CRASH);
2905  }
2906  } else {
2907  image += HasBit(image, SPRITE_MODIFIER_CUSTOM_SPRITE) ? ground_relocation : total_offset;
2908  if (HasBit(pal, SPRITE_MODIFIER_CUSTOM_SPRITE)) pal += ground_relocation;
2909  DrawGroundSprite(image, GroundSpritePaletteTransform(image, pal, palette));
2910 
2911  /* PBS debugging, draw reserved tracks darker */
2912  if (_game_mode != GM_MENU && _settings_client.gui.show_track_reservation && HasStationRail(ti->tile) && HasStationReservation(ti->tile)) {
2913  const RailtypeInfo *rti = GetRailTypeInfo(GetRailType(ti->tile));
2915  }
2916  }
2917  }
2918 
2920 
2921  if (HasBit(roadtypes, ROADTYPE_TRAM)) {
2922  Axis axis = GetRoadStopDir(ti->tile) == DIAGDIR_NE ? AXIS_X : AXIS_Y;
2923  DrawGroundSprite((HasBit(roadtypes, ROADTYPE_ROAD) ? SPR_TRAMWAY_OVERLAY : SPR_TRAMWAY_TRAM) + (axis ^ 1), PAL_NONE);
2924  DrawTramCatenary(ti, axis == AXIS_X ? ROAD_X : ROAD_Y);
2925  }
2926 
2927  if (IsRailWaypoint(ti->tile)) {
2928  /* Don't offset the waypoint graphics; they're always the same. */
2929  total_offset = 0;
2930  }
2931 
2932  DrawRailTileSeq(ti, t, TO_BUILDINGS, total_offset, relocation, palette);
2933 }
2934 
2935 void StationPickerDrawSprite(int x, int y, StationType st, RailType railtype, RoadType roadtype, int image)
2936 {
2937  int32 total_offset = 0;
2938  PaletteID pal = COMPANY_SPRITE_COLOUR(_local_company);
2939  const DrawTileSprites *t = GetStationTileLayout(st, image);
2940  const RailtypeInfo *rti = NULL;
2941 
2942  if (railtype != INVALID_RAILTYPE) {
2943  rti = GetRailTypeInfo(railtype);
2944  total_offset = rti->GetRailtypeSpriteOffset();
2945  }
2946 
2947  SpriteID img = t->ground.sprite;
2948  RailTrackOffset overlay_offset;
2949  if (rti != NULL && rti->UsesOverlay() && SplitGroundSpriteForOverlay(NULL, &img, &overlay_offset)) {
2951  DrawSprite(img, PAL_NONE, x, y);
2952  DrawSprite(ground + overlay_offset, PAL_NONE, x, y);
2953  } else {
2954  DrawSprite(img + total_offset, HasBit(img, PALETTE_MODIFIER_COLOUR) ? pal : PAL_NONE, x, y);
2955  }
2956 
2957  if (roadtype == ROADTYPE_TRAM) {
2958  DrawSprite(SPR_TRAMWAY_TRAM + (t->ground.sprite == SPR_ROAD_PAVED_STRAIGHT_X ? 1 : 0), PAL_NONE, x, y);
2959  }
2960 
2961  /* Default waypoint has no railtype specific sprites */
2962  DrawRailTileSeqInGUI(x, y, t, st == STATION_WAYPOINT ? 0 : total_offset, 0, pal);
2963 }
2964 
2965 static int GetSlopePixelZ_Station(TileIndex tile, uint x, uint y)
2966 {
2967  return GetTileMaxPixelZ(tile);
2968 }
2969 
2970 static Foundation GetFoundation_Station(TileIndex tile, Slope tileh)
2971 {
2972  return FlatteningFoundation(tileh);
2973 }
2974 
2975 static void GetTileDesc_Station(TileIndex tile, TileDesc *td)
2976 {
2977  td->owner[0] = GetTileOwner(tile);
2978  if (IsDriveThroughStopTile(tile)) {
2979  Owner road_owner = INVALID_OWNER;
2980  Owner tram_owner = INVALID_OWNER;
2981  RoadTypes rts = GetRoadTypes(tile);
2982  if (HasBit(rts, ROADTYPE_ROAD)) road_owner = GetRoadOwner(tile, ROADTYPE_ROAD);
2983  if (HasBit(rts, ROADTYPE_TRAM)) tram_owner = GetRoadOwner(tile, ROADTYPE_TRAM);
2984 
2985  /* Is there a mix of owners? */
2986  if ((tram_owner != INVALID_OWNER && tram_owner != td->owner[0]) ||
2987  (road_owner != INVALID_OWNER && road_owner != td->owner[0])) {
2988  uint i = 1;
2989  if (road_owner != INVALID_OWNER) {
2990  td->owner_type[i] = STR_LAND_AREA_INFORMATION_ROAD_OWNER;
2991  td->owner[i] = road_owner;
2992  i++;
2993  }
2994  if (tram_owner != INVALID_OWNER) {
2995  td->owner_type[i] = STR_LAND_AREA_INFORMATION_TRAM_OWNER;
2996  td->owner[i] = tram_owner;
2997  }
2998  }
2999  }
3001 
3002  if (HasStationTileRail(tile)) {
3003  const StationSpec *spec = GetStationSpec(tile);
3004 
3005  if (spec != NULL) {
3007  td->station_name = spec->name;
3008 
3009  if (spec->grf_prop.grffile != NULL) {
3010  const GRFConfig *gc = GetGRFConfig(spec->grf_prop.grffile->grfid);
3011  td->grf = gc->GetName();
3012  }
3013  }
3014 
3015  const RailtypeInfo *rti = GetRailTypeInfo(GetRailType(tile));
3016  td->rail_speed = rti->max_speed;
3017  }
3018 
3019  if (IsAirport(tile)) {
3020  const AirportSpec *as = Station::GetByTile(tile)->airport.GetSpec();
3022  td->airport_name = as->name;
3023 
3024  const AirportTileSpec *ats = AirportTileSpec::GetByTile(tile);
3025  td->airport_tile_name = ats->name;
3026 
3027  if (as->grf_prop.grffile != NULL) {
3028  const GRFConfig *gc = GetGRFConfig(as->grf_prop.grffile->grfid);
3029  td->grf = gc->GetName();
3030  } else if (ats->grf_prop.grffile != NULL) {
3031  const GRFConfig *gc = GetGRFConfig(ats->grf_prop.grffile->grfid);
3032  td->grf = gc->GetName();
3033  }
3034  }
3035 
3036  StringID str;
3037  switch (GetStationType(tile)) {
3038  default: NOT_REACHED();
3039  case STATION_RAIL: str = STR_LAI_STATION_DESCRIPTION_RAILROAD_STATION; break;
3040  case STATION_AIRPORT:
3041  str = (IsHangar(tile) ? STR_LAI_STATION_DESCRIPTION_AIRCRAFT_HANGAR : STR_LAI_STATION_DESCRIPTION_AIRPORT);
3042  break;
3043  case STATION_TRUCK: str = STR_LAI_STATION_DESCRIPTION_TRUCK_LOADING_AREA; break;
3044  case STATION_BUS: str = STR_LAI_STATION_DESCRIPTION_BUS_STATION; break;
3045  case STATION_OILRIG: str = STR_INDUSTRY_NAME_OIL_RIG; break;
3046  case STATION_DOCK: str = STR_LAI_STATION_DESCRIPTION_SHIP_DOCK; break;
3047  case STATION_BUOY: str = STR_LAI_STATION_DESCRIPTION_BUOY; break;
3048  case STATION_WAYPOINT: str = STR_LAI_STATION_DESCRIPTION_WAYPOINT; break;
3049  }
3050  td->str = str;
3051 }
3052 
3053 
3054 static TrackStatus GetTileTrackStatus_Station(TileIndex tile, TransportType mode, uint sub_mode, DiagDirection side)
3055 {
3056  TrackBits trackbits = TRACK_BIT_NONE;
3057 
3058  switch (mode) {
3059  case TRANSPORT_RAIL:
3060  if (HasStationRail(tile) && !IsStationTileBlocked(tile)) {
3061  trackbits = TrackToTrackBits(GetRailStationTrack(tile));
3062  }
3063  break;
3064 
3065  case TRANSPORT_WATER:
3066  /* buoy is coded as a station, it is always on open water */
3067  if (IsBuoy(tile)) {
3068  trackbits = TRACK_BIT_ALL;
3069  /* remove tracks that connect NE map edge */
3070  if (TileX(tile) == 0) trackbits &= ~(TRACK_BIT_X | TRACK_BIT_UPPER | TRACK_BIT_RIGHT);
3071  /* remove tracks that connect NW map edge */
3072  if (TileY(tile) == 0) trackbits &= ~(TRACK_BIT_Y | TRACK_BIT_LEFT | TRACK_BIT_UPPER);
3073  }
3074  break;
3075 
3076  case TRANSPORT_ROAD:
3077  if ((GetRoadTypes(tile) & sub_mode) != 0 && IsRoadStop(tile)) {
3078  DiagDirection dir = GetRoadStopDir(tile);
3079  Axis axis = DiagDirToAxis(dir);
3080 
3081  if (side != INVALID_DIAGDIR) {
3082  if (axis != DiagDirToAxis(side) || (IsStandardRoadStopTile(tile) && dir != side)) break;
3083  }
3084 
3085  trackbits = AxisToTrackBits(axis);
3086  }
3087  break;
3088 
3089  default:
3090  break;
3091  }
3092 
3094 }
3095 
3096 
3097 static void TileLoop_Station(TileIndex tile)
3098 {
3099  /* FIXME -- GetTileTrackStatus_Station -> animated stationtiles
3100  * hardcoded.....not good */
3101  switch (GetStationType(tile)) {
3102  case STATION_AIRPORT:
3103  AirportTileAnimationTrigger(Station::GetByTile(tile), tile, AAT_TILELOOP);
3104  break;
3105 
3106  case STATION_DOCK:
3107  if (!IsTileFlat(tile)) break; // only handle water part
3108  /* FALL THROUGH */
3109  case STATION_OILRIG: //(station part)
3110  case STATION_BUOY:
3111  TileLoop_Water(tile);
3112  break;
3113 
3114  default: break;
3115  }
3116 }
3117 
3118 
3119 static void AnimateTile_Station(TileIndex tile)
3120 {
3121  if (HasStationRail(tile)) {
3122  AnimateStationTile(tile);
3123  return;
3124  }
3125 
3126  if (IsAirport(tile)) {
3127  AnimateAirportTile(tile);
3128  }
3129 }
3130 
3131 
3132 static bool ClickTile_Station(TileIndex tile)
3133 {
3134  const BaseStation *bst = BaseStation::GetByTile(tile);
3135 
3136  if (bst->facilities & FACIL_WAYPOINT) {
3138  } else if (IsHangar(tile)) {
3139  const Station *st = Station::From(bst);
3141  } else {
3143  }
3144  return true;
3145 }
3146 
3147 static VehicleEnterTileStatus VehicleEnter_Station(Vehicle *v, TileIndex tile, int x, int y)
3148 {
3149  if (v->type == VEH_TRAIN) {
3150  StationID station_id = GetStationIndex(tile);
3151  if (!v->current_order.ShouldStopAtStation(v, station_id)) return VETSB_CONTINUE;
3152  if (!IsRailStation(tile) || !v->IsFrontEngine()) return VETSB_CONTINUE;
3153 
3154  int station_ahead;
3155  int station_length;
3156  int stop = GetTrainStopLocation(station_id, tile, Train::From(v), &station_ahead, &station_length);
3157 
3158  /* Stop whenever that amount of station ahead + the distance from the
3159  * begin of the platform to the stop location is longer than the length
3160  * of the platform. Station ahead 'includes' the current tile where the
3161  * vehicle is on, so we need to subtract that. */
3162  if (stop + station_ahead - (int)TILE_SIZE >= station_length) return VETSB_CONTINUE;
3163 
3165 
3166  x &= 0xF;
3167  y &= 0xF;
3168 
3169  if (DiagDirToAxis(dir) != AXIS_X) Swap(x, y);
3170  if (y == TILE_SIZE / 2) {
3171  if (dir != DIAGDIR_SE && dir != DIAGDIR_SW) x = TILE_SIZE - 1 - x;
3172  stop &= TILE_SIZE - 1;
3173 
3174  if (x == stop) {
3175  return VETSB_ENTERED_STATION | (VehicleEnterTileStatus)(station_id << VETS_STATION_ID_OFFSET); // enter station
3176  } else if (x < stop) {
3178  uint16 spd = max(0, (stop - x) * 20 - 15);
3179  if (spd < v->cur_speed) v->cur_speed = spd;
3180  }
3181  }
3182  } else if (v->type == VEH_ROAD) {
3183  RoadVehicle *rv = RoadVehicle::From(v);
3184  if (rv->state < RVSB_IN_ROAD_STOP && !IsReversingRoadTrackdir((Trackdir)rv->state) && rv->frame == 0) {
3185  if (IsRoadStop(tile) && rv->IsFrontEngine()) {
3186  /* Attempt to allocate a parking bay in a road stop */
3188  }
3189  }
3190  }
3191 
3192  return VETSB_CONTINUE;
3193 }
3194 
3200 {
3201  /* Collect cargoes accepted since the last big tick. */
3202  uint cargoes = 0;
3203  for (CargoID cid = 0; cid < NUM_CARGO; cid++) {
3204  if (HasBit(st->goods[cid].status, GoodsEntry::GES_ACCEPTED_BIGTICK)) SetBit(cargoes, cid);
3205  }
3206 
3207  /* Anything to do? */
3208  if (cargoes == 0) return;
3209 
3210  /* Loop over all houses in the catchment. */
3211  Rect r = st->GetCatchmentRect();
3212  TileArea ta(TileXY(r.left, r.top), TileXY(r.right, r.bottom));
3213  TILE_AREA_LOOP(tile, ta) {
3214  if (IsTileType(tile, MP_HOUSE)) {
3215  WatchedCargoCallback(tile, cargoes);
3216  }
3217  }
3218 }
3219 
3227 {
3228  if (!st->IsInUse()) {
3229  if (++st->delete_ctr >= 8) delete st;
3230  return false;
3231  }
3232 
3233  if (Station::IsExpected(st)) {
3235 
3236  for (CargoID i = 0; i < NUM_CARGO; i++) {
3237  ClrBit(Station::From(st)->goods[i].status, GoodsEntry::GES_ACCEPTED_BIGTICK);
3238  }
3239  }
3240 
3241 
3242  if ((st->facilities & FACIL_WAYPOINT) == 0) UpdateStationAcceptance(Station::From(st), true);
3243 
3244  return true;
3245 }
3246 
3247 static inline void byte_inc_sat(byte *p)
3248 {
3249  byte b = *p + 1;
3250  if (b != 0) *p = b;
3251 }
3252 
3259 static void TruncateCargo(const CargoSpec *cs, GoodsEntry *ge, uint amount = UINT_MAX)
3260 {
3261  /* If truncating also punish the source stations' ratings to
3262  * decrease the flow of incoming cargo. */
3263 
3264  StationCargoAmountMap waiting_per_source;
3265  ge->cargo.Truncate(amount, &waiting_per_source);
3266  for (StationCargoAmountMap::iterator i(waiting_per_source.begin()); i != waiting_per_source.end(); ++i) {
3267  Station *source_station = Station::GetIfValid(i->first);
3268  if (source_station == NULL) continue;
3269 
3270  GoodsEntry &source_ge = source_station->goods[cs->Index()];
3271  source_ge.max_waiting_cargo = max(source_ge.max_waiting_cargo, i->second);
3272  }
3273 }
3274 
3275 static void UpdateStationRating(Station *st)
3276 {
3277  bool waiting_changed = false;
3278 
3279  byte_inc_sat(&st->time_since_load);
3280  byte_inc_sat(&st->time_since_unload);
3281 
3282  const CargoSpec *cs;
3283  FOR_ALL_CARGOSPECS(cs) {
3284  GoodsEntry *ge = &st->goods[cs->Index()];
3285  /* Slowly increase the rating back to his original level in the case we
3286  * didn't deliver cargo yet to this station. This happens when a bribe
3287  * failed while you didn't moved that cargo yet to a station. */
3288  if (!ge->HasRating() && ge->rating < INITIAL_STATION_RATING) {
3289  ge->rating++;
3290  }
3291 
3292  /* Only change the rating if we are moving this cargo */
3293  if (ge->HasRating()) {
3294  byte_inc_sat(&ge->time_since_pickup);
3295  if (ge->time_since_pickup == 255 && _settings_game.order.selectgoods) {
3297  ge->last_speed = 0;
3298  TruncateCargo(cs, ge);
3299  waiting_changed = true;
3300  continue;
3301  }
3302 
3303  bool skip = false;
3304  int rating = 0;
3305  uint waiting = ge->cargo.TotalCount();
3306 
3307  /* num_dests is at least 1 if there is any cargo as
3308  * INVALID_STATION is also a destination.
3309  */
3310  uint num_dests = (uint)ge->cargo.Packets()->MapSize();
3311 
3312  /* Average amount of cargo per next hop, but prefer solitary stations
3313  * with only one or two next hops. They are allowed to have more
3314  * cargo waiting per next hop.
3315  * With manual cargo distribution waiting_avg = waiting / 2 as then
3316  * INVALID_STATION is the only destination.
3317  */
3318  uint waiting_avg = waiting / (num_dests + 1);
3319 
3321  /* Perform custom station rating. If it succeeds the speed, days in transit and
3322  * waiting cargo ratings must not be executed. */
3323 
3324  /* NewGRFs expect last speed to be 0xFF when no vehicle has arrived yet. */
3325  uint last_speed = ge->HasVehicleEverTriedLoading() ? ge->last_speed : 0xFF;
3326 
3327  uint32 var18 = min(ge->time_since_pickup, 0xFF) | (min(ge->max_waiting_cargo, 0xFFFF) << 8) | (min(last_speed, 0xFF) << 24);
3328  /* Convert to the 'old' vehicle types */
3329  uint32 var10 = (st->last_vehicle_type == VEH_INVALID) ? 0x0 : (st->last_vehicle_type + 0x10);
3330  uint16 callback = GetCargoCallback(CBID_CARGO_STATION_RATING_CALC, var10, var18, cs);
3331  if (callback != CALLBACK_FAILED) {
3332  skip = true;
3333  rating = GB(callback, 0, 14);
3334 
3335  /* Simulate a 15 bit signed value */
3336  if (HasBit(callback, 14)) rating -= 0x4000;
3337  }
3338  }
3339 
3340  if (!skip) {
3341  int b = ge->last_speed - 85;
3342  if (b >= 0) rating += b >> 2;
3343 
3344  byte waittime = ge->time_since_pickup;
3345  if (st->last_vehicle_type == VEH_SHIP) waittime >>= 2;
3346  (waittime > 21) ||
3347  (rating += 25, waittime > 12) ||
3348  (rating += 25, waittime > 6) ||
3349  (rating += 45, waittime > 3) ||
3350  (rating += 35, true);
3351 
3352  (rating -= 90, ge->max_waiting_cargo > 1500) ||
3353  (rating += 55, ge->max_waiting_cargo > 1000) ||
3354  (rating += 35, ge->max_waiting_cargo > 600) ||
3355  (rating += 10, ge->max_waiting_cargo > 300) ||
3356  (rating += 20, ge->max_waiting_cargo > 100) ||
3357  (rating += 10, true);
3358  }
3359 
3360  if (Company::IsValidID(st->owner) && HasBit(st->town->statues, st->owner)) rating += 26;
3361 
3362  byte age = ge->last_age;
3363  (age >= 3) ||
3364  (rating += 10, age >= 2) ||
3365  (rating += 10, age >= 1) ||
3366  (rating += 13, true);
3367 
3368  {
3369  int or_ = ge->rating; // old rating
3370 
3371  /* only modify rating in steps of -2, -1, 0, 1 or 2 */
3372  ge->rating = rating = or_ + Clamp(Clamp(rating, 0, 255) - or_, -2, 2);
3373 
3374  /* if rating is <= 64 and more than 100 items waiting on average per destination,
3375  * remove some random amount of goods from the station */
3376  if (rating <= 64 && waiting_avg >= 100) {
3377  int dec = Random() & 0x1F;
3378  if (waiting_avg < 200) dec &= 7;
3379  waiting -= (dec + 1) * num_dests;
3380  waiting_changed = true;
3381  }
3382 
3383  /* if rating is <= 127 and there are any items waiting, maybe remove some goods. */
3384  if (rating <= 127 && waiting != 0) {
3385  uint32 r = Random();
3386  if (rating <= (int)GB(r, 0, 7)) {
3387  /* Need to have int, otherwise it will just overflow etc. */
3388  waiting = max((int)waiting - (int)((GB(r, 8, 2) - 1) * num_dests), 0);
3389  waiting_changed = true;
3390  }
3391  }
3392 
3393  /* At some point we really must cap the cargo. Previously this
3394  * was a strict 4095, but now we'll have a less strict, but
3395  * increasingly aggressive truncation of the amount of cargo. */
3396  static const uint WAITING_CARGO_THRESHOLD = 1 << 12;
3397  static const uint WAITING_CARGO_CUT_FACTOR = 1 << 6;
3398  static const uint MAX_WAITING_CARGO = 1 << 15;
3399 
3400  if (waiting > WAITING_CARGO_THRESHOLD) {
3401  uint difference = waiting - WAITING_CARGO_THRESHOLD;
3402  waiting -= (difference / WAITING_CARGO_CUT_FACTOR);
3403 
3404  waiting = min(waiting, MAX_WAITING_CARGO);
3405  waiting_changed = true;
3406  }
3407 
3408  /* We can't truncate cargo that's already reserved for loading.
3409  * Thus StoredCount() here. */
3410  if (waiting_changed && waiting < ge->cargo.AvailableCount()) {
3411  /* Feed back the exact own waiting cargo at this station for the
3412  * next rating calculation. */
3413  ge->max_waiting_cargo = 0;
3414 
3415  TruncateCargo(cs, ge, ge->cargo.AvailableCount() - waiting);
3416  } else {
3417  /* If the average number per next hop is low, be more forgiving. */
3418  ge->max_waiting_cargo = waiting_avg;
3419  }
3420  }
3421  }
3422  }
3423 
3424  StationID index = st->index;
3425  if (waiting_changed) {
3426  SetWindowDirty(WC_STATION_VIEW, index); // update whole window
3427  } else {
3428  SetWindowWidgetDirty(WC_STATION_VIEW, index, WID_SV_ACCEPT_RATING_LIST); // update only ratings list
3429  }
3430 }
3431 
3440 void RerouteCargo(Station *st, CargoID c, StationID avoid, StationID avoid2)
3441 {
3442  GoodsEntry &ge = st->goods[c];
3443 
3444  /* Reroute cargo in station. */
3445  ge.cargo.Reroute(UINT_MAX, &ge.cargo, avoid, avoid2, &ge);
3446 
3447  /* Reroute cargo staged to be transfered. */
3448  for (std::list<Vehicle *>::iterator it(st->loading_vehicles.begin()); it != st->loading_vehicles.end(); ++it) {
3449  for (Vehicle *v = *it; v != NULL; v = v->Next()) {
3450  if (v->cargo_type != c) continue;
3451  v->cargo.Reroute(UINT_MAX, &v->cargo, avoid, avoid2, &ge);
3452  }
3453  }
3454 }
3455 
3465 {
3466  for (CargoID c = 0; c < NUM_CARGO; ++c) {
3467  GoodsEntry &ge = from->goods[c];
3469  if (lg == NULL) continue;
3470  Node node = (*lg)[ge.node];
3471  for (EdgeIterator it(node.Begin()); it != node.End();) {
3472  Edge edge = it->second;
3473  Station *to = Station::Get((*lg)[it->first].Station());
3474  assert(to->goods[c].node == it->first);
3475  ++it; // Do that before removing the edge. Anything else may crash.
3476  assert(_date >= edge.LastUpdate());
3477  uint timeout = LinkGraph::MIN_TIMEOUT_DISTANCE + (DistanceManhattan(from->xy, to->xy) >> 3);
3478  if ((uint)(_date - edge.LastUpdate()) > timeout) {
3479  /* Have all vehicles refresh their next hops before deciding to
3480  * remove the node. */
3481  bool updated = false;
3482  OrderList *l;
3483  FOR_ALL_ORDER_LISTS(l) {
3484  bool found_from = false;
3485  bool found_to = false;
3486  for (Order *order = l->GetFirstOrder(); order != NULL; order = order->next) {
3487  if (!order->IsType(OT_GOTO_STATION) && !order->IsType(OT_IMPLICIT)) continue;
3488  if (order->GetDestination() == from->index) {
3489  found_from = true;
3490  if (found_to) break;
3491  } else if (order->GetDestination() == to->index) {
3492  found_to = true;
3493  if (found_from) break;
3494  }
3495  }
3496  if (!found_to || !found_from) continue;
3497  for (Vehicle *v = l->GetFirstSharedVehicle(); !updated && v != NULL; v = v->NextShared()) {
3498  /* There is potential for optimization here:
3499  * - Usually consists of the same order list are the same. It's probably better to
3500  * first check the first of each list, then the second of each list and so on.
3501  * - We could try to figure out if we've seen a consist with the same cargo on the
3502  * same list already and if the consist can actually carry the cargo we're looking
3503  * for. With conditional and refit orders this is not quite trivial, though. */
3504  LinkRefresher::Run(v, false); // Don't allow merging. Otherwise lg might get deleted.
3505  if (edge.LastUpdate() == _date) updated = true;
3506  }
3507  if (updated) break;
3508  }
3509  if (!updated) {
3510  /* If it's still considered dead remove it. */
3511  node.RemoveEdge(to->goods[c].node);
3512  ge.flows.DeleteFlows(to->index);
3513  RerouteCargo(from, c, to->index, from->index);
3514  }
3515  } else if (edge.LastUnrestrictedUpdate() != INVALID_DATE && (uint)(_date - edge.LastUnrestrictedUpdate()) > timeout) {
3516  edge.Restrict();
3517  ge.flows.RestrictFlows(to->index);
3518  RerouteCargo(from, c, to->index, from->index);
3519  } else if (edge.LastRestrictedUpdate() != INVALID_DATE && (uint)(_date - edge.LastRestrictedUpdate()) > timeout) {
3520  edge.Release();
3521  }
3522  }
3523  assert(_date >= lg->LastCompression());
3524  if ((uint)(_date - lg->LastCompression()) > LinkGraph::COMPRESSION_INTERVAL) {
3525  lg->Compress();
3526  }
3527  }
3528 }
3529 
3539 void IncreaseStats(Station *st, CargoID cargo, StationID next_station_id, uint capacity, uint usage, EdgeUpdateMode mode)
3540 {
3541  GoodsEntry &ge1 = st->goods[cargo];
3542  Station *st2 = Station::Get(next_station_id);
3543  GoodsEntry &ge2 = st2->goods[cargo];
3544  LinkGraph *lg = NULL;
3545  if (ge1.link_graph == INVALID_LINK_GRAPH) {
3546  if (ge2.link_graph == INVALID_LINK_GRAPH) {
3548  lg = new LinkGraph(cargo);
3550  ge2.link_graph = lg->index;
3551  ge2.node = lg->AddNode(st2);
3552  } else {
3553  DEBUG(misc, 0, "Can't allocate link graph");
3554  }
3555  } else {
3556  lg = LinkGraph::Get(ge2.link_graph);
3557  }
3558  if (lg) {
3559  ge1.link_graph = lg->index;
3560  ge1.node = lg->AddNode(st);
3561  }
3562  } else if (ge2.link_graph == INVALID_LINK_GRAPH) {
3563  lg = LinkGraph::Get(ge1.link_graph);
3564  ge2.link_graph = lg->index;
3565  ge2.node = lg->AddNode(st2);
3566  } else {
3567  lg = LinkGraph::Get(ge1.link_graph);
3568  if (ge1.link_graph != ge2.link_graph) {
3569  LinkGraph *lg2 = LinkGraph::Get(ge2.link_graph);
3570  if (lg->Size() < lg2->Size()) {
3572  lg2->Merge(lg); // Updates GoodsEntries of lg
3573  lg = lg2;
3574  } else {
3576  lg->Merge(lg2); // Updates GoodsEntries of lg2
3577  }
3578  }
3579  }
3580  if (lg != NULL) {
3581  (*lg)[ge1.node].UpdateEdge(ge2.node, capacity, usage, mode);
3582  }
3583 }
3584 
3591 void IncreaseStats(Station *st, const Vehicle *front, StationID next_station_id)
3592 {
3593  for (const Vehicle *v = front; v != NULL; v = v->Next()) {
3594  if (v->refit_cap > 0) {
3595  /* The cargo count can indeed be higher than the refit_cap if
3596  * wagons have been auto-replaced and subsequently auto-
3597  * refitted to a higher capacity. The cargo gets redistributed
3598  * among the wagons in that case.
3599  * As usage is not such an important figure anyway we just
3600  * ignore the additional cargo then.*/
3601  IncreaseStats(st, v->cargo_type, next_station_id, v->refit_cap,
3603  }
3604  }
3605 }
3606 
3607 /* called for every station each tick */
3608 static void StationHandleSmallTick(BaseStation *st)
3609 {
3610  if ((st->facilities & FACIL_WAYPOINT) != 0 || !st->IsInUse()) return;
3611 
3612  byte b = st->delete_ctr + 1;
3613  if (b >= STATION_RATING_TICKS) b = 0;
3614  st->delete_ctr = b;
3615 
3616  if (b == 0) UpdateStationRating(Station::From(st));
3617 }
3618 
3619 void OnTick_Station()
3620 {
3621  if (_game_mode == GM_EDITOR) return;
3622 
3623  BaseStation *st;
3624  FOR_ALL_BASE_STATIONS(st) {
3625  StationHandleSmallTick(st);
3626 
3627  /* Clean up the link graph about once a week. */
3628  if (Station::IsExpected(st) && (_tick_counter + st->index) % STATION_LINKGRAPH_TICKS == 0) {
3630  };
3631 
3632  /* Run STATION_ACCEPTANCE_TICKS = 250 tick interval trigger for station animation.
3633  * Station index is included so that triggers are not all done
3634  * at the same time. */
3635  if ((_tick_counter + st->index) % STATION_ACCEPTANCE_TICKS == 0) {
3636  /* Stop processing this station if it was deleted */
3637  if (!StationHandleBigTick(st)) continue;
3638  TriggerStationAnimation(st, st->xy, SAT_250_TICKS);
3639  if (Station::IsExpected(st)) AirportAnimationTrigger(Station::From(st), AAT_STATION_250_TICKS);
3640  }
3641  }
3642 }
3643 
3646 {
3647  Station *st;
3648 
3649  FOR_ALL_STATIONS(st) {
3650  for (CargoID i = 0; i < NUM_CARGO; i++) {
3651  GoodsEntry *ge = &st->goods[i];
3654  }
3655  }
3656 }
3657 
3658 
3659 void ModifyStationRatingAround(TileIndex tile, Owner owner, int amount, uint radius)
3660 {
3661  Station *st;
3662 
3663  FOR_ALL_STATIONS(st) {
3664  if (st->owner == owner &&
3665  DistanceManhattan(tile, st->xy) <= radius) {
3666  for (CargoID i = 0; i < NUM_CARGO; i++) {
3667  GoodsEntry *ge = &st->goods[i];
3668 
3669  if (ge->status != 0) {
3670  ge->rating = Clamp(ge->rating + amount, 0, 255);
3671  }
3672  }
3673  }
3674  }
3675 }
3676 
3677 static uint UpdateStationWaiting(Station *st, CargoID type, uint amount, SourceType source_type, SourceID source_id)
3678 {
3679  /* We can't allocate a CargoPacket? Then don't do anything
3680  * at all; i.e. just discard the incoming cargo. */
3681  if (!CargoPacket::CanAllocateItem()) return 0;
3682 
3683  GoodsEntry &ge = st->goods[type];
3684  amount += ge.amount_fract;
3685  ge.amount_fract = GB(amount, 0, 8);
3686 
3687  amount >>= 8;
3688  /* No new "real" cargo item yet. */
3689  if (amount == 0) return 0;
3690 
3691  StationID next = ge.GetVia(st->index);
3692  ge.cargo.Append(new CargoPacket(st->index, st->xy, amount, source_type, source_id), next);
3693  LinkGraph *lg = NULL;
3694  if (ge.link_graph == INVALID_LINK_GRAPH) {
3696  lg = new LinkGraph(type);
3698  ge.link_graph = lg->index;
3699  ge.node = lg->AddNode(st);
3700  } else {
3701  DEBUG(misc, 0, "Can't allocate link graph");
3702  }
3703  } else {
3704  lg = LinkGraph::Get(ge.link_graph);
3705  }
3706  if (lg != NULL) (*lg)[ge.node].UpdateSupply(amount);
3707 
3708  if (!ge.HasRating()) {
3711  }
3712 
3714  TriggerStationAnimation(st, st->xy, SAT_NEW_CARGO, type);
3715  AirportAnimationTrigger(st, AAT_STATION_NEW_CARGO, type);
3716 
3718  st->MarkTilesDirty(true);
3719  return amount;
3720 }
3721 
3722 static bool IsUniqueStationName(const char *name)
3723 {
3724  const Station *st;
3725 
3726  FOR_ALL_STATIONS(st) {
3727  if (st->name != NULL && strcmp(st->name, name) == 0) return false;
3728  }
3729 
3730  return true;
3731 }
3732 
3742 CommandCost CmdRenameStation(TileIndex tile, DoCommandFlag flags, uint32 p1, uint32 p2, const char *text)
3743 {
3744  Station *st = Station::GetIfValid(p1);
3745  if (st == NULL) return CMD_ERROR;
3746 
3747  CommandCost ret = CheckOwnership(st->owner);
3748  if (ret.Failed()) return ret;
3749 
3750  bool reset = StrEmpty(text);
3751 
3752  if (!reset) {
3754  if (!IsUniqueStationName(text)) return_cmd_error(STR_ERROR_NAME_MUST_BE_UNIQUE);
3755  }
3756 
3757  if (flags & DC_EXEC) {
3758  free(st->name);
3759  st->name = reset ? NULL : stredup(text);
3760 
3761  st->UpdateVirtCoord();
3763  }
3764 
3765  return CommandCost();
3766 }
3767 
3774 void FindStationsAroundTiles(const TileArea &location, StationList *stations)
3775 {
3776  /* area to search = producer plus station catchment radius */
3778 
3779  uint x = TileX(location.tile);
3780  uint y = TileY(location.tile);
3781 
3782  uint min_x = (x > max_rad) ? x - max_rad : 0;
3783  uint max_x = x + location.w + max_rad;
3784  uint min_y = (y > max_rad) ? y - max_rad : 0;
3785  uint max_y = y + location.h + max_rad;
3786 
3787  if (min_x == 0 && _settings_game.construction.freeform_edges) min_x = 1;
3788  if (min_y == 0 && _settings_game.construction.freeform_edges) min_y = 1;
3789  if (max_x >= MapSizeX()) max_x = MapSizeX() - 1;
3790  if (max_y >= MapSizeY()) max_y = MapSizeY() - 1;
3791 
3792  for (uint cy = min_y; cy < max_y; cy++) {
3793  for (uint cx = min_x; cx < max_x; cx++) {
3794  TileIndex cur_tile = TileXY(cx, cy);
3795  if (!IsTileType(cur_tile, MP_STATION)) continue;
3796 
3797  Station *st = Station::GetByTile(cur_tile);
3798  /* st can be NULL in case of waypoints */
3799  if (st == NULL) continue;
3800 
3802  int rad = st->GetCatchmentRadius();
3803  int rad_x = cx - x;
3804  int rad_y = cy - y;
3805 
3806  if (rad_x < -rad || rad_x >= rad + location.w) continue;
3807  if (rad_y < -rad || rad_y >= rad + location.h) continue;
3808  }
3809 
3810  /* Insert the station in the set. This will fail if it has
3811  * already been added.
3812  */
3813  stations->Include(st);
3814  }
3815  }
3816 }
3817 
3823 {
3824  if (this->tile != INVALID_TILE) {
3825  FindStationsAroundTiles(*this, &this->stations);
3826  this->tile = INVALID_TILE;
3827  }
3828  return &this->stations;
3829 }
3830 
3831 uint MoveGoodsToStation(CargoID type, uint amount, SourceType source_type, SourceID source_id, const StationList *all_stations)
3832 {
3833  /* Return if nothing to do. Also the rounding below fails for 0. */
3834  if (amount == 0) return 0;
3835 
3836  Station *st1 = NULL; // Station with best rating
3837  Station *st2 = NULL; // Second best station
3838  uint best_rating1 = 0; // rating of st1
3839  uint best_rating2 = 0; // rating of st2
3840 
3841  for (Station * const *st_iter = all_stations->Begin(); st_iter != all_stations->End(); ++st_iter) {
3842  Station *st = *st_iter;
3843 
3844  /* Is the station reserved exclusively for somebody else? */
3845  if (st->town->exclusive_counter > 0 && st->town->exclusivity != st->owner) continue;
3846 
3847  if (st->goods[type].rating == 0) continue; // Lowest possible rating, better not to give cargo anymore
3848 
3849  if (_settings_game.order.selectgoods && !st->goods[type].HasVehicleEverTriedLoading()) continue; // Selectively servicing stations, and not this one
3850 
3851  if (IsCargoInClass(type, CC_PASSENGERS)) {
3852  if (st->facilities == FACIL_TRUCK_STOP) continue; // passengers are never served by just a truck stop
3853  } else {
3854  if (st->facilities == FACIL_BUS_STOP) continue; // non-passengers are never served by just a bus stop
3855  }
3856 
3857  /* This station can be used, add it to st1/st2 */
3858  if (st1 == NULL || st->goods[type].rating >= best_rating1) {
3859  st2 = st1; best_rating2 = best_rating1; st1 = st; best_rating1 = st->goods[type].rating;
3860  } else if (st2 == NULL || st->goods[type].rating >= best_rating2) {
3861  st2 = st; best_rating2 = st->goods[type].rating;
3862  }
3863  }
3864 
3865  /* no stations around at all? */
3866  if (st1 == NULL) return 0;
3867 
3868  /* From now we'll calculate with fractal cargo amounts.
3869  * First determine how much cargo we really have. */
3870  amount *= best_rating1 + 1;
3871 
3872  if (st2 == NULL) {
3873  /* only one station around */
3874  return UpdateStationWaiting(st1, type, amount, source_type, source_id);
3875  }
3876 
3877  /* several stations around, the best two (highest rating) are in st1 and st2 */
3878  assert(st1 != NULL);
3879  assert(st2 != NULL);
3880  assert(best_rating1 != 0 || best_rating2 != 0);
3881 
3882  /* Then determine the amount the worst station gets. We do it this way as the
3883  * best should get a bonus, which in this case is the rounding difference from
3884  * this calculation. In reality that will mean the bonus will be pretty low.
3885  * Nevertheless, the best station should always get the most cargo regardless
3886  * of rounding issues. */
3887  uint worst_cargo = amount * best_rating2 / (best_rating1 + best_rating2);
3888  assert(worst_cargo <= (amount - worst_cargo));
3889 
3890  /* And then send the cargo to the stations! */
3891  uint moved = UpdateStationWaiting(st1, type, amount - worst_cargo, source_type, source_id);
3892  /* These two UpdateStationWaiting's can't be in the statement as then the order
3893  * of execution would be undefined and that could cause desyncs with callbacks. */
3894  return moved + UpdateStationWaiting(st2, type, worst_cargo, source_type, source_id);
3895 }
3896 
3897 void BuildOilRig(TileIndex tile)
3898 {
3899  if (!Station::CanAllocateItem()) {
3900  DEBUG(misc, 0, "Can't allocate station for oilrig at 0x%X, reverting to oilrig only", tile);
3901  return;
3902  }
3903 
3904  Station *st = new Station(tile);
3905  st->town = ClosestTownFromTile(tile, UINT_MAX);
3906 
3907  st->string_id = GenerateStationName(st, tile, STATIONNAMING_OILRIG);
3908 
3909  assert(IsTileType(tile, MP_INDUSTRY));
3910  DeleteAnimatedTile(tile);
3911  MakeOilrig(tile, st->index, GetWaterClass(tile));
3912 
3913  st->owner = OWNER_NONE;
3914  st->airport.type = AT_OILRIG;
3915  st->airport.Add(tile);
3916  st->dock_tile = tile;
3918  st->build_date = _date;
3919 
3920  st->rect.BeforeAddTile(tile, StationRect::ADD_FORCE);
3921 
3922  st->UpdateVirtCoord();
3923  UpdateStationAcceptance(st, false);
3925 }
3926 
3927 void DeleteOilRig(TileIndex tile)
3928 {
3929  Station *st = Station::GetByTile(tile);
3930 
3931  MakeWaterKeepingClass(tile, OWNER_NONE);
3932 
3933  st->dock_tile = INVALID_TILE;
3934  st->airport.Clear();
3935  st->facilities &= ~(FACIL_AIRPORT | FACIL_DOCK);
3936  st->airport.flags = 0;
3937 
3938  st->rect.AfterRemoveTile(st, tile);
3939 
3940  st->UpdateVirtCoord();
3942  if (!st->IsInUse()) delete st;
3943 }
3944 
3945 static void ChangeTileOwner_Station(TileIndex tile, Owner old_owner, Owner new_owner)
3946 {
3947  if (IsRoadStopTile(tile)) {
3948  for (RoadType rt = ROADTYPE_ROAD; rt < ROADTYPE_END; rt++) {
3949  /* Update all roadtypes, no matter if they are present */
3950  if (GetRoadOwner(tile, rt) == old_owner) {
3951  if (HasTileRoadType(tile, rt)) {
3952  /* A drive-through road-stop has always two road bits. No need to dirty windows here, we'll redraw the whole screen anyway. */
3953  Company::Get(old_owner)->infrastructure.road[rt] -= 2;
3954  if (new_owner != INVALID_OWNER) Company::Get(new_owner)->infrastructure.road[rt] += 2;
3955  }
3956  SetRoadOwner(tile, rt, new_owner == INVALID_OWNER ? OWNER_NONE : new_owner);
3957  }
3958  }
3959  }
3960 
3961  if (!IsTileOwner(tile, old_owner)) return;
3962 
3963  if (new_owner != INVALID_OWNER) {
3964  /* Update company infrastructure counts. Only do it here
3965  * if the new owner is valid as otherwise the clear
3966  * command will do it for us. No need to dirty windows
3967  * here, we'll redraw the whole screen anyway.*/
3968  Company *old_company = Company::Get(old_owner);
3969  Company *new_company = Company::Get(new_owner);
3970 
3971  /* Update counts for underlying infrastructure. */
3972  switch (GetStationType(tile)) {
3973  case STATION_RAIL:
3974  case STATION_WAYPOINT:
3975  if (!IsStationTileBlocked(tile)) {
3976  old_company->infrastructure.rail[GetRailType(tile)]--;
3977  new_company->infrastructure.rail[GetRailType(tile)]++;
3978  }
3979  break;
3980 
3981  case STATION_BUS:
3982  case STATION_TRUCK:
3983  /* Road stops were already handled above. */
3984  break;
3985 
3986  case STATION_BUOY:
3987  case STATION_DOCK:
3988  if (GetWaterClass(tile) == WATER_CLASS_CANAL) {
3989  old_company->infrastructure.water--;
3990  new_company->infrastructure.water++;
3991  }
3992  break;
3993 
3994  default:
3995  break;
3996  }
3997 
3998  /* Update station tile count. */
3999  if (!IsBuoy(tile) && !IsAirport(tile)) {
4000  old_company->infrastructure.station--;
4001  new_company->infrastructure.station++;
4002  }
4003 
4004  /* for buoys, owner of tile is owner of water, st->owner == OWNER_NONE */
4005  SetTileOwner(tile, new_owner);
4007  } else {
4008  if (IsDriveThroughStopTile(tile)) {
4009  /* Remove the drive-through road stop */
4010  DoCommand(tile, 1 | 1 << 8, (GetStationType(tile) == STATION_TRUCK) ? ROADSTOP_TRUCK : ROADSTOP_BUS, DC_EXEC | DC_BANKRUPT, CMD_REMOVE_ROAD_STOP);
4011  assert(IsTileType(tile, MP_ROAD));
4012  /* Change owner of tile and all roadtypes */
4013  ChangeTileOwner(tile, old_owner, new_owner);
4014  } else {
4016  /* Set tile owner of water under (now removed) buoy and dock to OWNER_NONE.
4017  * Update owner of buoy if it was not removed (was in orders).
4018  * Do not update when owned by OWNER_WATER (sea and rivers). */
4019  if ((IsTileType(tile, MP_WATER) || IsBuoyTile(tile)) && IsTileOwner(tile, old_owner)) SetTileOwner(tile, OWNER_NONE);
4020  }
4021  }
4022 }
4023 
4033 {
4034  /* Yeah... water can always remove stops, right? */
4035  if (_current_company == OWNER_WATER) return true;
4036 
4037  RoadTypes rts = GetRoadTypes(tile);
4038  if (HasBit(rts, ROADTYPE_TRAM)) {
4039  Owner tram_owner = GetRoadOwner(tile, ROADTYPE_TRAM);
4040  if (tram_owner != OWNER_NONE && CheckOwnership(tram_owner).Failed()) return false;
4041  }
4042  if (HasBit(rts, ROADTYPE_ROAD)) {
4043  Owner road_owner = GetRoadOwner(tile, ROADTYPE_ROAD);
4044  if (road_owner != OWNER_TOWN) {
4045  if (road_owner != OWNER_NONE && CheckOwnership(road_owner).Failed()) return false;
4046  } else {
4047  if (CheckAllowRemoveRoad(tile, GetAnyRoadBits(tile, ROADTYPE_ROAD), OWNER_TOWN, ROADTYPE_ROAD, flags).Failed()) return false;
4048  }
4049  }
4050 
4051  return true;
4052 }
4053 
4061 {
4062  if (flags & DC_AUTO) {
4063  switch (GetStationType(tile)) {
4064  default: break;
4065  case STATION_RAIL: return_cmd_error(STR_ERROR_MUST_DEMOLISH_RAILROAD);
4066  case STATION_WAYPOINT: return_cmd_error(STR_ERROR_BUILDING_MUST_BE_DEMOLISHED);
4067  case STATION_AIRPORT: return_cmd_error(STR_ERROR_MUST_DEMOLISH_AIRPORT_FIRST);
4068  case STATION_TRUCK: return_cmd_error(HasTileRoadType(tile, ROADTYPE_TRAM) ? STR_ERROR_MUST_DEMOLISH_CARGO_TRAM_STATION_FIRST : STR_ERROR_MUST_DEMOLISH_TRUCK_STATION_FIRST);
4069  case STATION_BUS: return_cmd_error(HasTileRoadType(tile, ROADTYPE_TRAM) ? STR_ERROR_MUST_DEMOLISH_PASSENGER_TRAM_STATION_FIRST : STR_ERROR_MUST_DEMOLISH_BUS_STATION_FIRST);
4070  case STATION_BUOY: return_cmd_error(STR_ERROR_BUOY_IN_THE_WAY);
4071  case STATION_DOCK: return_cmd_error(STR_ERROR_MUST_DEMOLISH_DOCK_FIRST);
4072  case STATION_OILRIG:
4073  SetDParam(1, STR_INDUSTRY_NAME_OIL_RIG);
4074  return_cmd_error(STR_ERROR_GENERIC_OBJECT_IN_THE_WAY);
4075  }
4076  }
4077 
4078  switch (GetStationType(tile)) {
4079  case STATION_RAIL: return RemoveRailStation(tile, flags);
4080  case STATION_WAYPOINT: return RemoveRailWaypoint(tile, flags);
4081  case STATION_AIRPORT: return RemoveAirport(tile, flags);
4082  case STATION_TRUCK:
4083  if (IsDriveThroughStopTile(tile) && !CanRemoveRoadWithStop(tile, flags)) {
4084  return_cmd_error(STR_ERROR_MUST_DEMOLISH_TRUCK_STATION_FIRST);
4085  }
4086  return RemoveRoadStop(tile, flags);
4087  case STATION_BUS:
4088  if (IsDriveThroughStopTile(tile) && !CanRemoveRoadWithStop(tile, flags)) {
4089  return_cmd_error(STR_ERROR_MUST_DEMOLISH_BUS_STATION_FIRST);
4090  }
4091  return RemoveRoadStop(tile, flags);
4092  case STATION_BUOY: return RemoveBuoy(tile, flags);
4093  case STATION_DOCK: return RemoveDock(tile, flags);
4094  default: break;
4095  }
4096 
4097  return CMD_ERROR;
4098 }
4099 
4100 static CommandCost TerraformTile_Station(TileIndex tile, DoCommandFlag flags, int z_new, Slope tileh_new)
4101 {
4103  /* TODO: If you implement newgrf callback 149 'land slope check', you have to decide what to do with it here.
4104  * TTDP does not call it.
4105  */
4106  if (GetTileMaxZ(tile) == z_new + GetSlopeMaxZ(tileh_new)) {
4107  switch (GetStationType(tile)) {
4108  case STATION_WAYPOINT:
4109  case STATION_RAIL: {
4110  DiagDirection direction = AxisToDiagDir(GetRailStationAxis(tile));
4111  if (!AutoslopeCheckForEntranceEdge(tile, z_new, tileh_new, direction)) break;
4112  if (!AutoslopeCheckForEntranceEdge(tile, z_new, tileh_new, ReverseDiagDir(direction))) break;
4113  return CommandCost(EXPENSES_CONSTRUCTION, _price[PR_BUILD_FOUNDATION]);
4114  }
4115 
4116  case STATION_AIRPORT:
4117  return CommandCost(EXPENSES_CONSTRUCTION, _price[PR_BUILD_FOUNDATION]);
4118 
4119  case STATION_TRUCK:
4120  case STATION_BUS: {
4121  DiagDirection direction = GetRoadStopDir(tile);
4122  if (!AutoslopeCheckForEntranceEdge(tile, z_new, tileh_new, direction)) break;
4123  if (IsDriveThroughStopTile(tile)) {
4124  if (!AutoslopeCheckForEntranceEdge(tile, z_new, tileh_new, ReverseDiagDir(direction))) break;
4125  }
4126  return CommandCost(EXPENSES_CONSTRUCTION, _price[PR_BUILD_FOUNDATION]);
4127  }
4128 
4129  default: break;
4130  }
4131  }
4132  }
4133  return DoCommand(tile, 0, 0, flags, CMD_LANDSCAPE_CLEAR);
4134 }
4135 
4141 uint FlowStat::GetShare(StationID st) const
4142 {
4143  uint32 prev = 0;
4144  for (SharesMap::const_iterator it = this->shares.begin(); it != this->shares.end(); ++it) {
4145  if (it->second == st) {
4146  return it->first - prev;
4147  } else {
4148  prev = it->first;
4149  }
4150  }
4151  return 0;
4152 }
4153 
4160 StationID FlowStat::GetVia(StationID excluded, StationID excluded2) const
4161 {
4162  if (this->unrestricted == 0) return INVALID_STATION;
4163  assert(!this->shares.empty());
4164  SharesMap::const_iterator it = this->shares.upper_bound(RandomRange(this->unrestricted));
4165  assert(it != this->shares.end() && it->first <= this->unrestricted);
4166  if (it->second != excluded && it->second != excluded2) return it->second;
4167 
4168  /* We've hit one of the excluded stations.
4169  * Draw another share, from outside its range. */
4170 
4171  uint end = it->first;
4172  uint begin = (it == this->shares.begin() ? 0 : (--it)->first);
4173  uint interval = end - begin;
4174  if (interval >= this->unrestricted) return INVALID_STATION; // Only one station in the map.
4175  uint new_max = this->unrestricted - interval;
4176  uint rand = RandomRange(new_max);
4177  SharesMap::const_iterator it2 = (rand < begin) ? this->shares.upper_bound(rand) :
4178  this->shares.upper_bound(rand + interval);
4179  assert(it2 != this->shares.end() && it2->first <= this->unrestricted);
4180  if (it2->second != excluded && it2->second != excluded2) return it2->second;
4181 
4182  /* We've hit the second excluded station.
4183  * Same as before, only a bit more complicated. */
4184 
4185  uint end2 = it2->first;
4186  uint begin2 = (it2 == this->shares.begin() ? 0 : (--it2)->first);
4187  uint interval2 = end2 - begin2;
4188  if (interval2 >= new_max) return INVALID_STATION; // Only the two excluded stations in the map.
4189  new_max -= interval2;
4190  if (begin > begin2) {
4191  Swap(begin, begin2);
4192  Swap(end, end2);
4193  Swap(interval, interval2);
4194  }
4195  rand = RandomRange(new_max);
4196  SharesMap::const_iterator it3 = this->shares.upper_bound(this->unrestricted);
4197  if (rand < begin) {
4198  it3 = this->shares.upper_bound(rand);
4199  } else if (rand < begin2 - interval) {
4200  it3 = this->shares.upper_bound(rand + interval);
4201  } else {
4202  it3 = this->shares.upper_bound(rand + interval + interval2);
4203  }
4204  assert(it3 != this->shares.end() && it3->first <= this->unrestricted);
4205  return it3->second;
4206 }
4207 
4214 {
4215  assert(!this->shares.empty());
4216  SharesMap new_shares;
4217  uint i = 0;
4218  for (SharesMap::iterator it(this->shares.begin()); it != this->shares.end(); ++it) {
4219  new_shares[++i] = it->second;
4220  if (it->first == this->unrestricted) this->unrestricted = i;
4221  }
4222  this->shares.swap(new_shares);
4223  assert(!this->shares.empty() && this->unrestricted <= (--this->shares.end())->first);
4224 }
4225 
4232 void FlowStat::ChangeShare(StationID st, int flow)
4233 {
4234  /* We assert only before changing as afterwards the shares can actually
4235  * be empty. In that case the whole flow stat must be deleted then. */
4236  assert(!this->shares.empty());
4237 
4238  uint removed_shares = 0;
4239  uint added_shares = 0;
4240  uint last_share = 0;
4241  SharesMap new_shares;
4242  for (SharesMap::iterator it(this->shares.begin()); it != this->shares.end(); ++it) {
4243  if (it->second == st) {
4244  if (flow < 0) {
4245  uint share = it->first - last_share;
4246  if (flow == INT_MIN || (uint)(-flow) >= share) {
4247  removed_shares += share;
4248  if (it->first <= this->unrestricted) this->unrestricted -= share;
4249  if (flow != INT_MIN) flow += share;
4250  last_share = it->first;
4251  continue; // remove the whole share
4252  }
4253  removed_shares += (uint)(-flow);
4254  } else {
4255  added_shares += (uint)(flow);
4256  }
4257  if (it->first <= this->unrestricted) this->unrestricted += flow;
4258 
4259  /* If we don't continue above the whole flow has been added or
4260  * removed. */
4261  flow = 0;
4262  }
4263  new_shares[it->first + added_shares - removed_shares] = it->second;
4264  last_share = it->first;
4265  }
4266  if (flow > 0) {
4267  new_shares[last_share + (uint)flow] = st;
4268  if (this->unrestricted < last_share) {
4269  this->ReleaseShare(st);
4270  } else {
4271  this->unrestricted += flow;
4272  }
4273  }
4274  this->shares.swap(new_shares);
4275 }
4276 
4282 void FlowStat::RestrictShare(StationID st)
4283 {
4284  assert(!this->shares.empty());
4285  uint flow = 0;
4286  uint last_share = 0;
4287  SharesMap new_shares;
4288  for (SharesMap::iterator it(this->shares.begin()); it != this->shares.end(); ++it) {
4289  if (flow == 0) {
4290  if (it->first > this->unrestricted) return; // Not present or already restricted.
4291  if (it->second == st) {
4292  flow = it->first - last_share;
4293  this->unrestricted -= flow;
4294  } else {
4295  new_shares[it->first] = it->second;
4296  }
4297  } else {
4298  new_shares[it->first - flow] = it->second;
4299  }
4300  last_share = it->first;
4301  }
4302  if (flow == 0) return;
4303  new_shares[last_share + flow] = st;
4304  this->shares.swap(new_shares);
4305  assert(!this->shares.empty());
4306 }
4307 
4313 void FlowStat::ReleaseShare(StationID st)
4314 {
4315  assert(!this->shares.empty());
4316  uint flow = 0;
4317  uint next_share = 0;
4318  bool found = false;
4319  for (SharesMap::reverse_iterator it(this->shares.rbegin()); it != this->shares.rend(); ++it) {
4320  if (it->first < this->unrestricted) return; // Note: not <= as the share may hit the limit.
4321  if (found) {
4322  flow = next_share - it->first;
4323  this->unrestricted += flow;
4324  break;
4325  } else {
4326  if (it->first == this->unrestricted) return; // !found -> Limit not hit.
4327  if (it->second == st) found = true;
4328  }
4329  next_share = it->first;
4330  }
4331  if (flow == 0) return;
4332  SharesMap new_shares;
4333  new_shares[flow] = st;
4334  for (SharesMap::iterator it(this->shares.begin()); it != this->shares.end(); ++it) {
4335  if (it->second != st) {
4336  new_shares[flow + it->first] = it->second;
4337  } else {
4338  flow = 0;
4339  }
4340  }
4341  this->shares.swap(new_shares);
4342  assert(!this->shares.empty());
4343 }
4344 
4350 void FlowStat::ScaleToMonthly(uint runtime)
4351 {
4352  assert(runtime > 0);
4353  SharesMap new_shares;
4354  uint share = 0;
4355  for (SharesMap::iterator i = this->shares.begin(); i != this->shares.end(); ++i) {
4356  share = max(share + 1, i->first * 30 / runtime);
4357  new_shares[share] = i->second;
4358  if (this->unrestricted == i->first) this->unrestricted = share;
4359  }
4360  this->shares.swap(new_shares);
4361 }
4362 
4369 void FlowStatMap::AddFlow(StationID origin, StationID via, uint flow)
4370 {
4371  FlowStatMap::iterator origin_it = this->find(origin);
4372  if (origin_it == this->end()) {
4373  this->insert(std::make_pair(origin, FlowStat(via, flow)));
4374  } else {
4375  origin_it->second.ChangeShare(via, flow);
4376  assert(!origin_it->second.GetShares()->empty());
4377  }
4378 }
4379 
4388 void FlowStatMap::PassOnFlow(StationID origin, StationID via, uint flow)
4389 {
4390  FlowStatMap::iterator prev_it = this->find(origin);
4391  if (prev_it == this->end()) {
4392  FlowStat fs(via, flow);
4393  fs.AppendShare(INVALID_STATION, flow);
4394  this->insert(std::make_pair(origin, fs));
4395  } else {
4396  prev_it->second.ChangeShare(via, flow);
4397  prev_it->second.ChangeShare(INVALID_STATION, flow);
4398  assert(!prev_it->second.GetShares()->empty());
4399  }
4400 }
4401 
4407 {
4408  for (FlowStatMap::iterator i = this->begin(); i != this->end(); ++i) {
4409  FlowStat &fs = i->second;
4410  uint local = fs.GetShare(INVALID_STATION);
4411  if (local > INT_MAX) { // make sure it fits in an int
4412  fs.ChangeShare(self, -INT_MAX);
4413  fs.ChangeShare(INVALID_STATION, -INT_MAX);
4414  local -= INT_MAX;
4415  }
4416  fs.ChangeShare(self, -(int)local);
4417  fs.ChangeShare(INVALID_STATION, -(int)local);
4418 
4419  /* If the local share is used up there must be a share for some
4420  * remote station. */
4421  assert(!fs.GetShares()->empty());
4422  }
4423 }
4424 
4432 {
4433  StationIDStack ret;
4434  for (FlowStatMap::iterator f_it = this->begin(); f_it != this->end();) {
4435  FlowStat &s_flows = f_it->second;
4436  s_flows.ChangeShare(via, INT_MIN);
4437  if (s_flows.GetShares()->empty()) {
4438  ret.Push(f_it->first);
4439  this->erase(f_it++);
4440  } else {
4441  ++f_it;
4442  }
4443  }
4444  return ret;
4445 }
4446 
4451 void FlowStatMap::RestrictFlows(StationID via)
4452 {
4453  for (FlowStatMap::iterator it = this->begin(); it != this->end(); ++it) {
4454  it->second.RestrictShare(via);
4455  }
4456 }
4457 
4462 void FlowStatMap::ReleaseFlows(StationID via)
4463 {
4464  for (FlowStatMap::iterator it = this->begin(); it != this->end(); ++it) {
4465  it->second.ReleaseShare(via);
4466  }
4467 }
4468 
4474 {
4475  uint ret = 0;
4476  for (FlowStatMap::const_iterator i = this->begin(); i != this->end(); ++i) {
4477  ret += (--(i->second.GetShares()->end()))->first;
4478  }
4479  return ret;
4480 }
4481 
4487 uint FlowStatMap::GetFlowVia(StationID via) const
4488 {
4489  uint ret = 0;
4490  for (FlowStatMap::const_iterator i = this->begin(); i != this->end(); ++i) {
4491  ret += i->second.GetShare(via);
4492  }
4493  return ret;
4494 }
4495 
4501 uint FlowStatMap::GetFlowFrom(StationID from) const
4502 {
4503  FlowStatMap::const_iterator i = this->find(from);
4504  if (i == this->end()) return 0;
4505  return (--(i->second.GetShares()->end()))->first;
4506 }
4507 
4514 uint FlowStatMap::GetFlowFromVia(StationID from, StationID via) const
4515 {
4516  FlowStatMap::const_iterator i = this->find(from);
4517  if (i == this->end()) return 0;
4518  return i->second.GetShare(via);
4519 }
4520 
4521 extern const TileTypeProcs _tile_type_station_procs = {
4522  DrawTile_Station, // draw_tile_proc
4523  GetSlopePixelZ_Station, // get_slope_z_proc
4524  ClearTile_Station, // clear_tile_proc
4525  NULL, // add_accepted_cargo_proc
4526  GetTileDesc_Station, // get_tile_desc_proc
4527  GetTileTrackStatus_Station, // get_tile_track_status_proc
4528  ClickTile_Station, // click_tile_proc
4529  AnimateTile_Station, // animate_tile_proc
4530  TileLoop_Station, // tile_loop_proc
4531  ChangeTileOwner_Station, // change_tile_owner_proc
4532  NULL, // add_produced_cargo_proc
4533  VehicleEnter_Station, // vehicle_enter_tile_proc
4534  GetFoundation_Station, // get_foundation_proc
4535  TerraformTile_Station, // terraform_tile_proc
4536 };