]> git.localhorst.tv Git - blank.git/blob - src/world.cpp
aa65bef7a3aa6cb88ae94d6dac2173f1a9b202b6
[blank.git] / src / world.cpp
1 #include "world.hpp"
2
3 #include <limits>
4 #include <glm/gtx/transform.hpp>
5
6
7 namespace blank {
8
9 const BlockType BlockType::DEFAULT;
10 const NullShape BlockType::DEFAULT_SHAPE;
11
12 void BlockType::FillVBO(
13         const glm::vec3 &pos,
14         std::vector<glm::vec3> &vertices,
15         std::vector<glm::vec3> &colors,
16         std::vector<glm::vec3> &normals
17 ) const {
18         shape->Vertices(vertices, pos);
19         colors.insert(colors.end(), shape->VertexCount(), color);
20         shape->Normals(normals);
21 }
22
23 void BlockType::FillOutlineVBO(
24         std::vector<glm::vec3> &vertices,
25         std::vector<glm::vec3> &colors
26 ) const {
27         shape->Outline(vertices);
28         colors.insert(colors.end(), shape->OutlineCount(), outline_color);
29 }
30
31
32 BlockTypeRegistry::BlockTypeRegistry() {
33         Add(BlockType::DEFAULT);
34 }
35
36 int BlockTypeRegistry::Add(const BlockType &t) {
37         int id = types.size();
38         types.push_back(t);
39         types.back().id = id;
40         return id;
41 }
42
43
44 Chunk::Chunk()
45 : blocks(Size())
46 , model()
47 , transform(1.0f)
48 , dirty(false) {
49
50 }
51
52 Chunk::Chunk(Chunk &&other)
53 : blocks(std::move(other.blocks))
54 , model(std::move(other.model))
55 , transform(other.transform)
56 , dirty(other.dirty) {
57
58 }
59
60 Chunk &Chunk::operator =(Chunk &&other) {
61         blocks = std::move(other.blocks);
62         model = std::move(other.model);
63         transform = other.transform;
64         dirty = other.dirty;
65         return *this;
66 }
67
68
69 void Chunk::Draw() {
70         if (dirty) {
71                 Update();
72         }
73         model.Draw();
74 }
75
76
77 bool Chunk::Intersection(
78         const Ray &ray,
79         const glm::mat4 &M,
80         int *blkid,
81         float *dist,
82         glm::vec3 *normal) const {
83         { // rough check
84                 const AABB bb{{0, 0, 0}, {Width(), Height(), Depth()}};
85                 if (!blank::Intersection(ray, bb, M)) {
86                         return false;
87                 }
88         }
89
90         if (!blkid && !dist && !normal) {
91                 return true;
92         }
93
94         // TODO: should be possible to heavily optimize this
95         int id = 0;
96         int closest_id = -1;
97         float closest_dist = std::numeric_limits<float>::infinity();
98         glm::vec3 closest_normal(0, 1, 0);
99         for (int z = 0; z < Depth(); ++z) {
100                 for (int y = 0; y < Height(); ++y) {
101                         for (int x = 0; x < Width(); ++x, ++id) {
102                                 if (!blocks[id].type->visible) {
103                                         continue;
104                                 }
105                                 float cur_dist;
106                                 glm::vec3 cur_norm;
107                                 glm::vec3 pos(float(x) + 0.5f, float(y) + 0.5f, float(z) + 0.5f);
108                                 if (blocks[id].type->shape->Intersects(ray, glm::translate(M, pos), cur_dist, cur_norm)) {
109                                         if (cur_dist < closest_dist) {
110                                                 closest_id = id;
111                                                 closest_dist = cur_dist;
112                                                 closest_normal = cur_norm;
113                                         }
114                                 }
115                         }
116                 }
117         }
118
119         if (closest_id < 0) {
120                 return false;
121         }
122
123         if (blkid) {
124                 *blkid = closest_id;
125         }
126         if (dist) {
127                 *dist = closest_dist;
128         }
129         if (normal) {
130                 *normal = closest_normal;
131         }
132         return true;
133 }
134
135 void Chunk::Position(const glm::vec3 &pos) {
136         position = pos;
137         transform = glm::translate(pos * Extent());
138 }
139
140
141 int Chunk::VertexCount() const {
142         int count = 0;
143         for (const auto &block : blocks) {
144                 count += block.type->shape->VertexCount();
145         }
146         return count;
147 }
148
149 void Chunk::Update() {
150         model.Clear();
151         model.Reserve(VertexCount());
152
153         for (size_t i = 0; i < Size(); ++i) {
154                 blocks[i].type->FillModel(ToCoords(i), model);
155         }
156
157         model.Invalidate();
158         dirty = false;
159 }
160
161
162 World::World()
163 : blockType()
164 , blockShape({{ -0.5f, -0.5f, -0.5f }, { 0.5f, 0.5f, 0.5f }})
165 , stairShape({{ -0.5f, -0.5f, -0.5f }, { 0.5f, 0.5f, 0.5f }}, { 0.0f, 0.0f })
166 , slabShape({{ -0.5f, -0.5f, -0.5f }, { 0.5f, 0.0f, 0.5f }})
167 , chunks() {
168         blockType.Add(BlockType{ true, { 1.0f, 1.0f, 1.0f }, &blockShape }); // white block
169         blockType.Add(BlockType{ true, { 1.0f, 1.0f, 1.0f }, &stairShape }); // white stair
170         blockType.Add(BlockType{ true, { 1.0f, 1.0f, 1.0f }, &slabShape }); // white slab
171         blockType.Add(BlockType{ true, { 1.0f, 0.0f, 0.0f }, &blockShape }); // red block
172         blockType.Add(BlockType{ true, { 1.0f, 0.0f, 0.0f }, &stairShape }); // red stair
173         blockType.Add(BlockType{ true, { 1.0f, 0.0f, 0.0f }, &slabShape }); // red slab
174         blockType.Add(BlockType{ true, { 0.0f, 1.0f, 0.0f }, &blockShape }); // green block
175         blockType.Add(BlockType{ true, { 0.0f, 1.0f, 0.0f }, &stairShape }); // green stair
176         blockType.Add(BlockType{ true, { 0.0f, 1.0f, 0.0f }, &slabShape }); // green slab
177         blockType.Add(BlockType{ true, { 0.0f, 0.0f, 1.0f }, &blockShape }); // blue block
178         blockType.Add(BlockType{ true, { 0.0f, 0.0f, 1.0f }, &stairShape }); // blue stair
179         blockType.Add(BlockType{ true, { 0.0f, 0.0f, 1.0f }, &slabShape }); // blue slab
180 }
181
182
183 void World::Generate() {
184         for (int z = -1; z < 2; ++z) {
185                 for (int y = -1; y < 2; ++y) {
186                         for (int x = -1; x < 2; ++x) {
187                                 Generate(glm::vec3(x, y, z));
188                         }
189                 }
190         }
191 }
192
193 Chunk &World::Generate(const glm::vec3 &pos) {
194         chunks.emplace_back();
195         Chunk &chunk = chunks.back();
196         chunk.Position(pos);
197         for (size_t i = 1; i < blockType.Size(); ++i) {
198                 chunk.BlockAt(i) = Block(blockType[i]);
199                 chunk.BlockAt(i + 257) = Block(blockType[i]);
200                 chunk.BlockAt(i + 514) = Block(blockType[i]);
201         }
202         if (false) {
203                 chunk.BlockAt(glm::vec3(0, 0, 0)) = Block(blockType[4]);
204                 chunk.BlockAt(glm::vec3(0, 0, 1)) = Block(blockType[1]);
205                 chunk.BlockAt(glm::vec3(1, 0, 0)) = Block(blockType[5]);
206                 chunk.BlockAt(glm::vec3(1, 0, 1)) = Block(blockType[3]);
207                 chunk.BlockAt(glm::vec3(2, 0, 0)) = Block(blockType[4]);
208                 chunk.BlockAt(glm::vec3(2, 0, 1)) = Block(blockType[1]);
209                 chunk.BlockAt(glm::vec3(3, 0, 0)) = Block(blockType[2]);
210                 chunk.BlockAt(glm::vec3(3, 0, 1)) = Block(blockType[5]);
211                 chunk.BlockAt(glm::vec3(2, 0, 2)) = Block(blockType[4]);
212                 chunk.BlockAt(glm::vec3(2, 0, 3)) = Block(blockType[1]);
213                 chunk.BlockAt(glm::vec3(3, 0, 2)) = Block(blockType[2]);
214                 chunk.BlockAt(glm::vec3(3, 0, 3)) = Block(blockType[5]);
215                 chunk.BlockAt(glm::vec3(1, 1, 0)) = Block(blockType[5]);
216                 chunk.BlockAt(glm::vec3(1, 1, 1)) = Block(blockType[4]);
217                 chunk.BlockAt(glm::vec3(2, 1, 1)) = Block(blockType[3]);
218                 chunk.BlockAt(glm::vec3(2, 2, 1)) = Block(blockType[2]);
219         }
220         chunk.Invalidate();
221         return chunk;
222 }
223
224 bool World::Intersection(
225                 const Ray &ray,
226                 const glm::mat4 &M,
227                 Chunk **chunk,
228                 int *blkid,
229                 float *dist,
230                 glm::vec3 *normal) {
231         Chunk *closest_chunk = nullptr;
232         int closest_blkid = -1;
233         float closest_dist = std::numeric_limits<float>::infinity();
234         glm::vec3 closest_normal;
235
236         for (Chunk &cur_chunk : chunks) {
237                 int cur_blkid;
238                 float cur_dist;
239                 glm::vec3 cur_normal;
240                 if (cur_chunk.Intersection(ray, M * cur_chunk.Transform(), &cur_blkid, &cur_dist, &cur_normal)) {
241                         if (cur_dist < closest_dist) {
242                                 closest_chunk = &cur_chunk;
243                                 closest_blkid = cur_blkid;
244                                 closest_dist = cur_dist;
245                                 closest_normal = cur_normal;
246                         }
247                 }
248         }
249
250         if (chunk) {
251                 *chunk = closest_chunk;
252         }
253         if (blkid) {
254                 *blkid = closest_blkid;
255         }
256         if (dist) {
257                 *dist = closest_dist;
258         }
259         if (normal) {
260                 *normal = closest_normal;
261         }
262         return closest_chunk;
263 }
264
265
266 Chunk &World::Next(const Chunk &to, const glm::vec3 &dir) {
267         const glm::vec3 tgt_pos = to.Position() + dir;
268         for (Chunk &chunk : chunks) {
269                 if (chunk.Position() == tgt_pos) {
270                         return chunk;
271                 }
272         }
273         return Generate(tgt_pos);
274 }
275
276 }