*/
#include "quakedef.h"
+#include "image.h"
+#include "r_shadow.h"
// note: model_shared.c sets up r_notexture, and r_surf_notexture
cvar_t r_nosurftextures = {0, "r_nosurftextures", "0"};
cvar_t r_sortsurfaces = {0, "r_sortsurfaces", "0"};
-#define NUM_DETAILTEXTURES 1
-static rtexture_t *detailtextures[NUM_DETAILTEXTURES];
-static rtexturepool_t *detailtexturepool;
-
/*
===============
Mod_BrushInit
memset(mod_novis, 0xff, sizeof(mod_novis));
}
-void Mod_BrushStartup (void)
-{
- int i, x, y, light;
- float vc[3], vx[3], vy[3], vn[3], lightdir[3];
-#define DETAILRESOLUTION 256
- qbyte data[DETAILRESOLUTION][DETAILRESOLUTION][4], noise[DETAILRESOLUTION][DETAILRESOLUTION];
- detailtexturepool = R_AllocTexturePool();
- lightdir[0] = 0.5;
- lightdir[1] = 1;
- lightdir[2] = -0.25;
- VectorNormalize(lightdir);
- for (i = 0;i < NUM_DETAILTEXTURES;i++)
- {
- fractalnoise(&noise[0][0], DETAILRESOLUTION, DETAILRESOLUTION >> 4);
- for (y = 0;y < DETAILRESOLUTION;y++)
- {
- for (x = 0;x < DETAILRESOLUTION;x++)
- {
- vc[0] = x;
- vc[1] = y;
- vc[2] = noise[y][x] * (1.0f / 32.0f);
- vx[0] = x + 1;
- vx[1] = y;
- vx[2] = noise[y][(x + 1) % DETAILRESOLUTION] * (1.0f / 32.0f);
- vy[0] = x;
- vy[1] = y + 1;
- vy[2] = noise[(y + 1) % DETAILRESOLUTION][x] * (1.0f / 32.0f);
- VectorSubtract(vx, vc, vx);
- VectorSubtract(vy, vc, vy);
- CrossProduct(vx, vy, vn);
- VectorNormalize(vn);
- light = 128 - DotProduct(vn, lightdir) * 128;
- light = bound(0, light, 255);
- data[y][x][0] = data[y][x][1] = data[y][x][2] = light;
- data[y][x][3] = 255;
- }
- }
- detailtextures[i] = R_LoadTexture(detailtexturepool, va("detailtexture%i", i), DETAILRESOLUTION, DETAILRESOLUTION, &data[0][0][0], TEXTYPE_RGBA, TEXF_MIPMAP | TEXF_PRECACHE);
- }
-}
-
-void Mod_BrushShutdown (void)
-{
- int i;
- for (i = 0;i < NUM_DETAILTEXTURES;i++)
- R_FreeTexture(detailtextures[i]);
- R_FreeTexturePool(&detailtexturepool);
-}
-
/*
===============
Mod_PointInLeaf
return ((mleaf_t *)node)->contents;
}
-void Mod_FindNonSolidLocation(vec3_t pos, model_t *mod)
+typedef struct findnonsolidlocationinfo_s
+{
+ vec3_t center;
+ vec_t radius;
+ vec3_t nudge;
+ vec_t bestdist;
+ model_t *model;
+}
+findnonsolidlocationinfo_t;
+
+#if 0
+extern cvar_t samelevel;
+#endif
+void Mod_FindNonSolidLocation_r_Leaf(findnonsolidlocationinfo_t *info, mleaf_t *leaf)
+{
+ int i, surfnum, k, *tri, *mark;
+ float dist, f, vert[3][3], edge[3][3], facenormal[3], edgenormal[3][3], point[3];
+#if 0
+ float surfnormal[3];
+#endif
+ msurface_t *surf;
+ surfmesh_t *mesh;
+ for (surfnum = 0, mark = leaf->firstmarksurface;surfnum < leaf->nummarksurfaces;surfnum++, mark++)
+ {
+ surf = info->model->surfaces + *mark;
+ if (surf->flags & SURF_SOLIDCLIP)
+ {
+#if 0
+ VectorCopy(surf->plane->normal, surfnormal);
+ if (surf->flags & SURF_PLANEBACK)
+ VectorNegate(surfnormal, surfnormal);
+#endif
+ for (mesh = surf->mesh;mesh;mesh = mesh->chain)
+ {
+ for (k = 0;k < mesh->numtriangles;k++)
+ {
+ tri = mesh->element3i + k * 3;
+ VectorCopy((mesh->vertex3f + tri[0] * 3), vert[0]);
+ VectorCopy((mesh->vertex3f + tri[1] * 3), vert[1]);
+ VectorCopy((mesh->vertex3f + tri[2] * 3), vert[2]);
+ VectorSubtract(vert[1], vert[0], edge[0]);
+ VectorSubtract(vert[2], vert[1], edge[1]);
+ CrossProduct(edge[1], edge[0], facenormal);
+ if (facenormal[0] || facenormal[1] || facenormal[2])
+ {
+ VectorNormalize(facenormal);
+#if 0
+ if (VectorDistance(facenormal, surfnormal) > 0.01f)
+ Con_Printf("a2! %f %f %f != %f %f %f\n", facenormal[0], facenormal[1], facenormal[2], surfnormal[0], surfnormal[1], surfnormal[2]);
+#endif
+ f = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
+ if (f <= info->bestdist && f >= -info->bestdist)
+ {
+ VectorSubtract(vert[0], vert[2], edge[2]);
+ VectorNormalize(edge[0]);
+ VectorNormalize(edge[1]);
+ VectorNormalize(edge[2]);
+ CrossProduct(facenormal, edge[0], edgenormal[0]);
+ CrossProduct(facenormal, edge[1], edgenormal[1]);
+ CrossProduct(facenormal, edge[2], edgenormal[2]);
+#if 0
+ if (samelevel.integer & 1)
+ VectorNegate(edgenormal[0], edgenormal[0]);
+ if (samelevel.integer & 2)
+ VectorNegate(edgenormal[1], edgenormal[1]);
+ if (samelevel.integer & 4)
+ VectorNegate(edgenormal[2], edgenormal[2]);
+ for (i = 0;i < 3;i++)
+ if (DotProduct(vert[0], edgenormal[i]) > DotProduct(vert[i], edgenormal[i]) + 0.1f
+ || DotProduct(vert[1], edgenormal[i]) > DotProduct(vert[i], edgenormal[i]) + 0.1f
+ || DotProduct(vert[2], edgenormal[i]) > DotProduct(vert[i], edgenormal[i]) + 0.1f)
+ Con_Printf("a! %i : %f %f %f (%f %f %f)\n", i, edgenormal[i][0], edgenormal[i][1], edgenormal[i][2], facenormal[0], facenormal[1], facenormal[2]);
+#endif
+ // face distance
+ if (DotProduct(info->center, edgenormal[0]) < DotProduct(vert[0], edgenormal[0])
+ && DotProduct(info->center, edgenormal[1]) < DotProduct(vert[1], edgenormal[1])
+ && DotProduct(info->center, edgenormal[2]) < DotProduct(vert[2], edgenormal[2]))
+ {
+ // we got lucky, the center is within the face
+ dist = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
+ if (dist < 0)
+ {
+ dist = -dist;
+ if (info->bestdist > dist)
+ {
+ info->bestdist = dist;
+ VectorScale(facenormal, (info->radius - -dist), info->nudge);
+ }
+ }
+ else
+ {
+ if (info->bestdist > dist)
+ {
+ info->bestdist = dist;
+ VectorScale(facenormal, (info->radius - dist), info->nudge);
+ }
+ }
+ }
+ else
+ {
+ // check which edge or vertex the center is nearest
+ for (i = 0;i < 3;i++)
+ {
+ f = DotProduct(info->center, edge[i]);
+ if (f >= DotProduct(vert[0], edge[i])
+ && f <= DotProduct(vert[1], edge[i]))
+ {
+ // on edge
+ VectorMA(info->center, -f, edge[i], point);
+ dist = sqrt(DotProduct(point, point));
+ if (info->bestdist > dist)
+ {
+ info->bestdist = dist;
+ VectorScale(point, (info->radius / dist), info->nudge);
+ }
+ // skip both vertex checks
+ // (both are further away than this edge)
+ i++;
+ }
+ else
+ {
+ // not on edge, check first vertex of edge
+ VectorSubtract(info->center, vert[i], point);
+ dist = sqrt(DotProduct(point, point));
+ if (info->bestdist > dist)
+ {
+ info->bestdist = dist;
+ VectorScale(point, (info->radius / dist), info->nudge);
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+}
+
+void Mod_FindNonSolidLocation_r(findnonsolidlocationinfo_t *info, mnode_t *node)
{
- if (Mod_PointContents(pos, mod) != CONTENTS_SOLID) return;
- pos[0]-=1;if (Mod_PointContents(pos, mod) != CONTENTS_SOLID) return;
- pos[0]+=2;if (Mod_PointContents(pos, mod) != CONTENTS_SOLID) return;
- pos[0]-=1;
- pos[1]-=1;if (Mod_PointContents(pos, mod) != CONTENTS_SOLID) return;
- pos[1]+=2;if (Mod_PointContents(pos, mod) != CONTENTS_SOLID) return;
- pos[1]-=1;
- pos[2]-=1;if (Mod_PointContents(pos, mod) != CONTENTS_SOLID) return;
- pos[2]+=2;if (Mod_PointContents(pos, mod) != CONTENTS_SOLID) return;
- pos[2]-=1;
+ if (node->contents)
+ {
+ if (((mleaf_t *)node)->nummarksurfaces)
+ Mod_FindNonSolidLocation_r_Leaf(info, (mleaf_t *)node);
+ }
+ else
+ {
+ float f = PlaneDiff(info->center, node->plane);
+ if (f >= -info->bestdist)
+ Mod_FindNonSolidLocation_r(info, node->children[0]);
+ if (f <= info->bestdist)
+ Mod_FindNonSolidLocation_r(info, node->children[1]);
+ }
}
+void Mod_FindNonSolidLocation(vec3_t in, vec3_t out, model_t *model, float radius)
+{
+ int i;
+ findnonsolidlocationinfo_t info;
+ if (model == NULL)
+ {
+ VectorCopy(in, out);
+ return;
+ }
+ VectorCopy(in, info.center);
+ info.radius = radius;
+ info.model = model;
+ i = 0;
+ do
+ {
+ VectorClear(info.nudge);
+ info.bestdist = radius;
+ Mod_FindNonSolidLocation_r(&info, model->nodes + model->hulls[0].firstclipnode);
+ VectorAdd(info.center, info.nudge, info.center);
+ }
+ while(info.bestdist < radius && ++i < 10);
+ VectorCopy(info.center, out);
+}
/*
===================
miptex_t *dmiptex;
texture_t *tx, *tx2, *anims[10], *altanims[10];
dmiptexlump_t *m;
- qbyte *data, *mtdata, *data2;
+ qbyte *data, *mtdata;
char name[256];
loadmodel->textures = NULL;
// fill out all slots with notexture
for (i = 0, tx = loadmodel->textures;i < loadmodel->numtextures;i++, tx++)
{
+ tx->number = i;
+ strcpy(tx->name, "NO TEXTURE FOUND");
tx->width = 16;
tx->height = 16;
- tx->texture = r_notexture;
+ tx->skin.base = r_notexture;
tx->shader = &Cshader_wall_lightmap;
+ tx->flags = SURF_SOLIDCLIP;
if (i == loadmodel->numtextures - 1)
{
- tx->flags = SURF_DRAWTURB | SURF_LIGHTBOTHSIDES;
+ tx->flags |= SURF_DRAWTURB | SURF_LIGHTBOTHSIDES;
tx->shader = &Cshader_water;
}
+ tx->currentframe = tx;
}
// just to work around bounds checking when debugging with it (array index out of bounds error thing)
{
if (image_width == 256 && image_height == 128)
{
- R_InitSky (data, 4);
+ R_InitSky (data, 4);
Mem_Free(data);
}
else
R_InitSky (mtdata, 1);
}
}
- else if ((tx->texture = loadtextureimagewithmask(loadmodel->texturepool, tx->name, 0, 0, false, true, true)))
- {
- tx->fogtexture = image_masktex;
- strcpy(name, tx->name);
- strcat(name, "_glow");
- tx->glowtexture = loadtextureimage(loadmodel->texturepool, name, 0, 0, false, true, true);
- }
else
{
- if (loadmodel->ishlbsp)
- {
- if (mtdata && (data = W_ConvertWAD3Texture(dmiptex)))
- {
- // texture included
- tx->texture = R_LoadTexture (loadmodel->texturepool, tx->name, image_width, image_height, data, TEXTYPE_RGBA, TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE);
- if (R_TextureHasAlpha(tx->texture))
- {
- // make mask texture
- for (j = 0;j < image_width * image_height;j++)
- data[j*4+0] = data[j*4+1] = data[j*4+2] = 255;
- strcpy(name, tx->name);
- strcat(name, "_fog");
- tx->fogtexture = R_LoadTexture (loadmodel->texturepool, name, image_width, image_height, data, TEXTYPE_RGBA, TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE);
- }
- Mem_Free(data);
- }
- else if ((data = W_GetTexture(tx->name)))
- {
- // get the size from the wad texture
- tx->width = image_width;
- tx->height = image_height;
- tx->texture = R_LoadTexture (loadmodel->texturepool, tx->name, image_width, image_height, data, TEXTYPE_RGBA, TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE);
- if (R_TextureHasAlpha(tx->texture))
- {
- // make mask texture
- for (j = 0;j < image_width * image_height;j++)
- data[j*4+0] = data[j*4+1] = data[j*4+2] = 255;
- strcpy(name, tx->name);
- strcat(name, "_fog");
- tx->fogtexture = R_LoadTexture (loadmodel->texturepool, name, image_width, image_height, data, TEXTYPE_RGBA, TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE);
- }
- Mem_Free(data);
- }
- else
- {
- tx->width = 16;
- tx->height = 16;
- tx->texture = r_notexture;
- }
- }
- else
+ if (!Mod_LoadSkinFrame(&tx->skin, tx->name, TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE, false, true, true))
{
- if (mtdata) // texture included
+ // did not find external texture, load it from the bsp or wad3
+ if (loadmodel->ishlbsp)
{
- int fullbrights;
- data = mtdata;
- fullbrights = false;
- if (r_fullbrights.value && tx->name[0] != '*')
+ // internal texture overrides wad
+ qbyte *pixels, *freepixels, *fogpixels;
+ pixels = freepixels = NULL;
+ if (mtdata)
+ pixels = W_ConvertWAD3Texture(dmiptex);
+ if (pixels == NULL)
+ pixels = freepixels = W_GetTexture(tx->name);
+ if (pixels != NULL)
{
- for (j = 0;j < tx->width*tx->height;j++)
+ tx->width = image_width;
+ tx->height = image_height;
+ tx->skin.base = tx->skin.merged = R_LoadTexture2D(loadmodel->texturepool, tx->name, image_width, image_height, pixels, TEXTYPE_RGBA, TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE, NULL);
+ if (Image_CheckAlpha(pixels, image_width * image_height, true))
{
- if (data[j] >= 224) // fullbright
+ fogpixels = Mem_Alloc(tempmempool, image_width * image_height * 4);
+ for (j = 0;j < image_width * image_height * 4;j += 4)
{
- fullbrights = true;
- break;
+ fogpixels[j + 0] = 255;
+ fogpixels[j + 1] = 255;
+ fogpixels[j + 2] = 255;
+ fogpixels[j + 3] = pixels[j + 3];
}
+ tx->skin.fog = R_LoadTexture2D(loadmodel->texturepool, tx->name, image_width, image_height, pixels, TEXTYPE_RGBA, TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE, NULL);
+ Mem_Free(fogpixels);
}
}
- if (fullbrights)
- {
- data2 = Mem_Alloc(loadmodel->mempool, tx->width*tx->height);
- for (j = 0;j < tx->width*tx->height;j++)
- data2[j] = data[j] >= 224 ? 0 : data[j]; // no fullbrights
- tx->texture = R_LoadTexture (loadmodel->texturepool, tx->name, tx->width, tx->height, data2, TEXTYPE_QPALETTE, TEXF_MIPMAP | TEXF_PRECACHE);
- strcpy(name, tx->name);
- strcat(name, "_glow");
- for (j = 0;j < tx->width*tx->height;j++)
- data2[j] = data[j] >= 224 ? data[j] : 0; // only fullbrights
- tx->glowtexture = R_LoadTexture (loadmodel->texturepool, name, tx->width, tx->height, data2, TEXTYPE_QPALETTE, TEXF_MIPMAP | TEXF_PRECACHE);
- Mem_Free(data2);
- }
- else
- tx->texture = R_LoadTexture (loadmodel->texturepool, tx->name, tx->width, tx->height, data, TEXTYPE_QPALETTE, TEXF_MIPMAP | TEXF_PRECACHE);
- }
- else // no texture, and no external replacement texture was found
- {
- tx->width = 16;
- tx->height = 16;
- tx->texture = r_notexture;
+ if (freepixels)
+ Mem_Free(freepixels);
}
+ else if (mtdata) // texture included
+ Mod_LoadSkinFrame_Internal(&tx->skin, tx->name, TEXF_MIPMAP | TEXF_PRECACHE, false, true, tx->name[0] != '*' && r_fullbrights.integer, mtdata, tx->width, tx->height);
}
}
+ if (tx->skin.base == NULL)
+ {
+ // no texture found
+ tx->width = 16;
+ tx->height = 16;
+ tx->skin.base = r_notexture;
+ }
if (tx->name[0] == '*')
{
+ // turb does not block movement
+ tx->flags &= ~SURF_SOLIDCLIP;
tx->flags |= SURF_DRAWTURB | SURF_LIGHTBOTHSIDES;
// LordHavoc: some turbulent textures should be fullbright and solid
if (!strncmp(tx->name,"*lava",5)
|| !strncmp(tx->name,"*teleport",9)
|| !strncmp(tx->name,"*rift",5)) // Scourge of Armagon texture
tx->flags |= SURF_DRAWFULLBRIGHT | SURF_DRAWNOALPHA;
+ else
+ tx->flags |= SURF_WATERALPHA;
tx->shader = &Cshader_water;
}
else if (tx->name[0] == 's' && tx->name[1] == 'k' && tx->name[2] == 'y')
else
{
tx->flags |= SURF_LIGHTMAP;
- if (!tx->fogtexture)
- tx->flags |= SURF_CLIPSOLID;
+ if (!tx->skin.fog)
+ tx->flags |= SURF_SHADOWCAST | SURF_SHADOWLIGHT;
tx->shader = &Cshader_wall_lightmap;
}
- tx->detailtexture = detailtextures[i % NUM_DETAILTEXTURES];
+ // start out with no animation
+ tx->currentframe = tx;
}
// sequence the animations
{
// LordHavoc: hope is not lost yet, check for a .lit file to load
strcpy(litfilename, loadmodel->name);
- COM_StripExtension(litfilename, litfilename);
+ FS_StripExtension(litfilename, litfilename);
strcat(litfilename, ".lit");
- data = (qbyte*) COM_LoadFile (litfilename, false);
+ data = (qbyte*) FS_LoadFile (litfilename, false);
if (data)
{
- if (loadsize > 8 && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
+ if (fs_filesize > 8 && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
{
i = LittleLong(((int *)data)[1]);
if (i == 1)
{
- Con_DPrintf("%s loaded", litfilename);
- loadmodel->lightdata = Mem_Alloc(loadmodel->mempool, loadsize - 8);
- memcpy(loadmodel->lightdata, data + 8, loadsize - 8);
+ Con_DPrintf("loaded %s\n", litfilename);
+ loadmodel->lightdata = Mem_Alloc(loadmodel->mempool, fs_filesize - 8);
+ memcpy(loadmodel->lightdata, data + 8, fs_filesize - 8);
Mem_Free(data);
return;
}
}
else
{
- if (loadsize == 8)
+ if (fs_filesize == 8)
Con_Printf("Empty .lit file, ignoring\n");
else
Con_Printf("Corrupt .lit file (old version?), ignoring\n");
mlight_t *e;
strcpy(lightsfilename, loadmodel->name);
- COM_StripExtension(lightsfilename, lightsfilename);
+ FS_StripExtension(lightsfilename, lightsfilename);
strcat(lightsfilename, ".lights");
- s = lightsstring = (char *) COM_LoadFile (lightsfilename, false);
+ s = lightsstring = (char *) FS_LoadFile (lightsfilename, false);
if (s)
{
numlights = 0;
}
}
-
-
/*
-// svbspmesh_t is in model_brush.h
-
-typedef struct svbsppolygon_s
-{
- struct svbsppolygon_s *next;
- int numverts;
- float *verts;
- float normal[3], dist;
-}
-svbsppolygon_t;
-
-typedef struct svbspnode_s
-{
- // true if this is a leaf (has no children), not a node
- int isleaf;
- // (shared) parent node
- struct svbspnode_s *parent;
- // (leaf) dark or lit leaf
- int dark;
- // (leaf) polygons bounding this leaf
- svbsppolygon_t *polygons;
- // (node) children
- struct svbspnode_s *children[2];
- // (node) splitting plane
- float normal[3], dist;
-}
-svbspnode_t;
-
-svbspnode_t *Mod_SVBSP_AllocNode(svbspnode_t *parent, svbspnode_t *child0, svbspnode_t *child1, float *normal, float dist)
-{
- svbspnode_t *node;
- node = Mem_Alloc(loadmodel->mempool, sizeof(svbspnode_t));
- node->parent = parent;
- node->children[0] = child0;
- node->children[1] = child1;
- VectorCopy(normal, node->normal);
- node->dist = dist;
- return node;
-}
-
-svbspnode_t *Mod_SVBSP_AllocLeaf(svbspnode_t *parent, int dark)
-{
- svbspnode_t *leaf;
- leaf = Mem_Alloc(loadmodel->mempool, sizeof(svbspnode_t));
- leaf->isleaf = true;
- leaf->parent = parent;
- leaf->dark = dark;
- return leaf;
-}
-
-svbspnode_t *Mod_SVBSP_NewTree(void)
-{
- return Mod_SVBSP_AllocLeaf(NULL, false);
-}
-
-void Mod_SVBSP_FreeTree(svbspnode_t *node)
-{
- if (!node->isleaf)
- {
- Mod_SVBSP_FreeTree(node->children[0]);
- Mod_SVBSP_FreeTree(node->children[1]);
- }
- Mem_Free(node);
-}
-
-void Mod_SVBSP_RecursiveAddPolygon(svbspnode_t *node, int numverts, float *verts, float *normal, float dist, int constructmode)
+static int castshadowcount = 0;
+void Mod_ProcessLightList(void)
{
- int i, j, numvertsfront, numvertsback, maxverts, counts[3];
- float *vertsfront, *vertsback, *v, d, temp[3];
- float dists[4096];
- qbyte sides[4096];
- svbsppolygon_t *poly;
- if (node->isleaf)
+ int j, k, l, *mark, lnum;
+ mlight_t *e;
+ msurface_t *surf;
+ float dist;
+ mleaf_t *leaf;
+ qbyte *pvs;
+ vec3_t temp;
+ float *v, radius2;
+ for (lnum = 0, e = loadmodel->lights;lnum < loadmodel->numlights;lnum++, e++)
{
- if (constructmode == 0)
+ e->cullradius2 = DotProduct(e->light, e->light) / (e->falloff * e->falloff * 8192.0f * 8192.0f * 2.0f * 2.0f);// + 4096.0f;
+ if (e->cullradius2 > 4096.0f * 4096.0f)
+ e->cullradius2 = 4096.0f * 4096.0f;
+ e->cullradius = e->lightradius = sqrt(e->cullradius2);
+ leaf = Mod_PointInLeaf(e->origin, loadmodel);
+ if (leaf->compressed_vis)
+ pvs = Mod_DecompressVis (leaf->compressed_vis, loadmodel);
+ else
+ pvs = mod_novis;
+ for (j = 0;j < loadmodel->numsurfaces;j++)
+ loadmodel->surfacevisframes[j] = -1;
+ for (j = 0, leaf = loadmodel->leafs + 1;j < loadmodel->numleafs - 1;j++, leaf++)
{
- // construct tree structure
- node->isleaf = false;
- node->children[0] = Mod_SVBSP_AllocLeaf(node, false);
- node->children[1] = Mod_SVBSP_AllocLeaf(node, false);
- VectorCopy(normal, node->normal);
- node->dist = dist;
+ if (pvs[j >> 3] & (1 << (j & 7)))
+ {
+ for (k = 0, mark = leaf->firstmarksurface;k < leaf->nummarksurfaces;k++, mark++)
+ {
+ surf = loadmodel->surfaces + *mark;
+ if (surf->number != *mark)
+ Con_Printf("%d != %d\n", surf->number, *mark);
+ dist = DotProduct(e->origin, surf->plane->normal) - surf->plane->dist;
+ if (surf->flags & SURF_PLANEBACK)
+ dist = -dist;
+ if (dist > 0 && dist < e->cullradius)
+ {
+ temp[0] = bound(surf->poly_mins[0], e->origin[0], surf->poly_maxs[0]) - e->origin[0];
+ temp[1] = bound(surf->poly_mins[1], e->origin[1], surf->poly_maxs[1]) - e->origin[1];
+ temp[2] = bound(surf->poly_mins[2], e->origin[2], surf->poly_maxs[2]) - e->origin[2];
+ if (DotProduct(temp, temp) < lightradius2)
+ loadmodel->surfacevisframes[*mark] = -2;
+ }
+ }
+ }
}
- else if (constructmode == 1)
+ // build list of light receiving surfaces
+ e->numsurfaces = 0;
+ for (j = 0;j < loadmodel->numsurfaces;j++)
+ if (loadmodel->surfacevisframes[j] == -2)
+ e->numsurfaces++;
+ e->surfaces = NULL;
+ if (e->numsurfaces > 0)
{
- // mark dark leafs
- node->dark = true;
+ e->surfaces = Mem_Alloc(loadmodel->mempool, sizeof(msurface_t *) * e->numsurfaces);
+ e->numsurfaces = 0;
+ for (j = 0;j < loadmodel->numsurfaces;j++)
+ if (loadmodel->surfacevisframes[j] == -2)
+ e->surfaces[e->numsurfaces++] = loadmodel->surfaces + j;
}
- else
+ // find bounding box and sphere of lit surfaces
+ // (these will be used for creating a shape to clip the light)
+ radius2 = 0;
+ for (j = 0;j < e->numsurfaces;j++)
{
- // link polygons into lit leafs only (this is the optimization)
- if (!node->dark)
+ surf = e->surfaces[j];
+ if (j == 0)
+ {
+ VectorCopy(surf->poly_verts, e->mins);
+ VectorCopy(surf->poly_verts, e->maxs);
+ }
+ for (k = 0, v = surf->poly_verts;k < surf->poly_numverts;k++, v += 3)
{
- poly = Mem_Alloc(loadmodel->mempool, sizeof(svbsppolygon_t) + numverts * sizeof(float[3]));
- poly->numverts = numverts;
- poly->verts = (float *)(poly + 1);
- VectorCopy(normal, poly->normal);
- poly->dist = dist;
- memcpy(poly->verts, verts, numverts * sizeof(float[3]));
- poly->next = node->polygons;
- node->polygons = poly;
+ if (e->mins[0] > v[0]) e->mins[0] = v[0];if (e->maxs[0] < v[0]) e->maxs[0] = v[0];
+ if (e->mins[1] > v[1]) e->mins[1] = v[1];if (e->maxs[1] < v[1]) e->maxs[1] = v[1];
+ if (e->mins[2] > v[2]) e->mins[2] = v[2];if (e->maxs[2] < v[2]) e->maxs[2] = v[2];
+ VectorSubtract(v, e->origin, temp);
+ dist = DotProduct(temp, temp);
+ if (radius2 < dist)
+ radius2 = dist;
}
}
- }
- else
- {
- counts[SIDE_FRONT] = counts[SIDE_BACK] = counts[SIDE_ON] = 0;
- for (i = 0, v = verts;i < numverts;i++, v += 3)
+ if (e->cullradius2 > radius2)
{
- dists[i] = DotProduct(v, node->normal) - node->dist;
- if (dists[i] >= 0.1)
- sides[i] = SIDE_FRONT;
- else if (dists[i] <= -0.1)
- sides[i] = SIDE_BACK;
- else
- sides[i] = SIDE_ON;
- counts[sides[i]]++;
- }
- if (counts[SIDE_FRONT] && counts[SIDE_BACK])
- {
- // some front, some back... sliced
- numvertsfront = 0;
- numvertsback = 0;
- // this is excessive, but nice for safety...
- maxverts = numverts + 4;
- vertsfront = Mem_Alloc(loadmodel->mempool, maxverts * sizeof(float[3]));
- vertsback = Mem_Alloc(loadmodel->mempool, maxverts * sizeof(float[3]));
- for (i = 0, j = numverts - 1;i < numverts;j = i, i++)
+ e->cullradius2 = radius2;
+ e->cullradius = sqrt(e->cullradius2);
+ }
+ if (e->mins[0] < e->origin[0] - e->lightradius) e->mins[0] = e->origin[0] - e->lightradius;
+ if (e->maxs[0] > e->origin[0] + e->lightradius) e->maxs[0] = e->origin[0] + e->lightradius;
+ if (e->mins[1] < e->origin[1] - e->lightradius) e->mins[1] = e->origin[1] - e->lightradius;
+ if (e->maxs[1] > e->origin[1] + e->lightradius) e->maxs[1] = e->origin[1] + e->lightradius;
+ if (e->mins[2] < e->origin[2] - e->lightradius) e->mins[2] = e->origin[2] - e->lightradius;
+ if (e->maxs[2] > e->origin[2] + e->lightradius) e->maxs[2] = e->origin[2] + e->lightradius;
+ // clip shadow volumes against eachother to remove unnecessary
+ // polygons (and sections of polygons)
+ {
+ //vec3_t polymins, polymaxs;
+ int maxverts = 4;
+ float *verts = Mem_Alloc(loadmodel->mempool, maxverts * sizeof(float[3]));
+ float f, *v0, *v1, projectdistance;
+
+ e->shadowvolume = Mod_ShadowMesh_Begin(loadmodel->mempool, 1024);
+#if 0
{
- if (sides[j] == SIDE_FRONT)
+ vec3_t outermins, outermaxs, innermins, innermaxs;
+ innermins[0] = e->mins[0] - 1;
+ innermins[1] = e->mins[1] - 1;
+ innermins[2] = e->mins[2] - 1;
+ innermaxs[0] = e->maxs[0] + 1;
+ innermaxs[1] = e->maxs[1] + 1;
+ innermaxs[2] = e->maxs[2] + 1;
+ outermins[0] = loadmodel->normalmins[0] - 1;
+ outermins[1] = loadmodel->normalmins[1] - 1;
+ outermins[2] = loadmodel->normalmins[2] - 1;
+ outermaxs[0] = loadmodel->normalmaxs[0] + 1;
+ outermaxs[1] = loadmodel->normalmaxs[1] + 1;
+ outermaxs[2] = loadmodel->normalmaxs[2] + 1;
+ // add bounding box around the whole shadow volume set,
+ // facing inward to limit light area, with an outer bounding box
+ // facing outward (this is needed by the shadow rendering method)
+ // X major
+ verts[ 0] = innermaxs[0];verts[ 1] = innermins[1];verts[ 2] = innermaxs[2];
+ verts[ 3] = innermaxs[0];verts[ 4] = innermins[1];verts[ 5] = innermins[2];
+ verts[ 6] = innermaxs[0];verts[ 7] = innermaxs[1];verts[ 8] = innermins[2];
+ verts[ 9] = innermaxs[0];verts[10] = innermaxs[1];verts[11] = innermaxs[2];
+ Mod_ShadowMesh_AddPolygon(loadmodel->mempool, e->shadowvolume, 4, verts);
+ verts[ 0] = outermaxs[0];verts[ 1] = outermaxs[1];verts[ 2] = outermaxs[2];
+ verts[ 3] = outermaxs[0];verts[ 4] = outermaxs[1];verts[ 5] = outermins[2];
+ verts[ 6] = outermaxs[0];verts[ 7] = outermins[1];verts[ 8] = outermins[2];
+ verts[ 9] = outermaxs[0];verts[10] = outermins[1];verts[11] = outermaxs[2];
+ Mod_ShadowMesh_AddPolygon(loadmodel->mempool, e->shadowvolume, 4, verts);
+ // X minor
+ verts[ 0] = innermins[0];verts[ 1] = innermaxs[1];verts[ 2] = innermaxs[2];
+ verts[ 3] = innermins[0];verts[ 4] = innermaxs[1];verts[ 5] = innermins[2];
+ verts[ 6] = innermins[0];verts[ 7] = innermins[1];verts[ 8] = innermins[2];
+ verts[ 9] = innermins[0];verts[10] = innermins[1];verts[11] = innermaxs[2];
+ Mod_ShadowMesh_AddPolygon(loadmodel->mempool, e->shadowvolume, 4, verts);
+ verts[ 0] = outermins[0];verts[ 1] = outermins[1];verts[ 2] = outermaxs[2];
+ verts[ 3] = outermins[0];verts[ 4] = outermins[1];verts[ 5] = outermins[2];
+ verts[ 6] = outermins[0];verts[ 7] = outermaxs[1];verts[ 8] = outermins[2];
+ verts[ 9] = outermins[0];verts[10] = outermaxs[1];verts[11] = outermaxs[2];
+ Mod_ShadowMesh_AddPolygon(loadmodel->mempool, e->shadowvolume, 4, verts);
+ // Y major
+ verts[ 0] = innermaxs[0];verts[ 1] = innermaxs[1];verts[ 2] = innermaxs[2];
+ verts[ 3] = innermaxs[0];verts[ 4] = innermaxs[1];verts[ 5] = innermins[2];
+ verts[ 6] = innermins[0];verts[ 7] = innermaxs[1];verts[ 8] = innermins[2];
+ verts[ 9] = innermins[0];verts[10] = innermaxs[1];verts[11] = innermaxs[2];
+ Mod_ShadowMesh_AddPolygon(loadmodel->mempool, e->shadowvolume, 4, verts);
+ verts[ 0] = outermins[0];verts[ 1] = outermaxs[1];verts[ 2] = outermaxs[2];
+ verts[ 3] = outermins[0];verts[ 4] = outermaxs[1];verts[ 5] = outermins[2];
+ verts[ 6] = outermaxs[0];verts[ 7] = outermaxs[1];verts[ 8] = outermins[2];
+ verts[ 9] = outermaxs[0];verts[10] = outermaxs[1];verts[11] = outermaxs[2];
+ Mod_ShadowMesh_AddPolygon(loadmodel->mempool, e->shadowvolume, 4, verts);
+ // Y minor
+ verts[ 0] = innermins[0];verts[ 1] = innermins[1];verts[ 2] = innermaxs[2];
+ verts[ 3] = innermins[0];verts[ 4] = innermins[1];verts[ 5] = innermins[2];
+ verts[ 6] = innermaxs[0];verts[ 7] = innermins[1];verts[ 8] = innermins[2];
+ verts[ 9] = innermaxs[0];verts[10] = innermins[1];verts[11] = innermaxs[2];
+ Mod_ShadowMesh_AddPolygon(loadmodel->mempool, e->shadowvolume, 4, verts);
+ verts[ 0] = outermaxs[0];verts[ 1] = outermins[1];verts[ 2] = outermaxs[2];
+ verts[ 3] = outermaxs[0];verts[ 4] = outermins[1];verts[ 5] = outermins[2];
+ verts[ 6] = outermins[0];verts[ 7] = outermins[1];verts[ 8] = outermins[2];
+ verts[ 9] = outermins[0];verts[10] = outermins[1];verts[11] = outermaxs[2];
+ Mod_ShadowMesh_AddPolygon(loadmodel->mempool, e->shadowvolume, 4, verts);
+ // Z major
+ verts[ 0] = innermaxs[0];verts[ 1] = innermins[1];verts[ 2] = innermaxs[2];
+ verts[ 3] = innermaxs[0];verts[ 4] = innermaxs[1];verts[ 5] = innermaxs[2];
+ verts[ 6] = innermins[0];verts[ 7] = innermaxs[1];verts[ 8] = innermaxs[2];
+ verts[ 9] = innermins[0];verts[10] = innermins[1];verts[11] = innermaxs[2];
+ Mod_ShadowMesh_AddPolygon(loadmodel->mempool, e->shadowvolume, 4, verts);
+ verts[ 0] = outermaxs[0];verts[ 1] = outermaxs[1];verts[ 2] = outermaxs[2];
+ verts[ 3] = outermaxs[0];verts[ 4] = outermins[1];verts[ 5] = outermaxs[2];
+ verts[ 6] = outermins[0];verts[ 7] = outermins[1];verts[ 8] = outermaxs[2];
+ verts[ 9] = outermins[0];verts[10] = outermaxs[1];verts[11] = outermaxs[2];
+ Mod_ShadowMesh_AddPolygon(loadmodel->mempool, e->shadowvolume, 4, verts);
+ // Z minor
+ verts[ 0] = innermaxs[0];verts[ 1] = innermaxs[1];verts[ 2] = innermins[2];
+ verts[ 3] = innermaxs[0];verts[ 4] = innermins[1];verts[ 5] = innermins[2];
+ verts[ 6] = innermins[0];verts[ 7] = innermins[1];verts[ 8] = innermins[2];
+ verts[ 9] = innermins[0];verts[10] = innermaxs[1];verts[11] = innermins[2];
+ Mod_ShadowMesh_AddPolygon(loadmodel->mempool, e->shadowvolume, 4, verts);
+ verts[ 0] = outermaxs[0];verts[ 1] = outermins[1];verts[ 2] = outermins[2];
+ verts[ 3] = outermaxs[0];verts[ 4] = outermaxs[1];verts[ 5] = outermins[2];
+ verts[ 6] = outermins[0];verts[ 7] = outermaxs[1];verts[ 8] = outermins[2];
+ verts[ 9] = outermins[0];verts[10] = outermins[1];verts[11] = outermins[2];
+ Mod_ShadowMesh_AddPolygon(loadmodel->mempool, e->shadowvolume, 4, verts);
+ }
+#endif
+ castshadowcount++;
+ for (j = 0;j < e->numsurfaces;j++)
+ {
+ surf = e->surfaces[j];
+ if (surf->flags & SURF_SHADOWCAST)
+ surf->castshadow = castshadowcount;
+ }
+ for (j = 0;j < e->numsurfaces;j++)
+ {
+ surf = e->surfaces[j];
+ if (surf->castshadow != castshadowcount)
+ continue;
+ f = DotProduct(e->origin, surf->plane->normal) - surf->plane->dist;
+ if (surf->flags & SURF_PLANEBACK)
+ f = -f;
+ projectdistance = e->lightradius;
+ if (maxverts < surf->poly_numverts)
{
- VectorCopy(&verts[j * 3], &vertsfront[numvertsfront * 3]);
- numvertsfront++;
- if (sides[i] == SIDE_BACK)
- {
- d = dists[j] / (dists[j] - dists[i]);
- VectorSubtract(&verts[i * 3], &verts[j * 3], temp);
- VectorMA(&verts[j * 3], d, temp, temp);
- VectorCopy(temp, &vertsfront[numvertsfront * 3]);
- VectorCopy(temp, &vertsback[numvertsback * 3]);
- numvertsfront++;
- numvertsback++;
- }
+ maxverts = surf->poly_numverts;
+ if (verts)
+ Mem_Free(verts);
+ verts = Mem_Alloc(loadmodel->mempool, maxverts * sizeof(float[3]));
}
- else if (sides[j] == SIDE_BACK)
+ // copy the original polygon, for the front cap of the volume
+ for (k = 0, v0 = surf->poly_verts, v1 = verts;k < surf->poly_numverts;k++, v0 += 3, v1 += 3)
+ VectorCopy(v0, v1);
+ Mod_ShadowMesh_AddPolygon(loadmodel->mempool, e->shadowvolume, surf->poly_numverts, verts);
+ // project the original polygon, reversed, for the back cap of the volume
+ for (k = 0, v0 = surf->poly_verts + (surf->poly_numverts - 1) * 3, v1 = verts;k < surf->poly_numverts;k++, v0 -= 3, v1 += 3)
{
- VectorCopy(&verts[j * 3], &vertsback[numvertsback * 3]);
- numvertsback++;
- if (sides[i] == SIDE_FRONT)
- {
- d = dists[j] / (dists[j] - dists[i]);
- VectorSubtract(&verts[i * 3], &verts[j * 3], temp);
- VectorMA(&verts[j * 3], d, temp, temp);
- VectorCopy(temp, &vertsfront[numvertsfront * 3]);
- VectorCopy(temp, &vertsback[numvertsback * 3]);
- numvertsfront++;
- numvertsback++;
- }
+ VectorSubtract(v0, e->origin, temp);
+ VectorNormalize(temp);
+ VectorMA(v0, projectdistance, temp, v1);
}
- else
+ Mod_ShadowMesh_AddPolygon(loadmodel->mempool, e->shadowvolume, surf->poly_numverts, verts);
+ // project the shadow volume sides
+ for (l = surf->poly_numverts - 1, k = 0, v0 = surf->poly_verts + (surf->poly_numverts - 1) * 3, v1 = surf->poly_verts;k < surf->poly_numverts;l = k, k++, v0 = v1, v1 += 3)
{
- VectorCopy(&verts[j * 3], &vertsfront[numvertsfront * 3]);
- VectorCopy(&verts[j * 3], &vertsback[numvertsback * 3]);
- numvertsfront++;
- numvertsback++;
+ if (!surf->neighborsurfaces[l] || surf->neighborsurfaces[l]->castshadow != castshadowcount)
+ {
+ VectorCopy(v1, &verts[0]);
+ VectorCopy(v0, &verts[3]);
+ VectorCopy(v0, &verts[6]);
+ VectorCopy(v1, &verts[9]);
+ VectorSubtract(&verts[6], e->origin, temp);
+ VectorNormalize(temp);
+ VectorMA(&verts[6], projectdistance, temp, &verts[6]);
+ VectorSubtract(&verts[9], e->origin, temp);
+ VectorNormalize(temp);
+ VectorMA(&verts[9], projectdistance, temp, &verts[9]);
+ Mod_ShadowMesh_AddPolygon(loadmodel->mempool, e->shadowvolume, 4, verts);
+ }
}
}
- Mod_SVBSP_RecursiveAddPolygon(node->children[1], numvertsfront, vertsfront, normal, dist, constructmode);
- Mod_SVBSP_RecursiveAddPolygon(node->children[0], numvertsback, vertsback, normal, dist, constructmode);
- Mem_Free(vertsfront);
- Mem_Free(vertsback);
- }
- else if (counts[SIDE_BACK])
- Mod_SVBSP_RecursiveAddPolygon(node->children[0], numverts, verts, normal, dist, constructmode);
- else if (counts[SIDE_FRONT])
- Mod_SVBSP_RecursiveAddPolygon(node->children[1], numverts, verts, normal, dist, constructmode);
- else
- {
- // mode 0 is constructing tree, don't make unnecessary splits
- if (constructmode == 1)
- {
- // marking dark leafs
- // send it down the side it is not facing
- Mod_SVBSP_RecursiveAddPolygon(node->children[DotProduct(node->normal, normal) < 0], numverts, verts, normal, dist, constructmode);
- }
- else if (constructmode == 2)
+ // build the triangle mesh
+ e->shadowvolume = Mod_ShadowMesh_Finish(loadmodel->mempool, e->shadowvolume);
{
- // linking polygons into lit leafs only
- // send it down the side it is facing
- Mod_SVBSP_RecursiveAddPolygon(node->children[DotProduct(node->normal, normal) >= 0], numverts, verts, normal, dist, constructmode);
+ shadowmesh_t *mesh;
+ l = 0;
+ for (mesh = e->shadowvolume;mesh;mesh = mesh->next)
+ l += mesh->numtriangles;
+ Con_Printf("light %i shadow volume built containing %i triangles\n", lnum, l);
}
}
}
}
+*/
-int svbsp_count_nodes;
-int svbsp_count_leafs;
-int svbsp_count_polygons;
-int svbsp_count_darkleafs;
-int svbsp_count_originalpolygons;
-int svbsp_count_meshs;
-int svbsp_count_triangles;
-int svbsp_count_vertices;
-void Mod_SVBSP_AddPolygon(svbspnode_t *root, int numverts, float *verts, int constructmode, float *test, int linenumber)
+/*
+=================
+Mod_LoadVisibility
+=================
+*/
+static void Mod_LoadVisibility (lump_t *l)
{
- int i;
- float normal[3], dist, dir0[3], dir1[3], *v0, *v1, *v2;
- svbsp_count_originalpolygons++;
- for (i = 0, v0 = verts + (numverts - 2) * 3, v1 = verts + (numverts - 1) * 3, v2 = verts;i < numverts;i++, v0 = v1, v1 = v2, v2 += 3)
- {
- VectorSubtract(v0, v1, dir0);
- VectorSubtract(v2, v1, dir1);
- CrossProduct(dir0, dir1, normal);
- if (DotProduct(normal, normal) >= 0.1)
- break;
- }
- if (i == numverts)
+ loadmodel->visdata = NULL;
+ if (!l->filelen)
return;
- VectorNormalize(normal);
- dist = DotProduct(verts, normal);
- if (test && DotProduct(test, normal) > dist + 0.1)
- Con_Printf("%i %f %f %f %f : %f %f %f %f\n", linenumber, normal[0], normal[1], normal[2], dist, test[0], test[1], test[2], DotProduct(test, normal));
- Mod_SVBSP_RecursiveAddPolygon(root, numverts, verts, normal, dist, constructmode);
+ loadmodel->visdata = Mem_Alloc(loadmodel->mempool, l->filelen);
+ memcpy (loadmodel->visdata, mod_base + l->fileofs, l->filelen);
}
-void Mod_SVBSP_RecursiveGatherStats(svbspnode_t *node)
+// used only for HalfLife maps
+void Mod_ParseWadsFromEntityLump(const char *data)
{
- svbsppolygon_t *poly;
- for (poly = node->polygons;poly;poly = poly->next)
- svbsp_count_polygons++;
- if (node->isleaf)
- {
- svbsp_count_leafs++;
- if (node->dark)
- svbsp_count_darkleafs++;
- }
- else
- {
- svbsp_count_nodes++;
- Mod_SVBSP_RecursiveGatherStats(node->children[0]);
- Mod_SVBSP_RecursiveGatherStats(node->children[1]);
- }
-}
-
-svbspmesh_t *Mod_SVBSP_AllocMesh(int maxverts)
-{
- svbspmesh_t *mesh;
- mesh = Mem_Alloc(loadmodel->mempool, sizeof(svbspmesh_t) + maxverts * sizeof(float[4]) + maxverts * sizeof(int[3]));
- 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);
- return mesh;
-}
-
-svbspmesh_t *Mod_SVBSP_ReAllocMesh(svbspmesh_t *oldmesh)
-{
- svbspmesh_t *newmesh;
- newmesh = Mem_Alloc(loadmodel->mempool, sizeof(svbspmesh_t) + oldmesh->numverts * sizeof(float[4]) + 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);
- memcpy(newmesh->verts, oldmesh->verts, newmesh->numverts * sizeof(float[4]));
- memcpy(newmesh->elements, oldmesh->elements, newmesh->numtriangles * sizeof(int[3]));
- return newmesh;
-}
-
-void Mod_SVBSP_RecursiveBuildTriangleMeshs(svbspmesh_t *firstmesh, svbspnode_t *node)
-{
- svbsppolygon_t *poly;
- svbspmesh_t *mesh;
+ char key[128], value[4096];
+ char wadname[128];
int i, j, k;
- float *v, *m, temp[3];
- if (node->isleaf)
+ if (!data)
+ return;
+ if (!COM_ParseToken(&data))
+ return; // error
+ if (com_token[0] != '{')
+ return; // error
+ while (1)
{
- for (poly = node->polygons;poly;poly = poly->next)
+ if (!COM_ParseToken(&data))
+ return; // error
+ if (com_token[0] == '}')
+ break; // end of worldspawn
+ if (com_token[0] == '_')
+ strcpy(key, com_token + 1);
+ else
+ strcpy(key, com_token);
+ while (key[strlen(key)-1] == ' ') // remove trailing spaces
+ key[strlen(key)-1] = 0;
+ if (!COM_ParseToken(&data))
+ return; // error
+ strcpy(value, com_token);
+ if (!strcmp("wad", key)) // for HalfLife maps
{
- mesh = firstmesh;
- while (poly->numverts + mesh->numverts > mesh->maxverts || (poly->numverts - 2) + mesh->numtriangles > mesh->maxtriangles)
- {
- if (mesh->next == NULL)
- mesh->next = Mod_SVBSP_AllocMesh(max(1000, poly->numverts));
- mesh = mesh->next;
- }
- for (i = 0, v = poly->verts;i < poly->numverts - 2;i++, v += 3)
+ if (loadmodel->ishlbsp)
{
- for (k = 0;k < 3;k++)
+ j = 0;
+ for (i = 0;i < 4096;i++)
+ if (value[i] != ';' && value[i] != '\\' && value[i] != '/' && value[i] != ':')
+ break;
+ if (value[i])
{
- if (k == 0)
- v = poly->verts;
- else if (k == 1)
- v = poly->verts + (i + 1) * 3;
- else if (k == 2)
- v = poly->verts + (i + 2) * 3;
- for (j = 0, m = mesh->verts;j < mesh->numverts;j++, m += 4)
- {
- VectorSubtract(v, m, temp);
- if (DotProduct(temp, temp) < 0.1)
- break;
- }
- if (j == mesh->numverts)
+ for (;i < 4096;i++)
{
- mesh->numverts++;
- VectorCopy(v, m);
+ // ignore path - the \\ check is for HalfLife... stupid windoze 'programmers'...
+ if (value[i] == '\\' || value[i] == '/' || value[i] == ':')
+ j = i+1;
+ else if (value[i] == ';' || value[i] == 0)
+ {
+ k = value[i];
+ value[i] = 0;
+ strcpy(wadname, "textures/");
+ strcat(wadname, &value[j]);
+ W_LoadTextureWadFile (wadname, false);
+ j = i+1;
+ if (!k)
+ break;
+ }
}
- mesh->elements[mesh->numtriangles * 3 + k] = j;
}
- mesh->numtriangles++;
}
}
}
- else
- {
- Mod_SVBSP_RecursiveBuildTriangleMeshs(firstmesh, node->children[0]);
- Mod_SVBSP_RecursiveBuildTriangleMeshs(firstmesh, node->children[1]);
- }
}
-svbspmesh_t *Mod_SVBSP_BuildTriangleMeshs(svbspnode_t *root, vec3_t mins, vec3_t maxs)
+/*
+=================
+Mod_LoadEntities
+=================
+*/
+static void Mod_LoadEntities (lump_t *l)
+{
+ loadmodel->entities = NULL;
+ if (!l->filelen)
+ return;
+ loadmodel->entities = Mem_Alloc(loadmodel->mempool, l->filelen);
+ memcpy (loadmodel->entities, mod_base + l->fileofs, l->filelen);
+ if (loadmodel->ishlbsp)
+ Mod_ParseWadsFromEntityLump(loadmodel->entities);
+}
+
+
+/*
+=================
+Mod_LoadVertexes
+=================
+*/
+static void Mod_LoadVertexes (lump_t *l)
{
- svbspmesh_t *firstmesh, *mesh, *newmesh, *nextmesh;
- int i;
- float *v;
- firstmesh = Mod_SVBSP_AllocMesh(1000);
- Mod_SVBSP_RecursiveBuildTriangleMeshs(firstmesh, root);
- // reallocate meshs to conserve space
- for (mesh = firstmesh, firstmesh = NULL;mesh;mesh = nextmesh)
- {
- svbsp_count_meshs++;
- svbsp_count_triangles += mesh->numtriangles;
- svbsp_count_vertices += mesh->numverts;
+ dvertex_t *in;
+ mvertex_t *out;
+ int i, count;
- // calculate bbox
- if (firstmesh == NULL)
- {
- VectorCopy(mesh->verts, mins);
- VectorCopy(mesh->verts, maxs);
- }
- for (i = 0, v = mesh->verts;i < mesh->numverts;i++, v += 4)
- {
- if (mins[0] > v[0]) mins[0] = v[0];if (maxs[0] < v[0]) maxs[0] = v[0];
- if (mins[1] > v[1]) mins[1] = v[1];if (maxs[1] < v[1]) maxs[1] = v[1];
- if (mins[2] > v[2]) mins[2] = v[2];if (maxs[2] < v[2]) maxs[2] = v[2];
- }
+ in = (void *)(mod_base + l->fileofs);
+ if (l->filelen % sizeof(*in))
+ Host_Error ("MOD_LoadBmodel: funny lump size in %s",loadmodel->name);
+ count = l->filelen / sizeof(*in);
+ out = Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
- nextmesh = mesh->next;
- newmesh = Mod_SVBSP_ReAllocMesh(mesh);
- newmesh->next = firstmesh;
- firstmesh = newmesh;
- Mem_Free(mesh);
- }
- return firstmesh;
-}
+ loadmodel->vertexes = out;
+ loadmodel->numvertexes = count;
-void Mod_SVBSP_FreeTriangleMeshs(svbspmesh_t *mesh)
-{
- svbspmesh_t *nextmesh;
- for (;mesh;mesh = nextmesh)
+ for ( i=0 ; i<count ; i++, in++, out++)
{
- nextmesh = mesh->next;
- Mem_Free(mesh);
+ out->position[0] = LittleFloat (in->point[0]);
+ out->position[1] = LittleFloat (in->point[1]);
+ out->position[2] = LittleFloat (in->point[2]);
}
}
-*/
-
-typedef struct svpolygon_s
-{
- struct svpolygon_s *next;
- int maxverts;
- int numverts;
- float *verts;
- float normal[3], dist;
-}
-svpolygon_t;
-typedef struct svbrush_s
+/*
+=================
+Mod_LoadSubmodels
+=================
+*/
+static void Mod_LoadSubmodels (lump_t *l)
{
- struct svbrush_s *next;
- svpolygon_t *polygons;
- vec3_t mins, maxs;
-}
-svbrush_t;
+ dmodel_t *in;
+ dmodel_t *out;
+ int i, j, count;
-typedef struct svworld_s
-{
- svbrush_t *brushs;
-}
-svworld_t;
+ in = (void *)(mod_base + l->fileofs);
+ if (l->filelen % sizeof(*in))
+ Host_Error ("MOD_LoadBmodel: funny lump size in %s",loadmodel->name);
+ count = l->filelen / sizeof(*in);
+ out = Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
-svworld_t *Mod_ShadowBrush_NewWorld(mempool_t *mempool)
-{
- return Mem_Alloc(mempool, sizeof(svworld_t));
-}
+ loadmodel->submodels = out;
+ loadmodel->numsubmodels = count;
-void Mod_ShadowBrush_FreeWorld(svworld_t *world)
-{
- svbrush_t *brush, *brushnext;
- svpolygon_t *poly, *polynext;
- for (brush = world->brushs;brush;brush = brushnext)
+ for ( i=0 ; i<count ; i++, in++, out++)
{
- brushnext = brush->next;
- for (poly = brush->polygons;poly;poly = polynext)
+ for (j=0 ; j<3 ; j++)
{
- polynext = poly->next;
- Mem_Free(poly);
+ // spread the mins / maxs by a pixel
+ out->mins[j] = LittleFloat (in->mins[j]) - 1;
+ out->maxs[j] = LittleFloat (in->maxs[j]) + 1;
+ out->origin[j] = LittleFloat (in->origin[j]);
}
- Mem_Free(brush);
+ for (j=0 ; j<MAX_MAP_HULLS ; j++)
+ out->headnode[j] = LittleLong (in->headnode[j]);
+ out->visleafs = LittleLong (in->visleafs);
+ out->firstface = LittleLong (in->firstface);
+ out->numfaces = LittleLong (in->numfaces);
}
- Mem_Free(world);
}
-svbrush_t *Mod_ShadowBrush_BeginBrush(mempool_t *mempool)
+/*
+=================
+Mod_LoadEdges
+=================
+*/
+static void Mod_LoadEdges (lump_t *l)
{
- return Mem_Alloc(mempool, sizeof(svbrush_t));
-}
+ dedge_t *in;
+ medge_t *out;
+ int i, count;
-void Mod_ShadowBrush_AddPolygon(mempool_t *mempool, svbrush_t *brush, int numverts, float *verts)
-{
- int i;
- float normal[3], dist, dir0[3], dir1[3], *v0, *v1, *v2;
- svpolygon_t *poly;
- for (i = 0, v0 = verts + (numverts - 2) * 3, v1 = verts + (numverts - 1) * 3, v2 = verts;i < numverts;i++, v0 = v1, v1 = v2, v2 += 3)
- {
- VectorSubtract(v0, v1, dir0);
- VectorSubtract(v2, v1, dir1);
- CrossProduct(dir0, dir1, normal);
- if (DotProduct(normal, normal) >= 0.1)
- break;
- }
- if (i == numverts)
- return;
- VectorNormalize(normal);
- dist = DotProduct(verts, normal);
+ in = (void *)(mod_base + l->fileofs);
+ if (l->filelen % sizeof(*in))
+ Host_Error ("MOD_LoadBmodel: funny lump size in %s",loadmodel->name);
+ count = l->filelen / sizeof(*in);
+ out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
- poly = Mem_Alloc(mempool, sizeof(svpolygon_t) + numverts * sizeof(float[3]));
- poly->numverts = numverts;
- poly->verts = (float *)(poly + 1);
- VectorCopy(normal, poly->normal);
- poly->dist = dist;
- poly->next = brush->polygons;
- brush->polygons = poly;
- memcpy(poly->verts, verts, numverts * sizeof(float[3]));
-}
+ loadmodel->edges = out;
+ loadmodel->numedges = count;
-void Mod_ShadowBrush_EndBrush(svworld_t *world, svbrush_t *brush)
-{
- int i;
- float *v;
- svpolygon_t *poly;
- if (!brush->polygons)
+ for ( i=0 ; i<count ; i++, in++, out++)
{
- Mem_Free(brush);
- return;
+ out->v[0] = (unsigned short)LittleShort(in->v[0]);
+ out->v[1] = (unsigned short)LittleShort(in->v[1]);
}
- brush->next = world->brushs;
- world->brushs = brush;
- VectorCopy(brush->polygons->verts, brush->mins);
- VectorCopy(brush->polygons->verts, brush->maxs);
- for (poly = brush->polygons;poly;poly = poly->next)
+}
+
+/*
+=================
+Mod_LoadTexinfo
+=================
+*/
+static void Mod_LoadTexinfo (lump_t *l)
+{
+ texinfo_t *in;
+ mtexinfo_t *out;
+ int i, j, k, count, miptex;
+
+ in = (void *)(mod_base + l->fileofs);
+ if (l->filelen % sizeof(*in))
+ Host_Error ("MOD_LoadBmodel: funny lump size in %s",loadmodel->name);
+ count = l->filelen / sizeof(*in);
+ out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
+
+ loadmodel->texinfo = out;
+ loadmodel->numtexinfo = count;
+
+ for (i = 0;i < count;i++, in++, out++)
{
- for (i = 0, v = poly->verts;i < poly->numverts;i++, v += 3)
+ for (k = 0;k < 2;k++)
+ for (j = 0;j < 4;j++)
+ out->vecs[k][j] = LittleFloat (in->vecs[k][j]);
+
+ miptex = LittleLong (in->miptex);
+ out->flags = LittleLong (in->flags);
+
+ out->texture = NULL;
+ if (loadmodel->textures)
+ {
+ if ((unsigned int) miptex >= (unsigned int) loadmodel->numtextures)
+ Con_Printf ("error in model \"%s\": invalid miptex index %i (of %i)\n", loadmodel->name, miptex, loadmodel->numtextures);
+ else
+ out->texture = loadmodel->textures + miptex;
+ }
+ if (out->flags & TEX_SPECIAL)
+ {
+ // if texture chosen is NULL or the shader needs a lightmap,
+ // force to notexture water shader
+ if (out->texture == NULL || out->texture->shader->flags & SHADERFLAGS_NEEDLIGHTMAP)
+ out->texture = loadmodel->textures + (loadmodel->numtextures - 1);
+ }
+ else
{
- if (brush->mins[0] > v[0]) brush->mins[0] = v[0];if (brush->maxs[0] < v[0]) brush->maxs[0] = v[0];
- if (brush->mins[1] > v[1]) brush->mins[1] = v[1];if (brush->maxs[1] < v[1]) brush->maxs[1] = v[1];
- if (brush->mins[2] > v[2]) brush->mins[2] = v[2];if (brush->maxs[2] < v[2]) brush->maxs[2] = v[2];
+ // if texture chosen is NULL, force to notexture
+ if (out->texture == NULL)
+ out->texture = loadmodel->textures + (loadmodel->numtextures - 2);
}
}
}
-void Mod_ShadowBrush_ProcessWorld(mempool_t *mempool, svworld_t *world)
+void BoundPoly (int numverts, float *verts, vec3_t mins, vec3_t maxs)
{
- /*
- for (clipbrush = world->brushs;clipbrush;clipbrush = clipbrush->next)
+ int i, j;
+ float *v;
+
+ mins[0] = mins[1] = mins[2] = 9999;
+ maxs[0] = maxs[1] = maxs[2] = -9999;
+ v = verts;
+ for (i = 0;i < numverts;i++)
{
- for (brush = world->brushs;brush;brush = brush->next)
+ for (j = 0;j < 3;j++, v++)
{
- if (brush != clipbrush
- && brush->mins[0] <= clipbrush->maxs[0]
- && brush->maxs[0] >= clipbrush->mins[0]
- && brush->mins[1] <= clipbrush->maxs[1]
- && brush->maxs[1] >= clipbrush->mins[1]
- && brush->mins[2] <= clipbrush->maxs[2]
- && brush->maxs[2] >= clipbrush->mins[2])
- continue;
- for (poly = brush->polygons;poly;poly = poly->next)
- {
-
- }
+ if (*v < mins[j])
+ mins[j] = *v;
+ if (*v > maxs[j])
+ maxs[j] = *v;
}
}
- */
}
-shadowmesh_t *Mod_ShadowBrush_BuildMeshs(mempool_t *mempool, svworld_t *world)
-{
- shadowmesh_t *mesh;
- svbrush_t *brush;
- svpolygon_t *poly;
- mesh = Mod_ShadowMesh_Begin(mempool);
- for (brush = world->brushs;brush;brush = brush->next)
- for (poly = brush->polygons;poly;poly = poly->next)
- Mod_ShadowMesh_AddPolygon(mempool, mesh, poly->numverts, poly->verts);
- mesh = Mod_ShadowMesh_Finish(mempool, mesh);
- return mesh;
-}
+#if 0
+#define MAX_SUBDIVPOLYTRIANGLES 4096
+#define MAX_SUBDIVPOLYVERTS (MAX_SUBDIVPOLYTRIANGLES * 3)
-void Mod_ProcessLightList(void)
-{
- int j, k, *mark, lnum;
- mlight_t *e;
- msurface_t *surf;
- float dist;
- mleaf_t *leaf;
- qbyte *pvs;
- for (lnum = 0, e = loadmodel->lights;lnum < loadmodel->numlights;lnum++, e++)
- {
- e->cullradius2 = DotProduct(e->light, e->light) * (1.0f / (8192.0f * 8192.0f)) / (e->falloff * e->falloff) + 4096.0f;
- if (e->cullradius2 > 4096.0f * 4096.0f)
- e->cullradius2 = 4096.0f * 4096.0f;
- e->cullradius = sqrt(e->cullradius2);
- leaf = Mod_PointInLeaf(e->origin, loadmodel);
- if (leaf->compressed_vis)
- pvs = Mod_DecompressVis (leaf->compressed_vis, loadmodel);
- else
- pvs = mod_novis;
- for (j = 0;j < loadmodel->numsurfaces;j++)
- loadmodel->surfacevisframes[j] = -1;
- for (j = 0, leaf = loadmodel->leafs + 1;j < loadmodel->numleafs - 1;j++, leaf++)
- {
- if (pvs[j >> 3] & (1 << (j & 7)))
- {
- for (k = 0, mark = leaf->firstmarksurface;k < leaf->nummarksurfaces;k++, mark++)
- {
- surf = loadmodel->surfaces + *mark;
- if (surf->number != *mark)
- Con_Printf("%d != %d\n", surf->number, *mark);
- dist = DotProduct(e->origin, surf->plane->normal) - surf->plane->dist;
- if (surf->flags & SURF_PLANEBACK)
- dist = -dist;
- if (dist > 0 && dist < e->cullradius)
- loadmodel->surfacevisframes[*mark] = -2;
- }
- }
- }
- // build list of light receiving surfaces
- e->numsurfaces = 0;
- for (j = 0;j < loadmodel->numsurfaces;j++)
- if (loadmodel->surfacevisframes[j] == -2)
- e->numsurfaces++;
- e->surfaces = NULL;
- if (e->numsurfaces > 0)
- {
- e->surfaces = Mem_Alloc(loadmodel->mempool, sizeof(msurface_t *) * e->numsurfaces);
- e->numsurfaces = 0;
- for (j = 0;j < loadmodel->numsurfaces;j++)
- if (loadmodel->surfacevisframes[j] == -2)
- e->surfaces[e->numsurfaces++] = loadmodel->surfaces + j;
- }
- /*
- {
- // find bounding box and sphere of lit surfaces
- float *v, temp[3], radius2;
- radius2 = 0;
- for (j = 0;j < e->numsurfaces;j++)
- {
- surf = e->surfaces[j];
- if (j == 0)
- {
- VectorCopy(surf->poly_verts, e->mins);
- VectorCopy(surf->poly_verts, e->maxs);
- }
- for (k = 0, v = surf->poly_verts;k < surf->poly_numverts;k++, v += 3)
- {
- if (e->mins[0] > v[0]) e->mins[0] = v[0];if (e->maxs[0] < v[0]) e->maxs[0] = v[0];
- if (e->mins[1] > v[1]) e->mins[1] = v[1];if (e->maxs[1] < v[1]) e->maxs[1] = v[1];
- if (e->mins[2] > v[2]) e->mins[2] = v[2];if (e->maxs[2] < v[2]) e->maxs[2] = v[2];
- VectorSubtract(v, e->origin, temp);
- dist = DotProduct(temp, temp);
- if (radius2 < dist)
- radius2 = dist;
- }
- }
- if (e->cullradius2 > radius2)
- {
- e->cullradius2 = radius2;
- e->cullradius = sqrt(e->cullradius2);
- }
- }
- */
-#if 1
- // clip shadow volumes against eachother to remove unnecessary
- // polygons (and sections of polygons)
- {
- svworld_t *svworld;
- float f;
- float temp[3];
- float *verts = NULL;
- svbrush_t *svbrush;
- float *v0;
- float projectdistance;
- int maxverts = 0;
- float *v1;
- svworld = Mod_ShadowBrush_NewWorld(loadmodel->mempool);
- for (j = 0, surf = loadmodel->surfaces + loadmodel->firstmodelsurface;j < loadmodel->nummodelsurfaces;j++, surf++)
- {
- if (!(surf->flags & SURF_CLIPSOLID))
- continue;
- f = DotProduct(e->origin, surf->plane->normal) - surf->plane->dist;
- if (surf->flags & SURF_PLANEBACK)
- f = -f;
- projectdistance = e->cullradius + f;
- if (projectdistance < 0.1 || projectdistance > e->cullradius)
- continue;
- VectorSubtract(e->origin, surf->poly_center, temp);
- if (DotProduct(temp, temp) > (surf->poly_radius2 + e->cullradius2))
- continue;
- if (maxverts < surf->poly_numverts)
- {
- maxverts = surf->poly_numverts;
- if (verts)
- Mem_Free(verts);
- verts = Mem_Alloc(loadmodel->mempool, maxverts * sizeof(float[3]));
- }
- svbrush = Mod_ShadowBrush_BeginBrush(loadmodel->mempool);
- // copy the original polygon, reversed, for the front cap of the volume
- for (k = 0, v0 = surf->poly_verts + (surf->poly_numverts - 1) * 3, v1 = verts;k < surf->poly_numverts;k++, v0 -= 3, v1 += 3)
- VectorCopy(v0, v1);
- Mod_ShadowBrush_AddPolygon(loadmodel->mempool, svbrush, surf->poly_numverts, verts);
- // project the original polygon, for the back cap of the volume
- for (k = 0, v0 = surf->poly_verts, v1 = verts;k < surf->poly_numverts;k++, v0 += 3, v1 += 3)
- {
- VectorSubtract(v0, e->origin, temp);
- VectorNormalize(temp);
- VectorMA(v0, projectdistance, temp, v1);
- }
- Mod_ShadowBrush_AddPolygon(loadmodel->mempool, svbrush, surf->poly_numverts, verts);
- // project the shadow volume sides
- for (k = 0, v0 = surf->poly_verts + (surf->poly_numverts - 1) * 3, v1 = surf->poly_verts;k < surf->poly_numverts;k++, v0 = v1, v1 += 3)
- {
- VectorCopy(v0, &verts[0]);
- VectorCopy(v1, &verts[3]);
- VectorCopy(v1, &verts[6]);
- VectorCopy(v0, &verts[9]);
- VectorSubtract(&verts[6], e->origin, temp);
- VectorNormalize(temp);
- VectorMA(&verts[6], projectdistance, temp, &verts[6]);
- VectorSubtract(&verts[9], e->origin, temp);
- VectorNormalize(temp);
- VectorMA(&verts[9], projectdistance, temp, &verts[9]);
- Mod_ShadowBrush_AddPolygon(loadmodel->mempool, svbrush, 4, verts);
- }
- Mod_ShadowBrush_EndBrush(svworld, svbrush);
- }
- e->shadowvolume = Mod_ShadowBrush_BuildMeshs(loadmodel->mempool, svworld);
- Mod_ShadowBrush_FreeWorld(svworld);
- }
-#elif 0
- // build svbsp (shadow volume bsp)
- {
- int maxverts = 0, constructmode;
- float *verts = NULL, projectdistance, *v0, *v1, f, temp[3];
- svbspnode_t *svbsproot;
- svbsproot = Mod_SVBSP_NewTree();
- // we do this in three stages:
- // 1. construct the svbsp structure
- // 2. mark which leafs are dark (shadow)
- // 3. link polygons into only leafs that are not dark
- // this results in polygons that are only on the outside of the
- // shadow volume, removing polygons that are inside the shadow
- // volume (which waste time)
- for (constructmode = 0;constructmode < 3;constructmode++)
- {
- svbsp_count_originalpolygons = 0;
-#if 1
- for (j = 0, surf = loadmodel->surfaces + loadmodel->firstmodelsurface;j < loadmodel->nummodelsurfaces;j++, surf++)
- {
- if (!(surf->flags & SURF_CLIPSOLID))
- continue;
- /*
- if (surf->poly_maxs[0] < e->mins[0]
- || surf->poly_mins[0] > e->maxs[0]
- || surf->poly_maxs[1] < e->mins[1]
- || surf->poly_mins[1] > e->maxs[1]
- || surf->poly_maxs[2] < e->mins[2]
- || surf->poly_mins[2] > e->maxs[2])
- continue;
- */
- f = DotProduct(e->origin, surf->plane->normal) - surf->plane->dist;
- if (surf->flags & SURF_PLANEBACK)
- f = -f;
- projectdistance = e->cullradius + f;
- if (projectdistance < 0.1 || projectdistance > e->cullradius)
- continue;
- /*
- // find the nearest vertex of the projected volume
- for (k = 0, v0 = surf->poly_verts;k < surf->poly_numverts;k++, v0 += 3)
- {
- VectorSubtract(v0, e->origin, temp);
- VectorNormalize(temp);
- if (maxdist00 > v0[0] - e->origin[0]) maxdist00 = v0[0] - e->origin[0];
- if (maxdist01 < e->origin[0] - v0[0]) maxdist01 = e->origin[0] - v0[0];
- if (maxdist10 > v0[1] - e->origin[1]) maxdist10 = v0[1] - e->origin[1];
- if (maxdist11 < e->origin[1] - v0[1]) maxdist11 = e->origin[1] - v0[1];
- if (maxdist20 > v0[2] - e->origin[2]) maxdist20 = v0[2] - e->origin[2];
- if (maxdist21 < e->origin[2] - v0[2]) maxdist21 = e->origin[2] - v0[2];
- dist =
-
- dist = DotProduct(temp, temp);
- if (bestdist > dist)
- {
- bestdist = dist;
- VectorCopy(temp, bestvec);
- }
- }
- projectdistance = e->cullradius - sqrt(bestdist);
- if (projectdistance < 0.1)
- continue;
- for (k = 0, v0 = surf->poly_verts;k < surf->poly_numverts;k++, v0 += 3)
- {
- VectorNormalize(temp);
- if (temp[0] > 0)
- {
- dist = (e->maxs[0] - e->origin[0]) / temp[0];
- if (maxdist >
- }
- else if (temp[0] < 0)
- dist = (e->mins[0] - e->origin[0]) / temp[0];
- dist =
- VectorMA(v0, projectdistance, temp, temp);
- dist = (temp[0]
- VectorSubtract(temp, e->origin,
- }
- */
- VectorSubtract(e->origin, surf->poly_center, temp);
- if (DotProduct(temp, temp) > (surf->poly_radius2 + e->cullradius2))
- continue;
- if (maxverts < surf->poly_numverts)
- {
- maxverts = surf->poly_numverts;
- if (verts)
- Mem_Free(verts);
- verts = Mem_Alloc(loadmodel->mempool, maxverts * sizeof(float[3]));
- }
- // copy the original polygon, reversed, for the front cap of the volume
- for (k = 0, v0 = surf->poly_verts + (surf->poly_numverts - 1) * 3, v1 = verts;k < surf->poly_numverts;k++, v0 -= 3, v1 += 3)
- VectorCopy(v0, v1);
- Mod_SVBSP_AddPolygon(svbsproot, surf->poly_numverts, verts, constructmode, surf->poly_center, __LINE__);
- // project the original polygon, for the back cap of the volume
- for (k = 0, v0 = surf->poly_verts, v1 = verts;k < surf->poly_numverts;k++, v0 += 3, v1 += 3)
- {
- VectorSubtract(v0, e->origin, temp);
- VectorNormalize(temp);
- VectorMA(v0, projectdistance, temp, v1);
- }
- Mod_SVBSP_AddPolygon(svbsproot, surf->poly_numverts, verts, constructmode, surf->poly_center, __LINE__);
- // project the shadow volume sides
- for (k = 0, v0 = surf->poly_verts + (surf->poly_numverts - 1) * 3, v1 = surf->poly_verts;k < surf->poly_numverts;k++, v0 = v1, v1 += 3)
- {
- VectorCopy(v0, &verts[0]);
- VectorCopy(v1, &verts[3]);
- VectorCopy(v1, &verts[6]);
- VectorCopy(v0, &verts[9]);
- VectorSubtract(&verts[6], e->origin, temp);
- VectorNormalize(temp);
- VectorMA(&verts[6], projectdistance, temp, &verts[6]);
- VectorSubtract(&verts[9], e->origin, temp);
- VectorNormalize(temp);
- VectorMA(&verts[9], projectdistance, temp, &verts[9]);
- Mod_SVBSP_AddPolygon(svbsproot, 4, verts, constructmode, surf->poly_center, __LINE__);
- }
- }
-#else
- for (j = 0;j < e->numsurfaces;j++)
- {
- surf = e->surfaces[j];
- if (!(surf->flags & SURF_CLIPSOLID))
- continue;
- f = DotProduct(e->origin, surf->plane->normal) - surf->plane->dist;
- if (surf->flags & SURF_PLANEBACK)
- f = -f;
- projectdistance = e->cullradius - f;
- if (projectdistance < 0.1 || projectdistance > e->cullradius)
- continue;
- VectorSubtract(e->origin, surf->poly_center, temp);
- if (DotProduct(temp, temp) > (surf->poly_radius2 + e->cullradius2))
- continue;
- if (maxverts < surf->poly_numverts)
- {
- maxverts = surf->poly_numverts;
- if (verts)
- Mem_Free(verts);
- verts = Mem_Alloc(loadmodel->mempool, maxverts * sizeof(float[3]));
- }
- // copy the original polygon, for the front cap of the volume
- for (k = 0, v0 = surf->poly_verts, v1 = verts;k < surf->poly_numverts;k++, v0 += 3, v1 += 3)
- VectorCopy(v0, v1);
- Mod_SVBSP_AddPolygon(svbsproot, surf->poly_numverts, verts, constructmode, surf->poly_center, __LINE__);
- // project the original polygon, reversed, for the back cap of the volume
- for (k = 0, v0 = surf->poly_verts + (surf->poly_numverts - 1) * 3, v1 = verts;k < surf->poly_numverts;k++, v0 -= 3, v1 += 3)
- {
- VectorSubtract(v0, e->origin, temp);
- VectorNormalize(temp);
- VectorMA(v0, projectdistance, temp, v1);
- }
- Mod_SVBSP_AddPolygon(svbsproot, surf->poly_numverts, verts, constructmode, surf->poly_center, __LINE__);
- // project the shadow volume sides
- for (k = 0, v0 = surf->poly_verts + (surf->poly_numverts - 1) * 3, v1 = surf->poly_verts;k < surf->poly_numverts;k++, v0 = v1, v1 += 3)
- {
- VectorCopy(v1, &verts[0]);
- VectorCopy(v0, &verts[3]);
- VectorCopy(v0, &verts[6]);
- VectorCopy(v1, &verts[9]);
- VectorSubtract(&verts[6], e->origin, temp);
- VectorNormalize(temp);
- VectorMA(&verts[6], projectdistance, temp, &verts[6]);
- VectorSubtract(&verts[9], e->origin, temp);
- VectorNormalize(temp);
- VectorMA(&verts[9], projectdistance, temp, &verts[9]);
- Mod_SVBSP_AddPolygon(svbsproot, 4, verts, constructmode, surf->poly_center, __LINE__);
- }
- }
-#endif
- }
- if (verts)
- Mem_Free(verts);
-
- svbsp_count_nodes = 0;
- svbsp_count_leafs = 0;
- svbsp_count_polygons = 0;
- svbsp_count_darkleafs = 0;
- svbsp_count_meshs = 0;
- svbsp_count_triangles = 0;
- svbsp_count_vertices = 0;
- e->shadowvolume = Mod_SVBSP_BuildTriangleMeshs(svbsproot, e->shadowvolumemins, e->shadowvolumemaxs);
- Mod_SVBSP_RecursiveGatherStats(svbsproot);
- Mod_SVBSP_FreeTree(svbsproot);
- Con_Printf("light %d (radius %d) has %d surfaces, svbsp contains %d nodes, %d leafs, %d are dark (%d%%), %d original polygons, %d polygons stored (%d%%), %d meshs %d vertices %d triangles\n", lnum, (int)e->cullradius, e->numsurfaces, svbsp_count_nodes, svbsp_count_leafs, svbsp_count_darkleafs, svbsp_count_leafs ? (100 * svbsp_count_darkleafs / svbsp_count_leafs) : 0, svbsp_count_originalpolygons, svbsp_count_polygons, svbsp_count_originalpolygons ? (100 * svbsp_count_polygons / svbsp_count_originalpolygons) : 0, svbsp_count_meshs, svbsp_count_triangles, svbsp_count_vertices);
- }
-#endif
- }
-}
-
-
-/*
-=================
-Mod_LoadVisibility
-=================
-*/
-static void Mod_LoadVisibility (lump_t *l)
-{
- loadmodel->visdata = NULL;
- if (!l->filelen)
- return;
- loadmodel->visdata = Mem_Alloc(loadmodel->mempool, l->filelen);
- memcpy (loadmodel->visdata, mod_base + l->fileofs, l->filelen);
-}
-
-// used only for HalfLife maps
-void Mod_ParseWadsFromEntityLump(const char *data)
-{
- char key[128], value[4096];
- char wadname[128];
- int i, j, k;
- if (!data)
- return;
- if (!COM_ParseToken(&data))
- return; // error
- if (com_token[0] != '{')
- return; // error
- while (1)
- {
- if (!COM_ParseToken(&data))
- return; // error
- if (com_token[0] == '}')
- break; // end of worldspawn
- if (com_token[0] == '_')
- strcpy(key, com_token + 1);
- else
- strcpy(key, com_token);
- while (key[strlen(key)-1] == ' ') // remove trailing spaces
- key[strlen(key)-1] = 0;
- if (!COM_ParseToken(&data))
- return; // error
- strcpy(value, com_token);
- if (!strcmp("wad", key)) // for HalfLife maps
- {
- if (loadmodel->ishlbsp)
- {
- j = 0;
- for (i = 0;i < 4096;i++)
- if (value[i] != ';' && value[i] != '\\' && value[i] != '/' && value[i] != ':')
- break;
- if (value[i])
- {
- for (;i < 4096;i++)
- {
- // ignore path - the \\ check is for HalfLife... stupid windoze 'programmers'...
- if (value[i] == '\\' || value[i] == '/' || value[i] == ':')
- j = i+1;
- else if (value[i] == ';' || value[i] == 0)
- {
- k = value[i];
- value[i] = 0;
- strcpy(wadname, "textures/");
- strcat(wadname, &value[j]);
- W_LoadTextureWadFile (wadname, false);
- j = i+1;
- if (!k)
- break;
- }
- }
- }
- }
- }
- }
-}
-
-/*
-=================
-Mod_LoadEntities
-=================
-*/
-static void Mod_LoadEntities (lump_t *l)
-{
- loadmodel->entities = NULL;
- if (!l->filelen)
- return;
- loadmodel->entities = Mem_Alloc(loadmodel->mempool, l->filelen);
- memcpy (loadmodel->entities, mod_base + l->fileofs, l->filelen);
- if (loadmodel->ishlbsp)
- Mod_ParseWadsFromEntityLump(loadmodel->entities);
-}
-
-
-/*
-=================
-Mod_LoadVertexes
-=================
-*/
-static void Mod_LoadVertexes (lump_t *l)
-{
- dvertex_t *in;
- mvertex_t *out;
- int i, count;
-
- in = (void *)(mod_base + l->fileofs);
- if (l->filelen % sizeof(*in))
- Host_Error ("MOD_LoadBmodel: funny lump size in %s",loadmodel->name);
- count = l->filelen / sizeof(*in);
- out = Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
-
- loadmodel->vertexes = out;
- loadmodel->numvertexes = count;
-
- for ( i=0 ; i<count ; i++, in++, out++)
- {
- out->position[0] = LittleFloat (in->point[0]);
- out->position[1] = LittleFloat (in->point[1]);
- out->position[2] = LittleFloat (in->point[2]);
- }
-}
-
-/*
-=================
-Mod_LoadSubmodels
-=================
-*/
-static void Mod_LoadSubmodels (lump_t *l)
-{
- dmodel_t *in;
- dmodel_t *out;
- int i, j, count;
-
- in = (void *)(mod_base + l->fileofs);
- if (l->filelen % sizeof(*in))
- Host_Error ("MOD_LoadBmodel: funny lump size in %s",loadmodel->name);
- count = l->filelen / sizeof(*in);
- out = Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
-
- loadmodel->submodels = out;
- loadmodel->numsubmodels = count;
-
- for ( i=0 ; i<count ; i++, in++, out++)
- {
- for (j=0 ; j<3 ; j++)
- {
- // spread the mins / maxs by a pixel
- out->mins[j] = LittleFloat (in->mins[j]) - 1;
- out->maxs[j] = LittleFloat (in->maxs[j]) + 1;
- out->origin[j] = LittleFloat (in->origin[j]);
- }
- for (j=0 ; j<MAX_MAP_HULLS ; j++)
- out->headnode[j] = LittleLong (in->headnode[j]);
- out->visleafs = LittleLong (in->visleafs);
- out->firstface = LittleLong (in->firstface);
- out->numfaces = LittleLong (in->numfaces);
- }
-}
-
-/*
-=================
-Mod_LoadEdges
-=================
-*/
-static void Mod_LoadEdges (lump_t *l)
-{
- dedge_t *in;
- medge_t *out;
- int i, count;
-
- in = (void *)(mod_base + l->fileofs);
- if (l->filelen % sizeof(*in))
- Host_Error ("MOD_LoadBmodel: funny lump size in %s",loadmodel->name);
- count = l->filelen / sizeof(*in);
- out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
-
- loadmodel->edges = out;
- loadmodel->numedges = count;
-
- for ( i=0 ; i<count ; i++, in++, out++)
- {
- out->v[0] = (unsigned short)LittleShort(in->v[0]);
- out->v[1] = (unsigned short)LittleShort(in->v[1]);
- }
-}
-
-/*
-=================
-Mod_LoadTexinfo
-=================
-*/
-static void Mod_LoadTexinfo (lump_t *l)
-{
- texinfo_t *in;
- mtexinfo_t *out;
- int i, j, k, count, miptex;
-
- in = (void *)(mod_base + l->fileofs);
- if (l->filelen % sizeof(*in))
- Host_Error ("MOD_LoadBmodel: funny lump size in %s",loadmodel->name);
- count = l->filelen / sizeof(*in);
- out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
-
- loadmodel->texinfo = out;
- loadmodel->numtexinfo = count;
-
- for (i = 0;i < count;i++, in++, out++)
- {
- for (k = 0;k < 2;k++)
- for (j = 0;j < 4;j++)
- out->vecs[k][j] = LittleFloat (in->vecs[k][j]);
-
- miptex = LittleLong (in->miptex);
- out->flags = LittleLong (in->flags);
-
- out->texture = NULL;
- if (loadmodel->textures)
- {
- if ((unsigned int) miptex >= (unsigned int) loadmodel->numtextures)
- Con_Printf ("error in model \"%s\": invalid miptex index %i (of %i)\n", loadmodel->name, miptex, loadmodel->numtextures);
- else
- out->texture = loadmodel->textures + miptex;
- }
- if (out->flags & TEX_SPECIAL)
- {
- // if texture chosen is NULL or the shader needs a lightmap,
- // force to notexture water shader
- if (out->texture == NULL || out->texture->shader->flags & SHADERFLAGS_NEEDLIGHTMAP)
- out->texture = loadmodel->textures + (loadmodel->numtextures - 1);
- }
- else
- {
- // if texture chosen is NULL, force to notexture
- if (out->texture == NULL)
- out->texture = loadmodel->textures + (loadmodel->numtextures - 2);
- }
- }
-}
-
-/*
-================
-CalcSurfaceExtents
-
-Fills in s->texturemins[] and s->extents[]
-================
-*/
-static void CalcSurfaceExtents (msurface_t *s)
-{
- float mins[2], maxs[2], val;
- int i,j, e;
- mvertex_t *v;
- mtexinfo_t *tex;
- int bmins[2], bmaxs[2];
-
- mins[0] = mins[1] = 999999999;
- maxs[0] = maxs[1] = -999999999;
-
- tex = s->texinfo;
-
- for (i=0 ; i<s->numedges ; i++)
- {
- e = loadmodel->surfedges[s->firstedge+i];
- if (e >= 0)
- v = &loadmodel->vertexes[loadmodel->edges[e].v[0]];
- else
- v = &loadmodel->vertexes[loadmodel->edges[-e].v[1]];
-
- for (j=0 ; j<2 ; j++)
- {
- val = v->position[0] * tex->vecs[j][0] +
- v->position[1] * tex->vecs[j][1] +
- v->position[2] * tex->vecs[j][2] +
- tex->vecs[j][3];
- if (val < mins[j])
- mins[j] = val;
- if (val > maxs[j])
- maxs[j] = val;
- }
- }
-
- for (i=0 ; i<2 ; i++)
- {
- bmins[i] = floor(mins[i]/16);
- bmaxs[i] = ceil(maxs[i]/16);
-
- s->texturemins[i] = bmins[i] * 16;
- s->extents[i] = (bmaxs[i] - bmins[i]) * 16;
- }
-}
-
-
-void BoundPoly (int numverts, float *verts, vec3_t mins, vec3_t maxs)
-{
- int i, j;
- float *v;
-
- mins[0] = mins[1] = mins[2] = 9999;
- maxs[0] = maxs[1] = maxs[2] = -9999;
- v = verts;
- for (i = 0;i < numverts;i++)
- {
- for (j = 0;j < 3;j++, v++)
- {
- if (*v < mins[j])
- mins[j] = *v;
- if (*v > maxs[j])
- maxs[j] = *v;
- }
- }
-}
-
-#if 0
-#define MAX_SUBDIVPOLYTRIANGLES 4096
-#define MAX_SUBDIVPOLYVERTS (MAX_SUBDIVPOLYTRIANGLES * 3)
-
-static int subdivpolyverts, subdivpolytriangles;
-static int subdivpolyindex[MAX_SUBDIVPOLYTRIANGLES][3];
-static float subdivpolyvert[MAX_SUBDIVPOLYVERTS][3];
-
-static int subdivpolylookupvert(vec3_t v)
+static int subdivpolyverts, subdivpolytriangles;
+static int subdivpolyindex[MAX_SUBDIVPOLYTRIANGLES][3];
+static float subdivpolyvert[MAX_SUBDIVPOLYVERTS][3];
+
+static int subdivpolylookupvert(vec3_t v)
{
int i;
for (i = 0;i < subdivpolyverts;i++)
for (j = 0;j < 3;j++)
mesh->index[i*3+j] = subdivpolyindex[i][j];
- for (i = 0, v = mesh->vertex;i < subdivpolyverts;i++, v++)
- {
- VectorCopy(subdivpolyvert[i], v->v);
- v->st[0] = DotProduct (v->v, surf->texinfo->vecs[0]);
- v->st[1] = DotProduct (v->v, surf->texinfo->vecs[1]);
+ for (i = 0, v = mesh->vertex;i < subdivpolyverts;i++, v++)
+ {
+ VectorCopy(subdivpolyvert[i], v->v);
+ v->st[0] = DotProduct (v->v, surf->texinfo->vecs[0]);
+ v->st[1] = DotProduct (v->v, surf->texinfo->vecs[1]);
+ }
+}
+#endif
+
+surfmesh_t *Mod_AllocSurfMesh(int numverts, int numtriangles)
+{
+ surfmesh_t *mesh;
+ mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + numtriangles * sizeof(int[6]) + numverts * (3 + 2 + 2 + 2 + 3 + 3 + 3 + 1) * sizeof(float));
+ mesh->numverts = numverts;
+ mesh->numtriangles = numtriangles;
+ mesh->vertex3f = (float *)(mesh + 1);
+ mesh->texcoordtexture2f = mesh->vertex3f + mesh->numverts * 3;
+ mesh->texcoordlightmap2f = mesh->texcoordtexture2f + mesh->numverts * 2;
+ mesh->texcoorddetail2f = mesh->texcoordlightmap2f + mesh->numverts * 2;
+ mesh->svector3f = (float *)(mesh->texcoorddetail2f + mesh->numverts * 2);
+ mesh->tvector3f = mesh->svector3f + mesh->numverts * 3;
+ mesh->normal3f = mesh->tvector3f + mesh->numverts * 3;
+ mesh->lightmapoffsets = (int *)(mesh->normal3f + mesh->numverts * 3);
+ mesh->element3i = mesh->lightmapoffsets + mesh->numverts;
+ mesh->neighbor3i = mesh->element3i + mesh->numtriangles * 3;
+ return mesh;
+}
+
+void Mod_GenerateSurfacePolygon (msurface_t *surf, int firstedge, int numedges)
+{
+ int i, lindex, j;
+ float *vec, *vert, mins[3], maxs[3], val, *v;
+ mtexinfo_t *tex;
+
+ // convert edges back to a normal polygon
+ surf->poly_numverts = numedges;
+ vert = surf->poly_verts = Mem_Alloc(loadmodel->mempool, sizeof(float[3]) * numedges);
+ for (i = 0;i < numedges;i++)
+ {
+ lindex = loadmodel->surfedges[firstedge + i];
+ if (lindex > 0)
+ vec = loadmodel->vertexes[loadmodel->edges[lindex].v[0]].position;
+ else
+ vec = loadmodel->vertexes[loadmodel->edges[-lindex].v[1]].position;
+ VectorCopy (vec, vert);
+ vert += 3;
+ }
+
+ // calculate polygon bounding box and center
+ vert = surf->poly_verts;
+ VectorCopy(vert, mins);
+ VectorCopy(vert, maxs);
+ vert += 3;
+ for (i = 1;i < surf->poly_numverts;i++, vert += 3)
+ {
+ if (mins[0] > vert[0]) mins[0] = vert[0];if (maxs[0] < vert[0]) maxs[0] = vert[0];
+ if (mins[1] > vert[1]) mins[1] = vert[1];if (maxs[1] < vert[1]) maxs[1] = vert[1];
+ if (mins[2] > vert[2]) mins[2] = vert[2];if (maxs[2] < vert[2]) maxs[2] = vert[2];
+ }
+ VectorCopy(mins, surf->poly_mins);
+ VectorCopy(maxs, surf->poly_maxs);
+ surf->poly_center[0] = (mins[0] + maxs[0]) * 0.5f;
+ surf->poly_center[1] = (mins[1] + maxs[1]) * 0.5f;
+ surf->poly_center[2] = (mins[2] + maxs[2]) * 0.5f;
+
+ // generate surface extents information
+ tex = surf->texinfo;
+ mins[0] = maxs[0] = DotProduct(surf->poly_verts, tex->vecs[0]) + tex->vecs[0][3];
+ mins[1] = maxs[1] = DotProduct(surf->poly_verts, tex->vecs[1]) + tex->vecs[1][3];
+ for (i = 1, v = surf->poly_verts + 3;i < surf->poly_numverts;i++, v += 3)
+ {
+ for (j = 0;j < 2;j++)
+ {
+ val = DotProduct(v, tex->vecs[j]) + tex->vecs[j][3];
+ if (mins[j] > val)
+ mins[j] = val;
+ if (maxs[j] < val)
+ maxs[j] = val;
+ }
+ }
+ for (i = 0;i < 2;i++)
+ {
+ surf->texturemins[i] = (int) floor(mins[i] / 16) * 16;
+ surf->extents[i] = (int) ceil(maxs[i] / 16) * 16 - surf->texturemins[i];
+ }
+}
+
+/*
+=================
+Mod_LoadFaces
+=================
+*/
+static void Mod_LoadFaces (lump_t *l)
+{
+ dface_t *in;
+ msurface_t *surf;
+ int i, count, surfnum, planenum, ssize, tsize, firstedge, numedges, totalverts, totaltris, totalmeshes;
+ surfmesh_t *mesh;
+ float s, t;
+
+ in = (void *)(mod_base + l->fileofs);
+ if (l->filelen % sizeof(*in))
+ Host_Error ("MOD_LoadBmodel: funny lump size in %s",loadmodel->name);
+ count = l->filelen / sizeof(*in);
+ loadmodel->surfaces = Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_t));
+
+ loadmodel->numsurfaces = count;
+ loadmodel->surfacevisframes = Mem_Alloc(loadmodel->mempool, count * sizeof(int));
+ loadmodel->surfacepvsframes = Mem_Alloc(loadmodel->mempool, count * sizeof(int));
+ loadmodel->pvssurflist = Mem_Alloc(loadmodel->mempool, count * sizeof(int));
+
+ for (surfnum = 0, surf = loadmodel->surfaces, totalverts = 0, totaltris = 0, totalmeshes = 0;surfnum < count;surfnum++, totalverts += surf->poly_numverts, totaltris += surf->poly_numverts - 2, totalmeshes++, in++, surf++)
+ {
+ surf->number = surfnum;
+ // FIXME: validate edges, texinfo, etc?
+ firstedge = LittleLong(in->firstedge);
+ numedges = LittleShort(in->numedges);
+ if ((unsigned int) firstedge > (unsigned int) loadmodel->numsurfedges || (unsigned int) numedges > (unsigned int) loadmodel->numsurfedges || (unsigned int) firstedge + (unsigned int) numedges > (unsigned int) loadmodel->numsurfedges)
+ Host_Error("Mod_LoadFaces: invalid edge range (firstedge %i, numedges %i, model edges %i)\n", firstedge, numedges, loadmodel->numsurfedges);
+ i = LittleShort (in->texinfo);
+ if ((unsigned int) i >= (unsigned int) loadmodel->numtexinfo)
+ Host_Error("Mod_LoadFaces: invalid texinfo index %i (model has %i texinfos)\n", i, loadmodel->numtexinfo);
+ surf->texinfo = loadmodel->texinfo + i;
+ surf->flags = surf->texinfo->texture->flags;
+
+ planenum = LittleShort(in->planenum);
+ if ((unsigned int) planenum >= (unsigned int) loadmodel->numplanes)
+ Host_Error("Mod_LoadFaces: invalid plane index %i (model has %i planes)\n", planenum, loadmodel->numplanes);
+
+ if (LittleShort(in->side))
+ surf->flags |= SURF_PLANEBACK;
+
+ surf->plane = loadmodel->planes + planenum;
+
+ // clear lightmap (filled in later)
+ surf->lightmaptexture = NULL;
+
+ // force lightmap upload on first time seeing the surface
+ surf->cached_dlight = true;
+
+ Mod_GenerateSurfacePolygon(surf, firstedge, numedges);
+
+ ssize = (surf->extents[0] >> 4) + 1;
+ tsize = (surf->extents[1] >> 4) + 1;
+
+ // lighting info
+ for (i = 0;i < MAXLIGHTMAPS;i++)
+ surf->styles[i] = in->styles[i];
+ i = LittleLong(in->lightofs);
+ if (i == -1)
+ surf->samples = NULL;
+ else if (loadmodel->ishlbsp) // LordHavoc: HalfLife map (bsp version 30)
+ surf->samples = loadmodel->lightdata + i;
+ else // LordHavoc: white lighting (bsp version 29)
+ surf->samples = loadmodel->lightdata + (i * 3);
+
+ if (surf->texinfo->texture->shader == &Cshader_wall_lightmap)
+ {
+ if ((surf->extents[0] >> 4) + 1 > (256) || (surf->extents[1] >> 4) + 1 > (256))
+ Host_Error ("Bad surface extents");
+ // stainmap for permanent marks on walls
+ surf->stainsamples = Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
+ // clear to white
+ memset(surf->stainsamples, 255, ssize * tsize * 3);
+ }
+ }
+
+ loadmodel->entiremesh = Mod_AllocSurfMesh(totalverts, totaltris);
+ loadmodel->surfmeshes = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) * totalmeshes);
+
+ for (surfnum = 0, surf = loadmodel->surfaces, totalverts = 0, totaltris = 0, totalmeshes = 0;surfnum < count;surfnum++, totalverts += surf->poly_numverts, totaltris += surf->poly_numverts - 2, totalmeshes++, surf++)
+ {
+ mesh = surf->mesh = loadmodel->surfmeshes + totalmeshes;
+ mesh->numverts = surf->poly_numverts;
+ mesh->numtriangles = surf->poly_numverts - 2;
+ mesh->vertex3f = loadmodel->entiremesh->vertex3f + totalverts * 3;
+ mesh->texcoordtexture2f = loadmodel->entiremesh->texcoordtexture2f + totalverts * 2;
+ mesh->texcoordlightmap2f = loadmodel->entiremesh->texcoordlightmap2f + totalverts * 2;
+ mesh->texcoorddetail2f = loadmodel->entiremesh->texcoorddetail2f + totalverts * 2;
+ mesh->svector3f = loadmodel->entiremesh->svector3f + totalverts * 3;
+ mesh->tvector3f = loadmodel->entiremesh->tvector3f + totalverts * 3;
+ mesh->normal3f = loadmodel->entiremesh->normal3f + totalverts * 3;
+ mesh->lightmapoffsets = loadmodel->entiremesh->lightmapoffsets + totalverts;
+ mesh->element3i = loadmodel->entiremesh->element3i + totaltris * 3;
+ mesh->neighbor3i = loadmodel->entiremesh->neighbor3i + totaltris * 3;
+
+ surf->lightmaptexturestride = 0;
+ surf->lightmaptexture = NULL;
+
+ for (i = 0;i < mesh->numverts;i++)
+ {
+ mesh->vertex3f[i * 3 + 0] = surf->poly_verts[i * 3 + 0];
+ mesh->vertex3f[i * 3 + 1] = surf->poly_verts[i * 3 + 1];
+ mesh->vertex3f[i * 3 + 2] = surf->poly_verts[i * 3 + 2];
+ s = DotProduct ((mesh->vertex3f + i * 3), surf->texinfo->vecs[0]) + surf->texinfo->vecs[0][3];
+ t = DotProduct ((mesh->vertex3f + i * 3), surf->texinfo->vecs[1]) + surf->texinfo->vecs[1][3];
+ mesh->texcoordtexture2f[i * 2 + 0] = s / surf->texinfo->texture->width;
+ mesh->texcoordtexture2f[i * 2 + 1] = t / surf->texinfo->texture->height;
+ mesh->texcoorddetail2f[i * 2 + 0] = s * (1.0f / 16.0f);
+ mesh->texcoorddetail2f[i * 2 + 1] = t * (1.0f / 16.0f);
+ mesh->texcoordlightmap2f[i * 2 + 0] = 0;
+ mesh->texcoordlightmap2f[i * 2 + 1] = 0;
+ mesh->lightmapoffsets[i] = 0;
+ }
+
+ for (i = 0;i < mesh->numtriangles;i++)
+ {
+ mesh->element3i[i * 3 + 0] = 0;
+ mesh->element3i[i * 3 + 1] = i + 1;
+ mesh->element3i[i * 3 + 2] = i + 2;
+ }
+
+ Mod_BuildTriangleNeighbors(mesh->neighbor3i, mesh->element3i, mesh->numtriangles);
+ Mod_BuildTextureVectorsAndNormals(mesh->numverts, mesh->numtriangles, mesh->vertex3f, mesh->texcoordtexture2f, mesh->element3i, mesh->svector3f, mesh->tvector3f, mesh->normal3f);
+
+ if (surf->texinfo->texture->shader == &Cshader_wall_lightmap)
+ {
+ int i, iu, iv, smax, tmax;
+ float u, v, ubase, vbase, uscale, vscale;
+
+ smax = surf->extents[0] >> 4;
+ tmax = surf->extents[1] >> 4;
+
+ surf->flags |= SURF_LIGHTMAP;
+ if (r_miplightmaps.integer)
+ {
+ surf->lightmaptexturestride = smax+1;
+ surf->lightmaptexture = R_LoadTexture2D(loadmodel->texturepool, NULL, surf->lightmaptexturestride, (surf->extents[1]>>4)+1, NULL, loadmodel->lightmaprgba ? TEXTYPE_RGBA : TEXTYPE_RGB, TEXF_MIPMAP | TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
+ }
+ else
+ {
+ surf->lightmaptexturestride = R_CompatibleFragmentWidth(smax+1, loadmodel->lightmaprgba ? TEXTYPE_RGBA : TEXTYPE_RGB, 0);
+ surf->lightmaptexture = R_LoadTexture2D(loadmodel->texturepool, NULL, surf->lightmaptexturestride, (surf->extents[1]>>4)+1, NULL, loadmodel->lightmaprgba ? TEXTYPE_RGBA : TEXTYPE_RGB, TEXF_FRAGMENT | TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
+ }
+ R_FragmentLocation(surf->lightmaptexture, NULL, NULL, &ubase, &vbase, &uscale, &vscale);
+ uscale = (uscale - ubase) / (smax + 1);
+ vscale = (vscale - vbase) / (tmax + 1);
+
+ for (i = 0;i < mesh->numverts;i++)
+ {
+ u = ((DotProduct ((mesh->vertex3f + i * 3), surf->texinfo->vecs[0]) + surf->texinfo->vecs[0][3]) + 8 - surf->texturemins[0]) * (1.0 / 16.0);
+ v = ((DotProduct ((mesh->vertex3f + i * 3), surf->texinfo->vecs[1]) + surf->texinfo->vecs[1][3]) + 8 - surf->texturemins[1]) * (1.0 / 16.0);
+ mesh->texcoordlightmap2f[i * 2 + 0] = u * uscale + ubase;
+ mesh->texcoordlightmap2f[i * 2 + 1] = v * vscale + vbase;
+ // LordHavoc: calc lightmap data offset for vertex lighting to use
+ iu = (int) u;
+ iv = (int) v;
+ mesh->lightmapoffsets[i] = (bound(0, iv, tmax) * (smax+1) + bound(0, iu, smax)) * 3;
+ }
+ }
+ }
+}
+
+/*
+=================
+Mod_SetParent
+=================
+*/
+static void Mod_SetParent (mnode_t *node, mnode_t *parent)
+{
+ node->parent = parent;
+ if (node->contents < 0)
+ return;
+ Mod_SetParent (node->children[0], node);
+ Mod_SetParent (node->children[1], node);
+}
+
+/*
+=================
+Mod_LoadNodes
+=================
+*/
+static void Mod_LoadNodes (lump_t *l)
+{
+ int i, j, count, p;
+ dnode_t *in;
+ mnode_t *out;
+
+ in = (void *)(mod_base + l->fileofs);
+ if (l->filelen % sizeof(*in))
+ Host_Error ("MOD_LoadBmodel: funny lump size in %s",loadmodel->name);
+ count = l->filelen / sizeof(*in);
+ out = Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
+
+ loadmodel->nodes = out;
+ loadmodel->numnodes = count;
+
+ for ( i=0 ; i<count ; i++, in++, out++)
+ {
+ for (j=0 ; j<3 ; j++)
+ {
+ out->mins[j] = LittleShort (in->mins[j]);
+ out->maxs[j] = LittleShort (in->maxs[j]);
+ }
+
+ p = LittleLong(in->planenum);
+ out->plane = loadmodel->planes + p;
+
+ out->firstsurface = LittleShort (in->firstface);
+ out->numsurfaces = LittleShort (in->numfaces);
+
+ for (j=0 ; j<2 ; j++)
+ {
+ p = LittleShort (in->children[j]);
+ if (p >= 0)
+ out->children[j] = loadmodel->nodes + p;
+ else
+ out->children[j] = (mnode_t *)(loadmodel->leafs + (-1 - p));
+ }
+ }
+
+ Mod_SetParent (loadmodel->nodes, NULL); // sets nodes and leafs
+}
+
+/*
+=================
+Mod_LoadLeafs
+=================
+*/
+static void Mod_LoadLeafs (lump_t *l)
+{
+ dleaf_t *in;
+ mleaf_t *out;
+ int i, j, count, p;
+
+ in = (void *)(mod_base + l->fileofs);
+ if (l->filelen % sizeof(*in))
+ Host_Error ("MOD_LoadBmodel: funny lump size in %s",loadmodel->name);
+ count = l->filelen / sizeof(*in);
+ out = Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
+
+ loadmodel->leafs = out;
+ loadmodel->numleafs = count;
+
+ for ( i=0 ; i<count ; i++, in++, out++)
+ {
+ for (j=0 ; j<3 ; j++)
+ {
+ out->mins[j] = LittleShort (in->mins[j]);
+ out->maxs[j] = LittleShort (in->maxs[j]);
+ }
+
+ p = LittleLong(in->contents);
+ out->contents = p;
+
+ out->firstmarksurface = loadmodel->marksurfaces +
+ LittleShort(in->firstmarksurface);
+ out->nummarksurfaces = LittleShort(in->nummarksurfaces);
+
+ p = LittleLong(in->visofs);
+ if (p == -1)
+ out->compressed_vis = NULL;
+ else
+ out->compressed_vis = loadmodel->visdata + p;
+
+ for (j=0 ; j<4 ; j++)
+ out->ambient_sound_level[j] = in->ambient_level[j];
+
+ // FIXME: Insert caustics here
}
}
-#endif
-void Mod_GenerateWallMesh (msurface_t *surf, int vertexonly)
+/*
+=================
+Mod_LoadClipnodes
+=================
+*/
+static void Mod_LoadClipnodes (lump_t *l)
{
- int i, iu, iv, *index, smax, tmax;
- float *in, s, t, u, v, ubase, vbase, uscale, vscale, normal[3];
- surfmesh_t *mesh;
+ dclipnode_t *in, *out;
+ int i, count;
+ hull_t *hull;
+
+ in = (void *)(mod_base + l->fileofs);
+ if (l->filelen % sizeof(*in))
+ Host_Error ("MOD_LoadBmodel: funny lump size in %s",loadmodel->name);
+ count = l->filelen / sizeof(*in);
+ out = Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
- smax = surf->extents[0] >> 4;
- tmax = surf->extents[1] >> 4;
+ loadmodel->clipnodes = out;
+ loadmodel->numclipnodes = count;
- if (vertexonly)
+ if (loadmodel->ishlbsp)
{
- surf->lightmaptexturestride = 0;
- surf->lightmaptexture = NULL;
- uscale = 0;
- vscale = 0;
- ubase = 0;
- vbase = 0;
+ hull = &loadmodel->hulls[1];
+ hull->clipnodes = out;
+ hull->firstclipnode = 0;
+ hull->lastclipnode = count-1;
+ hull->planes = loadmodel->planes;
+ hull->clip_mins[0] = -16;
+ hull->clip_mins[1] = -16;
+ hull->clip_mins[2] = -36;
+ hull->clip_maxs[0] = 16;
+ hull->clip_maxs[1] = 16;
+ hull->clip_maxs[2] = 36;
+ VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
+
+ hull = &loadmodel->hulls[2];
+ hull->clipnodes = out;
+ hull->firstclipnode = 0;
+ hull->lastclipnode = count-1;
+ hull->planes = loadmodel->planes;
+ hull->clip_mins[0] = -32;
+ hull->clip_mins[1] = -32;
+ hull->clip_mins[2] = -32;
+ hull->clip_maxs[0] = 32;
+ hull->clip_maxs[1] = 32;
+ hull->clip_maxs[2] = 32;
+ VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
+
+ hull = &loadmodel->hulls[3];
+ hull->clipnodes = out;
+ hull->firstclipnode = 0;
+ hull->lastclipnode = count-1;
+ hull->planes = loadmodel->planes;
+ hull->clip_mins[0] = -16;
+ hull->clip_mins[1] = -16;
+ hull->clip_mins[2] = -18;
+ hull->clip_maxs[0] = 16;
+ hull->clip_maxs[1] = 16;
+ hull->clip_maxs[2] = 18;
+ VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
}
else
{
- surf->flags |= SURF_LIGHTMAP;
- if (r_miplightmaps.integer)
- {
- surf->lightmaptexturestride = (surf->extents[0]>>4)+1;
- surf->lightmaptexture = R_LoadTexture(loadmodel->texturepool, NULL, surf->lightmaptexturestride, (surf->extents[1]>>4)+1, NULL, loadmodel->lightmaprgba ? TEXTYPE_RGBA : TEXTYPE_RGB, TEXF_MIPMAP | TEXF_PRECACHE);
- }
- else
- {
- surf->lightmaptexturestride = R_CompatibleFragmentWidth((surf->extents[0]>>4)+1, loadmodel->lightmaprgba ? TEXTYPE_RGBA : TEXTYPE_RGB, 0);
- surf->lightmaptexture = R_LoadTexture(loadmodel->texturepool, NULL, surf->lightmaptexturestride, (surf->extents[1]>>4)+1, NULL, loadmodel->lightmaprgba ? TEXTYPE_RGBA : TEXTYPE_RGB, TEXF_FRAGMENT | TEXF_PRECACHE);
- }
- R_FragmentLocation(surf->lightmaptexture, NULL, NULL, &ubase, &vbase, &uscale, &vscale);
- uscale = (uscale - ubase) * 16.0 / ((surf->extents[0] & ~15) + 16);
- vscale = (vscale - vbase) * 16.0 / ((surf->extents[1] & ~15) + 16);
- }
+ hull = &loadmodel->hulls[1];
+ hull->clipnodes = out;
+ hull->firstclipnode = 0;
+ hull->lastclipnode = count-1;
+ hull->planes = loadmodel->planes;
+ hull->clip_mins[0] = -16;
+ hull->clip_mins[1] = -16;
+ hull->clip_mins[2] = -24;
+ hull->clip_maxs[0] = 16;
+ hull->clip_maxs[1] = 16;
+ hull->clip_maxs[2] = 32;
+ VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
- surf->mesh = mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + (surf->poly_numverts - 2) * sizeof(int[6]) + surf->poly_numverts * (4 + 2 + 2 + 2 + 1 + 3) * sizeof(float));
- mesh->numverts = surf->poly_numverts;
- mesh->numtriangles = surf->poly_numverts - 2;
- mesh->verts = (float *)(mesh + 1);
- mesh->st = mesh->verts + mesh->numverts * 4;
- mesh->uv = mesh->st + mesh->numverts * 2;
- mesh->ab = mesh->uv + mesh->numverts * 2;
- mesh->lightmapoffsets = (int *)(mesh->ab + mesh->numverts * 2);
- mesh->index = mesh->lightmapoffsets + mesh->numverts;
- mesh->triangleneighbors = mesh->index + mesh->numtriangles * 3;
- mesh->normals = (float *)(mesh->triangleneighbors + mesh->numtriangles * 3);
+ hull = &loadmodel->hulls[2];
+ hull->clipnodes = out;
+ hull->firstclipnode = 0;
+ hull->lastclipnode = count-1;
+ hull->planes = loadmodel->planes;
+ hull->clip_mins[0] = -32;
+ hull->clip_mins[1] = -32;
+ hull->clip_mins[2] = -24;
+ hull->clip_maxs[0] = 32;
+ hull->clip_maxs[1] = 32;
+ hull->clip_maxs[2] = 64;
+ VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
+ }
- index = mesh->index;
- for (i = 0;i < mesh->numtriangles;i++)
+ for (i=0 ; i<count ; i++, out++, in++)
{
- *index++ = 0;
- *index++ = i + 1;
- *index++ = i + 2;
- }
- Mod_BuildTriangleNeighbors(mesh->triangleneighbors, mesh->index, mesh->numtriangles);
-
- VectorCopy(surf->plane->normal, normal);
- if (surf->flags & SURF_PLANEBACK)
- VectorNegate(normal, normal);
- for (i = 0, in = surf->poly_verts;i < mesh->numverts;i++, in += 3)
- {
- s = DotProduct (in, surf->texinfo->vecs[0]) + surf->texinfo->vecs[0][3];
- t = DotProduct (in, surf->texinfo->vecs[1]) + surf->texinfo->vecs[1][3];
- u = (s + 8 - surf->texturemins[0]) * (1.0 / 16.0);
- v = (t + 8 - surf->texturemins[1]) * (1.0 / 16.0);
- // LordHavoc: calc lightmap data offset for vertex lighting to use
- iu = (int) u;
- iv = (int) v;
- iu = bound(0, iu, smax);
- iv = bound(0, iv, tmax);
- u = u * uscale + ubase;
- v = v * vscale + vbase;
-
- mesh->verts[i * 4 + 0] = in[0];
- mesh->verts[i * 4 + 1] = in[1];
- mesh->verts[i * 4 + 2] = in[2];
- mesh->st[i * 2 + 0] = s / surf->texinfo->texture->width;
- mesh->st[i * 2 + 1] = t / surf->texinfo->texture->height;
- mesh->uv[i * 2 + 0] = u;
- mesh->uv[i * 2 + 1] = v;
- mesh->ab[i * 2 + 0] = s * (1.0f / 16.0f);
- mesh->ab[i * 2 + 1] = t * (1.0f / 16.0f);
- mesh->lightmapoffsets[i] = ((iv * (smax+1) + iu) * 3);
- mesh->normals[i * 3 + 0] = normal[0];
- mesh->normals[i * 3 + 1] = normal[1];
- mesh->normals[i * 3 + 2] = normal[2];
- }
-}
-
-void Mod_GenerateVertexMesh (msurface_t *surf)
-{
- int i, *index;
- float *in, s, t, normal[3];
- surfmesh_t *mesh;
+ out->planenum = LittleLong(in->planenum);
+ out->children[0] = LittleShort(in->children[0]);
+ out->children[1] = LittleShort(in->children[1]);
+ if (out->children[0] >= count || out->children[1] >= count)
+ Host_Error("Corrupt clipping hull (out of range child)\n");
+ }
+}
+
+/*
+=================
+Mod_MakeHull0
- surf->lightmaptexturestride = 0;
- surf->lightmaptexture = NULL;
+Duplicate the drawing hull structure as a clipping hull
+=================
+*/
+static void Mod_MakeHull0 (void)
+{
+ mnode_t *in;
+ dclipnode_t *out;
+ int i;
+ hull_t *hull;
- surf->mesh = mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + (surf->poly_numverts - 2) * sizeof(int[6]) + surf->poly_numverts * (4 + 2 + 2 + 3) * sizeof(float));
- mesh->numverts = surf->poly_numverts;
- mesh->numtriangles = surf->poly_numverts - 2;
- mesh->verts = (float *)(mesh + 1);
- mesh->st = mesh->verts + mesh->numverts * 4;
- mesh->ab = mesh->st + mesh->numverts * 2;
- mesh->index = (int *)(mesh->ab + mesh->numverts * 2);
- mesh->triangleneighbors = mesh->index + mesh->numtriangles * 3;
- mesh->normals = (float *)(mesh->triangleneighbors + mesh->numtriangles * 3);
+ hull = &loadmodel->hulls[0];
- index = mesh->index;
- for (i = 0;i < mesh->numtriangles;i++)
- {
- *index++ = 0;
- *index++ = i + 1;
- *index++ = i + 2;
- }
- Mod_BuildTriangleNeighbors(mesh->triangleneighbors, mesh->index, mesh->numtriangles);
+ in = loadmodel->nodes;
+ out = Mem_Alloc(loadmodel->mempool, loadmodel->numnodes * sizeof(dclipnode_t));
+
+ hull->clipnodes = out;
+ hull->firstclipnode = 0;
+ hull->lastclipnode = loadmodel->numnodes - 1;
+ hull->planes = loadmodel->planes;
- VectorCopy(surf->plane->normal, normal);
- if (surf->flags & SURF_PLANEBACK)
- VectorNegate(normal, normal);
- for (i = 0, in = surf->poly_verts;i < mesh->numverts;i++, in += 3)
+ for (i = 0;i < loadmodel->numnodes;i++, out++, in++)
{
- s = (DotProduct (in, surf->texinfo->vecs[0]) + surf->texinfo->vecs[0][3]);
- t = (DotProduct (in, surf->texinfo->vecs[1]) + surf->texinfo->vecs[1][3]);
- mesh->verts[i * 4 + 0] = in[0];
- mesh->verts[i * 4 + 1] = in[1];
- mesh->verts[i * 4 + 2] = in[2];
- mesh->st[i * 2 + 0] = s / surf->texinfo->texture->width;
- mesh->st[i * 2 + 1] = t / surf->texinfo->texture->height;
- mesh->ab[i * 2 + 0] = s * (1.0f / 16.0f);
- mesh->ab[i * 2 + 1] = t * (1.0f / 16.0f);
- mesh->normals[i * 3 + 0] = normal[0];
- mesh->normals[i * 3 + 1] = normal[1];
- mesh->normals[i * 3 + 2] = normal[2];
+ out->planenum = in->plane - loadmodel->planes;
+ out->children[0] = in->children[0]->contents < 0 ? in->children[0]->contents : in->children[0] - loadmodel->nodes;
+ out->children[1] = in->children[1]->contents < 0 ? in->children[1]->contents : in->children[1] - loadmodel->nodes;
}
}
-void Mod_GenerateSurfacePolygon (msurface_t *surf)
+/*
+=================
+Mod_LoadMarksurfaces
+=================
+*/
+static void Mod_LoadMarksurfaces (lump_t *l)
{
- int i, lindex;
- float *vec, *vert, mins[3], maxs[3], temp[3], dist;
+ int i, j;
+ short *in;
- // convert edges back to a normal polygon
- surf->poly_numverts = surf->numedges;
- vert = surf->poly_verts = Mem_Alloc(loadmodel->mempool, sizeof(float[3]) * surf->numedges);
- for (i = 0;i < surf->numedges;i++)
- {
- lindex = loadmodel->surfedges[surf->firstedge + i];
- if (lindex > 0)
- vec = loadmodel->vertexes[loadmodel->edges[lindex].v[0]].position;
- else
- vec = loadmodel->vertexes[loadmodel->edges[-lindex].v[1]].position;
- VectorCopy (vec, vert);
- vert += 3;
- }
- vert = surf->poly_verts;
- VectorCopy(vert, mins);
- VectorCopy(vert, maxs);
- vert += 3;
- for (i = 1;i < surf->poly_numverts;i++)
- {
- if (mins[0] > vert[0]) mins[0] = vert[0];if (maxs[0] < vert[0]) maxs[0] = vert[0];
- if (mins[1] > vert[1]) mins[1] = vert[1];if (maxs[1] < vert[1]) maxs[1] = vert[1];
- if (mins[2] > vert[2]) mins[2] = vert[2];if (maxs[2] < vert[2]) maxs[2] = vert[2];
- vert += 3;
- }
- VectorCopy(mins, surf->poly_mins);
- VectorCopy(maxs, surf->poly_maxs);
- surf->poly_center[0] = (mins[0] + maxs[0]) * 0.5f;
- surf->poly_center[1] = (mins[1] + maxs[1]) * 0.5f;
- surf->poly_center[2] = (mins[2] + maxs[2]) * 0.5f;
- surf->poly_radius2 = 0;
- vert = surf->poly_verts;
- for (i = 0;i < surf->poly_numverts;i++)
+ in = (void *)(mod_base + l->fileofs);
+ if (l->filelen % sizeof(*in))
+ Host_Error ("MOD_LoadBmodel: funny lump size in %s",loadmodel->name);
+ loadmodel->nummarksurfaces = l->filelen / sizeof(*in);
+ loadmodel->marksurfaces = Mem_Alloc(loadmodel->mempool, loadmodel->nummarksurfaces * sizeof(int));
+
+ for (i = 0;i < loadmodel->nummarksurfaces;i++)
{
- VectorSubtract(vert, surf->poly_center, temp);
- dist = DotProduct(temp, temp);
- if (surf->poly_radius2 < dist)
- surf->poly_radius2 = dist;
- vert += 3;
+ j = (unsigned) LittleShort(in[i]);
+ if (j >= loadmodel->numsurfaces)
+ Host_Error ("Mod_ParseMarksurfaces: bad surface number");
+ loadmodel->marksurfaces[i] = j;
}
- surf->poly_radius = sqrt(surf->poly_radius2);
}
/*
=================
-Mod_LoadFaces
+Mod_LoadSurfedges
=================
*/
-static void Mod_LoadFaces (lump_t *l)
+static void Mod_LoadSurfedges (lump_t *l)
{
- dface_t *in;
- msurface_t *out;
- int i, count, surfnum, planenum, ssize, tsize;
+ int i;
+ int *in;
in = (void *)(mod_base + l->fileofs);
if (l->filelen % sizeof(*in))
Host_Error ("MOD_LoadBmodel: funny lump size in %s",loadmodel->name);
- count = l->filelen / sizeof(*in);
- out = Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
+ loadmodel->numsurfedges = l->filelen / sizeof(*in);
+ loadmodel->surfedges = Mem_Alloc(loadmodel->mempool, loadmodel->numsurfedges * sizeof(int));
- loadmodel->surfaces = out;
- loadmodel->numsurfaces = count;
- loadmodel->surfacevisframes = Mem_Alloc(loadmodel->mempool, count * sizeof(int));
- loadmodel->surfacepvsframes = Mem_Alloc(loadmodel->mempool, count * sizeof(int));
+ for (i = 0;i < loadmodel->numsurfedges;i++)
+ loadmodel->surfedges[i] = LittleLong (in[i]);
+}
- for (surfnum = 0;surfnum < count;surfnum++, in++, out++)
- {
- out->number = surfnum;
- // FIXME: validate edges, texinfo, etc?
- out->firstedge = LittleLong(in->firstedge);
- out->numedges = LittleShort(in->numedges);
- if ((unsigned int) out->firstedge + (unsigned int) out->numedges > (unsigned int) loadmodel->numsurfedges)
- Host_Error("Mod_LoadFaces: invalid edge range (firstedge %i, numedges %i, model edges %i)\n", out->firstedge, out->numedges, loadmodel->numsurfedges);
- i = LittleShort (in->texinfo);
- if ((unsigned int) i >= (unsigned int) loadmodel->numtexinfo)
- Host_Error("Mod_LoadFaces: invalid texinfo index %i (model has %i texinfos)\n", i, loadmodel->numtexinfo);
- out->texinfo = loadmodel->texinfo + i;
- out->flags = out->texinfo->texture->flags;
+/*
+=================
+Mod_LoadPlanes
+=================
+*/
+static void Mod_LoadPlanes (lump_t *l)
+{
+ int i;
+ mplane_t *out;
+ dplane_t *in;
- planenum = LittleShort(in->planenum);
- if ((unsigned int) planenum >= (unsigned int) loadmodel->numplanes)
- Host_Error("Mod_LoadFaces: invalid plane index %i (model has %i planes)\n", planenum, loadmodel->numplanes);
+ in = (void *)(mod_base + l->fileofs);
+ if (l->filelen % sizeof(*in))
+ Host_Error ("MOD_LoadBmodel: funny lump size in %s", loadmodel->name);
- if (LittleShort(in->side))
- out->flags |= SURF_PLANEBACK;
+ loadmodel->numplanes = l->filelen / sizeof(*in);
+ loadmodel->planes = out = Mem_Alloc(loadmodel->mempool, loadmodel->numplanes * sizeof(*out));
- out->plane = loadmodel->planes + planenum;
+ for (i = 0;i < loadmodel->numplanes;i++, in++, out++)
+ {
+ out->normal[0] = LittleFloat (in->normal[0]);
+ out->normal[1] = LittleFloat (in->normal[1]);
+ out->normal[2] = LittleFloat (in->normal[2]);
+ out->dist = LittleFloat (in->dist);
- // clear lightmap (filled in later)
- out->lightmaptexture = NULL;
+ PlaneClassify(out);
+ }
+}
- // force lightmap upload on first time seeing the surface
- out->cached_dlight = true;
+#define MAX_POINTS_ON_WINDING 64
- CalcSurfaceExtents (out);
+typedef struct
+{
+ int numpoints;
+ int padding;
+ double points[8][3]; // variable sized
+}
+winding_t;
- ssize = (out->extents[0] >> 4) + 1;
- tsize = (out->extents[1] >> 4) + 1;
+/*
+==================
+NewWinding
+==================
+*/
+static winding_t *NewWinding (int points)
+{
+ winding_t *w;
+ int size;
- // lighting info
- for (i = 0;i < MAXLIGHTMAPS;i++)
- out->styles[i] = in->styles[i];
- i = LittleLong(in->lightofs);
- if (i == -1)
- out->samples = NULL;
- else if (loadmodel->ishlbsp) // LordHavoc: HalfLife map (bsp version 30)
- out->samples = loadmodel->lightdata + i;
- else // LordHavoc: white lighting (bsp version 29)
- out->samples = loadmodel->lightdata + (i * 3);
+ if (points > MAX_POINTS_ON_WINDING)
+ Sys_Error("NewWinding: too many points\n");
- Mod_GenerateSurfacePolygon(out);
- if (out->texinfo->texture->shader == &Cshader_wall_lightmap)
- {
- if ((out->extents[0] >> 4) + 1 > (256) || (out->extents[1] >> 4) + 1 > (256))
- Host_Error ("Bad surface extents");
- Mod_GenerateWallMesh (out, false);
- // stainmap for permanent marks on walls
- out->stainsamples = Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
- // clear to white
- memset(out->stainsamples, 255, ssize * tsize * 3);
- }
- else
- Mod_GenerateVertexMesh (out);
- }
+ size = sizeof(winding_t) + sizeof(double[3]) * (points - 8);
+ w = Mem_Alloc(loadmodel->mempool, size);
+ memset (w, 0, size);
+
+ return w;
}
-/*
-=================
-Mod_SetParent
-=================
-*/
-static void Mod_SetParent (mnode_t *node, mnode_t *parent)
+static void FreeWinding (winding_t *w)
{
- node->parent = parent;
- if (node->contents < 0)
- return;
- Mod_SetParent (node->children[0], node);
- Mod_SetParent (node->children[1], node);
+ Mem_Free(w);
}
/*
=================
-Mod_LoadNodes
+BaseWindingForPlane
=================
*/
-static void Mod_LoadNodes (lump_t *l)
+static winding_t *BaseWindingForPlane (mplane_t *p)
{
- int i, j, count, p;
- dnode_t *in;
- mnode_t *out;
+ double org[3], vright[3], vup[3], normal[3];
+ winding_t *w;
- in = (void *)(mod_base + l->fileofs);
- if (l->filelen % sizeof(*in))
- Host_Error ("MOD_LoadBmodel: funny lump size in %s",loadmodel->name);
- count = l->filelen / sizeof(*in);
- out = Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
+ VectorCopy(p->normal, normal);
+ VectorVectorsDouble(normal, vright, vup);
- loadmodel->nodes = out;
- loadmodel->numnodes = count;
+ VectorScale (vup, 1024.0*1024.0*1024.0, vup);
+ VectorScale (vright, 1024.0*1024.0*1024.0, vright);
- for ( i=0 ; i<count ; i++, in++, out++)
- {
- for (j=0 ; j<3 ; j++)
- {
- out->mins[j] = LittleShort (in->mins[j]);
- out->maxs[j] = LittleShort (in->maxs[j]);
- }
+ // project a really big axis aligned box onto the plane
+ w = NewWinding (4);
- p = LittleLong(in->planenum);
- out->plane = loadmodel->planes + p;
+ VectorScale (p->normal, p->dist, org);
- out->firstsurface = LittleShort (in->firstface);
- out->numsurfaces = LittleShort (in->numfaces);
+ VectorSubtract (org, vright, w->points[0]);
+ VectorAdd (w->points[0], vup, w->points[0]);
- for (j=0 ; j<2 ; j++)
- {
- p = LittleShort (in->children[j]);
- if (p >= 0)
- out->children[j] = loadmodel->nodes + p;
- else
- out->children[j] = (mnode_t *)(loadmodel->leafs + (-1 - p));
- }
- }
+ VectorAdd (org, vright, w->points[1]);
+ VectorAdd (w->points[1], vup, w->points[1]);
- Mod_SetParent (loadmodel->nodes, NULL); // sets nodes and leafs
+ VectorAdd (org, vright, w->points[2]);
+ VectorSubtract (w->points[2], vup, w->points[2]);
+
+ VectorSubtract (org, vright, w->points[3]);
+ VectorSubtract (w->points[3], vup, w->points[3]);
+
+ w->numpoints = 4;
+
+ return w;
}
/*
-=================
-Mod_LoadLeafs
-=================
+==================
+ClipWinding
+
+Clips the winding to the plane, returning the new winding on the positive side
+Frees the input winding.
+If keepon is true, an exactly on-plane winding will be saved, otherwise
+it will be clipped away.
+==================
*/
-static void Mod_LoadLeafs (lump_t *l)
+static winding_t *ClipWinding (winding_t *in, mplane_t *split, int keepon)
{
- dleaf_t *in;
- mleaf_t *out;
- int i, j, count, p;
-
- in = (void *)(mod_base + l->fileofs);
- if (l->filelen % sizeof(*in))
- Host_Error ("MOD_LoadBmodel: funny lump size in %s",loadmodel->name);
- count = l->filelen / sizeof(*in);
- out = Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
+ double dists[MAX_POINTS_ON_WINDING + 1];
+ int sides[MAX_POINTS_ON_WINDING + 1];
+ int counts[3];
+ double dot;
+ int i, j;
+ double *p1, *p2;
+ double mid[3];
+ winding_t *neww;
+ int maxpts;
- loadmodel->leafs = out;
- loadmodel->numleafs = count;
+ counts[SIDE_FRONT] = counts[SIDE_BACK] = counts[SIDE_ON] = 0;
- for ( i=0 ; i<count ; i++, in++, out++)
+ // determine sides for each point
+ for (i = 0;i < in->numpoints;i++)
{
- for (j=0 ; j<3 ; j++)
- {
- out->mins[j] = LittleShort (in->mins[j]);
- out->maxs[j] = LittleShort (in->maxs[j]);
- }
+ dists[i] = dot = DotProduct (in->points[i], split->normal) - split->dist;
+ if (dot > ON_EPSILON)
+ sides[i] = SIDE_FRONT;
+ else if (dot < -ON_EPSILON)
+ sides[i] = SIDE_BACK;
+ else
+ sides[i] = SIDE_ON;
+ counts[sides[i]]++;
+ }
+ sides[i] = sides[0];
+ dists[i] = dists[0];
- p = LittleLong(in->contents);
- out->contents = p;
+ if (keepon && !counts[0] && !counts[1])
+ return in;
- out->firstmarksurface = loadmodel->marksurfaces +
- LittleShort(in->firstmarksurface);
- out->nummarksurfaces = LittleShort(in->nummarksurfaces);
+ if (!counts[0])
+ {
+ FreeWinding (in);
+ return NULL;
+ }
+ if (!counts[1])
+ return in;
- p = LittleLong(in->visofs);
- if (p == -1)
- out->compressed_vis = NULL;
- else
- out->compressed_vis = loadmodel->visdata + p;
+ maxpts = in->numpoints+4; // can't use counts[0]+2 because of fp grouping errors
+ if (maxpts > MAX_POINTS_ON_WINDING)
+ Sys_Error ("ClipWinding: maxpts > MAX_POINTS_ON_WINDING");
- for (j=0 ; j<4 ; j++)
- out->ambient_sound_level[j] = in->ambient_level[j];
+ neww = NewWinding (maxpts);
- // FIXME: Insert caustics here
- }
-}
+ for (i = 0;i < in->numpoints;i++)
+ {
+ if (neww->numpoints >= maxpts)
+ Sys_Error ("ClipWinding: points exceeded estimate");
-/*
-=================
-Mod_LoadClipnodes
-=================
-*/
-static void Mod_LoadClipnodes (lump_t *l)
-{
- dclipnode_t *in, *out;
- int i, count;
- hull_t *hull;
+ p1 = in->points[i];
- in = (void *)(mod_base + l->fileofs);
- if (l->filelen % sizeof(*in))
- Host_Error ("MOD_LoadBmodel: funny lump size in %s",loadmodel->name);
- count = l->filelen / sizeof(*in);
- out = Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
+ if (sides[i] == SIDE_ON)
+ {
+ VectorCopy (p1, neww->points[neww->numpoints]);
+ neww->numpoints++;
+ continue;
+ }
- loadmodel->clipnodes = out;
- loadmodel->numclipnodes = count;
+ if (sides[i] == SIDE_FRONT)
+ {
+ VectorCopy (p1, neww->points[neww->numpoints]);
+ neww->numpoints++;
+ }
- if (loadmodel->ishlbsp)
- {
- hull = &loadmodel->hulls[1];
- hull->clipnodes = out;
- hull->firstclipnode = 0;
- hull->lastclipnode = count-1;
- hull->planes = loadmodel->planes;
- hull->clip_mins[0] = -16;
- hull->clip_mins[1] = -16;
- hull->clip_mins[2] = -36;
- hull->clip_maxs[0] = 16;
- hull->clip_maxs[1] = 16;
- hull->clip_maxs[2] = 36;
- VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
+ if (sides[i+1] == SIDE_ON || sides[i+1] == sides[i])
+ continue;
- hull = &loadmodel->hulls[2];
- hull->clipnodes = out;
- hull->firstclipnode = 0;
- hull->lastclipnode = count-1;
- hull->planes = loadmodel->planes;
- hull->clip_mins[0] = -32;
- hull->clip_mins[1] = -32;
- hull->clip_mins[2] = -32;
- hull->clip_maxs[0] = 32;
- hull->clip_maxs[1] = 32;
- hull->clip_maxs[2] = 32;
- VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
+ // generate a split point
+ p2 = in->points[(i+1)%in->numpoints];
- hull = &loadmodel->hulls[3];
- hull->clipnodes = out;
- hull->firstclipnode = 0;
- hull->lastclipnode = count-1;
- hull->planes = loadmodel->planes;
- hull->clip_mins[0] = -16;
- hull->clip_mins[1] = -16;
- hull->clip_mins[2] = -18;
- hull->clip_maxs[0] = 16;
- hull->clip_maxs[1] = 16;
- hull->clip_maxs[2] = 18;
- VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
- }
- else
- {
- hull = &loadmodel->hulls[1];
- hull->clipnodes = out;
- hull->firstclipnode = 0;
- hull->lastclipnode = count-1;
- hull->planes = loadmodel->planes;
- hull->clip_mins[0] = -16;
- hull->clip_mins[1] = -16;
- hull->clip_mins[2] = -24;
- hull->clip_maxs[0] = 16;
- hull->clip_maxs[1] = 16;
- hull->clip_maxs[2] = 32;
- VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
+ dot = dists[i] / (dists[i]-dists[i+1]);
+ for (j = 0;j < 3;j++)
+ { // avoid round off error when possible
+ if (split->normal[j] == 1)
+ mid[j] = split->dist;
+ else if (split->normal[j] == -1)
+ mid[j] = -split->dist;
+ else
+ mid[j] = p1[j] + dot*(p2[j]-p1[j]);
+ }
- hull = &loadmodel->hulls[2];
- hull->clipnodes = out;
- hull->firstclipnode = 0;
- hull->lastclipnode = count-1;
- hull->planes = loadmodel->planes;
- hull->clip_mins[0] = -32;
- hull->clip_mins[1] = -32;
- hull->clip_mins[2] = -24;
- hull->clip_maxs[0] = 32;
- hull->clip_maxs[1] = 32;
- hull->clip_maxs[2] = 64;
- VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
+ VectorCopy (mid, neww->points[neww->numpoints]);
+ neww->numpoints++;
}
- for (i=0 ; i<count ; i++, out++, in++)
- {
- out->planenum = LittleLong(in->planenum);
- out->children[0] = LittleShort(in->children[0]);
- out->children[1] = LittleShort(in->children[1]);
- if (out->children[0] >= count || out->children[1] >= count)
- Host_Error("Corrupt clipping hull (out of range child)\n");
- }
+ // free the original winding
+ FreeWinding (in);
+
+ return neww;
}
+
/*
-=================
-Mod_MakeHull0
+==================
+DivideWinding
-Duplicate the drawing hull structure as a clipping hull
-=================
+Divides a winding by a plane, producing one or two windings. The
+original winding is not damaged or freed. If only on one side, the
+returned winding will be the input winding. If on both sides, two
+new windings will be created.
+==================
*/
-static void Mod_MakeHull0 (void)
+static void DivideWinding (winding_t *in, mplane_t *split, winding_t **front, winding_t **back)
{
- mnode_t *in;
- dclipnode_t *out;
- int i;
- hull_t *hull;
+ double dists[MAX_POINTS_ON_WINDING + 1];
+ int sides[MAX_POINTS_ON_WINDING + 1];
+ int counts[3];
+ double dot;
+ int i, j;
+ double *p1, *p2;
+ double mid[3];
+ winding_t *f, *b;
+ int maxpts;
- hull = &loadmodel->hulls[0];
+ counts[SIDE_FRONT] = counts[SIDE_BACK] = counts[SIDE_ON] = 0;
- in = loadmodel->nodes;
- out = Mem_Alloc(loadmodel->mempool, loadmodel->numnodes * sizeof(dclipnode_t));
+ // determine sides for each point
+ for (i = 0;i < in->numpoints;i++)
+ {
+ dot = DotProduct (in->points[i], split->normal);
+ dot -= split->dist;
+ dists[i] = dot;
+ if (dot > ON_EPSILON) sides[i] = SIDE_FRONT;
+ else if (dot < -ON_EPSILON) sides[i] = SIDE_BACK;
+ else sides[i] = SIDE_ON;
+ counts[sides[i]]++;
+ }
+ sides[i] = sides[0];
+ dists[i] = dists[0];
- hull->clipnodes = out;
- hull->firstclipnode = 0;
- hull->lastclipnode = loadmodel->numnodes - 1;
- hull->planes = loadmodel->planes;
+ *front = *back = NULL;
- for (i = 0;i < loadmodel->numnodes;i++, out++, in++)
+ if (!counts[0])
{
- out->planenum = in->plane - loadmodel->planes;
- out->children[0] = in->children[0]->contents < 0 ? in->children[0]->contents : in->children[0] - loadmodel->nodes;
- out->children[1] = in->children[1]->contents < 0 ? in->children[1]->contents : in->children[1] - loadmodel->nodes;
+ *back = in;
+ return;
+ }
+ if (!counts[1])
+ {
+ *front = in;
+ return;
}
-}
-/*
-=================
-Mod_LoadMarksurfaces
-=================
-*/
-static void Mod_LoadMarksurfaces (lump_t *l)
-{
- int i, j;
- short *in;
+ maxpts = in->numpoints+4; // can't use counts[0]+2 because of fp grouping errors
- in = (void *)(mod_base + l->fileofs);
- if (l->filelen % sizeof(*in))
- Host_Error ("MOD_LoadBmodel: funny lump size in %s",loadmodel->name);
- loadmodel->nummarksurfaces = l->filelen / sizeof(*in);
- loadmodel->marksurfaces = Mem_Alloc(loadmodel->mempool, loadmodel->nummarksurfaces * sizeof(int));
+ if (maxpts > MAX_POINTS_ON_WINDING)
+ Sys_Error ("ClipWinding: maxpts > MAX_POINTS_ON_WINDING");
- for (i = 0;i < loadmodel->nummarksurfaces;i++)
+ *front = f = NewWinding (maxpts);
+ *back = b = NewWinding (maxpts);
+
+ for (i = 0;i < in->numpoints;i++)
{
- j = (unsigned) LittleShort(in[i]);
- if (j >= loadmodel->numsurfaces)
- Host_Error ("Mod_ParseMarksurfaces: bad surface number");
- loadmodel->marksurfaces[i] = j;
+ if (f->numpoints >= maxpts || b->numpoints >= maxpts)
+ Sys_Error ("DivideWinding: points exceeded estimate");
+
+ p1 = in->points[i];
+
+ if (sides[i] == SIDE_ON)
+ {
+ VectorCopy (p1, f->points[f->numpoints]);
+ f->numpoints++;
+ VectorCopy (p1, b->points[b->numpoints]);
+ b->numpoints++;
+ continue;
+ }
+
+ if (sides[i] == SIDE_FRONT)
+ {
+ VectorCopy (p1, f->points[f->numpoints]);
+ f->numpoints++;
+ }
+ else if (sides[i] == SIDE_BACK)
+ {
+ VectorCopy (p1, b->points[b->numpoints]);
+ b->numpoints++;
+ }
+
+ if (sides[i+1] == SIDE_ON || sides[i+1] == sides[i])
+ continue;
+
+ // generate a split point
+ p2 = in->points[(i+1)%in->numpoints];
+
+ dot = dists[i] / (dists[i]-dists[i+1]);
+ for (j = 0;j < 3;j++)
+ { // avoid round off error when possible
+ if (split->normal[j] == 1)
+ mid[j] = split->dist;
+ else if (split->normal[j] == -1)
+ mid[j] = -split->dist;
+ else
+ mid[j] = p1[j] + dot*(p2[j]-p1[j]);
+ }
+
+ VectorCopy (mid, f->points[f->numpoints]);
+ f->numpoints++;
+ VectorCopy (mid, b->points[b->numpoints]);
+ b->numpoints++;
}
}
+typedef struct portal_s
+{
+ mplane_t plane;
+ mnode_t *nodes[2]; // [0] = front side of plane
+ struct portal_s *next[2];
+ winding_t *winding;
+ struct portal_s *chain; // all portals are linked into a list
+}
+portal_t;
+
+static portal_t *portalchain;
+
/*
-=================
-Mod_LoadSurfedges
-=================
+===========
+AllocPortal
+===========
*/
-static void Mod_LoadSurfedges (lump_t *l)
+static portal_t *AllocPortal (void)
{
- int i;
- int *in;
+ portal_t *p;
+ p = Mem_Alloc(loadmodel->mempool, sizeof(portal_t));
+ p->chain = portalchain;
+ portalchain = p;
+ return p;
+}
+
+static void FreePortal(portal_t *p)
+{
+ Mem_Free(p);
+}
+
+static void Mod_RecursiveRecalcNodeBBox(mnode_t *node)
+{
+ // calculate children first
+ if (node->children[0]->contents >= 0)
+ Mod_RecursiveRecalcNodeBBox(node->children[0]);
+ if (node->children[1]->contents >= 0)
+ Mod_RecursiveRecalcNodeBBox(node->children[1]);
+
+ // make combined bounding box from children
+ node->mins[0] = min(node->children[0]->mins[0], node->children[1]->mins[0]);
+ node->mins[1] = min(node->children[0]->mins[1], node->children[1]->mins[1]);
+ node->mins[2] = min(node->children[0]->mins[2], node->children[1]->mins[2]);
+ node->maxs[0] = max(node->children[0]->maxs[0], node->children[1]->maxs[0]);
+ node->maxs[1] = max(node->children[0]->maxs[1], node->children[1]->maxs[1]);
+ node->maxs[2] = max(node->children[0]->maxs[2], node->children[1]->maxs[2]);
+}
+
+static void Mod_FinalizePortals(void)
+{
+ int i, j, numportals, numpoints;
+ portal_t *p, *pnext;
+ mportal_t *portal;
+ mvertex_t *point;
+ mleaf_t *leaf, *endleaf;
+ winding_t *w;
+
+ // recalculate bounding boxes for all leafs (because qbsp is very sloppy)
+ leaf = loadmodel->leafs;
+ endleaf = leaf + loadmodel->numleafs;
+ for (;leaf < endleaf;leaf++)
+ {
+ VectorSet(leaf->mins, 2000000000, 2000000000, 2000000000);
+ VectorSet(leaf->maxs, -2000000000, -2000000000, -2000000000);
+ }
+ p = portalchain;
+ while(p)
+ {
+ if (p->winding)
+ {
+ for (i = 0;i < 2;i++)
+ {
+ leaf = (mleaf_t *)p->nodes[i];
+ w = p->winding;
+ for (j = 0;j < w->numpoints;j++)
+ {
+ if (leaf->mins[0] > w->points[j][0]) leaf->mins[0] = w->points[j][0];
+ if (leaf->mins[1] > w->points[j][1]) leaf->mins[1] = w->points[j][1];
+ if (leaf->mins[2] > w->points[j][2]) leaf->mins[2] = w->points[j][2];
+ if (leaf->maxs[0] < w->points[j][0]) leaf->maxs[0] = w->points[j][0];
+ if (leaf->maxs[1] < w->points[j][1]) leaf->maxs[1] = w->points[j][1];
+ if (leaf->maxs[2] < w->points[j][2]) leaf->maxs[2] = w->points[j][2];
+ }
+ }
+ }
+ p = p->chain;
+ }
- in = (void *)(mod_base + l->fileofs);
- if (l->filelen % sizeof(*in))
- Host_Error ("MOD_LoadBmodel: funny lump size in %s",loadmodel->name);
- loadmodel->numsurfedges = l->filelen / sizeof(*in);
- loadmodel->surfedges = Mem_Alloc(loadmodel->mempool, loadmodel->numsurfedges * sizeof(int));
+ Mod_RecursiveRecalcNodeBBox(loadmodel->nodes);
- for (i = 0;i < loadmodel->numsurfedges;i++)
- loadmodel->surfedges[i] = LittleLong (in[i]);
-}
+ // tally up portal and point counts
+ p = portalchain;
+ numportals = 0;
+ numpoints = 0;
+ while(p)
+ {
+ // note: this check must match the one below or it will usually corrupt memory
+ // the nodes[0] != nodes[1] check is because leaf 0 is the shared solid leaf, it can have many portals inside with leaf 0 on both sides
+ if (p->winding && p->nodes[0] != p->nodes[1]
+ && p->nodes[0]->contents != CONTENTS_SOLID && p->nodes[1]->contents != CONTENTS_SOLID
+ && p->nodes[0]->contents != CONTENTS_SKY && p->nodes[1]->contents != CONTENTS_SKY)
+ {
+ numportals += 2;
+ numpoints += p->winding->numpoints * 2;
+ }
+ p = p->chain;
+ }
+ loadmodel->portals = Mem_Alloc(loadmodel->mempool, numportals * sizeof(mportal_t) + numpoints * sizeof(mvertex_t));
+ loadmodel->numportals = numportals;
+ loadmodel->portalpoints = (void *) ((qbyte *) loadmodel->portals + numportals * sizeof(mportal_t));
+ loadmodel->numportalpoints = numpoints;
+ // clear all leaf portal chains
+ for (i = 0;i < loadmodel->numleafs;i++)
+ loadmodel->leafs[i].portals = NULL;
+ // process all portals in the global portal chain, while freeing them
+ portal = loadmodel->portals;
+ point = loadmodel->portalpoints;
+ p = portalchain;
+ portalchain = NULL;
+ while (p)
+ {
+ pnext = p->chain;
+ if (p->winding)
+ {
+ // note: this check must match the one above or it will usually corrupt memory
+ // the nodes[0] != nodes[1] check is because leaf 0 is the shared solid leaf, it can have many portals inside with leaf 0 on both sides
+ if (p->nodes[0] != p->nodes[1]
+ && p->nodes[0]->contents != CONTENTS_SOLID && p->nodes[1]->contents != CONTENTS_SOLID
+ && p->nodes[0]->contents != CONTENTS_SKY && p->nodes[1]->contents != CONTENTS_SKY)
+ {
+ // first make the back to front portal (forward portal)
+ portal->points = point;
+ portal->numpoints = p->winding->numpoints;
+ portal->plane.dist = p->plane.dist;
+ VectorCopy(p->plane.normal, portal->plane.normal);
+ portal->here = (mleaf_t *)p->nodes[1];
+ portal->past = (mleaf_t *)p->nodes[0];
+ // copy points
+ for (j = 0;j < portal->numpoints;j++)
+ {
+ VectorCopy(p->winding->points[j], point->position);
+ point++;
+ }
+ PlaneClassify(&portal->plane);
-/*
-=================
-Mod_LoadPlanes
-=================
-*/
-static void Mod_LoadPlanes (lump_t *l)
-{
- int i;
- mplane_t *out;
- dplane_t *in;
+ // link into leaf's portal chain
+ portal->next = portal->here->portals;
+ portal->here->portals = portal;
- in = (void *)(mod_base + l->fileofs);
- if (l->filelen % sizeof(*in))
- Host_Error ("MOD_LoadBmodel: funny lump size in %s", loadmodel->name);
+ // advance to next portal
+ portal++;
- loadmodel->numplanes = l->filelen / sizeof(*in);
- loadmodel->planes = out = Mem_Alloc(loadmodel->mempool, loadmodel->numplanes * sizeof(*out));
+ // then make the front to back portal (backward portal)
+ portal->points = point;
+ portal->numpoints = p->winding->numpoints;
+ portal->plane.dist = -p->plane.dist;
+ VectorNegate(p->plane.normal, portal->plane.normal);
+ portal->here = (mleaf_t *)p->nodes[0];
+ portal->past = (mleaf_t *)p->nodes[1];
+ // copy points
+ for (j = portal->numpoints - 1;j >= 0;j--)
+ {
+ VectorCopy(p->winding->points[j], point->position);
+ point++;
+ }
+ PlaneClassify(&portal->plane);
- for (i = 0;i < loadmodel->numplanes;i++, in++, out++)
- {
- out->normal[0] = LittleFloat (in->normal[0]);
- out->normal[1] = LittleFloat (in->normal[1]);
- out->normal[2] = LittleFloat (in->normal[2]);
- out->dist = LittleFloat (in->dist);
+ // link into leaf's portal chain
+ portal->next = portal->here->portals;
+ portal->here->portals = portal;
- PlaneClassify(out);
+ // advance to next portal
+ portal++;
+ }
+ FreeWinding(p->winding);
+ }
+ FreePortal(p);
+ p = pnext;
}
}
-#define MAX_POINTS_ON_WINDING 64
-
-typedef struct
-{
- int numpoints;
- int padding;
- double points[8][3]; // variable sized
-}
-winding_t;
-
/*
-==================
-NewWinding
-==================
+=============
+AddPortalToNodes
+=============
*/
-static winding_t *NewWinding (int points)
+static void AddPortalToNodes (portal_t *p, mnode_t *front, mnode_t *back)
{
- winding_t *w;
- int size;
-
- if (points > MAX_POINTS_ON_WINDING)
- Sys_Error("NewWinding: too many points\n");
-
- size = sizeof(winding_t) + sizeof(double[3]) * (points - 8);
- w = Mem_Alloc(loadmodel->mempool, size);
- memset (w, 0, size);
+ if (!front)
+ Host_Error ("AddPortalToNodes: NULL front node");
+ if (!back)
+ Host_Error ("AddPortalToNodes: NULL back node");
+ if (p->nodes[0] || p->nodes[1])
+ Host_Error ("AddPortalToNodes: already included");
+ // note: front == back is handled gracefully, because leaf 0 is the shared solid leaf, it can often have portals with the same leaf on both sides
- return w;
-}
+ p->nodes[0] = front;
+ p->next[0] = (portal_t *)front->portals;
+ front->portals = (mportal_t *)p;
-static void FreeWinding (winding_t *w)
-{
- Mem_Free(w);
+ p->nodes[1] = back;
+ p->next[1] = (portal_t *)back->portals;
+ back->portals = (mportal_t *)p;
}
/*
-=================
-BaseWindingForPlane
-=================
+=============
+RemovePortalFromNode
+=============
*/
-static winding_t *BaseWindingForPlane (mplane_t *p)
+static void RemovePortalFromNodes(portal_t *portal)
{
- double org[3], vright[3], vup[3], normal[3];
- winding_t *w;
-
- VectorCopy(p->normal, normal);
- VectorVectorsDouble(normal, vright, vup);
-
- VectorScale (vup, 1024.0*1024.0*1024.0, vup);
- VectorScale (vright, 1024.0*1024.0*1024.0, vright);
-
- // project a really big axis aligned box onto the plane
- w = NewWinding (4);
-
- VectorScale (p->normal, p->dist, org);
-
- VectorSubtract (org, vright, w->points[0]);
- VectorAdd (w->points[0], vup, w->points[0]);
-
- VectorAdd (org, vright, w->points[1]);
- VectorAdd (w->points[1], vup, w->points[1]);
-
- VectorAdd (org, vright, w->points[2]);
- VectorSubtract (w->points[2], vup, w->points[2]);
-
- VectorSubtract (org, vright, w->points[3]);
- VectorSubtract (w->points[3], vup, w->points[3]);
-
- w->numpoints = 4;
+ int i;
+ mnode_t *node;
+ void **portalpointer;
+ portal_t *t;
+ for (i = 0;i < 2;i++)
+ {
+ node = portal->nodes[i];
- return w;
-}
+ portalpointer = (void **) &node->portals;
+ while (1)
+ {
+ t = *portalpointer;
+ if (!t)
+ Host_Error ("RemovePortalFromNodes: portal not in leaf");
-/*
-==================
-ClipWinding
+ if (t == portal)
+ {
+ if (portal->nodes[0] == node)
+ {
+ *portalpointer = portal->next[0];
+ portal->nodes[0] = NULL;
+ }
+ else if (portal->nodes[1] == node)
+ {
+ *portalpointer = portal->next[1];
+ portal->nodes[1] = NULL;
+ }
+ else
+ Host_Error ("RemovePortalFromNodes: portal not bounding leaf");
+ break;
+ }
-Clips the winding to the plane, returning the new winding on the positive side
-Frees the input winding.
-If keepon is true, an exactly on-plane winding will be saved, otherwise
-it will be clipped away.
-==================
-*/
-static winding_t *ClipWinding (winding_t *in, mplane_t *split, int keepon)
-{
- double dists[MAX_POINTS_ON_WINDING + 1];
- int sides[MAX_POINTS_ON_WINDING + 1];
- int counts[3];
- double dot;
- int i, j;
- double *p1, *p2;
- double mid[3];
- winding_t *neww;
- int maxpts;
+ if (t->nodes[0] == node)
+ portalpointer = (void **) &t->next[0];
+ else if (t->nodes[1] == node)
+ portalpointer = (void **) &t->next[1];
+ else
+ Host_Error ("RemovePortalFromNodes: portal not bounding leaf");
+ }
+ }
+}
- counts[SIDE_FRONT] = counts[SIDE_BACK] = counts[SIDE_ON] = 0;
+static void Mod_RecursiveNodePortals (mnode_t *node)
+{
+ int side;
+ mnode_t *front, *back, *other_node;
+ mplane_t clipplane, *plane;
+ portal_t *portal, *nextportal, *nodeportal, *splitportal, *temp;
+ winding_t *nodeportalwinding, *frontwinding, *backwinding;
- // determine sides for each point
- for (i = 0;i < in->numpoints;i++)
+ // if a leaf, we're done
+ if (node->contents)
+ return;
+
+ plane = node->plane;
+
+ front = node->children[0];
+ back = node->children[1];
+ if (front == back)
+ Host_Error("Mod_RecursiveNodePortals: corrupt node hierarchy");
+
+ // create the new portal by generating a polygon for the node plane,
+ // and clipping it by all of the other portals (which came from nodes above this one)
+ nodeportal = AllocPortal ();
+ nodeportal->plane = *node->plane;
+
+ nodeportalwinding = BaseWindingForPlane (node->plane);
+ side = 0; // shut up compiler warning
+ for (portal = (portal_t *)node->portals;portal;portal = portal->next[side])
{
- dists[i] = dot = DotProduct (in->points[i], split->normal) - split->dist;
- if (dot > ON_EPSILON)
- sides[i] = SIDE_FRONT;
- else if (dot < -ON_EPSILON)
- sides[i] = SIDE_BACK;
+ clipplane = portal->plane;
+ if (portal->nodes[0] == portal->nodes[1])
+ Host_Error("Mod_RecursiveNodePortals: portal has same node on both sides (1)");
+ if (portal->nodes[0] == node)
+ side = 0;
+ else if (portal->nodes[1] == node)
+ {
+ clipplane.dist = -clipplane.dist;
+ VectorNegate (clipplane.normal, clipplane.normal);
+ side = 1;
+ }
else
- sides[i] = SIDE_ON;
- counts[sides[i]]++;
- }
- sides[i] = sides[0];
- dists[i] = dists[0];
+ Host_Error ("Mod_RecursiveNodePortals: mislinked portal");
- if (keepon && !counts[0] && !counts[1])
- return in;
+ nodeportalwinding = ClipWinding (nodeportalwinding, &clipplane, true);
+ if (!nodeportalwinding)
+ {
+ Con_Printf ("Mod_RecursiveNodePortals: WARNING: new portal was clipped away\n");
+ break;
+ }
+ }
- if (!counts[0])
+ if (nodeportalwinding)
{
- FreeWinding (in);
- return NULL;
+ // if the plane was not clipped on all sides, there was an error
+ nodeportal->winding = nodeportalwinding;
+ AddPortalToNodes (nodeportal, front, back);
}
- if (!counts[1])
- return in;
-
- maxpts = in->numpoints+4; // can't use counts[0]+2 because of fp grouping errors
- if (maxpts > MAX_POINTS_ON_WINDING)
- Sys_Error ("ClipWinding: maxpts > MAX_POINTS_ON_WINDING");
-
- neww = NewWinding (maxpts);
- for (i = 0;i < in->numpoints;i++)
+ // split the portals of this node along this node's plane and assign them to the children of this node
+ // (migrating the portals downward through the tree)
+ for (portal = (portal_t *)node->portals;portal;portal = nextportal)
{
- if (neww->numpoints >= maxpts)
- Sys_Error ("ClipWinding: points exceeded estimate");
+ if (portal->nodes[0] == portal->nodes[1])
+ Host_Error("Mod_RecursiveNodePortals: portal has same node on both sides (2)");
+ if (portal->nodes[0] == node)
+ side = 0;
+ else if (portal->nodes[1] == node)
+ side = 1;
+ else
+ Host_Error ("Mod_RecursiveNodePortals: mislinked portal");
+ nextportal = portal->next[side];
- p1 = in->points[i];
+ other_node = portal->nodes[!side];
+ RemovePortalFromNodes (portal);
- if (sides[i] == SIDE_ON)
+ // cut the portal into two portals, one on each side of the node plane
+ DivideWinding (portal->winding, plane, &frontwinding, &backwinding);
+
+ if (!frontwinding)
{
- VectorCopy (p1, neww->points[neww->numpoints]);
- neww->numpoints++;
+ if (side == 0)
+ AddPortalToNodes (portal, back, other_node);
+ else
+ AddPortalToNodes (portal, other_node, back);
continue;
}
-
- if (sides[i] == SIDE_FRONT)
+ if (!backwinding)
{
- VectorCopy (p1, neww->points[neww->numpoints]);
- neww->numpoints++;
- }
-
- if (sides[i+1] == SIDE_ON || sides[i+1] == sides[i])
+ if (side == 0)
+ AddPortalToNodes (portal, front, other_node);
+ else
+ AddPortalToNodes (portal, other_node, front);
continue;
+ }
- // generate a split point
- p2 = in->points[(i+1)%in->numpoints];
+ // the winding is split
+ splitportal = AllocPortal ();
+ temp = splitportal->chain;
+ *splitportal = *portal;
+ splitportal->chain = temp;
+ splitportal->winding = backwinding;
+ FreeWinding (portal->winding);
+ portal->winding = frontwinding;
- dot = dists[i] / (dists[i]-dists[i+1]);
- for (j = 0;j < 3;j++)
- { // avoid round off error when possible
- if (split->normal[j] == 1)
- mid[j] = split->dist;
- else if (split->normal[j] == -1)
- mid[j] = -split->dist;
- else
- mid[j] = p1[j] + dot*(p2[j]-p1[j]);
+ if (side == 0)
+ {
+ AddPortalToNodes (portal, front, other_node);
+ AddPortalToNodes (splitportal, back, other_node);
+ }
+ else
+ {
+ AddPortalToNodes (portal, other_node, front);
+ AddPortalToNodes (splitportal, other_node, back);
}
-
- VectorCopy (mid, neww->points[neww->numpoints]);
- neww->numpoints++;
}
- // free the original winding
- FreeWinding (in);
-
- return neww;
+ Mod_RecursiveNodePortals(front);
+ Mod_RecursiveNodePortals(back);
}
-/*
-==================
-DivideWinding
-
-Divides a winding by a plane, producing one or two windings. The
-original winding is not damaged or freed. If only on one side, the
-returned winding will be the input winding. If on both sides, two
-new windings will be created.
-==================
-*/
-static void DivideWinding (winding_t *in, mplane_t *split, winding_t **front, winding_t **back)
+static void Mod_MakePortals(void)
{
- double dists[MAX_POINTS_ON_WINDING + 1];
- int sides[MAX_POINTS_ON_WINDING + 1];
- int counts[3];
- double dot;
- int i, j;
- double *p1, *p2;
- double mid[3];
- winding_t *f, *b;
- int maxpts;
-
- counts[SIDE_FRONT] = counts[SIDE_BACK] = counts[SIDE_ON] = 0;
+ portalchain = NULL;
+ Mod_RecursiveNodePortals (loadmodel->nodes);
+ Mod_FinalizePortals();
+}
- // determine sides for each point
- for (i = 0;i < in->numpoints;i++)
+static void Mod_BuildSurfaceNeighbors (msurface_t *surfaces, int numsurfaces, mempool_t *mempool)
+{
+#if 0
+ int surfnum, vertnum, vertnum2, snum, vnum, vnum2;
+ msurface_t *surf, *s;
+ float *v0, *v1, *v2, *v3;
+ for (surf = surfaces, surfnum = 0;surfnum < numsurfaces;surf++, surfnum++)
+ surf->neighborsurfaces = Mem_Alloc(mempool, surf->poly_numverts * sizeof(msurface_t *));
+ for (surf = surfaces, surfnum = 0;surfnum < numsurfaces;surf++, surfnum++)
{
- dot = DotProduct (in->points[i], split->normal);
- dot -= split->dist;
- dists[i] = dot;
- if (dot > ON_EPSILON) sides[i] = SIDE_FRONT;
- else if (dot < -ON_EPSILON) sides[i] = SIDE_BACK;
- else sides[i] = SIDE_ON;
- counts[sides[i]]++;
+ for (vertnum = surf->poly_numverts - 1, vertnum2 = 0, v0 = surf->poly_verts + (surf->poly_numverts - 1) * 3, v1 = surf->poly_verts;vertnum2 < surf->poly_numverts;vertnum = vertnum2, vertnum2++, v0 = v1, v1 += 3)
+ {
+ if (surf->neighborsurfaces[vertnum])
+ continue;
+ surf->neighborsurfaces[vertnum] = NULL;
+ for (s = surfaces, snum = 0;snum < numsurfaces;s++, snum++)
+ {
+ if (s->poly_mins[0] > (surf->poly_maxs[0] + 1) || s->poly_maxs[0] < (surf->poly_mins[0] - 1)
+ || s->poly_mins[1] > (surf->poly_maxs[1] + 1) || s->poly_maxs[1] < (surf->poly_mins[1] - 1)
+ || s->poly_mins[2] > (surf->poly_maxs[2] + 1) || s->poly_maxs[2] < (surf->poly_mins[2] - 1)
+ || s == surf)
+ continue;
+ for (vnum = 0;vnum < s->poly_numverts;vnum++)
+ if (s->neighborsurfaces[vnum] == surf)
+ break;
+ if (vnum < s->poly_numverts)
+ continue;
+ for (vnum = s->poly_numverts - 1, vnum2 = 0, v2 = s->poly_verts + (s->poly_numverts - 1) * 3, v3 = s->poly_verts;vnum2 < s->poly_numverts;vnum = vnum2, vnum2++, v2 = v3, v3 += 3)
+ {
+ if (s->neighborsurfaces[vnum] == NULL
+ && ((v0[0] == v2[0] && v0[1] == v2[1] && v0[2] == v2[2] && v1[0] == v3[0] && v1[1] == v3[1] && v1[2] == v3[2])
+ || (v1[0] == v2[0] && v1[1] == v2[1] && v1[2] == v2[2] && v0[0] == v3[0] && v0[1] == v3[1] && v0[2] == v3[2])))
+ {
+ surf->neighborsurfaces[vertnum] = s;
+ s->neighborsurfaces[vnum] = surf;
+ break;
+ }
+ }
+ if (vnum < s->poly_numverts)
+ break;
+ }
+ }
}
- sides[i] = sides[0];
- dists[i] = dists[0];
-
- *front = *back = NULL;
+#endif
+}
- if (!counts[0])
+void Mod_BuildLightmapUpdateChains(mempool_t *mempool, model_t *model)
+{
+ int i, j, stylecounts[256], totalcount, remapstyles[256];
+ msurface_t *surf;
+ memset(stylecounts, 0, sizeof(stylecounts));
+ for (i = 0;i < model->nummodelsurfaces;i++)
{
- *back = in;
- return;
+ surf = model->surfaces + model->firstmodelsurface + i;
+ for (j = 0;j < MAXLIGHTMAPS;j++)
+ stylecounts[surf->styles[j]]++;
}
- if (!counts[1])
+ totalcount = 0;
+ model->light_styles = 0;
+ for (i = 0;i < 255;i++)
{
- *front = in;
+ if (stylecounts[i])
+ {
+ remapstyles[i] = model->light_styles++;
+ totalcount += stylecounts[i] + 1;
+ }
+ }
+ if (!totalcount)
return;
+ model->light_style = Mem_Alloc(mempool, model->light_styles * sizeof(qbyte));
+ model->light_stylevalue = Mem_Alloc(mempool, model->light_styles * sizeof(int));
+ model->light_styleupdatechains = Mem_Alloc(mempool, model->light_styles * sizeof(msurface_t **));
+ model->light_styleupdatechainsbuffer = Mem_Alloc(mempool, totalcount * sizeof(msurface_t *));
+ model->light_styles = 0;
+ for (i = 0;i < 255;i++)
+ if (stylecounts[i])
+ model->light_style[model->light_styles++] = i;
+ j = 0;
+ for (i = 0;i < model->light_styles;i++)
+ {
+ model->light_styleupdatechains[i] = model->light_styleupdatechainsbuffer + j;
+ j += stylecounts[model->light_style[i]] + 1;
}
-
- maxpts = in->numpoints+4; // can't use counts[0]+2 because of fp grouping errors
-
- if (maxpts > MAX_POINTS_ON_WINDING)
- Sys_Error ("ClipWinding: maxpts > MAX_POINTS_ON_WINDING");
-
- *front = f = NewWinding (maxpts);
- *back = b = NewWinding (maxpts);
-
- for (i = 0;i < in->numpoints;i++)
+ for (i = 0;i < model->nummodelsurfaces;i++)
{
- if (f->numpoints >= maxpts || b->numpoints >= maxpts)
- Sys_Error ("DivideWinding: points exceeded estimate");
-
- p1 = in->points[i];
+ surf = model->surfaces + model->firstmodelsurface + i;
+ for (j = 0;j < MAXLIGHTMAPS;j++)
+ if (surf->styles[j] != 255)
+ *model->light_styleupdatechains[remapstyles[surf->styles[j]]]++ = surf;
+ }
+ j = 0;
+ for (i = 0;i < model->light_styles;i++)
+ {
+ *model->light_styleupdatechains[i] = NULL;
+ model->light_styleupdatechains[i] = model->light_styleupdatechainsbuffer + j;
+ j += stylecounts[model->light_style[i]] + 1;
+ }
+}
- if (sides[i] == SIDE_ON)
+void Mod_BuildPVSTextureChains(model_t *model)
+{
+ int i, j;
+ for (i = 0;i < model->numtextures;i++)
+ model->pvstexturechainslength[i] = 0;
+ for (i = 0, j = model->firstmodelsurface;i < model->nummodelsurfaces;i++, j++)
+ {
+ if (model->surfacepvsframes[j] == model->pvsframecount)
{
- VectorCopy (p1, f->points[f->numpoints]);
- f->numpoints++;
- VectorCopy (p1, b->points[b->numpoints]);
- b->numpoints++;
- continue;
+ model->pvssurflist[model->pvssurflistlength++] = j;
+ model->pvstexturechainslength[model->surfaces[j].texinfo->texture->number]++;
}
-
- if (sides[i] == SIDE_FRONT)
- {
- VectorCopy (p1, f->points[f->numpoints]);
- f->numpoints++;
+ }
+ for (i = 0, j = 0;i < model->numtextures;i++)
+ {
+ if (model->pvstexturechainslength[i])
+ {
+ model->pvstexturechains[i] = model->pvstexturechainsbuffer + j;
+ j += model->pvstexturechainslength[i] + 1;
}
- else if (sides[i] == SIDE_BACK)
+ else
+ model->pvstexturechains[i] = NULL;
+ }
+ for (i = 0, j = model->firstmodelsurface;i < model->nummodelsurfaces;i++, j++)
+ if (model->surfacepvsframes[j] == model->pvsframecount)
+ *model->pvstexturechains[model->surfaces[j].texinfo->texture->number]++ = model->surfaces + j;
+ for (i = 0;i < model->numtextures;i++)
+ {
+ if (model->pvstexturechainslength[i])
{
- VectorCopy (p1, b->points[b->numpoints]);
- b->numpoints++;
+ *model->pvstexturechains[i] = NULL;
+ model->pvstexturechains[i] -= model->pvstexturechainslength[i];
}
+ }
+}
- if (sides[i+1] == SIDE_ON || sides[i+1] == sides[i])
- continue;
+/*
+=================
+Mod_LoadBrushModel
+=================
+*/
+extern void R_Model_Brush_DrawSky(entity_render_t *ent);
+extern void R_Model_Brush_Draw(entity_render_t *ent);
+extern void R_Model_Brush_DrawShadowVolume(entity_render_t *ent, vec3_t relativelightorigin, float lightradius);
+extern void R_Model_Brush_DrawLight(entity_render_t *ent, vec3_t relativelightorigin, vec3_t relativeeyeorigin, float lightradius, float *lightcolor, const matrix4x4_t *matrix_modeltofilter, const matrix4x4_t *matrix_modeltoattenuationxyz, const matrix4x4_t *matrix_modeltoattenuationz);
+void Mod_LoadBrushModelQ1orHL (model_t *mod, void *buffer)
+{
+ int i, j, k;
+ dheader_t *header;
+ dmodel_t *bm;
+ mempool_t *mainmempool;
+ char *loadname;
+ model_t *originalloadmodel;
+ float dist, modelyawradius, modelradius, *vec;
+ msurface_t *surf;
+ surfmesh_t *mesh;
- // generate a split point
- p2 = in->points[(i+1)%in->numpoints];
+ mod->type = mod_brush;
- dot = dists[i] / (dists[i]-dists[i+1]);
- for (j = 0;j < 3;j++)
- { // avoid round off error when possible
- if (split->normal[j] == 1)
- mid[j] = split->dist;
- else if (split->normal[j] == -1)
- mid[j] = -split->dist;
- else
- mid[j] = p1[j] + dot*(p2[j]-p1[j]);
- }
+ header = (dheader_t *)buffer;
- VectorCopy (mid, f->points[f->numpoints]);
- f->numpoints++;
- VectorCopy (mid, b->points[b->numpoints]);
- b->numpoints++;
+ i = LittleLong (header->version);
+ if (i != BSPVERSION && i != 30)
+ Host_Error ("Mod_LoadBrushModel: %s has wrong version number (%i should be %i (Quake) or 30 (HalfLife))", mod->name, i, BSPVERSION);
+ mod->ishlbsp = i == 30;
+ if (loadmodel->isworldmodel)
+ {
+ Cvar_SetValue("halflifebsp", mod->ishlbsp);
+ // until we get a texture for it...
+ R_ResetQuakeSky();
}
-}
-typedef struct portal_s
-{
- mplane_t plane;
- mnode_t *nodes[2]; // [0] = front side of plane
- struct portal_s *next[2];
- winding_t *winding;
- struct portal_s *chain; // all portals are linked into a list
-}
-portal_t;
+// swap all the lumps
+ mod_base = (qbyte *)header;
-static portal_t *portalchain;
+ for (i = 0;i < (int) sizeof(dheader_t) / 4;i++)
+ ((int *)header)[i] = LittleLong ( ((int *)header)[i]);
-/*
-===========
-AllocPortal
-===========
-*/
-static portal_t *AllocPortal (void)
-{
- portal_t *p;
- p = Mem_Alloc(loadmodel->mempool, sizeof(portal_t));
- p->chain = portalchain;
- portalchain = p;
- return p;
-}
+// load into heap
-static void FreePortal(portal_t *p)
-{
- Mem_Free(p);
-}
+ // store which lightmap format to use
+ mod->lightmaprgba = r_lightmaprgba.integer;
-static void Mod_RecursiveRecalcNodeBBox(mnode_t *node)
-{
- // calculate children first
- if (node->children[0]->contents >= 0)
- Mod_RecursiveRecalcNodeBBox(node->children[0]);
- if (node->children[1]->contents >= 0)
- Mod_RecursiveRecalcNodeBBox(node->children[1]);
+ Mod_LoadEntities (&header->lumps[LUMP_ENTITIES]);
+ Mod_LoadVertexes (&header->lumps[LUMP_VERTEXES]);
+ Mod_LoadEdges (&header->lumps[LUMP_EDGES]);
+ Mod_LoadSurfedges (&header->lumps[LUMP_SURFEDGES]);
+ Mod_LoadTextures (&header->lumps[LUMP_TEXTURES]);
+ Mod_LoadLighting (&header->lumps[LUMP_LIGHTING]);
+ Mod_LoadPlanes (&header->lumps[LUMP_PLANES]);
+ Mod_LoadTexinfo (&header->lumps[LUMP_TEXINFO]);
+ Mod_LoadFaces (&header->lumps[LUMP_FACES]);
+ Mod_LoadMarksurfaces (&header->lumps[LUMP_MARKSURFACES]);
+ Mod_LoadVisibility (&header->lumps[LUMP_VISIBILITY]);
+ Mod_LoadLeafs (&header->lumps[LUMP_LEAFS]);
+ Mod_LoadNodes (&header->lumps[LUMP_NODES]);
+ Mod_LoadClipnodes (&header->lumps[LUMP_CLIPNODES]);
+ Mod_LoadSubmodels (&header->lumps[LUMP_MODELS]);
- // make combined bounding box from children
- node->mins[0] = min(node->children[0]->mins[0], node->children[1]->mins[0]);
- node->mins[1] = min(node->children[0]->mins[1], node->children[1]->mins[1]);
- node->mins[2] = min(node->children[0]->mins[2], node->children[1]->mins[2]);
- node->maxs[0] = max(node->children[0]->maxs[0], node->children[1]->maxs[0]);
- node->maxs[1] = max(node->children[0]->maxs[1], node->children[1]->maxs[1]);
- node->maxs[2] = max(node->children[0]->maxs[2], node->children[1]->maxs[2]);
-}
+ Mod_MakeHull0 ();
+ Mod_MakePortals();
-static void Mod_FinalizePortals(void)
-{
- int i, j, numportals, numpoints;
- portal_t *p, *pnext;
- mportal_t *portal;
- mvertex_t *point;
- mleaf_t *leaf, *endleaf;
- winding_t *w;
+ mod->numframes = 2; // regular and alternate animation
- // recalculate bounding boxes for all leafs (because qbsp is very sloppy)
- leaf = loadmodel->leafs;
- endleaf = leaf + loadmodel->numleafs;
- for (;leaf < endleaf;leaf++)
- {
- VectorSet(leaf->mins, 2000000000, 2000000000, 2000000000);
- VectorSet(leaf->maxs, -2000000000, -2000000000, -2000000000);
- }
- p = portalchain;
- while(p)
+ mainmempool = mod->mempool;
+ loadname = mod->name;
+
+ Mod_LoadLightList ();
+ originalloadmodel = loadmodel;
+
+//
+// set up the submodels (FIXME: this is confusing)
+//
+ for (i = 0;i < mod->numsubmodels;i++)
{
- if (p->winding)
+ bm = &mod->submodels[i];
+
+ mod->hulls[0].firstclipnode = bm->headnode[0];
+ for (j=1 ; j<MAX_MAP_HULLS ; j++)
{
- for (i = 0;i < 2;i++)
+ mod->hulls[j].firstclipnode = bm->headnode[j];
+ mod->hulls[j].lastclipnode = mod->numclipnodes - 1;
+ }
+
+ mod->firstmodelsurface = bm->firstface;
+ mod->nummodelsurfaces = bm->numfaces;
+
+ // this gets altered below if sky is used
+ mod->DrawSky = NULL;
+ mod->Draw = R_Model_Brush_Draw;
+ mod->DrawFakeShadow = NULL;
+ mod->DrawShadowVolume = R_Model_Brush_DrawShadowVolume;
+ mod->DrawLight = R_Model_Brush_DrawLight;
+ mod->pvstexturechains = Mem_Alloc(originalloadmodel->mempool, mod->numtextures * sizeof(msurface_t **));
+ mod->pvstexturechainsbuffer = Mem_Alloc(originalloadmodel->mempool, (mod->nummodelsurfaces + mod->numtextures) * sizeof(msurface_t *));
+ mod->pvstexturechainslength = Mem_Alloc(originalloadmodel->mempool, mod->numtextures * sizeof(int));
+ Mod_BuildPVSTextureChains(mod);
+ Mod_BuildLightmapUpdateChains(originalloadmodel->mempool, mod);
+ if (mod->nummodelsurfaces)
+ {
+ // LordHavoc: calculate bmodel bounding box rather than trusting what it says
+ mod->normalmins[0] = mod->normalmins[1] = mod->normalmins[2] = 1000000000.0f;
+ mod->normalmaxs[0] = mod->normalmaxs[1] = mod->normalmaxs[2] = -1000000000.0f;
+ modelyawradius = 0;
+ modelradius = 0;
+ for (j = 0, surf = &mod->surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surf++)
{
- leaf = (mleaf_t *)p->nodes[i];
- w = p->winding;
- for (j = 0;j < w->numpoints;j++)
+ // we only need to have a drawsky function if it is used (usually only on world model)
+ if (surf->texinfo->texture->shader == &Cshader_sky)
+ mod->DrawSky = R_Model_Brush_DrawSky;
+ // LordHavoc: submodels always clip, even if water
+ if (mod->numsubmodels - 1)
+ surf->flags |= SURF_SOLIDCLIP;
+ // calculate bounding shapes
+ for (mesh = surf->mesh;mesh;mesh = mesh->chain)
{
- if (leaf->mins[0] > w->points[j][0]) leaf->mins[0] = w->points[j][0];
- if (leaf->mins[1] > w->points[j][1]) leaf->mins[1] = w->points[j][1];
- if (leaf->mins[2] > w->points[j][2]) leaf->mins[2] = w->points[j][2];
- if (leaf->maxs[0] < w->points[j][0]) leaf->maxs[0] = w->points[j][0];
- if (leaf->maxs[1] < w->points[j][1]) leaf->maxs[1] = w->points[j][1];
- if (leaf->maxs[2] < w->points[j][2]) leaf->maxs[2] = w->points[j][2];
+ for (k = 0, vec = mesh->vertex3f;k < mesh->numverts;k++, vec += 3)
+ {
+ if (mod->normalmins[0] > vec[0]) mod->normalmins[0] = vec[0];
+ if (mod->normalmins[1] > vec[1]) mod->normalmins[1] = vec[1];
+ if (mod->normalmins[2] > vec[2]) mod->normalmins[2] = vec[2];
+ if (mod->normalmaxs[0] < vec[0]) mod->normalmaxs[0] = vec[0];
+ if (mod->normalmaxs[1] < vec[1]) mod->normalmaxs[1] = vec[1];
+ if (mod->normalmaxs[2] < vec[2]) mod->normalmaxs[2] = vec[2];
+ dist = vec[0]*vec[0]+vec[1]*vec[1];
+ if (modelyawradius < dist)
+ modelyawradius = dist;
+ dist += vec[2]*vec[2];
+ if (modelradius < dist)
+ modelradius = dist;
+ }
}
}
+ modelyawradius = sqrt(modelyawradius);
+ modelradius = sqrt(modelradius);
+ mod->yawmins[0] = mod->yawmins[1] = -(mod->yawmaxs[0] = mod->yawmaxs[1] = modelyawradius);
+ mod->yawmins[2] = mod->normalmins[2];
+ mod->yawmaxs[2] = mod->normalmaxs[2];
+ mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
+ mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
+ mod->radius = modelradius;
+ mod->radius2 = modelradius * modelradius;
}
- p = p->chain;
- }
+ else
+ {
+ // LordHavoc: empty submodel (lacrima.bsp has such a glitch)
+ Con_Printf("warning: empty submodel *%i in %s\n", i+1, loadname);
+ }
+ Mod_BuildSurfaceNeighbors(mod->surfaces + mod->firstmodelsurface, mod->nummodelsurfaces, originalloadmodel->mempool);
- Mod_RecursiveRecalcNodeBBox(loadmodel->nodes);
+ mod->numleafs = bm->visleafs;
- // tally up portal and point counts
- p = portalchain;
- numportals = 0;
- numpoints = 0;
- while(p)
- {
- // note: this check must match the one below or it will usually corrupt memory
- // the nodes[0] != nodes[1] check is because leaf 0 is the shared solid leaf, it can have many portals inside with leaf 0 on both sides
- if (p->winding && p->nodes[0] != p->nodes[1]
- && p->nodes[0]->contents != CONTENTS_SOLID && p->nodes[1]->contents != CONTENTS_SOLID
- && p->nodes[0]->contents != CONTENTS_SKY && p->nodes[1]->contents != CONTENTS_SKY)
+ // LordHavoc: only register submodels if it is the world
+ // (prevents bsp models from replacing world submodels)
+ if (loadmodel->isworldmodel && i < (mod->numsubmodels - 1))
{
- numportals += 2;
- numpoints += p->winding->numpoints * 2;
+ char name[10];
+ // duplicate the basic information
+ sprintf (name, "*%i", i+1);
+ loadmodel = Mod_FindName (name);
+ *loadmodel = *mod;
+ strcpy (loadmodel->name, name);
+ // textures and memory belong to the main model
+ loadmodel->texturepool = NULL;
+ loadmodel->mempool = NULL;
+ mod = loadmodel;
}
- p = p->chain;
}
- loadmodel->portals = Mem_Alloc(loadmodel->mempool, numportals * sizeof(mportal_t) + numpoints * sizeof(mvertex_t));
- loadmodel->numportals = numportals;
- loadmodel->portalpoints = (void *) ((qbyte *) loadmodel->portals + numportals * sizeof(mportal_t));
- loadmodel->numportalpoints = numpoints;
- // clear all leaf portal chains
- for (i = 0;i < loadmodel->numleafs;i++)
- loadmodel->leafs[i].portals = NULL;
- // process all portals in the global portal chain, while freeing them
- portal = loadmodel->portals;
- point = loadmodel->portalpoints;
- p = portalchain;
- portalchain = NULL;
- while (p)
- {
- pnext = p->chain;
- if (p->winding)
- {
- // note: this check must match the one above or it will usually corrupt memory
- // the nodes[0] != nodes[1] check is because leaf 0 is the shared solid leaf, it can have many portals inside with leaf 0 on both sides
- if (p->nodes[0] != p->nodes[1]
- && p->nodes[0]->contents != CONTENTS_SOLID && p->nodes[1]->contents != CONTENTS_SOLID
- && p->nodes[0]->contents != CONTENTS_SKY && p->nodes[1]->contents != CONTENTS_SKY)
- {
- // first make the back to front portal (forward portal)
- portal->points = point;
- portal->numpoints = p->winding->numpoints;
- portal->plane.dist = p->plane.dist;
- VectorCopy(p->plane.normal, portal->plane.normal);
- portal->here = (mleaf_t *)p->nodes[1];
- portal->past = (mleaf_t *)p->nodes[0];
- // copy points
- for (j = 0;j < portal->numpoints;j++)
- {
- VectorCopy(p->winding->points[j], point->position);
- point++;
- }
- PlaneClassify(&portal->plane);
+ loadmodel = originalloadmodel;
+ //Mod_ProcessLightList ();
+}
- // link into leaf's portal chain
- portal->next = portal->here->portals;
- portal->here->portals = portal;
+static void Mod_Q2LoadEntities (lump_t *l)
+{
+}
- // advance to next portal
- portal++;
+static void Mod_Q2LoadPlanes (lump_t *l)
+{
+/*
+ d_t *in;
+ m_t *out;
+ int i, count;
- // then make the front to back portal (backward portal)
- portal->points = point;
- portal->numpoints = p->winding->numpoints;
- portal->plane.dist = -p->plane.dist;
- VectorNegate(p->plane.normal, portal->plane.normal);
- portal->here = (mleaf_t *)p->nodes[0];
- portal->past = (mleaf_t *)p->nodes[1];
- // copy points
- for (j = portal->numpoints - 1;j >= 0;j--)
- {
- VectorCopy(p->winding->points[j], point->position);
- point++;
- }
- PlaneClassify(&portal->plane);
+ in = (void *)(mod_base + l->fileofs);
+ if (l->filelen % sizeof(*in))
+ Host_Error ("MOD_LoadBmodel: funny lump size in %s",loadmodel->name);
+ count = l->filelen / sizeof(*in);
+ out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
- // link into leaf's portal chain
- portal->next = portal->here->portals;
- portal->here->portals = portal;
+ loadmodel-> = out;
+ loadmodel->num = count;
- // advance to next portal
- portal++;
- }
- FreeWinding(p->winding);
- }
- FreePortal(p);
- p = pnext;
+ for (i = 0;i < count;i++, in++, out++)
+ {
}
+*/
}
+static void Mod_Q2LoadVertices (lump_t *l)
+{
/*
-=============
-AddPortalToNodes
-=============
+ d_t *in;
+ m_t *out;
+ int i, count;
+
+ in = (void *)(mod_base + l->fileofs);
+ if (l->filelen % sizeof(*in))
+ Host_Error ("MOD_LoadBmodel: funny lump size in %s",loadmodel->name);
+ count = l->filelen / sizeof(*in);
+ out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
+
+ loadmodel-> = out;
+ loadmodel->num = count;
+
+ for (i = 0;i < count;i++, in++, out++)
+ {
+ }
*/
-static void AddPortalToNodes (portal_t *p, mnode_t *front, mnode_t *back)
+}
+
+static void Mod_Q2LoadVisibility (lump_t *l)
{
- if (!front)
- Host_Error ("AddPortalToNodes: NULL front node");
- if (!back)
- Host_Error ("AddPortalToNodes: NULL back node");
- if (p->nodes[0] || p->nodes[1])
- Host_Error ("AddPortalToNodes: already included");
- // note: front == back is handled gracefully, because leaf 0 is the shared solid leaf, it can often have portals with the same leaf on both sides
+/*
+ d_t *in;
+ m_t *out;
+ int i, count;
- p->nodes[0] = front;
- p->next[0] = (portal_t *)front->portals;
- front->portals = (mportal_t *)p;
+ in = (void *)(mod_base + l->fileofs);
+ if (l->filelen % sizeof(*in))
+ Host_Error ("MOD_LoadBmodel: funny lump size in %s",loadmodel->name);
+ count = l->filelen / sizeof(*in);
+ out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
- p->nodes[1] = back;
- p->next[1] = (portal_t *)back->portals;
- back->portals = (mportal_t *)p;
+ loadmodel-> = out;
+ loadmodel->num = count;
+
+ for (i = 0;i < count;i++, in++, out++)
+ {
+ }
+*/
}
+static void Mod_Q2LoadNodes (lump_t *l)
+{
/*
-=============
-RemovePortalFromNode
-=============
+ d_t *in;
+ m_t *out;
+ int i, count;
+
+ in = (void *)(mod_base + l->fileofs);
+ if (l->filelen % sizeof(*in))
+ Host_Error ("MOD_LoadBmodel: funny lump size in %s",loadmodel->name);
+ count = l->filelen / sizeof(*in);
+ out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
+
+ loadmodel-> = out;
+ loadmodel->num = count;
+
+ for (i = 0;i < count;i++, in++, out++)
+ {
+ }
*/
-static void RemovePortalFromNodes(portal_t *portal)
+}
+
+static void Mod_Q2LoadTexInfo (lump_t *l)
{
- int i;
- mnode_t *node;
- void **portalpointer;
- portal_t *t;
- for (i = 0;i < 2;i++)
- {
- node = portal->nodes[i];
+/*
+ d_t *in;
+ m_t *out;
+ int i, count;
- portalpointer = (void **) &node->portals;
- while (1)
- {
- t = *portalpointer;
- if (!t)
- Host_Error ("RemovePortalFromNodes: portal not in leaf");
+ in = (void *)(mod_base + l->fileofs);
+ if (l->filelen % sizeof(*in))
+ Host_Error ("MOD_LoadBmodel: funny lump size in %s",loadmodel->name);
+ count = l->filelen / sizeof(*in);
+ out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
- if (t == portal)
- {
- if (portal->nodes[0] == node)
- {
- *portalpointer = portal->next[0];
- portal->nodes[0] = NULL;
- }
- else if (portal->nodes[1] == node)
- {
- *portalpointer = portal->next[1];
- portal->nodes[1] = NULL;
- }
- else
- Host_Error ("RemovePortalFromNodes: portal not bounding leaf");
- break;
- }
+ loadmodel-> = out;
+ loadmodel->num = count;
- if (t->nodes[0] == node)
- portalpointer = (void **) &t->next[0];
- else if (t->nodes[1] == node)
- portalpointer = (void **) &t->next[1];
- else
- Host_Error ("RemovePortalFromNodes: portal not bounding leaf");
- }
+ for (i = 0;i < count;i++, in++, out++)
+ {
}
+*/
}
-static void Mod_RecursiveNodePortals (mnode_t *node)
+static void Mod_Q2LoadFaces (lump_t *l)
{
- int side;
- mnode_t *front, *back, *other_node;
- mplane_t clipplane, *plane;
- portal_t *portal, *nextportal, *nodeportal, *splitportal, *temp;
- winding_t *nodeportalwinding, *frontwinding, *backwinding;
+/*
+ d_t *in;
+ m_t *out;
+ int i, count;
- // if a leaf, we're done
- if (node->contents)
- return;
+ in = (void *)(mod_base + l->fileofs);
+ if (l->filelen % sizeof(*in))
+ Host_Error ("MOD_LoadBmodel: funny lump size in %s",loadmodel->name);
+ count = l->filelen / sizeof(*in);
+ out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
- plane = node->plane;
+ loadmodel-> = out;
+ loadmodel->num = count;
- front = node->children[0];
- back = node->children[1];
- if (front == back)
- Host_Error("Mod_RecursiveNodePortals: corrupt node hierarchy");
+ for (i = 0;i < count;i++, in++, out++)
+ {
+ }
+*/
+}
- // create the new portal by generating a polygon for the node plane,
- // and clipping it by all of the other portals (which came from nodes above this one)
- nodeportal = AllocPortal ();
- nodeportal->plane = *node->plane;
+static void Mod_Q2LoadLighting (lump_t *l)
+{
+/*
+ d_t *in;
+ m_t *out;
+ int i, count;
- nodeportalwinding = BaseWindingForPlane (node->plane);
- side = 0; // shut up compiler warning
- for (portal = (portal_t *)node->portals;portal;portal = portal->next[side])
- {
- clipplane = portal->plane;
- if (portal->nodes[0] == portal->nodes[1])
- Host_Error("Mod_RecursiveNodePortals: portal has same node on both sides (1)");
- if (portal->nodes[0] == node)
- side = 0;
- else if (portal->nodes[1] == node)
- {
- clipplane.dist = -clipplane.dist;
- VectorNegate (clipplane.normal, clipplane.normal);
- side = 1;
- }
- else
- Host_Error ("Mod_RecursiveNodePortals: mislinked portal");
+ in = (void *)(mod_base + l->fileofs);
+ if (l->filelen % sizeof(*in))
+ Host_Error ("MOD_LoadBmodel: funny lump size in %s",loadmodel->name);
+ count = l->filelen / sizeof(*in);
+ out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
- nodeportalwinding = ClipWinding (nodeportalwinding, &clipplane, true);
- if (!nodeportalwinding)
- {
- printf ("Mod_RecursiveNodePortals: WARNING: new portal was clipped away\n");
- break;
- }
- }
+ loadmodel-> = out;
+ loadmodel->num = count;
- if (nodeportalwinding)
+ for (i = 0;i < count;i++, in++, out++)
{
- // if the plane was not clipped on all sides, there was an error
- nodeportal->winding = nodeportalwinding;
- AddPortalToNodes (nodeportal, front, back);
}
+*/
+}
- // split the portals of this node along this node's plane and assign them to the children of this node
- // (migrating the portals downward through the tree)
- for (portal = (portal_t *)node->portals;portal;portal = nextportal)
+static void Mod_Q2LoadLeafs (lump_t *l)
+{
+/*
+ d_t *in;
+ m_t *out;
+ int i, count;
+
+ in = (void *)(mod_base + l->fileofs);
+ if (l->filelen % sizeof(*in))
+ Host_Error ("MOD_LoadBmodel: funny lump size in %s",loadmodel->name);
+ count = l->filelen / sizeof(*in);
+ out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
+
+ loadmodel-> = out;
+ loadmodel->num = count;
+
+ for (i = 0;i < count;i++, in++, out++)
{
- if (portal->nodes[0] == portal->nodes[1])
- Host_Error("Mod_RecursiveNodePortals: portal has same node on both sides (2)");
- if (portal->nodes[0] == node)
- side = 0;
- else if (portal->nodes[1] == node)
- side = 1;
- else
- Host_Error ("Mod_RecursiveNodePortals: mislinked portal");
- nextportal = portal->next[side];
+ }
+*/
+}
- other_node = portal->nodes[!side];
- RemovePortalFromNodes (portal);
+static void Mod_Q2LoadLeafFaces (lump_t *l)
+{
+/*
+ d_t *in;
+ m_t *out;
+ int i, count;
+
+ in = (void *)(mod_base + l->fileofs);
+ if (l->filelen % sizeof(*in))
+ Host_Error ("MOD_LoadBmodel: funny lump size in %s",loadmodel->name);
+ count = l->filelen / sizeof(*in);
+ out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
+
+ loadmodel-> = out;
+ loadmodel->num = count;
+
+ for (i = 0;i < count;i++, in++, out++)
+ {
+ }
+*/
+}
- // cut the portal into two portals, one on each side of the node plane
- DivideWinding (portal->winding, plane, &frontwinding, &backwinding);
+static void Mod_Q2LoadLeafBrushes (lump_t *l)
+{
+/*
+ d_t *in;
+ m_t *out;
+ int i, count;
- if (!frontwinding)
- {
- if (side == 0)
- AddPortalToNodes (portal, back, other_node);
- else
- AddPortalToNodes (portal, other_node, back);
- continue;
- }
- if (!backwinding)
- {
- if (side == 0)
- AddPortalToNodes (portal, front, other_node);
- else
- AddPortalToNodes (portal, other_node, front);
- continue;
- }
+ in = (void *)(mod_base + l->fileofs);
+ if (l->filelen % sizeof(*in))
+ Host_Error ("MOD_LoadBmodel: funny lump size in %s",loadmodel->name);
+ count = l->filelen / sizeof(*in);
+ out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
- // the winding is split
- splitportal = AllocPortal ();
- temp = splitportal->chain;
- *splitportal = *portal;
- splitportal->chain = temp;
- splitportal->winding = backwinding;
- FreeWinding (portal->winding);
- portal->winding = frontwinding;
+ loadmodel-> = out;
+ loadmodel->num = count;
- if (side == 0)
- {
- AddPortalToNodes (portal, front, other_node);
- AddPortalToNodes (splitportal, back, other_node);
- }
- else
- {
- AddPortalToNodes (portal, other_node, front);
- AddPortalToNodes (splitportal, other_node, back);
- }
+ for (i = 0;i < count;i++, in++, out++)
+ {
}
-
- Mod_RecursiveNodePortals(front);
- Mod_RecursiveNodePortals(back);
+*/
}
-
-static void Mod_MakePortals(void)
+static void Mod_Q2LoadEdges (lump_t *l)
{
- portalchain = NULL;
- Mod_RecursiveNodePortals (loadmodel->nodes);
- Mod_FinalizePortals();
+/*
+ d_t *in;
+ m_t *out;
+ int i, count;
+
+ in = (void *)(mod_base + l->fileofs);
+ if (l->filelen % sizeof(*in))
+ Host_Error ("MOD_LoadBmodel: funny lump size in %s",loadmodel->name);
+ count = l->filelen / sizeof(*in);
+ out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
+
+ loadmodel-> = out;
+ loadmodel->num = count;
+
+ for (i = 0;i < count;i++, in++, out++)
+ {
+ }
+*/
}
+static void Mod_Q2LoadSurfEdges (lump_t *l)
+{
/*
-=================
-Mod_LoadBrushModel
-=================
+ d_t *in;
+ m_t *out;
+ int i, count;
+
+ in = (void *)(mod_base + l->fileofs);
+ if (l->filelen % sizeof(*in))
+ Host_Error ("MOD_LoadBmodel: funny lump size in %s",loadmodel->name);
+ count = l->filelen / sizeof(*in);
+ out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
+
+ loadmodel-> = out;
+ loadmodel->num = count;
+
+ for (i = 0;i < count;i++, in++, out++)
+ {
+ }
*/
-extern void R_DrawBrushModelShadowVolume (entity_render_t *ent, vec3_t relativelightorigin, float lightradius, int visiblevolume);
-void Mod_LoadBrushModel (model_t *mod, void *buffer)
+}
+
+static void Mod_Q2LoadBrushes (lump_t *l)
{
- int i, j;
- dheader_t *header;
- dmodel_t *bm;
- mempool_t *mainmempool;
- char *loadname;
- model_t *originalloadmodel;
+/*
+ d_t *in;
+ m_t *out;
+ int i, count;
- mod->type = mod_brush;
+ in = (void *)(mod_base + l->fileofs);
+ if (l->filelen % sizeof(*in))
+ Host_Error ("MOD_LoadBmodel: funny lump size in %s",loadmodel->name);
+ count = l->filelen / sizeof(*in);
+ out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
- header = (dheader_t *)buffer;
+ loadmodel-> = out;
+ loadmodel->num = count;
- i = LittleLong (header->version);
- if (i != BSPVERSION && i != 30)
- Host_Error ("Mod_LoadBrushModel: %s has wrong version number (%i should be %i (Quake) or 30 (HalfLife))", mod->name, i, BSPVERSION);
- mod->ishlbsp = i == 30;
- if (loadmodel->isworldmodel)
+ for (i = 0;i < count;i++, in++, out++)
{
- Cvar_SetValue("halflifebsp", mod->ishlbsp);
- // until we get a texture for it...
- R_ResetQuakeSky();
}
+*/
+}
-// swap all the lumps
- mod_base = (qbyte *)header;
+static void Mod_Q2LoadBrushSides (lump_t *l)
+{
+/*
+ d_t *in;
+ m_t *out;
+ int i, count;
- for (i=0 ; i<sizeof(dheader_t)/4 ; i++)
- ((int *)header)[i] = LittleLong ( ((int *)header)[i]);
+ in = (void *)(mod_base + l->fileofs);
+ if (l->filelen % sizeof(*in))
+ Host_Error ("MOD_LoadBmodel: funny lump size in %s",loadmodel->name);
+ count = l->filelen / sizeof(*in);
+ out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
-// load into heap
+ loadmodel-> = out;
+ loadmodel->num = count;
- // store which lightmap format to use
- mod->lightmaprgba = r_lightmaprgba.integer;
+ for (i = 0;i < count;i++, in++, out++)
+ {
+ }
+*/
+}
- Mod_LoadEntities (&header->lumps[LUMP_ENTITIES]);
- Mod_LoadVertexes (&header->lumps[LUMP_VERTEXES]);
- Mod_LoadEdges (&header->lumps[LUMP_EDGES]);
- Mod_LoadSurfedges (&header->lumps[LUMP_SURFEDGES]);
- Mod_LoadTextures (&header->lumps[LUMP_TEXTURES]);
- Mod_LoadLighting (&header->lumps[LUMP_LIGHTING]);
- Mod_LoadPlanes (&header->lumps[LUMP_PLANES]);
- Mod_LoadTexinfo (&header->lumps[LUMP_TEXINFO]);
- Mod_LoadFaces (&header->lumps[LUMP_FACES]);
- Mod_LoadMarksurfaces (&header->lumps[LUMP_MARKSURFACES]);
- Mod_LoadVisibility (&header->lumps[LUMP_VISIBILITY]);
- Mod_LoadLeafs (&header->lumps[LUMP_LEAFS]);
- Mod_LoadNodes (&header->lumps[LUMP_NODES]);
- Mod_LoadClipnodes (&header->lumps[LUMP_CLIPNODES]);
- Mod_LoadSubmodels (&header->lumps[LUMP_MODELS]);
+static void Mod_Q2LoadAreas (lump_t *l)
+{
+/*
+ d_t *in;
+ m_t *out;
+ int i, count;
- Mod_MakeHull0 ();
- Mod_MakePortals();
+ in = (void *)(mod_base + l->fileofs);
+ if (l->filelen % sizeof(*in))
+ Host_Error ("MOD_LoadBmodel: funny lump size in %s",loadmodel->name);
+ count = l->filelen / sizeof(*in);
+ out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
- mod->numframes = 2; // regular and alternate animation
+ loadmodel-> = out;
+ loadmodel->num = count;
- mainmempool = mod->mempool;
- loadname = mod->name;
+ for (i = 0;i < count;i++, in++, out++)
+ {
+ }
+*/
+}
- Mod_LoadLightList ();
- originalloadmodel = loadmodel;
+static void Mod_Q2LoadAreaPortals (lump_t *l)
+{
+/*
+ d_t *in;
+ m_t *out;
+ int i, count;
-//
-// set up the submodels (FIXME: this is confusing)
-//
- for (i = 0;i < mod->numsubmodels;i++)
+ in = (void *)(mod_base + l->fileofs);
+ if (l->filelen % sizeof(*in))
+ Host_Error ("MOD_LoadBmodel: funny lump size in %s",loadmodel->name);
+ count = l->filelen / sizeof(*in);
+ out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
+
+ loadmodel-> = out;
+ loadmodel->num = count;
+
+ for (i = 0;i < count;i++, in++, out++)
{
- int k, l;
- float dist, modelyawradius, modelradius, *vec;
- msurface_t *surf;
+ }
+*/
+}
- mod->normalmins[0] = mod->normalmins[1] = mod->normalmins[2] = 1000000000.0f;
- mod->normalmaxs[0] = mod->normalmaxs[1] = mod->normalmaxs[2] = -1000000000.0f;
- modelyawradius = 0;
- modelradius = 0;
+static void Mod_Q2LoadModels (lump_t *l)
+{
+/*
+ d_t *in;
+ m_t *out;
+ int i, count;
- bm = &mod->submodels[i];
+ in = (void *)(mod_base + l->fileofs);
+ if (l->filelen % sizeof(*in))
+ Host_Error ("MOD_LoadBmodel: funny lump size in %s",loadmodel->name);
+ count = l->filelen / sizeof(*in);
+ out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
- mod->hulls[0].firstclipnode = bm->headnode[0];
- for (j=1 ; j<MAX_MAP_HULLS ; j++)
- {
- mod->hulls[j].firstclipnode = bm->headnode[j];
- mod->hulls[j].lastclipnode = mod->numclipnodes - 1;
- }
+ loadmodel-> = out;
+ loadmodel->num = count;
- mod->firstmodelsurface = bm->firstface;
- mod->nummodelsurfaces = bm->numfaces;
+ for (i = 0;i < count;i++, in++, out++)
+ {
+ }
+*/
+}
- mod->DrawSky = NULL;
- if (mod->nummodelsurfaces)
- {
- // LordHavoc: calculate bmodel bounding box rather than trusting what it says
- for (j = 0, surf = &mod->surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surf++)
- {
- // we only need to have a drawsky function if it is used (usually only on world model)
- if (surf->texinfo->texture->shader == &Cshader_sky)
- mod->DrawSky = R_DrawBrushModelSky;
- for (k = 0;k < surf->numedges;k++)
- {
- l = mod->surfedges[k + surf->firstedge];
- if (l > 0)
- vec = mod->vertexes[mod->edges[l].v[0]].position;
- else
- vec = mod->vertexes[mod->edges[-l].v[1]].position;
- if (mod->normalmins[0] > vec[0]) mod->normalmins[0] = vec[0];
- if (mod->normalmins[1] > vec[1]) mod->normalmins[1] = vec[1];
- if (mod->normalmins[2] > vec[2]) mod->normalmins[2] = vec[2];
- if (mod->normalmaxs[0] < vec[0]) mod->normalmaxs[0] = vec[0];
- if (mod->normalmaxs[1] < vec[1]) mod->normalmaxs[1] = vec[1];
- if (mod->normalmaxs[2] < vec[2]) mod->normalmaxs[2] = vec[2];
- dist = vec[0]*vec[0]+vec[1]*vec[1];
- if (modelyawradius < dist)
- modelyawradius = dist;
- dist += vec[2]*vec[2];
- if (modelradius < dist)
- modelradius = dist;
- }
- }
- modelyawradius = sqrt(modelyawradius);
- modelradius = sqrt(modelradius);
- mod->yawmins[0] = mod->yawmins[1] = -(mod->yawmaxs[0] = mod->yawmaxs[1] = modelyawradius);
- mod->yawmins[2] = mod->normalmins[2];
- mod->yawmaxs[2] = mod->normalmaxs[2];
- mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
- mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
- mod->radius = modelradius;
- mod->radius2 = modelradius * modelradius;
- // LordHavoc: build triangle meshs for entire model's geometry
- // (only used for shadow volumes)
- mod->shadowmesh = Mod_ShadowMesh_Begin(originalloadmodel->mempool);
- for (j = 0, surf = &mod->surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surf++)
- if (surf->flags & SURF_CLIPSOLID)
- Mod_ShadowMesh_AddPolygon(originalloadmodel->mempool, mod->shadowmesh, surf->poly_numverts, surf->poly_verts);
- mod->shadowmesh = Mod_ShadowMesh_Finish(originalloadmodel->mempool, mod->shadowmesh);
- Mod_ShadowMesh_CalcBBox(mod->shadowmesh, mod->shadowmesh_mins, mod->shadowmesh_maxs, mod->shadowmesh_center, &mod->shadowmesh_radius);
- }
- else
- {
- // LordHavoc: empty submodel (lacrima.bsp has such a glitch)
- Con_Printf("warning: empty submodel *%i in %s\n", i+1, loadname);
- VectorClear(mod->normalmins);
- VectorClear(mod->normalmaxs);
- VectorClear(mod->yawmins);
- VectorClear(mod->yawmaxs);
- VectorClear(mod->rotatedmins);
- VectorClear(mod->rotatedmaxs);
- mod->radius = 0;
- mod->radius2 = 0;
- mod->shadowmesh = NULL;
- }
+void Mod_LoadBrushModelQ2 (model_t *mod, void *buffer)
+{
+ int i;
+ q2dheader_t *header;
- mod->numleafs = bm->visleafs;
+ mod->type = mod_brushq2;
- mod->Draw = R_DrawBrushModelNormal;
- mod->DrawFakeShadow = NULL;
- mod->DrawShadowVolume = R_DrawBrushModelShadowVolume;
+ header = (q2dheader_t *)buffer;
- // LordHavoc: only register submodels if it is the world
- // (prevents bsp models from replacing world submodels)
- if (loadmodel->isworldmodel && i < (mod->numsubmodels - 1))
- {
- char name[10];
- // duplicate the basic information
- sprintf (name, "*%i", i+1);
- loadmodel = Mod_FindName (name);
- *loadmodel = *mod;
- strcpy (loadmodel->name, name);
- // textures and memory belong to the main model
- loadmodel->texturepool = NULL;
- loadmodel->mempool = NULL;
- mod = loadmodel;
- }
+ i = LittleLong (header->version);
+ if (i != Q2BSPVERSION)
+ Host_Error ("Mod_LoadBrushModelQ2: %s has wrong version number (%i should be %i)", mod->name, i, BSPVERSION);
+ mod->ishlbsp = false;
+ if (loadmodel->isworldmodel)
+ {
+ Cvar_SetValue("halflifebsp", mod->ishlbsp);
+ // until we get a texture for it...
+ R_ResetQuakeSky();
}
- loadmodel = originalloadmodel;
- Mod_ProcessLightList ();
+ mod_base = (qbyte *)header;
+
+ // swap all the lumps
+ for (i = 0;i < (int) sizeof(dheader_t) / 4;i++)
+ ((int *)header)[i] = LittleLong ( ((int *)header)[i]);
+
+ // store which lightmap format to use
+ mod->lightmaprgba = r_lightmaprgba.integer;
+
+ Mod_Q2LoadEntities(&header->lumps[Q2LUMP_ENTITIES]);
+ Mod_Q2LoadPlanes(&header->lumps[Q2LUMP_PLANES]);
+ Mod_Q2LoadVertices(&header->lumps[Q2LUMP_VERTEXES]);
+ Mod_Q2LoadVisibility(&header->lumps[Q2LUMP_VISIBILITY]);
+ Mod_Q2LoadNodes(&header->lumps[Q2LUMP_NODES]);
+ Mod_Q2LoadTexInfo(&header->lumps[Q2LUMP_TEXINFO]);
+ Mod_Q2LoadFaces(&header->lumps[Q2LUMP_FACES]);
+ Mod_Q2LoadLighting(&header->lumps[Q2LUMP_LIGHTING]);
+ Mod_Q2LoadLeafs(&header->lumps[Q2LUMP_LEAFS]);
+ Mod_Q2LoadLeafFaces(&header->lumps[Q2LUMP_LEAFFACES]);
+ Mod_Q2LoadLeafBrushes(&header->lumps[Q2LUMP_LEAFBRUSHES]);
+ Mod_Q2LoadEdges(&header->lumps[Q2LUMP_EDGES]);
+ Mod_Q2LoadSurfEdges(&header->lumps[Q2LUMP_SURFEDGES]);
+ Mod_Q2LoadBrushes(&header->lumps[Q2LUMP_BRUSHES]);
+ Mod_Q2LoadBrushSides(&header->lumps[Q2LUMP_BRUSHSIDES]);
+ Mod_Q2LoadAreas(&header->lumps[Q2LUMP_AREAS]);
+ Mod_Q2LoadAreaPortals(&header->lumps[Q2LUMP_AREAPORTALS]);
+ // LordHavoc: must go last because this makes the submodels
+ Mod_Q2LoadModels(&header->lumps[Q2LUMP_MODELS]);
+}
+
+void Mod_LoadBrushModelQ3 (model_t *mod, void *buffer)
+{
+ Host_Error("Mod_LoadBrushModelQ3: not yet implemented\n");
+}
+
+void Mod_LoadBrushModelIBSP (model_t *mod, void *buffer)
+{
+ int i = LittleLong(*((int *)buffer));
+ if (i == 46)
+ Mod_LoadBrushModelQ3 (mod,buffer);
+ else if (i == 38)
+ Mod_LoadBrushModelQ2 (mod,buffer);
+ else
+ Host_Error("Mod_LoadBrushModelIBSP: unknown/unsupported version %i\n", i);
}
projects / xonotic / darkplaces.git / blobdiff