src/mapgen_singlenode.cpp

   1 /*
   2 Minetest
   3 Copyright (C) 2010-2015 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 "mapgen_singlenode.h"
  21 #include "voxel.h"
  22 #include "mapblock.h"
  23 #include "mapnode.h"
  24 #include "map.h"
  25 #include "nodedef.h"
  26 #include "voxelalgorithms.h"
  27 #include "emerge.h"
  28
  29
  30 MapgenSinglenode::MapgenSinglenode(int mapgenid,
  31         MapgenParams *params, EmergeManager *emerge)
  32         : Mapgen(mapgenid, params, emerge)
  33 {
  34         flags = params->flags;
  35
  36         INodeDefManager *ndef = emerge->ndef;
  37
  38         c_node = ndef->getId("mapgen_singlenode");
  39         if (c_node == CONTENT_IGNORE)
  40                 c_node = CONTENT_AIR;
  41 }
  42
  43
  44 MapgenSinglenode::~MapgenSinglenode()
  45 {
  46 }
  47
  48 //////////////////////// Map generator
  49
  50 void MapgenSinglenode::makeChunk(BlockMakeData *data)
  51 {
  52         // Pre-conditions
  53         assert(data->vmanip);
  54         assert(data->nodedef);
  55         assert(data->blockpos_requested.X >= data->blockpos_min.X &&
  56                    data->blockpos_requested.Y >= data->blockpos_min.Y &&
  57                    data->blockpos_requested.Z >= data->blockpos_min.Z);
  58         assert(data->blockpos_requested.X <= data->blockpos_max.X &&
  59                    data->blockpos_requested.Y <= data->blockpos_max.Y &&
  60                    data->blockpos_requested.Z <= data->blockpos_max.Z);
  61
  62         this->generating = true;
  63         this->vm   = data->vmanip;
  64         this->ndef = data->nodedef;
  65
  66         v3s16 blockpos_min = data->blockpos_min;
  67         v3s16 blockpos_max = data->blockpos_max;
  68
  69         // Area of central chunk
  70         v3s16 node_min = blockpos_min*MAP_BLOCKSIZE;
  71         v3s16 node_max = (blockpos_max+v3s16(1,1,1))*MAP_BLOCKSIZE-v3s16(1,1,1);
  72
  73         blockseed = getBlockSeed2(node_min, data->seed);
  74
  75         MapNode n_node(c_node);
  76
  77         for (s16 z = node_min.Z; z <= node_max.Z; z++)
  78         for (s16 y = node_min.Y; y <= node_max.Y; y++) {
  79                 u32 i = vm->m_area.index(node_min.X, y, z);
  80                 for (s16 x = node_min.X; x <= node_max.X; x++) {
  81                         if (vm->m_data[i].getContent() == CONTENT_IGNORE)
  82                                 vm->m_data[i] = n_node;
  83                         i++;
  84                 }
  85         }
  86
  87         // Add top and bottom side of water to transforming_liquid queue
  88         updateLiquid(&data->transforming_liquid, node_min, node_max);
  89
  90         // Calculate lighting
  91         if (flags & MG_LIGHT)
  92                 calcLighting(node_min, node_max);
  93
  94         this->generating = false;
  95 }
  96
  97 int MapgenSinglenode::getGroundLevelAtPoint(v2s16 p)
  98 {
  99         return 0;
 100 }
 101