cavegen.cpp 24 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864
  1. /*
  2. Minetest
  3. Copyright (C) 2010-2013 celeron55, Perttu Ahola <celeron55@gmail.com>
  4. This program is free software; you can redistribute it and/or modify
  5. it under the terms of the GNU Lesser General Public License as published by
  6. the Free Software Foundation; either version 3.0 of the License, or
  7. (at your option) any later version.
  8. This program is distributed in the hope that it will be useful,
  9. but WITHOUT ANY WARRANTY; without even the implied warranty of
  10. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  11. GNU Lesser General Public License for more details.
  12. You should have received a copy of the GNU Lesser General Public License along
  13. with this program; if not, write to the Free Software Foundation, Inc.,
  14. 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
  15. */
  16. #include "util/numeric.h"
  17. #include "map.h"
  18. #include "mapgen.h"
  19. #include "mapgen_v5.h"
  20. #include "mapgen_v6.h"
  21. #include "mapgen_v7.h"
  22. #include "mg_biome.h"
  23. #include "cavegen.h"
  24. static NoiseParams nparams_caveliquids(0, 1, v3f(150.0, 150.0, 150.0), 776, 3, 0.6, 2.0);
  25. ////
  26. //// CavesNoiseIntersection
  27. ////
  28. CavesNoiseIntersection::CavesNoiseIntersection(
  29. INodeDefManager *nodedef, BiomeManager *biomemgr, v3s16 chunksize,
  30. NoiseParams *np_cave1, NoiseParams *np_cave2, s32 seed, float cave_width)
  31. {
  32. assert(nodedef);
  33. assert(biomemgr);
  34. m_ndef = nodedef;
  35. m_bmgr = biomemgr;
  36. m_csize = chunksize;
  37. m_cave_width = cave_width;
  38. m_ystride = m_csize.X;
  39. m_zstride_1d = m_csize.X * (m_csize.Y + 1);
  40. // Noises are created using 1-down overgeneration
  41. // A Nx-by-1-by-Nz-sized plane is at the bottom of the desired for
  42. // re-carving the solid overtop placed for blocking sunlight
  43. noise_cave1 = new Noise(np_cave1, seed, m_csize.X, m_csize.Y + 1, m_csize.Z);
  44. noise_cave2 = new Noise(np_cave2, seed, m_csize.X, m_csize.Y + 1, m_csize.Z);
  45. }
  46. CavesNoiseIntersection::~CavesNoiseIntersection()
  47. {
  48. delete noise_cave1;
  49. delete noise_cave2;
  50. }
  51. void CavesNoiseIntersection::generateCaves(MMVManip *vm,
  52. v3s16 nmin, v3s16 nmax, u8 *biomemap)
  53. {
  54. assert(vm);
  55. assert(biomemap);
  56. noise_cave1->perlinMap3D(nmin.X, nmin.Y - 1, nmin.Z);
  57. noise_cave2->perlinMap3D(nmin.X, nmin.Y - 1, nmin.Z);
  58. v3s16 em = vm->m_area.getExtent();
  59. u32 index2d = 0; // Biomemap index
  60. for (s16 z = nmin.Z; z <= nmax.Z; z++)
  61. for (s16 x = nmin.X; x <= nmax.X; x++, index2d++) {
  62. bool column_is_open = false; // Is column open to overground
  63. bool is_under_river = false; // Is column under river water
  64. bool is_under_tunnel = false; // Is tunnel or is under tunnel
  65. // Indexes at column top
  66. u32 vi = vm->m_area.index(x, nmax.Y, z);
  67. u32 index3d = (z - nmin.Z) * m_zstride_1d + m_csize.Y * m_ystride +
  68. (x - nmin.X); // 3D noise index
  69. // Biome of column
  70. Biome *biome = (Biome *)m_bmgr->getRaw(biomemap[index2d]);
  71. u16 depth_top = biome->depth_top;
  72. u16 base_filler = depth_top + biome->depth_filler;
  73. u16 depth_riverbed = biome->depth_riverbed;
  74. u16 nplaced = 0;
  75. // Don't excavate the overgenerated stone at nmax.Y + 1,
  76. // this creates a 'roof' over the tunnel, preventing light in
  77. // tunnels at mapchunk borders when generating mapchunks upwards.
  78. // This 'roof' is removed when the mapchunk above is generated.
  79. for (s16 y = nmax.Y; y >= nmin.Y - 1; y--,
  80. index3d -= m_ystride,
  81. vm->m_area.add_y(em, vi, -1)) {
  82. content_t c = vm->m_data[vi].getContent();
  83. if (c == CONTENT_AIR || c == biome->c_water_top ||
  84. c == biome->c_water) {
  85. column_is_open = true;
  86. continue;
  87. } else if (c == biome->c_river_water) {
  88. column_is_open = true;
  89. is_under_river = true;
  90. continue;
  91. }
  92. // Ground
  93. float d1 = contour(noise_cave1->result[index3d]);
  94. float d2 = contour(noise_cave2->result[index3d]);
  95. if (d1 * d2 > m_cave_width && m_ndef->get(c).is_ground_content) {
  96. // In tunnel and ground content, excavate
  97. vm->m_data[vi] = MapNode(CONTENT_AIR);
  98. is_under_tunnel = true;
  99. } else if (column_is_open && is_under_tunnel &&
  100. (c == biome->c_stone || c == biome->c_filler)) {
  101. // Tunnel entrance floor, place biome surface nodes
  102. if (is_under_river) {
  103. if (nplaced < depth_riverbed) {
  104. vm->m_data[vi] = MapNode(biome->c_riverbed);
  105. nplaced++;
  106. } else {
  107. // Disable top/filler placement
  108. column_is_open = false;
  109. is_under_river = false;
  110. is_under_tunnel = false;
  111. }
  112. } else if (nplaced < depth_top) {
  113. vm->m_data[vi] = MapNode(biome->c_top);
  114. nplaced++;
  115. } else if (nplaced < base_filler) {
  116. vm->m_data[vi] = MapNode(biome->c_filler);
  117. nplaced++;
  118. } else {
  119. // Disable top/filler placement
  120. column_is_open = false;
  121. is_under_tunnel = false;
  122. }
  123. } else {
  124. // Not tunnel or tunnel entrance floor
  125. column_is_open = false;
  126. }
  127. }
  128. }
  129. }
  130. ////
  131. //// CavernsNoise
  132. ////
  133. CavernsNoise::CavernsNoise(
  134. INodeDefManager *nodedef, v3s16 chunksize, NoiseParams *np_cavern,
  135. s32 seed, float cavern_limit, float cavern_taper, float cavern_threshold)
  136. {
  137. assert(nodedef);
  138. m_ndef = nodedef;
  139. m_csize = chunksize;
  140. m_cavern_limit = cavern_limit;
  141. m_cavern_taper = cavern_taper;
  142. m_cavern_threshold = cavern_threshold;
  143. m_ystride = m_csize.X;
  144. m_zstride_1d = m_csize.X * (m_csize.Y + 1);
  145. // Noise is created using 1-down overgeneration
  146. // A Nx-by-1-by-Nz-sized plane is at the bottom of the desired for
  147. // re-carving the solid overtop placed for blocking sunlight
  148. noise_cavern = new Noise(np_cavern, seed, m_csize.X, m_csize.Y + 1, m_csize.Z);
  149. c_water_source = m_ndef->getId("mapgen_water_source");
  150. if (c_water_source == CONTENT_IGNORE)
  151. c_water_source = CONTENT_AIR;
  152. c_lava_source = m_ndef->getId("mapgen_lava_source");
  153. if (c_lava_source == CONTENT_IGNORE)
  154. c_lava_source = CONTENT_AIR;
  155. }
  156. CavernsNoise::~CavernsNoise()
  157. {
  158. delete noise_cavern;
  159. }
  160. bool CavernsNoise::generateCaverns(MMVManip *vm, v3s16 nmin, v3s16 nmax)
  161. {
  162. assert(vm);
  163. // Calculate noise
  164. noise_cavern->perlinMap3D(nmin.X, nmin.Y - 1, nmin.Z);
  165. // Cache cavern_amp values
  166. float *cavern_amp = new float[m_csize.Y + 1];
  167. u8 cavern_amp_index = 0; // Index zero at column top
  168. for (s16 y = nmax.Y; y >= nmin.Y - 1; y--, cavern_amp_index++) {
  169. cavern_amp[cavern_amp_index] =
  170. MYMIN((m_cavern_limit - y) / (float)m_cavern_taper, 1.0f);
  171. }
  172. //// Place nodes
  173. bool near_cavern = false;
  174. v3s16 em = vm->m_area.getExtent();
  175. u32 index2d = 0;
  176. for (s16 z = nmin.Z; z <= nmax.Z; z++)
  177. for (s16 x = nmin.X; x <= nmax.X; x++, index2d++) {
  178. // Reset cave_amp index to column top
  179. cavern_amp_index = 0;
  180. // Initial voxelmanip index at column top
  181. u32 vi = vm->m_area.index(x, nmax.Y, z);
  182. // Initial 3D noise index at column top
  183. u32 index3d = (z - nmin.Z) * m_zstride_1d + m_csize.Y * m_ystride +
  184. (x - nmin.X);
  185. // Don't excavate the overgenerated stone at node_max.Y + 1,
  186. // this creates a 'roof' over the cavern, preventing light in
  187. // caverns at mapchunk borders when generating mapchunks upwards.
  188. // This 'roof' is excavated when the mapchunk above is generated.
  189. for (s16 y = nmax.Y; y >= nmin.Y - 1; y--,
  190. index3d -= m_ystride,
  191. vm->m_area.add_y(em, vi, -1),
  192. cavern_amp_index++) {
  193. content_t c = vm->m_data[vi].getContent();
  194. float n_absamp_cavern = fabs(noise_cavern->result[index3d]) *
  195. cavern_amp[cavern_amp_index];
  196. // Disable CavesRandomWalk at a safe distance from caverns
  197. // to avoid excessively spreading liquids in caverns.
  198. if (n_absamp_cavern > m_cavern_threshold - 0.1f) {
  199. near_cavern = true;
  200. if (n_absamp_cavern > m_cavern_threshold &&
  201. m_ndef->get(c).is_ground_content)
  202. vm->m_data[vi] = MapNode(CONTENT_AIR);
  203. }
  204. }
  205. }
  206. delete[] cavern_amp;
  207. return near_cavern;
  208. }
  209. ////
  210. //// CavesRandomWalk
  211. ////
  212. CavesRandomWalk::CavesRandomWalk(
  213. INodeDefManager *ndef,
  214. GenerateNotifier *gennotify,
  215. s32 seed,
  216. int water_level,
  217. content_t water_source,
  218. content_t lava_source)
  219. {
  220. assert(ndef);
  221. this->ndef = ndef;
  222. this->gennotify = gennotify;
  223. this->seed = seed;
  224. this->water_level = water_level;
  225. this->np_caveliquids = &nparams_caveliquids;
  226. this->lava_depth = DEFAULT_LAVA_DEPTH;
  227. c_water_source = water_source;
  228. if (c_water_source == CONTENT_IGNORE)
  229. c_water_source = ndef->getId("mapgen_water_source");
  230. if (c_water_source == CONTENT_IGNORE)
  231. c_water_source = CONTENT_AIR;
  232. c_lava_source = lava_source;
  233. if (c_lava_source == CONTENT_IGNORE)
  234. c_lava_source = ndef->getId("mapgen_lava_source");
  235. if (c_lava_source == CONTENT_IGNORE)
  236. c_lava_source = CONTENT_AIR;
  237. }
  238. void CavesRandomWalk::makeCave(MMVManip *vm, v3s16 nmin, v3s16 nmax,
  239. PseudoRandom *ps, bool is_large_cave, int max_stone_height, s16 *heightmap)
  240. {
  241. assert(vm);
  242. assert(ps);
  243. this->vm = vm;
  244. this->ps = ps;
  245. this->node_min = nmin;
  246. this->node_max = nmax;
  247. this->heightmap = heightmap;
  248. this->large_cave = is_large_cave;
  249. this->ystride = nmax.X - nmin.X + 1;
  250. // Set initial parameters from randomness
  251. int dswitchint = ps->range(1, 14);
  252. flooded = ps->range(1, 2) == 2;
  253. if (large_cave) {
  254. part_max_length_rs = ps->range(2, 4);
  255. tunnel_routepoints = ps->range(5, ps->range(15, 30));
  256. min_tunnel_diameter = 5;
  257. max_tunnel_diameter = ps->range(7, ps->range(8, 24));
  258. } else {
  259. part_max_length_rs = ps->range(2, 9);
  260. tunnel_routepoints = ps->range(10, ps->range(15, 30));
  261. min_tunnel_diameter = 2;
  262. max_tunnel_diameter = ps->range(2, 6);
  263. }
  264. large_cave_is_flat = (ps->range(0, 1) == 0);
  265. main_direction = v3f(0, 0, 0);
  266. // Allowed route area size in nodes
  267. ar = node_max - node_min + v3s16(1, 1, 1);
  268. // Area starting point in nodes
  269. of = node_min;
  270. // Allow a bit more
  271. //(this should be more than the maximum radius of the tunnel)
  272. const s16 insure = 10;
  273. s16 more = MYMAX(MAP_BLOCKSIZE - max_tunnel_diameter / 2 - insure, 1);
  274. ar += v3s16(1, 0, 1) * more * 2;
  275. of -= v3s16(1, 0, 1) * more;
  276. route_y_min = 0;
  277. // Allow half a diameter + 7 over stone surface
  278. route_y_max = -of.Y + max_stone_height + max_tunnel_diameter / 2 + 7;
  279. // Limit maximum to area
  280. route_y_max = rangelim(route_y_max, 0, ar.Y - 1);
  281. if (large_cave) {
  282. s16 minpos = 0;
  283. if (node_min.Y < water_level && node_max.Y > water_level) {
  284. minpos = water_level - max_tunnel_diameter / 3 - of.Y;
  285. route_y_max = water_level + max_tunnel_diameter / 3 - of.Y;
  286. }
  287. route_y_min = ps->range(minpos, minpos + max_tunnel_diameter);
  288. route_y_min = rangelim(route_y_min, 0, route_y_max);
  289. }
  290. s16 route_start_y_min = route_y_min;
  291. s16 route_start_y_max = route_y_max;
  292. route_start_y_min = rangelim(route_start_y_min, 0, ar.Y - 1);
  293. route_start_y_max = rangelim(route_start_y_max, route_start_y_min, ar.Y - 1);
  294. // Randomize starting position
  295. orp.Z = (float)(ps->next() % ar.Z) + 0.5f;
  296. orp.Y = (float)(ps->range(route_start_y_min, route_start_y_max)) + 0.5f;
  297. orp.X = (float)(ps->next() % ar.X) + 0.5f;
  298. // Add generation notify begin event
  299. if (gennotify) {
  300. v3s16 abs_pos(of.X + orp.X, of.Y + orp.Y, of.Z + orp.Z);
  301. GenNotifyType notifytype = large_cave ?
  302. GENNOTIFY_LARGECAVE_BEGIN : GENNOTIFY_CAVE_BEGIN;
  303. gennotify->addEvent(notifytype, abs_pos);
  304. }
  305. // Generate some tunnel starting from orp
  306. for (u16 j = 0; j < tunnel_routepoints; j++)
  307. makeTunnel(j % dswitchint == 0);
  308. // Add generation notify end event
  309. if (gennotify) {
  310. v3s16 abs_pos(of.X + orp.X, of.Y + orp.Y, of.Z + orp.Z);
  311. GenNotifyType notifytype = large_cave ?
  312. GENNOTIFY_LARGECAVE_END : GENNOTIFY_CAVE_END;
  313. gennotify->addEvent(notifytype, abs_pos);
  314. }
  315. }
  316. void CavesRandomWalk::makeTunnel(bool dirswitch)
  317. {
  318. if (dirswitch && !large_cave) {
  319. main_direction.Z = ((float)(ps->next() % 20) - (float)10) / 10;
  320. main_direction.Y = ((float)(ps->next() % 20) - (float)10) / 30;
  321. main_direction.X = ((float)(ps->next() % 20) - (float)10) / 10;
  322. main_direction *= (float)ps->range(0, 10) / 10;
  323. }
  324. // Randomize size
  325. s16 min_d = min_tunnel_diameter;
  326. s16 max_d = max_tunnel_diameter;
  327. rs = ps->range(min_d, max_d);
  328. s16 rs_part_max_length_rs = rs * part_max_length_rs;
  329. v3s16 maxlen;
  330. if (large_cave) {
  331. maxlen = v3s16(
  332. rs_part_max_length_rs,
  333. rs_part_max_length_rs / 2,
  334. rs_part_max_length_rs
  335. );
  336. } else {
  337. maxlen = v3s16(
  338. rs_part_max_length_rs,
  339. ps->range(1, rs_part_max_length_rs),
  340. rs_part_max_length_rs
  341. );
  342. }
  343. v3f vec;
  344. // Jump downward sometimes
  345. if (!large_cave && ps->range(0, 12) == 0) {
  346. vec.Z = (float)(ps->next() % (maxlen.Z * 1)) - (float)maxlen.Z / 2;
  347. vec.Y = (float)(ps->next() % (maxlen.Y * 2)) - (float)maxlen.Y;
  348. vec.X = (float)(ps->next() % (maxlen.X * 1)) - (float)maxlen.X / 2;
  349. } else {
  350. vec.Z = (float)(ps->next() % (maxlen.Z * 1)) - (float)maxlen.Z / 2;
  351. vec.Y = (float)(ps->next() % (maxlen.Y * 1)) - (float)maxlen.Y / 2;
  352. vec.X = (float)(ps->next() % (maxlen.X * 1)) - (float)maxlen.X / 2;
  353. }
  354. // Do not make caves that are above ground.
  355. // It is only necessary to check the startpoint and endpoint.
  356. v3s16 p1 = v3s16(orp.X, orp.Y, orp.Z) + of + rs / 2;
  357. v3s16 p2 = v3s16(vec.X, vec.Y, vec.Z) + p1;
  358. if (isPosAboveSurface(p1) || isPosAboveSurface(p2))
  359. return;
  360. vec += main_direction;
  361. v3f rp = orp + vec;
  362. if (rp.X < 0)
  363. rp.X = 0;
  364. else if (rp.X >= ar.X)
  365. rp.X = ar.X - 1;
  366. if (rp.Y < route_y_min)
  367. rp.Y = route_y_min;
  368. else if (rp.Y >= route_y_max)
  369. rp.Y = route_y_max - 1;
  370. if (rp.Z < 0)
  371. rp.Z = 0;
  372. else if (rp.Z >= ar.Z)
  373. rp.Z = ar.Z - 1;
  374. vec = rp - orp;
  375. float veclen = vec.getLength();
  376. if (veclen < 0.05f)
  377. veclen = 1.0f;
  378. // Every second section is rough
  379. bool randomize_xz = (ps->range(1, 2) == 1);
  380. // Carve routes
  381. for (float f = 0.f; f < 1.0f; f += 1.0f / veclen)
  382. carveRoute(vec, f, randomize_xz);
  383. orp = rp;
  384. }
  385. void CavesRandomWalk::carveRoute(v3f vec, float f, bool randomize_xz)
  386. {
  387. MapNode airnode(CONTENT_AIR);
  388. MapNode waternode(c_water_source);
  389. MapNode lavanode(c_lava_source);
  390. v3s16 startp(orp.X, orp.Y, orp.Z);
  391. startp += of;
  392. float nval = NoisePerlin3D(np_caveliquids, startp.X,
  393. startp.Y, startp.Z, seed);
  394. MapNode liquidnode = (nval < 0.40f && node_max.Y < lava_depth) ?
  395. lavanode : waternode;
  396. v3f fp = orp + vec * f;
  397. fp.X += 0.1f * ps->range(-10, 10);
  398. fp.Z += 0.1f * ps->range(-10, 10);
  399. v3s16 cp(fp.X, fp.Y, fp.Z);
  400. s16 d0 = -rs / 2;
  401. s16 d1 = d0 + rs;
  402. if (randomize_xz) {
  403. d0 += ps->range(-1, 1);
  404. d1 += ps->range(-1, 1);
  405. }
  406. bool flat_cave_floor = !large_cave && ps->range(0, 2) == 2;
  407. for (s16 z0 = d0; z0 <= d1; z0++) {
  408. s16 si = rs / 2 - MYMAX(0, abs(z0) - rs / 7 - 1);
  409. for (s16 x0 = -si - ps->range(0,1); x0 <= si - 1 + ps->range(0,1); x0++) {
  410. s16 maxabsxz = MYMAX(abs(x0), abs(z0));
  411. s16 si2 = rs / 2 - MYMAX(0, maxabsxz - rs / 7 - 1);
  412. for (s16 y0 = -si2; y0 <= si2; y0++) {
  413. // Make better floors in small caves
  414. if (flat_cave_floor && y0 <= -rs / 2 && rs <= 7)
  415. continue;
  416. if (large_cave_is_flat) {
  417. // Make large caves not so tall
  418. if (rs > 7 && abs(y0) >= rs / 3)
  419. continue;
  420. }
  421. v3s16 p(cp.X + x0, cp.Y + y0, cp.Z + z0);
  422. p += of;
  423. if (vm->m_area.contains(p) == false)
  424. continue;
  425. u32 i = vm->m_area.index(p);
  426. content_t c = vm->m_data[i].getContent();
  427. if (!ndef->get(c).is_ground_content)
  428. continue;
  429. if (large_cave) {
  430. int full_ymin = node_min.Y - MAP_BLOCKSIZE;
  431. int full_ymax = node_max.Y + MAP_BLOCKSIZE;
  432. if (flooded && full_ymin < water_level && full_ymax > water_level)
  433. vm->m_data[i] = (p.Y <= water_level) ? waternode : airnode;
  434. else if (flooded && full_ymax < water_level)
  435. vm->m_data[i] = (p.Y < startp.Y - 4) ? liquidnode : airnode;
  436. else
  437. vm->m_data[i] = airnode;
  438. } else {
  439. if (c == CONTENT_IGNORE)
  440. continue;
  441. vm->m_data[i] = airnode;
  442. vm->m_flags[i] |= VMANIP_FLAG_CAVE;
  443. }
  444. }
  445. }
  446. }
  447. }
  448. inline bool CavesRandomWalk::isPosAboveSurface(v3s16 p)
  449. {
  450. if (heightmap != NULL &&
  451. p.Z >= node_min.Z && p.Z <= node_max.Z &&
  452. p.X >= node_min.X && p.X <= node_max.X) {
  453. u32 index = (p.Z - node_min.Z) * ystride + (p.X - node_min.X);
  454. if (heightmap[index] < p.Y)
  455. return true;
  456. } else if (p.Y > water_level) {
  457. return true;
  458. }
  459. return false;
  460. }
  461. ////
  462. //// CavesV6
  463. ////
  464. CavesV6::CavesV6(INodeDefManager *ndef, GenerateNotifier *gennotify,
  465. int water_level, content_t water_source, content_t lava_source)
  466. {
  467. assert(ndef);
  468. this->ndef = ndef;
  469. this->gennotify = gennotify;
  470. this->water_level = water_level;
  471. c_water_source = water_source;
  472. if (c_water_source == CONTENT_IGNORE)
  473. c_water_source = ndef->getId("mapgen_water_source");
  474. if (c_water_source == CONTENT_IGNORE)
  475. c_water_source = CONTENT_AIR;
  476. c_lava_source = lava_source;
  477. if (c_lava_source == CONTENT_IGNORE)
  478. c_lava_source = ndef->getId("mapgen_lava_source");
  479. if (c_lava_source == CONTENT_IGNORE)
  480. c_lava_source = CONTENT_AIR;
  481. }
  482. void CavesV6::makeCave(MMVManip *vm, v3s16 nmin, v3s16 nmax,
  483. PseudoRandom *ps, PseudoRandom *ps2,
  484. bool is_large_cave, int max_stone_height, s16 *heightmap)
  485. {
  486. assert(vm);
  487. assert(ps);
  488. assert(ps2);
  489. this->vm = vm;
  490. this->ps = ps;
  491. this->ps2 = ps2;
  492. this->node_min = nmin;
  493. this->node_max = nmax;
  494. this->heightmap = heightmap;
  495. this->large_cave = is_large_cave;
  496. this->ystride = nmax.X - nmin.X + 1;
  497. // Set initial parameters from randomness
  498. min_tunnel_diameter = 2;
  499. max_tunnel_diameter = ps->range(2, 6);
  500. int dswitchint = ps->range(1, 14);
  501. if (large_cave) {
  502. part_max_length_rs = ps->range(2, 4);
  503. tunnel_routepoints = ps->range(5, ps->range(15, 30));
  504. min_tunnel_diameter = 5;
  505. max_tunnel_diameter = ps->range(7, ps->range(8, 24));
  506. } else {
  507. part_max_length_rs = ps->range(2, 9);
  508. tunnel_routepoints = ps->range(10, ps->range(15, 30));
  509. }
  510. large_cave_is_flat = (ps->range(0, 1) == 0);
  511. main_direction = v3f(0, 0, 0);
  512. // Allowed route area size in nodes
  513. ar = node_max - node_min + v3s16(1, 1, 1);
  514. // Area starting point in nodes
  515. of = node_min;
  516. // Allow a bit more
  517. //(this should be more than the maximum radius of the tunnel)
  518. const s16 max_spread_amount = MAP_BLOCKSIZE;
  519. const s16 insure = 10;
  520. s16 more = MYMAX(max_spread_amount - max_tunnel_diameter / 2 - insure, 1);
  521. ar += v3s16(1, 0, 1) * more * 2;
  522. of -= v3s16(1, 0, 1) * more;
  523. route_y_min = 0;
  524. // Allow half a diameter + 7 over stone surface
  525. route_y_max = -of.Y + max_stone_height + max_tunnel_diameter / 2 + 7;
  526. // Limit maximum to area
  527. route_y_max = rangelim(route_y_max, 0, ar.Y - 1);
  528. if (large_cave) {
  529. s16 minpos = 0;
  530. if (node_min.Y < water_level && node_max.Y > water_level) {
  531. minpos = water_level - max_tunnel_diameter / 3 - of.Y;
  532. route_y_max = water_level + max_tunnel_diameter / 3 - of.Y;
  533. }
  534. route_y_min = ps->range(minpos, minpos + max_tunnel_diameter);
  535. route_y_min = rangelim(route_y_min, 0, route_y_max);
  536. }
  537. s16 route_start_y_min = route_y_min;
  538. s16 route_start_y_max = route_y_max;
  539. route_start_y_min = rangelim(route_start_y_min, 0, ar.Y - 1);
  540. route_start_y_max = rangelim(route_start_y_max, route_start_y_min, ar.Y - 1);
  541. // Randomize starting position
  542. orp.Z = (float)(ps->next() % ar.Z) + 0.5f;
  543. orp.Y = (float)(ps->range(route_start_y_min, route_start_y_max)) + 0.5f;
  544. orp.X = (float)(ps->next() % ar.X) + 0.5f;
  545. // Add generation notify begin event
  546. if (gennotify != NULL) {
  547. v3s16 abs_pos(of.X + orp.X, of.Y + orp.Y, of.Z + orp.Z);
  548. GenNotifyType notifytype = large_cave ?
  549. GENNOTIFY_LARGECAVE_BEGIN : GENNOTIFY_CAVE_BEGIN;
  550. gennotify->addEvent(notifytype, abs_pos);
  551. }
  552. // Generate some tunnel starting from orp
  553. for (u16 j = 0; j < tunnel_routepoints; j++)
  554. makeTunnel(j % dswitchint == 0);
  555. // Add generation notify end event
  556. if (gennotify != NULL) {
  557. v3s16 abs_pos(of.X + orp.X, of.Y + orp.Y, of.Z + orp.Z);
  558. GenNotifyType notifytype = large_cave ?
  559. GENNOTIFY_LARGECAVE_END : GENNOTIFY_CAVE_END;
  560. gennotify->addEvent(notifytype, abs_pos);
  561. }
  562. }
  563. void CavesV6::makeTunnel(bool dirswitch)
  564. {
  565. if (dirswitch && !large_cave) {
  566. main_direction.Z = ((float)(ps->next() % 20) - (float)10) / 10;
  567. main_direction.Y = ((float)(ps->next() % 20) - (float)10) / 30;
  568. main_direction.X = ((float)(ps->next() % 20) - (float)10) / 10;
  569. main_direction *= (float)ps->range(0, 10) / 10;
  570. }
  571. // Randomize size
  572. s16 min_d = min_tunnel_diameter;
  573. s16 max_d = max_tunnel_diameter;
  574. rs = ps->range(min_d, max_d);
  575. s16 rs_part_max_length_rs = rs * part_max_length_rs;
  576. v3s16 maxlen;
  577. if (large_cave) {
  578. maxlen = v3s16(
  579. rs_part_max_length_rs,
  580. rs_part_max_length_rs / 2,
  581. rs_part_max_length_rs
  582. );
  583. } else {
  584. maxlen = v3s16(
  585. rs_part_max_length_rs,
  586. ps->range(1, rs_part_max_length_rs),
  587. rs_part_max_length_rs
  588. );
  589. }
  590. v3f vec;
  591. vec.Z = (float)(ps->next() % maxlen.Z) - (float)maxlen.Z / 2;
  592. vec.Y = (float)(ps->next() % maxlen.Y) - (float)maxlen.Y / 2;
  593. vec.X = (float)(ps->next() % maxlen.X) - (float)maxlen.X / 2;
  594. // Jump downward sometimes
  595. if (!large_cave && ps->range(0, 12) == 0) {
  596. vec.Z = (float)(ps->next() % maxlen.Z) - (float)maxlen.Z / 2;
  597. vec.Y = (float)(ps->next() % (maxlen.Y * 2)) - (float)maxlen.Y;
  598. vec.X = (float)(ps->next() % maxlen.X) - (float)maxlen.X / 2;
  599. }
  600. // Do not make caves that are entirely above ground, to fix shadow bugs
  601. // caused by overgenerated large caves.
  602. // It is only necessary to check the startpoint and endpoint.
  603. v3s16 p1 = v3s16(orp.X, orp.Y, orp.Z) + of + rs / 2;
  604. v3s16 p2 = v3s16(vec.X, vec.Y, vec.Z) + p1;
  605. // If startpoint and endpoint are above ground, disable placement of nodes
  606. // in carveRoute while still running all PseudoRandom calls to ensure caves
  607. // are consistent with existing worlds.
  608. bool tunnel_above_ground =
  609. p1.Y > getSurfaceFromHeightmap(p1) &&
  610. p2.Y > getSurfaceFromHeightmap(p2);
  611. vec += main_direction;
  612. v3f rp = orp + vec;
  613. if (rp.X < 0)
  614. rp.X = 0;
  615. else if (rp.X >= ar.X)
  616. rp.X = ar.X - 1;
  617. if (rp.Y < route_y_min)
  618. rp.Y = route_y_min;
  619. else if (rp.Y >= route_y_max)
  620. rp.Y = route_y_max - 1;
  621. if (rp.Z < 0)
  622. rp.Z = 0;
  623. else if (rp.Z >= ar.Z)
  624. rp.Z = ar.Z - 1;
  625. vec = rp - orp;
  626. float veclen = vec.getLength();
  627. // As odd as it sounds, veclen is *exactly* 0.0 sometimes, causing a FPE
  628. if (veclen < 0.05f)
  629. veclen = 1.0f;
  630. // Every second section is rough
  631. bool randomize_xz = (ps2->range(1, 2) == 1);
  632. // Carve routes
  633. for (float f = 0.f; f < 1.0f; f += 1.0f / veclen)
  634. carveRoute(vec, f, randomize_xz, tunnel_above_ground);
  635. orp = rp;
  636. }
  637. void CavesV6::carveRoute(v3f vec, float f, bool randomize_xz,
  638. bool tunnel_above_ground)
  639. {
  640. MapNode airnode(CONTENT_AIR);
  641. MapNode waternode(c_water_source);
  642. MapNode lavanode(c_lava_source);
  643. v3s16 startp(orp.X, orp.Y, orp.Z);
  644. startp += of;
  645. v3f fp = orp + vec * f;
  646. fp.X += 0.1f * ps->range(-10, 10);
  647. fp.Z += 0.1f * ps->range(-10, 10);
  648. v3s16 cp(fp.X, fp.Y, fp.Z);
  649. s16 d0 = -rs / 2;
  650. s16 d1 = d0 + rs;
  651. if (randomize_xz) {
  652. d0 += ps->range(-1, 1);
  653. d1 += ps->range(-1, 1);
  654. }
  655. for (s16 z0 = d0; z0 <= d1; z0++) {
  656. s16 si = rs / 2 - MYMAX(0, abs(z0) - rs / 7 - 1);
  657. for (s16 x0 = -si - ps->range(0,1); x0 <= si - 1 + ps->range(0,1); x0++) {
  658. if (tunnel_above_ground)
  659. continue;
  660. s16 maxabsxz = MYMAX(abs(x0), abs(z0));
  661. s16 si2 = rs / 2 - MYMAX(0, maxabsxz - rs / 7 - 1);
  662. for (s16 y0 = -si2; y0 <= si2; y0++) {
  663. if (large_cave_is_flat) {
  664. // Make large caves not so tall
  665. if (rs > 7 && abs(y0) >= rs / 3)
  666. continue;
  667. }
  668. v3s16 p(cp.X + x0, cp.Y + y0, cp.Z + z0);
  669. p += of;
  670. if (vm->m_area.contains(p) == false)
  671. continue;
  672. u32 i = vm->m_area.index(p);
  673. content_t c = vm->m_data[i].getContent();
  674. if (!ndef->get(c).is_ground_content)
  675. continue;
  676. if (large_cave) {
  677. int full_ymin = node_min.Y - MAP_BLOCKSIZE;
  678. int full_ymax = node_max.Y + MAP_BLOCKSIZE;
  679. if (full_ymin < water_level && full_ymax > water_level) {
  680. vm->m_data[i] = (p.Y <= water_level) ? waternode : airnode;
  681. } else if (full_ymax < water_level) {
  682. vm->m_data[i] = (p.Y < startp.Y - 2) ? lavanode : airnode;
  683. } else {
  684. vm->m_data[i] = airnode;
  685. }
  686. } else {
  687. if (c == CONTENT_IGNORE || c == CONTENT_AIR)
  688. continue;
  689. vm->m_data[i] = airnode;
  690. vm->m_flags[i] |= VMANIP_FLAG_CAVE;
  691. }
  692. }
  693. }
  694. }
  695. }
  696. inline s16 CavesV6::getSurfaceFromHeightmap(v3s16 p)
  697. {
  698. if (heightmap != NULL &&
  699. p.Z >= node_min.Z && p.Z <= node_max.Z &&
  700. p.X >= node_min.X && p.X <= node_max.X) {
  701. u32 index = (p.Z - node_min.Z) * ystride + (p.X - node_min.X);
  702. return heightmap[index];
  703. } else {
  704. return water_level;
  705. }
  706. }