minetestmapper/TileGenerator.cpp

913 lines
22 KiB
C++
Raw Permalink Normal View History

2012-08-23 14:21:34 +02:00
#include <cstdio>
2018-03-25 16:47:23 +02:00
#include <cstdlib>
#include <climits>
#include <cassert>
#include <fstream>
#include <iostream>
2012-08-24 09:46:14 +02:00
#include <sstream>
2014-03-09 12:32:13 +01:00
#include <stdexcept>
#include <cstring>
#include <vector>
#include <type_traits>
#include <limits>
2018-03-25 15:19:48 +02:00
#include "TileGenerator.h"
2012-09-01 13:01:31 +02:00
#include "config.h"
#include "PlayerAttributes.h"
2018-03-25 15:19:48 +02:00
#include "BlockDecoder.h"
#include "Image.h"
2014-07-08 14:54:27 +02:00
#include "util.h"
2014-03-05 21:41:27 +01:00
#include "db-sqlite3.h"
2017-01-08 23:24:09 +01:00
#if USE_POSTGRESQL
#include "db-postgresql.h"
#endif
2014-03-05 21:41:27 +01:00
#if USE_LEVELDB
#include "db-leveldb.h"
#endif
2014-04-26 15:01:35 +02:00
#if USE_REDIS
#include "db-redis.h"
#endif
2012-08-23 12:46:22 +02:00
#ifndef __has_builtin
#define __has_builtin(x) 0
#endif
// saturating multiplication
template<typename T, class = typename std::enable_if<std::is_unsigned<T>::value>::type>
inline T sat_mul(T a, T b)
{
#if __has_builtin(__builtin_mul_overflow)
T res;
if (__builtin_mul_overflow(a, b, &res))
return std::numeric_limits<T>::max();
return res;
#else
2023-08-08 14:18:26 +02:00
// WARNING: the fallback implementation is incorrect since we compute ceil(log(x)) not log(x)
// but that's good enough for our usecase...
const int bits = sizeof(T) * 8;
int hb_a = 0, hb_b = 0;
for (int i = bits - 1; i >= 0; i--) {
if (a & (static_cast<T>(1) << i)) {
hb_a = i; break;
}
}
for (int i = bits - 1; i >= 0; i--) {
if (b & (static_cast<T>(1) << i)) {
hb_b = i; break;
}
}
// log2(a) + log2(b) >= log2(MAX) <=> calculation will overflow
if (hb_a + hb_b >= bits)
return std::numeric_limits<T>::max();
return a * b;
#endif
}
template<typename T>
inline T sat_mul(T a, T b, T c)
{
return sat_mul(sat_mul(a, b), c);
}
// rounds n (away from 0) to a multiple of f while preserving the sign of n
2016-11-18 23:57:09 +01:00
static int round_multiple_nosign(int n, int f)
2014-09-01 18:37:07 +02:00
{
int abs_n, sign;
abs_n = (n >= 0) ? n : -n;
sign = (n >= 0) ? 1 : -1;
if (abs_n % f == 0)
return n; // n == abs_n * sign
2014-09-01 18:37:07 +02:00
else
return sign * (abs_n + f - (abs_n % f));
2014-09-01 18:37:07 +02:00
}
2022-02-09 22:46:07 +01:00
static inline unsigned int colorSafeBounds(int channel)
2012-08-25 13:19:58 +02:00
{
return mymin(mymax(channel, 0), 255);
2012-08-25 13:19:58 +02:00
}
static Color parseColor(const std::string &color)
{
if (color.length() != 7)
throw std::runtime_error("Color needs to be 7 characters long");
if (color[0] != '#')
throw std::runtime_error("Color needs to begin with #");
unsigned long col = strtoul(color.c_str() + 1, NULL, 16);
u8 b, g, r;
b = col & 0xff;
g = (col >> 8) & 0xff;
r = (col >> 16) & 0xff;
return Color(r, g, b);
}
2016-11-18 23:57:09 +01:00
static Color mixColors(Color a, Color b)
{
2016-07-06 21:45:38 +02:00
Color result;
double a1 = a.a / 255.0;
double a2 = b.a / 255.0;
2016-07-06 21:45:38 +02:00
result.r = (int) (a1 * a.r + a2 * (1 - a1) * b.r);
result.g = (int) (a1 * a.g + a2 * (1 - a1) * b.g);
result.b = (int) (a1 * a.b + a2 * (1 - a1) * b.b);
result.a = (int) (255 * (a1 + a2 * (1 - a1)));
2016-11-18 23:57:09 +01:00
2016-07-06 21:45:38 +02:00
return result;
}
2012-08-23 12:46:22 +02:00
TileGenerator::TileGenerator():
2012-08-24 09:46:14 +02:00
m_bgColor(255, 255, 255),
m_scaleColor(0, 0, 0),
m_originColor(255, 0, 0),
m_playerColor(255, 0, 0),
2012-08-23 12:46:22 +02:00
m_drawOrigin(false),
m_drawPlayers(false),
m_drawScale(false),
m_drawAlpha(false),
m_shading(true),
m_dontWriteEmpty(false),
m_backend(""),
m_xBorder(0),
m_yBorder(0),
m_db(NULL),
m_image(NULL),
m_xMin(INT_MAX),
m_xMax(INT_MIN),
m_zMin(INT_MAX),
m_zMax(INT_MIN),
m_yMin(INT16_MIN),
m_yMax(INT16_MAX),
2014-09-01 18:37:07 +02:00
m_geomX(-2048),
m_geomY(-2048),
m_geomX2(2048),
2016-07-06 21:45:38 +02:00
m_geomY2(2048),
m_exhaustiveSearch(EXH_AUTO),
m_renderedAny(false),
m_zoom(1),
m_scales(SCALE_LEFT | SCALE_TOP),
m_progressMax(0),
m_progressLast(-1)
2012-08-23 12:46:22 +02:00
{
}
TileGenerator::~TileGenerator()
{
closeDatabase();
2012-08-23 12:46:22 +02:00
}
void TileGenerator::setBgColor(const std::string &bgColor)
{
2012-08-23 14:43:11 +02:00
m_bgColor = parseColor(bgColor);
2012-08-23 12:46:22 +02:00
}
void TileGenerator::setScaleColor(const std::string &scaleColor)
{
2012-08-23 14:43:11 +02:00
m_scaleColor = parseColor(scaleColor);
2012-08-23 12:46:22 +02:00
}
void TileGenerator::setOriginColor(const std::string &originColor)
{
2012-08-23 14:43:11 +02:00
m_originColor = parseColor(originColor);
2012-08-23 12:46:22 +02:00
}
void TileGenerator::setPlayerColor(const std::string &playerColor)
{
2012-08-23 14:43:11 +02:00
m_playerColor = parseColor(playerColor);
}
2016-07-06 21:45:38 +02:00
void TileGenerator::setZoom(int zoom)
{
2016-11-18 23:57:09 +01:00
if (zoom < 1)
2016-07-06 21:45:38 +02:00
throw std::runtime_error("Zoom level needs to be a number: 1 or higher");
m_zoom = zoom;
}
void TileGenerator::setScales(uint flags)
{
m_scales = flags;
}
2012-08-23 12:46:22 +02:00
void TileGenerator::setDrawOrigin(bool drawOrigin)
{
m_drawOrigin = drawOrigin;
}
void TileGenerator::setDrawPlayers(bool drawPlayers)
{
m_drawPlayers = drawPlayers;
}
void TileGenerator::setDrawScale(bool drawScale)
{
m_drawScale = drawScale;
}
void TileGenerator::setDrawAlpha(bool drawAlpha)
{
2016-07-06 21:45:38 +02:00
m_drawAlpha = drawAlpha;
}
void TileGenerator::setShading(bool shading)
{
m_shading = shading;
}
void TileGenerator::setBackend(std::string backend)
{
m_backend = backend;
}
2012-11-24 19:25:13 +01:00
void TileGenerator::setGeometry(int x, int y, int w, int h)
{
assert(w > 0 && h > 0);
2014-09-01 18:37:07 +02:00
m_geomX = round_multiple_nosign(x, 16) / 16;
m_geomY = round_multiple_nosign(y, 16) / 16;
m_geomX2 = round_multiple_nosign(x + w, 16) / 16;
m_geomY2 = round_multiple_nosign(y + h, 16) / 16;
2012-11-24 19:25:13 +01:00
}
2014-03-05 18:06:05 +01:00
void TileGenerator::setMinY(int y)
{
m_yMin = y;
if (m_yMin > m_yMax)
std::swap(m_yMin, m_yMax);
2014-03-05 18:06:05 +01:00
}
void TileGenerator::setMaxY(int y)
{
m_yMax = y;
if (m_yMin > m_yMax)
std::swap(m_yMin, m_yMax);
2014-03-05 18:06:05 +01:00
}
void TileGenerator::setExhaustiveSearch(int mode)
{
m_exhaustiveSearch = mode;
}
void TileGenerator::setDontWriteEmpty(bool f)
{
m_dontWriteEmpty = f;
}
void TileGenerator::parseColorsFile(const std::string &fileName)
{
std::ifstream in(fileName);
if (!in.good())
2016-11-18 23:57:09 +01:00
throw std::runtime_error("Specified colors file could not be found");
2012-09-01 15:51:02 +02:00
parseColorsStream(in);
}
2022-02-09 22:46:07 +01:00
void TileGenerator::printGeometry(const std::string &input_path)
{
setExhaustiveSearch(EXH_NEVER);
openDb(input_path);
loadBlocks();
std::cout << "Map extent: "
<< m_xMin*16 << ":" << m_zMin*16
<< "+" << (m_xMax - m_xMin+1)*16
<< "+" << (m_zMax - m_zMin+1)*16
<< std::endl;
closeDatabase();
}
2022-02-09 22:46:07 +01:00
void TileGenerator::dumpBlock(const std::string &input_path, BlockPos pos)
{
openDb(input_path);
BlockList list;
std::vector<BlockPos> positions;
positions.emplace_back(pos);
m_db->getBlocksByPos(list, positions);
if (!list.empty()) {
const ustring &data = list.begin()->second;
for (u8 c : data)
printf("%02x", static_cast<int>(c));
printf("\n");
}
closeDatabase();
}
2022-02-09 22:46:07 +01:00
void TileGenerator::generate(const std::string &input_path, const std::string &output)
2012-08-23 13:32:22 +02:00
{
if (m_dontWriteEmpty) // FIXME: possible too, just needs to be done differently
setExhaustiveSearch(EXH_NEVER);
2012-09-01 13:41:00 +02:00
openDb(input_path);
2012-08-23 13:32:22 +02:00
loadBlocks();
if (m_dontWriteEmpty && m_positions.empty())
{
closeDatabase();
return;
}
2012-08-23 14:21:34 +02:00
createImage();
2012-08-23 15:35:00 +02:00
renderMap();
closeDatabase();
2012-08-25 14:11:55 +02:00
if (m_drawScale) {
renderScale();
}
2012-08-25 15:21:51 +02:00
if (m_drawOrigin) {
renderOrigin();
}
2012-08-25 16:29:41 +02:00
if (m_drawPlayers) {
2012-09-01 13:41:00 +02:00
renderPlayers(input_path);
2012-08-25 16:29:41 +02:00
}
2012-08-23 14:21:34 +02:00
writeImage(output);
2012-08-25 16:41:53 +02:00
printUnknown();
2012-08-23 13:32:22 +02:00
}
2012-09-01 15:51:02 +02:00
void TileGenerator::parseColorsStream(std::istream &in)
{
char line[512];
2012-09-01 15:51:02 +02:00
while (in.good()) {
2020-03-26 23:07:27 +01:00
in.getline(line, sizeof(line));
2022-02-09 22:46:07 +01:00
for (char *p = line; *p; p++) {
if (*p != '#')
2016-10-08 13:39:07 +02:00
continue;
*p = '\0'; // Cut off at the first #
break;
}
2022-02-09 22:46:07 +01:00
if(!line[0])
continue;
2016-10-08 13:39:07 +02:00
2022-02-09 22:46:07 +01:00
char name[200 + 1] = {0};
unsigned int r, g, b, a = 255, t = 0;
int items = sscanf(line, "%200s %u %u %u %u %u", name, &r, &g, &b, &a, &t);
if (items < 4) {
2016-10-09 15:19:35 +02:00
std::cerr << "Failed to parse color entry '" << line << "'" << std::endl;
continue;
}
m_colorMap[name] = ColorEntry(r, g, b, a, t);
2012-09-01 15:51:02 +02:00
}
}
2020-03-28 14:02:27 +01:00
std::set<std::string> TileGenerator::getSupportedBackends()
{
std::set<std::string> r;
r.insert("sqlite3");
#if USE_POSTGRESQL
r.insert("postgresql");
#endif
#if USE_LEVELDB
r.insert("leveldb");
#endif
#if USE_REDIS
r.insert("redis");
#endif
return r;
}
2022-02-09 22:46:07 +01:00
void TileGenerator::openDb(const std::string &input_path)
2012-08-23 13:32:22 +02:00
{
2022-02-09 22:46:07 +01:00
std::string input = input_path;
if (input.back() != PATH_SEPARATOR)
input += PATH_SEPARATOR;
std::string backend = m_backend;
2022-02-09 22:46:07 +01:00
if (backend.empty()) {
std::ifstream ifs(input + "world.mt");
if(!ifs.good())
throw std::runtime_error("Failed to open world.mt");
backend = read_setting_default("backend", ifs, "sqlite3");
ifs.close();
}
2014-07-08 14:54:27 +02:00
2022-02-09 22:46:07 +01:00
if (backend == "sqlite3")
2014-03-05 21:41:27 +01:00
m_db = new DBSQLite3(input);
2017-01-08 23:24:09 +01:00
#if USE_POSTGRESQL
2022-02-09 22:46:07 +01:00
else if (backend == "postgresql")
2017-01-08 23:24:09 +01:00
m_db = new DBPostgreSQL(input);
#endif
2014-03-05 21:41:27 +01:00
#if USE_LEVELDB
2022-02-09 22:46:07 +01:00
else if (backend == "leveldb")
2014-03-05 21:41:27 +01:00
m_db = new DBLevelDB(input);
2014-04-26 15:01:35 +02:00
#endif
#if USE_REDIS
2022-02-09 22:46:07 +01:00
else if (backend == "redis")
2014-04-26 15:01:35 +02:00
m_db = new DBRedis(input);
2014-03-05 21:41:27 +01:00
#endif
else
2022-02-09 22:46:07 +01:00
throw std::runtime_error(std::string("Unknown map backend: ") + backend);
// Determine how we're going to traverse the database (heuristic)
if (m_exhaustiveSearch == EXH_AUTO) {
size_t y_range = (m_yMax / 16 + 1) - (m_yMin / 16);
size_t blocks = sat_mul<size_t>(m_geomX2 - m_geomX, y_range, m_geomY2 - m_geomY);
#ifndef NDEBUG
std::cerr << "Heuristic parameters:"
<< " preferRangeQueries()=" << m_db->preferRangeQueries()
<< " y_range=" << y_range << " blocks=" << blocks << std::endl;
#endif
if (m_db->preferRangeQueries())
m_exhaustiveSearch = EXH_NEVER;
else if (blocks < 200000)
m_exhaustiveSearch = EXH_FULL;
else if (y_range < 42)
m_exhaustiveSearch = EXH_Y;
else
m_exhaustiveSearch = EXH_NEVER;
} else if (m_exhaustiveSearch == EXH_FULL || m_exhaustiveSearch == EXH_Y) {
if (m_db->preferRangeQueries()) {
std::cerr << "Note: The current database backend supports efficient "
"range queries, forcing exhaustive search should always result "
" in worse performance." << std::endl;
}
}
assert(m_exhaustiveSearch != EXH_AUTO);
2012-08-23 13:32:22 +02:00
}
void TileGenerator::closeDatabase()
{
delete m_db;
m_db = NULL;
}
static inline int16_t mod16(int16_t y)
{
if (y < 0)
return (y - 15) / 16;
return y / 16;
}
2012-08-23 13:32:22 +02:00
void TileGenerator::loadBlocks()
{
const int16_t yMax = mod16(m_yMax) + 1;
const int16_t yMin = mod16(m_yMin);
if (m_exhaustiveSearch == EXH_NEVER || m_exhaustiveSearch == EXH_Y) {
std::vector<BlockPos> vec = m_db->getBlockPos(
BlockPos(m_geomX, yMin, m_geomY),
BlockPos(m_geomX2, yMax, m_geomY2)
);
for (auto pos : vec) {
assert(pos.x >= m_geomX && pos.x < m_geomX2);
assert(pos.y >= yMin && pos.y < yMax);
assert(pos.z >= m_geomY && pos.z < m_geomY2);
// Adjust minimum and maximum positions to the nearest block
if (pos.x < m_xMin)
m_xMin = pos.x;
if (pos.x > m_xMax)
m_xMax = pos.x;
if (pos.z < m_zMin)
m_zMin = pos.z;
if (pos.z > m_zMax)
m_zMax = pos.z;
m_positions[pos.z].emplace(pos.x);
}
size_t count = 0;
for (const auto &it : m_positions)
count += it.second.size();
m_progressMax = count;
#ifndef NDEBUG
std::cerr << "Loaded " << count
<< " positions (across Z: " << m_positions.size() << ") for rendering" << std::endl;
#endif
}
2012-08-23 13:32:22 +02:00
}
2012-08-23 14:21:34 +02:00
void TileGenerator::createImage()
{
const int scale_d = 40; // pixels reserved for a scale
if(!m_drawScale)
m_scales = 0;
// If a geometry is explicitly set, set the bounding box to the requested geometry
// instead of cropping to the content. This way we will always output a full tile
// of the correct size.
if (m_geomX > -2048 && m_geomX2 < 2048)
{
m_xMin = m_geomX;
m_xMax = m_geomX2-1;
}
if (m_geomY > -2048 && m_geomY2 < 2048)
{
m_zMin = m_geomY;
m_zMax = m_geomY2-1;
}
2012-08-25 13:19:58 +02:00
m_mapWidth = (m_xMax - m_xMin + 1) * 16;
m_mapHeight = (m_zMax - m_zMin + 1) * 16;
m_xBorder = (m_scales & SCALE_LEFT) ? scale_d : 0;
m_yBorder = (m_scales & SCALE_TOP) ? scale_d : 0;
2016-11-18 23:57:09 +01:00
m_blockPixelAttributes.setWidth(m_mapWidth);
int image_width, image_height;
image_width = (m_mapWidth * m_zoom) + m_xBorder;
image_width += (m_scales & SCALE_RIGHT) ? scale_d : 0;
image_height = (m_mapHeight * m_zoom) + m_yBorder;
image_height += (m_scales & SCALE_BOTTOM) ? scale_d : 0;
2016-11-18 23:57:09 +01:00
2020-03-26 23:07:27 +01:00
if(image_width > 4096 || image_height > 4096) {
std::cerr << "Warning: The width or height of the image to be created exceeds 4096 pixels!"
<< " (Dimensions: " << image_width << "x" << image_height << ")"
<< std::endl;
2020-03-26 23:07:27 +01:00
}
m_image = new Image(image_width, image_height);
m_image->drawFilledRect(0, 0, image_width, image_height, m_bgColor); // Background
2012-08-23 14:21:34 +02:00
}
2014-03-05 21:41:27 +01:00
void TileGenerator::renderMap()
{
2018-03-25 15:19:48 +02:00
BlockDecoder blk;
const int16_t yMax = mod16(m_yMax) + 1;
const int16_t yMin = mod16(m_yMin);
size_t count = 0;
auto renderSingle = [&] (int16_t xPos, int16_t zPos, BlockList &blockStack) {
m_readPixels.reset();
m_readInfo.reset();
for (int i = 0; i < 16; i++) {
for (int j = 0; j < 16; j++) {
m_color[i][j] = m_bgColor; // This will be drawn by renderMapBlockBottom() for y-rows with only 'air', 'ignore' or unknown nodes if --drawalpha is used
m_color[i][j].a = 0; // ..but set alpha to 0 to tell renderMapBlock() not to use this color to mix a shade
m_thickness[i][j] = 0;
2012-08-24 22:51:17 +02:00
}
}
2012-08-24 22:51:17 +02:00
for (const auto &it : blockStack) {
const BlockPos pos = it.first;
assert(pos.x == xPos && pos.z == zPos);
assert(pos.y >= yMin && pos.y < yMax);
2012-08-24 22:51:17 +02:00
blk.reset();
blk.decode(it.second);
if (blk.isEmpty())
continue;
renderMapBlock(blk, pos);
// Exit out if all pixels for this MapBlock are covered
if (m_readPixels.full())
break;
2012-08-24 22:51:17 +02:00
}
if (!m_readPixels.full())
renderMapBlockBottom(blockStack.begin()->first);
m_renderedAny |= m_readInfo.any();
};
auto postRenderRow = [&] (int16_t zPos) {
2018-03-25 15:44:30 +02:00
if (m_shading)
renderShading(zPos);
};
if (m_exhaustiveSearch == EXH_NEVER) {
for (auto it = m_positions.rbegin(); it != m_positions.rend(); ++it) {
int16_t zPos = it->first;
for (auto it2 = it->second.rbegin(); it2 != it->second.rend(); ++it2) {
int16_t xPos = *it2;
BlockList blockStack;
m_db->getBlocksOnXZ(blockStack, xPos, zPos, yMin, yMax);
blockStack.sort();
renderSingle(xPos, zPos, blockStack);
reportProgress(count++);
}
postRenderRow(zPos);
}
} else if (m_exhaustiveSearch == EXH_Y) {
#ifndef NDEBUG
std::cerr << "Exhaustively searching height of "
<< (yMax - yMin) << " blocks" << std::endl;
#endif
std::vector<BlockPos> positions;
positions.reserve(yMax - yMin);
for (auto it = m_positions.rbegin(); it != m_positions.rend(); ++it) {
int16_t zPos = it->first;
for (auto it2 = it->second.rbegin(); it2 != it->second.rend(); ++it2) {
int16_t xPos = *it2;
positions.clear();
for (int16_t yPos = yMin; yPos < yMax; yPos++)
positions.emplace_back(xPos, yPos, zPos);
BlockList blockStack;
m_db->getBlocksByPos(blockStack, positions);
blockStack.sort();
renderSingle(xPos, zPos, blockStack);
reportProgress(count++);
}
postRenderRow(zPos);
}
} else if (m_exhaustiveSearch == EXH_FULL) {
const size_t span_y = yMax - yMin;
m_progressMax = (m_geomX2 - m_geomX) * span_y * (m_geomY2 - m_geomY);
#ifndef NDEBUG
std::cerr << "Exhaustively searching "
<< (m_geomX2 - m_geomX) << "x" << span_y << "x"
<< (m_geomY2 - m_geomY) << " blocks" << std::endl;
#endif
std::vector<BlockPos> positions;
positions.reserve(span_y);
for (int16_t zPos = m_geomY2 - 1; zPos >= m_geomY; zPos--) {
for (int16_t xPos = m_geomX2 - 1; xPos >= m_geomX; xPos--) {
positions.clear();
for (int16_t yPos = yMin; yPos < yMax; yPos++)
positions.emplace_back(xPos, yPos, zPos);
BlockList blockStack;
m_db->getBlocksByPos(blockStack, positions);
blockStack.sort();
renderSingle(xPos, zPos, blockStack);
reportProgress(count++);
}
postRenderRow(zPos);
}
2012-08-24 22:51:17 +02:00
}
reportProgress(m_progressMax);
2012-08-24 22:51:17 +02:00
}
2018-03-25 15:19:48 +02:00
void TileGenerator::renderMapBlock(const BlockDecoder &blk, const BlockPos &pos)
2012-08-24 22:51:17 +02:00
{
int xBegin = (pos.x - m_xMin) * 16;
int zBegin = (m_zMax - pos.z) * 16;
2014-03-26 16:28:24 +01:00
int minY = (pos.y * 16 > m_yMin) ? 0 : m_yMin - pos.y * 16;
2020-03-28 00:40:38 +01:00
int maxY = (pos.y * 16 + 15 < m_yMax) ? 15 : m_yMax - pos.y * 16;
2012-08-24 22:51:17 +02:00
for (int z = 0; z < 16; ++z) {
2016-07-06 21:45:38 +02:00
int imageY = zBegin + 15 - z;
2012-08-24 22:51:17 +02:00
for (int x = 0; x < 16; ++x) {
2018-03-25 15:44:30 +02:00
if (m_readPixels.get(x, z))
2012-08-24 22:51:17 +02:00
continue;
2016-07-06 21:45:38 +02:00
int imageX = xBegin + x;
auto &attr = m_blockPixelAttributes.attribute(15 - z, xBegin + x);
2014-03-26 16:28:24 +01:00
2014-03-05 18:06:05 +01:00
for (int y = maxY; y >= minY; --y) {
const std::string &name = blk.getNode(x, y, z);
if (name.empty())
2012-08-24 22:51:17 +02:00
continue;
2018-03-25 15:44:30 +02:00
ColorMap::const_iterator it = m_colorMap.find(name);
if (it == m_colorMap.end()) {
m_unknownNodes.insert(name);
continue;
2012-08-24 22:51:17 +02:00
}
Color c = it->second.toColor();
if (c.a == 0)
continue; // node is fully invisible
2018-03-25 15:44:30 +02:00
if (m_drawAlpha) {
if (m_color[z][x].a != 0)
c = mixColors(m_color[z][x], c);
if (c.a < 255) {
// remember color and near thickness value
m_color[z][x] = c;
m_thickness[z][x] = (m_thickness[z][x] + it->second.t) / 2;
2018-03-25 15:44:30 +02:00
continue;
}
// color became opaque, draw it
setZoomed(imageX, imageY, c);
attr.thickness = m_thickness[z][x];
2018-03-25 15:44:30 +02:00
} else {
c.a = 255;
setZoomed(imageX, imageY, c);
2018-03-25 15:44:30 +02:00
}
m_readPixels.set(x, z);
2018-03-25 16:22:51 +02:00
// do this afterwards so we can record height values
2018-03-25 15:44:30 +02:00
// inside transparent nodes (water) too
2018-03-25 16:22:51 +02:00
if (!m_readInfo.get(x, z)) {
attr.height = pos.y * 16 + y;
2018-03-25 15:44:30 +02:00
m_readInfo.set(x, z);
}
break;
2012-08-24 11:01:48 +02:00
}
}
2012-08-24 09:46:14 +02:00
}
}
2012-08-23 15:35:00 +02:00
2016-11-18 23:57:09 +01:00
void TileGenerator::renderMapBlockBottom(const BlockPos &pos)
2014-07-08 14:58:40 +02:00
{
2018-03-25 15:44:30 +02:00
if (!m_drawAlpha)
return; // "missing" pixels can only happen with --drawalpha
2014-07-08 14:58:40 +02:00
int xBegin = (pos.x - m_xMin) * 16;
int zBegin = (m_zMax - pos.z) * 16;
for (int z = 0; z < 16; ++z) {
2016-07-06 21:45:38 +02:00
int imageY = zBegin + 15 - z;
2014-07-08 14:58:40 +02:00
for (int x = 0; x < 16; ++x) {
2018-03-25 15:44:30 +02:00
if (m_readPixels.get(x, z))
2014-07-08 14:58:40 +02:00
continue;
2016-07-06 21:45:38 +02:00
int imageX = xBegin + x;
auto &attr = m_blockPixelAttributes.attribute(15 - z, xBegin + x);
2014-07-08 14:58:40 +02:00
2018-03-25 15:44:30 +02:00
// set color since it wasn't done in renderMapBlock()
setZoomed(imageX, imageY, m_color[z][x]);
m_readPixels.set(x, z);
attr.thickness = m_thickness[z][x];
2014-07-08 14:58:40 +02:00
}
}
}
2016-11-18 23:57:09 +01:00
void TileGenerator::renderShading(int zPos)
2012-08-25 13:19:58 +02:00
{
auto &a = m_blockPixelAttributes;
2012-08-25 13:19:58 +02:00
int zBegin = (m_zMax - zPos) * 16;
2012-09-01 13:34:27 +02:00
for (int z = 0; z < 16; ++z) {
2012-08-25 13:19:58 +02:00
int imageY = zBegin + z;
2016-11-18 23:57:09 +01:00
if (imageY >= m_mapHeight)
2012-08-25 13:19:58 +02:00
continue;
for (int x = 0; x < m_mapWidth; ++x) {
2016-11-18 23:57:09 +01:00
if(
!a.attribute(z, x).valid_height() ||
!a.attribute(z, x - 1).valid_height() ||
!a.attribute(z - 1, x).valid_height()
2016-11-18 23:57:09 +01:00
)
2012-08-25 13:27:40 +02:00
continue;
2016-11-18 23:57:09 +01:00
// calculate shadow to apply
int y = a.attribute(z, x).height;
int y1 = a.attribute(z, x - 1).height;
int y2 = a.attribute(z - 1, x).height;
2012-08-25 13:19:58 +02:00
int d = ((y - y1) + (y - y2)) * 12;
if (m_drawAlpha) { // less visible shadow with increasing "thickness"
float t = a.attribute(z, x).thickness * 1.2f;
t = mymin(t, 255.0f);
d *= 1.0f - t / 255.0f;
}
d = mymin(d, 36);
2016-11-18 23:57:09 +01:00
// apply shadow/light by just adding to it pixel values
Color c = m_image->getPixel(getImageX(x), getImageY(imageY));
c.r = colorSafeBounds(c.r + d);
c.g = colorSafeBounds(c.g + d);
c.b = colorSafeBounds(c.b + d);
setZoomed(x, imageY, c);
2012-08-25 13:19:58 +02:00
}
}
a.scroll();
2012-08-25 13:19:58 +02:00
}
2012-08-25 14:11:55 +02:00
void TileGenerator::renderScale()
{
2018-03-25 16:22:51 +02:00
const int scale_d = 40; // see createImage()
if (m_scales & SCALE_TOP) {
m_image->drawText(24, 0, "X", m_scaleColor);
for (int i = (m_xMin / 4) * 4; i <= m_xMax; i += 4) {
2018-10-20 23:01:03 +02:00
std::ostringstream buf;
buf << i * 16;
2012-08-25 15:06:11 +02:00
2018-03-24 14:54:45 +01:00
int xPos = getImageX(i * 16, true);
if (xPos >= 0) {
m_image->drawText(xPos + 2, 0, buf.str(), m_scaleColor);
m_image->drawLine(xPos, 0, xPos, m_yBorder - 1, m_scaleColor);
}
}
2012-08-25 15:06:11 +02:00
}
if (m_scales & SCALE_LEFT) {
m_image->drawText(2, 24, "Z", m_scaleColor);
for (int i = (m_zMax / 4) * 4; i >= m_zMin; i -= 4) {
2018-10-20 23:01:03 +02:00
std::ostringstream buf;
buf << i * 16;
2012-08-25 15:06:11 +02:00
2018-03-24 14:54:45 +01:00
int yPos = getImageY(i * 16 + 1, true);
if (yPos >= 0) {
m_image->drawText(2, yPos, buf.str(), m_scaleColor);
m_image->drawLine(0, yPos, m_xBorder - 1, yPos, m_scaleColor);
}
}
}
if (m_scales & SCALE_BOTTOM) {
2018-03-25 16:22:51 +02:00
int xPos = m_xBorder + m_mapWidth*m_zoom - 24 - 8,
yPos = m_yBorder + m_mapHeight*m_zoom + scale_d - 12;
m_image->drawText(xPos, yPos, "X", m_scaleColor);
for (int i = (m_xMin / 4) * 4; i <= m_xMax; i += 4) {
2018-10-20 23:01:03 +02:00
std::ostringstream buf;
buf << i * 16;
2018-03-25 16:22:51 +02:00
xPos = getImageX(i * 16, true);
yPos = m_yBorder + m_mapHeight*m_zoom;
if (xPos >= 0) {
m_image->drawText(xPos + 2, yPos, buf.str(), m_scaleColor);
m_image->drawLine(xPos, yPos, xPos, yPos + 39, m_scaleColor);
}
}
}
if (m_scales & SCALE_RIGHT) {
2018-03-25 16:22:51 +02:00
int xPos = m_xBorder + m_mapWidth*m_zoom + scale_d - 2 - 8,
yPos = m_yBorder + m_mapHeight*m_zoom - 24 - 12;
m_image->drawText(xPos, yPos, "Z", m_scaleColor);
for (int i = (m_zMax / 4) * 4; i >= m_zMin; i -= 4) {
2018-10-20 23:01:03 +02:00
std::ostringstream buf;
buf << i * 16;
2018-03-25 16:22:51 +02:00
xPos = m_xBorder + m_mapWidth*m_zoom;
yPos = getImageY(i * 16 + 1, true);
if (yPos >= 0) {
m_image->drawText(xPos + 2, yPos, buf.str(), m_scaleColor);
m_image->drawLine(xPos, yPos, xPos + 39, yPos, m_scaleColor);
}
}
2012-08-25 15:06:11 +02:00
}
2012-08-25 14:11:55 +02:00
}
2012-08-25 15:21:51 +02:00
void TileGenerator::renderOrigin()
{
2018-03-24 14:54:45 +01:00
if (m_xMin > 0 || m_xMax < 0 ||
m_zMin > 0 || m_zMax < 0)
return;
m_image->drawCircle(getImageX(0, true), getImageY(0, true), 12, m_originColor);
2012-08-25 15:21:51 +02:00
}
2022-02-21 18:42:54 +01:00
void TileGenerator::renderPlayers(const std::string &input_path)
2012-08-25 16:29:41 +02:00
{
2022-02-21 18:42:54 +01:00
std::string input = input_path;
if (input.back() != PATH_SEPARATOR)
input += PATH_SEPARATOR;
PlayerAttributes players(input);
2020-03-26 23:07:27 +01:00
for (auto &player : players) {
if (player.x < m_xMin * 16 || player.x > m_xMax * 16 ||
player.z < m_zMin * 16 || player.z > m_zMax * 16)
2018-03-24 14:54:45 +01:00
continue;
2020-03-26 23:07:27 +01:00
if (player.y < m_yMin || player.y > m_yMax)
2018-03-25 16:22:51 +02:00
continue;
2020-03-26 23:07:27 +01:00
int imageX = getImageX(player.x, true),
imageY = getImageY(player.z, true);
2012-09-01 13:01:31 +02:00
2018-03-25 16:22:51 +02:00
m_image->drawFilledRect(imageX - 1, imageY, 3, 1, m_playerColor);
m_image->drawFilledRect(imageX, imageY - 1, 1, 3, m_playerColor);
2020-03-26 23:07:27 +01:00
m_image->drawText(imageX + 2, imageY, player.name, m_playerColor);
2012-09-01 13:01:31 +02:00
}
2012-08-25 16:29:41 +02:00
}
2012-08-23 14:21:34 +02:00
void TileGenerator::writeImage(const std::string &output)
{
m_image->save(output);
delete m_image;
2022-02-09 22:46:07 +01:00
m_image = nullptr;
2012-08-23 14:21:34 +02:00
}
2012-08-25 16:41:53 +02:00
void TileGenerator::printUnknown()
{
2022-02-09 22:46:07 +01:00
if (m_unknownNodes.empty())
2018-03-25 16:22:51 +02:00
return;
std::cerr << "Unknown nodes:" << std::endl;
2020-03-26 23:07:27 +01:00
for (const auto &node : m_unknownNodes)
std::cerr << "\t" << node << std::endl;
if (!m_renderedAny) {
std::cerr << "The map was read successfully and not empty, but none of the "
"encountered nodes had a color associated.\nCheck that you're using "
"the right colors.txt. It should match the game you have installed." << std::endl;
}
2012-08-25 16:41:53 +02:00
}
void TileGenerator::reportProgress(size_t count)
{
if (!m_progressMax)
return;
int percent = count / static_cast<float>(m_progressMax) * 100;
if (percent == m_progressLast)
return;
m_progressLast = percent;
// Print a nice-looking ASCII progress bar
char bar[51] = {0};
memset(bar, ' ', 50);
int i = 0, j = percent;
for (; j >= 2; j -= 2)
bar[i++] = '=';
if (j)
bar[i++] = '-';
std::cout << "[" << bar << "] " << percent << "% " << (percent == 100 ? "\n" : "\r");
std::cout.flush();
}
2018-03-24 14:54:45 +01:00
inline int TileGenerator::getImageX(int val, bool absolute) const
2012-08-25 14:11:55 +02:00
{
2018-03-24 14:54:45 +01:00
if (absolute)
val = (val - m_xMin * 16);
return (m_zoom*val) + m_xBorder;
2012-08-25 14:11:55 +02:00
}
2018-03-24 14:54:45 +01:00
inline int TileGenerator::getImageY(int val, bool absolute) const
2012-08-25 14:11:55 +02:00
{
2018-03-24 14:54:45 +01:00
if (absolute)
val = m_mapHeight - (val - m_zMin * 16); // Z axis is flipped on image
return (m_zoom*val) + m_yBorder;
2016-07-06 21:45:38 +02:00
}
2016-11-18 23:57:09 +01:00
inline void TileGenerator::setZoomed(int x, int y, Color color)
{
m_image->drawFilledRect(getImageX(x), getImageY(y), m_zoom, m_zoom, color);
2012-08-25 14:11:55 +02:00
}