yquake2/yquake2remaster
0
0
Fork 0
mirror of https://github.com/yquake2/yquake2remaster.git synced 2025-01-22 09:11:33 +00:00
Code Issues Projects Releases Packages Wiki Activity

models: revert slow vect compress logic

Browse source
This commit is contained in:
Denis Pauk 2024-03-13 22:51:57 +02:00
parent 5675a7c28d
commit 448d289457
1 changed files with 1 additions and 58 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

59
src/client/refresh/files/models.c
View file

@ -1068,69 +1068,14 @@ Mod_LoadSTLookup(dmdx_t *pheader)
return st_lookup; return st_lookup;
} }
static qboolean
Mod_LoadFrameVertSame(dmdx_t *pheader, int k, int j)
{
int i;
for(i = 0; i < pheader->num_frames; i ++)
{
daliasxframe_t *frame;
frame = (daliasxframe_t *)(
(byte *)pheader + pheader->ofs_frames + i * pheader->framesize);
if ((frame->verts[k].v[0] != frame->verts[j].v[0]) ||
(frame->verts[k].v[1] != frame->verts[j].v[1]) ||
(frame->verts[k].v[2] != frame->verts[j].v[2]) ||
(frame->verts[k].lightnormalindex != frame->verts[j].lightnormalindex))
{
continue;
}
return true;
}
return false;
}
static int *
Mod_LoadVectLookup(dmdx_t *pheader)
{
int *vect_lookup;
int k;
vect_lookup = calloc(pheader->num_xyz, sizeof(int));
for(k = 1; k < pheader->num_xyz; k++)
{
int j;
vect_lookup[k] = k;
for(j = 0; j < k; j++)
{
if (Mod_LoadFrameVertSame(pheader, k, j))
{
/* same value */
vect_lookup[k] = j;
break;
}
}
}
return vect_lookup;
}
void void
Mod_LoadTrisCompress(dmdx_t *pheader) Mod_LoadTrisCompress(dmdx_t *pheader)
{ {
int *st_lookup, *vect_lookup; int *st_lookup;
dtriangle_t *tris; dtriangle_t *tris;
int i; int i;
st_lookup = Mod_LoadSTLookup(pheader); st_lookup = Mod_LoadSTLookup(pheader);
vect_lookup = Mod_LoadVectLookup(pheader);
tris = (dtriangle_t*)((byte *)pheader + pheader->ofs_tris); tris = (dtriangle_t*)((byte *)pheader + pheader->ofs_tris);
for (i = 0; i < pheader->num_tris; i++) for (i = 0; i < pheader->num_tris; i++)
@ -1139,14 +1084,12 @@ Mod_LoadTrisCompress(dmdx_t *pheader)
for (k = 0; k < 3; k++) for (k = 0; k < 3; k++)
{ {
tris->index_xyz[k] = vect_lookup[tris->index_xyz[k]];
tris->index_st[k] = st_lookup[tris->index_st[k]]; tris->index_st[k] = st_lookup[tris->index_st[k]];
} }
tris++; tris++;
} }
free(vect_lookup);
free(st_lookup); free(st_lookup);
} }