253 lines
No EOL
6.4 KiB
C
253 lines
No EOL
6.4 KiB
C
// the messiest part of this whole codebase
|
|
|
|
#include "cubes.h"
|
|
#include "gen.h"
|
|
#include <pthread.h>
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
|
|
struct args {
|
|
struct v3f *cube;
|
|
struct v3f *text;
|
|
struct v3i pos;
|
|
int a;
|
|
int i;
|
|
int a3;
|
|
int *i2;
|
|
};
|
|
|
|
int ox = -1024;
|
|
int oy = -1024;
|
|
int oz = -1024;
|
|
|
|
struct chunk *chunk_old = NULL;
|
|
|
|
void gen_face(struct v3f *cube, int i, int x, int y, int z, int x2, int y2,
|
|
int z2, int *j, int is_text, struct chunk dat, int ci, int a3) {
|
|
struct v3i a = {{x, y, z}};
|
|
struct v3f a2 = {{x, y, z}};
|
|
|
|
if (is_text) {
|
|
a.pos[i]--;
|
|
int exists = 0;
|
|
int type = cube_exists(x, y, z, dat, ci);
|
|
int typeB = cube_exists(a.pos[0], a.pos[1], a.pos[2], dat, ci);
|
|
exists = ((!!type) != (!!typeB));
|
|
|
|
a2.pos[0] = exists ? TEXT_GAP_H * (type ? (type - 1) : (typeB - 1)) : -1.0;
|
|
a2.pos[1] = exists ? TEXT_GAP_V * (i + (!!type) * 3) : -1.0;
|
|
a2.pos[2] = 0;
|
|
if (!exists) {
|
|
*j = (*j - 6 * a3);
|
|
return;
|
|
}
|
|
}
|
|
|
|
struct v3f b = a2;
|
|
struct v3f c = a2;
|
|
struct v3f d = a2;
|
|
|
|
if (is_text) {
|
|
b.pos[0] += TEXT_GAP_H;
|
|
c.pos[1] += TEXT_GAP_V;
|
|
d.pos[0] += TEXT_GAP_H;
|
|
d.pos[1] += TEXT_GAP_V;
|
|
} else {
|
|
b.pos[(i == 0) ? 1 : 0]++;
|
|
c.pos[(i == 2) ? 1 : 2]++;
|
|
d.pos[(i == 0) ? 1 : 0]++;
|
|
d.pos[(i == 2) ? 1 : 2]++;
|
|
}
|
|
|
|
cube[*j] = a2;
|
|
cube[*j + 1] = b;
|
|
cube[*j + 2] = c;
|
|
cube[*j + 3] = c;
|
|
cube[*j + 4] = b;
|
|
cube[*j + 5] = d;
|
|
}
|
|
|
|
void *gen_chunk(void *args) {
|
|
|
|
struct args args2 = ((struct args *)args)[0];
|
|
|
|
int i = args2.i;
|
|
int a3 = args2.a3;
|
|
int a2 = args2.a;
|
|
int a = a2 % a3;
|
|
int *i2 = args2.i2;
|
|
|
|
int x2 = args2.pos.pos[0];
|
|
int y2 = args2.pos.pos[1];
|
|
int z2 = args2.pos.pos[2];
|
|
|
|
struct v3f *cube = args2.cube;
|
|
struct v3f *text = args2.text;
|
|
|
|
struct v3f vNul = {{-10.0, -10.0, -10.0}};
|
|
if (x2 < 0 || y2 < 0 || z2 < 0) {
|
|
for (int a = i; a < args2.i + (BLOCK_ALL * 18) * a3; a += 6 * a3) {
|
|
cube[a] = vNul;
|
|
text[a] = vNul;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
// int is_text = args2.is_text;
|
|
|
|
int the_j = a2;
|
|
|
|
struct chunk chunk = fetch_chunk(x2 / CHUNK_LENGTH, y2 / CHUNK_LENGTH,
|
|
z2 / CHUNK_LENGTH, a, 0);
|
|
|
|
if (chunk.exists != 0 && the_j > -1)
|
|
chunk_old[the_j] = chunk;
|
|
|
|
printf("Loading world... (%i / %i)\n", a2, CHUNK_ALL);
|
|
|
|
if (i > CBLOCK_ALL * 18)
|
|
return (void *)i;
|
|
for (int y4 = 0; y4 < CHUNK_LENGTH; y4++) {
|
|
|
|
for (int x4 = 0; x4 < CHUNK_LENGTH; x4++) {
|
|
|
|
for (int z4 = 0; z4 < CHUNK_LENGTH; z4++) {
|
|
int y3 = y2 + y4;
|
|
int x3 = x2 + x4;
|
|
int z3 = z2 + z4;
|
|
|
|
for (int m = 0; m < 3; m++) {
|
|
gen_face(cube, m, x3, y3, z3, x4, y4, z4, &i, 0, chunk, a, a3);
|
|
gen_face(text, m, x3, y3, z3, x4, y4, z4, &i, 1, chunk, a, a3);
|
|
i += 6 * a3;
|
|
if (i > CBLOCK_ALL * 18)
|
|
return (void *)i;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
for (int a = i; a < args2.i + (BLOCK_ALL * 18) * a3; a += 6 * a3) {
|
|
cube[a] = vNul;
|
|
text[a] = vNul;
|
|
}
|
|
return (void *)i;
|
|
}
|
|
|
|
void free_chunks_old() { free(chunk_old); }
|
|
|
|
int gen_cubes(struct v3f *cube, struct v3f *text, struct v3f *cubeO,
|
|
struct v3f *textO, int x, int y, int z, int is_purge, int *i2) {
|
|
struct v3f noth = {{-1, -1, -1}};
|
|
for (int i = 0; i < CBLOCK_ALL * 18; i++) {
|
|
cube[i] = noth;
|
|
text[i] = noth;
|
|
}
|
|
|
|
int i = 0;
|
|
x *= CHUNK_LENGTH;
|
|
y *= CHUNK_LENGTH;
|
|
z *= CHUNK_LENGTH;
|
|
int a3 = CHUNK_DIAMETER_H;
|
|
int a =
|
|
0; //(z % CHUNK_DIAMETER_H) + (x % CHUNK_DIAMETER_H) * CHUNK_DIAMETER_H +
|
|
//(y % CHUNK_DIAMETER_V) * CHUNK_DIAMETER_H * CHUNK_DIAMETER_H;
|
|
// a = a % a3;
|
|
// if (a < 0) a = -a;
|
|
|
|
struct args args[a3];
|
|
int thread_return[a3];
|
|
if (is_purge) {
|
|
for (int k = 0; k < a3; k++) {
|
|
purge_chunks(k);
|
|
}
|
|
}
|
|
|
|
if (!chunk_old) {
|
|
chunk_old = calloc((CHUNK_ALL), sizeof(struct chunk));
|
|
}
|
|
pthread_t thread_id[a3];
|
|
int j = 0;
|
|
for (int y2 = y - (CHUNK_RADIUS_V)*CHUNK_LENGTH;
|
|
y2 <= y + (CHUNK_RADIUS_V)*CHUNK_LENGTH; y2 += CHUNK_LENGTH) {
|
|
|
|
for (int x2 = x - (CHUNK_RADIUS_H)*CHUNK_LENGTH;
|
|
x2 <= x + (CHUNK_RADIUS_H)*CHUNK_LENGTH; x2 += CHUNK_LENGTH) {
|
|
|
|
for (int z2 = z - (CHUNK_RADIUS_H)*CHUNK_LENGTH;
|
|
z2 <= z + (CHUNK_RADIUS_H)*CHUNK_LENGTH; z2 += CHUNK_LENGTH) {
|
|
|
|
struct v3i pos = {
|
|
{x + (((x2 / CHUNK_LENGTH) % (CHUNK_DIAMETER_H)) - CHUNK_RADIUS_H) *
|
|
CHUNK_LENGTH,
|
|
y + (((y2 / CHUNK_LENGTH) % (CHUNK_DIAMETER_V)) - CHUNK_RADIUS_V) *
|
|
CHUNK_LENGTH,
|
|
z + (((z2 / CHUNK_LENGTH) % (CHUNK_DIAMETER_H)) - CHUNK_RADIUS_H) *
|
|
CHUNK_LENGTH}};
|
|
|
|
int a2 = a % a3;
|
|
args[a2].cube = cube;
|
|
args[a2].text = text;
|
|
args[a2].pos = pos;
|
|
// args[a2].is_text = is_text;
|
|
args[a2].a = a;
|
|
args[a2].i = i;
|
|
args[a2].a3 = a3;
|
|
args[a2].i2 = i2;
|
|
|
|
/*gen_chunk((void *)&args); */
|
|
|
|
struct chunk old_chunk = chunk_old[a];
|
|
|
|
int cached =
|
|
(old_chunk.x == pos.pos[0] / CHUNK_LENGTH &&
|
|
old_chunk.y == pos.pos[1] / CHUNK_LENGTH &&
|
|
old_chunk.z == pos.pos[2] / CHUNK_LENGTH && old_chunk.exists != 0);
|
|
if (cached) {
|
|
thread_return[a2] = i2[a2 / a3];
|
|
thread_id[a2] = -1;
|
|
} else if (pos.pos[0] < 0 || pos.pos[1] < 0 || pos.pos[2] < 0 ||
|
|
pos.pos[1] < ((y - CHUNK_LENGTH * CHUNK_RADIUS_V) * 1.05)) {
|
|
thread_return[a2] = -1;
|
|
thread_id[a2] = -1;
|
|
} else {
|
|
pthread_create(&(thread_id[a2]), NULL, gen_chunk,
|
|
(void *)&(args[a2]));
|
|
}
|
|
|
|
i += 6;
|
|
|
|
a++;
|
|
}
|
|
|
|
for (int k = 0; k < a3; k++) {
|
|
if (thread_id[k] == -1)
|
|
continue;
|
|
pthread_join((thread_id[k]), (void **)&thread_return[k]);
|
|
}
|
|
int max = 0;
|
|
int min = 0xFFFFFFF;
|
|
|
|
for (int a = 0; a < a3; a++) {
|
|
max = (max > thread_return[a]) ? max : thread_return[a];
|
|
min = (min < thread_return[a]) ? min : thread_return[a];
|
|
}
|
|
max += 6;
|
|
i2[(a / a3) - 1] = max;
|
|
if (max > i) {
|
|
memcpy(&(cubeO[j]), &(cube[i - 6 * a3]),
|
|
(max - i) * sizeof(struct v3f));
|
|
memcpy(&(textO[j]), &(text[i - 6 * a3]),
|
|
(max - i) * sizeof(struct v3f));
|
|
j += max - i;
|
|
}
|
|
i = (BLOCK_ALL * 18) * a; // i = max + 6;
|
|
}
|
|
}
|
|
|
|
ox = x;
|
|
oy = y;
|
|
oz = z;
|
|
|
|
return j; // i;
|
|
} |