/* Minetest-c55 Copyright (C) 2010 celeron55, Perttu Ahola This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. */ #include "mapblock.h" #include "map.h" // For g_settings #include "main.h" #include "light.h" #include #include "mapnode_contentfeatures.h" #include "nodemetadata.h" /* MapBlock */ MapBlock::MapBlock(Map *parent, v3s16 pos, bool dummy): m_node_metadata(new NodeMetadataList), m_parent(parent), m_pos(pos), m_modified(MOD_STATE_WRITE_NEEDED), is_underground(false), m_lighting_expired(true), m_day_night_differs(false), m_generated(false), m_timestamp(BLOCK_TIMESTAMP_UNDEFINED), m_usage_timer(0) { data = NULL; if(dummy == false) reallocate(); #ifndef SERVER m_mesh_expired = false; mesh_mutex.Init(); mesh = NULL; m_temp_mods_mutex.Init(); #endif } MapBlock::~MapBlock() { #ifndef SERVER { JMutexAutoLock lock(mesh_mutex); if(mesh) { mesh->drop(); mesh = NULL; } } #endif delete m_node_metadata; if(data) delete[] data; } bool MapBlock::isValidPositionParent(v3s16 p) { if(isValidPosition(p)) { return true; } else{ return m_parent->isValidPosition(getPosRelative() + p); } } MapNode MapBlock::getNodeParent(v3s16 p) { if(isValidPosition(p) == false) { return m_parent->getNode(getPosRelative() + p); } else { if(data == NULL) throw InvalidPositionException(); return data[p.Z*MAP_BLOCKSIZE*MAP_BLOCKSIZE + p.Y*MAP_BLOCKSIZE + p.X]; } } void MapBlock::setNodeParent(v3s16 p, MapNode & n) { if(isValidPosition(p) == false) { m_parent->setNode(getPosRelative() + p, n); } else { if(data == NULL) throw InvalidPositionException(); data[p.Z*MAP_BLOCKSIZE*MAP_BLOCKSIZE + p.Y*MAP_BLOCKSIZE + p.X] = n; } } MapNode MapBlock::getNodeParentNoEx(v3s16 p) { if(isValidPosition(p) == false) { try{ return m_parent->getNode(getPosRelative() + p); } catch(InvalidPositionException &e) { return MapNode(CONTENT_IGNORE); } } else { if(data == NULL) { return MapNode(CONTENT_IGNORE); } return data[p.Z*MAP_BLOCKSIZE*MAP_BLOCKSIZE + p.Y*MAP_BLOCKSIZE + p.X]; } } #ifndef SERVER #if 1 void MapBlock::updateMesh(u32 daynight_ratio, ITextureSource *tsrc) { #if 0 /* DEBUG: If mesh has been generated, don't generate it again */ { JMutexAutoLock meshlock(mesh_mutex); if(mesh != NULL) return; } #endif MeshMakeData data; data.fill(daynight_ratio, this); scene::SMesh *mesh_new = makeMapBlockMesh(&data, tsrc); /* Replace the mesh */ replaceMesh(mesh_new); } #endif void MapBlock::replaceMesh(scene::SMesh *mesh_new) { mesh_mutex.Lock(); //scene::SMesh *mesh_old = mesh[daynight_i]; //mesh[daynight_i] = mesh_new; scene::SMesh *mesh_old = mesh; mesh = mesh_new; setMeshExpired(false); if(mesh_old != NULL) { // Remove hardware buffers of meshbuffers of mesh // NOTE: No way, this runs in a different thread and everything /*u32 c = mesh_old->getMeshBufferCount(); for(u32 i=0; igetMeshBuffer(i); }*/ /*dstream<<"mesh_old->getReferenceCount()=" <getReferenceCount()<getMeshBufferCount(); for(u32 i=0; igetMeshBuffer(i); dstream<<"buf->getReferenceCount()=" <getReferenceCount()<drop(); //delete mesh_old; } mesh_mutex.Unlock(); } #endif // !SERVER /* Propagates sunlight down through the block. Doesn't modify nodes that are not affected by sunlight. Returns false if sunlight at bottom block is invalid. Returns true if sunlight at bottom block is valid. Returns true if bottom block doesn't exist. If there is a block above, continues from it. If there is no block above, assumes there is sunlight, unless is_underground is set or highest node is water. All sunlighted nodes are added to light_sources. if remove_light==true, sets non-sunlighted nodes black. if black_air_left!=NULL, it is set to true if non-sunlighted air is left in block. */ bool MapBlock::propagateSunlight(core::map & light_sources, bool remove_light, bool *black_air_left) { // Whether the sunlight at the top of the bottom block is valid bool block_below_is_valid = true; v3s16 pos_relative = getPosRelative(); for(s16 x=0; x=0; y--) { MapNode n = getNodeRef(p2d.X, y, p2d.Y); if(content_features(n).walkable) { if(y == MAP_BLOCKSIZE-1) return -2; else return y; } } return -1; } catch(InvalidPositionException &e) { return -3; } } /* Serialization */ void MapBlock::serialize(std::ostream &os, u8 version) { if(!ser_ver_supported(version)) throw VersionMismatchException("ERROR: MapBlock format not supported"); if(data == NULL) { throw SerializationError("ERROR: Not writing dummy block."); } // These have no compression if(version <= 3 || version == 5 || version == 6) { u32 nodecount = MAP_BLOCKSIZE*MAP_BLOCKSIZE*MAP_BLOCKSIZE; u32 buflen = 1 + nodecount * MapNode::serializedLength(version); SharedBuffer dest(buflen); dest[0] = is_underground; for(u32 i=0; i materialdata(nodecount); for(u32 i=0; i lightdata(nodecount); for(u32 i=0; i= 10) { // Get and compress param2 SharedBuffer param2data(nodecount); for(u32 i=0; i= 18) { if(m_generated == false) flags |= 0x08; } os.write((char*)&flags, 1); u32 nodecount = MAP_BLOCKSIZE*MAP_BLOCKSIZE*MAP_BLOCKSIZE; /* Get data */ // Serialize nodes SharedBuffer databuf_nodelist(nodecount*3); for(u32 i=0; i databuf(nodecount*3); for(u32 i=0; i= 14) { if(version <= 15) { try{ std::ostringstream oss(std::ios_base::binary); m_node_metadata->serialize(oss); os<serialize(oss); compressZlib(oss.str(), os); //os< d(len); is.read((char*)*d, len); if(is.gcount() != len) throw SerializationError ("MapBlock::deSerialize: no enough input data"); data[i].deSerialize(*d, version); } } else if(version <= 10) { u32 nodecount = MAP_BLOCKSIZE*MAP_BLOCKSIZE*MAP_BLOCKSIZE; u8 t8; is.read((char*)&t8, 1); is_underground = t8; { // Uncompress and set material data std::ostringstream os(std::ios_base::binary); decompress(is, os, version); std::string s = os.str(); if(s.size() != nodecount) throw SerializationError ("MapBlock::deSerialize: invalid format"); for(u32 i=0; i= 10) { // Uncompress and set param2 data std::ostringstream os(std::ios_base::binary); decompress(is, os, version); std::string s = os.str(); if(s.size() != nodecount) throw SerializationError ("MapBlock::deSerialize: invalid format"); for(u32 i=0; i= 18) m_generated = (flags & 0x08) ? false : true; // Uncompress data std::ostringstream os(std::ios_base::binary); decompress(is, os, version); std::string s = os.str(); if(s.size() != nodecount*3) throw SerializationError ("MapBlock::deSerialize: decompress resulted in size" " other than nodecount*3"); // deserialize nodes from buffer for(u32 i=0; i= 14) { // Ignore errors try{ if(version <= 15) { std::string data = deSerializeString(is); std::istringstream iss(data, std::ios_base::binary); m_node_metadata->deSerialize(iss, gamedef); } else { //std::string data = deSerializeLongString(is); std::ostringstream oss(std::ios_base::binary); decompressZlib(is, oss); std::istringstream iss(oss.str(), std::ios_base::binary); m_node_metadata->deSerialize(iss, gamedef); } } catch(SerializationError &e) { dstream<<"WARNING: MapBlock::deSerialize(): Ignoring an error" <<" while deserializing node metadata"<= 9) { // count=0 writeU16(os, 0); } // Versions up from 15 have static objects. if(version >= 15) { m_static_objects.serialize(os); } // Timestamp if(version >= 17) { writeU32(os, getTimestamp()); } } void MapBlock::deSerializeDiskExtra(std::istream &is, u8 version) { /* Versions up from 9 have block objects. (DEPRECATED) */ if(version >= 9) { u16 count = readU16(is); // Not supported and length not known if count is not 0 if(count != 0){ dstream<<"WARNING: MapBlock::deSerializeDiskExtra(): " <<"Ignoring stuff coming at and after MBOs"<= 15) { m_static_objects.deSerialize(is); } // Timestamp if(version >= 17) { setTimestamp(readU32(is)); } else { setTimestamp(BLOCK_TIMESTAMP_UNDEFINED); } } /* Get a quick string to describe what a block actually contains */ std::string analyze_block(MapBlock *block) { if(block == NULL) { return "NULL"; } std::ostringstream desc; v3s16 p = block->getPos(); char spos[20]; snprintf(spos, 20, "(%2d,%2d,%2d), ", p.X, p.Y, p.Z); desc<getModified()) { case MOD_STATE_CLEAN: desc<<"CLEAN, "; break; case MOD_STATE_WRITE_AT_UNLOAD: desc<<"WRITE_AT_UNLOAD, "; break; case MOD_STATE_WRITE_NEEDED: desc<<"WRITE_NEEDED, "; break; default: desc<<"unknown getModified()="+itos(block->getModified())+", "; } if(block->isGenerated()) desc<<"is_gen [X], "; else desc<<"is_gen [ ], "; if(block->getIsUnderground()) desc<<"is_ug [X], "; else desc<<"is_ug [ ], "; #ifndef SERVER if(block->getMeshExpired()) desc<<"mesh_exp [X], "; else desc<<"mesh_exp [ ], "; #endif if(block->getLightingExpired()) desc<<"lighting_exp [X], "; else desc<<"lighting_exp [ ], "; if(block->isDummy()) { desc<<"Dummy, "; } else { // We'll just define the numbers here, don't want to include // content_mapnode.h const content_t content_water = 2; const content_t content_watersource = 9; const content_t content_tree = 0x801; const content_t content_leaves = 0x802; const content_t content_jungletree = 0x815; bool full_ignore = true; bool some_ignore = false; bool full_air = true; bool some_air = false; bool trees = false; bool water = false; for(s16 z0=0; z0getNode(p); content_t c = n.getContent(); if(c == CONTENT_IGNORE) some_ignore = true; else full_ignore = false; if(c == CONTENT_AIR) some_air = true; else full_air = false; if(c == content_tree || c == content_jungletree || c == content_leaves) trees = true; if(c == content_water || c == content_watersource) water = true; } desc<<"content {"; std::ostringstream ss; if(full_ignore) ss<<"IGNORE (full), "; else if(some_ignore) ss<<"IGNORE, "; if(full_air) ss<<"AIR (full), "; else if(some_air) ss<<"AIR, "; if(trees) ss<<"trees, "; if(water) ss<<"water, "; if(ss.str().size()>=2) desc<