aboutsummaryrefslogtreecommitdiff
path: root/client/shaders
Commit message (Expand)AuthorAge
* Fog: Make fraction of visible distance at which fog starts configurableLars Hofhansl2016-12-07
* Fix unexplained shader issue (glsl compiler bug??) (#4757)Rogier-52016-11-17
* Remove unused shader matrices. (#4723)lhofhansl2016-11-04
* Shaders: Remove special handling for liquids. (#4670)lhofhansl2016-10-26
* Shaders: Apply tone mapping before fog calculation.Lars Hofhansl2016-10-25
* Shaders: Harmonize Irrlicht and shader fog calculationsLars Hofhansl2016-10-24
* Use range-based fog instead of z-plane based.Lars Hofhansl2016-10-13
* Nodes shader: Decrease amplitude of waving leaves and plantsparamat2016-03-30
* Replace CRLF with LF in shader filesest312016-03-25
* Shaders: fix fog not affecting opaque liquidsRealBadAngel2016-02-23
* Filmic HDR tone mappingRealBadAngel2016-02-09
* Cleanup selection mesh code, add shaders for halo and selection boxesRealBadAngel2016-02-08
* Speed up and make more accurate relief mappingRealBadAngel2015-12-10
* Shaders: use triple-frequency waving for leaves and plantsparamat2015-09-07
* Remove use of engine sent texture tiling flags - theyre no longer neededRealBadAngel2015-08-20
* Add wielded (and CAOs) shaderRealBadAngel2015-07-21
* Fix relief mapping issuesRealBadAngel2015-07-16
* Shaders fixes and cleanup relief mapping code.RealBadAngel2015-07-02
* Bugfix: variable type mismatchRealBadAngel2015-06-28
* Add minimap featureRealBadAngel2015-06-27
* Remove textures vertical offset. Fix for area enabling parallax.RealBadAngel2015-06-21
* Automated whitespace error fix for last commitest312015-06-14
* Improved parallax mapping. Generate heightmaps on the fly.RealBadAngel2015-06-14
* Optimize bumpmapping mathematicsLoic Blot2015-01-16
* Revert "Optimize bumpmapping mathematics"Craig Robbins2015-01-16
* Optimize bumpmapping mathematicsLoic Blot2015-01-15
* Restore finalColorBlend implementation in shaders.RealBadAngel2014-12-07
* Let lighting be done only CPU side. Remove finalColorBlend implementation fro...RealBadAngel2014-08-16
* Make faces shading correct for all possible modes.RealBadAngel2014-08-14
* Faces shading fixesRealBadAngel2014-07-07
* Improved faces shading with and without shaders.RealBadAngel2014-06-17
* Unite nodes shaders.RealBadAngel2014-06-15
* Fix invalid liquid lighting.RealBadAngel2014-04-16
* Normal maps generation on the fly.RealBadAngel2014-03-21
* Optimize shaders code. Add settings at compile time.RealBadAngel2013-12-09
* Fix shaders on some GPUsNovatux2013-12-08
* Shaders rework.RealBadAngel2013-12-03
* Fix texture bumpmapping on some GPUsZeg92013-08-04
* Add texture bumpmapping feature.RealBadAngel2013-07-04
* Actually fix shader3 alpha this timekwolekr2013-04-27
* Transform alpha channel as well in shaderkwolekr2013-04-25
* Add option to use texture alpha channelkwolekr2013-04-23
* Fix new_style_waterPilzAdam2013-03-17
* Tweak shader randomly a bitPerttu Ahola2012-12-02
* Handle day-night transition in shader and make light sources brighter when sh...Perttu Ahola2012-12-02
* Remove accidental vim swap filePerttu Ahola2012-12-02
* Implement a global shader parameter passing system and useful shadersPerttu Ahola2012-12-02
* ShaderSource and silly example shadersKahrl2012-12-02
generated by cgit v1.2.3 (git 2.39.1) at 2024-12-28 11:51:19 +0000
kwb">const { AreaMap::const_iterator it = areas_map.find(id); if (it == areas_map.end()) return nullptr; return &it->second; } void AreaStore::serialize(std::ostream &os) const { writeU8(os, 0); // Serialisation version // TODO: Compression? writeU16(os, areas_map.size()); for (const auto &it : areas_map) { const Area &a = it.second; writeV3S16(os, a.minedge); writeV3S16(os, a.maxedge); writeU16(os, a.data.size()); os.write(a.data.data(), a.data.size()); } } void AreaStore::deserialize(std::istream &is) { u8 ver = readU8(is); if (ver != 0) throw SerializationError("Unknown AreaStore " "serialization version!"); u16 num_areas = readU16(is); for (u32 i = 0; i < num_areas; ++i) { Area a; a.minedge = readV3S16(is); a.maxedge = readV3S16(is); u16 data_len = readU16(is); char *data = new char[data_len]; is.read(data, data_len); a.data = std::string(data, data_len); insertArea(&a); delete [] data; } } void AreaStore::invalidateCache() { if (m_cache_enabled) { m_res_cache.invalidate(); } } void AreaStore::setCacheParams(bool enabled, u8 block_radius, size_t limit) { m_cache_enabled = enabled; m_cacheblock_radius = MYMAX(block_radius, 16); m_res_cache.setLimit(MYMAX(limit, 20)); invalidateCache(); } void AreaStore::cacheMiss(void *data, const v3s16 &mpos, std::vector<Area *> *dest) { AreaStore *as = (AreaStore *)data; u8 r = as->m_cacheblock_radius; // get the points at the edges of the mapblock v3s16 minedge(mpos.X * r, mpos.Y * r, mpos.Z * r); v3s16 maxedge( minedge.X + r - 1, minedge.Y + r - 1, minedge.Z + r - 1); as->getAreasInArea(dest, minedge, maxedge, true); /* infostream << "Cache miss with " << dest->size() << " areas, between (" << minedge.X << ", " << minedge.Y << ", " << minedge.Z << ") and (" << maxedge.X << ", " << maxedge.Y << ", " << maxedge.Z << ")" << std::endl; // */ } void AreaStore::getAreasForPos(std::vector<Area *> *result, v3s16 pos) { if (m_cache_enabled) { v3s16 mblock = getContainerPos(pos, m_cacheblock_radius); const std::vector<Area *> *pre_list = m_res_cache.lookupCache(mblock); size_t s_p_l = pre_list->size(); for (size_t i = 0; i < s_p_l; i++) { Area *b = (*pre_list)[i]; if (AST_CONTAINS_PT(b, pos)) { result->push_back(b); } } } else { return getAreasForPosImpl(result, pos); } } //// // VectorAreaStore //// bool VectorAreaStore::insertArea(Area *a) { if (a->id == U32_MAX) a->id = getNextId(); std::pair<AreaMap::iterator, bool> res = areas_map.insert(std::make_pair(a->id, *a)); if (!res.second) // ID is not unique return false; m_areas.push_back(&res.first->second); invalidateCache(); return true; } bool VectorAreaStore::removeArea(u32 id) { AreaMap::iterator it = areas_map.find(id); if (it == areas_map.end()) return false; Area *a = &it->second; for (std::vector<Area *>::iterator v_it = m_areas.begin(); v_it != m_areas.end(); ++v_it) { if (*v_it == a) { m_areas.erase(v_it); break; } } areas_map.erase(it); invalidateCache(); return true; } void VectorAreaStore::getAreasForPosImpl(std::vector<Area *> *result, v3s16 pos) { for (Area *area : m_areas) { if (AST_CONTAINS_PT(area, pos)) { result->push_back(area); } } } void VectorAreaStore::getAreasInArea(std::vector<Area *> *result, v3s16 minedge, v3s16 maxedge, bool accept_overlap) { for (Area *area : m_areas) { if (accept_overlap ? AST_AREAS_OVERLAP(minedge, maxedge, area) : AST_CONTAINS_AREA(minedge, maxedge, area)) { result->push_back(area); } } } #if USE_SPATIAL static inline SpatialIndex::Region get_spatial_region(const v3s16 minedge, const v3s16 maxedge) { const double p_low[] = {(double)minedge.X, (double)minedge.Y, (double)minedge.Z}; const double p_high[] = {(double)maxedge.X, (double)maxedge.Y, (double)maxedge.Z}; return SpatialIndex::Region(p_low, p_high, 3); } static inline SpatialIndex::Point get_spatial_point(const v3s16 pos) { const double p[] = {(double)pos.X, (double)pos.Y, (double)pos.Z}; return SpatialIndex::Point(p, 3); } bool SpatialAreaStore::insertArea(Area *a) { if (a->id == U32_MAX) a->id = getNextId(); if (!areas_map.insert(std::make_pair(a->id, *a)).second) // ID is not unique return false; m_tree->insertData(0, nullptr, get_spatial_region(a->minedge, a->maxedge), a->id); invalidateCache(); return true; } bool SpatialAreaStore::removeArea(u32 id) { std::map<u32, Area>::iterator itr = areas_map.find(id); if (itr != areas_map.end()) { Area *a = &itr->second; bool result = m_tree->deleteData(get_spatial_region(a->minedge, a->maxedge), id); areas_map.erase(itr); invalidateCache(); return result; } else { return false; } } void SpatialAreaStore::getAreasForPosImpl(std::vector<Area *> *result, v3s16 pos) { VectorResultVisitor visitor(result, this); m_tree->pointLocationQuery(get_spatial_point(pos), visitor); } void SpatialAreaStore::getAreasInArea(std::vector<Area *> *result, v3s16 minedge, v3s16 maxedge, bool accept_overlap) { VectorResultVisitor visitor(result, this); if (accept_overlap) { m_tree->intersectsWithQuery(get_spatial_region(minedge, maxedge), visitor); } else { m_tree->containsWhatQuery(get_spatial_region(minedge, maxedge), visitor); } } SpatialAreaStore::~SpatialAreaStore() { delete m_tree; } SpatialAreaStore::SpatialAreaStore() { m_storagemanager = SpatialIndex::StorageManager::createNewMemoryStorageManager(); SpatialIndex::id_type id; m_tree = SpatialIndex::RTree::createNewRTree( *m_storagemanager, .7, // Fill factor 100, // Index capacity 100, // Leaf capacity 3, // dimension :) SpatialIndex::RTree::RV_RSTAR, id); } #endif
generated by cgit v1.2.3 (git 2.39.1) at 2024-12-28 11:51:19 +0000