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