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