]> git.localhorst.tv Git - blank.git/blobdiff - src/chunk.cpp
be smart about other stuff ^^
[blank.git] / src / chunk.cpp
index a64e184140f503d4d343b26c04207571db0c459e..f172143cbf11180cc650557c900267b2eb5ee707 100644 (file)
@@ -5,12 +5,11 @@
 #include <algorithm>
 #include <limits>
 #include <queue>
-#include <glm/gtx/transform.hpp>
 
 
 namespace blank {
 
-Chunk::Chunk(const BlockTypeRegistry &types)
+Chunk::Chunk(const BlockTypeRegistry &types) noexcept
 : types(&types)
 , neighbor{0}
 , blocks{}
@@ -21,7 +20,7 @@ Chunk::Chunk(const BlockTypeRegistry &types)
 
 }
 
-Chunk::Chunk(Chunk &&other)
+Chunk::Chunk(Chunk &&other) noexcept
 : types(other.types)
 , model(std::move(other.model))
 , position(other.position)
@@ -31,7 +30,7 @@ Chunk::Chunk(Chunk &&other)
        std::copy(other.light, other.light + sizeof(light), light);
 }
 
-Chunk &Chunk::operator =(Chunk &&other) {
+Chunk &Chunk::operator =(Chunk &&other) noexcept {
        types = other.types;
        std::copy(other.neighbor, other.neighbor + sizeof(neighbor), neighbor);
        std::copy(other.blocks, other.blocks + sizeof(blocks), blocks);
@@ -53,14 +52,14 @@ struct SetNode {
        SetNode(Chunk *chunk, Chunk::Pos pos)
        : chunk(chunk), pos(pos) { }
 
-       int Get() const { return chunk->GetLight(pos); }
-       void Set(int level) { chunk->SetLight(pos, level); }
+       int Get() const noexcept { return chunk->GetLight(pos); }
+       void Set(int level) noexcept { chunk->SetLight(pos, level); }
 
-       bool HasNext(Block::Face face) {
+       bool HasNext(Block::Face face) noexcept {
                const BlockLookup next(chunk, pos, face);
                return next && !next.GetType().block_light;
        }
-       SetNode GetNext(Block::Face face) {
+       SetNode GetNext(Block::Face face) noexcept {
                const BlockLookup next(chunk, pos, face);
                return SetNode(&next.GetChunk(), next.GetBlockPos());
        }
@@ -79,18 +78,18 @@ struct UnsetNode
        : SetNode(set), level(Get()) { }
 
 
-       bool HasNext(Block::Face face) {
+       bool HasNext(Block::Face face) noexcept {
                const BlockLookup next(chunk, pos, face);
                return next;
        }
-       UnsetNode GetNext(Block::Face face) { return UnsetNode(SetNode::GetNext(face)); }
+       UnsetNode GetNext(Block::Face face) noexcept { return UnsetNode(SetNode::GetNext(face)); }
 
 };
 
 std::queue<SetNode> light_queue;
 std::queue<UnsetNode> dark_queue;
 
-void work_light() {
+void work_light() noexcept {
        while (!light_queue.empty()) {
                SetNode node = light_queue.front();
                light_queue.pop();
@@ -108,7 +107,7 @@ void work_light() {
        }
 }
 
-void work_dark() {
+void work_dark() noexcept {
        while (!dark_queue.empty()) {
                UnsetNode node = dark_queue.front();
                dark_queue.pop();
@@ -130,7 +129,7 @@ void work_dark() {
 
 }
 
-void Chunk::SetBlock(int index, const Block &block) {
+void Chunk::SetBlock(int index, const Block &block) noexcept {
        const BlockType &old_type = Type(blocks[index]);
        const BlockType &new_type = Type(block);
 
@@ -163,18 +162,9 @@ void Chunk::SetBlock(int index, const Block &block) {
                // obstacle removed
                int level = 0;
                for (int face = 0; face < Block::FACE_COUNT; ++face) {
-                       Pos next_pos(ToPos(index) + Block::FaceNormal(Block::Face(face)));
-                       int next_level = 0;
-                       if (InBounds(next_pos)) {
-                               next_level = GetLight(next_pos);
-                       } else {
-                               if (HasNeighbor(Block::Face(face))) {
-                                       next_pos -= (Block::FaceNormal(Block::Face(face)) * Chunk::Extent());
-                                       next_level = GetNeighbor(Block::Face(face)).GetLight(next_pos);
-                               }
-                       }
-                       if (level < next_level) {
-                               level = next_level;
+                       BlockLookup next_block(this, ToPos(index), Block::Face(face));
+                       if (next_block) {
+                               level = std::min(level, next_block.GetLight());
                        }
                }
                if (level > 1) {
@@ -185,18 +175,7 @@ void Chunk::SetBlock(int index, const Block &block) {
        }
 }
 
-const Block *Chunk::FindNext(const Pos &pos, Block::Face face) const {
-       Pos next_pos(pos + Block::FaceNormal(face));
-       if (InBounds(next_pos)) {
-               return &BlockAt(pos + Block::FaceNormal(face));
-       } else if (HasNeighbor(face)) {
-               return &GetNeighbor(face).BlockAt(next_pos - (Block::FaceNormal(face) * Extent()));
-       } else {
-               return nullptr;
-       }
-}
-
-void Chunk::SetNeighbor(Chunk &other) {
+void Chunk::SetNeighbor(Chunk &other) noexcept {
        if (other.position == position + Pos(-1, 0, 0)) {
                if (neighbor[Block::FACE_LEFT] != &other) {
                        neighbor[Block::FACE_LEFT] = &other;
@@ -308,67 +287,41 @@ void Chunk::SetNeighbor(Chunk &other) {
        }
 }
 
-void Chunk::ClearNeighbors() {
+void Chunk::ClearNeighbors() noexcept {
        for (int i = 0; i < Block::FACE_COUNT; ++i) {
                neighbor[i] = nullptr;
        }
 }
 
-void Chunk::Unlink() {
-       if (neighbor[Block::FACE_UP]) {
-               neighbor[Block::FACE_UP]->neighbor[Block::FACE_DOWN] = nullptr;
-       }
-       if (neighbor[Block::FACE_DOWN]) {
-               neighbor[Block::FACE_DOWN]->neighbor[Block::FACE_UP] = nullptr;
-       }
-       if (neighbor[Block::FACE_LEFT]) {
-               neighbor[Block::FACE_LEFT]->neighbor[Block::FACE_RIGHT] = nullptr;
-       }
-       if (neighbor[Block::FACE_RIGHT]) {
-               neighbor[Block::FACE_RIGHT]->neighbor[Block::FACE_LEFT] = nullptr;
-       }
-       if (neighbor[Block::FACE_FRONT]) {
-               neighbor[Block::FACE_FRONT]->neighbor[Block::FACE_BACK] = nullptr;
-       }
-       if (neighbor[Block::FACE_BACK]) {
-               neighbor[Block::FACE_BACK]->neighbor[Block::FACE_FRONT] = nullptr;
+void Chunk::Unlink() noexcept {
+       for (int face = 0; face < Block::FACE_COUNT; ++face) {
+               if (neighbor[face]) {
+                       neighbor[face]->neighbor[Block::Opposite(Block::Face(face))] = nullptr;
+               }
        }
 }
 
-void Chunk::Relink() {
-       if (neighbor[Block::FACE_UP]) {
-               neighbor[Block::FACE_UP]->neighbor[Block::FACE_DOWN] = this;
-       }
-       if (neighbor[Block::FACE_DOWN]) {
-               neighbor[Block::FACE_DOWN]->neighbor[Block::FACE_UP] = this;
-       }
-       if (neighbor[Block::FACE_LEFT]) {
-               neighbor[Block::FACE_LEFT]->neighbor[Block::FACE_RIGHT] = this;
-       }
-       if (neighbor[Block::FACE_RIGHT]) {
-               neighbor[Block::FACE_RIGHT]->neighbor[Block::FACE_LEFT] = this;
-       }
-       if (neighbor[Block::FACE_FRONT]) {
-               neighbor[Block::FACE_FRONT]->neighbor[Block::FACE_BACK] = this;
-       }
-       if (neighbor[Block::FACE_BACK]) {
-               neighbor[Block::FACE_BACK]->neighbor[Block::FACE_FRONT] = this;
+void Chunk::Relink() noexcept {
+       for (int face = 0; face < Block::FACE_COUNT; ++face) {
+               if (neighbor[face]) {
+                       neighbor[face]->neighbor[Block::Opposite(Block::Face(face))] = this;
+               }
        }
 }
 
 
-void Chunk::SetLight(int index, int level) {
+void Chunk::SetLight(int index, int level) noexcept {
        if (light[index] != level) {
                light[index] = level;
                Invalidate();
        }
 }
 
-int Chunk::GetLight(int index) const {
+int Chunk::GetLight(int index) const noexcept {
        return light[index];
 }
 
-float Chunk::GetVertexLight(int index, const BlockModel::Position &vtx, const BlockModel::Normal &norm) const {
+float Chunk::GetVertexLight(int index, const BlockModel::Position &vtx, const Model::Normal &norm) const noexcept {
        float light = GetLight(index);
        Chunk::Pos pos(ToPos(index));
 
@@ -395,14 +348,14 @@ float Chunk::GetVertexLight(int index, const BlockModel::Position &vtx, const Bl
 }
 
 
-bool Chunk::IsSurface(const Pos &pos) const {
+bool Chunk::IsSurface(const Pos &pos) const noexcept {
        const Block &block = BlockAt(pos);
        if (!Type(block).visible) {
                return false;
        }
        for (int face = 0; face < Block::FACE_COUNT; ++face) {
-               const Block *next = FindNext(pos, Block::Face(face));
-               if (!next || !Type(*next).visible) {
+               BlockLookup next = BlockLookup(const_cast<Chunk *>(this), pos, Block::Face(face));
+               if (!next || !next.GetType().visible) {
                        return true;
                }
        }
@@ -410,7 +363,7 @@ bool Chunk::IsSurface(const Pos &pos) const {
 }
 
 
-void Chunk::Draw() {
+void Chunk::Draw() noexcept {
        if (dirty) {
                Update();
        }
@@ -424,7 +377,7 @@ bool Chunk::Intersection(
        int &blkid,
        float &dist,
        glm::vec3 &normal
-) const {
+) const noexcept {
        // TODO: should be possible to heavily optimize this
        int id = 0;
        blkid = -1;
@@ -456,14 +409,6 @@ bool Chunk::Intersection(
        }
 }
 
-void Chunk::Position(const Pos &pos) {
-       position = pos;
-}
-
-glm::mat4 Chunk::Transform(const Pos &offset) const {
-       return glm::translate((position - offset) * Extent());
-}
-
 
 namespace {
 
@@ -471,13 +416,13 @@ BlockModel::Buffer buf;
 
 }
 
-void Chunk::CheckUpdate() {
+void Chunk::CheckUpdate() noexcept {
        if (dirty) {
                Update();
        }
 }
 
-void Chunk::Update() {
+void Chunk::Update() noexcept {
        int vtx_count = 0, idx_count = 0;
        for (const auto &block : blocks) {
                const Shape *shape = Type(block).shape;
@@ -491,14 +436,18 @@ void Chunk::Update() {
        for (size_t i = 0; i < Size(); ++i) {
                const BlockType &type = Type(blocks[i]);
 
-               if (!type.visible || Obstructed(i)) continue;
+               if (!type.visible || Obstructed(i).All()) continue;
 
                type.FillBlockModel(buf, ToTransform(i), vtx_counter);
                size_t vtx_begin = vtx_counter;
                vtx_counter += type.shape->VertexCount();
 
                for (size_t vtx = vtx_begin; vtx < vtx_counter; ++vtx) {
-                       buf.lights.emplace_back(GetVertexLight(i, buf.vertices[vtx], buf.normals[vtx]));
+                       buf.lights.emplace_back(GetVertexLight(
+                               i,
+                               buf.vertices[vtx],
+                               type.shape->VertexNormal(vtx - vtx_begin, blocks[i].Transform())
+                       ));
                }
        }
 
@@ -506,102 +455,27 @@ void Chunk::Update() {
        dirty = false;
 }
 
-bool Chunk::Obstructed(int idx) const {
+Block::FaceSet Chunk::Obstructed(int idx) const noexcept {
        Chunk::Pos pos(ToPos(idx));
+       Block::FaceSet result;
 
-       Chunk::Pos left_pos(pos + Chunk::Pos(-1, 0, 0));
-       const Block *left_block = nullptr;
-       if (InBounds(left_pos)) {
-               left_block = &BlockAt(left_pos);
-       } else if (HasNeighbor(Block::FACE_LEFT)) {
-               left_pos += Chunk::Pos(Width(), 0, 0);
-               left_block = &GetNeighbor(Block::FACE_LEFT).BlockAt(left_pos);
-       } else {
-               return false;
-       }
-       if (!Type(*left_block).FaceFilled(*left_block, Block::FACE_RIGHT)) {
-               return false;
-       }
-
-       Chunk::Pos right_pos(pos + Chunk::Pos(1, 0, 0));
-       const Block *right_block = nullptr;
-       if (InBounds(right_pos)) {
-               right_block = &BlockAt(right_pos);
-       } else if (HasNeighbor(Block::FACE_RIGHT)) {
-               right_pos += Chunk::Pos(-Width(), 0, 0);
-               right_block = &GetNeighbor(Block::FACE_RIGHT).BlockAt(right_pos);
-       } else {
-               return false;
-       }
-       if (!Type(*right_block).FaceFilled(*right_block, Block::FACE_LEFT)) {
-               return false;
-       }
-
-       Chunk::Pos down_pos(pos + Chunk::Pos(0, -1, 0));
-       const Block *down_block = nullptr;
-       if (InBounds(down_pos)) {
-               down_block = &BlockAt(down_pos);
-       } else if (HasNeighbor(Block::FACE_DOWN)) {
-               down_pos += Chunk::Pos(0, Height(), 0);
-               down_block = &GetNeighbor(Block::FACE_DOWN).BlockAt(down_pos);
-       } else {
-               return false;
-       }
-       if (!Type(*down_block).FaceFilled(*down_block, Block::FACE_UP)) {
-               return false;
-       }
-
-       Chunk::Pos up_pos(pos + Chunk::Pos(0, 1, 0));
-       const Block *up_block = nullptr;
-       if (InBounds(up_pos)) {
-               up_block = &BlockAt(up_pos);
-       } else if (HasNeighbor(Block::FACE_UP)) {
-               up_pos += Chunk::Pos(0, -Height(), 0);
-               up_block = &GetNeighbor(Block::FACE_UP).BlockAt(up_pos);
-       } else {
-               return false;
-       }
-       if (!Type(*up_block).FaceFilled(*up_block, Block::FACE_DOWN)) {
-               return false;
-       }
-
-       Chunk::Pos back_pos(pos + Chunk::Pos(0, 0, -1));
-       const Block *back_block = nullptr;
-       if (InBounds(back_pos)) {
-               back_block = &BlockAt(back_pos);
-       } else if (HasNeighbor(Block::FACE_BACK)) {
-               back_pos += Chunk::Pos(0, 0, Depth());
-               back_block = &GetNeighbor(Block::FACE_BACK).BlockAt(back_pos);
-       } else {
-               return false;
-       }
-       if (!Type(*back_block).FaceFilled(*back_block, Block::FACE_FRONT)) {
-               return false;
-       }
-
-       Chunk::Pos front_pos(pos + Chunk::Pos(0, 0, 1));
-       const Block *front_block = nullptr;
-       if (InBounds(front_pos)) {
-               front_block = &BlockAt(front_pos);
-       } else if (HasNeighbor(Block::FACE_FRONT)) {
-               front_pos += Chunk::Pos(0, 0, -Depth());
-               front_block = &GetNeighbor(Block::FACE_FRONT).BlockAt(front_pos);
-       } else {
-               return false;
-       }
-       if (!Type(*front_block).FaceFilled(*front_block, Block::FACE_BACK)) {
-               return false;
+       for (int f = 0; f < Block::FACE_COUNT; ++f) {
+               Block::Face face = Block::Face(f);
+               BlockLookup next(const_cast<Chunk *>(this), pos, face);
+               if (next && next.GetType().FaceFilled(next.GetBlock(), Block::Opposite(face))) {
+                       result.Set(face);
+               }
        }
 
-       return true;
+       return result;
 }
 
-glm::mat4 Chunk::ToTransform(int idx) const {
-       return glm::translate(glm::mat4(1.0f), ToCoords(idx)) * blocks[idx].Transform();
+glm::mat4 Chunk::ToTransform(int idx) const noexcept {
+       return glm::translate(ToCoords(idx)) * blocks[idx].Transform();
 }
 
 
-BlockLookup::BlockLookup(Chunk *c, const Chunk::Pos &p)
+BlockLookup::BlockLookup(Chunk *c, const Chunk::Pos &p) noexcept
 : chunk(c), pos(p) {
        while (pos.x >= Chunk::Width()) {
                if (chunk->HasNeighbor(Block::FACE_RIGHT)) {
@@ -659,7 +533,7 @@ BlockLookup::BlockLookup(Chunk *c, const Chunk::Pos &p)
        }
 }
 
-BlockLookup::BlockLookup(Chunk *c, const Chunk::Pos &p, Block::Face face)
+BlockLookup::BlockLookup(Chunk *c, const Chunk::Pos &p, Block::Face face) noexcept
 : chunk(c), pos(p) {
        pos += Block::FaceNormal(face);
        if (!Chunk::InBounds(pos)) {
@@ -669,7 +543,7 @@ BlockLookup::BlockLookup(Chunk *c, const Chunk::Pos &p, Block::Face face)
 }
 
 
-ChunkLoader::ChunkLoader(const Config &config, const BlockTypeRegistry &reg, const Generator &gen)
+ChunkLoader::ChunkLoader(const Config &config, const BlockTypeRegistry &reg, const Generator &gen) noexcept
 : base(0, 0, 0)
 , reg(reg)
 , gen(gen)
@@ -685,10 +559,10 @@ namespace {
 
 struct ChunkLess {
 
-       explicit ChunkLess(const Chunk::Pos &base)
+       explicit ChunkLess(const Chunk::Pos &base) noexcept
        : base(base) { }
 
-       bool operator ()(const Chunk::Pos &a, const Chunk::Pos &b) const {
+       bool operator ()(const Chunk::Pos &a, const Chunk::Pos &b) const noexcept {
                Chunk::Pos da(base - a);
                Chunk::Pos db(base - b);
                return
@@ -774,17 +648,17 @@ Chunk &ChunkLoader::Generate(const Chunk::Pos &pos) {
        return chunk;
 }
 
-void ChunkLoader::Insert(Chunk &chunk) {
+void ChunkLoader::Insert(Chunk &chunk) noexcept {
        for (Chunk &other : loaded) {
                chunk.SetNeighbor(other);
        }
 }
 
-void ChunkLoader::Remove(Chunk &chunk) {
+void ChunkLoader::Remove(Chunk &chunk) noexcept {
        chunk.Unlink();
 }
 
-Chunk *ChunkLoader::Loaded(const Chunk::Pos &pos) {
+Chunk *ChunkLoader::Loaded(const Chunk::Pos &pos) noexcept {
        for (Chunk &chunk : loaded) {
                if (chunk.Position() == pos) {
                        return &chunk;
@@ -793,7 +667,7 @@ Chunk *ChunkLoader::Loaded(const Chunk::Pos &pos) {
        return nullptr;
 }
 
-bool ChunkLoader::Queued(const Chunk::Pos &pos) {
+bool ChunkLoader::Queued(const Chunk::Pos &pos) noexcept {
        for (const Chunk::Pos &chunk : to_generate) {
                if (chunk == pos) {
                        return true;
@@ -802,7 +676,7 @@ bool ChunkLoader::Queued(const Chunk::Pos &pos) {
        return nullptr;
 }
 
-bool ChunkLoader::Known(const Chunk::Pos &pos) {
+bool ChunkLoader::Known(const Chunk::Pos &pos) noexcept {
        if (Loaded(pos)) return true;
        return Queued(pos);
 }