AstralTransRocketries/cubiomes
1
0
Fork 0
mirror of https://github.com/Cubitect/cubiomes.git synced 2025-09-20 09:58:29 -04:00
Code Issues Packages Projects Releases Wiki Activity

avoid recursion floodfill exceeding stack limit (crashes on windows)

Browse Source
This commit is contained in:
Cubitect 2022-10-01 19:39:40 +02:00
parent 6989510924
commit d3112ca416
2 changed files with 55 additions and 38 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

91
finders.c
View File

@ -3697,47 +3697,65 @@ struct locate_info_t
Generator *g;
int *ids;
Range r;
int match;
int64_t sumx, sumz;
int n, dmax;
int match, tol;
volatile char *stop;
};
static
void floodFillGen(struct locate_info_t *info, int i, int j, int d)
int floodFillGen(struct locate_info_t *info, int i, int j, Pos *p)
{
if (i < 0 || j < 0 || i >= info->r.sx || j >= info->r.sz)
return;
if (info->stop && *info->stop)
return;
int idx = j * info->r.sx + i;
int id = info->ids[idx];
if (id == INT_MAX)
return;
info->ids[idx] = INT_MAX;
int x = info->r.x + i;
int z = info->r.z + j;
if (info->g->mc >= MC_1_18)
id = getBiomeAt(info->g, 4, x, info->r.y, z);
if (id == info->match)
typedef struct { int i, j, d; } entry_t;
entry_t *queue = (entry_t*) malloc(info->r.sx*info->r.sz * sizeof(*queue));
int qn = 1, d = 0;
queue->i = i;
queue->j = j;
int64_t sumx = 0;
int64_t sumz = 0;
int n = 0;
while (--qn >= 0)
{
info->sumx += x;
info->sumz += z;
info->n += 1;
d = 0;
if (info->stop && *info->stop)
return 0;
i = queue[qn].i;
j = queue[qn].j;
d = queue[qn].d;
if (i < 0 || j < 0 || i >= info->r.sx || j >= info->r.sz)
continue;
int k, idx = j * info->r.sx + i;
int id = info->ids[idx];
if (id == INT_MAX)
continue;
info->ids[idx] = INT_MAX;
int x = info->r.x + i;
int z = info->r.z + j;
if (info->g->mc >= MC_1_18)
id = getBiomeAt(info->g, 4, x, info->r.y, z);
if (id == info->match)
{
sumx += x;
sumz += z;
n++;
d = 0;
}
else
{
if (++d >= info->tol)
continue;
}
entry_t next[] = { {i,j-1,d}, {i,j+1,d}, {i-1,j,d}, {i+1,j,d} };
for (k = 0; k < 4; k++)
queue[qn++] = next[k];
}
else
free(queue);
if (n)
{
if (++d >= info->dmax)
return;
p->x = (int) round(2.0 + 4.0*sumx / n);
p->z = (int) round(2.0 + 4.0*sumz / n);
}
floodFillGen(info, i, j-1, d);
floodFillGen(info, i, j+1, d);
floodFillGen(info, i-1, j, d);
floodFillGen(info, i+1, j, d);
return n;
}
int getBiomeCenters(Pos *pos, int *siz, int nmax, Generator *g, Range r,
int match, int minsiz, int tol, volatile char *stop)
{
@ -3760,7 +3778,7 @@ int getBiomeCenters(Pos *pos, int *siz, int nmax, Generator *g, Range r,
info.r = r;
info.stop = stop;
info.match = match;
info.dmax = tol;
info.tol = tol;
if (g->mc >= MC_1_18)
{
@ -3855,13 +3873,12 @@ int getBiomeCenters(Pos *pos, int *siz, int nmax, Generator *g, Range r,
break;
if (ids[j*r.sx + i] != match)
continue;
info.sumx = info.sumz = info.n = 0;
floodFillGen(&info, i, j, 0);
if (info.n >= minsiz)
Pos center;
int area = floodFillGen(&info, i, j, &center);
if (area >= minsiz)
{
pos[n].x = (int) round(2.0 + 4.0*info.sumx / info.n);
pos[n].z = (int) round(2.0 + 4.0*info.sumz / info.n);
if (siz) siz[n] = info.n;
pos[n] = center;
if (siz) siz[n] = area;
if (++n >= nmax)
goto L_end;
}

2
finders.h
View File

@ -549,7 +549,7 @@ int checkForTemps(LayerStack *g, uint64_t seed, int x, int z, int w, int h, cons
* @r : area to examine, requires: scale = 4, sy = 1
* @match : biome id to find
* @minsiz : minimum size of output biomes
* @tol : border tollerance
* @tol : border tolerance
* @stop : stopping flag (nullable)
* Returns the number of entries written to pos and siz.
*/