map_func.h

Go to the documentation of this file.

/*
 * This file is part of OpenTTD.
 * 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.
 * 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.
 * 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/>.
 */
 
#ifndef MAP_FUNC_H
#define MAP_FUNC_H
 
#include "core/math_func.hpp"
#include "tile_type.h"
#include "map_type.h"
#include "direction_func.h"
 
class Tile {
private:
  friend struct Map;
  struct TileBase {
    byte   type;   
    byte   height; 
    uint16_t m2;     
    byte   m1;     
    byte   m3;     
    byte   m4;     
    byte   m5;     
  };
 
  static_assert(sizeof(TileBase) == 8);
 
  struct TileExtended {
    byte m6;   
    byte m7;   
    uint16_t m8; 
  };
 
  static TileBase *base_tiles;         
  static TileExtended *extended_tiles; 
 
  TileIndex tile; 
 
public:
  debug_inline Tile(TileIndex tile) : tile(tile) {}
 
  Tile(uint tile) : tile(tile) {}
 
  debug_inline constexpr operator TileIndex() const { return tile; }
 
  debug_inline constexpr operator uint() const { return tile.base(); }
 
  debug_inline byte &type()
  {
    return base_tiles[tile.base()].type;
  }
 
  debug_inline byte &height()
  {
    return base_tiles[tile.base()].height;
  }
 
  debug_inline byte &m1()
  {
    return base_tiles[tile.base()].m1;
  }
 
  debug_inline uint16_t &m2()
  {
    return base_tiles[tile.base()].m2;
  }
 
  debug_inline byte &m3()
  {
    return base_tiles[tile.base()].m3;
  }
 
  debug_inline byte &m4()
  {
    return base_tiles[tile.base()].m4;
  }
 
  debug_inline byte &m5()
  {
    return base_tiles[tile.base()].m5;
  }
 
  debug_inline byte &m6()
  {
    return extended_tiles[tile.base()].m6;
  }
 
  debug_inline byte &m7()
  {
    return extended_tiles[tile.base()].m7;
  }
 
  debug_inline uint16_t &m8()
  {
    return extended_tiles[tile.base()].m8;
  }
};
 
struct Map {
private:
  struct Iterator {
    typedef Tile value_type;
    typedef Tile *pointer;
    typedef Tile &reference;
    typedef size_t difference_type;
    typedef std::forward_iterator_tag iterator_category;
 
    explicit Iterator(TileIndex index) : index(index) {}
    bool operator==(const Iterator &other) const { return this->index == other.index; }
    bool operator!=(const Iterator &other) const { return !(*this == other); }
    Tile operator*() const { return this->index; }
    Iterator & operator++() { this->index++; return *this; }
  private:
    TileIndex index;
  };
 
  /*
   * Iterable ensemble of all Tiles
   */
  struct IterateWrapper {
    Iterator begin() { return Iterator(0); }
    Iterator end() { return Iterator(Map::Size()); }
    bool empty() { return false; }
  };
 
  static uint log_x;     
  static uint log_y;     
  static uint size_x;    
  static uint size_y;    
  static uint size;      
  static uint tile_mask; 
 
public:
  static void Allocate(uint size_x, uint size_y);
 
  debug_inline static uint LogX()
  {
    return Map::log_x;
  }
 
  static inline uint LogY()
  {
    return Map::log_y;
  }
 
  debug_inline static uint SizeX()
  {
    return Map::size_x;
  }
 
  static inline uint SizeY()
  {
    return Map::size_y;
  }
 
  debug_inline static uint Size()
  {
    return Map::size;
  }
 
  debug_inline static uint MaxX()
  {
    return Map::SizeX() - 1;
  }
 
  static inline uint MaxY()
  {
    return Map::SizeY() - 1;
  }
 
 
  static inline TileIndex WrapToMap(TileIndex tile)
  {
    return tile.base() & Map::tile_mask;
  }
 
  static inline uint ScaleBySize(uint n)
  {
    /* Subtract 12 from shift in order to prevent integer overflow
     * for large values of n. It's safe since the min mapsize is 64x64. */
    return CeilDiv(n << (Map::LogX() + Map::LogY() - 12), 1 << 4);
  }
 
  static inline uint ScaleBySize1D(uint n)
  {
    /* Normal circumference for the X+Y is 256+256 = 1<<9
     * Note, not actually taking the full circumference into account,
     * just half of it. */
    return CeilDiv((n << Map::LogX()) + (n << Map::LogY()), 1 << 9);
  }
 
  static bool IsInitialized()
  {
    return Tile::base_tiles != nullptr;
  }
 
  static IterateWrapper Iterate() { return IterateWrapper(); }
};
 
typedef int32_t TileIndexDiff;
 
debug_inline static TileIndex TileXY(uint x, uint y)
{
  return (y << Map::LogX()) + x;
}
 
inline TileIndexDiff TileDiffXY(int x, int y)
{
  /* Multiplication gives much better optimization on MSVC than shifting.
   * 0 << shift isn't optimized to 0 properly.
   * Typically x and y are constants, and then this doesn't result
   * in any actual multiplication in the assembly code.. */
  return (y * Map::SizeX()) + x;
}
 
debug_inline static TileIndex TileVirtXY(uint x, uint y)
{
  return (y >> 4 << Map::LogX()) + (x >> 4);
}
 
 
debug_inline static uint TileX(TileIndex tile)
{
  return tile.base() & Map::MaxX();
}
 
debug_inline static uint TileY(TileIndex tile)
{
  return tile.base() >> Map::LogX();
}
 
inline TileIndexDiff ToTileIndexDiff(TileIndexDiffC tidc)
{
  return (tidc.y << Map::LogX()) + tidc.x;
}
 
 
#ifndef _DEBUG
 
# define TILE_ADD(x, y) ((x) + (y))
#else
  extern TileIndex TileAdd(TileIndex tile, TileIndexDiff add,
    const char *exp, const char *file, int line);
# define TILE_ADD(x, y) (TileAdd((x), (y), #x " + " #y, __FILE__, __LINE__))
#endif
 
#define TILE_ADDXY(tile, x, y) TILE_ADD(tile, TileDiffXY(x, y))
 
TileIndex TileAddWrap(TileIndex tile, int addx, int addy);
 
inline TileIndexDiffC TileIndexDiffCByDiagDir(DiagDirection dir)
{
  extern const TileIndexDiffC _tileoffs_by_diagdir[DIAGDIR_END];
 
  assert(IsValidDiagDirection(dir));
  return _tileoffs_by_diagdir[dir];
}
 
inline TileIndexDiffC TileIndexDiffCByDir(Direction dir)
{
  extern const TileIndexDiffC _tileoffs_by_dir[DIR_END];
 
  assert(IsValidDirection(dir));
  return _tileoffs_by_dir[dir];
}
 
inline TileIndex AddTileIndexDiffCWrap(TileIndex tile, TileIndexDiffC diff)
{
  int x = TileX(tile) + diff.x;
  int y = TileY(tile) + diff.y;
  /* Negative value will become big positive value after cast */
  if ((uint)x >= Map::SizeX() || (uint)y >= Map::SizeY()) return INVALID_TILE;
  return TileXY(x, y);
}
 
inline TileIndexDiffC TileIndexToTileIndexDiffC(TileIndex tile_a, TileIndex tile_b)
{
  TileIndexDiffC difference;
 
  difference.x = TileX(tile_a) - TileX(tile_b);
  difference.y = TileY(tile_a) - TileY(tile_b);
 
  return difference;
}
 
/* Functions to calculate distances */
uint DistanceManhattan(TileIndex, TileIndex); 
uint DistanceSquare(TileIndex, TileIndex); 
uint DistanceMax(TileIndex, TileIndex); 
uint DistanceMaxPlusManhattan(TileIndex, TileIndex); 
uint DistanceFromEdge(TileIndex); 
uint DistanceFromEdgeDir(TileIndex, DiagDirection); 
 
inline TileIndexDiff TileOffsByDiagDir(DiagDirection dir)
{
  extern const TileIndexDiffC _tileoffs_by_diagdir[DIAGDIR_END];
 
  assert(IsValidDiagDirection(dir));
  return ToTileIndexDiff(_tileoffs_by_diagdir[dir]);
}
 
inline TileIndexDiff TileOffsByDir(Direction dir)
{
  extern const TileIndexDiffC _tileoffs_by_dir[DIR_END];
 
  assert(IsValidDirection(dir));
  return ToTileIndexDiff(_tileoffs_by_dir[dir]);
}
 
inline TileIndex TileAddByDir(TileIndex tile, Direction dir)
{
  return TILE_ADD(tile, TileOffsByDir(dir));
}
 
inline TileIndex TileAddByDiagDir(TileIndex tile, DiagDirection dir)
{
  return TILE_ADD(tile, TileOffsByDiagDir(dir));
}
 
inline DiagDirection DiagdirBetweenTiles(TileIndex tile_from, TileIndex tile_to)
{
  int dx = (int)TileX(tile_to) - (int)TileX(tile_from);
  int dy = (int)TileY(tile_to) - (int)TileY(tile_from);
  if (dx == 0) {
    if (dy == 0) return INVALID_DIAGDIR;
    return (dy < 0 ? DIAGDIR_NW : DIAGDIR_SE);
  } else {
    if (dy != 0) return INVALID_DIAGDIR;
    return (dx < 0 ? DIAGDIR_NE : DIAGDIR_SW);
  }
}
 
typedef bool TestTileOnSearchProc(TileIndex tile, void *user_data);
 
bool CircularTileSearch(TileIndex *tile, uint size, TestTileOnSearchProc proc, void *user_data);
bool CircularTileSearch(TileIndex *tile, uint radius, uint w, uint h, TestTileOnSearchProc proc, void *user_data);
 
inline TileIndex RandomTileSeed(uint32_t r)
{
  return Map::WrapToMap(r);
}
 
#define RandomTile() RandomTileSeed(Random())
 
uint GetClosestWaterDistance(TileIndex tile, bool water);
 
#endif /* MAP_FUNC_H */