OpenTTD
station_cmd.cpp
Go to the documentation of this file.
1 /* $Id: station_cmd.cpp 27271 2015-05-08 17:30:07Z frosch $ */
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 
1630 template <class T>
1632 {
1633  /* Current company owns the station? */
1634  if (_current_company != OWNER_WATER) {
1635  CommandCost ret = CheckOwnership(st->owner);
1636  if (ret.Failed()) return ret;
1637  }
1638 
1639  /* determine width and height of platforms */
1640  TileArea ta = st->train_station;
1641 
1642  assert(ta.w != 0 && ta.h != 0);
1643 
1645  /* clear all areas of the station */
1646  TILE_AREA_LOOP(tile, ta) {
1647  /* only remove tiles that are actually train station tiles */
1648  if (!st->TileBelongsToRailStation(tile)) continue;
1649 
1651  if (ret.Failed()) return ret;
1652 
1653  cost.AddCost(removal_cost);
1654  if (flags & DC_EXEC) {
1655  /* read variables before the station tile is removed */
1656  Track track = GetRailStationTrack(tile);
1657  Owner owner = GetTileOwner(tile); // _current_company can be OWNER_WATER
1658  Train *v = NULL;
1659  if (HasStationReservation(tile)) {
1660  v = GetTrainForReservation(tile, track);
1661  if (v != NULL) FreeTrainTrackReservation(v);
1662  }
1663  if (!IsStationTileBlocked(tile)) Company::Get(owner)->infrastructure.rail[GetRailType(tile)]--;
1664  Company::Get(owner)->infrastructure.station--;
1665  DoClearSquare(tile);
1666  DeleteNewGRFInspectWindow(GSF_STATIONS, tile);
1667  AddTrackToSignalBuffer(tile, track, owner);
1668  YapfNotifyTrackLayoutChange(tile, track);
1669  if (v != NULL) TryPathReserve(v, true);
1670  }
1671  }
1672 
1673  if (flags & DC_EXEC) {
1674  st->rect.AfterRemoveRect(st, st->train_station);
1675 
1676  st->train_station.Clear();
1677 
1678  st->facilities &= ~FACIL_TRAIN;
1679 
1680  free(st->speclist);
1681  st->num_specs = 0;
1682  st->speclist = NULL;
1683  st->cached_anim_triggers = 0;
1684 
1687  st->UpdateVirtCoord();
1689  }
1690 
1691  return cost;
1692 }
1693 
1701 {
1702  /* if there is flooding, remove platforms tile by tile */
1703  if (_current_company == OWNER_WATER) {
1704  return DoCommand(tile, 0, 0, DC_EXEC, CMD_REMOVE_FROM_RAIL_STATION);
1705  }
1706 
1707  Station *st = Station::GetByTile(tile);
1708  CommandCost cost = RemoveRailStation(st, flags, _price[PR_CLEAR_STATION_RAIL]);
1709 
1710  if (flags & DC_EXEC) st->RecomputeIndustriesNear();
1711 
1712  return cost;
1713 }
1714 
1722 {
1723  /* if there is flooding, remove waypoints tile by tile */
1724  if (_current_company == OWNER_WATER) {
1725  return DoCommand(tile, 0, 0, DC_EXEC, CMD_REMOVE_FROM_RAIL_WAYPOINT);
1726  }
1727 
1728  return RemoveRailStation(Waypoint::GetByTile(tile), flags, _price[PR_CLEAR_WAYPOINT_RAIL]);
1729 }
1730 
1731 
1737 static RoadStop **FindRoadStopSpot(bool truck_station, Station *st)
1738 {
1739  RoadStop **primary_stop = (truck_station) ? &st->truck_stops : &st->bus_stops;
1740 
1741  if (*primary_stop == NULL) {
1742  /* we have no roadstop of the type yet, so write a "primary stop" */
1743  return primary_stop;
1744  } else {
1745  /* there are stops already, so append to the end of the list */
1746  RoadStop *stop = *primary_stop;
1747  while (stop->next != NULL) stop = stop->next;
1748  return &stop->next;
1749  }
1750 }
1751 
1753 
1763 static CommandCost FindJoiningRoadStop(StationID existing_stop, StationID station_to_join, bool adjacent, TileArea ta, Station **st)
1764 {
1765  return FindJoiningBaseStation<Station, STR_ERROR_MUST_REMOVE_ROAD_STOP_FIRST>(existing_stop, station_to_join, adjacent, ta, st);
1766 }
1767 
1784 CommandCost CmdBuildRoadStop(TileIndex tile, DoCommandFlag flags, uint32 p1, uint32 p2, const char *text)
1785 {
1786  bool type = HasBit(p2, 0);
1787  bool is_drive_through = HasBit(p2, 1);
1788  RoadTypes rts = Extract<RoadTypes, 2, 2>(p2);
1789  StationID station_to_join = GB(p2, 16, 16);
1790  bool reuse = (station_to_join != NEW_STATION);
1791  if (!reuse) station_to_join = INVALID_STATION;
1792  bool distant_join = (station_to_join != INVALID_STATION);
1793 
1794  uint8 width = (uint8)GB(p1, 0, 8);
1795  uint8 lenght = (uint8)GB(p1, 8, 8);
1796 
1797  /* Check if the requested road stop is too big */
1798  if (width > _settings_game.station.station_spread || lenght > _settings_game.station.station_spread) return_cmd_error(STR_ERROR_STATION_TOO_SPREAD_OUT);
1799  /* Check for incorrect width / length. */
1800  if (width == 0 || lenght == 0) return CMD_ERROR;
1801  /* Check if the first tile and the last tile are valid */
1802  if (!IsValidTile(tile) || TileAddWrap(tile, width - 1, lenght - 1) == INVALID_TILE) return CMD_ERROR;
1803 
1804  TileArea roadstop_area(tile, width, lenght);
1805 
1806  if (distant_join && (!_settings_game.station.distant_join_stations || !Station::IsValidID(station_to_join))) return CMD_ERROR;
1807 
1808  if (!HasExactlyOneBit(rts) || !HasRoadTypesAvail(_current_company, rts)) return CMD_ERROR;
1809 
1810  /* Trams only have drive through stops */
1811  if (!is_drive_through && HasBit(rts, ROADTYPE_TRAM)) return CMD_ERROR;
1812 
1813  DiagDirection ddir;
1814  Axis axis;
1815  if (is_drive_through) {
1816  /* By definition axis is valid, due to there being 2 axes and reading 1 bit. */
1817  axis = Extract<Axis, 6, 1>(p2);
1818  ddir = AxisToDiagDir(axis);
1819  } else {
1820  /* By definition ddir is valid, due to there being 4 diagonal directions and reading 2 bits. */
1821  ddir = Extract<DiagDirection, 6, 2>(p2);
1822  axis = DiagDirToAxis(ddir);
1823  }
1824 
1825  CommandCost ret = CheckIfAuthorityAllowsNewStation(tile, flags);
1826  if (ret.Failed()) return ret;
1827 
1828  /* Total road stop cost. */
1829  CommandCost cost(EXPENSES_CONSTRUCTION, roadstop_area.w * roadstop_area.h * _price[type ? PR_BUILD_STATION_TRUCK : PR_BUILD_STATION_BUS]);
1830  StationID est = INVALID_STATION;
1831  ret = CheckFlatLandRoadStop(roadstop_area, flags, is_drive_through ? 5 << axis : 1 << ddir, is_drive_through, type, axis, &est, rts);
1832  if (ret.Failed()) return ret;
1833  cost.AddCost(ret);
1834 
1835  Station *st = NULL;
1836  ret = FindJoiningRoadStop(est, station_to_join, HasBit(p2, 5), roadstop_area, &st);
1837  if (ret.Failed()) return ret;
1838 
1839  /* Check if this number of road stops can be allocated. */
1840  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);
1841 
1842  ret = BuildStationPart(&st, flags, reuse, roadstop_area, STATIONNAMING_ROAD);
1843  if (ret.Failed()) return ret;
1844 
1845  if (flags & DC_EXEC) {
1846  /* Check every tile in the area. */
1847  TILE_AREA_LOOP(cur_tile, roadstop_area) {
1848  RoadTypes cur_rts = GetRoadTypes(cur_tile);
1849  Owner road_owner = HasBit(cur_rts, ROADTYPE_ROAD) ? GetRoadOwner(cur_tile, ROADTYPE_ROAD) : _current_company;
1850  Owner tram_owner = HasBit(cur_rts, ROADTYPE_TRAM) ? GetRoadOwner(cur_tile, ROADTYPE_TRAM) : _current_company;
1851 
1852  if (IsTileType(cur_tile, MP_STATION) && IsRoadStop(cur_tile)) {
1853  RemoveRoadStop(cur_tile, flags);
1854  }
1855 
1856  RoadStop *road_stop = new RoadStop(cur_tile);
1857  /* Insert into linked list of RoadStops. */
1858  RoadStop **currstop = FindRoadStopSpot(type, st);
1859  *currstop = road_stop;
1860 
1861  if (type) {
1862  st->truck_station.Add(cur_tile);
1863  } else {
1864  st->bus_station.Add(cur_tile);
1865  }
1866 
1867  /* Initialize an empty station. */
1868  st->AddFacility((type) ? FACIL_TRUCK_STOP : FACIL_BUS_STOP, cur_tile);
1869 
1870  st->rect.BeforeAddTile(cur_tile, StationRect::ADD_TRY);
1871 
1872  RoadStopType rs_type = type ? ROADSTOP_TRUCK : ROADSTOP_BUS;
1873  if (is_drive_through) {
1874  /* Update company infrastructure counts. If the current tile is a normal
1875  * road tile, count only the new road bits needed to get a full diagonal road. */
1876  RoadType rt;
1877  FOR_EACH_SET_ROADTYPE(rt, cur_rts | rts) {
1878  Company *c = Company::GetIfValid(rt == ROADTYPE_ROAD ? road_owner : tram_owner);
1879  if (c != NULL) {
1880  c->infrastructure.road[rt] += 2 - (IsNormalRoadTile(cur_tile) && HasBit(cur_rts, rt) ? CountBits(GetRoadBits(cur_tile, rt)) : 0);
1882  }
1883  }
1884 
1885  MakeDriveThroughRoadStop(cur_tile, st->owner, road_owner, tram_owner, st->index, rs_type, rts | cur_rts, axis);
1886  road_stop->MakeDriveThrough();
1887  } else {
1888  /* Non-drive-through stop never overbuild and always count as two road bits. */
1889  Company::Get(st->owner)->infrastructure.road[FIND_FIRST_BIT(rts)] += 2;
1890  MakeRoadStop(cur_tile, st->owner, st->index, rs_type, rts, ddir);
1891  }
1892  Company::Get(st->owner)->infrastructure.station++;
1894 
1895  MarkTileDirtyByTile(cur_tile);
1896  }
1897  }
1898 
1899  if (st != NULL) {
1900  st->UpdateVirtCoord();
1901  UpdateStationAcceptance(st, false);
1906  }
1907  return cost;
1908 }
1909 
1910 
1911 static Vehicle *ClearRoadStopStatusEnum(Vehicle *v, void *)
1912 {
1913  if (v->type == VEH_ROAD) {
1914  /* Okay... we are a road vehicle on a drive through road stop.
1915  * But that road stop has just been removed, so we need to make
1916  * sure we are in a valid state... however, vehicles can also
1917  * turn on road stop tiles, so only clear the 'road stop' state
1918  * bits and only when the state was 'in road stop', otherwise
1919  * we'll end up clearing the turn around bits. */
1920  RoadVehicle *rv = RoadVehicle::From(v);
1922  }
1923 
1924  return NULL;
1925 }
1926 
1927 
1935 {
1936  Station *st = Station::GetByTile(tile);
1937 
1938  if (_current_company != OWNER_WATER) {
1939  CommandCost ret = CheckOwnership(st->owner);
1940  if (ret.Failed()) return ret;
1941  }
1942 
1943  bool is_truck = IsTruckStop(tile);
1944 
1945  RoadStop **primary_stop;
1946  RoadStop *cur_stop;
1947  if (is_truck) { // truck stop
1948  primary_stop = &st->truck_stops;
1949  cur_stop = RoadStop::GetByTile(tile, ROADSTOP_TRUCK);
1950  } else {
1951  primary_stop = &st->bus_stops;
1952  cur_stop = RoadStop::GetByTile(tile, ROADSTOP_BUS);
1953  }
1954 
1955  assert(cur_stop != NULL);
1956 
1957  /* don't do the check for drive-through road stops when company bankrupts */
1958  if (IsDriveThroughStopTile(tile) && (flags & DC_BANKRUPT)) {
1959  /* remove the 'going through road stop' status from all vehicles on that tile */
1960  if (flags & DC_EXEC) FindVehicleOnPos(tile, NULL, &ClearRoadStopStatusEnum);
1961  } else {
1963  if (ret.Failed()) return ret;
1964  }
1965 
1966  if (flags & DC_EXEC) {
1967  if (*primary_stop == cur_stop) {
1968  /* removed the first stop in the list */
1969  *primary_stop = cur_stop->next;
1970  /* removed the only stop? */
1971  if (*primary_stop == NULL) {
1972  st->facilities &= (is_truck ? ~FACIL_TRUCK_STOP : ~FACIL_BUS_STOP);
1973  }
1974  } else {
1975  /* tell the predecessor in the list to skip this stop */
1976  RoadStop *pred = *primary_stop;
1977  while (pred->next != cur_stop) pred = pred->next;
1978  pred->next = cur_stop->next;
1979  }
1980 
1981  /* Update company infrastructure counts. */
1982  RoadType rt;
1983  FOR_EACH_SET_ROADTYPE(rt, GetRoadTypes(tile)) {
1984  Company *c = Company::GetIfValid(GetRoadOwner(tile, rt));
1985  if (c != NULL) {
1986  c->infrastructure.road[rt] -= 2;
1988  }
1989  }
1990  Company::Get(st->owner)->infrastructure.station--;
1991 
1992  if (IsDriveThroughStopTile(tile)) {
1993  /* Clears the tile for us */
1994  cur_stop->ClearDriveThrough();
1995  } else {
1996  DoClearSquare(tile);
1997  }
1998 
2000  delete cur_stop;
2001 
2002  /* Make sure no vehicle is going to the old roadstop */
2003  RoadVehicle *v;
2004  FOR_ALL_ROADVEHICLES(v) {
2005  if (v->First() == v && v->current_order.IsType(OT_GOTO_STATION) &&
2006  v->dest_tile == tile) {
2008  }
2009  }
2010 
2011  st->rect.AfterRemoveTile(st, tile);
2012 
2013  st->UpdateVirtCoord();
2016 
2017  /* Update the tile area of the truck/bus stop */
2018  if (is_truck) {
2019  st->truck_station.Clear();
2020  for (const RoadStop *rs = st->truck_stops; rs != NULL; rs = rs->next) st->truck_station.Add(rs->xy);
2021  } else {
2022  st->bus_station.Clear();
2023  for (const RoadStop *rs = st->bus_stops; rs != NULL; rs = rs->next) st->bus_station.Add(rs->xy);
2024  }
2025  }
2026 
2027  return CommandCost(EXPENSES_CONSTRUCTION, _price[is_truck ? PR_CLEAR_STATION_TRUCK : PR_CLEAR_STATION_BUS]);
2028 }
2029 
2040 CommandCost CmdRemoveRoadStop(TileIndex tile, DoCommandFlag flags, uint32 p1, uint32 p2, const char *text)
2041 {
2042  uint8 width = (uint8)GB(p1, 0, 8);
2043  uint8 height = (uint8)GB(p1, 8, 8);
2044 
2045  /* Check for incorrect width / height. */
2046  if (width == 0 || height == 0) return CMD_ERROR;
2047  /* Check if the first tile and the last tile are valid */
2048  if (!IsValidTile(tile) || TileAddWrap(tile, width - 1, height - 1) == INVALID_TILE) return CMD_ERROR;
2049 
2050  TileArea roadstop_area(tile, width, height);
2051 
2052  int quantity = 0;
2054  TILE_AREA_LOOP(cur_tile, roadstop_area) {
2055  /* Make sure the specified tile is a road stop of the correct type */
2056  if (!IsTileType(cur_tile, MP_STATION) || !IsRoadStop(cur_tile) || (uint32)GetRoadStopType(cur_tile) != GB(p2, 0, 1)) continue;
2057 
2058  /* Save the stop info before it is removed */
2059  bool is_drive_through = IsDriveThroughStopTile(cur_tile);
2060  RoadTypes rts = GetRoadTypes(cur_tile);
2061  RoadBits road_bits = IsDriveThroughStopTile(cur_tile) ?
2062  ((GetRoadStopDir(cur_tile) == DIAGDIR_NE) ? ROAD_X : ROAD_Y) :
2063  DiagDirToRoadBits(GetRoadStopDir(cur_tile));
2064 
2065  Owner road_owner = GetRoadOwner(cur_tile, ROADTYPE_ROAD);
2066  Owner tram_owner = GetRoadOwner(cur_tile, ROADTYPE_TRAM);
2067  CommandCost ret = RemoveRoadStop(cur_tile, flags);
2068  if (ret.Failed()) return ret;
2069  cost.AddCost(ret);
2070 
2071  quantity++;
2072  /* If the stop was a drive-through stop replace the road */
2073  if ((flags & DC_EXEC) && is_drive_through) {
2074  MakeRoadNormal(cur_tile, road_bits, rts, ClosestTownFromTile(cur_tile, UINT_MAX)->index,
2075  road_owner, tram_owner);
2076 
2077  /* Update company infrastructure counts. */
2078  RoadType rt;
2079  FOR_EACH_SET_ROADTYPE(rt, rts) {
2080  Company *c = Company::GetIfValid(GetRoadOwner(cur_tile, rt));
2081  if (c != NULL) {
2082  c->infrastructure.road[rt] += CountBits(road_bits);
2084  }
2085  }
2086  }
2087  }
2088 
2089  if (quantity == 0) return_cmd_error(STR_ERROR_THERE_IS_NO_STATION);
2090 
2091  return cost;
2092 }
2093 
2101 {
2102  uint mindist = UINT_MAX;
2103 
2104  for (TileIndex cur_tile = it; cur_tile != INVALID_TILE; cur_tile = ++it) {
2105  mindist = min(mindist, DistanceManhattan(town_tile, cur_tile));
2106  }
2107 
2108  return mindist;
2109 }
2110 
2121 {
2122  /* 0 cannot be accounted, and 1 is the lowest that can be reduced from town.
2123  * So no need to go any further*/
2124  if (as->noise_level < 2) return as->noise_level;
2125 
2126  uint distance = GetMinimalAirportDistanceToTile(it, town_tile);
2127 
2128  /* The steps for measuring noise reduction are based on the "magical" (and arbitrary) 8 base distance
2129  * adding the town_council_tolerance 4 times, as a way to graduate, depending of the tolerance.
2130  * Basically, it says that the less tolerant a town is, the bigger the distance before
2131  * an actual decrease can be granted */
2132  uint8 town_tolerance_distance = 8 + (_settings_game.difficulty.town_council_tolerance * 4);
2133 
2134  /* now, we want to have the distance segmented using the distance judged bareable by town
2135  * This will give us the coefficient of reduction the distance provides. */
2136  uint noise_reduction = distance / town_tolerance_distance;
2137 
2138  /* If the noise reduction equals the airport noise itself, don't give it for free.
2139  * Otherwise, simply reduce the airport's level. */
2140  return noise_reduction >= as->noise_level ? 1 : as->noise_level - noise_reduction;
2141 }
2142 
2151 {
2152  Town *t, *nearest = NULL;
2153  uint add = as->size_x + as->size_y - 2; // GetMinimalAirportDistanceToTile can differ from DistanceManhattan by this much
2154  uint mindist = UINT_MAX - add; // prevent overflow
2155  FOR_ALL_TOWNS(t) {
2156  if (DistanceManhattan(t->xy, it) < mindist + add) { // avoid calling GetMinimalAirportDistanceToTile too often
2157  TileIterator *copy = it.Clone();
2158  uint dist = GetMinimalAirportDistanceToTile(*copy, t->xy);
2159  delete copy;
2160  if (dist < mindist) {
2161  nearest = t;
2162  mindist = dist;
2163  }
2164  }
2165  }
2166 
2167  return nearest;
2168 }
2169 
2170 
2173 {
2174  Town *t;
2175  const Station *st;
2176 
2177  FOR_ALL_TOWNS(t) t->noise_reached = 0;
2178 
2179  FOR_ALL_STATIONS(st) {
2180  if (st->airport.tile != INVALID_TILE && st->airport.type != AT_OILRIG) {
2181  const AirportSpec *as = st->airport.GetSpec();
2182  AirportTileIterator it(st);
2183  Town *nearest = AirportGetNearestTown(as, it);
2184  nearest->noise_reached += GetAirportNoiseLevelForTown(as, it, nearest->xy);
2185  }
2186  }
2187 }
2188 
2202 CommandCost CmdBuildAirport(TileIndex tile, DoCommandFlag flags, uint32 p1, uint32 p2, const char *text)
2203 {
2204  StationID station_to_join = GB(p2, 16, 16);
2205  bool reuse = (station_to_join != NEW_STATION);
2206  if (!reuse) station_to_join = INVALID_STATION;
2207  bool distant_join = (station_to_join != INVALID_STATION);
2208  byte airport_type = GB(p1, 0, 8);
2209  byte layout = GB(p1, 8, 8);
2210 
2211  if (distant_join && (!_settings_game.station.distant_join_stations || !Station::IsValidID(station_to_join))) return CMD_ERROR;
2212 
2213  if (airport_type >= NUM_AIRPORTS) return CMD_ERROR;
2214 
2215  CommandCost ret = CheckIfAuthorityAllowsNewStation(tile, flags);
2216  if (ret.Failed()) return ret;
2217 
2218  /* Check if a valid, buildable airport was chosen for construction */
2219  const AirportSpec *as = AirportSpec::Get(airport_type);
2220  if (!as->IsAvailable() || layout >= as->num_table) return CMD_ERROR;
2221 
2222  Direction rotation = as->rotation[layout];
2223  int w = as->size_x;
2224  int h = as->size_y;
2225  if (rotation == DIR_E || rotation == DIR_W) Swap(w, h);
2226  TileArea airport_area = TileArea(tile, w, h);
2227 
2229  return_cmd_error(STR_ERROR_STATION_TOO_SPREAD_OUT);
2230  }
2231 
2232  CommandCost cost = CheckFlatLand(airport_area, flags);
2233  if (cost.Failed()) return cost;
2234 
2235  /* The noise level is the noise from the airport and reduce it to account for the distance to the town center. */
2236  AirportTileTableIterator iter(as->table[layout], tile);
2237  Town *nearest = AirportGetNearestTown(as, iter);
2238  uint newnoise_level = GetAirportNoiseLevelForTown(as, iter, nearest->xy);
2239 
2240  /* Check if local auth would allow a new airport */
2241  StringID authority_refuse_message = STR_NULL;
2242  Town *authority_refuse_town = NULL;
2243 
2245  /* do not allow to build a new airport if this raise the town noise over the maximum allowed by town */
2246  if ((nearest->noise_reached + newnoise_level) > nearest->MaxTownNoise()) {
2247  authority_refuse_message = STR_ERROR_LOCAL_AUTHORITY_REFUSES_NOISE;
2248  authority_refuse_town = nearest;
2249  }
2250  } else {
2251  Town *t = ClosestTownFromTile(tile, UINT_MAX);
2252  uint num = 0;
2253  const Station *st;
2254  FOR_ALL_STATIONS(st) {
2255  if (st->town == t && (st->facilities & FACIL_AIRPORT) && st->airport.type != AT_OILRIG) num++;
2256  }
2257  if (num >= 2) {
2258  authority_refuse_message = STR_ERROR_LOCAL_AUTHORITY_REFUSES_AIRPORT;
2259  authority_refuse_town = t;
2260  }
2261  }
2262 
2263  if (authority_refuse_message != STR_NULL) {
2264  SetDParam(0, authority_refuse_town->index);
2265  return_cmd_error(authority_refuse_message);
2266  }
2267 
2268  Station *st = NULL;
2269  ret = FindJoiningStation(INVALID_STATION, station_to_join, HasBit(p2, 0), airport_area, &st);
2270  if (ret.Failed()) return ret;
2271 
2272  /* Distant join */
2273  if (st == NULL && distant_join) st = Station::GetIfValid(station_to_join);
2274 
2275  ret = BuildStationPart(&st, flags, reuse, airport_area, (GetAirport(airport_type)->flags & AirportFTAClass::AIRPLANES) ? STATIONNAMING_AIRPORT : STATIONNAMING_HELIPORT);
2276  if (ret.Failed()) return ret;
2277 
2278  if (st != NULL && st->airport.tile != INVALID_TILE) {
2279  return_cmd_error(STR_ERROR_TOO_CLOSE_TO_ANOTHER_AIRPORT);
2280  }
2281 
2282  for (AirportTileTableIterator iter(as->table[layout], tile); iter != INVALID_TILE; ++iter) {
2283  cost.AddCost(_price[PR_BUILD_STATION_AIRPORT]);
2284  }
2285 
2286  if (flags & DC_EXEC) {
2287  /* Always add the noise, so there will be no need to recalculate when option toggles */
2288  nearest->noise_reached += newnoise_level;
2289 
2290  st->AddFacility(FACIL_AIRPORT, tile);
2291  st->airport.type = airport_type;
2292  st->airport.layout = layout;
2293  st->airport.flags = 0;
2294  st->airport.rotation = rotation;
2295 
2296  st->rect.BeforeAddRect(tile, w, h, StationRect::ADD_TRY);
2297 
2298  for (AirportTileTableIterator iter(as->table[layout], tile); iter != INVALID_TILE; ++iter) {
2299  MakeAirport(iter, st->owner, st->index, iter.GetStationGfx(), WATER_CLASS_INVALID);
2300  SetStationTileRandomBits(iter, GB(Random(), 0, 4));
2301  st->airport.Add(iter);
2302 
2304  }
2305 
2306  /* Only call the animation trigger after all tiles have been built */
2307  for (AirportTileTableIterator iter(as->table[layout], tile); iter != INVALID_TILE; ++iter) {
2308  AirportTileAnimationTrigger(st, iter, AAT_BUILT);
2309  }
2310 
2312 
2313  Company::Get(st->owner)->infrastructure.airport++;
2315 
2316  st->UpdateVirtCoord();
2317  UpdateStationAcceptance(st, false);
2322 
2325  }
2326  }
2327 
2328  return cost;
2329 }
2330 
2338 {
2339  Station *st = Station::GetByTile(tile);
2340 
2341  if (_current_company != OWNER_WATER) {
2342  CommandCost ret = CheckOwnership(st->owner);
2343  if (ret.Failed()) return ret;
2344  }
2345 
2346  tile = st->airport.tile;
2347 
2349 
2350  const Aircraft *a;
2351  FOR_ALL_AIRCRAFT(a) {
2352  if (!a->IsNormalAircraft()) continue;
2353  if (a->targetairport == st->index && a->state != FLYING) return CMD_ERROR;
2354  }
2355 
2356  if (flags & DC_EXEC) {
2357  const AirportSpec *as = st->airport.GetSpec();
2358  /* The noise level is the noise from the airport and reduce it to account for the distance to the town center.
2359  * And as for construction, always remove it, even if the setting is not set, in order to avoid the
2360  * need of recalculation */
2361  AirportTileIterator it(st);
2362  Town *nearest = AirportGetNearestTown(as, it);
2363  nearest->noise_reached -= GetAirportNoiseLevelForTown(as, it, nearest->xy);
2364  }
2365 
2366  TILE_AREA_LOOP(tile_cur, st->airport) {
2367  if (!st->TileBelongsToAirport(tile_cur)) continue;
2368 
2369  CommandCost ret = EnsureNoVehicleOnGround(tile_cur);
2370  if (ret.Failed()) return ret;
2371 
2372  cost.AddCost(_price[PR_CLEAR_STATION_AIRPORT]);
2373 
2374  if (flags & DC_EXEC) {
2375  if (IsHangarTile(tile_cur)) OrderBackup::Reset(tile_cur, false);
2376  DeleteAnimatedTile(tile_cur);
2377  DoClearSquare(tile_cur);
2378  DeleteNewGRFInspectWindow(GSF_AIRPORTTILES, tile_cur);
2379  }
2380  }
2381 
2382  if (flags & DC_EXEC) {
2383  /* Clear the persistent storage. */
2384  delete st->airport.psa;
2385 
2386  for (uint i = 0; i < st->airport.GetNumHangars(); ++i) {
2389  );
2390  }
2391 
2392  st->rect.AfterRemoveRect(st, st->airport);
2393 
2394  st->airport.Clear();
2395  st->facilities &= ~FACIL_AIRPORT;
2396 
2398 
2401  }
2402 
2403  Company::Get(st->owner)->infrastructure.airport--;
2405 
2406  st->UpdateVirtCoord();
2409  DeleteNewGRFInspectWindow(GSF_AIRPORTS, st->index);
2410  }
2411 
2412  return cost;
2413 }
2414 
2424 CommandCost CmdOpenCloseAirport(TileIndex tile, DoCommandFlag flags, uint32 p1, uint32 p2, const char *text)
2425 {
2426  if (!Station::IsValidID(p1)) return CMD_ERROR;
2427  Station *st = Station::Get(p1);
2428 
2429  if (!(st->facilities & FACIL_AIRPORT) || st->owner == OWNER_NONE) return CMD_ERROR;
2430 
2431  CommandCost ret = CheckOwnership(st->owner);
2432  if (ret.Failed()) return ret;
2433 
2434  if (flags & DC_EXEC) {
2437  }
2438  return CommandCost();
2439 }
2440 
2447 bool HasStationInUse(StationID station, bool include_company, CompanyID company)
2448 {
2449  const Vehicle *v;
2450  FOR_ALL_VEHICLES(v) {
2451  if ((v->owner == company) == include_company) {
2452  const Order *order;
2453  FOR_VEHICLE_ORDERS(v, order) {
2454  if ((order->IsType(OT_GOTO_STATION) || order->IsType(OT_GOTO_WAYPOINT)) && order->GetDestination() == station) {
2455  return true;
2456  }
2457  }
2458  }
2459  }
2460  return false;
2461 }
2462 
2463 static const TileIndexDiffC _dock_tileoffs_chkaround[] = {
2464  {-1, 0},
2465  { 0, 0},
2466  { 0, 0},
2467  { 0, -1}
2468 };
2469 static const byte _dock_w_chk[4] = { 2, 1, 2, 1 };
2470 static const byte _dock_h_chk[4] = { 1, 2, 1, 2 };
2471 
2481 CommandCost CmdBuildDock(TileIndex tile, DoCommandFlag flags, uint32 p1, uint32 p2, const char *text)
2482 {
2483  StationID station_to_join = GB(p2, 16, 16);
2484  bool reuse = (station_to_join != NEW_STATION);
2485  if (!reuse) station_to_join = INVALID_STATION;
2486  bool distant_join = (station_to_join != INVALID_STATION);
2487 
2488  if (distant_join && (!_settings_game.station.distant_join_stations || !Station::IsValidID(station_to_join))) return CMD_ERROR;
2489 
2491  if (direction == INVALID_DIAGDIR) return_cmd_error(STR_ERROR_SITE_UNSUITABLE);
2492  direction = ReverseDiagDir(direction);
2493 
2494  /* Docks cannot be placed on rapids */
2495  if (HasTileWaterGround(tile)) return_cmd_error(STR_ERROR_SITE_UNSUITABLE);
2496 
2497  CommandCost ret = CheckIfAuthorityAllowsNewStation(tile, flags);
2498  if (ret.Failed()) return ret;
2499 
2500  if (IsBridgeAbove(tile)) return_cmd_error(STR_ERROR_MUST_DEMOLISH_BRIDGE_FIRST);
2501 
2502  ret = DoCommand(tile, 0, 0, flags, CMD_LANDSCAPE_CLEAR);
2503  if (ret.Failed()) return ret;
2504 
2505  TileIndex tile_cur = tile + TileOffsByDiagDir(direction);
2506 
2507  if (!IsTileType(tile_cur, MP_WATER) || !IsTileFlat(tile_cur)) {
2508  return_cmd_error(STR_ERROR_SITE_UNSUITABLE);
2509  }
2510 
2511  if (IsBridgeAbove(tile_cur)) return_cmd_error(STR_ERROR_MUST_DEMOLISH_BRIDGE_FIRST);
2512 
2513  /* Get the water class of the water tile before it is cleared.*/
2514  WaterClass wc = GetWaterClass(tile_cur);
2515 
2516  ret = DoCommand(tile_cur, 0, 0, flags, CMD_LANDSCAPE_CLEAR);
2517  if (ret.Failed()) return ret;
2518 
2519  tile_cur += TileOffsByDiagDir(direction);
2520  if (!IsTileType(tile_cur, MP_WATER) || !IsTileFlat(tile_cur)) {
2521  return_cmd_error(STR_ERROR_SITE_UNSUITABLE);
2522  }
2523 
2524  TileArea dock_area = TileArea(tile + ToTileIndexDiff(_dock_tileoffs_chkaround[direction]),
2525  _dock_w_chk[direction], _dock_h_chk[direction]);
2526 
2527  /* middle */
2528  Station *st = NULL;
2529  ret = FindJoiningStation(INVALID_STATION, station_to_join, HasBit(p1, 0), dock_area, &st);
2530  if (ret.Failed()) return ret;
2531 
2532  /* Distant join */
2533  if (st == NULL && distant_join) st = Station::GetIfValid(station_to_join);
2534 
2535  ret = BuildStationPart(&st, flags, reuse, dock_area, STATIONNAMING_DOCK);
2536  if (ret.Failed()) return ret;
2537 
2538  if (st != NULL && st->dock_tile != INVALID_TILE) return_cmd_error(STR_ERROR_TOO_CLOSE_TO_ANOTHER_DOCK);
2539 
2540  if (flags & DC_EXEC) {
2541  st->dock_tile = tile;
2542  st->AddFacility(FACIL_DOCK, tile);
2543 
2544  st->rect.BeforeAddRect(dock_area.tile, dock_area.w, dock_area.h, StationRect::ADD_TRY);
2545 
2546  /* If the water part of the dock is on a canal, update infrastructure counts.
2547  * This is needed as we've unconditionally cleared that tile before. */
2548  if (wc == WATER_CLASS_CANAL) {
2549  Company::Get(st->owner)->infrastructure.water++;
2550  }
2551  Company::Get(st->owner)->infrastructure.station += 2;
2553 
2554  MakeDock(tile, st->owner, st->index, direction, wc);
2555 
2556  st->UpdateVirtCoord();
2557  UpdateStationAcceptance(st, false);
2562  }
2563 
2564  return CommandCost(EXPENSES_CONSTRUCTION, _price[PR_BUILD_STATION_DOCK]);
2565 }
2566 
2574 {
2575  Station *st = Station::GetByTile(tile);
2576  CommandCost ret = CheckOwnership(st->owner);
2577  if (ret.Failed()) return ret;
2578 
2579  TileIndex docking_location = TILE_ADD(st->dock_tile, ToTileIndexDiff(GetDockOffset(st->dock_tile)));
2580 
2581  TileIndex tile1 = st->dock_tile;
2582  TileIndex tile2 = tile1 + TileOffsByDiagDir(GetDockDirection(tile1));
2583 
2584  ret = EnsureNoVehicleOnGround(tile1);
2585  if (ret.Succeeded()) ret = EnsureNoVehicleOnGround(tile2);
2586  if (ret.Failed()) return ret;
2587 
2588  if (flags & DC_EXEC) {
2589  DoClearSquare(tile1);
2590  MarkTileDirtyByTile(tile1);
2591  MakeWaterKeepingClass(tile2, st->owner);
2592 
2593  st->rect.AfterRemoveTile(st, tile1);
2594  st->rect.AfterRemoveTile(st, tile2);
2595 
2596  st->dock_tile = INVALID_TILE;
2597  st->facilities &= ~FACIL_DOCK;
2598 
2599  Company::Get(st->owner)->infrastructure.station -= 2;
2601 
2603  st->UpdateVirtCoord();
2606 
2607  /* All ships that were going to our station, can't go to it anymore.
2608  * Just clear the order, then automatically the next appropriate order
2609  * will be selected and in case of no appropriate order it will just
2610  * wander around the world. */
2611  Ship *s;
2612  FOR_ALL_SHIPS(s) {
2613  if (s->current_order.IsType(OT_LOADING) && s->tile == docking_location) {
2614  s->LeaveStation();
2615  }
2616 
2617  if (s->dest_tile == docking_location) {
2618  s->dest_tile = 0;
2619  s->current_order.Free();
2620  }
2621  }
2622  }
2623 
2624  return CommandCost(EXPENSES_CONSTRUCTION, _price[PR_CLEAR_STATION_DOCK]);
2625 }
2626 
2627 #include "table/station_land.h"
2628 
2629 const DrawTileSprites *GetStationTileLayout(StationType st, byte gfx)
2630 {
2631  return &_station_display_datas[st][gfx];
2632 }
2633 
2643 bool SplitGroundSpriteForOverlay(const TileInfo *ti, SpriteID *ground, RailTrackOffset *overlay_offset)
2644 {
2645  bool snow_desert;
2646  switch (*ground) {
2647  case SPR_RAIL_TRACK_X:
2648  snow_desert = false;
2649  *overlay_offset = RTO_X;
2650  break;
2651 
2652  case SPR_RAIL_TRACK_Y:
2653  snow_desert = false;
2654  *overlay_offset = RTO_Y;
2655  break;
2656 
2657  case SPR_RAIL_TRACK_X_SNOW:
2658  snow_desert = true;
2659  *overlay_offset = RTO_X;
2660  break;
2661 
2662  case SPR_RAIL_TRACK_Y_SNOW:
2663  snow_desert = true;
2664  *overlay_offset = RTO_Y;
2665  break;
2666 
2667  default:
2668  return false;
2669  }
2670 
2671  if (ti != NULL) {
2672  /* Decide snow/desert from tile */
2674  case LT_ARCTIC:
2675  snow_desert = (uint)ti->z > GetSnowLine() * TILE_HEIGHT;
2676  break;
2677 
2678  case LT_TROPIC:
2679  snow_desert = GetTropicZone(ti->tile) == TROPICZONE_DESERT;
2680  break;
2681 
2682  default:
2683  break;
2684  }
2685  }
2686 
2687  *ground = snow_desert ? SPR_FLAT_SNOW_DESERT_TILE : SPR_FLAT_GRASS_TILE;
2688  return true;
2689 }
2690 
2691 static void DrawTile_Station(TileInfo *ti)
2692 {
2693  const NewGRFSpriteLayout *layout = NULL;
2694  DrawTileSprites tmp_rail_layout;
2695  const DrawTileSprites *t = NULL;
2696  RoadTypes roadtypes;
2697  int32 total_offset;
2698  const RailtypeInfo *rti = NULL;
2699  uint32 relocation = 0;
2700  uint32 ground_relocation = 0;
2701  BaseStation *st = NULL;
2702  const StationSpec *statspec = NULL;
2703  uint tile_layout = 0;
2704 
2705  if (HasStationRail(ti->tile)) {
2706  rti = GetRailTypeInfo(GetRailType(ti->tile));
2707  roadtypes = ROADTYPES_NONE;
2708  total_offset = rti->GetRailtypeSpriteOffset();
2709 
2710  if (IsCustomStationSpecIndex(ti->tile)) {
2711  /* look for customization */
2712  st = BaseStation::GetByTile(ti->tile);
2713  statspec = st->speclist[GetCustomStationSpecIndex(ti->tile)].spec;
2714 
2715  if (statspec != NULL) {
2716  tile_layout = GetStationGfx(ti->tile);
2717 
2719  uint16 callback = GetStationCallback(CBID_STATION_SPRITE_LAYOUT, 0, 0, statspec, st, ti->tile);
2720  if (callback != CALLBACK_FAILED) tile_layout = (callback & ~1) + GetRailStationAxis(ti->tile);
2721  }
2722 
2723  /* Ensure the chosen tile layout is valid for this custom station */
2724  if (statspec->renderdata != NULL) {
2725  layout = &statspec->renderdata[tile_layout < statspec->tiles ? tile_layout : (uint)GetRailStationAxis(ti->tile)];
2726  if (!layout->NeedsPreprocessing()) {
2727  t = layout;
2728  layout = NULL;
2729  }
2730  }
2731  }
2732  }
2733  } else {
2734  roadtypes = IsRoadStop(ti->tile) ? GetRoadTypes(ti->tile) : ROADTYPES_NONE;
2735  total_offset = 0;
2736  }
2737 
2738  StationGfx gfx = GetStationGfx(ti->tile);
2739  if (IsAirport(ti->tile)) {
2740  gfx = GetAirportGfx(ti->tile);
2741  if (gfx >= NEW_AIRPORTTILE_OFFSET) {
2742  const AirportTileSpec *ats = AirportTileSpec::Get(gfx);
2743  if (ats->grf_prop.spritegroup[0] != NULL && DrawNewAirportTile(ti, Station::GetByTile(ti->tile), gfx, ats)) {
2744  return;
2745  }
2746  /* No sprite group (or no valid one) found, meaning no graphics associated.
2747  * Use the substitute one instead */
2748  assert(ats->grf_prop.subst_id != INVALID_AIRPORTTILE);
2749  gfx = ats->grf_prop.subst_id;
2750  }
2751  switch (gfx) {
2752  case APT_RADAR_GRASS_FENCE_SW:
2753  t = &_station_display_datas_airport_radar_grass_fence_sw[GetAnimationFrame(ti->tile)];
2754  break;
2755  case APT_GRASS_FENCE_NE_FLAG:
2756  t = &_station_display_datas_airport_flag_grass_fence_ne[GetAnimationFrame(ti->tile)];
2757  break;
2758  case APT_RADAR_FENCE_SW:
2759  t = &_station_display_datas_airport_radar_fence_sw[GetAnimationFrame(ti->tile)];
2760  break;
2761  case APT_RADAR_FENCE_NE:
2762  t = &_station_display_datas_airport_radar_fence_ne[GetAnimationFrame(ti->tile)];
2763  break;
2764  case APT_GRASS_FENCE_NE_FLAG_2:
2765  t = &_station_display_datas_airport_flag_grass_fence_ne_2[GetAnimationFrame(ti->tile)];
2766  break;
2767  }
2768  }
2769 
2770  Owner owner = GetTileOwner(ti->tile);
2771 
2772  PaletteID palette;
2773  if (Company::IsValidID(owner)) {
2774  palette = COMPANY_SPRITE_COLOUR(owner);
2775  } else {
2776  /* Some stations are not owner by a company, namely oil rigs */
2777  palette = PALETTE_TO_GREY;
2778  }
2779 
2780  if (layout == NULL && (t == NULL || t->seq == NULL)) t = GetStationTileLayout(GetStationType(ti->tile), gfx);
2781 
2782  /* don't show foundation for docks */
2783  if (ti->tileh != SLOPE_FLAT && !IsDock(ti->tile)) {
2784  if (statspec != NULL && HasBit(statspec->flags, SSF_CUSTOM_FOUNDATIONS)) {
2785  /* Station has custom foundations.
2786  * Check whether the foundation continues beyond the tile's upper sides. */
2787  uint edge_info = 0;
2788  int z;
2789  Slope slope = GetFoundationPixelSlope(ti->tile, &z);
2790  if (!HasFoundationNW(ti->tile, slope, z)) SetBit(edge_info, 0);
2791  if (!HasFoundationNE(ti->tile, slope, z)) SetBit(edge_info, 1);
2792  SpriteID image = GetCustomStationFoundationRelocation(statspec, st, ti->tile, tile_layout, edge_info);
2793  if (image == 0) goto draw_default_foundation;
2794 
2795  if (HasBit(statspec->flags, SSF_EXTENDED_FOUNDATIONS)) {
2796  /* Station provides extended foundations. */
2797 
2798  static const uint8 foundation_parts[] = {
2799  0, 0, 0, 0, // Invalid, Invalid, Invalid, SLOPE_SW
2800  0, 1, 2, 3, // Invalid, SLOPE_EW, SLOPE_SE, SLOPE_WSE
2801  0, 4, 5, 6, // Invalid, SLOPE_NW, SLOPE_NS, SLOPE_NWS
2802  7, 8, 9 // SLOPE_NE, SLOPE_ENW, SLOPE_SEN
2803  };
2804 
2805  AddSortableSpriteToDraw(image + foundation_parts[ti->tileh], PAL_NONE, ti->x, ti->y, 16, 16, 7, ti->z);
2806  } else {
2807  /* Draw simple foundations, built up from 8 possible foundation sprites. */
2808 
2809  /* Each set bit represents one of the eight composite sprites to be drawn.
2810  * 'Invalid' entries will not drawn but are included for completeness. */
2811  static const uint8 composite_foundation_parts[] = {
2812  /* Invalid (00000000), Invalid (11010001), Invalid (11100100), SLOPE_SW (11100000) */
2813  0x00, 0xD1, 0xE4, 0xE0,
2814  /* Invalid (11001010), SLOPE_EW (11001001), SLOPE_SE (11000100), SLOPE_WSE (11000000) */
2815  0xCA, 0xC9, 0xC4, 0xC0,
2816  /* Invalid (11010010), SLOPE_NW (10010001), SLOPE_NS (11100100), SLOPE_NWS (10100000) */
2817  0xD2, 0x91, 0xE4, 0xA0,
2818  /* SLOPE_NE (01001010), SLOPE_ENW (00001001), SLOPE_SEN (01000100) */
2819  0x4A, 0x09, 0x44
2820  };
2821 
2822  uint8 parts = composite_foundation_parts[ti->tileh];
2823 
2824  /* If foundations continue beyond the tile's upper sides then
2825  * mask out the last two pieces. */
2826  if (HasBit(edge_info, 0)) ClrBit(parts, 6);
2827  if (HasBit(edge_info, 1)) ClrBit(parts, 7);
2828 
2829  if (parts == 0) {
2830  /* We always have to draw at least one sprite to make sure there is a boundingbox and a sprite with the
2831  * correct offset for the childsprites.
2832  * So, draw the (completely empty) sprite of the default foundations. */
2833  goto draw_default_foundation;
2834  }
2835 
2837  for (int i = 0; i < 8; i++) {
2838  if (HasBit(parts, i)) {
2839  AddSortableSpriteToDraw(image + i, PAL_NONE, ti->x, ti->y, 16, 16, 7, ti->z);
2840  }
2841  }
2842  EndSpriteCombine();
2843  }
2844 
2845  OffsetGroundSprite(31, 1);
2847  } else {
2848 draw_default_foundation:
2850  }
2851  }
2852 
2853  if (IsBuoy(ti->tile)) {
2854  DrawWaterClassGround(ti);
2855  SpriteID sprite = GetCanalSprite(CF_BUOY, ti->tile);
2856  if (sprite != 0) total_offset = sprite - SPR_IMG_BUOY;
2857  } else if (IsDock(ti->tile) || (IsOilRig(ti->tile) && IsTileOnWater(ti->tile))) {
2858  if (ti->tileh == SLOPE_FLAT) {
2859  DrawWaterClassGround(ti);
2860  } else {
2861  assert(IsDock(ti->tile));
2862  TileIndex water_tile = ti->tile + TileOffsByDiagDir(GetDockDirection(ti->tile));
2863  WaterClass wc = GetWaterClass(water_tile);
2864  if (wc == WATER_CLASS_SEA) {
2865  DrawShoreTile(ti->tileh);
2866  } else {
2867  DrawClearLandTile(ti, 3);
2868  }
2869  }
2870  } else {
2871  if (layout != NULL) {
2872  /* Sprite layout which needs preprocessing */
2873  bool separate_ground = HasBit(statspec->flags, SSF_SEPARATE_GROUND);
2874  uint32 var10_values = layout->PrepareLayout(total_offset, rti->fallback_railtype, 0, 0, separate_ground);
2875  uint8 var10;
2876  FOR_EACH_SET_BIT(var10, var10_values) {
2877  uint32 var10_relocation = GetCustomStationRelocation(statspec, st, ti->tile, var10);
2878  layout->ProcessRegisters(var10, var10_relocation, separate_ground);
2879  }
2880  tmp_rail_layout.seq = layout->GetLayout(&tmp_rail_layout.ground);
2881  t = &tmp_rail_layout;
2882  total_offset = 0;
2883  } else if (statspec != NULL) {
2884  /* Simple sprite layout */
2885  ground_relocation = relocation = GetCustomStationRelocation(statspec, st, ti->tile, 0);
2886  if (HasBit(statspec->flags, SSF_SEPARATE_GROUND)) {
2887  ground_relocation = GetCustomStationRelocation(statspec, st, ti->tile, 1);
2888  }
2889  ground_relocation += rti->fallback_railtype;
2890  }
2891 
2892  SpriteID image = t->ground.sprite;
2893  PaletteID pal = t->ground.pal;
2894  RailTrackOffset overlay_offset;
2895  if (rti != NULL && rti->UsesOverlay() && SplitGroundSpriteForOverlay(ti, &image, &overlay_offset)) {
2896  SpriteID ground = GetCustomRailSprite(rti, ti->tile, RTSG_GROUND);
2897  DrawGroundSprite(image, PAL_NONE);
2898  DrawGroundSprite(ground + overlay_offset, PAL_NONE);
2899 
2900  if (_game_mode != GM_MENU && _settings_client.gui.show_track_reservation && HasStationReservation(ti->tile)) {
2901  SpriteID overlay = GetCustomRailSprite(rti, ti->tile, RTSG_OVERLAY);
2902  DrawGroundSprite(overlay + overlay_offset, PALETTE_CRASH);
2903  }
2904  } else {
2905  image += HasBit(image, SPRITE_MODIFIER_CUSTOM_SPRITE) ? ground_relocation : total_offset;
2906  if (HasBit(pal, SPRITE_MODIFIER_CUSTOM_SPRITE)) pal += ground_relocation;
2907  DrawGroundSprite(image, GroundSpritePaletteTransform(image, pal, palette));
2908 
2909  /* PBS debugging, draw reserved tracks darker */
2910  if (_game_mode != GM_MENU && _settings_client.gui.show_track_reservation && HasStationRail(ti->tile) && HasStationReservation(ti->tile)) {
2911  const RailtypeInfo *rti = GetRailTypeInfo(GetRailType(ti->tile));
2913  }
2914  }
2915  }
2916 
2918 
2919  if (HasBit(roadtypes, ROADTYPE_TRAM)) {
2920  Axis axis = GetRoadStopDir(ti->tile) == DIAGDIR_NE ? AXIS_X : AXIS_Y;
2921  DrawGroundSprite((HasBit(roadtypes, ROADTYPE_ROAD) ? SPR_TRAMWAY_OVERLAY : SPR_TRAMWAY_TRAM) + (axis ^ 1), PAL_NONE);
2922  DrawTramCatenary(ti, axis == AXIS_X ? ROAD_X : ROAD_Y);
2923  }
2924 
2925  if (IsRailWaypoint(ti->tile)) {
2926  /* Don't offset the waypoint graphics; they're always the same. */
2927  total_offset = 0;
2928  }
2929 
2930  DrawRailTileSeq(ti, t, TO_BUILDINGS, total_offset, relocation, palette);
2931 }
2932 
2933 void StationPickerDrawSprite(int x, int y, StationType st, RailType railtype, RoadType roadtype, int image)
2934 {
2935  int32 total_offset = 0;
2936  PaletteID pal = COMPANY_SPRITE_COLOUR(_local_company);
2937  const DrawTileSprites *t = GetStationTileLayout(st, image);
2938  const RailtypeInfo *rti = NULL;
2939 
2940  if (railtype != INVALID_RAILTYPE) {
2941  rti = GetRailTypeInfo(railtype);
2942  total_offset = rti->GetRailtypeSpriteOffset();
2943  }
2944 
2945  SpriteID img = t->ground.sprite;
2946  RailTrackOffset overlay_offset;
2947  if (rti != NULL && rti->UsesOverlay() && SplitGroundSpriteForOverlay(NULL, &img, &overlay_offset)) {
2949  DrawSprite(img, PAL_NONE, x, y);
2950  DrawSprite(ground + overlay_offset, PAL_NONE, x, y);
2951  } else {
2952  DrawSprite(img + total_offset, HasBit(img, PALETTE_MODIFIER_COLOUR) ? pal : PAL_NONE, x, y);
2953  }
2954 
2955  if (roadtype == ROADTYPE_TRAM) {
2956  DrawSprite(SPR_TRAMWAY_TRAM + (t->ground.sprite == SPR_ROAD_PAVED_STRAIGHT_X ? 1 : 0), PAL_NONE, x, y);
2957  }
2958 
2959  /* Default waypoint has no railtype specific sprites */
2960  DrawRailTileSeqInGUI(x, y, t, st == STATION_WAYPOINT ? 0 : total_offset, 0, pal);
2961 }
2962 
2963 static int GetSlopePixelZ_Station(TileIndex tile, uint x, uint y)
2964 {
2965  return GetTileMaxPixelZ(tile);
2966 }
2967 
2968 static Foundation GetFoundation_Station(TileIndex tile, Slope tileh)
2969 {
2970  return FlatteningFoundation(tileh);
2971 }
2972 
2973 static void GetTileDesc_Station(TileIndex tile, TileDesc *td)
2974 {
2975  td->owner[0] = GetTileOwner(tile);
2976  if (IsDriveThroughStopTile(tile)) {
2977  Owner road_owner = INVALID_OWNER;
2978  Owner tram_owner = INVALID_OWNER;
2979  RoadTypes rts = GetRoadTypes(tile);
2980  if (HasBit(rts, ROADTYPE_ROAD)) road_owner = GetRoadOwner(tile, ROADTYPE_ROAD);
2981  if (HasBit(rts, ROADTYPE_TRAM)) tram_owner = GetRoadOwner(tile, ROADTYPE_TRAM);
2982 
2983  /* Is there a mix of owners? */
2984  if ((tram_owner != INVALID_OWNER && tram_owner != td->owner[0]) ||
2985  (road_owner != INVALID_OWNER && road_owner != td->owner[0])) {
2986  uint i = 1;
2987  if (road_owner != INVALID_OWNER) {
2988  td->owner_type[i] = STR_LAND_AREA_INFORMATION_ROAD_OWNER;
2989  td->owner[i] = road_owner;
2990  i++;
2991  }
2992  if (tram_owner != INVALID_OWNER) {
2993  td->owner_type[i] = STR_LAND_AREA_INFORMATION_TRAM_OWNER;
2994  td->owner[i] = tram_owner;
2995  }
2996  }
2997  }
2999 
3000  if (HasStationTileRail(tile)) {
3001  const StationSpec *spec = GetStationSpec(tile);
3002 
3003  if (spec != NULL) {
3005  td->station_name = spec->name;
3006 
3007  if (spec->grf_prop.grffile != NULL) {
3008  const GRFConfig *gc = GetGRFConfig(spec->grf_prop.grffile->grfid);
3009  td->grf = gc->GetName();
3010  }
3011  }
3012 
3013  const RailtypeInfo *rti = GetRailTypeInfo(GetRailType(tile));
3014  td->rail_speed = rti->max_speed;
3015  }
3016 
3017  if (IsAirport(tile)) {
3018  const AirportSpec *as = Station::GetByTile(tile)->airport.GetSpec();
3020  td->airport_name = as->name;
3021 
3022  const AirportTileSpec *ats = AirportTileSpec::GetByTile(tile);
3023  td->airport_tile_name = ats->name;
3024 
3025  if (as->grf_prop.grffile != NULL) {
3026  const GRFConfig *gc = GetGRFConfig(as->grf_prop.grffile->grfid);
3027  td->grf = gc->GetName();
3028  } else if (ats->grf_prop.grffile != NULL) {
3029  const GRFConfig *gc = GetGRFConfig(ats->grf_prop.grffile->grfid);
3030  td->grf = gc->GetName();
3031  }
3032  }
3033 
3034  StringID str;
3035  switch (GetStationType(tile)) {
3036  default: NOT_REACHED();
3037  case STATION_RAIL: str = STR_LAI_STATION_DESCRIPTION_RAILROAD_STATION; break;
3038  case STATION_AIRPORT:
3039  str = (IsHangar(tile) ? STR_LAI_STATION_DESCRIPTION_AIRCRAFT_HANGAR : STR_LAI_STATION_DESCRIPTION_AIRPORT);
3040  break;
3041  case STATION_TRUCK: str = STR_LAI_STATION_DESCRIPTION_TRUCK_LOADING_AREA; break;
3042  case STATION_BUS: str = STR_LAI_STATION_DESCRIPTION_BUS_STATION; break;
3043  case STATION_OILRIG: str = STR_INDUSTRY_NAME_OIL_RIG; break;
3044  case STATION_DOCK: str = STR_LAI_STATION_DESCRIPTION_SHIP_DOCK; break;
3045  case STATION_BUOY: str = STR_LAI_STATION_DESCRIPTION_BUOY; break;
3046  case STATION_WAYPOINT: str = STR_LAI_STATION_DESCRIPTION_WAYPOINT; break;
3047  }
3048  td->str = str;
3049 }
3050 
3051 
3052 static TrackStatus GetTileTrackStatus_Station(TileIndex tile, TransportType mode, uint sub_mode, DiagDirection side)
3053 {
3054  TrackBits trackbits = TRACK_BIT_NONE;
3055 
3056  switch (mode) {
3057  case TRANSPORT_RAIL:
3058  if (HasStationRail(tile) && !IsStationTileBlocked(tile)) {
3059  trackbits = TrackToTrackBits(GetRailStationTrack(tile));
3060  }
3061  break;
3062 
3063  case TRANSPORT_WATER:
3064  /* buoy is coded as a station, it is always on open water */
3065  if (IsBuoy(tile)) {
3066  trackbits = TRACK_BIT_ALL;
3067  /* remove tracks that connect NE map edge */
3068  if (TileX(tile) == 0) trackbits &= ~(TRACK_BIT_X | TRACK_BIT_UPPER | TRACK_BIT_RIGHT);
3069  /* remove tracks that connect NW map edge */
3070  if (TileY(tile) == 0) trackbits &= ~(TRACK_BIT_Y | TRACK_BIT_LEFT | TRACK_BIT_UPPER);
3071  }
3072  break;
3073 
3074  case TRANSPORT_ROAD:
3075  if ((GetRoadTypes(tile) & sub_mode) != 0 && IsRoadStop(tile)) {
3076  DiagDirection dir = GetRoadStopDir(tile);
3077  Axis axis = DiagDirToAxis(dir);
3078 
3079  if (side != INVALID_DIAGDIR) {
3080  if (axis != DiagDirToAxis(side) || (IsStandardRoadStopTile(tile) && dir != side)) break;
3081  }
3082 
3083  trackbits = AxisToTrackBits(axis);
3084  }
3085  break;
3086 
3087  default:
3088  break;
3089  }
3090 
3092 }
3093 
3094 
3095 static void TileLoop_Station(TileIndex tile)
3096 {
3097  /* FIXME -- GetTileTrackStatus_Station -> animated stationtiles
3098  * hardcoded.....not good */
3099  switch (GetStationType(tile)) {
3100  case STATION_AIRPORT:
3101  AirportTileAnimationTrigger(Station::GetByTile(tile), tile, AAT_TILELOOP);
3102  break;
3103 
3104  case STATION_DOCK:
3105  if (!IsTileFlat(tile)) break; // only handle water part
3106  /* FALL THROUGH */
3107  case STATION_OILRIG: //(station part)
3108  case STATION_BUOY:
3109  TileLoop_Water(tile);
3110  break;
3111 
3112  default: break;
3113  }
3114 }
3115 
3116 
3117 static void AnimateTile_Station(TileIndex tile)
3118 {
3119  if (HasStationRail(tile)) {
3120  AnimateStationTile(tile);
3121  return;
3122  }
3123 
3124  if (IsAirport(tile)) {
3125  AnimateAirportTile(tile);
3126  }
3127 }
3128 
3129 
3130 static bool ClickTile_Station(TileIndex tile)
3131 {
3132  const BaseStation *bst = BaseStation::GetByTile(tile);
3133 
3134  if (bst->facilities & FACIL_WAYPOINT) {
3136  } else if (IsHangar(tile)) {
3137  const Station *st = Station::From(bst);
3139  } else {
3141  }
3142  return true;
3143 }
3144 
3145 static VehicleEnterTileStatus VehicleEnter_Station(Vehicle *v, TileIndex tile, int x, int y)
3146 {
3147  if (v->type == VEH_TRAIN) {
3148  StationID station_id = GetStationIndex(tile);
3149  if (!v->current_order.ShouldStopAtStation(v, station_id)) return VETSB_CONTINUE;
3150  if (!IsRailStation(tile) || !v->IsFrontEngine()) return VETSB_CONTINUE;
3151 
3152  int station_ahead;
3153  int station_length;
3154  int stop = GetTrainStopLocation(station_id, tile, Train::From(v), &station_ahead, &station_length);
3155 
3156  /* Stop whenever that amount of station ahead + the distance from the
3157  * begin of the platform to the stop location is longer than the length
3158  * of the platform. Station ahead 'includes' the current tile where the
3159  * vehicle is on, so we need to subtract that. */
3160  if (stop + station_ahead - (int)TILE_SIZE >= station_length) return VETSB_CONTINUE;
3161 
3163 
3164  x &= 0xF;
3165  y &= 0xF;
3166 
3167  if (DiagDirToAxis(dir) != AXIS_X) Swap(x, y);
3168  if (y == TILE_SIZE / 2) {
3169  if (dir != DIAGDIR_SE && dir != DIAGDIR_SW) x = TILE_SIZE - 1 - x;
3170  stop &= TILE_SIZE - 1;
3171 
3172  if (x == stop) {
3173  return VETSB_ENTERED_STATION | (VehicleEnterTileStatus)(station_id << VETS_STATION_ID_OFFSET); // enter station
3174  } else if (x < stop) {
3176  uint16 spd = max(0, (stop - x) * 20 - 15);
3177  if (spd < v->cur_speed) v->cur_speed = spd;
3178  }
3179  }
3180  } else if (v->type == VEH_ROAD) {
3181  RoadVehicle *rv = RoadVehicle::From(v);
3182  if (rv->state < RVSB_IN_ROAD_STOP && !IsReversingRoadTrackdir((Trackdir)rv->state) && rv->frame == 0) {
3183  if (IsRoadStop(tile) && rv->IsFrontEngine()) {
3184  /* Attempt to allocate a parking bay in a road stop */
3186  }
3187  }
3188  }
3189 
3190  return VETSB_CONTINUE;
3191 }
3192 
3198 {
3199  /* Collect cargoes accepted since the last big tick. */
3200  uint cargoes = 0;
3201  for (CargoID cid = 0; cid < NUM_CARGO; cid++) {
3202  if (HasBit(st->goods[cid].status, GoodsEntry::GES_ACCEPTED_BIGTICK)) SetBit(cargoes, cid);
3203  }
3204 
3205  /* Anything to do? */
3206  if (cargoes == 0) return;
3207 
3208  /* Loop over all houses in the catchment. */
3209  Rect r = st->GetCatchmentRect();
3210  TileArea ta(TileXY(r.left, r.top), TileXY(r.right, r.bottom));
3211  TILE_AREA_LOOP(tile, ta) {
3212  if (IsTileType(tile, MP_HOUSE)) {
3213  WatchedCargoCallback(tile, cargoes);
3214  }
3215  }
3216 }
3217 
3225 {
3226  if (!st->IsInUse()) {
3227  if (++st->delete_ctr >= 8) delete st;
3228  return false;
3229  }
3230 
3231  if (Station::IsExpected(st)) {
3233 
3234  for (CargoID i = 0; i < NUM_CARGO; i++) {
3235  ClrBit(Station::From(st)->goods[i].status, GoodsEntry::GES_ACCEPTED_BIGTICK);
3236  }
3237  }
3238 
3239 
3240  if ((st->facilities & FACIL_WAYPOINT) == 0) UpdateStationAcceptance(Station::From(st), true);
3241 
3242  return true;
3243 }
3244 
3245 static inline void byte_inc_sat(byte *p)
3246 {
3247  byte b = *p + 1;
3248  if (b != 0) *p = b;
3249 }
3250 
3257 static void TruncateCargo(const CargoSpec *cs, GoodsEntry *ge, uint amount = UINT_MAX)
3258 {
3259  /* If truncating also punish the source stations' ratings to
3260  * decrease the flow of incoming cargo. */
3261 
3262  StationCargoAmountMap waiting_per_source;
3263  ge->cargo.Truncate(amount, &waiting_per_source);
3264  for (StationCargoAmountMap::iterator i(waiting_per_source.begin()); i != waiting_per_source.end(); ++i) {
3265  Station *source_station = Station::GetIfValid(i->first);
3266  if (source_station == NULL) continue;
3267 
3268  GoodsEntry &source_ge = source_station->goods[cs->Index()];
3269  source_ge.max_waiting_cargo = max(source_ge.max_waiting_cargo, i->second);
3270  }
3271 }
3272 
3273 static void UpdateStationRating(Station *st)
3274 {
3275  bool waiting_changed = false;
3276 
3277  byte_inc_sat(&st->time_since_load);
3278  byte_inc_sat(&st->time_since_unload);
3279 
3280  const CargoSpec *cs;
3281  FOR_ALL_CARGOSPECS(cs) {
3282  GoodsEntry *ge = &st->goods[cs->Index()];
3283  /* Slowly increase the rating back to his original level in the case we
3284  * didn't deliver cargo yet to this station. This happens when a bribe
3285  * failed while you didn't moved that cargo yet to a station. */
3286  if (!ge->HasRating() && ge->rating < INITIAL_STATION_RATING) {
3287  ge->rating++;
3288  }
3289 
3290  /* Only change the rating if we are moving this cargo */
3291  if (ge->HasRating()) {
3292  byte_inc_sat(&ge->time_since_pickup);
3293  if (ge->time_since_pickup == 255 && _settings_game.order.selectgoods) {
3295  ge->last_speed = 0;
3296  TruncateCargo(cs, ge);
3297  waiting_changed = true;
3298  continue;
3299  }
3300 
3301  bool skip = false;
3302  int rating = 0;
3303  uint waiting = ge->cargo.TotalCount();
3304 
3305  /* num_dests is at least 1 if there is any cargo as
3306  * INVALID_STATION is also a destination.
3307  */
3308  uint num_dests = (uint)ge->cargo.Packets()->MapSize();
3309 
3310  /* Average amount of cargo per next hop, but prefer solitary stations
3311  * with only one or two next hops. They are allowed to have more
3312  * cargo waiting per next hop.
3313  * With manual cargo distribution waiting_avg = waiting / 2 as then
3314  * INVALID_STATION is the only destination.
3315  */
3316  uint waiting_avg = waiting / (num_dests + 1);
3317 
3319  /* Perform custom station rating. If it succeeds the speed, days in transit and
3320  * waiting cargo ratings must not be executed. */
3321 
3322  /* NewGRFs expect last speed to be 0xFF when no vehicle has arrived yet. */
3323  uint last_speed = ge->HasVehicleEverTriedLoading() ? ge->last_speed : 0xFF;
3324 
3325  uint32 var18 = min(ge->time_since_pickup, 0xFF) | (min(ge->max_waiting_cargo, 0xFFFF) << 8) | (min(last_speed, 0xFF) << 24);
3326  /* Convert to the 'old' vehicle types */
3327  uint32 var10 = (st->last_vehicle_type == VEH_INVALID) ? 0x0 : (st->last_vehicle_type + 0x10);
3328  uint16 callback = GetCargoCallback(CBID_CARGO_STATION_RATING_CALC, var10, var18, cs);
3329  if (callback != CALLBACK_FAILED) {
3330  skip = true;
3331  rating = GB(callback, 0, 14);
3332 
3333  /* Simulate a 15 bit signed value */
3334  if (HasBit(callback, 14)) rating -= 0x4000;
3335  }
3336  }
3337 
3338  if (!skip) {
3339  int b = ge->last_speed - 85;
3340  if (b >= 0) rating += b >> 2;
3341 
3342  byte waittime = ge->time_since_pickup;
3343  if (st->last_vehicle_type == VEH_SHIP) waittime >>= 2;
3344  (waittime > 21) ||
3345  (rating += 25, waittime > 12) ||
3346  (rating += 25, waittime > 6) ||
3347  (rating += 45, waittime > 3) ||
3348  (rating += 35, true);
3349 
3350  (rating -= 90, ge->max_waiting_cargo > 1500) ||
3351  (rating += 55, ge->max_waiting_cargo > 1000) ||
3352  (rating += 35, ge->max_waiting_cargo > 600) ||
3353  (rating += 10, ge->max_waiting_cargo > 300) ||
3354  (rating += 20, ge->max_waiting_cargo > 100) ||
3355  (rating += 10, true);
3356  }
3357 
3358  if (Company::IsValidID(st->owner) && HasBit(st->town->statues, st->owner)) rating += 26;
3359 
3360  byte age = ge->last_age;
3361  (age >= 3) ||
3362  (rating += 10, age >= 2) ||
3363  (rating += 10, age >= 1) ||
3364  (rating += 13, true);
3365 
3366  {
3367  int or_ = ge->rating; // old rating
3368 
3369  /* only modify rating in steps of -2, -1, 0, 1 or 2 */
3370  ge->rating = rating = or_ + Clamp(Clamp(rating, 0, 255) - or_, -2, 2);
3371 
3372  /* if rating is <= 64 and more than 100 items waiting on average per destination,
3373  * remove some random amount of goods from the station */
3374  if (rating <= 64 && waiting_avg >= 100) {
3375  int dec = Random() & 0x1F;
3376  if (waiting_avg < 200) dec &= 7;
3377  waiting -= (dec + 1) * num_dests;
3378  waiting_changed = true;
3379  }
3380 
3381  /* if rating is <= 127 and there are any items waiting, maybe remove some goods. */
3382  if (rating <= 127 && waiting != 0) {
3383  uint32 r = Random();
3384  if (rating <= (int)GB(r, 0, 7)) {
3385  /* Need to have int, otherwise it will just overflow etc. */
3386  waiting = max((int)waiting - (int)((GB(r, 8, 2) - 1) * num_dests), 0);
3387  waiting_changed = true;
3388  }
3389  }
3390 
3391  /* At some point we really must cap the cargo. Previously this
3392  * was a strict 4095, but now we'll have a less strict, but
3393  * increasingly aggressive truncation of the amount of cargo. */
3394  static const uint WAITING_CARGO_THRESHOLD = 1 << 12;
3395  static const uint WAITING_CARGO_CUT_FACTOR = 1 << 6;
3396  static const uint MAX_WAITING_CARGO = 1 << 15;
3397 
3398  if (waiting > WAITING_CARGO_THRESHOLD) {
3399  uint difference = waiting - WAITING_CARGO_THRESHOLD;
3400  waiting -= (difference / WAITING_CARGO_CUT_FACTOR);
3401 
3402  waiting = min(waiting, MAX_WAITING_CARGO);
3403  waiting_changed = true;
3404  }
3405 
3406  /* We can't truncate cargo that's already reserved for loading.
3407  * Thus StoredCount() here. */
3408  if (waiting_changed && waiting < ge->cargo.AvailableCount()) {
3409  /* Feed back the exact own waiting cargo at this station for the
3410  * next rating calculation. */
3411  ge->max_waiting_cargo = 0;
3412 
3413  TruncateCargo(cs, ge, ge->cargo.AvailableCount() - waiting);
3414  } else {
3415  /* If the average number per next hop is low, be more forgiving. */
3416  ge->max_waiting_cargo = waiting_avg;
3417  }
3418  }
3419  }
3420  }
3421 
3422  StationID index = st->index;
3423  if (waiting_changed) {
3424  SetWindowDirty(WC_STATION_VIEW, index); // update whole window
3425  } else {
3426  SetWindowWidgetDirty(WC_STATION_VIEW, index, WID_SV_ACCEPT_RATING_LIST); // update only ratings list
3427  }
3428 }
3429 
3438 void RerouteCargo(Station *st, CargoID c, StationID avoid, StationID avoid2)
3439 {
3440  GoodsEntry &ge = st->goods[c];
3441 
3442  /* Reroute cargo in station. */
3443  ge.cargo.Reroute(UINT_MAX, &ge.cargo, avoid, avoid2, &ge);
3444 
3445  /* Reroute cargo staged to be transfered. */
3446  for (std::list<Vehicle *>::iterator it(st->loading_vehicles.begin()); it != st->loading_vehicles.end(); ++it) {
3447  for (Vehicle *v = *it; v != NULL; v = v->Next()) {
3448  if (v->cargo_type != c) continue;
3449  v->cargo.Reroute(UINT_MAX, &v->cargo, avoid, avoid2, &ge);
3450  }
3451  }
3452 }
3453 
3463 {
3464  for (CargoID c = 0; c < NUM_CARGO; ++c) {
3465  GoodsEntry &ge = from->goods[c];
3467  if (lg == NULL) continue;
3468  Node node = (*lg)[ge.node];
3469  for (EdgeIterator it(node.Begin()); it != node.End();) {
3470  Edge edge = it->second;
3471  Station *to = Station::Get((*lg)[it->first].Station());
3472  assert(to->goods[c].node == it->first);
3473  ++it; // Do that before removing the edge. Anything else may crash.
3474  assert(_date >= edge.LastUpdate());
3475  uint timeout = LinkGraph::MIN_TIMEOUT_DISTANCE + (DistanceManhattan(from->xy, to->xy) >> 3);
3476  if ((uint)(_date - edge.LastUpdate()) > timeout) {
3477  /* Have all vehicles refresh their next hops before deciding to
3478  * remove the node. */
3479  bool updated = false;
3480  OrderList *l;
3481  FOR_ALL_ORDER_LISTS(l) {
3482  bool found_from = false;
3483  bool found_to = false;
3484  for (Order *order = l->GetFirstOrder(); order != NULL; order = order->next) {
3485  if (!order->IsType(OT_GOTO_STATION) && !order->IsType(OT_IMPLICIT)) continue;
3486  if (order->GetDestination() == from->index) {
3487  found_from = true;
3488  if (found_to) break;
3489  } else if (order->GetDestination() == to->index) {
3490  found_to = true;
3491  if (found_from) break;
3492  }
3493  }
3494  if (!found_to || !found_from) continue;
3495  for (Vehicle *v = l->GetFirstSharedVehicle(); !updated && v != NULL; v = v->NextShared()) {
3496  /* There is potential for optimization here:
3497  * - Usually consists of the same order list are the same. It's probably better to
3498  * first check the first of each list, then the second of each list and so on.
3499  * - We could try to figure out if we've seen a consist with the same cargo on the
3500  * same list already and if the consist can actually carry the cargo we're looking
3501  * for. With conditional and refit orders this is not quite trivial, though. */
3502  LinkRefresher::Run(v, false); // Don't allow merging. Otherwise lg might get deleted.
3503  if (edge.LastUpdate() == _date) updated = true;
3504  }
3505  if (updated) break;
3506  }
3507  if (!updated) {
3508  /* If it's still considered dead remove it. */
3509  node.RemoveEdge(to->goods[c].node);
3510  ge.flows.DeleteFlows(to->index);
3511  RerouteCargo(from, c, to->index, from->index);
3512  }
3513  } else if (edge.LastUnrestrictedUpdate() != INVALID_DATE && (uint)(_date - edge.LastUnrestrictedUpdate()) > timeout) {
3514  edge.Restrict();
3515  ge.flows.RestrictFlows(to->index);
3516  RerouteCargo(from, c, to->index, from->index);
3517  } else if (edge.LastRestrictedUpdate() != INVALID_DATE && (uint)(_date - edge.LastRestrictedUpdate()) > timeout) {
3518  edge.Release();
3519  }
3520  }
3521  assert(_date >= lg->LastCompression());
3522  if ((uint)(_date - lg->LastCompression()) > LinkGraph::COMPRESSION_INTERVAL) {
3523  lg->Compress();
3524  }
3525  }
3526 }
3527 
3537 void IncreaseStats(Station *st, CargoID cargo, StationID next_station_id, uint capacity, uint usage, EdgeUpdateMode mode)
3538 {
3539  GoodsEntry &ge1 = st->goods[cargo];
3540  Station *st2 = Station::Get(next_station_id);
3541  GoodsEntry &ge2 = st2->goods[cargo];
3542  LinkGraph *lg = NULL;
3543  if (ge1.link_graph == INVALID_LINK_GRAPH) {
3544  if (ge2.link_graph == INVALID_LINK_GRAPH) {
3546  lg = new LinkGraph(cargo);
3548  ge2.link_graph = lg->index;
3549  ge2.node = lg->AddNode(st2);
3550  } else {
3551  DEBUG(misc, 0, "Can't allocate link graph");
3552  }
3553  } else {
3554  lg = LinkGraph::Get(ge2.link_graph);
3555  }
3556  if (lg) {
3557  ge1.link_graph = lg->index;
3558  ge1.node = lg->AddNode(st);
3559  }
3560  } else if (ge2.link_graph == INVALID_LINK_GRAPH) {
3561  lg = LinkGraph::Get(ge1.link_graph);
3562  ge2.link_graph = lg->index;
3563  ge2.node = lg->AddNode(st2);
3564  } else {
3565  lg = LinkGraph::Get(ge1.link_graph);
3566  if (ge1.link_graph != ge2.link_graph) {
3567  LinkGraph *lg2 = LinkGraph::Get(ge2.link_graph);
3568  if (lg->Size() < lg2->Size()) {
3570  lg2->Merge(lg); // Updates GoodsEntries of lg
3571  lg = lg2;
3572  } else {
3574  lg->Merge(lg2); // Updates GoodsEntries of lg2
3575  }
3576  }
3577  }
3578  if (lg != NULL) {
3579  (*lg)[ge1.node].UpdateEdge(ge2.node, capacity, usage, mode);
3580  }
3581 }
3582 
3589 void IncreaseStats(Station *st, const Vehicle *front, StationID next_station_id)
3590 {
3591  for (const Vehicle *v = front; v != NULL; v = v->Next()) {
3592  if (v->refit_cap > 0) {
3593  /* The cargo count can indeed be higher than the refit_cap if
3594  * wagons have been auto-replaced and subsequently auto-
3595  * refitted to a higher capacity. The cargo gets redistributed
3596  * among the wagons in that case.
3597  * As usage is not such an important figure anyway we just
3598  * ignore the additional cargo then.*/
3599  IncreaseStats(st, v->cargo_type, next_station_id, v->refit_cap,
3601  }
3602  }
3603 }
3604 
3605 /* called for every station each tick */
3606 static void StationHandleSmallTick(BaseStation *st)
3607 {
3608  if ((st->facilities & FACIL_WAYPOINT) != 0 || !st->IsInUse()) return;
3609 
3610  byte b = st->delete_ctr + 1;
3611  if (b >= STATION_RATING_TICKS) b = 0;
3612  st->delete_ctr = b;
3613 
3614  if (b == 0) UpdateStationRating(Station::From(st));
3615 }
3616 
3617 void OnTick_Station()
3618 {
3619  if (_game_mode == GM_EDITOR) return;
3620 
3621  BaseStation *st;
3622  FOR_ALL_BASE_STATIONS(st) {
3623  StationHandleSmallTick(st);
3624 
3625  /* Clean up the link graph about once a week. */
3626  if (Station::IsExpected(st) && (_tick_counter + st->index) % STATION_LINKGRAPH_TICKS == 0) {
3628  };
3629 
3630  /* Run STATION_ACCEPTANCE_TICKS = 250 tick interval trigger for station animation.
3631  * Station index is included so that triggers are not all done
3632  * at the same time. */
3633  if ((_tick_counter + st->index) % STATION_ACCEPTANCE_TICKS == 0) {
3634  /* Stop processing this station if it was deleted */
3635  if (!StationHandleBigTick(st)) continue;
3636  TriggerStationAnimation(st, st->xy, SAT_250_TICKS);
3637  if (Station::IsExpected(st)) AirportAnimationTrigger(Station::From(st), AAT_STATION_250_TICKS);
3638  }
3639  }
3640 }
3641 
3644 {
3645  Station *st;
3646 
3647  FOR_ALL_STATIONS(st) {
3648  for (CargoID i = 0; i < NUM_CARGO; i++) {
3649  GoodsEntry *ge = &st->goods[i];
3652  }
3653  }
3654 }
3655 
3656 
3657 void ModifyStationRatingAround(TileIndex tile, Owner owner, int amount, uint radius)
3658 {
3659  Station *st;
3660 
3661  FOR_ALL_STATIONS(st) {
3662  if (st->owner == owner &&
3663  DistanceManhattan(tile, st->xy) <= radius) {
3664  for (CargoID i = 0; i < NUM_CARGO; i++) {
3665  GoodsEntry *ge = &st->goods[i];
3666 
3667  if (ge->status != 0) {
3668  ge->rating = Clamp(ge->rating + amount, 0, 255);
3669  }
3670  }
3671  }
3672  }
3673 }
3674 
3675 static uint UpdateStationWaiting(Station *st, CargoID type, uint amount, SourceType source_type, SourceID source_id)
3676 {
3677  /* We can't allocate a CargoPacket? Then don't do anything
3678  * at all; i.e. just discard the incoming cargo. */
3679  if (!CargoPacket::CanAllocateItem()) return 0;
3680 
3681  GoodsEntry &ge = st->goods[type];
3682  amount += ge.amount_fract;
3683  ge.amount_fract = GB(amount, 0, 8);
3684 
3685  amount >>= 8;
3686  /* No new "real" cargo item yet. */
3687  if (amount == 0) return 0;
3688 
3689  StationID next = ge.GetVia(st->index);
3690  ge.cargo.Append(new CargoPacket(st->index, st->xy, amount, source_type, source_id), next);
3691  LinkGraph *lg = NULL;
3692  if (ge.link_graph == INVALID_LINK_GRAPH) {
3694  lg = new LinkGraph(type);
3696  ge.link_graph = lg->index;
3697  ge.node = lg->AddNode(st);
3698  } else {
3699  DEBUG(misc, 0, "Can't allocate link graph");
3700  }
3701  } else {
3702  lg = LinkGraph::Get(ge.link_graph);
3703  }
3704  if (lg != NULL) (*lg)[ge.node].UpdateSupply(amount);
3705 
3706  if (!ge.HasRating()) {
3709  }
3710 
3712  TriggerStationAnimation(st, st->xy, SAT_NEW_CARGO, type);
3713  AirportAnimationTrigger(st, AAT_STATION_NEW_CARGO, type);
3714 
3716  st->MarkTilesDirty(true);
3717  return amount;
3718 }
3719 
3720 static bool IsUniqueStationName(const char *name)
3721 {
3722  const Station *st;
3723 
3724  FOR_ALL_STATIONS(st) {
3725  if (st->name != NULL && strcmp(st->name, name) == 0) return false;
3726  }
3727 
3728  return true;
3729 }
3730 
3740 CommandCost CmdRenameStation(TileIndex tile, DoCommandFlag flags, uint32 p1, uint32 p2, const char *text)
3741 {
3742  Station *st = Station::GetIfValid(p1);
3743  if (st == NULL) return CMD_ERROR;
3744 
3745  CommandCost ret = CheckOwnership(st->owner);
3746  if (ret.Failed()) return ret;
3747 
3748  bool reset = StrEmpty(text);
3749 
3750  if (!reset) {
3752  if (!IsUniqueStationName(text)) return_cmd_error(STR_ERROR_NAME_MUST_BE_UNIQUE);
3753  }
3754 
3755  if (flags & DC_EXEC) {
3756  free(st->name);
3757  st->name = reset ? NULL : stredup(text);
3758 
3759  st->UpdateVirtCoord();
3761  }
3762 
3763  return CommandCost();
3764 }
3765 
3772 void FindStationsAroundTiles(const TileArea &location, StationList *stations)
3773 {
3774  /* area to search = producer plus station catchment radius */
3776 
3777  uint x = TileX(location.tile);
3778  uint y = TileY(location.tile);
3779 
3780  uint min_x = (x > max_rad) ? x - max_rad : 0;
3781  uint max_x = x + location.w + max_rad;
3782  uint min_y = (y > max_rad) ? y - max_rad : 0;
3783  uint max_y = y + location.h + max_rad;
3784 
3785  if (min_x == 0 && _settings_game.construction.freeform_edges) min_x = 1;
3786  if (min_y == 0 && _settings_game.construction.freeform_edges) min_y = 1;
3787  if (max_x >= MapSizeX()) max_x = MapSizeX() - 1;
3788  if (max_y >= MapSizeY()) max_y = MapSizeY() - 1;
3789 
3790  for (uint cy = min_y; cy < max_y; cy++) {
3791  for (uint cx = min_x; cx < max_x; cx++) {
3792  TileIndex cur_tile = TileXY(cx, cy);
3793  if (!IsTileType(cur_tile, MP_STATION)) continue;
3794 
3795  Station *st = Station::GetByTile(cur_tile);
3796  /* st can be NULL in case of waypoints */
3797  if (st == NULL) continue;
3798 
3800  int rad = st->GetCatchmentRadius();
3801  int rad_x = cx - x;
3802  int rad_y = cy - y;
3803 
3804  if (rad_x < -rad || rad_x >= rad + location.w) continue;
3805  if (rad_y < -rad || rad_y >= rad + location.h) continue;
3806  }
3807 
3808  /* Insert the station in the set. This will fail if it has
3809  * already been added.
3810  */
3811  stations->Include(st);
3812  }
3813  }
3814 }
3815 
3821 {
3822  if (this->tile != INVALID_TILE) {
3823  FindStationsAroundTiles(*this, &this->stations);
3824  this->tile = INVALID_TILE;
3825  }
3826  return &this->stations;
3827 }
3828 
3829 uint MoveGoodsToStation(CargoID type, uint amount, SourceType source_type, SourceID source_id, const StationList *all_stations)
3830 {
3831  /* Return if nothing to do. Also the rounding below fails for 0. */
3832  if (amount == 0) return 0;
3833 
3834  Station *st1 = NULL; // Station with best rating
3835  Station *st2 = NULL; // Second best station
3836  uint best_rating1 = 0; // rating of st1
3837  uint best_rating2 = 0; // rating of st2
3838 
3839  for (Station * const *st_iter = all_stations->Begin(); st_iter != all_stations->End(); ++st_iter) {
3840  Station *st = *st_iter;
3841 
3842  /* Is the station reserved exclusively for somebody else? */
3843  if (st->town->exclusive_counter > 0 && st->town->exclusivity != st->owner) continue;
3844 
3845  if (st->goods[type].rating == 0) continue; // Lowest possible rating, better not to give cargo anymore
3846 
3847  if (_settings_game.order.selectgoods && !st->goods[type].HasVehicleEverTriedLoading()) continue; // Selectively servicing stations, and not this one
3848 
3849  if (IsCargoInClass(type, CC_PASSENGERS)) {
3850  if (st->facilities == FACIL_TRUCK_STOP) continue; // passengers are never served by just a truck stop
3851  } else {
3852  if (st->facilities == FACIL_BUS_STOP) continue; // non-passengers are never served by just a bus stop
3853  }
3854 
3855  /* This station can be used, add it to st1/st2 */
3856  if (st1 == NULL || st->goods[type].rating >= best_rating1) {
3857  st2 = st1; best_rating2 = best_rating1; st1 = st; best_rating1 = st->goods[type].rating;
3858  } else if (st2 == NULL || st->goods[type].rating >= best_rating2) {
3859  st2 = st; best_rating2 = st->goods[type].rating;
3860  }
3861  }
3862 
3863  /* no stations around at all? */
3864  if (st1 == NULL) return 0;
3865 
3866  /* From now we'll calculate with fractal cargo amounts.
3867  * First determine how much cargo we really have. */
3868  amount *= best_rating1 + 1;
3869 
3870  if (st2 == NULL) {
3871  /* only one station around */
3872  return UpdateStationWaiting(st1, type, amount, source_type, source_id);
3873  }
3874 
3875  /* several stations around, the best two (highest rating) are in st1 and st2 */
3876  assert(st1 != NULL);
3877  assert(st2 != NULL);
3878  assert(best_rating1 != 0 || best_rating2 != 0);
3879 
3880  /* Then determine the amount the worst station gets. We do it this way as the
3881  * best should get a bonus, which in this case is the rounding difference from
3882  * this calculation. In reality that will mean the bonus will be pretty low.
3883  * Nevertheless, the best station should always get the most cargo regardless
3884  * of rounding issues. */
3885  uint worst_cargo = amount * best_rating2 / (best_rating1 + best_rating2);
3886  assert(worst_cargo <= (amount - worst_cargo));
3887 
3888  /* And then send the cargo to the stations! */
3889  uint moved = UpdateStationWaiting(st1, type, amount - worst_cargo, source_type, source_id);
3890  /* These two UpdateStationWaiting's can't be in the statement as then the order
3891  * of execution would be undefined and that could cause desyncs with callbacks. */
3892  return moved + UpdateStationWaiting(st2, type, worst_cargo, source_type, source_id);
3893 }
3894 
3895 void BuildOilRig(TileIndex tile)
3896 {
3897  if (!Station::CanAllocateItem()) {
3898  DEBUG(misc, 0, "Can't allocate station for oilrig at 0x%X, reverting to oilrig only", tile);
3899  return;
3900  }
3901 
3902  Station *st = new Station(tile);
3903  st->town = ClosestTownFromTile(tile, UINT_MAX);
3904 
3905  st->string_id = GenerateStationName(st, tile, STATIONNAMING_OILRIG);
3906 
3907  assert(IsTileType(tile, MP_INDUSTRY));
3908  DeleteAnimatedTile(tile);
3909  MakeOilrig(tile, st->index, GetWaterClass(tile));
3910 
3911  st->owner = OWNER_NONE;
3912  st->airport.type = AT_OILRIG;
3913  st->airport.Add(tile);
3914  st->dock_tile = tile;
3916  st->build_date = _date;
3917 
3918  st->rect.BeforeAddTile(tile, StationRect::ADD_FORCE);
3919 
3920  st->UpdateVirtCoord();
3921  UpdateStationAcceptance(st, false);
3923 }
3924 
3925 void DeleteOilRig(TileIndex tile)
3926 {
3927  Station *st = Station::GetByTile(tile);
3928 
3929  MakeWaterKeepingClass(tile, OWNER_NONE);
3930 
3931  st->dock_tile = INVALID_TILE;
3932  st->airport.Clear();
3933  st->facilities &= ~(FACIL_AIRPORT | FACIL_DOCK);
3934  st->airport.flags = 0;
3935 
3936  st->rect.AfterRemoveTile(st, tile);
3937 
3938  st->UpdateVirtCoord();
3940  if (!st->IsInUse()) delete st;
3941 }
3942 
3943 static void ChangeTileOwner_Station(TileIndex tile, Owner old_owner, Owner new_owner)
3944 {
3945  if (IsRoadStopTile(tile)) {
3946  for (RoadType rt = ROADTYPE_ROAD; rt < ROADTYPE_END; rt++) {
3947  /* Update all roadtypes, no matter if they are present */
3948  if (GetRoadOwner(tile, rt) == old_owner) {
3949  if (HasTileRoadType(tile, rt)) {
3950  /* A drive-through road-stop has always two road bits. No need to dirty windows here, we'll redraw the whole screen anyway. */
3951  Company::Get(old_owner)->infrastructure.road[rt] -= 2;
3952  if (new_owner != INVALID_OWNER) Company::Get(new_owner)->infrastructure.road[rt] += 2;
3953  }
3954  SetRoadOwner(tile, rt, new_owner == INVALID_OWNER ? OWNER_NONE : new_owner);
3955  }
3956  }
3957  }
3958 
3959  if (!IsTileOwner(tile, old_owner)) return;
3960 
3961  if (new_owner != INVALID_OWNER) {
3962  /* Update company infrastructure counts. Only do it here
3963  * if the new owner is valid as otherwise the clear
3964  * command will do it for us. No need to dirty windows
3965  * here, we'll redraw the whole screen anyway.*/
3966  Company *old_company = Company::Get(old_owner);
3967  Company *new_company = Company::Get(new_owner);
3968 
3969  /* Update counts for underlying infrastructure. */
3970  switch (GetStationType(tile)) {
3971  case STATION_RAIL:
3972  case STATION_WAYPOINT:
3973  if (!IsStationTileBlocked(tile)) {
3974  old_company->infrastructure.rail[GetRailType(tile)]--;
3975  new_company->infrastructure.rail[GetRailType(tile)]++;
3976  }
3977  break;
3978 
3979  case STATION_BUS:
3980  case STATION_TRUCK:
3981  /* Road stops were already handled above. */
3982  break;
3983 
3984  case STATION_BUOY:
3985  case STATION_DOCK:
3986  if (GetWaterClass(tile) == WATER_CLASS_CANAL) {
3987  old_company->infrastructure.water--;
3988  new_company->infrastructure.water++;
3989  }
3990  break;
3991 
3992  default:
3993  break;
3994  }
3995 
3996  /* Update station tile count. */
3997  if (!IsBuoy(tile) && !IsAirport(tile)) {
3998  old_company->infrastructure.station--;
3999  new_company->infrastructure.station++;
4000  }
4001 
4002  /* for buoys, owner of tile is owner of water, st->owner == OWNER_NONE */
4003  SetTileOwner(tile, new_owner);
4005  } else {
4006  if (IsDriveThroughStopTile(tile)) {
4007  /* Remove the drive-through road stop */
4008  DoCommand(tile, 1 | 1 << 8, (GetStationType(tile) == STATION_TRUCK) ? ROADSTOP_TRUCK : ROADSTOP_BUS, DC_EXEC | DC_BANKRUPT, CMD_REMOVE_ROAD_STOP);
4009  assert(IsTileType(tile, MP_ROAD));
4010  /* Change owner of tile and all roadtypes */
4011  ChangeTileOwner(tile, old_owner, new_owner);
4012  } else {
4014  /* Set tile owner of water under (now removed) buoy and dock to OWNER_NONE.
4015  * Update owner of buoy if it was not removed (was in orders).
4016  * Do not update when owned by OWNER_WATER (sea and rivers). */
4017  if ((IsTileType(tile, MP_WATER) || IsBuoyTile(tile)) && IsTileOwner(tile, old_owner)) SetTileOwner(tile, OWNER_NONE);
4018  }
4019  }
4020 }
4021 
4031 {
4032  /* Yeah... water can always remove stops, right? */
4033  if (_current_company == OWNER_WATER) return true;
4034 
4035  RoadTypes rts = GetRoadTypes(tile);
4036  if (HasBit(rts, ROADTYPE_TRAM)) {
4037  Owner tram_owner = GetRoadOwner(tile, ROADTYPE_TRAM);
4038  if (tram_owner != OWNER_NONE && CheckOwnership(tram_owner).Failed()) return false;
4039  }
4040  if (HasBit(rts, ROADTYPE_ROAD)) {
4041  Owner road_owner = GetRoadOwner(tile, ROADTYPE_ROAD);
4042  if (road_owner != OWNER_TOWN) {
4043  if (road_owner != OWNER_NONE && CheckOwnership(road_owner).Failed()) return false;
4044  } else {
4045  if (CheckAllowRemoveRoad(tile, GetAnyRoadBits(tile, ROADTYPE_ROAD), OWNER_TOWN, ROADTYPE_ROAD, flags).Failed()) return false;
4046  }
4047  }
4048 
4049  return true;
4050 }
4051 
4059 {
4060  if (flags & DC_AUTO) {
4061  switch (GetStationType(tile)) {
4062  default: break;
4063  case STATION_RAIL: return_cmd_error(STR_ERROR_MUST_DEMOLISH_RAILROAD);
4064  case STATION_WAYPOINT: return_cmd_error(STR_ERROR_BUILDING_MUST_BE_DEMOLISHED);
4065  case STATION_AIRPORT: return_cmd_error(STR_ERROR_MUST_DEMOLISH_AIRPORT_FIRST);
4066  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);
4067  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);
4068  case STATION_BUOY: return_cmd_error(STR_ERROR_BUOY_IN_THE_WAY);
4069  case STATION_DOCK: return_cmd_error(STR_ERROR_MUST_DEMOLISH_DOCK_FIRST);
4070  case STATION_OILRIG:
4071  SetDParam(1, STR_INDUSTRY_NAME_OIL_RIG);
4072  return_cmd_error(STR_ERROR_GENERIC_OBJECT_IN_THE_WAY);
4073  }
4074  }
4075 
4076  switch (GetStationType(tile)) {
4077  case STATION_RAIL: return RemoveRailStation(tile, flags);
4078  case STATION_WAYPOINT: return RemoveRailWaypoint(tile, flags);
4079  case STATION_AIRPORT: return RemoveAirport(tile, flags);
4080  case STATION_TRUCK:
4081  if (IsDriveThroughStopTile(tile) && !CanRemoveRoadWithStop(tile, flags)) {
4082  return_cmd_error(STR_ERROR_MUST_DEMOLISH_TRUCK_STATION_FIRST);
4083  }
4084  return RemoveRoadStop(tile, flags);
4085  case STATION_BUS:
4086  if (IsDriveThroughStopTile(tile) && !CanRemoveRoadWithStop(tile, flags)) {
4087  return_cmd_error(STR_ERROR_MUST_DEMOLISH_BUS_STATION_FIRST);
4088  }
4089  return RemoveRoadStop(tile, flags);
4090  case STATION_BUOY: return RemoveBuoy(tile, flags);
4091  case STATION_DOCK: return RemoveDock(tile, flags);
4092  default: break;
4093  }
4094 
4095  return CMD_ERROR;
4096 }
4097 
4098 static CommandCost TerraformTile_Station(TileIndex tile, DoCommandFlag flags, int z_new, Slope tileh_new)
4099 {
4101  /* TODO: If you implement newgrf callback 149 'land slope check', you have to decide what to do with it here.
4102  * TTDP does not call it.
4103  */
4104  if (GetTileMaxZ(tile) == z_new + GetSlopeMaxZ(tileh_new)) {
4105  switch (GetStationType(tile)) {
4106  case STATION_WAYPOINT:
4107  case STATION_RAIL: {
4108  DiagDirection direction = AxisToDiagDir(GetRailStationAxis(tile));
4109  if (!AutoslopeCheckForEntranceEdge(tile, z_new, tileh_new, direction)) break;
4110  if (!AutoslopeCheckForEntranceEdge(tile, z_new, tileh_new, ReverseDiagDir(direction))) break;
4111  return CommandCost(EXPENSES_CONSTRUCTION, _price[PR_BUILD_FOUNDATION]);
4112  }
4113 
4114  case STATION_AIRPORT:
4115  return CommandCost(EXPENSES_CONSTRUCTION, _price[PR_BUILD_FOUNDATION]);
4116 
4117  case STATION_TRUCK:
4118  case STATION_BUS: {
4119  DiagDirection direction = GetRoadStopDir(tile);
4120  if (!AutoslopeCheckForEntranceEdge(tile, z_new, tileh_new, direction)) break;
4121  if (IsDriveThroughStopTile(tile)) {
4122  if (!AutoslopeCheckForEntranceEdge(tile, z_new, tileh_new, ReverseDiagDir(direction))) break;
4123  }
4124  return CommandCost(EXPENSES_CONSTRUCTION, _price[PR_BUILD_FOUNDATION]);
4125  }
4126 
4127  default: break;
4128  }
4129  }
4130  }
4131  return DoCommand(tile, 0, 0, flags, CMD_LANDSCAPE_CLEAR);
4132 }
4133 
4139 uint FlowStat::GetShare(StationID st) const
4140 {
4141  uint32 prev = 0;
4142  for (SharesMap::const_iterator it = this->shares.begin(); it != this->shares.end(); ++it) {
4143  if (it->second == st) {
4144  return it->first - prev;
4145  } else {
4146  prev = it->first;
4147  }
4148  }
4149  return 0;
4150 }
4151 
4158 StationID FlowStat::GetVia(StationID excluded, StationID excluded2) const
4159 {
4160  if (this->unrestricted == 0) return INVALID_STATION;
4161  assert(!this->shares.empty());
4162  SharesMap::const_iterator it = this->shares.upper_bound(RandomRange(this->unrestricted));
4163  assert(it != this->shares.end() && it->first <= this->unrestricted);
4164  if (it->second != excluded && it->second != excluded2) return it->second;
4165 
4166  /* We've hit one of the excluded stations.
4167  * Draw another share, from outside its range. */
4168 
4169  uint end = it->first;
4170  uint begin = (it == this->shares.begin() ? 0 : (--it)->first);
4171  uint interval = end - begin;
4172  if (interval >= this->unrestricted) return INVALID_STATION; // Only one station in the map.
4173  uint new_max = this->unrestricted - interval;
4174  uint rand = RandomRange(new_max);
4175  SharesMap::const_iterator it2 = (rand < begin) ? this->shares.upper_bound(rand) :
4176  this->shares.upper_bound(rand + interval);
4177  assert(it2 != this->shares.end() && it2->first <= this->unrestricted);
4178  if (it2->second != excluded && it2->second != excluded2) return it2->second;
4179 
4180  /* We've hit the second excluded station.
4181  * Same as before, only a bit more complicated. */
4182 
4183  uint end2 = it2->first;
4184  uint begin2 = (it2 == this->shares.begin() ? 0 : (--it2)->first);
4185  uint interval2 = end2 - begin2;
4186  if (interval2 >= new_max) return INVALID_STATION; // Only the two excluded stations in the map.
4187  new_max -= interval2;
4188  if (begin > begin2) {
4189  Swap(begin, begin2);
4190  Swap(end, end2);
4191  Swap(interval, interval2);
4192  }
4193  rand = RandomRange(new_max);
4194  SharesMap::const_iterator it3 = this->shares.upper_bound(this->unrestricted);
4195  if (rand < begin) {
4196  it3 = this->shares.upper_bound(rand);
4197  } else if (rand < begin2 - interval) {
4198  it3 = this->shares.upper_bound(rand + interval);
4199  } else {
4200  it3 = this->shares.upper_bound(rand + interval + interval2);
4201  }
4202  assert(it3 != this->shares.end() && it3->first <= this->unrestricted);
4203  return it3->second;
4204 }
4205 
4212 {
4213  assert(!this->shares.empty());
4214  SharesMap new_shares;
4215  uint i = 0;
4216  for (SharesMap::iterator it(this->shares.begin()); it != this->shares.end(); ++it) {
4217  new_shares[++i] = it->second;
4218  if (it->first == this->unrestricted) this->unrestricted = i;
4219  }
4220  this->shares.swap(new_shares);
4221  assert(!this->shares.empty() && this->unrestricted <= (--this->shares.end())->first);
4222 }
4223 
4230 void FlowStat::ChangeShare(StationID st, int flow)
4231 {
4232  /* We assert only before changing as afterwards the shares can actually
4233  * be empty. In that case the whole flow stat must be deleted then. */
4234  assert(!this->shares.empty());
4235 
4236  uint removed_shares = 0;
4237  uint added_shares = 0;
4238  uint last_share = 0;
4239  SharesMap new_shares;
4240  for (SharesMap::iterator it(this->shares.begin()); it != this->shares.end(); ++it) {
4241  if (it->second == st) {
4242  if (flow < 0) {
4243  uint share = it->first - last_share;
4244  if (flow == INT_MIN || (uint)(-flow) >= share) {
4245  removed_shares += share;
4246  if (it->first <= this->unrestricted) this->unrestricted -= share;
4247  if (flow != INT_MIN) flow += share;
4248  last_share = it->first;
4249  continue; // remove the whole share
4250  }
4251  removed_shares += (uint)(-flow);
4252  } else {
4253  added_shares += (uint)(flow);
4254  }
4255  if (it->first <= this->unrestricted) this->unrestricted += flow;
4256 
4257  /* If we don't continue above the whole flow has been added or
4258  * removed. */
4259  flow = 0;
4260  }
4261  new_shares[it->first + added_shares - removed_shares] = it->second;
4262  last_share = it->first;
4263  }
4264  if (flow > 0) {
4265  new_shares[last_share + (uint)flow] = st;
4266  if (this->unrestricted < last_share) {
4267  this->ReleaseShare(st);
4268  } else {
4269  this->unrestricted += flow;
4270  }
4271  }
4272  this->shares.swap(new_shares);
4273 }
4274 
4280 void FlowStat::RestrictShare(StationID st)
4281 {
4282  assert(!this->shares.empty());
4283  uint flow = 0;
4284  uint last_share = 0;
4285  SharesMap new_shares;
4286  for (SharesMap::iterator it(this->shares.begin()); it != this->shares.end(); ++it) {
4287  if (flow == 0) {
4288  if (it->first > this->unrestricted) return; // Not present or already restricted.
4289  if (it->second == st) {
4290  flow = it->first - last_share;
4291  this->unrestricted -= flow;
4292  } else {
4293  new_shares[it->first] = it->second;
4294  }
4295  } else {
4296  new_shares[it->first - flow] = it->second;
4297  }
4298  last_share = it->first;
4299  }
4300  if (flow == 0) return;
4301  new_shares[last_share + flow] = st;
4302  this->shares.swap(new_shares);
4303  assert(!this->shares.empty());
4304 }
4305 
4311 void FlowStat::ReleaseShare(StationID st)
4312 {
4313  assert(!this->shares.empty());
4314  uint flow = 0;
4315  uint next_share = 0;
4316  bool found = false;
4317  for (SharesMap::reverse_iterator it(this->shares.rbegin()); it != this->shares.rend(); ++it) {
4318  if (it->first < this->unrestricted) return; // Note: not <= as the share may hit the limit.
4319  if (found) {
4320  flow = next_share - it->first;
4321  this->unrestricted += flow;
4322  break;
4323  } else {
4324  if (it->first == this->unrestricted) return; // !found -> Limit not hit.
4325  if (it->second == st) found = true;
4326  }
4327  next_share = it->first;
4328  }
4329  if (flow == 0) return;
4330  SharesMap new_shares;
4331  new_shares[flow] = st;
4332  for (SharesMap::iterator it(this->shares.begin()); it != this->shares.end(); ++it) {
4333  if (it->second != st) {
4334  new_shares[flow + it->first] = it->second;
4335  } else {
4336  flow = 0;
4337  }
4338  }
4339  this->shares.swap(new_shares);
4340  assert(!this->shares.empty());
4341 }
4342 
4348 void FlowStat::ScaleToMonthly(uint runtime)
4349 {
4350  assert(runtime > 0);
4351  SharesMap new_shares;
4352  uint share = 0;
4353  for (SharesMap::iterator i = this->shares.begin(); i != this->shares.end(); ++i) {
4354  share = max(share + 1, i->first * 30 / runtime);
4355  new_shares[share] = i->second;
4356  if (this->unrestricted == i->first) this->unrestricted = share;
4357  }
4358  this->shares.swap(new_shares);
4359 }
4360 
4367 void FlowStatMap::AddFlow(StationID origin, StationID via, uint flow)
4368 {
4369  FlowStatMap::iterator origin_it = this->find(origin);
4370  if (origin_it == this->end()) {
4371  this->insert(std::make_pair(origin, FlowStat(via, flow)));
4372  } else {
4373  origin_it->second.ChangeShare(via, flow);
4374  assert(!origin_it->second.GetShares()->empty());
4375  }
4376 }
4377 
4386 void FlowStatMap::PassOnFlow(StationID origin, StationID via, uint flow)
4387 {
4388  FlowStatMap::iterator prev_it = this->find(origin);
4389  if (prev_it == this->end()) {
4390  FlowStat fs(via, flow);
4391  fs.AppendShare(INVALID_STATION, flow);
4392  this->insert(std::make_pair(origin, fs));
4393  } else {
4394  prev_it->second.ChangeShare(via, flow);
4395  prev_it->second.ChangeShare(INVALID_STATION, flow);
4396  assert(!prev_it->second.GetShares()->empty());
4397  }
4398 }
4399 
4405 {
4406  for (FlowStatMap::iterator i = this->begin(); i != this->end(); ++i) {
4407  FlowStat &fs = i->second;
4408  uint local = fs.GetShare(INVALID_STATION);
4409  if (local > INT_MAX) { // make sure it fits in an int
4410  fs.ChangeShare(self, -INT_MAX);
4411  fs.ChangeShare(INVALID_STATION, -INT_MAX);
4412  local -= INT_MAX;
4413  }
4414  fs.ChangeShare(self, -(int)local);
4415  fs.ChangeShare(INVALID_STATION, -(int)local);
4416 
4417  /* If the local share is used up there must be a share for some
4418  * remote station. */
4419  assert(!fs.GetShares()->empty());
4420  }
4421 }
4422 
4430 {
4431  StationIDStack ret;
4432  for (FlowStatMap::iterator f_it = this->begin(); f_it != this->end();) {
4433  FlowStat &s_flows = f_it->second;
4434  s_flows.ChangeShare(via, INT_MIN);
4435  if (s_flows.GetShares()->empty()) {
4436  ret.Push(f_it->first);
4437  this->erase(f_it++);
4438  } else {
4439  ++f_it;
4440  }
4441  }
4442  return ret;
4443 }
4444 
4449 void FlowStatMap::RestrictFlows(StationID via)
4450 {
4451  for (FlowStatMap::iterator it = this->begin(); it != this->end(); ++it) {
4452  it->second.RestrictShare(via);
4453  }
4454 }
4455 
4460 void FlowStatMap::ReleaseFlows(StationID via)
4461 {
4462  for (FlowStatMap::iterator it = this->begin(); it != this->end(); ++it) {
4463  it->second.ReleaseShare(via);
4464  }
4465 }
4466 
4472 {
4473  uint ret = 0;
4474  for (FlowStatMap::const_iterator i = this->begin(); i != this->end(); ++i) {
4475  ret += (--(i->second.GetShares()->end()))->first;
4476  }
4477  return ret;
4478 }
4479 
4485 uint FlowStatMap::GetFlowVia(StationID via) const
4486 {
4487  uint ret = 0;
4488  for (FlowStatMap::const_iterator i = this->begin(); i != this->end(); ++i) {
4489  ret += i->second.GetShare(via);
4490  }
4491  return ret;
4492 }
4493 
4499 uint FlowStatMap::GetFlowFrom(StationID from) const
4500 {
4501  FlowStatMap::const_iterator i = this->find(from);
4502  if (i == this->end()) return 0;
4503  return (--(i->second.GetShares()->end()))->first;
4504 }
4505 
4512 uint FlowStatMap::GetFlowFromVia(StationID from, StationID via) const
4513 {
4514  FlowStatMap::const_iterator i = this->find(from);
4515  if (i == this->end()) return 0;
4516  return i->second.GetShare(via);
4517 }
4518 
4519 extern const TileTypeProcs _tile_type_station_procs = {
4520  DrawTile_Station, // draw_tile_proc
4521  GetSlopePixelZ_Station, // get_slope_z_proc
4522  ClearTile_Station, // clear_tile_proc
4523  NULL, // add_accepted_cargo_proc
4524  GetTileDesc_Station, // get_tile_desc_proc
4525  GetTileTrackStatus_Station, // get_tile_track_status_proc
4526  ClickTile_Station, // click_tile_proc
4527  AnimateTile_Station, // animate_tile_proc
4528  TileLoop_Station, // tile_loop_proc
4529  ChangeTileOwner_Station, // change_tile_owner_proc
4530  NULL, // add_produced_cargo_proc
4531  VehicleEnter_Station, // vehicle_enter_tile_proc
4532  GetFoundation_Station, // get_foundation_proc
4533  TerraformTile_Station, // terraform_tile_proc
4534 };