minetest.git - modified minetest for gpcfs purposes

diff options

Diffstat (limited to 'client/shaders/minimap_shader')

0 files changed, 0 insertions, 0 deletions

/* Minetest Copyright (C) 2010-2013 celeron55, Perttu Ahola <celeron55@gmail.com> This program is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser 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 "numeric.h" #include "log.h" #include "../constants.h" // BS, MAP_BLOCKSIZE #include "../noise.h" // PseudoRandom, PcgRandom #include "../threading/mutex_auto_lock.h" #include <string.h> #include <iostream> UNORDERED_MAP<u16, std::vector<v3s16> > FacePositionCache::m_cache; Mutex FacePositionCache::m_cache_mutex; // Calculate the borders of a "d-radius" cube // TODO: Make it work without mutex and data races, probably thread-local std::vector<v3s16> FacePositionCache::getFacePositions(u16 d) { MutexAutoLock cachelock(m_cache_mutex); if (m_cache.find(d) != m_cache.end()) return m_cache[d]; generateFacePosition(d); return m_cache[d]; } void FacePositionCache::generateFacePosition(u16 d) { m_cache[d] = std::vector<v3s16>(); if(d == 0) { m_cache[d].push_back(v3s16(0,0,0)); return; } if(d == 1) { /* This is an optimized sequence of coordinates. */ m_cache[d].push_back(v3s16( 0, 1, 0)); // top m_cache[d].push_back(v3s16( 0, 0, 1)); // back m_cache[d].push_back(v3s16(-1, 0, 0)); // left m_cache[d].push_back(v3s16( 1, 0, 0)); // right m_cache[d].push_back(v3s16( 0, 0,-1)); // front m_cache[d].push_back(v3s16( 0,-1, 0)); // bottom // 6 m_cache[d].push_back(v3s16(-1, 0, 1)); // back left m_cache[d].push_back(v3s16( 1, 0, 1)); // back right m_cache[d].push_back(v3s16(-1, 0,-1)); // front left m_cache[d].push_back(v3s16( 1, 0,-1)); // front right m_cache[d].push_back(v3s16(-1,-1, 0)); // bottom left m_cache[d].push_back(v3s16( 1,-1, 0)); // bottom right m_cache[d].push_back(v3s16( 0,-1, 1)); // bottom back m_cache[d].push_back(v3s16( 0,-1,-1)); // bottom front m_cache[d].push_back(v3s16(-1, 1, 0)); // top left m_cache[d].push_back(v3s16( 1, 1, 0)); // top right m_cache[d].push_back(v3s16( 0, 1, 1)); // top back m_cache[d].push_back(v3s16( 0, 1,-1)); // top front // 18 m_cache[d].push_back(v3s16(-1, 1, 1)); // top back-left m_cache[d].push_back(v3s16( 1, 1, 1)); // top back-right m_cache[d].push_back(v3s16(-1, 1,-1)); // top front-left m_cache[d].push_back(v3s16( 1, 1,-1)); // top front-right m_cache[d].push_back(v3s16(-1,-1, 1)); // bottom back-left m_cache[d].push_back(v3s16( 1,-1, 1)); // bottom back-right m_cache[d].push_back(v3s16(-1,-1,-1)); // bottom front-left m_cache[d].push_back(v3s16( 1,-1,-1)); // bottom front-right // 26 return; } // Take blocks in all sides, starting from y=0 and going +-y for(s16 y=0; y<=d-1; y++) { // Left and right side, including borders for(s16 z=-d; z<=d; z++) { m_cache[d].push_back(v3s16(d,y,z)); m_cache[d].push_back(v3s16(-d,y,z)); if(y != 0) { m_cache[d].push_back(v3s16(d,-y,z)); m_cache[d].push_back(v3s16(-d,-y,z)); } } // Back and front side, excluding borders for(s16 x=-d+1; x<=d-1; x++) { m_cache[d].push_back(v3s16(x,y,d)); m_cache[d].push_back(v3s16(x,y,-d)); if(y != 0) { m_cache[d].push_back(v3s16(x,-y,d)); m_cache[d].push_back(v3s16(x,-y,-d)); } } } // Take the bottom and top face with borders // -d<x<d, y=+-d, -d<z<d for(s16 x=-d; x<=d; x++) for(s16 z=-d; z<=d; z++) { m_cache[d].push_back(v3s16(x,-d,z)); m_cache[d].push_back(v3s16(x,d,z)); } } /* myrand */ PcgRandom g_pcgrand; u32 myrand() { return g_pcgrand.next(); } void mysrand(unsigned int seed) { g_pcgrand.seed(seed); } void myrand_bytes(void *out, size_t len) { g_pcgrand.bytes(out, len); } int myrand_range(int min, int max) { return g_pcgrand.range(min, max); } /* 64-bit unaligned version of MurmurHash */ u64 murmur_hash_64_ua(const void *key, int len, unsigned int seed) { const u64 m = 0xc6a4a7935bd1e995ULL; const int r = 47; u64 h = seed ^ (len * m); const u64 *data = (const u64 *)key; const u64 *end = data + (len / 8);


context:
space:
mode: