Collision against patches: do some major optimizations.
[divverent/darkplaces.git] / model_brush.c
1 /*
2 Copyright (C) 1996-1997 Id Software, Inc.
3
4 This program is free software; you can redistribute it and/or
5 modify it under the terms of the GNU General Public License
6 as published by the Free Software Foundation; either version 2
7 of the License, or (at your option) any later version.
8
9 This program is distributed in the hope that it will be useful,
10 but WITHOUT ANY WARRANTY; without even the implied warranty of
11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
12
13 See the GNU General Public License for more details.
14
15 You should have received a copy of the GNU General Public License
16 along with this program; if not, write to the Free Software
17 Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
18
19 */
20
21 #include "quakedef.h"
22 #include "image.h"
23 #include "r_shadow.h"
24 #include "polygon.h"
25 #include "curves.h"
26 #include "wad.h"
27
28
29 //cvar_t r_subdivide_size = {CVAR_SAVE, "r_subdivide_size", "128", "how large water polygons should be (smaller values produce more polygons which give better warping effects)"};
30 cvar_t r_novis = {0, "r_novis", "0", "draws whole level, see also sv_cullentities_pvs 0"};
31 cvar_t r_picmipworld = {CVAR_SAVE, "r_picmipworld", "1", "whether gl_picmip shall apply to world textures too"};
32 cvar_t r_nosurftextures = {0, "r_nosurftextures", "0", "pretends there was no texture lump found in the q1bsp/hlbsp loading (useful for debugging this rare case)"};
33 cvar_t r_subdivisions_tolerance = {0, "r_subdivisions_tolerance", "4", "maximum error tolerance on curve subdivision for rendering purposes (in other words, the curves will be given as many polygons as necessary to represent curves at this quality)"};
34 cvar_t r_subdivisions_mintess = {0, "r_subdivisions_mintess", "0", "minimum number of subdivisions (values above 0 will smooth curves that don't need it)"};
35 cvar_t r_subdivisions_maxtess = {0, "r_subdivisions_maxtess", "1024", "maximum number of subdivisions (prevents curves beyond a certain detail level, limits smoothing)"};
36 cvar_t r_subdivisions_maxvertices = {0, "r_subdivisions_maxvertices", "65536", "maximum vertices allowed per subdivided curve"};
37 cvar_t r_subdivisions_collision_tolerance = {0, "r_subdivisions_collision_tolerance", "15", "maximum error tolerance on curve subdivision for collision purposes (usually a larger error tolerance than for rendering)"};
38 cvar_t r_subdivisions_collision_mintess = {0, "r_subdivisions_collision_mintess", "0", "minimum number of subdivisions (values above 0 will smooth curves that don't need it)"};
39 cvar_t r_subdivisions_collision_maxtess = {0, "r_subdivisions_collision_maxtess", "1024", "maximum number of subdivisions (prevents curves beyond a certain detail level, limits smoothing)"};
40 cvar_t r_subdivisions_collision_maxvertices = {0, "r_subdivisions_collision_maxvertices", "4225", "maximum vertices allowed per subdivided curve"};
41 cvar_t mod_q3bsp_curves_collisions = {0, "mod_q3bsp_curves_collisions", "1", "enables collisions with curves (SLOW)"};
42 cvar_t mod_q3bsp_curves_collisions_stride = {0, "mod_q3bsp_curves_collisions_stride", "32", "collisions against curves: optimize performance by doing a combined collision check for this triangle amount first"};
43 cvar_t mod_q3bsp_optimizedtraceline = {0, "mod_q3bsp_optimizedtraceline", "1", "whether to use optimized traceline code for line traces (as opposed to tracebox code)"};
44 cvar_t mod_q3bsp_debugtracebrush = {0, "mod_q3bsp_debugtracebrush", "0", "selects different tracebrush bsp recursion algorithms (for debugging purposes only)"};
45 cvar_t mod_q3bsp_lightmapmergepower = {CVAR_SAVE, "mod_q3bsp_lightmapmergepower", "4", "merges the quake3 128x128 lightmap textures into larger lightmap group textures to speed up rendering, 1 = 256x256, 2 = 512x512, 3 = 1024x1024, 4 = 2048x2048, 5 = 4096x4096, ..."};
46 cvar_t mod_q3bsp_nolightmaps = {CVAR_SAVE, "mod_q3bsp_nolightmaps", "0", "do not load lightmaps in Q3BSP maps (to save video RAM, but be warned: it looks ugly)"};
47
48 static texture_t mod_q1bsp_texture_solid;
49 static texture_t mod_q1bsp_texture_sky;
50 static texture_t mod_q1bsp_texture_lava;
51 static texture_t mod_q1bsp_texture_slime;
52 static texture_t mod_q1bsp_texture_water;
53
54 void Mod_BrushInit(void)
55 {
56 //      Cvar_RegisterVariable(&r_subdivide_size);
57         Cvar_RegisterVariable(&r_novis);
58         Cvar_RegisterVariable(&r_picmipworld);
59         Cvar_RegisterVariable(&r_nosurftextures);
60         Cvar_RegisterVariable(&r_subdivisions_tolerance);
61         Cvar_RegisterVariable(&r_subdivisions_mintess);
62         Cvar_RegisterVariable(&r_subdivisions_maxtess);
63         Cvar_RegisterVariable(&r_subdivisions_maxvertices);
64         Cvar_RegisterVariable(&r_subdivisions_collision_tolerance);
65         Cvar_RegisterVariable(&r_subdivisions_collision_mintess);
66         Cvar_RegisterVariable(&r_subdivisions_collision_maxtess);
67         Cvar_RegisterVariable(&r_subdivisions_collision_maxvertices);
68         Cvar_RegisterVariable(&mod_q3bsp_curves_collisions);
69         Cvar_RegisterVariable(&mod_q3bsp_curves_collisions_stride);
70         Cvar_RegisterVariable(&mod_q3bsp_optimizedtraceline);
71         Cvar_RegisterVariable(&mod_q3bsp_debugtracebrush);
72         Cvar_RegisterVariable(&mod_q3bsp_lightmapmergepower);
73         Cvar_RegisterVariable(&mod_q3bsp_nolightmaps);
74
75         memset(&mod_q1bsp_texture_solid, 0, sizeof(mod_q1bsp_texture_solid));
76         strlcpy(mod_q1bsp_texture_solid.name, "solid" , sizeof(mod_q1bsp_texture_solid.name));
77         mod_q1bsp_texture_solid.surfaceflags = 0;
78         mod_q1bsp_texture_solid.supercontents = SUPERCONTENTS_SOLID;
79
80         mod_q1bsp_texture_sky = mod_q1bsp_texture_solid;
81         strlcpy(mod_q1bsp_texture_sky.name, "sky", sizeof(mod_q1bsp_texture_sky.name));
82         mod_q1bsp_texture_sky.surfaceflags = Q3SURFACEFLAG_SKY | Q3SURFACEFLAG_NOIMPACT | Q3SURFACEFLAG_NOMARKS | Q3SURFACEFLAG_NODLIGHT | Q3SURFACEFLAG_NOLIGHTMAP;
83         mod_q1bsp_texture_sky.supercontents = SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP;
84
85         mod_q1bsp_texture_lava = mod_q1bsp_texture_solid;
86         strlcpy(mod_q1bsp_texture_lava.name, "*lava", sizeof(mod_q1bsp_texture_lava.name));
87         mod_q1bsp_texture_lava.surfaceflags = Q3SURFACEFLAG_NOMARKS;
88         mod_q1bsp_texture_lava.supercontents = SUPERCONTENTS_LAVA | SUPERCONTENTS_NODROP;
89
90         mod_q1bsp_texture_slime = mod_q1bsp_texture_solid;
91         strlcpy(mod_q1bsp_texture_slime.name, "*slime", sizeof(mod_q1bsp_texture_slime.name));
92         mod_q1bsp_texture_slime.surfaceflags = Q3SURFACEFLAG_NOMARKS;
93         mod_q1bsp_texture_slime.supercontents = SUPERCONTENTS_SLIME;
94
95         mod_q1bsp_texture_water = mod_q1bsp_texture_solid;
96         strlcpy(mod_q1bsp_texture_water.name, "*water", sizeof(mod_q1bsp_texture_water.name));
97         mod_q1bsp_texture_water.surfaceflags = Q3SURFACEFLAG_NOMARKS;
98         mod_q1bsp_texture_water.supercontents = SUPERCONTENTS_WATER;
99 }
100
101 static mleaf_t *Mod_Q1BSP_PointInLeaf(dp_model_t *model, const vec3_t p)
102 {
103         mnode_t *node;
104
105         if (model == NULL)
106                 return NULL;
107
108         // LordHavoc: modified to start at first clip node,
109         // in other words: first node of the (sub)model
110         node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
111         while (node->plane)
112                 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
113
114         return (mleaf_t *)node;
115 }
116
117 static void Mod_Q1BSP_AmbientSoundLevelsForPoint(dp_model_t *model, const vec3_t p, unsigned char *out, int outsize)
118 {
119         int i;
120         mleaf_t *leaf;
121         leaf = Mod_Q1BSP_PointInLeaf(model, p);
122         if (leaf)
123         {
124                 i = min(outsize, (int)sizeof(leaf->ambient_sound_level));
125                 if (i)
126                 {
127                         memcpy(out, leaf->ambient_sound_level, i);
128                         out += i;
129                         outsize -= i;
130                 }
131         }
132         if (outsize)
133                 memset(out, 0, outsize);
134 }
135
136 static int Mod_Q1BSP_FindBoxClusters(dp_model_t *model, const vec3_t mins, const vec3_t maxs, int maxclusters, int *clusterlist)
137 {
138         int numclusters = 0;
139         int nodestackindex = 0;
140         mnode_t *node, *nodestack[1024];
141         if (!model->brush.num_pvsclusters)
142                 return -1;
143         node = model->brush.data_nodes;
144         for (;;)
145         {
146 #if 1
147                 if (node->plane)
148                 {
149                         // node - recurse down the BSP tree
150                         int sides = BoxOnPlaneSide(mins, maxs, node->plane);
151                         if (sides < 3)
152                         {
153                                 if (sides == 0)
154                                         return -1; // ERROR: NAN bounding box!
155                                 // box is on one side of plane, take that path
156                                 node = node->children[sides-1];
157                         }
158                         else
159                         {
160                                 // box crosses plane, take one path and remember the other
161                                 if (nodestackindex < 1024)
162                                         nodestack[nodestackindex++] = node->children[0];
163                                 node = node->children[1];
164                         }
165                         continue;
166                 }
167                 else
168                 {
169                         // leaf - add clusterindex to list
170                         if (numclusters < maxclusters)
171                                 clusterlist[numclusters] = ((mleaf_t *)node)->clusterindex;
172                         numclusters++;
173                 }
174 #else
175                 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
176                 {
177                         if (node->plane)
178                         {
179                                 if (nodestackindex < 1024)
180                                         nodestack[nodestackindex++] = node->children[0];
181                                 node = node->children[1];
182                                 continue;
183                         }
184                         else
185                         {
186                                 // leaf - add clusterindex to list
187                                 if (numclusters < maxclusters)
188                                         clusterlist[numclusters] = ((mleaf_t *)node)->clusterindex;
189                                 numclusters++;
190                         }
191                 }
192 #endif
193                 // try another path we didn't take earlier
194                 if (nodestackindex == 0)
195                         break;
196                 node = nodestack[--nodestackindex];
197         }
198         // return number of clusters found (even if more than the maxclusters)
199         return numclusters;
200 }
201
202 static int Mod_Q1BSP_BoxTouchingPVS(dp_model_t *model, const unsigned char *pvs, const vec3_t mins, const vec3_t maxs)
203 {
204         int nodestackindex = 0;
205         mnode_t *node, *nodestack[1024];
206         if (!model->brush.num_pvsclusters)
207                 return true;
208         node = model->brush.data_nodes;
209         for (;;)
210         {
211 #if 1
212                 if (node->plane)
213                 {
214                         // node - recurse down the BSP tree
215                         int sides = BoxOnPlaneSide(mins, maxs, node->plane);
216                         if (sides < 3)
217                         {
218                                 if (sides == 0)
219                                         return -1; // ERROR: NAN bounding box!
220                                 // box is on one side of plane, take that path
221                                 node = node->children[sides-1];
222                         }
223                         else
224                         {
225                                 // box crosses plane, take one path and remember the other
226                                 if (nodestackindex < 1024)
227                                         nodestack[nodestackindex++] = node->children[0];
228                                 node = node->children[1];
229                         }
230                         continue;
231                 }
232                 else
233                 {
234                         // leaf - check cluster bit
235                         int clusterindex = ((mleaf_t *)node)->clusterindex;
236                         if (CHECKPVSBIT(pvs, clusterindex))
237                         {
238                                 // it is visible, return immediately with the news
239                                 return true;
240                         }
241                 }
242 #else
243                 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
244                 {
245                         if (node->plane)
246                         {
247                                 if (nodestackindex < 1024)
248                                         nodestack[nodestackindex++] = node->children[0];
249                                 node = node->children[1];
250                                 continue;
251                         }
252                         else
253                         {
254                                 // leaf - check cluster bit
255                                 int clusterindex = ((mleaf_t *)node)->clusterindex;
256                                 if (CHECKPVSBIT(pvs, clusterindex))
257                                 {
258                                         // it is visible, return immediately with the news
259                                         return true;
260                                 }
261                         }
262                 }
263 #endif
264                 // nothing to see here, try another path we didn't take earlier
265                 if (nodestackindex == 0)
266                         break;
267                 node = nodestack[--nodestackindex];
268         }
269         // it is not visible
270         return false;
271 }
272
273 static int Mod_Q1BSP_BoxTouchingLeafPVS(dp_model_t *model, const unsigned char *pvs, const vec3_t mins, const vec3_t maxs)
274 {
275         int nodestackindex = 0;
276         mnode_t *node, *nodestack[1024];
277         if (!model->brush.num_leafs)
278                 return true;
279         node = model->brush.data_nodes;
280         for (;;)
281         {
282 #if 1
283                 if (node->plane)
284                 {
285                         // node - recurse down the BSP tree
286                         int sides = BoxOnPlaneSide(mins, maxs, node->plane);
287                         if (sides < 3)
288                         {
289                                 if (sides == 0)
290                                         return -1; // ERROR: NAN bounding box!
291                                 // box is on one side of plane, take that path
292                                 node = node->children[sides-1];
293                         }
294                         else
295                         {
296                                 // box crosses plane, take one path and remember the other
297                                 if (nodestackindex < 1024)
298                                         nodestack[nodestackindex++] = node->children[0];
299                                 node = node->children[1];
300                         }
301                         continue;
302                 }
303                 else
304                 {
305                         // leaf - check cluster bit
306                         int clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
307                         if (CHECKPVSBIT(pvs, clusterindex))
308                         {
309                                 // it is visible, return immediately with the news
310                                 return true;
311                         }
312                 }
313 #else
314                 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
315                 {
316                         if (node->plane)
317                         {
318                                 if (nodestackindex < 1024)
319                                         nodestack[nodestackindex++] = node->children[0];
320                                 node = node->children[1];
321                                 continue;
322                         }
323                         else
324                         {
325                                 // leaf - check cluster bit
326                                 int clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
327                                 if (CHECKPVSBIT(pvs, clusterindex))
328                                 {
329                                         // it is visible, return immediately with the news
330                                         return true;
331                                 }
332                         }
333                 }
334 #endif
335                 // nothing to see here, try another path we didn't take earlier
336                 if (nodestackindex == 0)
337                         break;
338                 node = nodestack[--nodestackindex];
339         }
340         // it is not visible
341         return false;
342 }
343
344 static int Mod_Q1BSP_BoxTouchingVisibleLeafs(dp_model_t *model, const unsigned char *visibleleafs, const vec3_t mins, const vec3_t maxs)
345 {
346         int nodestackindex = 0;
347         mnode_t *node, *nodestack[1024];
348         if (!model->brush.num_leafs)
349                 return true;
350         node = model->brush.data_nodes;
351         for (;;)
352         {
353 #if 1
354                 if (node->plane)
355                 {
356                         // node - recurse down the BSP tree
357                         int sides = BoxOnPlaneSide(mins, maxs, node->plane);
358                         if (sides < 3)
359                         {
360                                 if (sides == 0)
361                                         return -1; // ERROR: NAN bounding box!
362                                 // box is on one side of plane, take that path
363                                 node = node->children[sides-1];
364                         }
365                         else
366                         {
367                                 // box crosses plane, take one path and remember the other
368                                 if (nodestackindex < 1024)
369                                         nodestack[nodestackindex++] = node->children[0];
370                                 node = node->children[1];
371                         }
372                         continue;
373                 }
374                 else
375                 {
376                         // leaf - check if it is visible
377                         if (visibleleafs[(mleaf_t *)node - model->brush.data_leafs])
378                         {
379                                 // it is visible, return immediately with the news
380                                 return true;
381                         }
382                 }
383 #else
384                 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
385                 {
386                         if (node->plane)
387                         {
388                                 if (nodestackindex < 1024)
389                                         nodestack[nodestackindex++] = node->children[0];
390                                 node = node->children[1];
391                                 continue;
392                         }
393                         else
394                         {
395                                 // leaf - check if it is visible
396                                 if (visibleleafs[(mleaf_t *)node - model->brush.data_leafs])
397                                 {
398                                         // it is visible, return immediately with the news
399                                         return true;
400                                 }
401                         }
402                 }
403 #endif
404                 // nothing to see here, try another path we didn't take earlier
405                 if (nodestackindex == 0)
406                         break;
407                 node = nodestack[--nodestackindex];
408         }
409         // it is not visible
410         return false;
411 }
412
413 typedef struct findnonsolidlocationinfo_s
414 {
415         vec3_t center;
416         vec_t radius;
417         vec3_t nudge;
418         vec_t bestdist;
419         dp_model_t *model;
420 }
421 findnonsolidlocationinfo_t;
422
423 static void Mod_Q1BSP_FindNonSolidLocation_r_Leaf(findnonsolidlocationinfo_t *info, mleaf_t *leaf)
424 {
425         int i, surfacenum, k, *tri, *mark;
426         float dist, f, vert[3][3], edge[3][3], facenormal[3], edgenormal[3][3], point[3];
427         msurface_t *surface;
428         for (surfacenum = 0, mark = leaf->firstleafsurface;surfacenum < leaf->numleafsurfaces;surfacenum++, mark++)
429         {
430                 surface = info->model->data_surfaces + *mark;
431                 if (surface->texture->supercontents & SUPERCONTENTS_SOLID)
432                 {
433                         for (k = 0;k < surface->num_triangles;k++)
434                         {
435                                 tri = (info->model->surfmesh.data_element3i + 3 * surface->num_firsttriangle) + k * 3;
436                                 VectorCopy((info->model->surfmesh.data_vertex3f + tri[0] * 3), vert[0]);
437                                 VectorCopy((info->model->surfmesh.data_vertex3f + tri[1] * 3), vert[1]);
438                                 VectorCopy((info->model->surfmesh.data_vertex3f + tri[2] * 3), vert[2]);
439                                 VectorSubtract(vert[1], vert[0], edge[0]);
440                                 VectorSubtract(vert[2], vert[1], edge[1]);
441                                 CrossProduct(edge[1], edge[0], facenormal);
442                                 if (facenormal[0] || facenormal[1] || facenormal[2])
443                                 {
444                                         VectorNormalize(facenormal);
445                                         f = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
446                                         if (f <= info->bestdist && f >= -info->bestdist)
447                                         {
448                                                 VectorSubtract(vert[0], vert[2], edge[2]);
449                                                 VectorNormalize(edge[0]);
450                                                 VectorNormalize(edge[1]);
451                                                 VectorNormalize(edge[2]);
452                                                 CrossProduct(facenormal, edge[0], edgenormal[0]);
453                                                 CrossProduct(facenormal, edge[1], edgenormal[1]);
454                                                 CrossProduct(facenormal, edge[2], edgenormal[2]);
455                                                 // face distance
456                                                 if (DotProduct(info->center, edgenormal[0]) < DotProduct(vert[0], edgenormal[0])
457                                                  && DotProduct(info->center, edgenormal[1]) < DotProduct(vert[1], edgenormal[1])
458                                                  && DotProduct(info->center, edgenormal[2]) < DotProduct(vert[2], edgenormal[2]))
459                                                 {
460                                                         // we got lucky, the center is within the face
461                                                         dist = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
462                                                         if (dist < 0)
463                                                         {
464                                                                 dist = -dist;
465                                                                 if (info->bestdist > dist)
466                                                                 {
467                                                                         info->bestdist = dist;
468                                                                         VectorScale(facenormal, (info->radius - -dist), info->nudge);
469                                                                 }
470                                                         }
471                                                         else
472                                                         {
473                                                                 if (info->bestdist > dist)
474                                                                 {
475                                                                         info->bestdist = dist;
476                                                                         VectorScale(facenormal, (info->radius - dist), info->nudge);
477                                                                 }
478                                                         }
479                                                 }
480                                                 else
481                                                 {
482                                                         // check which edge or vertex the center is nearest
483                                                         for (i = 0;i < 3;i++)
484                                                         {
485                                                                 f = DotProduct(info->center, edge[i]);
486                                                                 if (f >= DotProduct(vert[0], edge[i])
487                                                                  && f <= DotProduct(vert[1], edge[i]))
488                                                                 {
489                                                                         // on edge
490                                                                         VectorMA(info->center, -f, edge[i], point);
491                                                                         dist = sqrt(DotProduct(point, point));
492                                                                         if (info->bestdist > dist)
493                                                                         {
494                                                                                 info->bestdist = dist;
495                                                                                 VectorScale(point, (info->radius / dist), info->nudge);
496                                                                         }
497                                                                         // skip both vertex checks
498                                                                         // (both are further away than this edge)
499                                                                         i++;
500                                                                 }
501                                                                 else
502                                                                 {
503                                                                         // not on edge, check first vertex of edge
504                                                                         VectorSubtract(info->center, vert[i], point);
505                                                                         dist = sqrt(DotProduct(point, point));
506                                                                         if (info->bestdist > dist)
507                                                                         {
508                                                                                 info->bestdist = dist;
509                                                                                 VectorScale(point, (info->radius / dist), info->nudge);
510                                                                         }
511                                                                 }
512                                                         }
513                                                 }
514                                         }
515                                 }
516                         }
517                 }
518         }
519 }
520
521 static void Mod_Q1BSP_FindNonSolidLocation_r(findnonsolidlocationinfo_t *info, mnode_t *node)
522 {
523         if (node->plane)
524         {
525                 float f = PlaneDiff(info->center, node->plane);
526                 if (f >= -info->bestdist)
527                         Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[0]);
528                 if (f <= info->bestdist)
529                         Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[1]);
530         }
531         else
532         {
533                 if (((mleaf_t *)node)->numleafsurfaces)
534                         Mod_Q1BSP_FindNonSolidLocation_r_Leaf(info, (mleaf_t *)node);
535         }
536 }
537
538 static void Mod_Q1BSP_FindNonSolidLocation(dp_model_t *model, const vec3_t in, vec3_t out, float radius)
539 {
540         int i;
541         findnonsolidlocationinfo_t info;
542         if (model == NULL)
543         {
544                 VectorCopy(in, out);
545                 return;
546         }
547         VectorCopy(in, info.center);
548         info.radius = radius;
549         info.model = model;
550         i = 0;
551         do
552         {
553                 VectorClear(info.nudge);
554                 info.bestdist = radius;
555                 Mod_Q1BSP_FindNonSolidLocation_r(&info, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode);
556                 VectorAdd(info.center, info.nudge, info.center);
557         }
558         while (info.bestdist < radius && ++i < 10);
559         VectorCopy(info.center, out);
560 }
561
562 int Mod_Q1BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents)
563 {
564         switch(nativecontents)
565         {
566                 case CONTENTS_EMPTY:
567                         return 0;
568                 case CONTENTS_SOLID:
569                         return SUPERCONTENTS_SOLID | SUPERCONTENTS_OPAQUE;
570                 case CONTENTS_WATER:
571                         return SUPERCONTENTS_WATER;
572                 case CONTENTS_SLIME:
573                         return SUPERCONTENTS_SLIME;
574                 case CONTENTS_LAVA:
575                         return SUPERCONTENTS_LAVA | SUPERCONTENTS_NODROP;
576                 case CONTENTS_SKY:
577                         return SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP | SUPERCONTENTS_OPAQUE; // to match behaviour of Q3 maps, let sky count as opaque
578         }
579         return 0;
580 }
581
582 int Mod_Q1BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents)
583 {
584         if (supercontents & (SUPERCONTENTS_SOLID | SUPERCONTENTS_BODY))
585                 return CONTENTS_SOLID;
586         if (supercontents & SUPERCONTENTS_SKY)
587                 return CONTENTS_SKY;
588         if (supercontents & SUPERCONTENTS_LAVA)
589                 return CONTENTS_LAVA;
590         if (supercontents & SUPERCONTENTS_SLIME)
591                 return CONTENTS_SLIME;
592         if (supercontents & SUPERCONTENTS_WATER)
593                 return CONTENTS_WATER;
594         return CONTENTS_EMPTY;
595 }
596
597 typedef struct RecursiveHullCheckTraceInfo_s
598 {
599         // the hull we're tracing through
600         const hull_t *hull;
601
602         // the trace structure to fill in
603         trace_t *trace;
604
605         // start, end, and end - start (in model space)
606         double start[3];
607         double end[3];
608         double dist[3];
609 }
610 RecursiveHullCheckTraceInfo_t;
611
612 // 1/32 epsilon to keep floating point happy
613 #define DIST_EPSILON (0.03125)
614
615 #define HULLCHECKSTATE_EMPTY 0
616 #define HULLCHECKSTATE_SOLID 1
617 #define HULLCHECKSTATE_DONE 2
618
619 extern cvar_t collision_prefernudgedfraction;
620 static int Mod_Q1BSP_RecursiveHullCheck(RecursiveHullCheckTraceInfo_t *t, int num, double p1f, double p2f, double p1[3], double p2[3])
621 {
622         // status variables, these don't need to be saved on the stack when
623         // recursing...  but are because this should be thread-safe
624         // (note: tracing against a bbox is not thread-safe, yet)
625         int ret;
626         mplane_t *plane;
627         double t1, t2;
628
629         // variables that need to be stored on the stack when recursing
630         mclipnode_t *node;
631         int side;
632         double midf, mid[3];
633
634         // LordHavoc: a goto!  everyone flee in terror... :)
635 loc0:
636         // check for empty
637         if (num < 0)
638         {
639                 num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
640                 if (!t->trace->startfound)
641                 {
642                         t->trace->startfound = true;
643                         t->trace->startsupercontents |= num;
644                 }
645                 if (num & SUPERCONTENTS_LIQUIDSMASK)
646                         t->trace->inwater = true;
647                 if (num == 0)
648                         t->trace->inopen = true;
649                 if (num & SUPERCONTENTS_SOLID)
650                         t->trace->hittexture = &mod_q1bsp_texture_solid;
651                 else if (num & SUPERCONTENTS_SKY)
652                         t->trace->hittexture = &mod_q1bsp_texture_sky;
653                 else if (num & SUPERCONTENTS_LAVA)
654                         t->trace->hittexture = &mod_q1bsp_texture_lava;
655                 else if (num & SUPERCONTENTS_SLIME)
656                         t->trace->hittexture = &mod_q1bsp_texture_slime;
657                 else
658                         t->trace->hittexture = &mod_q1bsp_texture_water;
659                 t->trace->hitq3surfaceflags = t->trace->hittexture->surfaceflags;
660                 t->trace->hitsupercontents = num;
661                 if (num & t->trace->hitsupercontentsmask)
662                 {
663                         // if the first leaf is solid, set startsolid
664                         if (t->trace->allsolid)
665                                 t->trace->startsolid = true;
666 #if COLLISIONPARANOID >= 3
667                         Con_Print("S");
668 #endif
669                         return HULLCHECKSTATE_SOLID;
670                 }
671                 else
672                 {
673                         t->trace->allsolid = false;
674 #if COLLISIONPARANOID >= 3
675                         Con_Print("E");
676 #endif
677                         return HULLCHECKSTATE_EMPTY;
678                 }
679         }
680
681         // find the point distances
682         node = t->hull->clipnodes + num;
683
684         plane = t->hull->planes + node->planenum;
685         if (plane->type < 3)
686         {
687                 t1 = p1[plane->type] - plane->dist;
688                 t2 = p2[plane->type] - plane->dist;
689         }
690         else
691         {
692                 t1 = DotProduct (plane->normal, p1) - plane->dist;
693                 t2 = DotProduct (plane->normal, p2) - plane->dist;
694         }
695
696         if (t1 < 0)
697         {
698                 if (t2 < 0)
699                 {
700 #if COLLISIONPARANOID >= 3
701                         Con_Print("<");
702 #endif
703                         num = node->children[1];
704                         goto loc0;
705                 }
706                 side = 1;
707         }
708         else
709         {
710                 if (t2 >= 0)
711                 {
712 #if COLLISIONPARANOID >= 3
713                         Con_Print(">");
714 #endif
715                         num = node->children[0];
716                         goto loc0;
717                 }
718                 side = 0;
719         }
720
721         // the line intersects, find intersection point
722         // LordHavoc: this uses the original trace for maximum accuracy
723 #if COLLISIONPARANOID >= 3
724         Con_Print("M");
725 #endif
726         if (plane->type < 3)
727         {
728                 t1 = t->start[plane->type] - plane->dist;
729                 t2 = t->end[plane->type] - plane->dist;
730         }
731         else
732         {
733                 t1 = DotProduct (plane->normal, t->start) - plane->dist;
734                 t2 = DotProduct (plane->normal, t->end) - plane->dist;
735         }
736
737         midf = t1 / (t1 - t2);
738         midf = bound(p1f, midf, p2f);
739         VectorMA(t->start, midf, t->dist, mid);
740
741         // recurse both sides, front side first
742         ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side], p1f, midf, p1, mid);
743         // if this side is not empty, return what it is (solid or done)
744         if (ret != HULLCHECKSTATE_EMPTY)
745                 return ret;
746
747         ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side ^ 1], midf, p2f, mid, p2);
748         // if other side is not solid, return what it is (empty or done)
749         if (ret != HULLCHECKSTATE_SOLID)
750                 return ret;
751
752         // front is air and back is solid, this is the impact point...
753         if (side)
754         {
755                 t->trace->plane.dist = -plane->dist;
756                 VectorNegate (plane->normal, t->trace->plane.normal);
757         }
758         else
759         {
760                 t->trace->plane.dist = plane->dist;
761                 VectorCopy (plane->normal, t->trace->plane.normal);
762         }
763
764         // calculate the true fraction
765         t1 = DotProduct(t->trace->plane.normal, t->start) - t->trace->plane.dist;
766         t2 = DotProduct(t->trace->plane.normal, t->end) - t->trace->plane.dist;
767         midf = t1 / (t1 - t2);
768         t->trace->realfraction = bound(0, midf, 1);
769
770         // calculate the return fraction which is nudged off the surface a bit
771         midf = (t1 - DIST_EPSILON) / (t1 - t2);
772         t->trace->fraction = bound(0, midf, 1);
773
774         if (collision_prefernudgedfraction.integer)
775                 t->trace->realfraction = t->trace->fraction;
776
777 #if COLLISIONPARANOID >= 3
778         Con_Print("D");
779 #endif
780         return HULLCHECKSTATE_DONE;
781 }
782
783 //#if COLLISIONPARANOID < 2
784 static int Mod_Q1BSP_RecursiveHullCheckPoint(RecursiveHullCheckTraceInfo_t *t, int num)
785 {
786         mplane_t *plane;
787         mclipnode_t *nodes = t->hull->clipnodes;
788         mplane_t *planes = t->hull->planes;
789         vec3_t point;
790         VectorCopy(t->start, point);
791         while (num >= 0)
792         {
793                 plane = planes + nodes[num].planenum;
794                 num = nodes[num].children[(plane->type < 3 ? point[plane->type] : DotProduct(plane->normal, point)) < plane->dist];
795         }
796         num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
797         t->trace->startsupercontents |= num;
798         if (num & SUPERCONTENTS_LIQUIDSMASK)
799                 t->trace->inwater = true;
800         if (num == 0)
801                 t->trace->inopen = true;
802         if (num & t->trace->hitsupercontentsmask)
803         {
804                 t->trace->allsolid = t->trace->startsolid = true;
805                 return HULLCHECKSTATE_SOLID;
806         }
807         else
808         {
809                 t->trace->allsolid = t->trace->startsolid = false;
810                 return HULLCHECKSTATE_EMPTY;
811         }
812 }
813 //#endif
814
815 static void Mod_Q1BSP_TraceBox(struct model_s *model, int frame, trace_t *trace, const vec3_t start, const vec3_t boxmins, const vec3_t boxmaxs, const vec3_t end, int hitsupercontentsmask)
816 {
817         // this function currently only supports same size start and end
818         double boxsize[3];
819         RecursiveHullCheckTraceInfo_t rhc;
820
821         memset(&rhc, 0, sizeof(rhc));
822         memset(trace, 0, sizeof(trace_t));
823         rhc.trace = trace;
824         rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
825         rhc.trace->fraction = 1;
826         rhc.trace->realfraction = 1;
827         rhc.trace->allsolid = true;
828         VectorSubtract(boxmaxs, boxmins, boxsize);
829         if (boxsize[0] < 3)
830                 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
831         else if (model->brush.ishlbsp)
832         {
833                 // LordHavoc: this has to have a minor tolerance (the .1) because of
834                 // minor float precision errors from the box being transformed around
835                 if (boxsize[0] < 32.1)
836                 {
837                         if (boxsize[2] < 54) // pick the nearest of 36 or 72
838                                 rhc.hull = &model->brushq1.hulls[3]; // 32x32x36
839                         else
840                                 rhc.hull = &model->brushq1.hulls[1]; // 32x32x72
841                 }
842                 else
843                         rhc.hull = &model->brushq1.hulls[2]; // 64x64x64
844         }
845         else
846         {
847                 // LordHavoc: this has to have a minor tolerance (the .1) because of
848                 // minor float precision errors from the box being transformed around
849                 if (boxsize[0] < 32.1)
850                         rhc.hull = &model->brushq1.hulls[1]; // 32x32x56
851                 else
852                         rhc.hull = &model->brushq1.hulls[2]; // 64x64x88
853         }
854         VectorMAMAM(1, start, 1, boxmins, -1, rhc.hull->clip_mins, rhc.start);
855         VectorMAMAM(1, end, 1, boxmins, -1, rhc.hull->clip_mins, rhc.end);
856         VectorSubtract(rhc.end, rhc.start, rhc.dist);
857 #if COLLISIONPARANOID >= 2
858         Con_Printf("t(%f %f %f,%f %f %f,%i %f %f %f)", rhc.start[0], rhc.start[1], rhc.start[2], rhc.end[0], rhc.end[1], rhc.end[2], rhc.hull - model->brushq1.hulls, rhc.hull->clip_mins[0], rhc.hull->clip_mins[1], rhc.hull->clip_mins[2]);
859         Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
860         {
861
862                 double test[3];
863                 trace_t testtrace;
864                 VectorLerp(rhc.start, rhc.trace->fraction, rhc.end, test);
865                 memset(&testtrace, 0, sizeof(trace_t));
866                 rhc.trace = &testtrace;
867                 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
868                 rhc.trace->fraction = 1;
869                 rhc.trace->realfraction = 1;
870                 rhc.trace->allsolid = true;
871                 VectorCopy(test, rhc.start);
872                 VectorCopy(test, rhc.end);
873                 VectorClear(rhc.dist);
874                 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
875                 //Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, test, test);
876                 if (!trace->startsolid && testtrace.startsolid)
877                         Con_Printf(" - ended in solid!\n");
878         }
879         Con_Print("\n");
880 #else
881         if (VectorLength2(rhc.dist))
882                 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
883         else
884                 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
885 #endif
886 }
887
888 static int Mod_Q1BSP_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
889 {
890         int num = model->brushq1.hulls[0].firstclipnode;
891         mplane_t *plane;
892         mclipnode_t *nodes = model->brushq1.hulls[0].clipnodes;
893         mplane_t *planes = model->brushq1.hulls[0].planes;
894         while (num >= 0)
895         {
896                 plane = planes + nodes[num].planenum;
897                 num = nodes[num].children[(plane->type < 3 ? point[plane->type] : DotProduct(plane->normal, point)) < plane->dist];
898         }
899         return Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
900 }
901
902 void Collision_ClipTrace_Box(trace_t *trace, const vec3_t cmins, const vec3_t cmaxs, const vec3_t start, const vec3_t mins, const vec3_t maxs, const vec3_t end, int hitsupercontentsmask, int boxsupercontents, int boxq3surfaceflags, texture_t *boxtexture)
903 {
904 #if 1
905         colbrushf_t cbox;
906         colplanef_t cbox_planes[6];
907         cbox.supercontents = boxsupercontents;
908         cbox.numplanes = 6;
909         cbox.numpoints = 0;
910         cbox.numtriangles = 0;
911         cbox.planes = cbox_planes;
912         cbox.points = NULL;
913         cbox.elements = NULL;
914         cbox.markframe = 0;
915         cbox.mins[0] = 0;
916         cbox.mins[1] = 0;
917         cbox.mins[2] = 0;
918         cbox.maxs[0] = 0;
919         cbox.maxs[1] = 0;
920         cbox.maxs[2] = 0;
921         cbox_planes[0].normal[0] =  1;cbox_planes[0].normal[1] =  0;cbox_planes[0].normal[2] =  0;cbox_planes[0].dist = cmaxs[0] - mins[0];
922         cbox_planes[1].normal[0] = -1;cbox_planes[1].normal[1] =  0;cbox_planes[1].normal[2] =  0;cbox_planes[1].dist = maxs[0] - cmins[0];
923         cbox_planes[2].normal[0] =  0;cbox_planes[2].normal[1] =  1;cbox_planes[2].normal[2] =  0;cbox_planes[2].dist = cmaxs[1] - mins[1];
924         cbox_planes[3].normal[0] =  0;cbox_planes[3].normal[1] = -1;cbox_planes[3].normal[2] =  0;cbox_planes[3].dist = maxs[1] - cmins[1];
925         cbox_planes[4].normal[0] =  0;cbox_planes[4].normal[1] =  0;cbox_planes[4].normal[2] =  1;cbox_planes[4].dist = cmaxs[2] - mins[2];
926         cbox_planes[5].normal[0] =  0;cbox_planes[5].normal[1] =  0;cbox_planes[5].normal[2] = -1;cbox_planes[5].dist = maxs[2] - cmins[2];
927         cbox_planes[0].q3surfaceflags = boxq3surfaceflags;cbox_planes[0].texture = boxtexture;
928         cbox_planes[1].q3surfaceflags = boxq3surfaceflags;cbox_planes[1].texture = boxtexture;
929         cbox_planes[2].q3surfaceflags = boxq3surfaceflags;cbox_planes[2].texture = boxtexture;
930         cbox_planes[3].q3surfaceflags = boxq3surfaceflags;cbox_planes[3].texture = boxtexture;
931         cbox_planes[4].q3surfaceflags = boxq3surfaceflags;cbox_planes[4].texture = boxtexture;
932         cbox_planes[5].q3surfaceflags = boxq3surfaceflags;cbox_planes[5].texture = boxtexture;
933         memset(trace, 0, sizeof(trace_t));
934         trace->hitsupercontentsmask = hitsupercontentsmask;
935         trace->fraction = 1;
936         trace->realfraction = 1;
937         Collision_TraceLineBrushFloat(trace, start, end, &cbox, &cbox);
938 #else
939         RecursiveHullCheckTraceInfo_t rhc;
940         static hull_t box_hull;
941         static mclipnode_t box_clipnodes[6];
942         static mplane_t box_planes[6];
943         // fill in a default trace
944         memset(&rhc, 0, sizeof(rhc));
945         memset(trace, 0, sizeof(trace_t));
946         //To keep everything totally uniform, bounding boxes are turned into small
947         //BSP trees instead of being compared directly.
948         // create a temp hull from bounding box sizes
949         box_planes[0].dist = cmaxs[0] - mins[0];
950         box_planes[1].dist = cmins[0] - maxs[0];
951         box_planes[2].dist = cmaxs[1] - mins[1];
952         box_planes[3].dist = cmins[1] - maxs[1];
953         box_planes[4].dist = cmaxs[2] - mins[2];
954         box_planes[5].dist = cmins[2] - maxs[2];
955 #if COLLISIONPARANOID >= 3
956         Con_Printf("box_planes %f:%f %f:%f %f:%f\ncbox %f %f %f:%f %f %f\nbox %f %f %f:%f %f %f\n", box_planes[0].dist, box_planes[1].dist, box_planes[2].dist, box_planes[3].dist, box_planes[4].dist, box_planes[5].dist, cmins[0], cmins[1], cmins[2], cmaxs[0], cmaxs[1], cmaxs[2], mins[0], mins[1], mins[2], maxs[0], maxs[1], maxs[2]);
957 #endif
958
959         if (box_hull.clipnodes == NULL)
960         {
961                 int i, side;
962
963                 //Set up the planes and clipnodes so that the six floats of a bounding box
964                 //can just be stored out and get a proper hull_t structure.
965
966                 box_hull.clipnodes = box_clipnodes;
967                 box_hull.planes = box_planes;
968                 box_hull.firstclipnode = 0;
969                 box_hull.lastclipnode = 5;
970
971                 for (i = 0;i < 6;i++)
972                 {
973                         box_clipnodes[i].planenum = i;
974
975                         side = i&1;
976
977                         box_clipnodes[i].children[side] = CONTENTS_EMPTY;
978                         if (i != 5)
979                                 box_clipnodes[i].children[side^1] = i + 1;
980                         else
981                                 box_clipnodes[i].children[side^1] = CONTENTS_SOLID;
982
983                         box_planes[i].type = i>>1;
984                         box_planes[i].normal[i>>1] = 1;
985                 }
986         }
987
988         // trace a line through the generated clipping hull
989         //rhc.boxsupercontents = boxsupercontents;
990         rhc.hull = &box_hull;
991         rhc.trace = trace;
992         rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
993         rhc.trace->fraction = 1;
994         rhc.trace->realfraction = 1;
995         rhc.trace->allsolid = true;
996         VectorCopy(start, rhc.start);
997         VectorCopy(end, rhc.end);
998         VectorSubtract(rhc.end, rhc.start, rhc.dist);
999         Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
1000         //VectorMA(rhc.start, rhc.trace->fraction, rhc.dist, rhc.trace->endpos);
1001         if (rhc.trace->startsupercontents)
1002                 rhc.trace->startsupercontents = boxsupercontents;
1003 #endif
1004 }
1005
1006 static int Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(mnode_t *node, double p1[3], double p2[3])
1007 {
1008         double t1, t2;
1009         double midf, mid[3];
1010         int ret, side;
1011
1012         // check for empty
1013         while (node->plane)
1014         {
1015                 // find the point distances
1016                 mplane_t *plane = node->plane;
1017                 if (plane->type < 3)
1018                 {
1019                         t1 = p1[plane->type] - plane->dist;
1020                         t2 = p2[plane->type] - plane->dist;
1021                 }
1022                 else
1023                 {
1024                         t1 = DotProduct (plane->normal, p1) - plane->dist;
1025                         t2 = DotProduct (plane->normal, p2) - plane->dist;
1026                 }
1027
1028                 if (t1 < 0)
1029                 {
1030                         if (t2 < 0)
1031                         {
1032                                 node = node->children[1];
1033                                 continue;
1034                         }
1035                         side = 1;
1036                 }
1037                 else
1038                 {
1039                         if (t2 >= 0)
1040                         {
1041                                 node = node->children[0];
1042                                 continue;
1043                         }
1044                         side = 0;
1045                 }
1046
1047                 midf = t1 / (t1 - t2);
1048                 VectorLerp(p1, midf, p2, mid);
1049
1050                 // recurse both sides, front side first
1051                 // return 2 if empty is followed by solid (hit something)
1052                 // do not return 2 if both are solid or both empty,
1053                 // or if start is solid and end is empty
1054                 // as these degenerate cases usually indicate the eye is in solid and
1055                 // should see the target point anyway
1056                 ret = Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side    ], p1, mid);
1057                 if (ret != 0)
1058                         return ret;
1059                 ret = Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ^ 1], mid, p2);
1060                 if (ret != 1)
1061                         return ret;
1062                 return 2;
1063         }
1064         return ((mleaf_t *)node)->clusterindex < 0;
1065 }
1066
1067 static qboolean Mod_Q1BSP_TraceLineOfSight(struct model_s *model, const vec3_t start, const vec3_t end)
1068 {
1069         // this function currently only supports same size start and end
1070         double tracestart[3], traceend[3];
1071         VectorCopy(start, tracestart);
1072         VectorCopy(end, traceend);
1073         return Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(model->brush.data_nodes, tracestart, traceend) != 2;
1074 }
1075
1076 static int Mod_Q1BSP_LightPoint_RecursiveBSPNode(dp_model_t *model, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal, const mnode_t *node, float x, float y, float startz, float endz)
1077 {
1078         int side;
1079         float front, back;
1080         float mid, distz = endz - startz;
1081
1082 loc0:
1083         if (!node->plane)
1084                 return false;           // didn't hit anything
1085
1086         switch (node->plane->type)
1087         {
1088         case PLANE_X:
1089                 node = node->children[x < node->plane->dist];
1090                 goto loc0;
1091         case PLANE_Y:
1092                 node = node->children[y < node->plane->dist];
1093                 goto loc0;
1094         case PLANE_Z:
1095                 side = startz < node->plane->dist;
1096                 if ((endz < node->plane->dist) == side)
1097                 {
1098                         node = node->children[side];
1099                         goto loc0;
1100                 }
1101                 // found an intersection
1102                 mid = node->plane->dist;
1103                 break;
1104         default:
1105                 back = front = x * node->plane->normal[0] + y * node->plane->normal[1];
1106                 front += startz * node->plane->normal[2];
1107                 back += endz * node->plane->normal[2];
1108                 side = front < node->plane->dist;
1109                 if ((back < node->plane->dist) == side)
1110                 {
1111                         node = node->children[side];
1112                         goto loc0;
1113                 }
1114                 // found an intersection
1115                 mid = startz + distz * (front - node->plane->dist) / (front - back);
1116                 break;
1117         }
1118
1119         // go down front side
1120         if (node->children[side]->plane && Mod_Q1BSP_LightPoint_RecursiveBSPNode(model, ambientcolor, diffusecolor, diffusenormal, node->children[side], x, y, startz, mid))
1121                 return true;    // hit something
1122         else
1123         {
1124                 // check for impact on this node
1125                 if (node->numsurfaces)
1126                 {
1127                         int i, dsi, dti, lmwidth, lmheight;
1128                         float ds, dt;
1129                         msurface_t *surface;
1130                         unsigned char *lightmap;
1131                         int maps, line3, size3;
1132                         float dsfrac;
1133                         float dtfrac;
1134                         float scale, w, w00, w01, w10, w11;
1135
1136                         surface = model->data_surfaces + node->firstsurface;
1137                         for (i = 0;i < node->numsurfaces;i++, surface++)
1138                         {
1139                                 if (!(surface->texture->basematerialflags & MATERIALFLAG_WALL) || !surface->lightmapinfo->samples)
1140                                         continue;       // no lightmaps
1141
1142                                 // location we want to sample in the lightmap
1143                                 ds = ((x * surface->lightmapinfo->texinfo->vecs[0][0] + y * surface->lightmapinfo->texinfo->vecs[0][1] + mid * surface->lightmapinfo->texinfo->vecs[0][2] + surface->lightmapinfo->texinfo->vecs[0][3]) - surface->lightmapinfo->texturemins[0]) * 0.0625f;
1144                                 dt = ((x * surface->lightmapinfo->texinfo->vecs[1][0] + y * surface->lightmapinfo->texinfo->vecs[1][1] + mid * surface->lightmapinfo->texinfo->vecs[1][2] + surface->lightmapinfo->texinfo->vecs[1][3]) - surface->lightmapinfo->texturemins[1]) * 0.0625f;
1145
1146                                 // check the bounds
1147                                 dsi = (int)ds;
1148                                 dti = (int)dt;
1149                                 lmwidth = ((surface->lightmapinfo->extents[0]>>4)+1);
1150                                 lmheight = ((surface->lightmapinfo->extents[1]>>4)+1);
1151
1152                                 // is it in bounds?
1153                                 if (dsi >= 0 && dsi < lmwidth-1 && dti >= 0 && dti < lmheight-1)
1154                                 {
1155                                         // calculate bilinear interpolation factors
1156                                         // and also multiply by fixedpoint conversion factors
1157                                         dsfrac = ds - dsi;
1158                                         dtfrac = dt - dti;
1159                                         w00 = (1 - dsfrac) * (1 - dtfrac) * (1.0f / 32768.0f);
1160                                         w01 = (    dsfrac) * (1 - dtfrac) * (1.0f / 32768.0f);
1161                                         w10 = (1 - dsfrac) * (    dtfrac) * (1.0f / 32768.0f);
1162                                         w11 = (    dsfrac) * (    dtfrac) * (1.0f / 32768.0f);
1163
1164                                         // values for pointer math
1165                                         line3 = lmwidth * 3; // LordHavoc: *3 for colored lighting
1166                                         size3 = lmwidth * lmheight * 3; // LordHavoc: *3 for colored lighting
1167
1168                                         // look up the pixel
1169                                         lightmap = surface->lightmapinfo->samples + dti * line3 + dsi*3; // LordHavoc: *3 for colored lighting
1170
1171                                         // bilinear filter each lightmap style, and sum them
1172                                         for (maps = 0;maps < MAXLIGHTMAPS && surface->lightmapinfo->styles[maps] != 255;maps++)
1173                                         {
1174                                                 scale = r_refdef.scene.lightstylevalue[surface->lightmapinfo->styles[maps]];
1175                                                 w = w00 * scale;VectorMA(ambientcolor, w, lightmap            , ambientcolor);
1176                                                 w = w01 * scale;VectorMA(ambientcolor, w, lightmap + 3        , ambientcolor);
1177                                                 w = w10 * scale;VectorMA(ambientcolor, w, lightmap + line3    , ambientcolor);
1178                                                 w = w11 * scale;VectorMA(ambientcolor, w, lightmap + line3 + 3, ambientcolor);
1179                                                 lightmap += size3;
1180                                         }
1181
1182                                         return true; // success
1183                                 }
1184                         }
1185                 }
1186
1187                 // go down back side
1188                 node = node->children[side ^ 1];
1189                 startz = mid;
1190                 distz = endz - startz;
1191                 goto loc0;
1192         }
1193 }
1194
1195 void Mod_Q1BSP_LightPoint(dp_model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
1196 {
1197         // pretend lighting is coming down from above (due to lack of a lightgrid to know primary lighting direction)
1198         VectorSet(diffusenormal, 0, 0, 1);
1199
1200         if (!model->brushq1.lightdata)
1201         {
1202                 VectorSet(ambientcolor, 1, 1, 1);
1203                 VectorSet(diffusecolor, 0, 0, 0);
1204                 return;
1205         }
1206
1207         Mod_Q1BSP_LightPoint_RecursiveBSPNode(model, ambientcolor, diffusecolor, diffusenormal, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode, p[0], p[1], p[2] + 0.125, p[2] - 65536);
1208 }
1209
1210 static void Mod_Q1BSP_DecompressVis(const unsigned char *in, const unsigned char *inend, unsigned char *out, unsigned char *outend)
1211 {
1212         int c;
1213         unsigned char *outstart = out;
1214         while (out < outend)
1215         {
1216                 if (in == inend)
1217                 {
1218                         Con_Printf("Mod_Q1BSP_DecompressVis: input underrun on model \"%s\" (decompressed %i of %i output bytes)\n", loadmodel->name, (int)(out - outstart), (int)(outend - outstart));
1219                         return;
1220                 }
1221                 c = *in++;
1222                 if (c)
1223                         *out++ = c;
1224                 else
1225                 {
1226                         if (in == inend)
1227                         {
1228                                 Con_Printf("Mod_Q1BSP_DecompressVis: input underrun (during zero-run) on model \"%s\" (decompressed %i of %i output bytes)\n", loadmodel->name, (int)(out - outstart), (int)(outend - outstart));
1229                                 return;
1230                         }
1231                         for (c = *in++;c > 0;c--)
1232                         {
1233                                 if (out == outend)
1234                                 {
1235                                         Con_Printf("Mod_Q1BSP_DecompressVis: output overrun on model \"%s\" (decompressed %i of %i output bytes)\n", loadmodel->name, (int)(out - outstart), (int)(outend - outstart));
1236                                         return;
1237                                 }
1238                                 *out++ = 0;
1239                         }
1240                 }
1241         }
1242 }
1243
1244 /*
1245 =============
1246 R_Q1BSP_LoadSplitSky
1247
1248 A sky texture is 256*128, with the right side being a masked overlay
1249 ==============
1250 */
1251 void R_Q1BSP_LoadSplitSky (unsigned char *src, int width, int height, int bytesperpixel)
1252 {
1253         int i, j;
1254         unsigned solidpixels[128*128], alphapixels[128*128];
1255
1256         // allocate a texture pool if we need it
1257         if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
1258                 loadmodel->texturepool = R_AllocTexturePool();
1259
1260         if (bytesperpixel == 4)
1261         {
1262                 for (i = 0;i < 128;i++)
1263                 {
1264                         for (j = 0;j < 128;j++)
1265                         {
1266                                 solidpixels[(i*128) + j] = ((unsigned *)src)[i*256+j+128];
1267                                 alphapixels[(i*128) + j] = ((unsigned *)src)[i*256+j];
1268                         }
1269                 }
1270         }
1271         else
1272         {
1273                 // make an average value for the back to avoid
1274                 // a fringe on the top level
1275                 int p, r, g, b;
1276                 union
1277                 {
1278                         unsigned int i;
1279                         unsigned char b[4];
1280                 }
1281                 bgra;
1282                 r = g = b = 0;
1283                 for (i = 0;i < 128;i++)
1284                 {
1285                         for (j = 0;j < 128;j++)
1286                         {
1287                                 p = src[i*256 + j + 128];
1288                                 r += palette_rgb[p][0];
1289                                 g += palette_rgb[p][1];
1290                                 b += palette_rgb[p][2];
1291                         }
1292                 }
1293                 bgra.b[2] = r/(128*128);
1294                 bgra.b[1] = g/(128*128);
1295                 bgra.b[0] = b/(128*128);
1296                 bgra.b[3] = 0;
1297                 for (i = 0;i < 128;i++)
1298                 {
1299                         for (j = 0;j < 128;j++)
1300                         {
1301                                 solidpixels[(i*128) + j] = palette_bgra_complete[src[i*256 + j + 128]];
1302                                 p = src[i*256 + j];
1303                                 alphapixels[(i*128) + j] = p ? palette_bgra_complete[p] : bgra.i;
1304                         }
1305                 }
1306         }
1307
1308         loadmodel->brush.solidskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_solidtexture", 128, 128, (unsigned char *) solidpixels, TEXTYPE_BGRA, TEXF_PRECACHE, NULL);
1309         loadmodel->brush.alphaskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_alphatexture", 128, 128, (unsigned char *) alphapixels, TEXTYPE_BGRA, TEXF_ALPHA | TEXF_PRECACHE, NULL);
1310 }
1311
1312 static void Mod_Q1BSP_LoadTextures(lump_t *l)
1313 {
1314         int i, j, k, num, max, altmax, mtwidth, mtheight, *dofs, incomplete;
1315         skinframe_t *skinframe;
1316         miptex_t *dmiptex;
1317         texture_t *tx, *tx2, *anims[10], *altanims[10];
1318         dmiptexlump_t *m;
1319         unsigned char *data, *mtdata;
1320         const char *s;
1321         char mapname[MAX_QPATH], name[MAX_QPATH];
1322         unsigned char zero[4];
1323
1324         memset(zero, 0, sizeof(zero));
1325
1326         loadmodel->data_textures = NULL;
1327
1328         // add two slots for notexture walls and notexture liquids
1329         if (l->filelen)
1330         {
1331                 m = (dmiptexlump_t *)(mod_base + l->fileofs);
1332                 m->nummiptex = LittleLong (m->nummiptex);
1333                 loadmodel->num_textures = m->nummiptex + 2;
1334                 loadmodel->num_texturesperskin = loadmodel->num_textures;
1335         }
1336         else
1337         {
1338                 m = NULL;
1339                 loadmodel->num_textures = 2;
1340                 loadmodel->num_texturesperskin = loadmodel->num_textures;
1341         }
1342
1343         loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_textures * sizeof(texture_t));
1344
1345         // fill out all slots with notexture
1346         if (cls.state != ca_dedicated)
1347                 skinframe = R_SkinFrame_LoadMissing();
1348         else
1349                 skinframe = NULL;
1350         for (i = 0, tx = loadmodel->data_textures;i < loadmodel->num_textures;i++, tx++)
1351         {
1352                 strlcpy(tx->name, "NO TEXTURE FOUND", sizeof(tx->name));
1353                 tx->width = 16;
1354                 tx->height = 16;
1355                 if (cls.state != ca_dedicated)
1356                 {
1357                         tx->numskinframes = 1;
1358                         tx->skinframerate = 1;
1359                         tx->skinframes[0] = skinframe;
1360                         tx->currentskinframe = tx->skinframes[0];
1361                 }
1362                 tx->basematerialflags = MATERIALFLAG_WALL;
1363                 if (i == loadmodel->num_textures - 1)
1364                 {
1365                         tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1366                         tx->supercontents = mod_q1bsp_texture_water.supercontents;
1367                         tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1368                 }
1369                 else
1370                 {
1371                         tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1372                         tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1373                 }
1374                 tx->currentframe = tx;
1375
1376                 // clear water settings
1377                 tx->reflectmin = 0;
1378                 tx->reflectmax = 1;
1379                 tx->refractfactor = 1;
1380                 Vector4Set(tx->refractcolor4f, 1, 1, 1, 1);
1381                 tx->reflectfactor = 1;
1382                 Vector4Set(tx->reflectcolor4f, 1, 1, 1, 1);
1383                 tx->r_water_wateralpha = 1;
1384         }
1385
1386         if (!m)
1387         {
1388                 Con_Printf("%s: no miptex lump to load textures from\n", loadmodel->name);
1389                 return;
1390         }
1391
1392         s = loadmodel->name;
1393         if (!strncasecmp(s, "maps/", 5))
1394                 s += 5;
1395         FS_StripExtension(s, mapname, sizeof(mapname));
1396
1397         // just to work around bounds checking when debugging with it (array index out of bounds error thing)
1398         dofs = m->dataofs;
1399         // LordHavoc: mostly rewritten map texture loader
1400         for (i = 0;i < m->nummiptex;i++)
1401         {
1402                 dofs[i] = LittleLong(dofs[i]);
1403                 if (r_nosurftextures.integer)
1404                         continue;
1405                 if (dofs[i] == -1)
1406                 {
1407                         Con_DPrintf("%s: miptex #%i missing\n", loadmodel->name, i);
1408                         continue;
1409                 }
1410                 dmiptex = (miptex_t *)((unsigned char *)m + dofs[i]);
1411
1412                 // copy name, but only up to 16 characters
1413                 // (the output buffer can hold more than this, but the input buffer is
1414                 //  only 16)
1415                 for (j = 0;j < 16 && dmiptex->name[j];j++)
1416                         name[j] = dmiptex->name[j];
1417                 name[j] = 0;
1418
1419                 if (!name[0])
1420                 {
1421                         dpsnprintf(name, sizeof(name), "unnamed%i", i);
1422                         Con_DPrintf("%s: warning: renaming unnamed texture to %s\n", loadmodel->name, name);
1423                 }
1424
1425                 mtwidth = LittleLong(dmiptex->width);
1426                 mtheight = LittleLong(dmiptex->height);
1427                 mtdata = NULL;
1428                 j = LittleLong(dmiptex->offsets[0]);
1429                 if (j)
1430                 {
1431                         // texture included
1432                         if (j < 40 || j + mtwidth * mtheight > l->filelen)
1433                         {
1434                                 Con_Printf("%s: Texture \"%s\" is corrupt or incomplete\n", loadmodel->name, dmiptex->name);
1435                                 continue;
1436                         }
1437                         mtdata = (unsigned char *)dmiptex + j;
1438                 }
1439
1440                 if ((mtwidth & 15) || (mtheight & 15))
1441                         Con_DPrintf("%s: warning: texture \"%s\" is not 16 aligned\n", loadmodel->name, dmiptex->name);
1442
1443                 // LordHavoc: force all names to lowercase
1444                 for (j = 0;name[j];j++)
1445                         if (name[j] >= 'A' && name[j] <= 'Z')
1446                                 name[j] += 'a' - 'A';
1447
1448                 if (dmiptex->name[0] && Mod_LoadTextureFromQ3Shader(loadmodel->data_textures + i, name, false, false, 0))
1449                         continue;
1450
1451                 tx = loadmodel->data_textures + i;
1452                 strlcpy(tx->name, name, sizeof(tx->name));
1453                 tx->width = mtwidth;
1454                 tx->height = mtheight;
1455
1456                 if (tx->name[0] == '*')
1457                 {
1458                         if (!strncmp(tx->name, "*lava", 5))
1459                         {
1460                                 tx->supercontents = mod_q1bsp_texture_lava.supercontents;
1461                                 tx->surfaceflags = mod_q1bsp_texture_lava.surfaceflags;
1462                         }
1463                         else if (!strncmp(tx->name, "*slime", 6))
1464                         {
1465                                 tx->supercontents = mod_q1bsp_texture_slime.supercontents;
1466                                 tx->surfaceflags = mod_q1bsp_texture_slime.surfaceflags;
1467                         }
1468                         else
1469                         {
1470                                 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1471                                 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1472                         }
1473                 }
1474                 else if (!strncmp(tx->name, "sky", 3))
1475                 {
1476                         tx->supercontents = mod_q1bsp_texture_sky.supercontents;
1477                         tx->surfaceflags = mod_q1bsp_texture_sky.surfaceflags;
1478                 }
1479                 else
1480                 {
1481                         tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1482                         tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1483                 }
1484
1485                 if (cls.state != ca_dedicated)
1486                 {
1487                         // LordHavoc: HL sky textures are entirely different than quake
1488                         if (!loadmodel->brush.ishlbsp && !strncmp(tx->name, "sky", 3) && mtwidth == 256 && mtheight == 128)
1489                         {
1490                                 data = loadimagepixelsbgra(tx->name, false, false);
1491                                 if (data && image_width == 256 && image_height == 128)
1492                                 {
1493                                         R_Q1BSP_LoadSplitSky(data, image_width, image_height, 4);
1494                                         Mem_Free(data);
1495                                 }
1496                                 else if (mtdata != NULL)
1497                                         R_Q1BSP_LoadSplitSky(mtdata, mtwidth, mtheight, 1);
1498                         }
1499                         else
1500                         {
1501                                 skinframe = R_SkinFrame_LoadExternal(gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s/%s", mapname, tx->name), TEXF_ALPHA | TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0) | TEXF_COMPRESS, false);
1502                                 if (!skinframe)
1503                                         skinframe = R_SkinFrame_LoadExternal(gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s", tx->name), TEXF_ALPHA | TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0) | TEXF_COMPRESS, false);
1504                                 if (!skinframe)
1505                                 {
1506                                         // did not find external texture, load it from the bsp or wad3
1507                                         if (loadmodel->brush.ishlbsp)
1508                                         {
1509                                                 // internal texture overrides wad
1510                                                 unsigned char *pixels, *freepixels;
1511                                                 pixels = freepixels = NULL;
1512                                                 if (mtdata)
1513                                                         pixels = W_ConvertWAD3TextureBGRA(dmiptex);
1514                                                 if (pixels == NULL)
1515                                                         pixels = freepixels = W_GetTextureBGRA(tx->name);
1516                                                 if (pixels != NULL)
1517                                                 {
1518                                                         tx->width = image_width;
1519                                                         tx->height = image_height;
1520                                                         skinframe = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_ALPHA | TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0), pixels, image_width, image_height);
1521                                                 }
1522                                                 if (freepixels)
1523                                                         Mem_Free(freepixels);
1524                                         }
1525                                         else if (mtdata) // texture included
1526                                                 skinframe = R_SkinFrame_LoadInternalQuake(tx->name, TEXF_ALPHA | TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0), false, r_fullbrights.integer, mtdata, tx->width, tx->height);
1527                                 }
1528                                 // if skinframe is still NULL the "missing" texture will be used
1529                                 if (skinframe)
1530                                         tx->skinframes[0] = skinframe;
1531                         }
1532
1533                         tx->basematerialflags = MATERIALFLAG_WALL;
1534                         if (tx->name[0] == '*')
1535                         {
1536                                 // LordHavoc: some turbulent textures should not be affected by wateralpha
1537                                 if (!strncmp(tx->name, "*glassmirror", 12)) // Tenebrae
1538                                 {
1539                                         // replace the texture with transparent black
1540                                         Vector4Set(zero, 128, 128, 128, 128);
1541                                         tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_MIPMAP | TEXF_PRECACHE | TEXF_ALPHA, zero, 1, 1);
1542                                         tx->basematerialflags |= MATERIALFLAG_NOSHADOW | MATERIALFLAG_ADD | MATERIALFLAG_BLENDED | MATERIALFLAG_REFLECTION;
1543                                 }
1544                                 else if (!strncmp(tx->name,"*lava",5)
1545                                  || !strncmp(tx->name,"*teleport",9)
1546                                  || !strncmp(tx->name,"*rift",5)) // Scourge of Armagon texture
1547                                         tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1548                                 else
1549                                         tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW | MATERIALFLAG_WATERALPHA | MATERIALFLAG_WATERSHADER;
1550                                 if (tx->skinframes[0] && tx->skinframes[0]->fog)
1551                                         tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1552                         }
1553                         else if (!strncmp(tx->name, "mirror", 6)) // Tenebrae
1554                         {
1555                                 // replace the texture with black
1556                                 tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_PRECACHE, zero, 1, 1);
1557                                 tx->basematerialflags |= MATERIALFLAG_REFLECTION;
1558                         }
1559                         else if (!strncmp(tx->name, "sky", 3))
1560                                 tx->basematerialflags = MATERIALFLAG_SKY | MATERIALFLAG_NOSHADOW;
1561                         else if (!strcmp(tx->name, "caulk"))
1562                                 tx->basematerialflags = MATERIALFLAG_NODRAW | MATERIALFLAG_NOSHADOW;
1563                         else if (tx->skinframes[0] && tx->skinframes[0]->fog)
1564                                 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1565
1566                         // start out with no animation
1567                         tx->currentframe = tx;
1568                         tx->currentskinframe = tx->skinframes[0];
1569                 }
1570         }
1571
1572         // sequence the animations
1573         for (i = 0;i < m->nummiptex;i++)
1574         {
1575                 tx = loadmodel->data_textures + i;
1576                 if (!tx || tx->name[0] != '+' || tx->name[1] == 0 || tx->name[2] == 0)
1577                         continue;
1578                 if (tx->anim_total[0] || tx->anim_total[1])
1579                         continue;       // already sequenced
1580
1581                 // find the number of frames in the animation
1582                 memset(anims, 0, sizeof(anims));
1583                 memset(altanims, 0, sizeof(altanims));
1584
1585                 for (j = i;j < m->nummiptex;j++)
1586                 {
1587                         tx2 = loadmodel->data_textures + j;
1588                         if (!tx2 || tx2->name[0] != '+' || strcmp(tx2->name+2, tx->name+2))
1589                                 continue;
1590
1591                         num = tx2->name[1];
1592                         if (num >= '0' && num <= '9')
1593                                 anims[num - '0'] = tx2;
1594                         else if (num >= 'a' && num <= 'j')
1595                                 altanims[num - 'a'] = tx2;
1596                         else
1597                                 Con_Printf("Bad animating texture %s\n", tx->name);
1598                 }
1599
1600                 max = altmax = 0;
1601                 for (j = 0;j < 10;j++)
1602                 {
1603                         if (anims[j])
1604                                 max = j + 1;
1605                         if (altanims[j])
1606                                 altmax = j + 1;
1607                 }
1608                 //Con_Printf("linking animation %s (%i:%i frames)\n\n", tx->name, max, altmax);
1609
1610                 incomplete = false;
1611                 for (j = 0;j < max;j++)
1612                 {
1613                         if (!anims[j])
1614                         {
1615                                 Con_Printf("Missing frame %i of %s\n", j, tx->name);
1616                                 incomplete = true;
1617                         }
1618                 }
1619                 for (j = 0;j < altmax;j++)
1620                 {
1621                         if (!altanims[j])
1622                         {
1623                                 Con_Printf("Missing altframe %i of %s\n", j, tx->name);
1624                                 incomplete = true;
1625                         }
1626                 }
1627                 if (incomplete)
1628                         continue;
1629
1630                 if (altmax < 1)
1631                 {
1632                         // if there is no alternate animation, duplicate the primary
1633                         // animation into the alternate
1634                         altmax = max;
1635                         for (k = 0;k < 10;k++)
1636                                 altanims[k] = anims[k];
1637                 }
1638
1639                 // link together the primary animation
1640                 for (j = 0;j < max;j++)
1641                 {
1642                         tx2 = anims[j];
1643                         tx2->animated = true;
1644                         tx2->anim_total[0] = max;
1645                         tx2->anim_total[1] = altmax;
1646                         for (k = 0;k < 10;k++)
1647                         {
1648                                 tx2->anim_frames[0][k] = anims[k];
1649                                 tx2->anim_frames[1][k] = altanims[k];
1650                         }
1651                 }
1652
1653                 // if there really is an alternate anim...
1654                 if (anims[0] != altanims[0])
1655                 {
1656                         // link together the alternate animation
1657                         for (j = 0;j < altmax;j++)
1658                         {
1659                                 tx2 = altanims[j];
1660                                 tx2->animated = true;
1661                                 // the primary/alternate are reversed here
1662                                 tx2->anim_total[0] = altmax;
1663                                 tx2->anim_total[1] = max;
1664                                 for (k = 0;k < 10;k++)
1665                                 {
1666                                         tx2->anim_frames[0][k] = altanims[k];
1667                                         tx2->anim_frames[1][k] = anims[k];
1668                                 }
1669                         }
1670                 }
1671         }
1672 }
1673
1674 static void Mod_Q1BSP_LoadLighting(lump_t *l)
1675 {
1676         int i;
1677         unsigned char *in, *out, *data, d;
1678         char litfilename[MAX_QPATH];
1679         char dlitfilename[MAX_QPATH];
1680         fs_offset_t filesize;
1681         if (loadmodel->brush.ishlbsp) // LordHavoc: load the colored lighting data straight
1682         {
1683                 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1684                 for (i=0; i<l->filelen; i++)
1685                         loadmodel->brushq1.lightdata[i] = mod_base[l->fileofs+i] >>= 1;
1686         }
1687         else // LordHavoc: bsp version 29 (normal white lighting)
1688         {
1689                 // LordHavoc: hope is not lost yet, check for a .lit file to load
1690                 strlcpy (litfilename, loadmodel->name, sizeof (litfilename));
1691                 FS_StripExtension (litfilename, litfilename, sizeof (litfilename));
1692                 strlcpy (dlitfilename, litfilename, sizeof (dlitfilename));
1693                 strlcat (litfilename, ".lit", sizeof (litfilename));
1694                 strlcat (dlitfilename, ".dlit", sizeof (dlitfilename));
1695                 data = (unsigned char*) FS_LoadFile(litfilename, tempmempool, false, &filesize);
1696                 if (data)
1697                 {
1698                         if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1699                         {
1700                                 i = LittleLong(((int *)data)[1]);
1701                                 if (i == 1)
1702                                 {
1703                                         if (developer_loading.integer)
1704                                                 Con_Printf("loaded %s\n", litfilename);
1705                                         loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1706                                         memcpy(loadmodel->brushq1.lightdata, data + 8, filesize - 8);
1707                                         Mem_Free(data);
1708                                         data = (unsigned char*) FS_LoadFile(dlitfilename, tempmempool, false, &filesize);
1709                                         if (data)
1710                                         {
1711                                                 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1712                                                 {
1713                                                         i = LittleLong(((int *)data)[1]);
1714                                                         if (i == 1)
1715                                                         {
1716                                                                 if (developer_loading.integer)
1717                                                                         Con_Printf("loaded %s\n", dlitfilename);
1718                                                                 loadmodel->brushq1.nmaplightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1719                                                                 memcpy(loadmodel->brushq1.nmaplightdata, data + 8, filesize - 8);
1720                                                                 loadmodel->brushq3.deluxemapping_modelspace = false;
1721                                                                 loadmodel->brushq3.deluxemapping = true;
1722                                                         }
1723                                                 }
1724                                                 Mem_Free(data);
1725                                                 data = NULL;
1726                                         }
1727                                         return;
1728                                 }
1729                                 else
1730                                         Con_Printf("Unknown .lit file version (%d)\n", i);
1731                         }
1732                         else if (filesize == 8)
1733                                 Con_Print("Empty .lit file, ignoring\n");
1734                         else
1735                                 Con_Printf("Corrupt .lit file (file size %i bytes, should be %i bytes), ignoring\n", (int) filesize, (int) (8 + l->filelen * 3));
1736                         if (data)
1737                         {
1738                                 Mem_Free(data);
1739                                 data = NULL;
1740                         }
1741                 }
1742                 // LordHavoc: oh well, expand the white lighting data
1743                 if (!l->filelen)
1744                         return;
1745                 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen*3);
1746                 in = mod_base + l->fileofs;
1747                 out = loadmodel->brushq1.lightdata;
1748                 for (i = 0;i < l->filelen;i++)
1749                 {
1750                         d = *in++;
1751                         *out++ = d;
1752                         *out++ = d;
1753                         *out++ = d;
1754                 }
1755         }
1756 }
1757
1758 static void Mod_Q1BSP_LoadVisibility(lump_t *l)
1759 {
1760         loadmodel->brushq1.num_compressedpvs = 0;
1761         loadmodel->brushq1.data_compressedpvs = NULL;
1762         if (!l->filelen)
1763                 return;
1764         loadmodel->brushq1.num_compressedpvs = l->filelen;
1765         loadmodel->brushq1.data_compressedpvs = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1766         memcpy(loadmodel->brushq1.data_compressedpvs, mod_base + l->fileofs, l->filelen);
1767 }
1768
1769 // used only for HalfLife maps
1770 static void Mod_Q1BSP_ParseWadsFromEntityLump(const char *data)
1771 {
1772         char key[128], value[4096];
1773         int i, j, k;
1774         if (!data)
1775                 return;
1776         if (!COM_ParseToken_Simple(&data, false, false))
1777                 return; // error
1778         if (com_token[0] != '{')
1779                 return; // error
1780         while (1)
1781         {
1782                 if (!COM_ParseToken_Simple(&data, false, false))
1783                         return; // error
1784                 if (com_token[0] == '}')
1785                         break; // end of worldspawn
1786                 if (com_token[0] == '_')
1787                         strlcpy(key, com_token + 1, sizeof(key));
1788                 else
1789                         strlcpy(key, com_token, sizeof(key));
1790                 while (key[strlen(key)-1] == ' ') // remove trailing spaces
1791                         key[strlen(key)-1] = 0;
1792                 if (!COM_ParseToken_Simple(&data, false, false))
1793                         return; // error
1794                 dpsnprintf(value, sizeof(value), "%s", com_token);
1795                 if (!strcmp("wad", key)) // for HalfLife maps
1796                 {
1797                         if (loadmodel->brush.ishlbsp)
1798                         {
1799                                 j = 0;
1800                                 for (i = 0;i < (int)sizeof(value);i++)
1801                                         if (value[i] != ';' && value[i] != '\\' && value[i] != '/' && value[i] != ':')
1802                                                 break;
1803                                 if (value[i])
1804                                 {
1805                                         for (;i < (int)sizeof(value);i++)
1806                                         {
1807                                                 // ignore path - the \\ check is for HalfLife... stupid windoze 'programmers'...
1808                                                 if (value[i] == '\\' || value[i] == '/' || value[i] == ':')
1809                                                         j = i+1;
1810                                                 else if (value[i] == ';' || value[i] == 0)
1811                                                 {
1812                                                         k = value[i];
1813                                                         value[i] = 0;
1814                                                         W_LoadTextureWadFile(&value[j], false);
1815                                                         j = i+1;
1816                                                         if (!k)
1817                                                                 break;
1818                                                 }
1819                                         }
1820                                 }
1821                         }
1822                 }
1823         }
1824 }
1825
1826 static void Mod_Q1BSP_LoadEntities(lump_t *l)
1827 {
1828         loadmodel->brush.entities = NULL;
1829         if (!l->filelen)
1830                 return;
1831         loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen + 1);
1832         memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
1833         loadmodel->brush.entities[l->filelen] = 0;
1834         if (loadmodel->brush.ishlbsp)
1835                 Mod_Q1BSP_ParseWadsFromEntityLump(loadmodel->brush.entities);
1836 }
1837
1838
1839 static void Mod_Q1BSP_LoadVertexes(lump_t *l)
1840 {
1841         dvertex_t       *in;
1842         mvertex_t       *out;
1843         int                     i, count;
1844
1845         in = (dvertex_t *)(mod_base + l->fileofs);
1846         if (l->filelen % sizeof(*in))
1847                 Host_Error("Mod_Q1BSP_LoadVertexes: funny lump size in %s",loadmodel->name);
1848         count = l->filelen / sizeof(*in);
1849         out = (mvertex_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
1850
1851         loadmodel->brushq1.vertexes = out;
1852         loadmodel->brushq1.numvertexes = count;
1853
1854         for ( i=0 ; i<count ; i++, in++, out++)
1855         {
1856                 out->position[0] = LittleFloat(in->point[0]);
1857                 out->position[1] = LittleFloat(in->point[1]);
1858                 out->position[2] = LittleFloat(in->point[2]);
1859         }
1860 }
1861
1862 // The following two functions should be removed and MSG_* or SZ_* function sets adjusted so they
1863 // can be used for this
1864 // REMOVEME
1865 int SB_ReadInt (unsigned char **buffer)
1866 {
1867         int     i;
1868         i = ((*buffer)[0]) + 256*((*buffer)[1]) + 65536*((*buffer)[2]) + 16777216*((*buffer)[3]);
1869         (*buffer) += 4;
1870         return i;
1871 }
1872
1873 // REMOVEME
1874 float SB_ReadFloat (unsigned char **buffer)
1875 {
1876         union
1877         {
1878                 int             i;
1879                 float   f;
1880         } u;
1881
1882         u.i = SB_ReadInt (buffer);
1883         return u.f;
1884 }
1885
1886 static void Mod_Q1BSP_LoadSubmodels(lump_t *l, hullinfo_t *hullinfo)
1887 {
1888         unsigned char           *index;
1889         dmodel_t        *out;
1890         int                     i, j, count;
1891
1892         index = (unsigned char *)(mod_base + l->fileofs);
1893         if (l->filelen % (48+4*hullinfo->filehulls))
1894                 Host_Error ("Mod_Q1BSP_LoadSubmodels: funny lump size in %s", loadmodel->name);
1895
1896         count = l->filelen / (48+4*hullinfo->filehulls);
1897         out = (dmodel_t *)Mem_Alloc (loadmodel->mempool, count*sizeof(*out));
1898
1899         loadmodel->brushq1.submodels = out;
1900         loadmodel->brush.numsubmodels = count;
1901
1902         for (i = 0; i < count; i++, out++)
1903         {
1904         // spread out the mins / maxs by a pixel
1905                 out->mins[0] = SB_ReadFloat (&index) - 1;
1906                 out->mins[1] = SB_ReadFloat (&index) - 1;
1907                 out->mins[2] = SB_ReadFloat (&index) - 1;
1908                 out->maxs[0] = SB_ReadFloat (&index) + 1;
1909                 out->maxs[1] = SB_ReadFloat (&index) + 1;
1910                 out->maxs[2] = SB_ReadFloat (&index) + 1;
1911                 out->origin[0] = SB_ReadFloat (&index);
1912                 out->origin[1] = SB_ReadFloat (&index);
1913                 out->origin[2] = SB_ReadFloat (&index);
1914                 for (j = 0; j < hullinfo->filehulls; j++)
1915                         out->headnode[j] = SB_ReadInt (&index);
1916                 out->visleafs = SB_ReadInt (&index);
1917                 out->firstface = SB_ReadInt (&index);
1918                 out->numfaces = SB_ReadInt (&index);
1919         }
1920 }
1921
1922 static void Mod_Q1BSP_LoadEdges(lump_t *l)
1923 {
1924         dedge_t *in;
1925         medge_t *out;
1926         int     i, count;
1927
1928         in = (dedge_t *)(mod_base + l->fileofs);
1929         if (l->filelen % sizeof(*in))
1930                 Host_Error("Mod_Q1BSP_LoadEdges: funny lump size in %s",loadmodel->name);
1931         count = l->filelen / sizeof(*in);
1932         out = (medge_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1933
1934         loadmodel->brushq1.edges = out;
1935         loadmodel->brushq1.numedges = count;
1936
1937         for ( i=0 ; i<count ; i++, in++, out++)
1938         {
1939                 out->v[0] = (unsigned short)LittleShort(in->v[0]);
1940                 out->v[1] = (unsigned short)LittleShort(in->v[1]);
1941                 if (out->v[0] >= loadmodel->brushq1.numvertexes || out->v[1] >= loadmodel->brushq1.numvertexes)
1942                 {
1943                         Con_Printf("Mod_Q1BSP_LoadEdges: %s has invalid vertex indices in edge %i (vertices %i %i >= numvertices %i)\n", loadmodel->name, i, out->v[0], out->v[1], loadmodel->brushq1.numvertexes);
1944                         out->v[0] = 0;
1945                         out->v[1] = 0;
1946                 }
1947         }
1948 }
1949
1950 static void Mod_Q1BSP_LoadTexinfo(lump_t *l)
1951 {
1952         texinfo_t *in;
1953         mtexinfo_t *out;
1954         int i, j, k, count, miptex;
1955
1956         in = (texinfo_t *)(mod_base + l->fileofs);
1957         if (l->filelen % sizeof(*in))
1958                 Host_Error("Mod_Q1BSP_LoadTexinfo: funny lump size in %s",loadmodel->name);
1959         count = l->filelen / sizeof(*in);
1960         out = (mtexinfo_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1961
1962         loadmodel->brushq1.texinfo = out;
1963         loadmodel->brushq1.numtexinfo = count;
1964
1965         for (i = 0;i < count;i++, in++, out++)
1966         {
1967                 for (k = 0;k < 2;k++)
1968                         for (j = 0;j < 4;j++)
1969                                 out->vecs[k][j] = LittleFloat(in->vecs[k][j]);
1970
1971                 miptex = LittleLong(in->miptex);
1972                 out->flags = LittleLong(in->flags);
1973
1974                 out->texture = NULL;
1975                 if (loadmodel->data_textures)
1976                 {
1977                         if ((unsigned int) miptex >= (unsigned int) loadmodel->num_textures)
1978                                 Con_Printf("error in model \"%s\": invalid miptex index %i(of %i)\n", loadmodel->name, miptex, loadmodel->num_textures);
1979                         else
1980                                 out->texture = loadmodel->data_textures + miptex;
1981                 }
1982                 if (out->flags & TEX_SPECIAL)
1983                 {
1984                         // if texture chosen is NULL or the shader needs a lightmap,
1985                         // force to notexture water shader
1986                         if (out->texture == NULL)
1987                                 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 1);
1988                 }
1989                 else
1990                 {
1991                         // if texture chosen is NULL, force to notexture
1992                         if (out->texture == NULL)
1993                                 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 2);
1994                 }
1995         }
1996 }
1997
1998 #if 0
1999 void BoundPoly(int numverts, float *verts, vec3_t mins, vec3_t maxs)
2000 {
2001         int             i, j;
2002         float   *v;
2003
2004         mins[0] = mins[1] = mins[2] = 9999;
2005         maxs[0] = maxs[1] = maxs[2] = -9999;
2006         v = verts;
2007         for (i = 0;i < numverts;i++)
2008         {
2009                 for (j = 0;j < 3;j++, v++)
2010                 {
2011                         if (*v < mins[j])
2012                                 mins[j] = *v;
2013                         if (*v > maxs[j])
2014                                 maxs[j] = *v;
2015                 }
2016         }
2017 }
2018
2019 #define MAX_SUBDIVPOLYTRIANGLES 4096
2020 #define MAX_SUBDIVPOLYVERTS(MAX_SUBDIVPOLYTRIANGLES * 3)
2021
2022 static int subdivpolyverts, subdivpolytriangles;
2023 static int subdivpolyindex[MAX_SUBDIVPOLYTRIANGLES][3];
2024 static float subdivpolyvert[MAX_SUBDIVPOLYVERTS][3];
2025
2026 static int subdivpolylookupvert(vec3_t v)
2027 {
2028         int i;
2029         for (i = 0;i < subdivpolyverts;i++)
2030                 if (subdivpolyvert[i][0] == v[0]
2031                  && subdivpolyvert[i][1] == v[1]
2032                  && subdivpolyvert[i][2] == v[2])
2033                         return i;
2034         if (subdivpolyverts >= MAX_SUBDIVPOLYVERTS)
2035                 Host_Error("SubDividePolygon: ran out of vertices in buffer, please increase your r_subdivide_size");
2036         VectorCopy(v, subdivpolyvert[subdivpolyverts]);
2037         return subdivpolyverts++;
2038 }
2039
2040 static void SubdividePolygon(int numverts, float *verts)
2041 {
2042         int             i, i1, i2, i3, f, b, c, p;
2043         vec3_t  mins, maxs, front[256], back[256];
2044         float   m, *pv, *cv, dist[256], frac;
2045
2046         if (numverts > 250)
2047                 Host_Error("SubdividePolygon: ran out of verts in buffer");
2048
2049         BoundPoly(numverts, verts, mins, maxs);
2050
2051         for (i = 0;i < 3;i++)
2052         {
2053                 m = (mins[i] + maxs[i]) * 0.5;
2054                 m = r_subdivide_size.value * floor(m/r_subdivide_size.value + 0.5);
2055                 if (maxs[i] - m < 8)
2056                         continue;
2057                 if (m - mins[i] < 8)
2058                         continue;
2059
2060                 // cut it
2061                 for (cv = verts, c = 0;c < numverts;c++, cv += 3)
2062                         dist[c] = cv[i] - m;
2063
2064                 f = b = 0;
2065                 for (p = numverts - 1, c = 0, pv = verts + p * 3, cv = verts;c < numverts;p = c, c++, pv = cv, cv += 3)
2066                 {
2067                         if (dist[p] >= 0)
2068                         {
2069                                 VectorCopy(pv, front[f]);
2070                                 f++;
2071                         }
2072                         if (dist[p] <= 0)
2073                         {
2074                                 VectorCopy(pv, back[b]);
2075                                 b++;
2076                         }
2077                         if (dist[p] == 0 || dist[c] == 0)
2078                                 continue;
2079                         if ((dist[p] > 0) != (dist[c] > 0) )
2080                         {
2081                                 // clip point
2082                                 frac = dist[p] / (dist[p] - dist[c]);
2083                                 front[f][0] = back[b][0] = pv[0] + frac * (cv[0] - pv[0]);
2084                                 front[f][1] = back[b][1] = pv[1] + frac * (cv[1] - pv[1]);
2085                                 front[f][2] = back[b][2] = pv[2] + frac * (cv[2] - pv[2]);
2086                                 f++;
2087                                 b++;
2088                         }
2089                 }
2090
2091                 SubdividePolygon(f, front[0]);
2092                 SubdividePolygon(b, back[0]);
2093                 return;
2094         }
2095
2096         i1 = subdivpolylookupvert(verts);
2097         i2 = subdivpolylookupvert(verts + 3);
2098         for (i = 2;i < numverts;i++)
2099         {
2100                 if (subdivpolytriangles >= MAX_SUBDIVPOLYTRIANGLES)
2101                 {
2102                         Con_Print("SubdividePolygon: ran out of triangles in buffer, please increase your r_subdivide_size\n");
2103                         return;
2104                 }
2105
2106                 i3 = subdivpolylookupvert(verts + i * 3);
2107                 subdivpolyindex[subdivpolytriangles][0] = i1;
2108                 subdivpolyindex[subdivpolytriangles][1] = i2;
2109                 subdivpolyindex[subdivpolytriangles][2] = i3;
2110                 i2 = i3;
2111                 subdivpolytriangles++;
2112         }
2113 }
2114
2115 //Breaks a polygon up along axial 64 unit
2116 //boundaries so that turbulent and sky warps
2117 //can be done reasonably.
2118 static void Mod_Q1BSP_GenerateWarpMesh(msurface_t *surface)
2119 {
2120         int i, j;
2121         surfvertex_t *v;
2122         surfmesh_t *mesh;
2123
2124         subdivpolytriangles = 0;
2125         subdivpolyverts = 0;
2126         SubdividePolygon(surface->num_vertices, (surface->mesh->data_vertex3f + 3 * surface->num_firstvertex));
2127         if (subdivpolytriangles < 1)
2128                 Host_Error("Mod_Q1BSP_GenerateWarpMesh: no triangles?");
2129
2130         surface->mesh = mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + subdivpolytriangles * sizeof(int[3]) + subdivpolyverts * sizeof(surfvertex_t));
2131         mesh->num_vertices = subdivpolyverts;
2132         mesh->num_triangles = subdivpolytriangles;
2133         mesh->vertex = (surfvertex_t *)(mesh + 1);
2134         mesh->index = (int *)(mesh->vertex + mesh->num_vertices);
2135         memset(mesh->vertex, 0, mesh->num_vertices * sizeof(surfvertex_t));
2136
2137         for (i = 0;i < mesh->num_triangles;i++)
2138                 for (j = 0;j < 3;j++)
2139                         mesh->index[i*3+j] = subdivpolyindex[i][j];
2140
2141         for (i = 0, v = mesh->vertex;i < subdivpolyverts;i++, v++)
2142         {
2143                 VectorCopy(subdivpolyvert[i], v->v);
2144                 v->st[0] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[0]);
2145                 v->st[1] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[1]);
2146         }
2147 }
2148 #endif
2149
2150 /* Maximum size of a single LM */
2151 #define MAX_SINGLE_LM_SIZE    256
2152
2153 struct alloc_lm_row
2154 {
2155         int rowY;
2156         int currentX;
2157 };
2158
2159 struct alloc_lm_state
2160 {
2161         int currentY;
2162         struct alloc_lm_row rows[MAX_SINGLE_LM_SIZE];
2163 };
2164
2165 static void init_alloc_lm_state (struct alloc_lm_state* state)
2166 {
2167         int r;
2168
2169         state->currentY = 0;
2170         for (r = 0; r < MAX_SINGLE_LM_SIZE; r++)
2171         {
2172           state->rows[r].currentX = 0;
2173           state->rows[r].rowY = -1;
2174         }
2175 }
2176
2177 static qboolean Mod_Q1BSP_AllocLightmapBlock(struct alloc_lm_state* state, int totalwidth, int totalheight, int blockwidth, int blockheight, int *outx, int *outy)
2178 {
2179         struct alloc_lm_row* row;
2180         int r;
2181
2182         row = &(state->rows[blockheight]);
2183         if ((row->rowY < 0) || (row->currentX + blockwidth > totalwidth))
2184         {
2185                 if (state->currentY + blockheight <= totalheight)
2186                 {
2187                         row->rowY = state->currentY;
2188                         row->currentX = 0;
2189                         state->currentY += blockheight;
2190                 }
2191                 else
2192                 {
2193                         /* See if we can stuff the block into a higher row */
2194                         row = NULL;
2195                         for (r = blockheight; r < MAX_SINGLE_LM_SIZE; r++)
2196                         {
2197                                 if ((state->rows[r].rowY >= 0)
2198                                   && (state->rows[r].currentX + blockwidth <= totalwidth))
2199                                 {
2200                                         row = &(state->rows[r]);
2201                                         break;
2202                                 }
2203                         }
2204                         if (row == NULL) return false;
2205                 }
2206         }
2207         *outy = row->rowY;
2208         *outx = row->currentX;
2209         row->currentX += blockwidth;
2210
2211         return true;
2212 }
2213
2214 extern cvar_t gl_max_size;
2215 static void Mod_Q1BSP_LoadFaces(lump_t *l)
2216 {
2217         dface_t *in;
2218         msurface_t *surface;
2219         int i, j, count, surfacenum, planenum, smax, tmax, ssize, tsize, firstedge, numedges, totalverts, totaltris, lightmapnumber, lightmapsize, totallightmapsamples;
2220         float texmins[2], texmaxs[2], val;
2221         rtexture_t *lightmaptexture, *deluxemaptexture;
2222
2223         in = (dface_t *)(mod_base + l->fileofs);
2224         if (l->filelen % sizeof(*in))
2225                 Host_Error("Mod_Q1BSP_LoadFaces: funny lump size in %s",loadmodel->name);
2226         count = l->filelen / sizeof(*in);
2227         loadmodel->data_surfaces = (msurface_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_t));
2228         loadmodel->data_surfaces_lightmapinfo = (msurface_lightmapinfo_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_lightmapinfo_t));
2229
2230         loadmodel->num_surfaces = count;
2231
2232         loadmodel->brushq1.lightmapupdateflags = (unsigned char *)Mem_Alloc(loadmodel->mempool, count*sizeof(unsigned char));
2233
2234         totalverts = 0;
2235         totaltris = 0;
2236         for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs);surfacenum < count;surfacenum++, in++)
2237         {
2238                 numedges = (unsigned short)LittleShort(in->numedges);
2239                 totalverts += numedges;
2240                 totaltris += numedges - 2;
2241         }
2242
2243         Mod_AllocSurfMesh(loadmodel->mempool, totalverts, totaltris, true, false, false);
2244
2245         lightmaptexture = NULL;
2246         deluxemaptexture = r_texture_blanknormalmap;
2247         lightmapnumber = 1;
2248         lightmapsize = max(256, gl_max_size.integer);
2249         totallightmapsamples = 0;
2250
2251         totalverts = 0;
2252         totaltris = 0;
2253         for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs), surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, in++, surface++)
2254         {
2255                 surface->lightmapinfo = loadmodel->data_surfaces_lightmapinfo + surfacenum;
2256
2257                 // FIXME: validate edges, texinfo, etc?
2258                 firstedge = LittleLong(in->firstedge);
2259                 numedges = (unsigned short)LittleShort(in->numedges);
2260                 if ((unsigned int) firstedge > (unsigned int) loadmodel->brushq1.numsurfedges || (unsigned int) numedges > (unsigned int) loadmodel->brushq1.numsurfedges || (unsigned int) firstedge + (unsigned int) numedges > (unsigned int) loadmodel->brushq1.numsurfedges)
2261                         Host_Error("Mod_Q1BSP_LoadFaces: invalid edge range (firstedge %i, numedges %i, model edges %i)", firstedge, numedges, loadmodel->brushq1.numsurfedges);
2262                 i = (unsigned short)LittleShort(in->texinfo);
2263                 if ((unsigned int) i >= (unsigned int) loadmodel->brushq1.numtexinfo)
2264                         Host_Error("Mod_Q1BSP_LoadFaces: invalid texinfo index %i(model has %i texinfos)", i, loadmodel->brushq1.numtexinfo);
2265                 surface->lightmapinfo->texinfo = loadmodel->brushq1.texinfo + i;
2266                 surface->texture = surface->lightmapinfo->texinfo->texture;
2267
2268                 planenum = (unsigned short)LittleShort(in->planenum);
2269                 if ((unsigned int) planenum >= (unsigned int) loadmodel->brush.num_planes)
2270                         Host_Error("Mod_Q1BSP_LoadFaces: invalid plane index %i (model has %i planes)", planenum, loadmodel->brush.num_planes);
2271
2272                 //surface->flags = surface->texture->flags;
2273                 //if (LittleShort(in->side))
2274                 //      surface->flags |= SURF_PLANEBACK;
2275                 //surface->plane = loadmodel->brush.data_planes + planenum;
2276
2277                 surface->num_firstvertex = totalverts;
2278                 surface->num_vertices = numedges;
2279                 surface->num_firsttriangle = totaltris;
2280                 surface->num_triangles = numedges - 2;
2281                 totalverts += numedges;
2282                 totaltris += numedges - 2;
2283
2284                 // convert edges back to a normal polygon
2285                 for (i = 0;i < surface->num_vertices;i++)
2286                 {
2287                         int lindex = loadmodel->brushq1.surfedges[firstedge + i];
2288                         float s, t;
2289                         if (lindex > 0)
2290                                 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[lindex].v[0]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2291                         else
2292                                 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[-lindex].v[1]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2293                         s = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2294                         t = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2295                         (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 0] = s / surface->texture->width;
2296                         (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 1] = t / surface->texture->height;
2297                         (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = 0;
2298                         (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = 0;
2299                         (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = 0;
2300                 }
2301
2302                 for (i = 0;i < surface->num_triangles;i++)
2303                 {
2304                         (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 0] = 0 + surface->num_firstvertex;
2305                         (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 1] = i + 1 + surface->num_firstvertex;
2306                         (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 2] = i + 2 + surface->num_firstvertex;
2307                 }
2308
2309                 // compile additional data about the surface geometry
2310                 Mod_BuildNormals(surface->num_firstvertex, surface->num_vertices, surface->num_triangles, loadmodel->surfmesh.data_vertex3f, (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle), loadmodel->surfmesh.data_normal3f, true);
2311                 Mod_BuildTextureVectorsFromNormals(surface->num_firstvertex, surface->num_vertices, surface->num_triangles, loadmodel->surfmesh.data_vertex3f, loadmodel->surfmesh.data_texcoordtexture2f, loadmodel->surfmesh.data_normal3f, (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle), loadmodel->surfmesh.data_svector3f, loadmodel->surfmesh.data_tvector3f, true);
2312                 BoxFromPoints(surface->mins, surface->maxs, surface->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex));
2313
2314                 // generate surface extents information
2315                 texmins[0] = texmaxs[0] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2316                 texmins[1] = texmaxs[1] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2317                 for (i = 1;i < surface->num_vertices;i++)
2318                 {
2319                         for (j = 0;j < 2;j++)
2320                         {
2321                                 val = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3, surface->lightmapinfo->texinfo->vecs[j]) + surface->lightmapinfo->texinfo->vecs[j][3];
2322                                 texmins[j] = min(texmins[j], val);
2323                                 texmaxs[j] = max(texmaxs[j], val);
2324                         }
2325                 }
2326                 for (i = 0;i < 2;i++)
2327                 {
2328                         surface->lightmapinfo->texturemins[i] = (int) floor(texmins[i] / 16.0) * 16;
2329                         surface->lightmapinfo->extents[i] = (int) ceil(texmaxs[i] / 16.0) * 16 - surface->lightmapinfo->texturemins[i];
2330                 }
2331
2332                 smax = surface->lightmapinfo->extents[0] >> 4;
2333                 tmax = surface->lightmapinfo->extents[1] >> 4;
2334                 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2335                 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2336
2337                 // lighting info
2338                 for (i = 0;i < MAXLIGHTMAPS;i++)
2339                         surface->lightmapinfo->styles[i] = in->styles[i];
2340                 surface->lightmaptexture = NULL;
2341                 surface->deluxemaptexture = r_texture_blanknormalmap;
2342                 i = LittleLong(in->lightofs);
2343                 if (i == -1)
2344                 {
2345                         surface->lightmapinfo->samples = NULL;
2346 #if 0
2347                         // give non-lightmapped water a 1x white lightmap
2348                         if (surface->texture->name[0] == '*' && (surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) && ssize <= 256 && tsize <= 256)
2349                         {
2350                                 surface->lightmapinfo->samples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2351                                 surface->lightmapinfo->styles[0] = 0;
2352                                 memset(surface->lightmapinfo->samples, 128, ssize * tsize * 3);
2353                         }
2354 #endif
2355                 }
2356                 else if (loadmodel->brush.ishlbsp) // LordHavoc: HalfLife map (bsp version 30)
2357                         surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + i;
2358                 else // LordHavoc: white lighting (bsp version 29)
2359                 {
2360                         surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + (i * 3);
2361                         if (loadmodel->brushq1.nmaplightdata)
2362                                 surface->lightmapinfo->nmapsamples = loadmodel->brushq1.nmaplightdata + (i * 3);
2363                 }
2364
2365                 // check if we should apply a lightmap to this
2366                 if (!(surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) || surface->lightmapinfo->samples)
2367                 {
2368                         if (ssize > 256 || tsize > 256)
2369                                 Host_Error("Bad surface extents");
2370
2371                         if (lightmapsize < ssize)
2372                                 lightmapsize = ssize;
2373                         if (lightmapsize < tsize)
2374                                 lightmapsize = tsize;
2375
2376                         totallightmapsamples += ssize*tsize;
2377
2378                         // force lightmap upload on first time seeing the surface
2379                         //
2380                         // additionally this is used by the later code to see if a
2381                         // lightmap is needed on this surface (rather than duplicating the
2382                         // logic above)
2383                         loadmodel->brushq1.lightmapupdateflags[surfacenum] = true;
2384                 }
2385         }
2386
2387         // small maps (such as ammo boxes especially) don't need big lightmap
2388         // textures, so this code tries to guess a good size based on
2389         // totallightmapsamples (size of the lightmaps lump basically), as well as
2390         // trying to max out the gl_max_size if there is a lot of lightmap data to
2391         // store
2392         // additionally, never choose a lightmapsize that is smaller than the
2393         // largest surface encountered (as it would fail)
2394         i = lightmapsize;
2395         for (lightmapsize = 64; (lightmapsize < i) && (lightmapsize < gl_max_size.integer) && (totallightmapsamples > lightmapsize*lightmapsize); lightmapsize*=2)
2396                 ;
2397
2398         // now that we've decided the lightmap texture size, we can do the rest
2399         if (cls.state != ca_dedicated)
2400         {
2401                 int stainmapsize = 0;
2402                 struct alloc_lm_state allocState;
2403
2404                 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2405                 {
2406                         int i, iu, iv, lightmapx = 0, lightmapy = 0;
2407                         float u, v, ubase, vbase, uscale, vscale;
2408
2409                         if (!loadmodel->brushq1.lightmapupdateflags[surfacenum])
2410                                 continue;
2411
2412                         smax = surface->lightmapinfo->extents[0] >> 4;
2413                         tmax = surface->lightmapinfo->extents[1] >> 4;
2414                         ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2415                         tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2416                         stainmapsize += ssize * tsize * 3;
2417
2418                         if (!lightmaptexture || !Mod_Q1BSP_AllocLightmapBlock(&allocState, lightmapsize, lightmapsize, ssize, tsize, &lightmapx, &lightmapy))
2419                         {
2420                                 // allocate a texture pool if we need it
2421                                 if (loadmodel->texturepool == NULL)
2422                                         loadmodel->texturepool = R_AllocTexturePool();
2423                                 // could not find room, make a new lightmap
2424                                 lightmaptexture = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2425                                 if (loadmodel->brushq1.nmaplightdata)
2426                                         deluxemaptexture = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2427                                 lightmapnumber++;
2428                                 init_alloc_lm_state (&allocState);
2429                                 Mod_Q1BSP_AllocLightmapBlock(&allocState, lightmapsize, lightmapsize, ssize, tsize, &lightmapx, &lightmapy);
2430                         }
2431                         surface->lightmaptexture = lightmaptexture;
2432                         surface->deluxemaptexture = deluxemaptexture;
2433                         surface->lightmapinfo->lightmaporigin[0] = lightmapx;
2434                         surface->lightmapinfo->lightmaporigin[1] = lightmapy;
2435
2436                         uscale = 1.0f / (float)lightmapsize;
2437                         vscale = 1.0f / (float)lightmapsize;
2438                         ubase = lightmapx * uscale;
2439                         vbase = lightmapy * vscale;
2440
2441                         for (i = 0;i < surface->num_vertices;i++)
2442                         {
2443                                 u = ((DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3]) + 8 - surface->lightmapinfo->texturemins[0]) * (1.0 / 16.0);
2444                                 v = ((DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3]) + 8 - surface->lightmapinfo->texturemins[1]) * (1.0 / 16.0);
2445                                 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = u * uscale + ubase;
2446                                 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = v * vscale + vbase;
2447                                 // LordHavoc: calc lightmap data offset for vertex lighting to use
2448                                 iu = (int) u;
2449                                 iv = (int) v;
2450                                 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = (bound(0, iv, tmax) * ssize + bound(0, iu, smax)) * 3;
2451                         }
2452                 }
2453
2454                 if (cl_stainmaps.integer)
2455                 {
2456                         // allocate stainmaps for permanent marks on walls and clear white
2457                         unsigned char *stainsamples = NULL;
2458                         stainsamples = (unsigned char *)Mem_Alloc(loadmodel->mempool, stainmapsize);
2459                         memset(stainsamples, 255, stainmapsize);
2460                         // assign pointers
2461                         for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2462                         {
2463                                 if (!loadmodel->brushq1.lightmapupdateflags[surfacenum])
2464                                         continue;
2465                                 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2466                                 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2467                                 surface->lightmapinfo->stainsamples = stainsamples;
2468                                 stainsamples += ssize * tsize * 3;
2469                         }
2470                 }
2471         }
2472
2473         // generate ushort elements array if possible
2474         if (loadmodel->surfmesh.data_element3s)
2475                 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
2476                         loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
2477 }
2478
2479 static void Mod_Q1BSP_LoadNodes_RecursiveSetParent(mnode_t *node, mnode_t *parent)
2480 {
2481         //if (node->parent)
2482         //      Host_Error("Mod_Q1BSP_LoadNodes_RecursiveSetParent: runaway recursion");
2483         node->parent = parent;
2484         if (node->plane)
2485         {
2486                 // this is a node, recurse to children
2487                 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[0], node);
2488                 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[1], node);
2489                 // combine supercontents of children
2490                 node->combinedsupercontents = node->children[0]->combinedsupercontents | node->children[1]->combinedsupercontents;
2491         }
2492         else
2493         {
2494                 int j;
2495                 mleaf_t *leaf = (mleaf_t *)node;
2496                 // if this is a leaf, calculate supercontents mask from all collidable
2497                 // primitives in the leaf (brushes and collision surfaces)
2498                 // also flag if the leaf contains any collision surfaces
2499                 leaf->combinedsupercontents = 0;
2500                 // combine the supercontents values of all brushes in this leaf
2501                 for (j = 0;j < leaf->numleafbrushes;j++)
2502                         leaf->combinedsupercontents |= loadmodel->brush.data_brushes[leaf->firstleafbrush[j]].texture->supercontents;
2503                 // check if this leaf contains any collision surfaces (q3 patches)
2504                 for (j = 0;j < leaf->numleafsurfaces;j++)
2505                 {
2506                         msurface_t *surface = loadmodel->data_surfaces + leaf->firstleafsurface[j];
2507                         if (surface->num_collisiontriangles)
2508                         {
2509                                 leaf->containscollisionsurfaces = true;
2510                                 leaf->combinedsupercontents |= surface->texture->supercontents;
2511                         }
2512                 }
2513         }
2514 }
2515
2516 static void Mod_Q1BSP_LoadNodes(lump_t *l)
2517 {
2518         int                     i, j, count, p;
2519         dnode_t         *in;
2520         mnode_t         *out;
2521
2522         in = (dnode_t *)(mod_base + l->fileofs);
2523         if (l->filelen % sizeof(*in))
2524                 Host_Error("Mod_Q1BSP_LoadNodes: funny lump size in %s",loadmodel->name);
2525         count = l->filelen / sizeof(*in);
2526         out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2527
2528         loadmodel->brush.data_nodes = out;
2529         loadmodel->brush.num_nodes = count;
2530
2531         for ( i=0 ; i<count ; i++, in++, out++)
2532         {
2533                 for (j=0 ; j<3 ; j++)
2534                 {
2535                         out->mins[j] = LittleShort(in->mins[j]);
2536                         out->maxs[j] = LittleShort(in->maxs[j]);
2537                 }
2538
2539                 p = LittleLong(in->planenum);
2540                 out->plane = loadmodel->brush.data_planes + p;
2541
2542                 out->firstsurface = (unsigned short)LittleShort(in->firstface);
2543                 out->numsurfaces = (unsigned short)LittleShort(in->numfaces);
2544
2545                 for (j=0 ; j<2 ; j++)
2546                 {
2547                         // LordHavoc: this code supports broken bsp files produced by
2548                         // arguire qbsp which can produce more than 32768 nodes, any value
2549                         // below count is assumed to be a node number, any other value is
2550                         // assumed to be a leaf number
2551                         p = (unsigned short)LittleShort(in->children[j]);
2552                         if (p < count)
2553                         {
2554                                 if (p < loadmodel->brush.num_nodes)
2555                                         out->children[j] = loadmodel->brush.data_nodes + p;
2556                                 else
2557                                 {
2558                                         Con_Printf("Mod_Q1BSP_LoadNodes: invalid node index %i (file has only %i nodes)\n", p, loadmodel->brush.num_nodes);
2559                                         // map it to the solid leaf
2560                                         out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2561                                 }
2562                         }
2563                         else
2564                         {
2565                                 // note this uses 65535 intentionally, -1 is leaf 0
2566                                 p = 65535 - p;
2567                                 if (p < loadmodel->brush.num_leafs)
2568                                         out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + p);
2569                                 else
2570                                 {
2571                                         Con_Printf("Mod_Q1BSP_LoadNodes: invalid leaf index %i (file has only %i leafs)\n", p, loadmodel->brush.num_leafs);
2572                                         // map it to the solid leaf
2573                                         out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2574                                 }
2575                         }
2576                 }
2577         }
2578
2579         Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);      // sets nodes and leafs
2580 }
2581
2582 static void Mod_Q1BSP_LoadLeafs(lump_t *l)
2583 {
2584         dleaf_t *in;
2585         mleaf_t *out;
2586         int i, j, count, p;
2587
2588         in = (dleaf_t *)(mod_base + l->fileofs);
2589         if (l->filelen % sizeof(*in))
2590                 Host_Error("Mod_Q1BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
2591         count = l->filelen / sizeof(*in);
2592         out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2593
2594         loadmodel->brush.data_leafs = out;
2595         loadmodel->brush.num_leafs = count;
2596         // get visleafs from the submodel data
2597         loadmodel->brush.num_pvsclusters = loadmodel->brushq1.submodels[0].visleafs;
2598         loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters+7)>>3;
2599         loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2600         memset(loadmodel->brush.data_pvsclusters, 0xFF, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2601
2602         for ( i=0 ; i<count ; i++, in++, out++)
2603         {
2604                 for (j=0 ; j<3 ; j++)
2605                 {
2606                         out->mins[j] = LittleShort(in->mins[j]);
2607                         out->maxs[j] = LittleShort(in->maxs[j]);
2608                 }
2609
2610                 // FIXME: this function could really benefit from some error checking
2611
2612                 out->contents = LittleLong(in->contents);
2613
2614                 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + (unsigned short)LittleShort(in->firstmarksurface);
2615                 out->numleafsurfaces = (unsigned short)LittleShort(in->nummarksurfaces);
2616                 if ((unsigned short)LittleShort(in->firstmarksurface) + out->numleafsurfaces > loadmodel->brush.num_leafsurfaces)
2617                 {
2618                         Con_Printf("Mod_Q1BSP_LoadLeafs: invalid leafsurface range %i:%i outside range %i:%i\n", (int)(out->firstleafsurface - loadmodel->brush.data_leafsurfaces), (int)(out->firstleafsurface + out->numleafsurfaces - loadmodel->brush.data_leafsurfaces), 0, loadmodel->brush.num_leafsurfaces);
2619                         out->firstleafsurface = NULL;
2620                         out->numleafsurfaces = 0;
2621                 }
2622
2623                 out->clusterindex = i - 1;
2624                 if (out->clusterindex >= loadmodel->brush.num_pvsclusters)
2625                         out->clusterindex = -1;
2626
2627                 p = LittleLong(in->visofs);
2628                 // ignore visofs errors on leaf 0 (solid)
2629                 if (p >= 0 && out->clusterindex >= 0)
2630                 {
2631                         if (p >= loadmodel->brushq1.num_compressedpvs)
2632                                 Con_Print("Mod_Q1BSP_LoadLeafs: invalid visofs\n");
2633                         else
2634                                 Mod_Q1BSP_DecompressVis(loadmodel->brushq1.data_compressedpvs + p, loadmodel->brushq1.data_compressedpvs + loadmodel->brushq1.num_compressedpvs, loadmodel->brush.data_pvsclusters + out->clusterindex * loadmodel->brush.num_pvsclusterbytes, loadmodel->brush.data_pvsclusters + (out->clusterindex + 1) * loadmodel->brush.num_pvsclusterbytes);
2635                 }
2636
2637                 for (j = 0;j < 4;j++)
2638                         out->ambient_sound_level[j] = in->ambient_level[j];
2639
2640                 // FIXME: Insert caustics here
2641         }
2642 }
2643
2644 qboolean Mod_Q1BSP_CheckWaterAlphaSupport(void)
2645 {
2646         int i, j;
2647         mleaf_t *leaf;
2648         const unsigned char *pvs;
2649         // if there's no vis data, assume supported (because everything is visible all the time)
2650         if (!loadmodel->brush.data_pvsclusters)
2651                 return true;
2652         // check all liquid leafs to see if they can see into empty leafs, if any
2653         // can we can assume this map supports r_wateralpha
2654         for (i = 0, leaf = loadmodel->brush.data_leafs;i < loadmodel->brush.num_leafs;i++, leaf++)
2655         {
2656                 if ((leaf->contents == CONTENTS_WATER || leaf->contents == CONTENTS_SLIME) && leaf->clusterindex >= 0)
2657                 {
2658                         pvs = loadmodel->brush.data_pvsclusters + leaf->clusterindex * loadmodel->brush.num_pvsclusterbytes;
2659                         for (j = 0;j < loadmodel->brush.num_leafs;j++)
2660                                 if (CHECKPVSBIT(pvs, loadmodel->brush.data_leafs[j].clusterindex) && loadmodel->brush.data_leafs[j].contents == CONTENTS_EMPTY)
2661                                         return true;
2662                 }
2663         }
2664         return false;
2665 }
2666
2667 static void Mod_Q1BSP_LoadClipnodes(lump_t *l, hullinfo_t *hullinfo)
2668 {
2669         dclipnode_t *in;
2670         mclipnode_t *out;
2671         int                     i, count;
2672         hull_t          *hull;
2673
2674         in = (dclipnode_t *)(mod_base + l->fileofs);
2675         if (l->filelen % sizeof(*in))
2676                 Host_Error("Mod_Q1BSP_LoadClipnodes: funny lump size in %s",loadmodel->name);
2677         count = l->filelen / sizeof(*in);
2678         out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2679
2680         loadmodel->brushq1.clipnodes = out;
2681         loadmodel->brushq1.numclipnodes = count;
2682
2683         for (i = 1; i < MAX_MAP_HULLS; i++)
2684         {
2685                 hull = &loadmodel->brushq1.hulls[i];
2686                 hull->clipnodes = out;
2687                 hull->firstclipnode = 0;
2688                 hull->lastclipnode = count-1;
2689                 hull->planes = loadmodel->brush.data_planes;
2690                 hull->clip_mins[0] = hullinfo->hullsizes[i][0][0];
2691                 hull->clip_mins[1] = hullinfo->hullsizes[i][0][1];
2692                 hull->clip_mins[2] = hullinfo->hullsizes[i][0][2];
2693                 hull->clip_maxs[0] = hullinfo->hullsizes[i][1][0];
2694                 hull->clip_maxs[1] = hullinfo->hullsizes[i][1][1];
2695                 hull->clip_maxs[2] = hullinfo->hullsizes[i][1][2];
2696                 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2697         }
2698
2699         for (i=0 ; i<count ; i++, out++, in++)
2700         {
2701                 out->planenum = LittleLong(in->planenum);
2702                 // LordHavoc: this code supports arguire qbsp's broken clipnodes indices (more than 32768 clipnodes), values above count are assumed to be contents values
2703                 out->children[0] = (unsigned short)LittleShort(in->children[0]);
2704                 out->children[1] = (unsigned short)LittleShort(in->children[1]);
2705                 if (out->children[0] >= count)
2706                         out->children[0] -= 65536;
2707                 if (out->children[1] >= count)
2708                         out->children[1] -= 65536;
2709                 if (out->planenum < 0 || out->planenum >= loadmodel->brush.num_planes)
2710                         Host_Error("Corrupt clipping hull(out of range planenum)");
2711         }
2712 }
2713
2714 //Duplicate the drawing hull structure as a clipping hull
2715 static void Mod_Q1BSP_MakeHull0(void)
2716 {
2717         mnode_t         *in;
2718         mclipnode_t *out;
2719         int                     i;
2720         hull_t          *hull;
2721
2722         hull = &loadmodel->brushq1.hulls[0];
2723
2724         in = loadmodel->brush.data_nodes;
2725         out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(*out));
2726
2727         hull->clipnodes = out;
2728         hull->firstclipnode = 0;
2729         hull->lastclipnode = loadmodel->brush.num_nodes - 1;
2730         hull->planes = loadmodel->brush.data_planes;
2731
2732         for (i = 0;i < loadmodel->brush.num_nodes;i++, out++, in++)
2733         {
2734                 out->planenum = in->plane - loadmodel->brush.data_planes;
2735                 out->children[0] = in->children[0]->plane ? in->children[0] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[0])->contents;
2736                 out->children[1] = in->children[1]->plane ? in->children[1] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[1])->contents;
2737         }
2738 }
2739
2740 static void Mod_Q1BSP_LoadLeaffaces(lump_t *l)
2741 {
2742         int i, j;
2743         short *in;
2744
2745         in = (short *)(mod_base + l->fileofs);
2746         if (l->filelen % sizeof(*in))
2747                 Host_Error("Mod_Q1BSP_LoadLeaffaces: funny lump size in %s",loadmodel->name);
2748         loadmodel->brush.num_leafsurfaces = l->filelen / sizeof(*in);
2749         loadmodel->brush.data_leafsurfaces = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafsurfaces * sizeof(int));
2750
2751         for (i = 0;i < loadmodel->brush.num_leafsurfaces;i++)
2752         {
2753                 j = (unsigned short) LittleShort(in[i]);
2754                 if (j >= loadmodel->num_surfaces)
2755                         Host_Error("Mod_Q1BSP_LoadLeaffaces: bad surface number");
2756                 loadmodel->brush.data_leafsurfaces[i] = j;
2757         }
2758 }
2759
2760 static void Mod_Q1BSP_LoadSurfedges(lump_t *l)
2761 {
2762         int             i;
2763         int             *in;
2764
2765         in = (int *)(mod_base + l->fileofs);
2766         if (l->filelen % sizeof(*in))
2767                 Host_Error("Mod_Q1BSP_LoadSurfedges: funny lump size in %s",loadmodel->name);
2768         loadmodel->brushq1.numsurfedges = l->filelen / sizeof(*in);
2769         loadmodel->brushq1.surfedges = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numsurfedges * sizeof(int));
2770
2771         for (i = 0;i < loadmodel->brushq1.numsurfedges;i++)
2772                 loadmodel->brushq1.surfedges[i] = LittleLong(in[i]);
2773 }
2774
2775
2776 static void Mod_Q1BSP_LoadPlanes(lump_t *l)
2777 {
2778         int                     i;
2779         mplane_t        *out;
2780         dplane_t        *in;
2781
2782         in = (dplane_t *)(mod_base + l->fileofs);
2783         if (l->filelen % sizeof(*in))
2784                 Host_Error("Mod_Q1BSP_LoadPlanes: funny lump size in %s", loadmodel->name);
2785
2786         loadmodel->brush.num_planes = l->filelen / sizeof(*in);
2787         loadmodel->brush.data_planes = out = (mplane_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_planes * sizeof(*out));
2788
2789         for (i = 0;i < loadmodel->brush.num_planes;i++, in++, out++)
2790         {
2791                 out->normal[0] = LittleFloat(in->normal[0]);
2792                 out->normal[1] = LittleFloat(in->normal[1]);
2793                 out->normal[2] = LittleFloat(in->normal[2]);
2794                 out->dist = LittleFloat(in->dist);
2795
2796                 PlaneClassify(out);
2797         }
2798 }
2799
2800 static void Mod_Q1BSP_LoadMapBrushes(void)
2801 {
2802 #if 0
2803 // unfinished
2804         int submodel, numbrushes;
2805         qboolean firstbrush;
2806         char *text, *maptext;
2807         char mapfilename[MAX_QPATH];
2808         FS_StripExtension (loadmodel->name, mapfilename, sizeof (mapfilename));
2809         strlcat (mapfilename, ".map", sizeof (mapfilename));
2810         maptext = (unsigned char*) FS_LoadFile(mapfilename, tempmempool, false, NULL);
2811         if (!maptext)
2812                 return;
2813         text = maptext;
2814         if (!COM_ParseToken_Simple(&data, false, false))
2815                 return; // error
2816         submodel = 0;
2817         for (;;)
2818         {
2819                 if (!COM_ParseToken_Simple(&data, false, false))
2820                         break;
2821                 if (com_token[0] != '{')
2822                         return; // error
2823                 // entity
2824                 firstbrush = true;
2825                 numbrushes = 0;
2826                 maxbrushes = 256;
2827                 brushes = Mem_Alloc(loadmodel->mempool, maxbrushes * sizeof(mbrush_t));
2828                 for (;;)
2829                 {
2830                         if (!COM_ParseToken_Simple(&data, false, false))
2831                                 return; // error
2832                         if (com_token[0] == '}')
2833                                 break; // end of entity
2834                         if (com_token[0] == '{')
2835                         {
2836                                 // brush
2837                                 if (firstbrush)
2838                                 {
2839                                         if (submodel)
2840                                         {
2841                                                 if (submodel > loadmodel->brush.numsubmodels)
2842                                                 {
2843                                                         Con_Printf("Mod_Q1BSP_LoadMapBrushes: .map has more submodels than .bsp!\n");
2844                                                         model = NULL;
2845                                                 }
2846                                                 else
2847                                                         model = loadmodel->brush.submodels[submodel];
2848                                         }
2849                                         else
2850                                                 model = loadmodel;
2851                                 }
2852                                 for (;;)
2853                                 {
2854                                         if (!COM_ParseToken_Simple(&data, false, false))
2855                                                 return; // error
2856                                         if (com_token[0] == '}')
2857                                                 break; // end of brush
2858                                         // each brush face should be this format:
2859                                         // ( x y z ) ( x y z ) ( x y z ) texture scroll_s scroll_t rotateangle scale_s scale_t
2860                                         // FIXME: support hl .map format
2861                                         for (pointnum = 0;pointnum < 3;pointnum++)
2862                                         {
2863                                                 COM_ParseToken_Simple(&data, false, false);
2864                                                 for (componentnum = 0;componentnum < 3;componentnum++)
2865                                                 {
2866                                                         COM_ParseToken_Simple(&data, false, false);
2867                                                         point[pointnum][componentnum] = atof(com_token);
2868                                                 }
2869                                                 COM_ParseToken_Simple(&data, false, false);
2870                                         }
2871                                         COM_ParseToken_Simple(&data, false, false);
2872                                         strlcpy(facetexture, com_token, sizeof(facetexture));
2873                                         COM_ParseToken_Simple(&data, false, false);
2874                                         //scroll_s = atof(com_token);
2875                                         COM_ParseToken_Simple(&data, false, false);
2876                                         //scroll_t = atof(com_token);
2877                                         COM_ParseToken_Simple(&data, false, false);
2878                                         //rotate = atof(com_token);
2879                                         COM_ParseToken_Simple(&data, false, false);
2880                                         //scale_s = atof(com_token);
2881                                         COM_ParseToken_Simple(&data, false, false);
2882                                         //scale_t = atof(com_token);
2883                                         TriangleNormal(point[0], point[1], point[2], planenormal);
2884                                         VectorNormalizeDouble(planenormal);
2885                                         planedist = DotProduct(point[0], planenormal);
2886                                         //ChooseTexturePlane(planenormal, texturevector[0], texturevector[1]);
2887                                 }
2888                                 continue;
2889                         }
2890                 }
2891         }
2892 #endif
2893 }
2894
2895
2896 #define MAX_PORTALPOINTS 64
2897
2898 typedef struct portal_s
2899 {
2900         mplane_t plane;
2901         mnode_t *nodes[2];              // [0] = front side of plane
2902         struct portal_s *next[2];
2903         int numpoints;
2904         double points[3*MAX_PORTALPOINTS];
2905         struct portal_s *chain; // all portals are linked into a list
2906 }
2907 portal_t;
2908
2909 static portal_t *portalchain;
2910
2911 /*
2912 ===========
2913 AllocPortal
2914 ===========
2915 */
2916 static portal_t *AllocPortal(void)
2917 {
2918         portal_t *p;
2919         p = (portal_t *)Mem_Alloc(loadmodel->mempool, sizeof(portal_t));
2920         p->chain = portalchain;
2921         portalchain = p;
2922         return p;
2923 }
2924
2925 static void FreePortal(portal_t *p)
2926 {
2927         Mem_Free(p);
2928 }
2929
2930 static void Mod_Q1BSP_RecursiveRecalcNodeBBox(mnode_t *node)
2931 {
2932         // process only nodes (leafs already had their box calculated)
2933         if (!node->plane)
2934                 return;
2935
2936         // calculate children first
2937         Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[0]);
2938         Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[1]);
2939
2940         // make combined bounding box from children
2941         node->mins[0] = min(node->children[0]->mins[0], node->children[1]->mins[0]);
2942         node->mins[1] = min(node->children[0]->mins[1], node->children[1]->mins[1]);
2943         node->mins[2] = min(node->children[0]->mins[2], node->children[1]->mins[2]);
2944         node->maxs[0] = max(node->children[0]->maxs[0], node->children[1]->maxs[0]);
2945         node->maxs[1] = max(node->children[0]->maxs[1], node->children[1]->maxs[1]);
2946         node->maxs[2] = max(node->children[0]->maxs[2], node->children[1]->maxs[2]);
2947 }
2948
2949 static void Mod_Q1BSP_FinalizePortals(void)
2950 {
2951         int i, j, numportals, numpoints;
2952         portal_t *p, *pnext;
2953         mportal_t *portal;
2954         mvertex_t *point;
2955         mleaf_t *leaf, *endleaf;
2956
2957         // tally up portal and point counts and recalculate bounding boxes for all
2958         // leafs (because qbsp is very sloppy)
2959         leaf = loadmodel->brush.data_leafs;
2960         endleaf = leaf + loadmodel->brush.num_leafs;
2961         for (;leaf < endleaf;leaf++)
2962         {
2963                 VectorSet(leaf->mins,  2000000000,  2000000000,  2000000000);
2964                 VectorSet(leaf->maxs, -2000000000, -2000000000, -2000000000);
2965         }
2966         p = portalchain;
2967         numportals = 0;
2968         numpoints = 0;
2969         while (p)
2970         {
2971                 // note: this check must match the one below or it will usually corrupt memory
2972                 // 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
2973                 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1] && ((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
2974                 {
2975                         numportals += 2;
2976                         numpoints += p->numpoints * 2;
2977                 }
2978                 p = p->chain;
2979         }
2980         loadmodel->brush.data_portals = (mportal_t *)Mem_Alloc(loadmodel->mempool, numportals * sizeof(mportal_t) + numpoints * sizeof(mvertex_t));
2981         loadmodel->brush.num_portals = numportals;
2982         loadmodel->brush.data_portalpoints = (mvertex_t *)((unsigned char *) loadmodel->brush.data_portals + numportals * sizeof(mportal_t));
2983         loadmodel->brush.num_portalpoints = numpoints;
2984         // clear all leaf portal chains
2985         for (i = 0;i < loadmodel->brush.num_leafs;i++)
2986                 loadmodel->brush.data_leafs[i].portals = NULL;
2987         // process all portals in the global portal chain, while freeing them
2988         portal = loadmodel->brush.data_portals;
2989         point = loadmodel->brush.data_portalpoints;
2990         p = portalchain;
2991         portalchain = NULL;
2992         while (p)
2993         {
2994                 pnext = p->chain;
2995
2996                 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1])
2997                 {
2998                         // note: this check must match the one above or it will usually corrupt memory
2999                         // 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
3000                         if (((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
3001                         {
3002                                 // first make the back to front portal(forward portal)
3003                                 portal->points = point;
3004                                 portal->numpoints = p->numpoints;
3005                                 portal->plane.dist = p->plane.dist;
3006                                 VectorCopy(p->plane.normal, portal->plane.normal);
3007                                 portal->here = (mleaf_t *)p->nodes[1];
3008                                 portal->past = (mleaf_t *)p->nodes[0];
3009                                 // copy points
3010                                 for (j = 0;j < portal->numpoints;j++)
3011                                 {
3012                                         VectorCopy(p->points + j*3, point->position);
3013                                         point++;
3014                                 }
3015                                 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3016                                 PlaneClassify(&portal->plane);
3017
3018                                 // link into leaf's portal chain
3019                                 portal->next = portal->here->portals;
3020                                 portal->here->portals = portal;
3021
3022                                 // advance to next portal
3023                                 portal++;
3024
3025                                 // then make the front to back portal(backward portal)
3026                                 portal->points = point;
3027                                 portal->numpoints = p->numpoints;
3028                                 portal->plane.dist = -p->plane.dist;
3029                                 VectorNegate(p->plane.normal, portal->plane.normal);
3030                                 portal->here = (mleaf_t *)p->nodes[0];
3031                                 portal->past = (mleaf_t *)p->nodes[1];
3032                                 // copy points
3033                                 for (j = portal->numpoints - 1;j >= 0;j--)
3034                                 {
3035                                         VectorCopy(p->points + j*3, point->position);
3036                                         point++;
3037                                 }
3038                                 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3039                                 PlaneClassify(&portal->plane);
3040
3041                                 // link into leaf's portal chain
3042                                 portal->next = portal->here->portals;
3043                                 portal->here->portals = portal;
3044
3045                                 // advance to next portal
3046                                 portal++;
3047                         }
3048                         // add the portal's polygon points to the leaf bounding boxes
3049                         for (i = 0;i < 2;i++)
3050                         {
3051                                 leaf = (mleaf_t *)p->nodes[i];
3052                                 for (j = 0;j < p->numpoints;j++)
3053                                 {
3054                                         if (leaf->mins[0] > p->points[j*3+0]) leaf->mins[0] = p->points[j*3+0];
3055                                         if (leaf->mins[1] > p->points[j*3+1]) leaf->mins[1] = p->points[j*3+1];
3056                                         if (leaf->mins[2] > p->points[j*3+2]) leaf->mins[2] = p->points[j*3+2];
3057                                         if (leaf->maxs[0] < p->points[j*3+0]) leaf->maxs[0] = p->points[j*3+0];
3058                                         if (leaf->maxs[1] < p->points[j*3+1]) leaf->maxs[1] = p->points[j*3+1];
3059                                         if (leaf->maxs[2] < p->points[j*3+2]) leaf->maxs[2] = p->points[j*3+2];
3060                                 }
3061                         }
3062                 }
3063                 FreePortal(p);
3064                 p = pnext;
3065         }
3066         // now recalculate the node bounding boxes from the leafs
3067         Mod_Q1BSP_RecursiveRecalcNodeBBox(loadmodel->brush.data_nodes);
3068 }
3069
3070 /*
3071 =============
3072 AddPortalToNodes
3073 =============
3074 */
3075 static void AddPortalToNodes(portal_t *p, mnode_t *front, mnode_t *back)
3076 {
3077         if (!front)
3078                 Host_Error("AddPortalToNodes: NULL front node");
3079         if (!back)
3080                 Host_Error("AddPortalToNodes: NULL back node");
3081         if (p->nodes[0] || p->nodes[1])
3082                 Host_Error("AddPortalToNodes: already included");
3083         // 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
3084
3085         p->nodes[0] = front;
3086         p->next[0] = (portal_t *)front->portals;
3087         front->portals = (mportal_t *)p;
3088
3089         p->nodes[1] = back;
3090         p->next[1] = (portal_t *)back->portals;
3091         back->portals = (mportal_t *)p;
3092 }
3093
3094 /*
3095 =============
3096 RemovePortalFromNode
3097 =============
3098 */
3099 static void RemovePortalFromNodes(portal_t *portal)
3100 {
3101         int i;
3102         mnode_t *node;
3103         void **portalpointer;
3104         portal_t *t;
3105         for (i = 0;i < 2;i++)
3106         {
3107                 node = portal->nodes[i];
3108
3109                 portalpointer = (void **) &node->portals;
3110                 while (1)
3111                 {
3112                         t = (portal_t *)*portalpointer;
3113                         if (!t)
3114                                 Host_Error("RemovePortalFromNodes: portal not in leaf");
3115
3116                         if (t == portal)
3117                         {
3118                                 if (portal->nodes[0] == node)
3119                                 {
3120                                         *portalpointer = portal->next[0];
3121                                         portal->nodes[0] = NULL;
3122                                 }
3123                                 else if (portal->nodes[1] == node)
3124                                 {
3125                                         *portalpointer = portal->next[1];
3126                                         portal->nodes[1] = NULL;
3127                                 }
3128                                 else
3129                                         Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3130                                 break;
3131                         }
3132
3133                         if (t->nodes[0] == node)
3134                                 portalpointer = (void **) &t->next[0];
3135                         else if (t->nodes[1] == node)
3136                                 portalpointer = (void **) &t->next[1];
3137                         else
3138                                 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3139                 }
3140         }
3141 }
3142
3143 #define PORTAL_DIST_EPSILON (1.0 / 32.0)
3144 static void Mod_Q1BSP_RecursiveNodePortals(mnode_t *node)
3145 {
3146         int i, side;
3147         mnode_t *front, *back, *other_node;
3148         mplane_t clipplane, *plane;
3149         portal_t *portal, *nextportal, *nodeportal, *splitportal, *temp;
3150         int numfrontpoints, numbackpoints;
3151         double frontpoints[3*MAX_PORTALPOINTS], backpoints[3*MAX_PORTALPOINTS];
3152
3153         // if a leaf, we're done
3154         if (!node->plane)
3155                 return;
3156
3157         plane = node->plane;
3158
3159         front = node->children[0];
3160         back = node->children[1];
3161         if (front == back)
3162                 Host_Error("Mod_Q1BSP_RecursiveNodePortals: corrupt node hierarchy");
3163
3164         // create the new portal by generating a polygon for the node plane,
3165         // and clipping it by all of the other portals(which came from nodes above this one)
3166         nodeportal = AllocPortal();
3167         nodeportal->plane = *plane;
3168
3169         // TODO: calculate node bounding boxes during recursion and calculate a maximum plane size accordingly to improve precision (as most maps do not need 1 billion unit plane polygons)
3170         PolygonD_QuadForPlane(nodeportal->points, nodeportal->plane.normal[0], nodeportal->plane.normal[1], nodeportal->plane.normal[2], nodeportal->plane.dist, 1024.0*1024.0*1024.0);
3171         nodeportal->numpoints = 4;
3172         side = 0;       // shut up compiler warning
3173         for (portal = (portal_t *)node->portals;portal;portal = portal->next[side])
3174         {
3175                 clipplane = portal->plane;
3176                 if (portal->nodes[0] == portal->nodes[1])
3177                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(1)");
3178                 if (portal->nodes[0] == node)
3179                         side = 0;
3180                 else if (portal->nodes[1] == node)
3181                 {
3182                         clipplane.dist = -clipplane.dist;
3183                         VectorNegate(clipplane.normal, clipplane.normal);
3184                         side = 1;
3185                 }
3186                 else
3187                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3188
3189                 for (i = 0;i < nodeportal->numpoints*3;i++)
3190                         frontpoints[i] = nodeportal->points[i];
3191                 PolygonD_Divide(nodeportal->numpoints, frontpoints, clipplane.normal[0], clipplane.normal[1], clipplane.normal[2], clipplane.dist, PORTAL_DIST_EPSILON, MAX_PORTALPOINTS, nodeportal->points, &nodeportal->numpoints, 0, NULL, NULL, NULL);
3192                 if (nodeportal->numpoints <= 0 || nodeportal->numpoints >= MAX_PORTALPOINTS)
3193                         break;
3194         }
3195
3196         if (nodeportal->numpoints < 3)
3197         {
3198                 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal was clipped away\n");
3199                 nodeportal->numpoints = 0;
3200         }
3201         else if (nodeportal->numpoints >= MAX_PORTALPOINTS)
3202         {
3203                 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal has too many points\n");
3204                 nodeportal->numpoints = 0;
3205         }
3206
3207         AddPortalToNodes(nodeportal, front, back);
3208
3209         // split the portals of this node along this node's plane and assign them to the children of this node
3210         // (migrating the portals downward through the tree)
3211         for (portal = (portal_t *)node->portals;portal;portal = nextportal)
3212         {
3213                 if (portal->nodes[0] == portal->nodes[1])
3214                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(2)");
3215                 if (portal->nodes[0] == node)
3216                         side = 0;
3217                 else if (portal->nodes[1] == node)
3218                         side = 1;
3219                 else
3220                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3221                 nextportal = portal->next[side];
3222                 if (!portal->numpoints)
3223                         continue;
3224
3225                 other_node = portal->nodes[!side];
3226                 RemovePortalFromNodes(portal);
3227
3228                 // cut the portal into two portals, one on each side of the node plane
3229                 PolygonD_Divide(portal->numpoints, portal->points, plane->normal[0], plane->normal[1], plane->normal[2], plane->dist, PORTAL_DIST_EPSILON, MAX_PORTALPOINTS, frontpoints, &numfrontpoints, MAX_PORTALPOINTS, backpoints, &numbackpoints, NULL);
3230
3231                 if (!numfrontpoints)
3232                 {
3233                         if (side == 0)
3234                                 AddPortalToNodes(portal, back, other_node);
3235                         else
3236                                 AddPortalToNodes(portal, other_node, back);
3237                         continue;
3238                 }
3239                 if (!numbackpoints)
3240                 {
3241                         if (side == 0)
3242                                 AddPortalToNodes(portal, front, other_node);
3243                         else
3244                                 AddPortalToNodes(portal, other_node, front);
3245                         continue;
3246                 }
3247
3248                 // the portal is split
3249                 splitportal = AllocPortal();
3250                 temp = splitportal->chain;
3251                 *splitportal = *portal;
3252                 splitportal->chain = temp;
3253                 for (i = 0;i < numbackpoints*3;i++)
3254                         splitportal->points[i] = backpoints[i];
3255                 splitportal->numpoints = numbackpoints;
3256                 for (i = 0;i < numfrontpoints*3;i++)
3257                         portal->points[i] = frontpoints[i];
3258                 portal->numpoints = numfrontpoints;
3259
3260                 if (side == 0)
3261                 {
3262                         AddPortalToNodes(portal, front, other_node);
3263                         AddPortalToNodes(splitportal, back, other_node);
3264                 }
3265                 else
3266                 {
3267                         AddPortalToNodes(portal, other_node, front);
3268                         AddPortalToNodes(splitportal, other_node, back);
3269                 }
3270         }
3271
3272         Mod_Q1BSP_RecursiveNodePortals(front);
3273         Mod_Q1BSP_RecursiveNodePortals(back);
3274 }
3275
3276 static void Mod_Q1BSP_MakePortals(void)
3277 {
3278         portalchain = NULL;
3279         Mod_Q1BSP_RecursiveNodePortals(loadmodel->brush.data_nodes);
3280         Mod_Q1BSP_FinalizePortals();
3281 }
3282
3283 //Returns PVS data for a given point
3284 //(note: can return NULL)
3285 static unsigned char *Mod_Q1BSP_GetPVS(dp_model_t *model, const vec3_t p)
3286 {
3287         mnode_t *node;
3288         node = model->brush.data_nodes;
3289         while (node->plane)
3290                 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
3291         if (((mleaf_t *)node)->clusterindex >= 0)
3292                 return model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3293         else
3294                 return NULL;
3295 }
3296
3297 static void Mod_Q1BSP_FatPVS_RecursiveBSPNode(dp_model_t *model, const vec3_t org, vec_t radius, unsigned char *pvsbuffer, int pvsbytes, mnode_t *node)
3298 {
3299         while (node->plane)
3300         {
3301                 float d = PlaneDiff(org, node->plane);
3302                 if (d > radius)
3303                         node = node->children[0];
3304                 else if (d < -radius)
3305                         node = node->children[1];
3306                 else
3307                 {
3308                         // go down both sides
3309                         Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, pvsbytes, node->children[0]);
3310                         node = node->children[1];
3311                 }
3312         }
3313         // if this leaf is in a cluster, accumulate the pvs bits
3314         if (((mleaf_t *)node)->clusterindex >= 0)
3315         {
3316                 int i;
3317                 unsigned char *pvs = model->brush.data_pvsclusters