mirror of
https://github.com/Shpoike/Quakespasm.git
synced 2024-11-10 15:31:39 +00:00
6bbb06b490
git-svn-id: http://svn.code.sf.net/p/quakespasm/code/trunk/quakespasm@249 af15c1b1-3010-417e-b628-4374ebc0bcbd
352 lines
7.5 KiB
C
352 lines
7.5 KiB
C
/*
|
|
Copyright (C) 1996-2001 Id Software, Inc.
|
|
Copyright (C) 2002-2009 John Fitzgibbons and others
|
|
Copyright (C) 2007-2008 Kristian Duske
|
|
|
|
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.
|
|
|
|
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.
|
|
|
|
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 the Free Software
|
|
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
|
|
|
|
*/
|
|
// gl_mesh.c: triangle model functions
|
|
|
|
#include "quakedef.h"
|
|
|
|
|
|
|
|
/*
|
|
=================================================================
|
|
|
|
ALIAS MODEL DISPLAY LIST GENERATION
|
|
|
|
=================================================================
|
|
*/
|
|
|
|
model_t *aliasmodel;
|
|
aliashdr_t *paliashdr;
|
|
|
|
int used[8192]; // qboolean
|
|
|
|
// the command list holds counts and s/t values that are valid for
|
|
// every frame
|
|
int commands[8192];
|
|
int numcommands;
|
|
|
|
// 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;
|
|
|
|
int allverts, alltris;
|
|
|
|
int stripverts[128];
|
|
int striptris[128];
|
|
int stripcount;
|
|
|
|
/*
|
|
================
|
|
StripLength
|
|
================
|
|
*/
|
|
int StripLength (int starttri, int startv)
|
|
{
|
|
int m1, m2;
|
|
int j;
|
|
mtriangle_t *last, *check;
|
|
int k;
|
|
|
|
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];
|
|
|
|
striptris[0] = starttri;
|
|
stripcount = 1;
|
|
|
|
m1 = last->vertindex[(startv+2)%3];
|
|
m2 = last->vertindex[(startv+1)%3];
|
|
|
|
// look for a matching triangle
|
|
nexttri:
|
|
for (j=starttri+1, check=&triangles[starttri+1] ; j<pheader->numtris ; j++, check++)
|
|
{
|
|
if (check->facesfront != last->facesfront)
|
|
continue;
|
|
for (k=0 ; k<3 ; k++)
|
|
{
|
|
if (check->vertindex[k] != m1)
|
|
continue;
|
|
if (check->vertindex[ (k+1)%3 ] != m2)
|
|
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 ];
|
|
else
|
|
m1 = check->vertindex[ (k+2)%3 ];
|
|
|
|
stripverts[stripcount+2] = check->vertindex[ (k+2)%3 ];
|
|
striptris[stripcount] = j;
|
|
stripcount++;
|
|
|
|
used[j] = 2;
|
|
goto nexttri;
|
|
}
|
|
}
|
|
done:
|
|
|
|
// clear the temp used flags
|
|
for (j=starttri+1 ; j<pheader->numtris ; j++)
|
|
if (used[j] == 2)
|
|
used[j] = 0;
|
|
|
|
return stripcount;
|
|
}
|
|
|
|
/*
|
|
===========
|
|
FanLength
|
|
===========
|
|
*/
|
|
int FanLength (int starttri, int startv)
|
|
{
|
|
int m1, m2;
|
|
int j;
|
|
mtriangle_t *last, *check;
|
|
int k;
|
|
|
|
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];
|
|
|
|
striptris[0] = starttri;
|
|
stripcount = 1;
|
|
|
|
m1 = last->vertindex[(startv+0)%3];
|
|
m2 = last->vertindex[(startv+2)%3];
|
|
|
|
|
|
// look for a matching triangle
|
|
nexttri:
|
|
for (j=starttri+1, check=&triangles[starttri+1] ; j<pheader->numtris ; j++, check++)
|
|
{
|
|
if (check->facesfront != last->facesfront)
|
|
continue;
|
|
for (k=0 ; k<3 ; k++)
|
|
{
|
|
if (check->vertindex[k] != m1)
|
|
continue;
|
|
if (check->vertindex[ (k+1)%3 ] != m2)
|
|
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 ];
|
|
|
|
stripverts[stripcount+2] = m2;
|
|
striptris[stripcount] = j;
|
|
stripcount++;
|
|
|
|
used[j] = 2;
|
|
goto nexttri;
|
|
}
|
|
}
|
|
done:
|
|
|
|
// clear the temp used flags
|
|
for (j=starttri+1 ; j<pheader->numtris ; j++)
|
|
if (used[j] == 2)
|
|
used[j] = 0;
|
|
|
|
return stripcount;
|
|
}
|
|
|
|
|
|
/*
|
|
================
|
|
BuildTris
|
|
|
|
Generate a list of trifans or strips
|
|
for the model, which holds for all frames
|
|
================
|
|
*/
|
|
void BuildTris (void)
|
|
{
|
|
int i, j, k;
|
|
int startv;
|
|
float s, t;
|
|
int len, bestlen, besttype;
|
|
int bestverts[1024];
|
|
int besttris[1024];
|
|
int type;
|
|
|
|
//
|
|
// build tristrips
|
|
//
|
|
numorder = 0;
|
|
numcommands = 0;
|
|
memset (used, 0, sizeof(used));
|
|
for (i = 0; i < pheader->numtris; i++)
|
|
{
|
|
// pick an unused triangle and start the trifan
|
|
if (used[i])
|
|
continue;
|
|
|
|
bestlen = 0;
|
|
besttype = 0;
|
|
for (type = 0 ; type < 2 ; type++)
|
|
// type = 1;
|
|
{
|
|
for (startv = 0; startv < 3; startv++)
|
|
{
|
|
if (type == 1)
|
|
len = StripLength (i, startv);
|
|
else
|
|
len = FanLength (i, startv);
|
|
if (len > bestlen)
|
|
{
|
|
besttype = type;
|
|
bestlen = len;
|
|
for (j = 0; j < bestlen+2; j++)
|
|
bestverts[j] = stripverts[j];
|
|
for (j = 0; j < bestlen; j++)
|
|
besttris[j] = striptris[j];
|
|
}
|
|
}
|
|
}
|
|
|
|
// mark the tris on the best strip as used
|
|
for (j = 0; j < bestlen; j++)
|
|
used[besttris[j]] = 1;
|
|
|
|
if (besttype == 1)
|
|
commands[numcommands++] = (bestlen+2);
|
|
else
|
|
commands[numcommands++] = -(bestlen+2);
|
|
|
|
for (j = 0; j < bestlen+2; j++)
|
|
{
|
|
int tmp;
|
|
|
|
// 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->skinwidth / 2; // on back side
|
|
s = (s + 0.5) / pheader->skinwidth;
|
|
t = (t + 0.5) / pheader->skinheight;
|
|
|
|
// *(float *)&commands[numcommands++] = s;
|
|
// *(float *)&commands[numcommands++] = t;
|
|
// NOTE: 4 == sizeof(int)
|
|
// == sizeof(float)
|
|
memcpy (&tmp, &s, 4);
|
|
commands[numcommands++] = tmp;
|
|
memcpy (&tmp, &t, 4);
|
|
commands[numcommands++] = tmp;
|
|
}
|
|
}
|
|
|
|
commands[numcommands++] = 0; // end of list marker
|
|
|
|
Con_DPrintf ("%3i tri %3i vert %3i cmd\n", pheader->numtris, numorder, numcommands);
|
|
|
|
allverts += numorder;
|
|
alltris += pheader->numtris;
|
|
}
|
|
|
|
|
|
/*
|
|
================
|
|
GL_MakeAliasModelDisplayLists
|
|
================
|
|
*/
|
|
void GL_MakeAliasModelDisplayLists (model_t *m, aliashdr_t *hdr)
|
|
{
|
|
int i, j;
|
|
int *cmds;
|
|
trivertx_t *verts;
|
|
float hscale, vscale; //johnfitz -- padded skins
|
|
int count; //johnfitz -- precompute texcoords for padded skins
|
|
int *loadcmds; //johnfitz
|
|
|
|
//johnfitz -- padded skins
|
|
hscale = (float)hdr->skinwidth/(float)TexMgr_PadConditional(hdr->skinwidth);
|
|
vscale = (float)hdr->skinheight/(float)TexMgr_PadConditional(hdr->skinheight);
|
|
//johnfitz
|
|
|
|
aliasmodel = m;
|
|
paliashdr = hdr; // (aliashdr_t *)Mod_Extradata (m);
|
|
|
|
//johnfitz -- generate meshes
|
|
|
|
Con_DPrintf ("meshing %s...\n",m->name);
|
|
BuildTris ();
|
|
|
|
// save the data out
|
|
|
|
paliashdr->poseverts = numorder;
|
|
|
|
cmds = (int *) Hunk_Alloc (numcommands * 4);
|
|
paliashdr->commands = (byte *)cmds - (byte *)paliashdr;
|
|
|
|
//johnfitz -- precompute texcoords for padded skins
|
|
loadcmds = commands;
|
|
while(1)
|
|
{
|
|
*cmds++ = count = *loadcmds++;
|
|
|
|
if (!count)
|
|
break;
|
|
|
|
if (count < 0)
|
|
count = -count;
|
|
|
|
do
|
|
{
|
|
*(float *)cmds++ = hscale * (*(float *)loadcmds++);
|
|
*(float *)cmds++ = vscale * (*(float *)loadcmds++);
|
|
} while (--count);
|
|
}
|
|
//johnfitz
|
|
|
|
verts = (trivertx_t *) 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++)
|
|
*verts++ = poseverts[i][vertexorder[j]];
|
|
}
|
|
|