nuq/source/gl_mesh.c

412 lines
9.4 KiB
C
Raw Normal View History

2000-08-20 01:33:10 +00:00
/*
2000-08-20 05:25:28 +00:00
gl_mesh.c
2000-08-20 01:33:10 +00:00
2000-08-26 21:30:05 +00:00
gl_mesh.c: triangle model functions
2000-08-20 01:33:10 +00:00
2000-08-20 05:25:28 +00:00
Copyright (C) 1996-1997 Id Software, Inc.
2000-08-20 01:33:10 +00:00
2000-08-20 05:25:28 +00:00
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License
as published by the Free Software Foundation; either version 2
of the License, or (at your option) any later version.
2000-08-20 01:33:10 +00:00
2000-08-20 05:25:28 +00:00
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
2000-08-20 01:33:10 +00:00
2000-08-20 05:25:28 +00:00
See the GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to:
Free Software Foundation, Inc.
59 Temple Place - Suite 330
Boston, MA 02111-1307, USA
$Id$
2000-08-20 01:33:10 +00:00
*/
#ifdef HAVE_CONFIG_H
# include "config.h"
2000-08-20 01:33:10 +00:00
#endif
#ifdef HAVE_STRING_H
# include <string.h>
#endif
#ifdef HAVE_STRINGS_H
# include <strings.h>
#endif
2000-08-26 21:30:05 +00:00
#include <stdio.h>
#include "console.h"
#include "mdfour.h"
#include "model.h"
#include "quakefs.h"
2000-08-20 01:33:10 +00:00
/*
ALIAS MODEL DISPLAY LIST GENERATION
2000-08-20 01:33:10 +00:00
*/
model_t *aliasmodel;
aliashdr_t *paliashdr;
2000-08-20 01:33:10 +00:00
qboolean used[8192];
2000-08-20 01:33:10 +00:00
// the command list holds counts and s/t values that are valid for
// every frame
int commands[8192];
int numcommands;
2000-08-20 01:33:10 +00:00
// all frames will have their vertexes rearranged and expanded
// so they are in the order expected by the command list
int vertexorder[8192];
int numorder;
2000-08-20 01:33:10 +00:00
int allverts, alltris;
2000-08-20 01:33:10 +00:00
int stripverts[128];
int striptris[128];
int stripcount;
2000-08-20 01:33:10 +00:00
/*
StripLength
2000-08-20 01:33:10 +00:00
*/
int
StripLength (int starttri, int startv)
2000-08-20 01:33:10 +00:00
{
int m1, m2;
int j;
mtriangle_t *last, *check;
int k;
2000-08-20 01:33:10 +00:00
used[starttri] = 2;
last = &triangles[starttri];
stripverts[0] = last->vertindex[(startv) % 3];
stripverts[1] = last->vertindex[(startv + 1) % 3];
stripverts[2] = last->vertindex[(startv + 2) % 3];
2000-08-20 01:33:10 +00:00
striptris[0] = starttri;
stripcount = 1;
m1 = last->vertindex[(startv + 2) % 3];
m2 = last->vertindex[(startv + 1) % 3];
2000-08-20 01:33:10 +00:00
// look for a matching triangle
nexttri:
for (j = starttri + 1, check = &triangles[starttri + 1];
j < pheader->mdl.numtris; j++, check++) {
2000-08-20 01:33:10 +00:00
if (check->facesfront != last->facesfront)
continue;
for (k = 0; k < 3; k++) {
2000-08-20 01:33:10 +00:00
if (check->vertindex[k] != m1)
continue;
if (check->vertindex[(k + 1) % 3] != m2)
2000-08-20 01:33:10 +00:00
continue;
// this is the next part of the fan
// if we can't use this triangle, this tristrip is done
if (used[j])
goto done;
// the new edge
if (stripcount & 1)
m2 = check->vertindex[(k + 2) % 3];
2000-08-20 01:33:10 +00:00
else
m1 = check->vertindex[(k + 2) % 3];
2000-08-20 01:33:10 +00:00
stripverts[stripcount + 2] = check->vertindex[(k + 2) % 3];
2000-08-20 01:33:10 +00:00
striptris[stripcount] = j;
stripcount++;
used[j] = 2;
goto nexttri;
}
}
done:
// clear the temp used flags
for (j = starttri + 1; j < pheader->mdl.numtris; j++)
2000-08-20 01:33:10 +00:00
if (used[j] == 2)
used[j] = 0;
return stripcount;
}
/*
FanLength
2000-08-20 01:33:10 +00:00
*/
int
FanLength (int starttri, int startv)
2000-08-20 01:33:10 +00:00
{
int m1, m2;
int j;
mtriangle_t *last, *check;
int k;
2000-08-20 01:33:10 +00:00
used[starttri] = 2;
last = &triangles[starttri];
stripverts[0] = last->vertindex[(startv) % 3];
stripverts[1] = last->vertindex[(startv + 1) % 3];
stripverts[2] = last->vertindex[(startv + 2) % 3];
2000-08-20 01:33:10 +00:00
striptris[0] = starttri;
stripcount = 1;
m1 = last->vertindex[(startv + 0) % 3];
m2 = last->vertindex[(startv + 2) % 3];
2000-08-20 01:33:10 +00:00
// look for a matching triangle
nexttri:
for (j = starttri + 1, check = &triangles[starttri + 1];
j < pheader->mdl.numtris; j++, check++) {
2000-08-20 01:33:10 +00:00
if (check->facesfront != last->facesfront)
continue;
for (k = 0; k < 3; k++) {
2000-08-20 01:33:10 +00:00
if (check->vertindex[k] != m1)
continue;
if (check->vertindex[(k + 1) % 3] != m2)
2000-08-20 01:33:10 +00:00
continue;
// this is the next part of the fan
// if we can't use this triangle, this tristrip is done
if (used[j])
goto done;
// the new edge
m2 = check->vertindex[(k + 2) % 3];
2000-08-20 01:33:10 +00:00
stripverts[stripcount + 2] = m2;
2000-08-20 01:33:10 +00:00
striptris[stripcount] = j;
stripcount++;
used[j] = 2;
goto nexttri;
}
}
done:
2000-08-20 01:33:10 +00:00
// clear the temp used flags
for (j = starttri + 1; j < pheader->mdl.numtris; j++)
2000-08-20 01:33:10 +00:00
if (used[j] == 2)
used[j] = 0;
return stripcount;
}
/*
BuildTris
2000-08-20 01:33:10 +00:00
Generate a list of trifans or strips
for the model, which holds for all frames
2000-08-20 01:33:10 +00:00
*/
void
BuildTris (void)
2000-08-20 01:33:10 +00:00
{
int i, j, k;
int startv;
float s, t;
int len, bestlen, besttype = 0;
int bestverts[1024];
int besttris[1024];
int type;
//
2000-08-20 01:33:10 +00:00
// build tristrips
//
2000-08-20 01:33:10 +00:00
numorder = 0;
numcommands = 0;
memset (used, 0, sizeof (used));
for (i = 0; i < pheader->mdl.numtris; i++) {
2000-08-20 01:33:10 +00:00
// pick an unused triangle and start the trifan
if (used[i])
continue;
bestlen = 0;
for (type = 0; type < 2; type++)
// type = 1;
2000-08-20 01:33:10 +00:00
{
for (startv = 0; startv < 3; startv++) {
2000-08-20 01:33:10 +00:00
if (type == 1)
len = StripLength (i, startv);
else
len = FanLength (i, startv);
if (len > bestlen) {
2000-08-20 01:33:10 +00:00
besttype = type;
bestlen = len;
for (j = 0; j < bestlen + 2; j++)
2000-08-20 01:33:10 +00:00
bestverts[j] = stripverts[j];
for (j = 0; j < bestlen; j++)
2000-08-20 01:33:10 +00:00
besttris[j] = striptris[j];
}
}
}
// mark the tris on the best strip as used
for (j = 0; j < bestlen; j++)
2000-08-20 01:33:10 +00:00
used[besttris[j]] = 1;
if (besttype == 1)
commands[numcommands++] = (bestlen + 2);
2000-08-20 01:33:10 +00:00
else
commands[numcommands++] = -(bestlen + 2);
2000-08-20 01:33:10 +00:00
for (j = 0; j < bestlen + 2; j++) {
2000-08-20 01:33:10 +00:00
// emit a vertex into the reorder buffer
k = bestverts[j];
vertexorder[numorder++] = k;
// emit s/t coords into the commands stream
s = stverts[k].s;
t = stverts[k].t;
if (!triangles[besttris[0]].facesfront && stverts[k].onseam)
s += pheader->mdl.skinwidth / 2; // on back side
s = (s + 0.5) / pheader->mdl.skinwidth;
t = (t + 0.5) / pheader->mdl.skinheight;
2000-08-20 01:33:10 +00:00
*(float *) &commands[numcommands++] = s;
*(float *) &commands[numcommands++] = t;
2000-08-20 01:33:10 +00:00
}
}
commands[numcommands++] = 0; // end of list marker
Con_DPrintf ("%3i tri %3i vert %3i cmd\n", pheader->mdl.numtris, numorder,
numcommands);
2000-08-20 01:33:10 +00:00
allverts += numorder;
alltris += pheader->mdl.numtris;
2000-08-20 01:33:10 +00:00
}
/*
GL_MakeAliasModelDisplayLists
2000-08-20 01:33:10 +00:00
*/
void
GL_MakeAliasModelDisplayLists (model_t *m, aliashdr_t *hdr, void *_m, int _s)
2000-08-20 01:33:10 +00:00
{
int i, j;
int *cmds;
trivertx_t *verts;
char cache[MAX_QPATH], fullpath[MAX_OSPATH];
QFile *f;
unsigned char model_digest[MDFOUR_DIGEST_BYTES];
unsigned char mesh_digest[MDFOUR_DIGEST_BYTES];
qboolean remesh = true;
2000-08-20 01:33:10 +00:00
aliasmodel = m;
paliashdr = hdr; // (aliashdr_t *)Mod_Extradata (m);
2000-08-20 01:33:10 +00:00
mdfour (model_digest, (unsigned char*)_m, _s);
//
2000-08-20 01:33:10 +00:00
// look for a cached version
//
2000-08-20 01:33:10 +00:00
strcpy (cache, "glquake/");
COM_StripExtension (m->name + strlen ("progs/"),
cache + strlen ("glquake/"));
strncat (cache, ".ms2", sizeof (cache) - strlen (cache));
COM_FOpenFile (cache, &f);
if (f) {
unsigned char d1[MDFOUR_DIGEST_BYTES];
unsigned char d2[MDFOUR_DIGEST_BYTES];
struct mdfour md;
int c[8192];
int nc;
int vo[8192];
int no;
memset (d1, 0, sizeof (d1));
memset (d2, 0, sizeof (d2));
Qread (f, &nc, 4);
Qread (f, &no, 4);
if (nc <= 8192 && no <= 8192) {
Qread (f, &c, nc * sizeof (c[0]));
Qread (f, &vo, no * sizeof (vo[0]));
Qread (f, d1, MDFOUR_DIGEST_BYTES);
Qread (f, d2, MDFOUR_DIGEST_BYTES);
Qclose (f);
mdfour_begin (&md);
mdfour_update (&md, (unsigned char*)&nc, 4);
mdfour_update (&md, (unsigned char*)&no, 4);
mdfour_update (&md, (unsigned char*)&c, nc * sizeof (c[0]));
mdfour_update (&md, (unsigned char*)&vo, no * sizeof (vo[0]));
mdfour_update (&md, d1, MDFOUR_DIGEST_BYTES);
mdfour_result (&md, mesh_digest);
if (memcmp (d2, mesh_digest, MDFOUR_DIGEST_BYTES) == 0 && memcmp (d1, model_digest, MDFOUR_DIGEST_BYTES) == 0) {
remesh = false;
numcommands = nc;
numorder = no;
memcpy (commands, c, numcommands * sizeof (c[0]));
memcpy (vertexorder, vo, numorder * sizeof (vo[0]));
}
}
2000-08-20 01:33:10 +00:00
}
if (remesh) {
//
2000-08-20 01:33:10 +00:00
// build it from scratch
//
Con_Printf ("meshing %s...\n", m->name);
2000-08-20 01:33:10 +00:00
BuildTris (); // trifans or lists
2000-08-20 01:33:10 +00:00
//
2000-08-20 01:33:10 +00:00
// save out the cached version
//
snprintf (fullpath, sizeof (fullpath), "%s/%s", com_gamedir, cache);
f = Qopen (fullpath, "wbz9");
2000-08-26 21:30:05 +00:00
if (!f) {
COM_CreatePath (fullpath);
2000-09-19 22:32:45 +00:00
f = Qopen (fullpath, "wb");
2000-08-26 21:30:05 +00:00
}
if (f) {
struct mdfour md;
mdfour_begin (&md);
mdfour_update (&md, (unsigned char*)&numcommands, 4);
mdfour_update (&md, (unsigned char*)&numorder, 4);
mdfour_update (&md, (unsigned char*)&commands, numcommands * sizeof (commands[0]));
mdfour_update (&md, (unsigned char*)&vertexorder,
numorder * sizeof (vertexorder[0]));
mdfour_update (&md, model_digest, MDFOUR_DIGEST_BYTES);
mdfour_result (&md, mesh_digest);
2000-09-19 22:32:45 +00:00
Qwrite (f, &numcommands, 4);
Qwrite (f, &numorder, 4);
Qwrite (f, &commands, numcommands * sizeof (commands[0]));
Qwrite (f, &vertexorder, numorder * sizeof (vertexorder[0]));
Qwrite (f, model_digest, MDFOUR_DIGEST_BYTES);
Qwrite (f, mesh_digest, MDFOUR_DIGEST_BYTES);
2000-09-19 22:32:45 +00:00
Qclose (f);
2000-08-20 01:33:10 +00:00
}
}
// save the data out
paliashdr->poseverts = numorder;
cmds = Hunk_Alloc (numcommands * 4);
paliashdr->commands = (byte *) cmds - (byte *) paliashdr;
2000-08-20 01:33:10 +00:00
memcpy (cmds, commands, numcommands * 4);
verts = Hunk_Alloc (paliashdr->numposes * paliashdr->poseverts
* sizeof (trivertx_t));
paliashdr->posedata = (byte *) verts - (byte *) paliashdr;
for (i = 0; i < paliashdr->numposes; i++)
for (j = 0; j < numorder; j++)
2000-08-20 01:33:10 +00:00
*verts++ = poseverts[i][vertexorder[j]];
}