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.
+MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
See the GNU General Public License for more details.
#include "quakedef.h"
-model_t *loadmodel;
-char loadname[32]; // for hunk tags
+model_t *loadmodel;
-void Mod_LoadSpriteModel (model_t *mod, void *buffer);
-void Mod_LoadBrushModel (model_t *mod, void *buffer);
-void Mod_LoadAliasModel (model_t *mod, void *buffer);
-void Mod_LoadQ2AliasModel (model_t *mod, void *buffer);
-model_t *Mod_LoadModel (model_t *mod, qboolean crash);
+// LordHavoc: increased from 512 to 2048
+#define MAX_MOD_KNOWN 2048
+static model_t mod_known[MAX_MOD_KNOWN];
-#define MAX_MOD_KNOWN 512
-model_t mod_known[MAX_MOD_KNOWN];
-int mod_numknown;
+rtexture_t *r_notexture;
+rtexturepool_t *r_notexturepool;
-extern void Mod_BrushInit();
-extern void Mod_AliasInit();
-extern void Mod_SpriteInit();
+texture_t r_surf_notexture;
+
+void Mod_SetupNoTexture(void)
+{
+ int x, y;
+ qbyte pix[16][16][4];
+
+ // this makes a light grey/dark grey checkerboard texture
+ for (y = 0;y < 16;y++)
+ {
+ for (x = 0;x < 16;x++)
+ {
+ if ((y < 8) ^ (x < 8))
+ {
+ pix[y][x][0] = 128;
+ pix[y][x][1] = 128;
+ pix[y][x][2] = 128;
+ pix[y][x][3] = 255;
+ }
+ else
+ {
+ pix[y][x][0] = 64;
+ pix[y][x][1] = 64;
+ pix[y][x][2] = 64;
+ pix[y][x][3] = 255;
+ }
+ }
+ }
+
+ r_notexturepool = R_AllocTexturePool();
+ r_notexture = R_LoadTexture2D(r_notexturepool, "notexture", 16, 16, &pix[0][0][0], TEXTYPE_RGBA, TEXF_MIPMAP, NULL);
+}
+
+extern void Mod_BrushStartup (void);
+extern void Mod_BrushShutdown (void);
+
+static void mod_start(void)
+{
+ int i;
+ for (i = 0;i < MAX_MOD_KNOWN;i++)
+ if (mod_known[i].name[0])
+ Mod_UnloadModel(&mod_known[i]);
+ Mod_LoadModels();
+
+ Mod_SetupNoTexture();
+ Mod_BrushStartup();
+}
+
+static void mod_shutdown(void)
+{
+ int i;
+ for (i = 0;i < MAX_MOD_KNOWN;i++)
+ if (mod_known[i].name[0])
+ Mod_UnloadModel(&mod_known[i]);
+
+ R_FreeTexturePool(&r_notexturepool);
+ Mod_BrushShutdown();
+}
+
+static void mod_newmap(void)
+{
+}
/*
===============
Mod_Init
===============
*/
+static void Mod_Print (void);
void Mod_Init (void)
{
Mod_BrushInit();
Mod_AliasInit();
Mod_SpriteInit();
+
+ Cmd_AddCommand ("modellist", Mod_Print);
+}
+
+void Mod_RenderInit(void)
+{
+ R_RegisterModule("Models", mod_start, mod_shutdown, mod_newmap);
+}
+
+void Mod_FreeModel (model_t *mod)
+{
+ R_FreeTexturePool(&mod->texturepool);
+ Mem_FreePool(&mod->mempool);
+
+ // clear the struct to make it available
+ memset(mod, 0, sizeof(model_t));
+}
+
+void Mod_UnloadModel (model_t *mod)
+{
+ char name[MAX_QPATH];
+ qboolean isworldmodel;
+ strcpy(name, mod->name);
+ isworldmodel = mod->isworldmodel;
+ Mod_FreeModel(mod);
+ strcpy(mod->name, name);
+ mod->isworldmodel = isworldmodel;
+ mod->needload = true;
}
/*
-===============
-Mod_Init
+==================
+Mod_LoadModel
-Caches the data if needed
-===============
+Loads a model
+==================
*/
-void *Mod_Extradata (model_t *mod)
+static model_t *Mod_LoadModel (model_t *mod, qboolean crash, qboolean checkdisk, qboolean isworldmodel)
{
- void *r;
-
- r = Cache_Check (&mod->cache);
- if (r)
- return r;
+ unsigned int crc;
+ void *buf;
+
+ mod->used = true;
+
+ if (mod->name[0] == '*') // submodel
+ return mod;
+
+ crc = 0;
+ buf = NULL;
+ if (!mod->needload)
+ {
+ if (checkdisk)
+ {
+ buf = COM_LoadFile (mod->name, false);
+ if (!buf)
+ {
+ if (crash)
+ Host_Error ("Mod_LoadModel: %s not found", mod->name); // LordHavoc: Sys_Error was *ANNOYING*
+ return NULL;
+ }
+
+ crc = CRC_Block(buf, com_filesize);
+ }
+ else
+ crc = mod->crc;
+
+ if (mod->crc == crc && mod->isworldmodel == isworldmodel)
+ {
+ if (buf)
+ Mem_Free(buf);
+ return mod; // already loaded
+ }
+ }
+
+ Con_DPrintf("loading model %s\n", mod->name);
- Mod_LoadModel (mod, true);
-
- if (!mod->cache.data)
- Host_Error ("Mod_Extradata: caching failed");
- return mod->cache.data;
+ if (!buf)
+ {
+ buf = COM_LoadFile (mod->name, false);
+ if (!buf)
+ {
+ if (crash)
+ Host_Error ("Mod_LoadModel: %s not found", mod->name);
+ return NULL;
+ }
+ crc = CRC_Block(buf, com_filesize);
+ }
+
+ // allocate a new model
+ loadmodel = mod;
+
+ // LordHavoc: unload the existing model in this slot (if there is one)
+ Mod_UnloadModel(mod);
+ mod->isworldmodel = isworldmodel;
+ mod->needload = false;
+ mod->used = true;
+ mod->crc = crc;
+ // errors can prevent the corresponding mod->error = false;
+ mod->error = true;
+
+ // all models use memory, so allocate a memory pool
+ mod->mempool = Mem_AllocPool(mod->name);
+ // all models load textures, so allocate a texture pool
+ if (cls.state != ca_dedicated)
+ mod->texturepool = R_AllocTexturePool();
+
+ // call the apropriate loader
+ if (!memcmp(buf, "IDPO" , 4)) Mod_LoadAliasModel (mod, buf);
+ else if (!memcmp(buf, "IDP2" , 4)) Mod_LoadQ2AliasModel(mod, buf);
+ else if (!memcmp(buf, "ZYMOTIC" , 7)) Mod_LoadZymoticModel(mod, buf);
+ else if (!memcmp(buf, "IDSP" , 4)) Mod_LoadSpriteModel (mod, buf);
+ else Mod_LoadBrushModel (mod, buf);
+
+ Mem_Free(buf);
+
+ // no errors occurred
+ mod->error = false;
+ return mod;
+}
+
+void Mod_CheckLoaded (model_t *mod)
+{
+ if (mod)
+ {
+ if (mod->needload)
+ Mod_LoadModel(mod, true, true, mod->isworldmodel);
+ else
+ {
+ if (mod->type == mod_invalid)
+ Host_Error("Mod_CheckLoaded: invalid model\n");
+ mod->used = true;
+ return;
+ }
+ }
}
/*
*/
void Mod_ClearAll (void)
{
- int i;
- model_t *mod;
-
- for (i=0 , mod=mod_known ; i<mod_numknown ; i++, mod++)
- if (mod->type != mod_alias)
- mod->needload = true;
+}
+
+void Mod_ClearErrorModels (void)
+{
+ int i;
+ model_t *mod;
+
+ for (i = 0, mod = mod_known;i < MAX_MOD_KNOWN;i++, mod++)
+ if (mod->error)
+ Mod_FreeModel(mod);
+}
+
+void Mod_ClearUsed(void)
+{
+ int i;
+ model_t *mod;
+
+ for (i = 0, mod = mod_known;i < MAX_MOD_KNOWN;i++, mod++)
+ if (mod->name[0])
+ mod->used = false;
+}
+
+void Mod_PurgeUnused(void)
+{
+ int i;
+ model_t *mod;
+
+ for (i = 0, mod = mod_known;i < MAX_MOD_KNOWN;i++, mod++)
+ if (mod->name[0])
+ if (!mod->used)
+ Mod_FreeModel(mod);
+}
+
+void Mod_LoadModels(void)
+{
+ int i;
+ model_t *mod;
+
+ for (i = 0, mod = mod_known;i < MAX_MOD_KNOWN;i++, mod++)
+ if (mod->name[0])
+ if (mod->used)
+ Mod_CheckLoaded(mod);
}
/*
==================
*/
-model_t *Mod_FindName (char *name)
+model_t *Mod_FindName (const char *name)
{
- int i;
- model_t *mod;
-
+ int i;
+ model_t *mod, *freemod;
+
if (!name[0])
Host_Error ("Mod_ForName: NULL name");
-
-//
+
// search the currently loaded models
-//
- for (i=0 , mod=mod_known ; i<mod_numknown ; i++, mod++)
- if (!strcmp (mod->name, name) )
- break;
-
- if (i == mod_numknown)
+ freemod = NULL;
+ for (i = 0, mod = mod_known;i < MAX_MOD_KNOWN;i++, mod++)
+ {
+ if (mod->name[0])
+ {
+ if (!strcmp (mod->name, name))
+ {
+ mod->used = true;
+ return mod;
+ }
+ }
+ else if (freemod == NULL)
+ freemod = mod;
+ }
+
+ if (freemod)
{
- if (mod_numknown == MAX_MOD_KNOWN)
- Host_Error ("mod_numknown == MAX_MOD_KNOWN");
+ mod = freemod;
strcpy (mod->name, name);
mod->needload = true;
- mod_numknown++;
+ mod->used = true;
+ return mod;
}
- return mod;
+ Host_Error ("Mod_FindName: ran out of models\n");
+ return NULL;
}
/*
==================
*/
-void Mod_TouchModel (char *name)
+void Mod_TouchModel (const char *name)
{
model_t *mod;
-
+
mod = Mod_FindName (name);
-
- if (!mod->needload)
- {
- if (mod->type == mod_alias)
- Cache_Check (&mod->cache);
- }
+ mod->used = true;
}
/*
==================
-Mod_LoadModel
+Mod_ForName
-Loads a model into the cache
+Loads in a model for the given name
==================
*/
-model_t *Mod_LoadModel (model_t *mod, qboolean crash)
+model_t *Mod_ForName (const char *name, qboolean crash, qboolean checkdisk, qboolean isworldmodel)
{
- void *d;
- unsigned *buf;
- byte stackbuf[1024]; // avoid dirtying the cache heap
+ return Mod_LoadModel (Mod_FindName (name), crash, checkdisk, isworldmodel);
+}
- if (!mod->needload)
+qbyte *mod_base;
+
+
+//=============================================================================
+
+/*
+================
+Mod_Print
+================
+*/
+static void Mod_Print (void)
+{
+ int i;
+ model_t *mod;
+
+ Con_Printf ("Loaded models:\n");
+ for (i = 0, mod = mod_known;i < MAX_MOD_KNOWN;i++, mod++)
+ if (mod->name[0])
+ Con_Printf ("%4iK %s\n", mod->mempool ? (mod->mempool->totalsize + 1023) / 1024 : 0, mod->name);
+}
+
+int Mod_FindTriangleWithEdge(const int *elements, int numtriangles, int start, int end, int ignore)
+{
+ int i, match, count;
+ count = 0;
+ match = -1;
+ for (i = 0;i < numtriangles;i++, elements += 3)
{
- if (mod->type == mod_alias)
+ if ((elements[0] == start && elements[1] == end)
+ || (elements[1] == start && elements[2] == end)
+ || (elements[2] == start && elements[0] == end))
{
- d = Cache_Check (&mod->cache);
- if (d)
- return mod;
+ if (i != ignore)
+ match = i;
+ count++;
}
- else
- return mod; // not cached at all
- }
-
-// load the file
- buf = (unsigned *)COM_LoadStackFile (mod->name, stackbuf, sizeof(stackbuf), false);
- if (!buf)
- {
- if (crash)
- Host_Error ("Mod_NumForName: %s not found", mod->name); // LordHavoc: Sys_Error was *ANNOYING*
- return NULL;
+ else if ((elements[1] == start && elements[0] == end)
+ || (elements[2] == start && elements[1] == end)
+ || (elements[0] == start && elements[2] == end))
+ count++;
}
-
-// allocate a new model
- COM_FileBase (mod->name, loadname);
-
- loadmodel = mod;
+ // detect edges shared by three triangles and make them seams
+ if (count > 2)
+ match = -1;
+ return match;
+}
-// call the apropriate loader
- mod->needload = false;
-
- switch (LittleLong(*(unsigned *)buf))
+void Mod_BuildTriangleNeighbors(int *neighbors, const int *elements, int numtriangles)
+{
+ int i, *n;
+ const int *e;
+ for (i = 0, e = elements, n = neighbors;i < numtriangles;i++, e += 3, n += 3)
{
- case IDPOLYHEADER:
- Mod_LoadAliasModel (mod, buf);
- break;
-
- case MD2IDALIASHEADER: // LordHavoc: added Quake2 model support
- Mod_LoadQ2AliasModel (mod, buf);
- break;
-
- case IDSPRITEHEADER:
- Mod_LoadSpriteModel (mod, buf);
- break;
-
- default:
- Mod_LoadBrushModel (mod, buf);
- break;
+ n[0] = Mod_FindTriangleWithEdge(elements, numtriangles, e[1], e[0], i);
+ n[1] = Mod_FindTriangleWithEdge(elements, numtriangles, e[2], e[1], i);
+ n[2] = Mod_FindTriangleWithEdge(elements, numtriangles, e[0], e[2], i);
}
+}
- return mod;
+void Mod_ValidateElements(const int *elements, int numtriangles, int numverts, const char *filename, int fileline)
+{
+ int i;
+ for (i = 0;i < numtriangles * 3;i++)
+ if ((unsigned int)elements[i] >= (unsigned int)numverts)
+ Con_Printf("Mod_ValidateElements: out of bounds element detected at %s:%d\n", filename, fileline);
}
/*
-==================
-Mod_ForName
-
-Loads in a model for the given name
-==================
+a note on the cost of executing this function:
+per triangle: 188 (83 42 13 45 4 1)
+assignments: 83 (20 3 3 3 1 4 4 1 3 4 3 4 30)
+adds: 42 (2 2 2 2 3 2 2 27)
+subtracts: 13 (3 3 3 1 3)
+multiplies: 45 (6 3 6 6 3 3 6 6 6)
+rsqrts: 4 (1 1 1 1)
+compares: 1 (1)
+per vertex: 39 (12 6 18 3)
+assignments: 12 (4 4 4)
+adds: 6 (2 2 2)
+multiplies: 18 (6 6 6)
+rsqrts: 3 (1 1 1)
*/
-model_t *Mod_ForName (char *name, qboolean crash)
+
+void Mod_BuildTextureVectorsAndNormals(int numverts, int numtriangles, const float *vertex, const float *texcoord, const int *elements, float *svectors, float *tvectors, float *normals)
{
- model_t *mod;
-
- mod = Mod_FindName (name);
-
- return Mod_LoadModel (mod, crash);
+ int i, tnum, voffset;
+ float vert[3][4], vec[3][4], sdir[3], tdir[3], normal[3], f, *v;
+ const int *e;
+ // clear the vectors
+ memset(svectors, 0, numverts * sizeof(float[4]));
+ memset(tvectors, 0, numverts * sizeof(float[4]));
+ memset(normals, 0, numverts * sizeof(float[4]));
+ // process each vertex of each triangle and accumulate the results
+ for (tnum = 0, e = elements;tnum < numtriangles;tnum++, e += 3)
+ {
+ // calculate texture matrix for triangle
+ // 20 assignments
+ voffset = e[0] * 4;
+ vert[0][0] = vertex[voffset+0];
+ vert[0][1] = vertex[voffset+1];
+ vert[0][2] = vertex[voffset+2];
+ vert[0][3] = texcoord[voffset];
+ voffset = e[1] * 4;
+ vert[1][0] = vertex[voffset+0];
+ vert[1][1] = vertex[voffset+1];
+ vert[1][2] = vertex[voffset+2];
+ vert[1][3] = texcoord[voffset];
+ voffset = e[2] * 4;
+ vert[2][0] = vertex[voffset+0];
+ vert[2][1] = vertex[voffset+1];
+ vert[2][2] = vertex[voffset+2];
+ vert[2][3] = texcoord[voffset];
+ // 3 assignments, 3 subtracts
+ VectorSubtract(vert[1], vert[0], vec[0]);
+ // 3 assignments, 3 subtracts
+ VectorSubtract(vert[2], vert[0], vec[1]);
+ // 3 assignments, 3 subtracts, 6 multiplies
+ CrossProduct(vec[0], vec[1], normal);
+ // 1 assignment, 2 adds, 3 multiplies, 1 compare
+ if (DotProduct(normal, normal) >= 0.001)
+ {
+ // 4 assignments, 1 rsqrt, 2 adds, 6 multiplies
+ VectorNormalize(normal);
+ sdir[0] = (vert[1][3] - vert[0][3]) * (vert[2][0] - vert[0][0]) - (vert[2][3] - vert[0][3]) * (vert[1][0] - vert[0][0]);
+ sdir[1] = (vert[1][3] - vert[0][3]) * (vert[2][1] - vert[0][1]) - (vert[2][3] - vert[0][3]) * (vert[1][1] - vert[0][1]);
+ sdir[2] = (vert[1][3] - vert[0][3]) * (vert[2][2] - vert[0][2]) - (vert[2][3] - vert[0][3]) * (vert[1][2] - vert[0][2]);
+ // 4 assignments, 1 rsqrt, 2 adds, 6 multiplies
+ VectorNormalize(sdir);
+ // 1 assignments, 1 negates, 2 adds, 3 multiplies
+ f = -DotProduct(sdir, normal);
+ // 3 assignments, 3 adds, 3 multiplies
+ VectorMA(sdir, f, normal, sdir);
+ // 4 assignments, 1 rsqrt, 2 adds, 6 multiplies
+ VectorNormalize(sdir);
+ // 3 assignments, 3 subtracts, 6 multiplies
+ CrossProduct(sdir, normal, tdir);
+ // this is probably not necessary
+ // 4 assignments, 1 rsqrt, 2 adds, 6 multiplies
+ VectorNormalize(tdir);
+ // accumulate matrix onto verts used by triangle
+ // 30 assignments, 27 adds
+ for (i = 0;i < 3;i++)
+ {
+ voffset = e[i] * 4;
+ svectors[voffset ] += sdir[0];
+ svectors[voffset + 1] += sdir[1];
+ svectors[voffset + 2] += sdir[2];
+ tvectors[voffset ] += tdir[0];
+ tvectors[voffset + 1] += tdir[1];
+ tvectors[voffset + 2] += tdir[2];
+ normals[voffset ] += normal[0];
+ normals[voffset + 1] += normal[1];
+ normals[voffset + 2] += normal[2];
+ }
+ }
+ }
+ // now we could divide the vectors by the number of averaged values on
+ // each vertex... but instead normalize them
+ for (i = 0, v = svectors;i < numverts;i++, v += 4)
+ // 4 assignments, 1 rsqrt, 2 adds, 6 multiplies
+ VectorNormalize(v);
+ for (i = 0, v = tvectors;i < numverts;i++, v += 4)
+ // 4 assignments, 1 rsqrt, 2 adds, 6 multiplies
+ VectorNormalize(v);
+ for (i = 0, v = normals;i < numverts;i++, v += 4)
+ // 4 assignments, 1 rsqrt, 2 adds, 6 multiplies
+ VectorNormalize(v);
}
-byte *mod_base;
+shadowmesh_t *Mod_ShadowMesh_Alloc(mempool_t *mempool, int maxverts)
+{
+ shadowmesh_t *mesh;
+ mesh = Mem_Alloc(mempool, sizeof(shadowmesh_t) + maxverts * sizeof(float[4]) + maxverts * sizeof(int[3]) + maxverts * sizeof(int[3]) + SHADOWMESHVERTEXHASH * sizeof(shadowmeshvertexhash_t *) + maxverts * sizeof(shadowmeshvertexhash_t));
+ mesh->maxverts = maxverts;
+ mesh->maxtriangles = maxverts;
+ mesh->numverts = 0;
+ mesh->numtriangles = 0;
+ mesh->verts = (float *)(mesh + 1);
+ mesh->elements = (int *)(mesh->verts + mesh->maxverts * 4);
+ mesh->neighbors = (int *)(mesh->elements + mesh->maxtriangles * 3);
+ mesh->vertexhashtable = (shadowmeshvertexhash_t **)(mesh->neighbors + mesh->maxtriangles * 3);
+ mesh->vertexhashentries = (shadowmeshvertexhash_t *)(mesh->vertexhashtable + SHADOWMESHVERTEXHASH);
+ return mesh;
+}
-/*
-=================
-RadiusFromBounds
-=================
-*/
-float RadiusFromBounds (vec3_t mins, vec3_t maxs)
+shadowmesh_t *Mod_ShadowMesh_ReAlloc(mempool_t *mempool, shadowmesh_t *oldmesh)
{
- int i;
- vec3_t corner;
+ shadowmesh_t *newmesh;
+ newmesh = Mem_Alloc(mempool, sizeof(shadowmesh_t) + oldmesh->numverts * sizeof(float[4]) + oldmesh->numtriangles * sizeof(int[3]) + oldmesh->numtriangles * sizeof(int[3]));
+ newmesh->maxverts = newmesh->numverts = oldmesh->numverts;
+ newmesh->maxtriangles = newmesh->numtriangles = oldmesh->numtriangles;
+ newmesh->verts = (float *)(newmesh + 1);
+ newmesh->elements = (int *)(newmesh->verts + newmesh->maxverts * 4);
+ newmesh->neighbors = (int *)(newmesh->elements + newmesh->maxtriangles * 3);
+ memcpy(newmesh->verts, oldmesh->verts, newmesh->numverts * sizeof(float[4]));
+ memcpy(newmesh->elements, oldmesh->elements, newmesh->numtriangles * sizeof(int[3]));
+ memcpy(newmesh->neighbors, oldmesh->neighbors, newmesh->numtriangles * sizeof(int[3]));
+ return newmesh;
+}
- for (i=0 ; i<3 ; i++)
- corner[i] = fabs(mins[i]) > fabs(maxs[i]) ? fabs(mins[i]) : fabs(maxs[i]);
+int Mod_ShadowMesh_AddVertex(shadowmesh_t *mesh, float *v)
+{
+ int hashindex;
+ float *m;
+ shadowmeshvertexhash_t *hash;
+ // this uses prime numbers intentionally
+ hashindex = (int) (v[0] * 3 + v[1] * 5 + v[2] * 7) % SHADOWMESHVERTEXHASH;
+ for (hash = mesh->vertexhashtable[hashindex];hash;hash = hash->next)
+ {
+ m = mesh->verts + (hash - mesh->vertexhashentries) * 4;
+ if (m[0] == v[0] && m[1] == v[1] && m[2] == v[2])
+ return hash - mesh->vertexhashentries;
+ }
+ hash = mesh->vertexhashentries + mesh->numverts;
+ hash->next = mesh->vertexhashtable[hashindex];
+ mesh->vertexhashtable[hashindex] = hash;
+ m = mesh->verts + (hash - mesh->vertexhashentries) * 4;
+ VectorCopy(v, m);
+ mesh->numverts++;
+ return mesh->numverts - 1;
+}
- return Length (corner);
+void Mod_ShadowMesh_AddTriangle(mempool_t *mempool, shadowmesh_t *mesh, float *vert0, float *vert1, float *vert2)
+{
+ while (mesh->numverts + 3 > mesh->maxverts || mesh->numtriangles + 1 > mesh->maxtriangles)
+ {
+ if (mesh->next == NULL)
+ mesh->next = Mod_ShadowMesh_Alloc(mempool, max(mesh->maxtriangles, 1));
+ mesh = mesh->next;
+ }
+ mesh->elements[mesh->numtriangles * 3 + 0] = Mod_ShadowMesh_AddVertex(mesh, vert0);
+ mesh->elements[mesh->numtriangles * 3 + 1] = Mod_ShadowMesh_AddVertex(mesh, vert1);
+ mesh->elements[mesh->numtriangles * 3 + 2] = Mod_ShadowMesh_AddVertex(mesh, vert2);
+ mesh->numtriangles++;
}
-//=============================================================================
+void Mod_ShadowMesh_AddPolygon(mempool_t *mempool, shadowmesh_t *mesh, int numverts, float *verts)
+{
+ int i;
+ float *v;
+ for (i = 0, v = verts + 3;i < numverts - 2;i++, v += 3)
+ Mod_ShadowMesh_AddTriangle(mempool, mesh, verts, v, v + 3);
+ /*
+ int i, i1, i2, i3;
+ float *v;
+ while (mesh->numverts + numverts > mesh->maxverts || mesh->numtriangles + (numverts - 2) > mesh->maxtriangles)
+ {
+ if (mesh->next == NULL)
+ mesh->next = Mod_ShadowMesh_Alloc(mempool, max(mesh->maxtriangles, numverts));
+ mesh = mesh->next;
+ }
+ i1 = Mod_ShadowMesh_AddVertex(mesh, verts);
+ i2 = 0;
+ i3 = Mod_ShadowMesh_AddVertex(mesh, verts + 3);
+ for (i = 0, v = verts + 6;i < numverts - 2;i++, v += 3)
+ {
+ i2 = i3;
+ i3 = Mod_ShadowMesh_AddVertex(mesh, v);
+ mesh->elements[mesh->numtriangles * 3 + 0] = i1;
+ mesh->elements[mesh->numtriangles * 3 + 1] = i2;
+ mesh->elements[mesh->numtriangles * 3 + 2] = i3;
+ mesh->numtriangles++;
+ }
+ */
+}
-/*
-================
-Mod_Print
-================
-*/
-void Mod_Print (void)
+void Mod_ShadowMesh_AddMesh(mempool_t *mempool, shadowmesh_t *mesh, int numverts, float *verts, int numtris, int *elements)
{
- int i;
- model_t *mod;
+ int i;
+ for (i = 0;i < numtris;i++, elements += 3)
+ Mod_ShadowMesh_AddTriangle(mempool, mesh, verts + elements[0] * 4, verts + elements[1] * 4, verts + elements[2] * 4);
+}
- Con_Printf ("Cached models:\n");
- for (i=0, mod=mod_known ; i < mod_numknown ; i++, mod++)
+shadowmesh_t *Mod_ShadowMesh_Begin(mempool_t *mempool, int initialnumtriangles)
+{
+ return Mod_ShadowMesh_Alloc(mempool, initialnumtriangles);
+}
+
+shadowmesh_t *Mod_ShadowMesh_Finish(mempool_t *mempool, shadowmesh_t *firstmesh)
+{
+#if 1
+ //int i;
+ shadowmesh_t *mesh, *newmesh, *nextmesh;
+ // reallocate meshs to conserve space
+ for (mesh = firstmesh, firstmesh = NULL;mesh;mesh = nextmesh)
+ {
+ nextmesh = mesh->next;
+ if (mesh->numverts >= 3 && mesh->numtriangles >= 1)
+ {
+ newmesh = Mod_ShadowMesh_ReAlloc(mempool, mesh);
+ newmesh->next = firstmesh;
+ firstmesh = newmesh;
+ //Con_Printf("mesh\n");
+ //for (i = 0;i < newmesh->numtriangles;i++)
+ // Con_Printf("tri %d %d %d\n", newmesh->elements[i * 3 + 0], newmesh->elements[i * 3 + 1], newmesh->elements[i * 3 + 2]);
+ Mod_ValidateElements(newmesh->elements, newmesh->numtriangles, newmesh->numverts, __FILE__, __LINE__);
+ Mod_BuildTriangleNeighbors(newmesh->neighbors, newmesh->elements, newmesh->numtriangles);
+ }
+ Mem_Free(mesh);
+ }
+#else
+ shadowmesh_t *mesh;
+ for (mesh = firstmesh;mesh;mesh = mesh->next)
{
- Con_Printf ("%8p : %s\n",mod->cache.data, mod->name);
+ Mod_ValidateElements(mesh->elements, mesh->numtriangles, mesh->numverts, __FILE__, __LINE__);
+ Mod_BuildTriangleNeighbors(mesh->neighbors, mesh->elements, mesh->numtriangles);
}
+#endif
+ return firstmesh;
}
+void Mod_ShadowMesh_CalcBBox(shadowmesh_t *firstmesh, vec3_t mins, vec3_t maxs, vec3_t center, float *radius)
+{
+ int i;
+ shadowmesh_t *mesh;
+ vec3_t nmins, nmaxs, ncenter, temp;
+ float nradius2, dist2, *v;
+ // calculate bbox
+ for (mesh = firstmesh;mesh;mesh = mesh->next)
+ {
+ if (mesh == firstmesh)
+ {
+ VectorCopy(mesh->verts, nmins);
+ VectorCopy(mesh->verts, nmaxs);
+ }
+ for (i = 0, v = mesh->verts;i < mesh->numverts;i++, v += 4)
+ {
+ if (nmins[0] > v[0]) nmins[0] = v[0];if (nmaxs[0] < v[0]) nmaxs[0] = v[0];
+ if (nmins[1] > v[1]) nmins[1] = v[1];if (nmaxs[1] < v[1]) nmaxs[1] = v[1];
+ if (nmins[2] > v[2]) nmins[2] = v[2];if (nmaxs[2] < v[2]) nmaxs[2] = v[2];
+ }
+ }
+ // calculate center and radius
+ ncenter[0] = (nmins[0] + nmaxs[0]) * 0.5f;
+ ncenter[1] = (nmins[1] + nmaxs[1]) * 0.5f;
+ ncenter[2] = (nmins[2] + nmaxs[2]) * 0.5f;
+ nradius2 = 0;
+ for (mesh = firstmesh;mesh;mesh = mesh->next)
+ {
+ for (i = 0, v = mesh->verts;i < mesh->numverts;i++, v += 4)
+ {
+ VectorSubtract(v, ncenter, temp);
+ dist2 = DotProduct(temp, temp);
+ if (nradius2 < dist2)
+ nradius2 = dist2;
+ }
+ }
+ // return data
+ if (mins)
+ VectorCopy(nmins, mins);
+ if (maxs)
+ VectorCopy(nmaxs, maxs);
+ if (center)
+ VectorCopy(ncenter, center);
+ if (radius)
+ *radius = sqrt(nradius2);
+}
+void Mod_ShadowMesh_Free(shadowmesh_t *mesh)
+{
+ shadowmesh_t *nextmesh;
+ for (;mesh;mesh = nextmesh)
+ {
+ nextmesh = mesh->next;
+ Mem_Free(mesh);
+ }
+}
projects / xonotic / darkplaces.git / blobdiff