#include #include #include #include #include #include #include #include #include #include namespace Cubed { Chunk::Chunk(World& world, ChunkPos chunk_pos) : m_chunk_pos(chunk_pos), m_world(world) { } Chunk::~Chunk() { if (m_vbo != 0) { m_world.push_delete_vbo(m_vbo); } } Chunk::Chunk(Chunk&& other) noexcept : m_dirty(other.is_dirty()), m_need_upload(other.m_need_upload.load()), m_is_on_gen_vertex_data(other.m_is_on_gen_vertex_data.load()), m_vertex_sum(other.m_vertex_sum.load()), m_biome(other.m_biome.load()), m_chunk_pos(std::move(other.m_chunk_pos)), m_world(other.m_world), m_heightmap(std::move(other.m_heightmap)), m_blocks(std::move(other.m_blocks)), m_vbo(other.m_vbo), m_vertexs_data(std::move(other.m_vertexs_data)) { other.m_vbo = 0; } Chunk& Chunk::operator=(Chunk&& other) noexcept { //Logger::info("other Chunk pos {} {} in Chunk& Chunk::operator=(Chunk&& other) this {}", other.m_chunk_pos.x, other.m_chunk_pos.z, static_cast(&other)); m_vbo = other.m_vbo; other.m_vbo = 0; m_chunk_pos = std::move(other.m_chunk_pos); m_heightmap = std::move(other.m_heightmap); m_blocks = std::move(other.m_blocks); m_dirty = other.is_dirty(); m_vertexs_data = std::move(other.m_vertexs_data); m_biome = other.m_biome.load(); m_is_on_gen_vertex_data = other.m_is_on_gen_vertex_data.load(); m_need_upload = other.m_need_upload.load(); m_vertex_sum = other.m_vertex_sum.load(); return *this; } Biome Chunk::get_biome() const { return m_biome.load(); } const std::vector& Chunk::get_chunk_blocks() const{ return m_blocks; } HeightMapArray Chunk::get_heightmap() const { //Logger::info("Chunk pos {} {} in get_heightmap this {}", m_chunk_pos.x, m_chunk_pos.z, static_cast(this)); return m_heightmap; } int Chunk::get_index(int x, int y, int z) { ASSERT(!(x < 0 || y < 0 || z < 0 || x >= CHUCK_SIZE || y >= WORLD_SIZE_Y || z >= CHUCK_SIZE)); if ((x * WORLD_SIZE_Y + y) * CHUCK_SIZE + z < 0 || (x * WORLD_SIZE_Y + y) * CHUCK_SIZE + z >= CHUCK_SIZE * CHUCK_SIZE * WORLD_SIZE_Y) { Logger::error("block pos x {} y {} z {} range error", x, y, z); ASSERT(0); } return (x * WORLD_SIZE_Y + y) * CHUCK_SIZE + z; } int Chunk::get_index(const glm::vec3& pos) { return Chunk::get_index(pos.x, pos.y, pos.z); } void Chunk::gen_vertex_data(const std::array*, 4>& neighbor_block) { if (m_is_on_gen_vertex_data) { return; } m_is_on_gen_vertex_data = true; std::lock_guard lk(m_vertexs_data_mutex); m_vertexs_data.clear(); static const glm::ivec3 DIR[6] = { {0,0,1},{1,0,0},{0,0,-1},{-1,0,0},{0,1,0},{0,-1,0} }; for (int x = 0; x < SIZE_X; x++) { for (int y = 0; y < SIZE_Y; y++) { for (int z = 0; z < SIZE_Z; z++) { int world_x = x + m_chunk_pos.x * CHUCK_SIZE; int world_z = z + m_chunk_pos.z * CHUCK_SIZE; int world_y = y; int cur_id = m_blocks[get_index(x, y, z)]; // air if (cur_id == 0) { continue; } for (int face = 0; face < 6; face++) { int nx = x + DIR[face].x; int ny = y + DIR[face].y; int nz = z + DIR[face].z; bool neighbor_cull = false; if (nx < 0 || nx >= SIZE_X || ny < 0 || ny >= SIZE_Y || nz < 0 || nz>= SIZE_Z) { int world_nx = world_x + DIR[face].x; int world_ny = world_y + DIR[face].y; int world_nz = world_z + DIR[face].z; auto [neighbor_x, neighbor_z] = World::chunk_pos(world_nx, world_nz); auto is_cull = [&](const std::vector* chunk_blocks){ if (chunk_blocks == nullptr) { return false; } int x, y, z; y = world_ny; x = world_nx - neighbor_x * CHUCK_SIZE; z = world_nz - neighbor_z * CHUCK_SIZE; if (x < 0 || y < 0 || z < 0 || x >= CHUCK_SIZE || y >= WORLD_SIZE_Y || z >= CHUCK_SIZE) { return false; } int idx = Chunk::get_index(x, y, z); // not init if (static_cast(idx) >= chunk_blocks->size()) { Logger::warn("not init"); return false; } auto id = (*chunk_blocks)[idx]; if (is_in_transparent_map(id)) { if (id == cur_id) { return true; } else { return false; } } else { return true; } }; if (m_chunk_pos.x + 1 == neighbor_x) { neighbor_cull = is_cull(neighbor_block[0]); } else if (m_chunk_pos.x - 1 == neighbor_x) { neighbor_cull = is_cull(neighbor_block[1]); } else if (m_chunk_pos.z + 1 == neighbor_z) { neighbor_cull = is_cull(neighbor_block[2]); } else if (m_chunk_pos.z - 1 == neighbor_z) { neighbor_cull = is_cull(neighbor_block[3]); } //neighbor_cull = m_world.is_block(glm::ivec3(world_x, world_y, world_z) + DIR[face]); } else { auto id = m_blocks[get_index(nx, ny, nz)]; if (!is_in_transparent_map(id)) { neighbor_cull = true; } else { if (id == cur_id) { neighbor_cull = true; } else { neighbor_cull = false; } } } if (neighbor_cull) { continue; } for (int i = 0; i < 6; i++) { Vertex vex = { VERTICES_POS[face][i][0] + (float)world_x * 1.0f, VERTICES_POS[face][i][1] + (float)world_y * 1.0f, VERTICES_POS[face][i][2] + (float)world_z * 1.0f, TEX_COORDS[face][i][0], TEX_COORDS[face][i][1], static_cast(cur_id * 6 + face) }; m_vertexs_data.emplace_back(vex); } } } } } m_vertex_sum = m_vertexs_data.size(); m_need_upload = true; m_is_on_gen_vertex_data = false; } GLuint Chunk::get_vbo() const{ return m_vbo; } size_t Chunk::get_vertex_sum() const { if (m_vertex_sum == 0) { Logger::warn("m_vertex_sum is 0"); } return m_vertex_sum.load(); } void Chunk::init_chunk() { resolve_biome(); resolve_blocks(); } void Chunk::gen_phase_one() { resolve_biome(); } void Chunk::gen_phase_two(const std::array& adj_chunks) { for (auto& chunk : adj_chunks) { if (chunk == nullptr) { continue; } Biome biome = chunk->get_biome(); for (const auto& non : NON_ADJACENT) { if (m_biome != non.first) { continue; } for (auto b : non.second) { if (b == biome) { m_biome = non.replace; return; } } } } } void Chunk::gen_phase_three() { for (int x = 0; x < CHUCK_SIZE; x++) { for (int z = 0; z < CHUCK_SIZE; z++) { float world_x = static_cast(x + m_chunk_pos.x * CHUCK_SIZE); float world_z = static_cast(z + m_chunk_pos.z * CHUCK_SIZE); auto sample_height = [&](Biome b) -> float { auto range = get_biome_height_range(b); auto [f1, f2, f3] = get_noise_frequencies_for_biome(b); float n = 1.00f * PerlinNoise::noise(world_x * f1, 0.5f, world_z * f1) + 0.50f * PerlinNoise::noise(world_x * f2, 0.5f, world_z * f2) + 0.25f * PerlinNoise::noise(world_x * f3, 0.5f, world_z * f3); n /= 1.75f; return range.base_y + n * range.amplitude; }; m_heightmap[x][z] = sample_height(m_biome); } } } void Chunk::gen_phase_four(const std::array, 4>& neighbor_heightmap) { // Width of interpolation influence (in number of cells) constexpr int BLEND_RADIUS = 8; for (int x = 0; x < SIZE_X; x++) { for (int z = 0; z < SIZE_Z; z++) { float h = static_cast(m_heightmap[x][z]); float total_weight = 1.0f; float blended = h; // --- Right neighbor neighbor[0]: (1, 0) --- // Blend when x is close to SIZE_X-1 if (neighbor_heightmap[0] != std::nullopt) { int dist = (SIZE_X - 1) - x; // distance from right border if (dist < BLEND_RADIUS) { // Neighbor's boundary row is its x=0 column float neighbor_h = static_cast((*neighbor_heightmap[0])[0][z]); float t = 1.0f - static_cast(dist) / BLEND_RADIUS; // larger weight when closer // Use smoothstep for a more natural transition t = t * t * (3.0f - 2.0f * t); blended += t * neighbor_h; total_weight += t; } } // --- Left neighbor neighbor[1]: (-1, 0) --- if (neighbor_heightmap[1] != std::nullopt) { int dist = x; // distance from left border if (dist < BLEND_RADIUS) { float neighbor_h = static_cast((*neighbor_heightmap[1])[SIZE_X - 1][z]); float t = 1.0f - static_cast(dist) / BLEND_RADIUS; t = t * t * (3.0f - 2.0f * t); blended += t * neighbor_h; total_weight += t; } } // --- Front neighbor neighbor[2]: (0, 1) --- if (neighbor_heightmap[2] != std::nullopt) { int dist = (SIZE_Z - 1) - z; if (dist < BLEND_RADIUS) { float neighbor_h = static_cast((*neighbor_heightmap[2])[x][0]); float t = 1.0f - static_cast(dist) / BLEND_RADIUS; t = t * t * (3.0f - 2.0f * t); blended += t * neighbor_h; total_weight += t; } } // --- Back neighbor neighbor[3]: (0, -1) --- if (neighbor_heightmap[3] != std::nullopt) { int dist = z; if (dist < BLEND_RADIUS) { float neighbor_h = static_cast((*neighbor_heightmap[3])[x][SIZE_Z - 1]); float t = 1.0f - static_cast(dist) / BLEND_RADIUS; t = t * t * (3.0f - 2.0f * t); blended += t * neighbor_h; total_weight += t; } } m_heightmap[x][z] = static_cast(blended / total_weight); } } } void Chunk::gen_phase_five() { // bottom m_blocks.assign(CHUCK_SIZE * CHUCK_SIZE * WORLD_SIZE_Y, 0); for (int x = 0; x < CHUCK_SIZE; x++) { for (int y = 0; y < 5; y++) { for (int z = 0; z < CHUCK_SIZE; z++) { m_blocks[get_index(x, y, z)] = 3; } } } for (int x = 0; x < CHUCK_SIZE; x++) { for (int z = 0; z < CHUCK_SIZE; z++) { int height = static_cast(m_heightmap[x][z]); for (int y = 5; y < height - 5; y++) { m_blocks[get_index(x, y, z)] = 3; } if (m_biome == Biome::MOUNTAIN) { for (int y = height - 5; y <= height - 1; y++) { if (y > 110) { m_blocks[get_index(x, y, z)] = 3; } else { m_blocks[get_index(x, y, z)] = 2; } } if (height > 110) { m_blocks[get_index(x, height - 1, z)] = 3; } else { m_blocks[get_index(x, height - 1, z)] = 1; } } else if (m_biome == Biome::DESERT) { for (int y = height - 5; y <= height; y++) { m_blocks[get_index(x, y, z)] = 4; } } else { for (int y = height - 5; y <= height - 1; y++) { m_blocks[get_index(x, y, z)] = 2; } for (int y = height; y <= height; y++) { m_blocks[get_index(x, y, z)] = 1; } } } } } void Chunk::gen_phase_six() { if (m_biome == Biome::FOREST) { std::array x_arr; std::iota(x_arr.begin(), x_arr.end(), 0); std::shuffle(x_arr.begin(), x_arr.end(), Cubed::Random::get().engine()); std::array z_arr; std::iota(z_arr.begin(), z_arr.end(), 0); std::shuffle(z_arr.begin(), z_arr.end(), Cubed::Random::get().engine()); for (auto x : x_arr) { for (auto z : z_arr) { if (Cubed::Random::get().random_bool(0.1)) { build_tree(*this, {x, static_cast(m_heightmap[x][z]), z}); } } } } mark_dirty(); } void Chunk::upload_to_gpu() { ASSERT(is_need_upload()); if (m_vbo == 0) { glGenBuffers(1, &m_vbo); } std::lock_guard lk(m_vertexs_data_mutex); glBindBuffer(GL_ARRAY_BUFFER, m_vbo); glBufferData(GL_ARRAY_BUFFER, m_vertexs_data.size() * sizeof(Vertex), m_vertexs_data.data(), GL_DYNAMIC_DRAW); glBindBuffer(GL_ARRAY_BUFFER, 0); // after fininshed it, can use clear_dirty(); m_need_upload = false; } bool Chunk::is_dirty() const{ return m_dirty.load(); } void Chunk::mark_dirty() { m_dirty = true; } void Chunk::clear_dirty() { m_dirty = false; } bool Chunk::is_need_upload() const { return m_need_upload.load(); } void Chunk::need_upload() { m_need_upload = true; } void Chunk::set_chunk_block(int index ,unsigned id) { m_blocks[index] = id; mark_dirty(); } void Chunk::resolve_biome() { float cx = (m_chunk_pos.x + 0.5f) * CHUCK_SIZE; float cz = (m_chunk_pos.z + 0.5f) * CHUCK_SIZE; float temp = PerlinNoise::noise(cx * BIOME_NOISE_FREQUENCY, 0.0f, cz * BIOME_NOISE_FREQUENCY); float humid = PerlinNoise::noise(cx * BIOME_NOISE_FREQUENCY, 1.0f, cz * BIOME_NOISE_FREQUENCY); m_biome = get_biome_from_noise(temp, humid); } void Chunk::resolve_blocks() { m_blocks.assign(CHUCK_SIZE * CHUCK_SIZE * WORLD_SIZE_Y, 0); for (int x = 0; x < CHUCK_SIZE; x++) { for (int y = 0; y < 5; y++) { for (int z = 0; z < CHUCK_SIZE; z++) { m_blocks[get_index(x, y, z)] = 3; } } } std::array, SIZE_X> heights; for (int x = 0; x < CHUCK_SIZE; x++) { for (int z = 0; z < CHUCK_SIZE; z++) { float world_x = static_cast(x + m_chunk_pos.x * CHUCK_SIZE); float world_z = static_cast(z + m_chunk_pos.z * CHUCK_SIZE); float temp = PerlinNoise::noise(world_x * BIOME_NOISE_FREQUENCY, 0.0f, world_z * BIOME_NOISE_FREQUENCY); float humid = PerlinNoise::noise(world_x * BIOME_NOISE_FREQUENCY, 1.0f, world_z * BIOME_NOISE_FREQUENCY); int height = get_interpolated_height(world_x, world_z, temp, humid); auto biome = get_biome_from_noise(temp, humid); if (height >= SIZE_Y) { Logger::warn("height: {} is exceed max_height", height); height = SIZE_Y - 1; } heights[x][z] = height; for (int y = 5; y < height - 5; y++) { m_blocks[get_index(x, y, z)] = 3; } if (biome == Biome::MOUNTAIN) { for (int y = height - 5; y <= height - 1; y++) { if (y > 101) { m_blocks[get_index(x, y, z)] = 3; } else { m_blocks[get_index(x, y, z)] = 2; } } if (height > 101) { m_blocks[get_index(x, height - 1, z)] = 3; } else { m_blocks[get_index(x, height - 1, z)] = 1; } } else if (biome == Biome::DESERT) { for (int y = height - 5; y <= height; y++) { m_blocks[get_index(x, y, z)] = 4; } } else { for (int y = height - 5; y <= height - 1; y++) { m_blocks[get_index(x, y, z)] = 2; } for (int y = height; y <= height; y++) { m_blocks[get_index(x, y, z)] = 1; } } } } if (m_biome == Biome::FOREST) { std::array x_arr; std::iota(x_arr.begin(), x_arr.end(), 0); std::shuffle(x_arr.begin(), x_arr.end(), Cubed::Random::get().engine()); std::array z_arr; std::iota(z_arr.begin(), z_arr.end(), 0); std::shuffle(z_arr.begin(), z_arr.end(), Cubed::Random::get().engine()); for (auto x : x_arr) { for (auto z : z_arr) { if (Cubed::Random::get().random_bool(0.8)) { build_tree(*this, {x, heights[x][z], z}); } } } } mark_dirty(); } }