src/dungeongen.cpp

   1 /*
   2 Minetest
   3 Copyright (C) 2010-2013 celeron55, Perttu Ahola <celeron55@gmail.com>
   4
   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
  10 This program is distributed in the hope that it will be useful,
  11 but WITHOUT ANY WARRANTY; without even the implied warranty of
  12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  13 GNU Lesser General Public License for more details.
  14
  15 You should have received a copy of the GNU Lesser General Public License along
  16 with this program; if not, write to the Free Software Foundation, Inc.,
  17 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
  18 */
  19
  20 #include "dungeongen.h"
  21 #include "mapgen.h"
  22 #include "voxel.h"
  23 #include "noise.h"
  24 #include "mapblock.h"
  25 #include "mapnode.h"
  26 #include "map.h"
  27 #include "nodedef.h"
  28 #include "profiler.h"
  29 #include "settings.h"
  30
  31 //#define DGEN_USE_TORCHES
  32
  33 NoiseParams nparams_dungeon_rarity(0.0, 1.0, v3f(500.0, 500.0, 500.0), 0, 2, 0.8, 2.0);
  34 NoiseParams nparams_dungeon_wetness(0.0, 1.0, v3f(40.0, 40.0, 40.0), 32474, 4, 1.1, 2.0);
  35 NoiseParams nparams_dungeon_density(0.0, 1.0, v3f(2.5, 2.5, 2.5), 0, 2, 1.4, 2.0);
  36
  37
  38 ///////////////////////////////////////////////////////////////////////////////
  39
  40
  41 DungeonGen::DungeonGen(Mapgen *mapgen, DungeonParams *dparams)
  42 {
  43         this->mg = mapgen;
  44         this->vm = mapgen->vm;
  45
  46 #ifdef DGEN_USE_TORCHES
  47         c_torch  = ndef->getId("default:torch");
  48 #endif
  49
  50         if (dparams) {
  51                 memcpy(&dp, dparams, sizeof(dp));
  52         } else {
  53                 dp.c_water  = mg->ndef->getId("mapgen_water_source");
  54                 dp.c_cobble = mg->ndef->getId("mapgen_cobble");
  55                 dp.c_moss   = mg->ndef->getId("mapgen_mossycobble");
  56                 dp.c_stair  = mg->ndef->getId("mapgen_stair_cobble");
  57
  58                 dp.diagonal_dirs = false;
  59                 dp.mossratio     = 3.0;
  60                 dp.holesize      = v3s16(1, 2, 1);
  61                 dp.roomsize      = v3s16(0, 0, 0);
  62                 dp.notifytype    = GENNOTIFY_DUNGEON;
  63
  64                 dp.np_rarity  = nparams_dungeon_rarity;
  65                 dp.np_wetness = nparams_dungeon_wetness;
  66                 dp.np_density = nparams_dungeon_density;
  67         }
  68
  69         // For mapgens using river water
  70         dp.c_river_water = mg->ndef->getId("mapgen_river_water_source");
  71 }
  72
  73
  74 void DungeonGen::generate(u32 bseed, v3s16 nmin, v3s16 nmax)
  75 {
  76         //TimeTaker t("gen dungeons");
  77         if (NoisePerlin3D(&dp.np_rarity, nmin.X, nmin.Y, nmin.Z, mg->seed) < 0.2)
  78                 return;
  79
  80         this->blockseed = bseed;
  81         random.seed(bseed + 2);
  82
  83         // Dungeon generator doesn't modify places which have this set
  84         vm->clearFlag(VMANIP_FLAG_DUNGEON_INSIDE | VMANIP_FLAG_DUNGEON_PRESERVE);
  85
  86         // Set all air and water to be untouchable
  87         // to make dungeons open to caves and open air
  88         for (s16 z = nmin.Z; z <= nmax.Z; z++) {
  89                 for (s16 y = nmin.Y; y <= nmax.Y; y++) {
  90                         u32 i = vm->m_area.index(nmin.X, y, z);
  91                         for (s16 x = nmin.X; x <= nmax.X; x++) {
  92                                 content_t c = vm->m_data[i].getContent();
  93                                 if (c == CONTENT_AIR || c == dp.c_water || c == dp.c_river_water)
  94                                         vm->m_flags[i] |= VMANIP_FLAG_DUNGEON_PRESERVE;
  95                                 i++;
  96                         }
  97                 }
  98         }
  99
 100         // Add it
 101         makeDungeon(v3s16(1, 1, 1) * MAP_BLOCKSIZE);
 102
 103         // Convert some cobble to mossy cobble
 104         if (dp.mossratio != 0.0) {
 105                 for (s16 z = nmin.Z; z <= nmax.Z; z++)
 106                 for (s16 y = nmin.Y; y <= nmax.Y; y++) {
 107                         u32 i = vm->m_area.index(nmin.X, y, z);
 108                         for (s16 x = nmin.X; x <= nmax.X; x++) {
 109                                 if (vm->m_data[i].getContent() == dp.c_cobble) {
 110                                         float wetness = NoisePerlin3D(&dp.np_wetness, x, y, z, mg->seed);
 111                                         float density = NoisePerlin3D(&dp.np_density, x, y, z, blockseed);
 112                                         if (density < wetness / dp.mossratio)
 113                                                 vm->m_data[i].setContent(dp.c_moss);
 114                                 }
 115                                 i++;
 116                         }
 117                 }
 118         }
 119
 120         //printf("== gen dungeons: %dms\n", t.stop());
 121 }
 122
 123
 124 void DungeonGen::makeDungeon(v3s16 start_padding)
 125 {
 126         v3s16 areasize = vm->m_area.getExtent();
 127         v3s16 roomsize;
 128         v3s16 roomplace;
 129
 130         /*
 131                 Find place for first room
 132         */
 133         bool fits = false;
 134         for (u32 i = 0; i < 100 && !fits; i++) {
 135                 bool is_large_room = ((random.next() & 3) == 1);
 136                 roomsize = is_large_room ?
 137                         v3s16(random.range(8, 16), random.range(8, 16), random.range(8, 16)) :
 138                         v3s16(random.range(4, 8), random.range(4, 6), random.range(4, 8));
 139                 roomsize += dp.roomsize;
 140
 141                 // start_padding is used to disallow starting the generation of
 142                 // a dungeon in a neighboring generation chunk
 143                 roomplace = vm->m_area.MinEdge + start_padding + v3s16(
 144                         random.range(0, areasize.X - roomsize.X - start_padding.X),
 145                         random.range(0, areasize.Y - roomsize.Y - start_padding.Y),
 146                         random.range(0, areasize.Z - roomsize.Z - start_padding.Z));
 147
 148                 /*
 149                         Check that we're not putting the room to an unknown place,
 150                         otherwise it might end up floating in the air
 151                 */
 152                 fits = true;
 153                 for (s16 z = 0; z < roomsize.Z; z++)
 154                 for (s16 y = 0; y < roomsize.Y; y++)
 155                 for (s16 x = 0; x < roomsize.X; x++) {
 156                         v3s16 p = roomplace + v3s16(x, y, z);
 157                         u32 vi = vm->m_area.index(p);
 158                         if ((vm->m_flags[vi] & VMANIP_FLAG_DUNGEON_UNTOUCHABLE) ||
 159                                         vm->m_data[vi].getContent() == CONTENT_IGNORE) {
 160                                 fits = false;
 161                                 break;
 162                         }
 163                 }
 164         }
 165         // No place found
 166         if (fits == false)
 167                 return;
 168
 169         /*
 170                 Stores the center position of the last room made, so that
 171                 a new corridor can be started from the last room instead of
 172                 the new room, if chosen so.
 173         */
 174         v3s16 last_room_center = roomplace + v3s16(roomsize.X / 2, 1, roomsize.Z / 2);
 175
 176         u32 room_count = random.range(2, 16);
 177         for (u32 i = 0; i < room_count; i++) {
 178                 // Make a room to the determined place
 179                 makeRoom(roomsize, roomplace);
 180
 181                 v3s16 room_center = roomplace + v3s16(roomsize.X / 2, 1, roomsize.Z / 2);
 182                 mg->gennotify.addEvent(dp.notifytype, room_center);
 183
 184 #ifdef DGEN_USE_TORCHES
 185                 // Place torch at room center (for testing)
 186                 vm->m_data[vm->m_area.index(room_center)] = MapNode(c_torch);
 187 #endif
 188
 189                 // Quit if last room
 190                 if (i == room_count - 1)
 191                         break;
 192
 193                 // Determine walker start position
 194
 195                 bool start_in_last_room = (random.range(0, 2) != 0);
 196
 197                 v3s16 walker_start_place;
 198
 199                 if (start_in_last_room) {
 200                         walker_start_place = last_room_center;
 201                 } else {
 202                         walker_start_place = room_center;
 203                         // Store center of current room as the last one
 204                         last_room_center = room_center;
 205                 }
 206
 207                 // Create walker and find a place for a door
 208                 v3s16 doorplace;
 209                 v3s16 doordir;
 210
 211                 m_pos = walker_start_place;
 212                 if (!findPlaceForDoor(doorplace, doordir))
 213                         return;
 214
 215                 if (random.range(0, 1) == 0)
 216                         // Make the door
 217                         makeDoor(doorplace, doordir);
 218                 else
 219                         // Don't actually make a door
 220                         doorplace -= doordir;
 221
 222                 // Make a random corridor starting from the door
 223                 v3s16 corridor_end;
 224                 v3s16 corridor_end_dir;
 225                 makeCorridor(doorplace, doordir, corridor_end, corridor_end_dir);
 226
 227                 // Find a place for a random sized room
 228                 roomsize = v3s16(random.range(4, 8), random.range(4, 6), random.range(4, 8));
 229                 roomsize += dp.roomsize;
 230
 231                 m_pos = corridor_end;
 232                 m_dir = corridor_end_dir;
 233                 if (!findPlaceForRoomDoor(roomsize, doorplace, doordir, roomplace))
 234                         return;
 235
 236                 if (random.range(0, 1) == 0)
 237                         // Make the door
 238                         makeDoor(doorplace, doordir);
 239                 else
 240                         // Don't actually make a door
 241                         roomplace -= doordir;
 242
 243         }
 244 }
 245
 246
 247 void DungeonGen::makeRoom(v3s16 roomsize, v3s16 roomplace)
 248 {
 249         MapNode n_cobble(dp.c_cobble);
 250         MapNode n_air(CONTENT_AIR);
 251
 252         // Make +-X walls
 253         for (s16 z = 0; z < roomsize.Z; z++)
 254         for (s16 y = 0; y < roomsize.Y; y++) {
 255                 {
 256                         v3s16 p = roomplace + v3s16(0, y, z);
 257                         if (!vm->m_area.contains(p))
 258                                 continue;
 259                         u32 vi = vm->m_area.index(p);
 260                         if (vm->m_flags[vi] & VMANIP_FLAG_DUNGEON_UNTOUCHABLE)
 261                                 continue;
 262                         vm->m_data[vi] = n_cobble;
 263                 }
 264                 {
 265                         v3s16 p = roomplace + v3s16(roomsize.X - 1, y, z);
 266                         if (!vm->m_area.contains(p))
 267                                 continue;
 268                         u32 vi = vm->m_area.index(p);
 269                         if (vm->m_flags[vi] & VMANIP_FLAG_DUNGEON_UNTOUCHABLE)
 270                                 continue;
 271                         vm->m_data[vi] = n_cobble;
 272                 }
 273         }
 274
 275         // Make +-Z walls
 276         for (s16 x = 0; x < roomsize.X; x++)
 277         for (s16 y = 0; y < roomsize.Y; y++) {
 278                 {
 279                         v3s16 p = roomplace + v3s16(x, y, 0);
 280                         if (!vm->m_area.contains(p))
 281                                 continue;
 282                         u32 vi = vm->m_area.index(p);
 283                         if (vm->m_flags[vi] & VMANIP_FLAG_DUNGEON_UNTOUCHABLE)
 284                                 continue;
 285                         vm->m_data[vi] = n_cobble;
 286                 }
 287                 {
 288                         v3s16 p = roomplace + v3s16(x, y, roomsize.Z - 1);
 289                         if (!vm->m_area.contains(p))
 290                                 continue;
 291                         u32 vi = vm->m_area.index(p);
 292                         if (vm->m_flags[vi] & VMANIP_FLAG_DUNGEON_UNTOUCHABLE)
 293                                 continue;
 294                         vm->m_data[vi] = n_cobble;
 295                 }
 296         }
 297
 298         // Make +-Y walls (floor and ceiling)
 299         for (s16 z = 0; z < roomsize.Z; z++)
 300         for (s16 x = 0; x < roomsize.X; x++) {
 301                 {
 302                         v3s16 p = roomplace + v3s16(x, 0, z);
 303                         if (!vm->m_area.contains(p))
 304                                 continue;
 305                         u32 vi = vm->m_area.index(p);
 306                         if (vm->m_flags[vi] & VMANIP_FLAG_DUNGEON_UNTOUCHABLE)
 307                                 continue;
 308                         vm->m_data[vi] = n_cobble;
 309                 }
 310                 {
 311                         v3s16 p = roomplace + v3s16(x,roomsize. Y - 1, z);
 312                         if (!vm->m_area.contains(p))
 313                                 continue;
 314                         u32 vi = vm->m_area.index(p);
 315                         if (vm->m_flags[vi] & VMANIP_FLAG_DUNGEON_UNTOUCHABLE)
 316                                 continue;
 317                         vm->m_data[vi] = n_cobble;
 318                 }
 319         }
 320
 321         // Fill with air
 322         for (s16 z = 1; z < roomsize.Z - 1; z++)
 323         for (s16 y = 1; y < roomsize.Y - 1; y++)
 324         for (s16 x = 1; x < roomsize.X - 1; x++) {
 325                 v3s16 p = roomplace + v3s16(x, y, z);
 326                 if (!vm->m_area.contains(p))
 327                         continue;
 328                 u32 vi = vm->m_area.index(p);
 329                 vm->m_flags[vi] |= VMANIP_FLAG_DUNGEON_UNTOUCHABLE;
 330                 vm->m_data[vi] = n_air;
 331         }
 332 }
 333
 334
 335 void DungeonGen::makeFill(v3s16 place, v3s16 size,
 336         u8 avoid_flags, MapNode n, u8 or_flags)
 337 {
 338         for (s16 z = 0; z < size.Z; z++)
 339         for (s16 y = 0; y < size.Y; y++)
 340         for (s16 x = 0; x < size.X; x++) {
 341                 v3s16 p = place + v3s16(x, y, z);
 342                 if (!vm->m_area.contains(p))
 343                         continue;
 344                 u32 vi = vm->m_area.index(p);
 345                 if (vm->m_flags[vi] & avoid_flags)
 346                         continue;
 347                 vm->m_flags[vi] |= or_flags;
 348                 vm->m_data[vi] = n;
 349         }
 350 }
 351
 352
 353 void DungeonGen::makeHole(v3s16 place)
 354 {
 355         makeFill(place, dp.holesize, 0, MapNode(CONTENT_AIR),
 356                 VMANIP_FLAG_DUNGEON_INSIDE);
 357 }
 358
 359
 360 void DungeonGen::makeDoor(v3s16 doorplace, v3s16 doordir)
 361 {
 362         makeHole(doorplace);
 363
 364 #ifdef DGEN_USE_TORCHES
 365         // Place torch (for testing)
 366         vm->m_data[vm->m_area.index(doorplace)] = MapNode(c_torch);
 367 #endif
 368 }
 369
 370
 371 void DungeonGen::makeCorridor(v3s16 doorplace, v3s16 doordir,
 372         v3s16 &result_place, v3s16 &result_dir)
 373 {
 374         makeHole(doorplace);
 375         v3s16 p0 = doorplace;
 376         v3s16 dir = doordir;
 377         u32 length;
 378         /*if (random.next() % 2)
 379                 length = random.range(1, 13);
 380         else
 381                 length = random.range(1, 6);*/
 382         length = random.range(1, 13);
 383         u32 partlength = random.range(1, 13);
 384         u32 partcount = 0;
 385         s16 make_stairs = 0;
 386
 387         if (random.next() % 2 == 0 && partlength >= 3)
 388                 make_stairs = random.next() % 2 ? 1 : -1;
 389
 390         for (u32 i = 0; i < length; i++) {
 391                 v3s16 p = p0 + dir;
 392                 if (partcount != 0)
 393                         p.Y += make_stairs;
 394
 395                 if (vm->m_area.contains(p) && vm->m_area.contains(p + v3s16(0, 1, 0)) &&
 396                                 vm->m_area.contains(v3s16(p.X - dir.X, p.Y - 1, p.Z - dir.Z))) {
 397                         if (make_stairs) {
 398                                 makeFill(p + v3s16(-1, -1, -1),
 399                                         dp.holesize + v3s16(2, 3, 2),
 400                                         VMANIP_FLAG_DUNGEON_UNTOUCHABLE,
 401                                         MapNode(dp.c_cobble),
 402                                         0);
 403                                 makeHole(p);
 404                                 makeHole(p - dir);
 405
 406                                 // TODO: fix stairs code so it works 100%
 407                                 // (quite difficult)
 408
 409                                 // exclude stairs from the bottom step
 410                                 // exclude stairs from diagonal steps
 411                                 if (((dir.X ^ dir.Z) & 1) &&
 412                                                 (((make_stairs ==  1) && i != 0) ||
 413                                                 ((make_stairs == -1) && i != length - 1))) {
 414                                         // rotate face 180 deg if
 415                                         // making stairs backwards
 416                                         int facedir = dir_to_facedir(dir * make_stairs);
 417
 418                                         u32 vi = vm->m_area.index(p.X - dir.X, p.Y - 1, p.Z - dir.Z);
 419                                         if (vm->m_data[vi].getContent() == dp.c_cobble)
 420                                                 vm->m_data[vi] = MapNode(dp.c_stair, 0, facedir);
 421
 422                                         vi = vm->m_area.index(p.X, p.Y, p.Z);
 423                                         if (vm->m_data[vi].getContent() == dp.c_cobble)
 424                                                 vm->m_data[vi] = MapNode(dp.c_stair, 0, facedir);
 425                                 }
 426                         } else {
 427                                 makeFill(p + v3s16(-1, -1, -1),
 428                                         dp.holesize + v3s16(2, 2, 2),
 429                                         VMANIP_FLAG_DUNGEON_UNTOUCHABLE,
 430                                         MapNode(dp.c_cobble),
 431                                         0);
 432                                 makeHole(p);
 433                         }
 434
 435                         p0 = p;
 436                 } else {
 437                         // Can't go here, turn away
 438                         dir = turn_xz(dir, random.range(0, 1));
 439                         make_stairs = -make_stairs;
 440                         partcount = 0;
 441                         partlength = random.range(1, length);
 442                         continue;
 443                 }
 444
 445                 partcount++;
 446                 if (partcount >= partlength) {
 447                         partcount = 0;
 448
 449                         dir = random_turn(random, dir);
 450
 451                         partlength = random.range(1, length);
 452
 453                         make_stairs = 0;
 454                         if (random.next() % 2 == 0 && partlength >= 3)
 455                                 make_stairs = random.next() % 2 ? 1 : -1;
 456                 }
 457         }
 458         result_place = p0;
 459         result_dir = dir;
 460 }
 461
 462
 463 bool DungeonGen::findPlaceForDoor(v3s16 &result_place, v3s16 &result_dir)
 464 {
 465         for (u32 i = 0; i < 100; i++) {
 466                 v3s16 p = m_pos + m_dir;
 467                 v3s16 p1 = p + v3s16(0, 1, 0);
 468                 if (!vm->m_area.contains(p) || !vm->m_area.contains(p1) || i % 4 == 0) {
 469                         randomizeDir();
 470                         continue;
 471                 }
 472                 if (vm->getNodeNoExNoEmerge(p).getContent() == dp.c_cobble &&
 473                                 vm->getNodeNoExNoEmerge(p1).getContent() == dp.c_cobble) {
 474                         // Found wall, this is a good place!
 475                         result_place = p;
 476                         result_dir = m_dir;
 477                         // Randomize next direction
 478                         randomizeDir();
 479                         return true;
 480                 }
 481                 /*
 482                         Determine where to move next
 483                 */
 484                 // Jump one up if the actual space is there
 485                 if (vm->getNodeNoExNoEmerge(p +
 486                                 v3s16(0, 0, 0)).getContent() == dp.c_cobble &&
 487                                 vm->getNodeNoExNoEmerge(p +
 488                                 v3s16(0, 1, 0)).getContent() == CONTENT_AIR &&
 489                                 vm->getNodeNoExNoEmerge(p +
 490                                 v3s16(0, 2, 0)).getContent() == CONTENT_AIR)
 491                         p += v3s16(0,1,0);
 492                 // Jump one down if the actual space is there
 493                 if (vm->getNodeNoExNoEmerge(p +
 494                                 v3s16(0, 1, 0)).getContent() == dp.c_cobble &&
 495                                 vm->getNodeNoExNoEmerge(p +
 496                                 v3s16(0, 0, 0)).getContent() == CONTENT_AIR &&
 497                                 vm->getNodeNoExNoEmerge(p +
 498                                 v3s16(0, -1, 0)).getContent() == CONTENT_AIR)
 499                         p += v3s16(0, -1, 0);
 500                 // Check if walking is now possible
 501                 if (vm->getNodeNoExNoEmerge(p).getContent() != CONTENT_AIR ||
 502                                 vm->getNodeNoExNoEmerge(p +
 503                                 v3s16(0, 1, 0)).getContent() != CONTENT_AIR) {
 504                         // Cannot continue walking here
 505                         randomizeDir();
 506                         continue;
 507                 }
 508                 // Move there
 509                 m_pos = p;
 510         }
 511         return false;
 512 }
 513
 514
 515 bool DungeonGen::findPlaceForRoomDoor(v3s16 roomsize, v3s16 &result_doorplace,
 516         v3s16 &result_doordir, v3s16 &result_roomplace)
 517 {
 518         for (s16 trycount = 0; trycount < 30; trycount++) {
 519                 v3s16 doorplace;
 520                 v3s16 doordir;
 521                 bool r = findPlaceForDoor(doorplace, doordir);
 522                 if (r == false)
 523                         continue;
 524                 v3s16 roomplace;
 525                 // X east, Z north, Y up
 526 #if 1
 527                 if (doordir == v3s16(1, 0, 0)) // X+
 528                         roomplace = doorplace +
 529                                 v3s16(0, -1, random.range(-roomsize.Z + 2, -2));
 530                 if (doordir == v3s16(-1, 0, 0)) // X-
 531                         roomplace = doorplace +
 532                                 v3s16(-roomsize.X + 1, -1, random.range(-roomsize.Z + 2, -2));
 533                 if (doordir == v3s16(0, 0, 1)) // Z+
 534                         roomplace = doorplace +
 535                                 v3s16(random.range(-roomsize.X + 2, -2), -1, 0);
 536                 if (doordir == v3s16(0, 0, -1)) // Z-
 537                         roomplace = doorplace +
 538                                 v3s16(random.range(-roomsize.X + 2, -2), -1, -roomsize.Z + 1);
 539 #endif
 540 #if 0
 541                 if (doordir == v3s16(1, 0, 0)) // X+
 542                         roomplace = doorplace + v3s16(0, -1, -roomsize.Z / 2);
 543                 if (doordir == v3s16(-1, 0, 0)) // X-
 544                         roomplace = doorplace + v3s16(-roomsize.X+1,-1,-roomsize.Z / 2);
 545                 if (doordir == v3s16(0, 0, 1)) // Z+
 546                         roomplace = doorplace + v3s16(-roomsize.X / 2, -1, 0);
 547                 if (doordir == v3s16(0, 0, -1)) // Z-
 548                         roomplace = doorplace + v3s16(-roomsize.X / 2, -1, -roomsize.Z + 1);
 549 #endif
 550
 551                 // Check fit
 552                 bool fits = true;
 553                 for (s16 z = 1; z < roomsize.Z - 1; z++)
 554                 for (s16 y = 1; y < roomsize.Y - 1; y++)
 555                 for (s16 x = 1; x < roomsize.X - 1; x++) {
 556                         v3s16 p = roomplace + v3s16(x, y, z);
 557                         if (!vm->m_area.contains(p)) {
 558                                 fits = false;
 559                                 break;
 560                         }
 561                         if (vm->m_flags[vm->m_area.index(p)] & VMANIP_FLAG_DUNGEON_INSIDE) {
 562                                 fits = false;
 563                                 break;
 564                         }
 565                 }
 566                 if (fits == false) {
 567                         // Find new place
 568                         continue;
 569                 }
 570                 result_doorplace = doorplace;
 571                 result_doordir   = doordir;
 572                 result_roomplace = roomplace;
 573                 return true;
 574         }
 575         return false;
 576 }
 577
 578
 579 v3s16 rand_ortho_dir(PseudoRandom &random, bool diagonal_dirs)
 580 {
 581         // Make diagonal directions somewhat rare
 582         if (diagonal_dirs && (random.next() % 4 == 0)) {
 583                 v3s16 dir;
 584                 int trycount = 0;
 585
 586                 do {
 587                         trycount++;
 588                         dir = v3s16(random.next() % 3 - 1, 0, random.next() % 3 - 1);
 589                 } while ((dir.X == 0 && dir.Z == 0) && trycount < 10);
 590
 591                 return dir;
 592         } else {
 593                 if (random.next() % 2 == 0)
 594                         return random.next() % 2 ? v3s16(-1, 0, 0) : v3s16(1, 0, 0);
 595                 else
 596                         return random.next() % 2 ? v3s16(0, 0, -1) : v3s16(0, 0, 1);
 597         }
 598 }
 599
 600
 601 v3s16 turn_xz(v3s16 olddir, int t)
 602 {
 603         v3s16 dir;
 604         if (t == 0) {
 605                 // Turn right
 606                 dir.X = olddir.Z;
 607                 dir.Z = -olddir.X;
 608                 dir.Y = olddir.Y;
 609         } else {
 610                 // Turn left
 611                 dir.X = -olddir.Z;
 612                 dir.Z = olddir.X;
 613                 dir.Y = olddir.Y;
 614         }
 615         return dir;
 616 }
 617
 618
 619 v3s16 random_turn(PseudoRandom &random, v3s16 olddir)
 620 {
 621         int turn = random.range(0, 2);
 622         v3s16 dir;
 623         if (turn == 0)
 624                 // Go straight
 625                 dir = olddir;
 626         else if (turn == 1)
 627                 // Turn right
 628                 dir = turn_xz(olddir, 0);
 629         else
 630                 // Turn left
 631                 dir = turn_xz(olddir, 1);
 632         return dir;
 633 }
 634
 635
 636 int dir_to_facedir(v3s16 d)
 637 {
 638         if (abs(d.X) > abs(d.Z))
 639                 return d.X < 0 ? 3 : 1;
 640         else
 641                 return d.Z < 0 ? 2 : 0;
 642 }