emerge.cpp 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675
  1. /*
  2. Minetest
  3. Copyright (C) 2010-2013 celeron55, Perttu Ahola <celeron55@gmail.com>
  4. Copyright (C) 2010-2013 kwolekr, Ryan Kwolek <kwolekr@minetest.net>
  5. This program is free software; you can redistribute it and/or modify
  6. it under the terms of the GNU Lesser General Public License as published by
  7. the Free Software Foundation; either version 2.1 of the License, or
  8. (at your option) any later version.
  9. This program is distributed in the hope that it will be useful,
  10. but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12. GNU Lesser General Public License for more details.
  13. You should have received a copy of the GNU Lesser General Public License along
  14. with this program; if not, write to the Free Software Foundation, Inc.,
  15. 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
  16. */
  17. #include "emerge.h"
  18. #include <iostream>
  19. #include <queue>
  20. #include "util/container.h"
  21. #include "util/thread.h"
  22. #include "threading/event.h"
  23. #include "config.h"
  24. #include "constants.h"
  25. #include "environment.h"
  26. #include "log.h"
  27. #include "map.h"
  28. #include "mapblock.h"
  29. #include "mg_biome.h"
  30. #include "mg_ore.h"
  31. #include "mg_decoration.h"
  32. #include "mg_schematic.h"
  33. #include "nodedef.h"
  34. #include "profiler.h"
  35. #include "scripting_server.h"
  36. #include "server.h"
  37. #include "serverobject.h"
  38. #include "settings.h"
  39. #include "voxel.h"
  40. class EmergeThread : public Thread {
  41. public:
  42. bool enable_mapgen_debug_info;
  43. int id;
  44. EmergeThread(Server *server, int ethreadid);
  45. ~EmergeThread() = default;
  46. void *run();
  47. void signal();
  48. // Requires queue mutex held
  49. bool pushBlock(const v3s16 &pos);
  50. void cancelPendingItems();
  51. static void runCompletionCallbacks(
  52. const v3s16 &pos, EmergeAction action,
  53. const EmergeCallbackList &callbacks);
  54. private:
  55. Server *m_server;
  56. ServerMap *m_map;
  57. EmergeManager *m_emerge;
  58. Mapgen *m_mapgen;
  59. Event m_queue_event;
  60. std::queue<v3s16> m_block_queue;
  61. bool popBlockEmerge(v3s16 *pos, BlockEmergeData *bedata);
  62. EmergeAction getBlockOrStartGen(
  63. const v3s16 &pos, bool allow_gen, MapBlock **block, BlockMakeData *data);
  64. MapBlock *finishGen(v3s16 pos, BlockMakeData *bmdata,
  65. std::map<v3s16, MapBlock *> *modified_blocks);
  66. friend class EmergeManager;
  67. };
  68. class MapEditEventAreaIgnorer
  69. {
  70. public:
  71. MapEditEventAreaIgnorer(VoxelArea *ignorevariable, const VoxelArea &a):
  72. m_ignorevariable(ignorevariable)
  73. {
  74. if(m_ignorevariable->getVolume() == 0)
  75. *m_ignorevariable = a;
  76. else
  77. m_ignorevariable = NULL;
  78. }
  79. ~MapEditEventAreaIgnorer()
  80. {
  81. if(m_ignorevariable)
  82. {
  83. assert(m_ignorevariable->getVolume() != 0);
  84. *m_ignorevariable = VoxelArea();
  85. }
  86. }
  87. private:
  88. VoxelArea *m_ignorevariable;
  89. };
  90. ////
  91. //// EmergeManager
  92. ////
  93. EmergeManager::EmergeManager(Server *server)
  94. {
  95. this->ndef = server->getNodeDefManager();
  96. this->biomemgr = new BiomeManager(server);
  97. this->oremgr = new OreManager(server);
  98. this->decomgr = new DecorationManager(server);
  99. this->schemmgr = new SchematicManager(server);
  100. // Note that accesses to this variable are not synchronized.
  101. // This is because the *only* thread ever starting or stopping
  102. // EmergeThreads should be the ServerThread.
  103. enable_mapgen_debug_info = g_settings->getBool("enable_mapgen_debug_info");
  104. // If unspecified, leave a proc for the main thread and one for
  105. // some other misc thread
  106. s16 nthreads = 0;
  107. if (!g_settings->getS16NoEx("num_emerge_threads", nthreads))
  108. nthreads = Thread::getNumberOfProcessors() - 2;
  109. if (nthreads < 1)
  110. nthreads = 1;
  111. m_qlimit_total = g_settings->getU16("emergequeue_limit_total");
  112. if (!g_settings->getU16NoEx("emergequeue_limit_diskonly", m_qlimit_diskonly))
  113. m_qlimit_diskonly = nthreads * 5 + 1;
  114. if (!g_settings->getU16NoEx("emergequeue_limit_generate", m_qlimit_generate))
  115. m_qlimit_generate = nthreads + 1;
  116. // don't trust user input for something very important like this
  117. if (m_qlimit_total < 1)
  118. m_qlimit_total = 1;
  119. if (m_qlimit_diskonly < 1)
  120. m_qlimit_diskonly = 1;
  121. if (m_qlimit_generate < 1)
  122. m_qlimit_generate = 1;
  123. for (s16 i = 0; i < nthreads; i++)
  124. m_threads.push_back(new EmergeThread(server, i));
  125. infostream << "EmergeManager: using " << nthreads << " threads" << std::endl;
  126. }
  127. EmergeManager::~EmergeManager()
  128. {
  129. for (u32 i = 0; i != m_threads.size(); i++) {
  130. EmergeThread *thread = m_threads[i];
  131. if (m_threads_active) {
  132. thread->stop();
  133. thread->signal();
  134. thread->wait();
  135. }
  136. delete thread;
  137. delete m_mapgens[i];
  138. }
  139. delete biomemgr;
  140. delete oremgr;
  141. delete decomgr;
  142. delete schemmgr;
  143. }
  144. bool EmergeManager::initMapgens(MapgenParams *params)
  145. {
  146. if (!m_mapgens.empty())
  147. return false;
  148. this->mgparams = params;
  149. for (u32 i = 0; i != m_threads.size(); i++) {
  150. Mapgen *mg = Mapgen::createMapgen(params->mgtype, i, params, this);
  151. m_mapgens.push_back(mg);
  152. }
  153. return true;
  154. }
  155. Mapgen *EmergeManager::getCurrentMapgen()
  156. {
  157. if (!m_threads_active)
  158. return NULL;
  159. for (u32 i = 0; i != m_threads.size(); i++) {
  160. if (m_threads[i]->isCurrentThread())
  161. return m_threads[i]->m_mapgen;
  162. }
  163. return NULL;
  164. }
  165. void EmergeManager::startThreads()
  166. {
  167. if (m_threads_active)
  168. return;
  169. for (u32 i = 0; i != m_threads.size(); i++)
  170. m_threads[i]->start();
  171. m_threads_active = true;
  172. }
  173. void EmergeManager::stopThreads()
  174. {
  175. if (!m_threads_active)
  176. return;
  177. // Request thread stop in parallel
  178. for (u32 i = 0; i != m_threads.size(); i++) {
  179. m_threads[i]->stop();
  180. m_threads[i]->signal();
  181. }
  182. // Then do the waiting for each
  183. for (u32 i = 0; i != m_threads.size(); i++)
  184. m_threads[i]->wait();
  185. m_threads_active = false;
  186. }
  187. bool EmergeManager::isRunning()
  188. {
  189. return m_threads_active;
  190. }
  191. bool EmergeManager::enqueueBlockEmerge(
  192. u16 peer_id,
  193. v3s16 blockpos,
  194. bool allow_generate,
  195. bool ignore_queue_limits)
  196. {
  197. u16 flags = 0;
  198. if (allow_generate)
  199. flags |= BLOCK_EMERGE_ALLOW_GEN;
  200. if (ignore_queue_limits)
  201. flags |= BLOCK_EMERGE_FORCE_QUEUE;
  202. return enqueueBlockEmergeEx(blockpos, peer_id, flags, NULL, NULL);
  203. }
  204. bool EmergeManager::enqueueBlockEmergeEx(
  205. v3s16 blockpos,
  206. u16 peer_id,
  207. u16 flags,
  208. EmergeCompletionCallback callback,
  209. void *callback_param)
  210. {
  211. EmergeThread *thread = NULL;
  212. bool entry_already_exists = false;
  213. {
  214. MutexAutoLock queuelock(m_queue_mutex);
  215. if (!pushBlockEmergeData(blockpos, peer_id, flags,
  216. callback, callback_param, &entry_already_exists))
  217. return false;
  218. if (entry_already_exists)
  219. return true;
  220. thread = getOptimalThread();
  221. thread->pushBlock(blockpos);
  222. }
  223. thread->signal();
  224. return true;
  225. }
  226. //
  227. // Mapgen-related helper functions
  228. //
  229. // TODO(hmmmm): Move this to ServerMap
  230. v3s16 EmergeManager::getContainingChunk(v3s16 blockpos)
  231. {
  232. return getContainingChunk(blockpos, mgparams->chunksize);
  233. }
  234. // TODO(hmmmm): Move this to ServerMap
  235. v3s16 EmergeManager::getContainingChunk(v3s16 blockpos, s16 chunksize)
  236. {
  237. s16 coff = -chunksize / 2;
  238. v3s16 chunk_offset(coff, coff, coff);
  239. return getContainerPos(blockpos - chunk_offset, chunksize)
  240. * chunksize + chunk_offset;
  241. }
  242. int EmergeManager::getSpawnLevelAtPoint(v2s16 p)
  243. {
  244. if (m_mapgens.empty() || !m_mapgens[0]) {
  245. errorstream << "EmergeManager: getSpawnLevelAtPoint() called"
  246. " before mapgen init" << std::endl;
  247. return 0;
  248. }
  249. return m_mapgens[0]->getSpawnLevelAtPoint(p);
  250. }
  251. int EmergeManager::getGroundLevelAtPoint(v2s16 p)
  252. {
  253. if (m_mapgens.empty() || !m_mapgens[0]) {
  254. errorstream << "EmergeManager: getGroundLevelAtPoint() called"
  255. " before mapgen init" << std::endl;
  256. return 0;
  257. }
  258. return m_mapgens[0]->getGroundLevelAtPoint(p);
  259. }
  260. // TODO(hmmmm): Move this to ServerMap
  261. bool EmergeManager::isBlockUnderground(v3s16 blockpos)
  262. {
  263. #if 0
  264. v2s16 p = v2s16((blockpos.X * MAP_BLOCKSIZE) + MAP_BLOCKSIZE / 2,
  265. (blockpos.Y * MAP_BLOCKSIZE) + MAP_BLOCKSIZE / 2);
  266. int ground_level = getGroundLevelAtPoint(p);
  267. return blockpos.Y * (MAP_BLOCKSIZE + 1) <= min(water_level, ground_level);
  268. #endif
  269. // Use a simple heuristic; the above method is wildly inaccurate anyway.
  270. return blockpos.Y * (MAP_BLOCKSIZE + 1) <= mgparams->water_level;
  271. }
  272. bool EmergeManager::pushBlockEmergeData(
  273. v3s16 pos,
  274. u16 peer_requested,
  275. u16 flags,
  276. EmergeCompletionCallback callback,
  277. void *callback_param,
  278. bool *entry_already_exists)
  279. {
  280. u16 &count_peer = m_peer_queue_count[peer_requested];
  281. if ((flags & BLOCK_EMERGE_FORCE_QUEUE) == 0) {
  282. if (m_blocks_enqueued.size() >= m_qlimit_total)
  283. return false;
  284. if (peer_requested != PEER_ID_INEXISTENT) {
  285. u16 qlimit_peer = (flags & BLOCK_EMERGE_ALLOW_GEN) ?
  286. m_qlimit_generate : m_qlimit_diskonly;
  287. if (count_peer >= qlimit_peer)
  288. return false;
  289. }
  290. }
  291. std::pair<std::map<v3s16, BlockEmergeData>::iterator, bool> findres;
  292. findres = m_blocks_enqueued.insert(std::make_pair(pos, BlockEmergeData()));
  293. BlockEmergeData &bedata = findres.first->second;
  294. *entry_already_exists = !findres.second;
  295. if (callback)
  296. bedata.callbacks.emplace_back(callback, callback_param);
  297. if (*entry_already_exists) {
  298. bedata.flags |= flags;
  299. } else {
  300. bedata.flags = flags;
  301. bedata.peer_requested = peer_requested;
  302. count_peer++;
  303. }
  304. return true;
  305. }
  306. bool EmergeManager::popBlockEmergeData(v3s16 pos, BlockEmergeData *bedata)
  307. {
  308. std::map<v3s16, BlockEmergeData>::iterator it;
  309. std::unordered_map<u16, u16>::iterator it2;
  310. it = m_blocks_enqueued.find(pos);
  311. if (it == m_blocks_enqueued.end())
  312. return false;
  313. *bedata = it->second;
  314. it2 = m_peer_queue_count.find(bedata->peer_requested);
  315. if (it2 == m_peer_queue_count.end())
  316. return false;
  317. u16 &count_peer = it2->second;
  318. assert(count_peer != 0);
  319. count_peer--;
  320. m_blocks_enqueued.erase(it);
  321. return true;
  322. }
  323. EmergeThread *EmergeManager::getOptimalThread()
  324. {
  325. size_t nthreads = m_threads.size();
  326. FATAL_ERROR_IF(nthreads == 0, "No emerge threads!");
  327. size_t index = 0;
  328. size_t nitems_lowest = m_threads[0]->m_block_queue.size();
  329. for (size_t i = 1; i < nthreads; i++) {
  330. size_t nitems = m_threads[i]->m_block_queue.size();
  331. if (nitems < nitems_lowest) {
  332. index = i;
  333. nitems_lowest = nitems;
  334. }
  335. }
  336. return m_threads[index];
  337. }
  338. ////
  339. //// EmergeThread
  340. ////
  341. EmergeThread::EmergeThread(Server *server, int ethreadid) :
  342. enable_mapgen_debug_info(false),
  343. id(ethreadid),
  344. m_server(server),
  345. m_map(NULL),
  346. m_emerge(NULL),
  347. m_mapgen(NULL)
  348. {
  349. m_name = "Emerge-" + itos(ethreadid);
  350. }
  351. void EmergeThread::signal()
  352. {
  353. m_queue_event.signal();
  354. }
  355. bool EmergeThread::pushBlock(const v3s16 &pos)
  356. {
  357. m_block_queue.push(pos);
  358. return true;
  359. }
  360. void EmergeThread::cancelPendingItems()
  361. {
  362. MutexAutoLock queuelock(m_emerge->m_queue_mutex);
  363. while (!m_block_queue.empty()) {
  364. BlockEmergeData bedata;
  365. v3s16 pos;
  366. pos = m_block_queue.front();
  367. m_block_queue.pop();
  368. m_emerge->popBlockEmergeData(pos, &bedata);
  369. runCompletionCallbacks(pos, EMERGE_CANCELLED, bedata.callbacks);
  370. }
  371. }
  372. void EmergeThread::runCompletionCallbacks(const v3s16 &pos, EmergeAction action,
  373. const EmergeCallbackList &callbacks)
  374. {
  375. for (size_t i = 0; i != callbacks.size(); i++) {
  376. EmergeCompletionCallback callback;
  377. void *param;
  378. callback = callbacks[i].first;
  379. param = callbacks[i].second;
  380. callback(pos, action, param);
  381. }
  382. }
  383. bool EmergeThread::popBlockEmerge(v3s16 *pos, BlockEmergeData *bedata)
  384. {
  385. MutexAutoLock queuelock(m_emerge->m_queue_mutex);
  386. if (m_block_queue.empty())
  387. return false;
  388. *pos = m_block_queue.front();
  389. m_block_queue.pop();
  390. m_emerge->popBlockEmergeData(*pos, bedata);
  391. return true;
  392. }
  393. EmergeAction EmergeThread::getBlockOrStartGen(
  394. const v3s16 &pos, bool allow_gen, MapBlock **block, BlockMakeData *bmdata)
  395. {
  396. MutexAutoLock envlock(m_server->m_env_mutex);
  397. // 1). Attempt to fetch block from memory
  398. *block = m_map->getBlockNoCreateNoEx(pos);
  399. if (*block && !(*block)->isDummy()) {
  400. if ((*block)->isGenerated())
  401. return EMERGE_FROM_MEMORY;
  402. } else {
  403. // 2). Attempt to load block from disk if it was not in the memory
  404. *block = m_map->loadBlock(pos);
  405. if (*block && (*block)->isGenerated())
  406. return EMERGE_FROM_DISK;
  407. }
  408. // 3). Attempt to start generation
  409. if (allow_gen && m_map->initBlockMake(pos, bmdata))
  410. return EMERGE_GENERATED;
  411. // All attempts failed; cancel this block emerge
  412. return EMERGE_CANCELLED;
  413. }
  414. MapBlock *EmergeThread::finishGen(v3s16 pos, BlockMakeData *bmdata,
  415. std::map<v3s16, MapBlock *> *modified_blocks)
  416. {
  417. MutexAutoLock envlock(m_server->m_env_mutex);
  418. ScopeProfiler sp(g_profiler,
  419. "EmergeThread: after Mapgen::makeChunk", SPT_AVG);
  420. /*
  421. Perform post-processing on blocks (invalidate lighting, queue liquid
  422. transforms, etc.) to finish block make
  423. */
  424. m_map->finishBlockMake(bmdata, modified_blocks);
  425. MapBlock *block = m_map->getBlockNoCreateNoEx(pos);
  426. if (!block) {
  427. errorstream << "EmergeThread::finishGen: Couldn't grab block we "
  428. "just generated: " << PP(pos) << std::endl;
  429. return NULL;
  430. }
  431. v3s16 minp = bmdata->blockpos_min * MAP_BLOCKSIZE;
  432. v3s16 maxp = bmdata->blockpos_max * MAP_BLOCKSIZE +
  433. v3s16(1,1,1) * (MAP_BLOCKSIZE - 1);
  434. // Ignore map edit events, they will not need to be sent
  435. // to anybody because the block hasn't been sent to anybody
  436. MapEditEventAreaIgnorer ign(
  437. &m_server->m_ignore_map_edit_events_area,
  438. VoxelArea(minp, maxp));
  439. /*
  440. Run Lua on_generated callbacks
  441. */
  442. try {
  443. m_server->getScriptIface()->environment_OnGenerated(
  444. minp, maxp, m_mapgen->blockseed);
  445. } catch (LuaError &e) {
  446. m_server->setAsyncFatalError("Lua: finishGen" + std::string(e.what()));
  447. }
  448. EMERGE_DBG_OUT("ended up with: " << analyze_block(block));
  449. /*
  450. Activate the block
  451. */
  452. m_server->m_env->activateBlock(block, 0);
  453. return block;
  454. }
  455. void *EmergeThread::run()
  456. {
  457. BEGIN_DEBUG_EXCEPTION_HANDLER
  458. v3s16 pos;
  459. m_map = (ServerMap *)&(m_server->m_env->getMap());
  460. m_emerge = m_server->m_emerge;
  461. m_mapgen = m_emerge->m_mapgens[id];
  462. enable_mapgen_debug_info = m_emerge->enable_mapgen_debug_info;
  463. try {
  464. while (!stopRequested()) {
  465. std::map<v3s16, MapBlock *> modified_blocks;
  466. BlockEmergeData bedata;
  467. BlockMakeData bmdata;
  468. EmergeAction action;
  469. MapBlock *block;
  470. if (!popBlockEmerge(&pos, &bedata)) {
  471. m_queue_event.wait();
  472. continue;
  473. }
  474. if (blockpos_over_max_limit(pos))
  475. continue;
  476. bool allow_gen = bedata.flags & BLOCK_EMERGE_ALLOW_GEN;
  477. EMERGE_DBG_OUT("pos=" PP(pos) " allow_gen=" << allow_gen);
  478. action = getBlockOrStartGen(pos, allow_gen, &block, &bmdata);
  479. if (action == EMERGE_GENERATED) {
  480. {
  481. ScopeProfiler sp(g_profiler,
  482. "EmergeThread: Mapgen::makeChunk", SPT_AVG);
  483. TimeTaker t("mapgen::make_block()");
  484. m_mapgen->makeChunk(&bmdata);
  485. if (!enable_mapgen_debug_info)
  486. t.stop(true); // Hide output
  487. }
  488. block = finishGen(pos, &bmdata, &modified_blocks);
  489. }
  490. runCompletionCallbacks(pos, action, bedata.callbacks);
  491. if (block)
  492. modified_blocks[pos] = block;
  493. if (!modified_blocks.empty())
  494. m_server->SetBlocksNotSent(modified_blocks);
  495. }
  496. } catch (VersionMismatchException &e) {
  497. std::ostringstream err;
  498. err << "World data version mismatch in MapBlock " << PP(pos) << std::endl
  499. << "----" << std::endl
  500. << "\"" << e.what() << "\"" << std::endl
  501. << "See debug.txt." << std::endl
  502. << "World probably saved by a newer version of " PROJECT_NAME_C "."
  503. << std::endl;
  504. m_server->setAsyncFatalError(err.str());
  505. } catch (SerializationError &e) {
  506. std::ostringstream err;
  507. err << "Invalid data in MapBlock " << PP(pos) << std::endl
  508. << "----" << std::endl
  509. << "\"" << e.what() << "\"" << std::endl
  510. << "See debug.txt." << std::endl
  511. << "You can ignore this using [ignore_world_load_errors = true]."
  512. << std::endl;
  513. m_server->setAsyncFatalError(err.str());
  514. }
  515. END_DEBUG_EXCEPTION_HANDLER
  516. return NULL;
  517. }