minetest.git - modified minetest for gpcfs purposes

	Commit message (Expand)	Author	Age
*	Reorganizing stuff (import from temporary git repo)	Perttu Ahola	2011-06-25

p, p.Z + z); if (!vm->m_area.contains(vi)) continue; if (schemdata[i].getContent() == CONTENT_IGNORE) continue; u8 placement_prob = schemdata[i].param1 & MTSCHEM_PROB_MASK; bool force_place_node = schemdata[i].param1 & MTSCHEM_FORCE_PLACE; if (placement_prob == MTSCHEM_PROB_NEVER) continue; if (!force_place && !force_place_node) { content_t c = vm->m_data[vi].getContent(); if (c != CONTENT_AIR && c != CONTENT_IGNORE) continue; } if ((placement_prob != MTSCHEM_PROB_ALWAYS) && (placement_prob <= myrand_range(1, MTSCHEM_PROB_ALWAYS))) continue; vm->m_data[vi] = schemdata[i]; vm->m_data[vi].param1 = 0; if (rot) vm->m_data[vi].rotateAlongYAxis(m_ndef, rot); } } y_map++; } } void Schematic::placeStructure(Map *map, v3s16 p, u32 flags, Rotation rot, bool force_place) { assert(schemdata != NULL); // Pre-condition sanity_check(m_ndef != NULL); MMVManip *vm = new MMVManip(map); if (rot == ROTATE_RAND) rot = (Rotation)myrand_range(ROTATE_0, ROTATE_270); v3s16 s = (rot == ROTATE_90 || rot == ROTATE_270) ? v3s16(size.Z, size.Y, size.X) : size; if (flags & DECO_PLACE_CENTER_X) p.X -= (s.X + 1) / 2; if (flags & DECO_PLACE_CENTER_Y) p.Y -= (s.Y + 1) / 2; if (flags & DECO_PLACE_CENTER_Z) p.Z -= (s.Z + 1) / 2; v3s16 bp1 = getNodeBlockPos(p); v3s16 bp2 = getNodeBlockPos(p + s - v3s16(1,1,1)); vm->initialEmerge(bp1, bp2); blitToVManip(p, vm, rot, force_place); std::map lighting_modified_blocks; std::map modified_blocks; vm->blitBackAll(&modified_blocks); // TODO: Optimize this by using Mapgen::calcLighting() instead lighting_modified_blocks.insert(modified_blocks.begin(), modified_blocks.end()); map->updateLighting(lighting_modified_blocks, modified_blocks); MapEditEvent event; event.type = MEET_OTHER; for (std::map::iterator it = modified_blocks.begin(); it != modified_blocks.end(); ++it) event.modified_blocks.insert(it->first); map->dispatchEvent(&event); } bool Schematic::deserializeFromMts(std::istream *is, std::vector *names) { std::istream &ss = *is; content_t cignore = CONTENT_IGNORE; bool have_cignore = false; //// Read signature u32 signature = readU32(ss); if (signature != MTSCHEM_FILE_SIGNATURE) { errorstream << "Schematic::deserializeFromMts: invalid schematic " "file" << std::endl; return false; } //// Read version u16 version = readU16(ss); if (version > MTSCHEM_FILE_VER_HIGHEST_READ) { errorstream << "Schematic::deserializeFromMts: unsupported schematic " "file version" << std::endl; return false; } //// Read size size = readV3S16(ss); //// Read Y-slice probability values delete []slice_probs; slice_probs = new u8[size.Y]; for (int y = 0; y != size.Y; y++) slice_probs[y] = (version >= 3) ? readU8(ss) : MTSCHEM_PROB_ALWAYS_OLD; //// Read node names u16 nidmapcount = readU16(ss); for (int i = 0; i != nidmapcount; i++) { std::string name = deSerializeString(ss); // Instances of "ignore" from v1 are converted to air (and instances // are fixed to have MTSCHEM_PROB_NEVER later on). if (name == "ignore") { name = "air"; cignore = i; have_cignore = true; } names->push_back(name); } //// Read node data size_t nodecount = size.X * size.Y * size.Z; delete []schemdata; schemdata = new MapNode[nodecount]; MapNode::deSerializeBulk(ss, SER_FMT_VER_HIGHEST_READ, schemdata, nodecount, 2, 2, true); // Fix probability values for nodes that were ignore; removed in v2 if (version < 2) { for (size_t i = 0; i != nodecount; i++) { if (schemdata[i].param1 == 0) schemdata[i].param1 = MTSCHEM_PROB_ALWAYS_OLD; if (have_cignore && schemdata[i].getContent() == cignore) schemdata[i].param1 = MTSCHEM_PROB_NEVER; } } // Fix probability values for probability range truncation introduced in v4 if (version < 4) { for (s16 y = 0; y != size.Y; y++) slice_probs[y] >>= 1; for (size_t i = 0; i != nodecount; i++) schemdata[i].param1 >>= 1; } return true; } bool Schematic::serializeToMts(std::ostream *os, const std::vector &names) { std::ostream &ss = *os; writeU32(ss, MTSCHEM_FILE_SIGNATURE); // signature writeU16(ss, MTSCHEM_FILE_VER_HIGHEST_WRITE); // version writeV3S16(ss, size); // schematic size for (int y = 0; y != size.Y; y++) // Y slice probabilities writeU8(ss, slice_probs[y]); writeU16(ss, names.size()); // name count for (size_t i = 0; i != names.size(); i++) ss << serializeString(names[i]); // node names // compressed bulk node data MapNode::serializeBulk(ss, SER_FMT_VER_HIGHEST_WRITE, schemdata, size.X * size.Y * size.Z, 2, 2, true); return true; } bool Schematic::serializeToLua(std::ostream *os, const std::vector &names, bool use_comments, u32 indent_spaces) { std::ostream &ss = *os; std::string indent("\t"); if (indent_spaces > 0) indent.assign(indent_spaces, ' '); //// Write header { ss << "schematic = {" << std::endl; ss << indent << "size = " << "{x=" << size.X << ", y=" << size.Y << ", z=" << size.Z << "}," << std::endl; } //// Write y-slice probabilities { ss << indent << "yslice_prob = {" << std::endl; for (u16 y = 0; y != size.Y; y++) { u8 probability = slice_probs[y] & MTSCHEM_PROB_MASK; ss << indent << indent << "{" << "ypos=" << y << ", prob=" << (u16)probability * 2 << "}," << std::endl; } ss << indent << "}," << std::endl; } //// Write node data { ss << indent << "data = {" << std::endl; u32 i = 0; for (u16 z = 0; z != size.Z; z++) for (u16 y = 0; y != size.Y; y++) { if (use_comments) { ss << std::endl << indent << indent << "-- z=" << z << ", y=" << y << std::endl; } for (u16 x = 0; x != size.X; x++, i++) { u8 probability = schemdata[i].param1 & MTSCHEM_PROB_MASK; bool force_place = schemdata[i].param1 & MTSCHEM_FORCE_PLACE; ss << indent << indent << "{" << "name=\"" << names[schemdata[i].getContent()] << "\", prob=" << (u16)probability * 2 << ", param2=" << (u16)schemdata[i].param2; if (force_place) ss << ", force_place=true"; ss << "}," << std::endl; } } ss << indent << "}," << std::endl; } ss << "}" << std::endl; return true; } bool Schematic::loadSchematicFromFile(const std::string &filename, INodeDefManager *ndef, StringMap *replace_names) { std::ifstream is(filename.c_str(), std::ios_base::binary); if (!is.good()) { errorstream << "Schematic::loadSchematicFile: unable to open file '" << filename << "'" << std::endl; return false; } size_t origsize = m_nodenames.size(); if (!deserializeFromMts(&is, &m_nodenames)) return false; if (replace_names) { for (size_t i = origsize; i != m_nodenames.size(); i++) { std::string &name = m_nodenames[i]; StringMap::iterator it = replace_names->find(name); if (it != replace_names->end()) name = it->second; } } m_nnlistsizes.push_back(m_nodenames.size() - origsize); if (ndef) ndef->pendNodeResolve(this); return true; } bool Schematic::saveSchematicToFile(const std::string &filename, INodeDefManager *ndef) { MapNode *orig_schemdata = schemdata; std::vector ndef_nodenames; std::vector *names; if (m_resolve_done && ndef == NULL) ndef = m_ndef; if (ndef) { names = &ndef_nodenames; u32 volume = size.X * size.Y * size.Z; schemdata = new MapNode[volume]; for (u32 i = 0; i != volume; i++) schemdata[i] = orig_schemdata[i]; generate_nodelist_and_update_ids(schemdata, volume, names, ndef); } else { // otherwise, use the names we have on hand in the list names = &m_nodenames; } std::ostringstream os(std::ios_base::binary); bool status = serializeToMts(&os, *names); if (ndef) { delete []schemdata; schemdata = orig_schemdata; } if (!status) return false; return fs::safeWriteToFile(filename, os.str()); } bool Schematic::getSchematicFromMap(Map *map, v3s16 p1, v3s16 p2) { MMVManip *vm = new MMVManip(map); v3s16 bp1 = getNodeBlockPos(p1); v3s16 bp2 = getNodeBlockPos(p2); vm->initialEmerge(bp1, bp2); size = p2 - p1 + 1; slice_probs = new u8[size.Y]; for (s16 y = 0; y != size.Y; y++) slice_probs[y] = MTSCHEM_PROB_ALWAYS; schemdata = new MapNode[size.X * size.Y * size.Z]; u32 i = 0; for (s16 z = p1.Z; z <= p2.Z; z++) for (s16 y = p1.Y; y <= p2.Y; y++) { u32 vi = vm->m_area.index(p1.X, y, z); for (s16 x = p1.X; x <= p2.X; x++, i++, vi++) { schemdata[i] = vm->m_data[vi]; schemdata[i].param1 = MTSCHEM_PROB_ALWAYS; } } delete vm; return true; } void Schematic::applyProbabilities(v3s16 p0, std::vector > *plist, std::vector > *splist) { for (size_t i = 0; i != plist->size(); i++) { v3s16 p = (*plist)[i].first - p0; int index = p.Z * (size.Y * size.X) + p.Y * size.X + p.X; if (index < size.Z * size.Y * size.X) { u8 prob = (*plist)[i].second; schemdata[index].param1 = prob; // trim unnecessary node names from schematic if (prob == MTSCHEM_PROB_NEVER) schemdata[index].setContent(CONTENT_AIR); } } for (size_t i = 0; i != splist->size(); i++) { s16 y = (*splist)[i].first - p0.Y; slice_probs[y] = (*splist)[i].second; } } void generate_nodelist_and_update_ids(MapNode *nodes, size_t nodecount, std::vector *usednodes, INodeDefManager *ndef) { std::map nodeidmap; content_t numids = 0; for (size_t i = 0; i != nodecount; i++) { content_t id; content_t c = nodes[i].getContent(); std::map::const_iterator it = nodeidmap.find(c); if (it == nodeidmap.end()) { id = numids; numids++; usednodes->push_back(ndef->get(c).name); nodeidmap.insert(std::make_pair(c, id)); } else { id = it->second; } nodes[i].setContent(id); } }