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