remove prvm_boundscheck cvar (security hole) and force bounds check on unless DP...
[divverent/darkplaces.git] / model_brush.c
1 /*
2 Copyright (C) 1996-1997 Id Software, Inc.
3
4 This program is free software; you can redistribute it and/or
5 modify it under the terms of the GNU General Public License
6 as published by the Free Software Foundation; either version 2
7 of the License, or (at your option) any later version.
8
9 This program is distributed in the hope that it will be useful,
10 but WITHOUT ANY WARRANTY; without even the implied warranty of
11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
12
13 See the GNU General Public License for more details.
14
15 You should have received a copy of the GNU General Public License
16 along with this program; if not, write to the Free Software
17 Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
18
19 */
20
21 #include "quakedef.h"
22 #include "image.h"
23 #include "r_shadow.h"
24 #include "polygon.h"
25 #include "curves.h"
26 #include "wad.h"
27
28
29 //cvar_t r_subdivide_size = {CVAR_SAVE, "r_subdivide_size", "128", "how large water polygons should be (smaller values produce more polygons which give better warping effects)"};
30 cvar_t halflifebsp = {0, "halflifebsp", "0", "indicates the current map is hlbsp format (useful to know because of different bounding box sizes)"};
31 cvar_t 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         mplane_t *plane;
787         mclipnode_t *nodes = t->hull->clipnodes;
788         mplane_t *planes = t->hull->planes;
789         vec3_t point;
790         VectorCopy(t->start, point);
791         while (num >= 0)
792         {
793                 plane = planes + nodes[num].planenum;
794                 num = nodes[num].children[(plane->type < 3 ? point[plane->type] : DotProduct(plane->normal, point)) < plane->dist];
795         }
796         num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
797         t->trace->startsupercontents |= num;
798         if (num & SUPERCONTENTS_LIQUIDSMASK)
799                 t->trace->inwater = true;
800         if (num == 0)
801                 t->trace->inopen = true;
802         if (num & t->trace->hitsupercontentsmask)
803         {
804                 t->trace->allsolid = t->trace->startsolid = true;
805                 return HULLCHECKSTATE_SOLID;
806         }
807         else
808         {
809                 t->trace->allsolid = t->trace->startsolid = false;
810                 return HULLCHECKSTATE_EMPTY;
811         }
812 }
813 //#endif
814
815 static void Mod_Q1BSP_TraceBox(struct model_s *model, int frame, trace_t *trace, const vec3_t start, const vec3_t boxmins, const vec3_t boxmaxs, const vec3_t end, int hitsupercontentsmask)
816 {
817         // this function currently only supports same size start and end
818         double boxsize[3];
819         RecursiveHullCheckTraceInfo_t rhc;
820
821         memset(&rhc, 0, sizeof(rhc));
822         memset(trace, 0, sizeof(trace_t));
823         rhc.trace = trace;
824         rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
825         rhc.trace->fraction = 1;
826         rhc.trace->realfraction = 1;
827         rhc.trace->allsolid = true;
828         VectorSubtract(boxmaxs, boxmins, boxsize);
829         if (boxsize[0] < 3)
830                 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
831         else if (model->brush.ismcbsp)
832         {
833                 int i;
834                 float vdist, dist;
835                 int vdisti = 0;
836
837                 vdist = 0;      // shut up compiler warning
838
839         // find the closest hull size (this algorithm probably sucks, a qc field to override it might be in order...)
840                 for (i = 1; i < model->brushq1.numhulls; i++)
841                 {
842                         dist = fabs(model->brushq1.hulls[i].clip_size[0] - boxsize[0]) +
843                                         fabs(model->brushq1.hulls[i].clip_size[1] - boxsize[1]) +
844                                         fabs(model->brushq1.hulls[i].clip_size[2] - boxsize[2]) * 0.25;
845
846                         if (!vdisti || dist < vdist)
847                         {
848                                 vdisti = i;
849                                 vdist = dist;
850                         }
851                 }
852                 rhc.hull = &model->brushq1.hulls[vdisti];
853         }
854         else if (model->brush.ishlbsp)
855         {
856                 // LordHavoc: this has to have a minor tolerance (the .1) because of
857                 // minor float precision errors from the box being transformed around
858                 if (boxsize[0] < 32.1)
859                 {
860                         if (boxsize[2] < 54) // pick the nearest of 36 or 72
861                                 rhc.hull = &model->brushq1.hulls[3]; // 32x32x36
862                         else
863                                 rhc.hull = &model->brushq1.hulls[1]; // 32x32x72
864                 }
865                 else
866                         rhc.hull = &model->brushq1.hulls[2]; // 64x64x64
867         }
868         else
869         {
870                 // LordHavoc: this has to have a minor tolerance (the .1) because of
871                 // minor float precision errors from the box being transformed around
872                 if (boxsize[0] < 32.1)
873                         rhc.hull = &model->brushq1.hulls[1]; // 32x32x56
874                 else
875                         rhc.hull = &model->brushq1.hulls[2]; // 64x64x88
876         }
877         VectorMAMAM(1, start, 1, boxmins, -1, rhc.hull->clip_mins, rhc.start);
878         VectorMAMAM(1, end, 1, boxmins, -1, rhc.hull->clip_mins, rhc.end);
879         VectorSubtract(rhc.end, rhc.start, rhc.dist);
880 #if COLLISIONPARANOID >= 2
881         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]);
882         Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
883         {
884
885                 double test[3];
886                 trace_t testtrace;
887                 VectorLerp(rhc.start, rhc.trace->fraction, rhc.end, test);
888                 memset(&testtrace, 0, sizeof(trace_t));
889                 rhc.trace = &testtrace;
890                 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
891                 rhc.trace->fraction = 1;
892                 rhc.trace->realfraction = 1;
893                 rhc.trace->allsolid = true;
894                 VectorCopy(test, rhc.start);
895                 VectorCopy(test, rhc.end);
896                 VectorClear(rhc.dist);
897                 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
898                 //Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, test, test);
899                 if (!trace->startsolid && testtrace.startsolid)
900                         Con_Printf(" - ended in solid!\n");
901         }
902         Con_Print("\n");
903 #else
904         if (VectorLength2(rhc.dist))
905                 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
906         else
907                 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
908 #endif
909 }
910
911 static int Mod_Q1BSP_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
912 {
913         int num = 0;
914         mplane_t *plane;
915         mclipnode_t *nodes = model->brushq1.hulls[0].clipnodes;
916         mplane_t *planes = model->brushq1.hulls[0].planes;
917         while (num >= 0)
918         {
919                 plane = planes + nodes[num].planenum;
920                 num = nodes[num].children[(plane->type < 3 ? point[plane->type] : DotProduct(plane->normal, point)) < plane->dist];
921         }
922         return Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
923 }
924
925 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)
926 {
927 #if 1
928         colbrushf_t cbox;
929         colplanef_t cbox_planes[6];
930         cbox.supercontents = boxsupercontents;
931         cbox.numplanes = 6;
932         cbox.numpoints = 0;
933         cbox.numtriangles = 0;
934         cbox.planes = cbox_planes;
935         cbox.points = NULL;
936         cbox.elements = NULL;
937         cbox.markframe = 0;
938         cbox.mins[0] = 0;
939         cbox.mins[1] = 0;
940         cbox.mins[2] = 0;
941         cbox.maxs[0] = 0;
942         cbox.maxs[1] = 0;
943         cbox.maxs[2] = 0;
944         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];
945         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];
946         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];
947         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];
948         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];
949         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];
950         cbox_planes[0].q3surfaceflags = boxq3surfaceflags;cbox_planes[0].texture = boxtexture;
951         cbox_planes[1].q3surfaceflags = boxq3surfaceflags;cbox_planes[1].texture = boxtexture;
952         cbox_planes[2].q3surfaceflags = boxq3surfaceflags;cbox_planes[2].texture = boxtexture;
953         cbox_planes[3].q3surfaceflags = boxq3surfaceflags;cbox_planes[3].texture = boxtexture;
954         cbox_planes[4].q3surfaceflags = boxq3surfaceflags;cbox_planes[4].texture = boxtexture;
955         cbox_planes[5].q3surfaceflags = boxq3surfaceflags;cbox_planes[5].texture = boxtexture;
956         memset(trace, 0, sizeof(trace_t));
957         trace->hitsupercontentsmask = hitsupercontentsmask;
958         trace->fraction = 1;
959         trace->realfraction = 1;
960         Collision_TraceLineBrushFloat(trace, start, end, &cbox, &cbox);
961 #else
962         RecursiveHullCheckTraceInfo_t rhc;
963         static hull_t box_hull;
964         static mclipnode_t box_clipnodes[6];
965         static mplane_t box_planes[6];
966         // fill in a default trace
967         memset(&rhc, 0, sizeof(rhc));
968         memset(trace, 0, sizeof(trace_t));
969         //To keep everything totally uniform, bounding boxes are turned into small
970         //BSP trees instead of being compared directly.
971         // create a temp hull from bounding box sizes
972         box_planes[0].dist = cmaxs[0] - mins[0];
973         box_planes[1].dist = cmins[0] - maxs[0];
974         box_planes[2].dist = cmaxs[1] - mins[1];
975         box_planes[3].dist = cmins[1] - maxs[1];
976         box_planes[4].dist = cmaxs[2] - mins[2];
977         box_planes[5].dist = cmins[2] - maxs[2];
978 #if COLLISIONPARANOID >= 3
979         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]);
980 #endif
981
982         if (box_hull.clipnodes == NULL)
983         {
984                 int i, side;
985
986                 //Set up the planes and clipnodes so that the six floats of a bounding box
987                 //can just be stored out and get a proper hull_t structure.
988
989                 box_hull.clipnodes = box_clipnodes;
990                 box_hull.planes = box_planes;
991                 box_hull.firstclipnode = 0;
992                 box_hull.lastclipnode = 5;
993
994                 for (i = 0;i < 6;i++)
995                 {
996                         box_clipnodes[i].planenum = i;
997
998                         side = i&1;
999
1000                         box_clipnodes[i].children[side] = CONTENTS_EMPTY;
1001                         if (i != 5)
1002                                 box_clipnodes[i].children[side^1] = i + 1;
1003                         else
1004                                 box_clipnodes[i].children[side^1] = CONTENTS_SOLID;
1005
1006                         box_planes[i].type = i>>1;
1007                         box_planes[i].normal[i>>1] = 1;
1008                 }
1009         }
1010
1011         // trace a line through the generated clipping hull
1012         //rhc.boxsupercontents = boxsupercontents;
1013         rhc.hull = &box_hull;
1014         rhc.trace = trace;
1015         rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
1016         rhc.trace->fraction = 1;
1017         rhc.trace->realfraction = 1;
1018         rhc.trace->allsolid = true;
1019         VectorCopy(start, rhc.start);
1020         VectorCopy(end, rhc.end);
1021         VectorSubtract(rhc.end, rhc.start, rhc.dist);
1022         Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
1023         //VectorMA(rhc.start, rhc.trace->fraction, rhc.dist, rhc.trace->endpos);
1024         if (rhc.trace->startsupercontents)
1025                 rhc.trace->startsupercontents = boxsupercontents;
1026 #endif
1027 }
1028
1029 static int Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(mnode_t *node, double p1[3], double p2[3])
1030 {
1031         double t1, t2;
1032         double midf, mid[3];
1033         int ret, side;
1034
1035         // check for empty
1036         while (node->plane)
1037         {
1038                 // find the point distances
1039                 mplane_t *plane = node->plane;
1040                 if (plane->type < 3)
1041                 {
1042                         t1 = p1[plane->type] - plane->dist;
1043                         t2 = p2[plane->type] - plane->dist;
1044                 }
1045                 else
1046                 {
1047                         t1 = DotProduct (plane->normal, p1) - plane->dist;
1048                         t2 = DotProduct (plane->normal, p2) - plane->dist;
1049                 }
1050
1051                 if (t1 < 0)
1052                 {
1053                         if (t2 < 0)
1054                         {
1055                                 node = node->children[1];
1056                                 continue;
1057                         }
1058                         side = 1;
1059                 }
1060                 else
1061                 {
1062                         if (t2 >= 0)
1063                         {
1064                                 node = node->children[0];
1065                                 continue;
1066                         }
1067                         side = 0;
1068                 }
1069
1070                 midf = t1 / (t1 - t2);
1071                 VectorLerp(p1, midf, p2, mid);
1072
1073                 // recurse both sides, front side first
1074                 // return 2 if empty is followed by solid (hit something)
1075                 // do not return 2 if both are solid or both empty,
1076                 // or if start is solid and end is empty
1077                 // as these degenerate cases usually indicate the eye is in solid and
1078                 // should see the target point anyway
1079                 ret = Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side    ], p1, mid);
1080                 if (ret != 0)
1081                         return ret;
1082                 ret = Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ^ 1], mid, p2);
1083                 if (ret != 1)
1084                         return ret;
1085                 return 2;
1086         }
1087         return ((mleaf_t *)node)->clusterindex < 0;
1088 }
1089
1090 static qboolean Mod_Q1BSP_TraceLineOfSight(struct model_s *model, const vec3_t start, const vec3_t end)
1091 {
1092         // this function currently only supports same size start and end
1093         double tracestart[3], traceend[3];
1094         VectorCopy(start, tracestart);
1095         VectorCopy(end, traceend);
1096         return Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(model->brush.data_nodes, tracestart, traceend) != 2;
1097 }
1098
1099 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)
1100 {
1101         int side;
1102         float front, back;
1103         float mid, distz = endz - startz;
1104
1105 loc0:
1106         if (!node->plane)
1107                 return false;           // didn't hit anything
1108
1109         switch (node->plane->type)
1110         {
1111         case PLANE_X:
1112                 node = node->children[x < node->plane->dist];
1113                 goto loc0;
1114         case PLANE_Y:
1115                 node = node->children[y < node->plane->dist];
1116                 goto loc0;
1117         case PLANE_Z:
1118                 side = startz < node->plane->dist;
1119                 if ((endz < node->plane->dist) == side)
1120                 {
1121                         node = node->children[side];
1122                         goto loc0;
1123                 }
1124                 // found an intersection
1125                 mid = node->plane->dist;
1126                 break;
1127         default:
1128                 back = front = x * node->plane->normal[0] + y * node->plane->normal[1];
1129                 front += startz * node->plane->normal[2];
1130                 back += endz * node->plane->normal[2];
1131                 side = front < node->plane->dist;
1132                 if ((back < node->plane->dist) == side)
1133                 {
1134                         node = node->children[side];
1135                         goto loc0;
1136                 }
1137                 // found an intersection
1138                 mid = startz + distz * (front - node->plane->dist) / (front - back);
1139                 break;
1140         }
1141
1142         // go down front side
1143         if (node->children[side]->plane && Mod_Q1BSP_LightPoint_RecursiveBSPNode(model, ambientcolor, diffusecolor, diffusenormal, node->children[side], x, y, startz, mid))
1144                 return true;    // hit something
1145         else
1146         {
1147                 // check for impact on this node
1148                 if (node->numsurfaces)
1149                 {
1150                         int i, dsi, dti, lmwidth, lmheight;
1151                         float ds, dt;
1152                         msurface_t *surface;
1153                         unsigned char *lightmap;
1154                         int maps, line3, size3;
1155                         float dsfrac;
1156                         float dtfrac;
1157                         float scale, w, w00, w01, w10, w11;
1158
1159                         surface = model->data_surfaces + node->firstsurface;
1160                         for (i = 0;i < node->numsurfaces;i++, surface++)
1161                         {
1162                                 if (!(surface->texture->basematerialflags & MATERIALFLAG_WALL) || !surface->lightmapinfo->samples)
1163                                         continue;       // no lightmaps
1164
1165                                 // location we want to sample in the lightmap
1166                                 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;
1167                                 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;
1168
1169                                 // check the bounds
1170                                 dsi = (int)ds;
1171                                 dti = (int)dt;
1172                                 lmwidth = ((surface->lightmapinfo->extents[0]>>4)+1);
1173                                 lmheight = ((surface->lightmapinfo->extents[1]>>4)+1);
1174
1175                                 // is it in bounds?
1176                                 if (dsi >= 0 && dsi < lmwidth-1 && dti >= 0 && dti < lmheight-1)
1177                                 {
1178                                         // calculate bilinear interpolation factors
1179                                         // and also multiply by fixedpoint conversion factors
1180                                         dsfrac = ds - dsi;
1181                                         dtfrac = dt - dti;
1182                                         w00 = (1 - dsfrac) * (1 - dtfrac) * (1.0f / 32768.0f);
1183                                         w01 = (    dsfrac) * (1 - dtfrac) * (1.0f / 32768.0f);
1184                                         w10 = (1 - dsfrac) * (    dtfrac) * (1.0f / 32768.0f);
1185                                         w11 = (    dsfrac) * (    dtfrac) * (1.0f / 32768.0f);
1186
1187                                         // values for pointer math
1188                                         line3 = lmwidth * 3; // LordHavoc: *3 for colored lighting
1189                                         size3 = lmwidth * lmheight * 3; // LordHavoc: *3 for colored lighting
1190
1191                                         // look up the pixel
1192                                         lightmap = surface->lightmapinfo->samples + dti * line3 + dsi*3; // LordHavoc: *3 for colored lighting
1193
1194                                         // bilinear filter each lightmap style, and sum them
1195                                         for (maps = 0;maps < MAXLIGHTMAPS && surface->lightmapinfo->styles[maps] != 255;maps++)
1196                                         {
1197                                                 scale = r_refdef.scene.lightstylevalue[surface->lightmapinfo->styles[maps]];
1198                                                 w = w00 * scale;VectorMA(ambientcolor, w, lightmap            , ambientcolor);
1199                                                 w = w01 * scale;VectorMA(ambientcolor, w, lightmap + 3        , ambientcolor);
1200                                                 w = w10 * scale;VectorMA(ambientcolor, w, lightmap + line3    , ambientcolor);
1201                                                 w = w11 * scale;VectorMA(ambientcolor, w, lightmap + line3 + 3, ambientcolor);
1202                                                 lightmap += size3;
1203                                         }
1204
1205                                         return true; // success
1206                                 }
1207                         }
1208                 }
1209
1210                 // go down back side
1211                 node = node->children[side ^ 1];
1212                 startz = mid;
1213                 distz = endz - startz;
1214                 goto loc0;
1215         }
1216 }
1217
1218 void Mod_Q1BSP_LightPoint(model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
1219 {
1220         // pretend lighting is coming down from above (due to lack of a lightgrid to know primary lighting direction)
1221         VectorSet(diffusenormal, 0, 0, 1);
1222
1223         if (!model->brushq1.lightdata)
1224         {
1225                 VectorSet(ambientcolor, 1, 1, 1);
1226                 VectorSet(diffusecolor, 0, 0, 0);
1227                 return;
1228         }
1229
1230         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);
1231 }
1232
1233 static void Mod_Q1BSP_DecompressVis(const unsigned char *in, const unsigned char *inend, unsigned char *out, unsigned char *outend)
1234 {
1235         int c;
1236         unsigned char *outstart = out;
1237         while (out < outend)
1238         {
1239                 if (in == inend)
1240                 {
1241                         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));
1242                         return;
1243                 }
1244                 c = *in++;
1245                 if (c)
1246                         *out++ = c;
1247                 else
1248                 {
1249                         if (in == inend)
1250                         {
1251                                 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));
1252                                 return;
1253                         }
1254                         for (c = *in++;c > 0;c--)
1255                         {
1256                                 if (out == outend)
1257                                 {
1258                                         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));
1259                                         return;
1260                                 }
1261                                 *out++ = 0;
1262                         }
1263                 }
1264         }
1265 }
1266
1267 /*
1268 =============
1269 R_Q1BSP_LoadSplitSky
1270
1271 A sky texture is 256*128, with the right side being a masked overlay
1272 ==============
1273 */
1274 void R_Q1BSP_LoadSplitSky (unsigned char *src, int width, int height, int bytesperpixel)
1275 {
1276         int i, j;
1277         unsigned solidpixels[128*128], alphapixels[128*128];
1278
1279         // allocate a texture pool if we need it
1280         if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
1281                 loadmodel->texturepool = R_AllocTexturePool();
1282
1283         if (bytesperpixel == 4)
1284         {
1285                 for (i = 0;i < 128;i++)
1286                 {
1287                         for (j = 0;j < 128;j++)
1288                         {
1289                                 solidpixels[(i*128) + j] = ((unsigned *)src)[i*256+j+128];
1290                                 alphapixels[(i*128) + j] = ((unsigned *)src)[i*256+j];
1291                         }
1292                 }
1293         }
1294         else
1295         {
1296                 // make an average value for the back to avoid
1297                 // a fringe on the top level
1298                 int p, r, g, b;
1299                 union
1300                 {
1301                         unsigned int i;
1302                         unsigned char b[4];
1303                 }
1304                 bgra;
1305                 r = g = b = 0;
1306                 for (i = 0;i < 128;i++)
1307                 {
1308                         for (j = 0;j < 128;j++)
1309                         {
1310                                 p = src[i*256 + j + 128];
1311                                 r += palette_rgb[p][0];
1312                                 g += palette_rgb[p][1];
1313                                 b += palette_rgb[p][2];
1314                         }
1315                 }
1316                 bgra.b[2] = r/(128*128);
1317                 bgra.b[1] = g/(128*128);
1318                 bgra.b[0] = b/(128*128);
1319                 bgra.b[3] = 0;
1320                 for (i = 0;i < 128;i++)
1321                 {
1322                         for (j = 0;j < 128;j++)
1323                         {
1324                                 solidpixels[(i*128) + j] = palette_bgra_complete[src[i*256 + j + 128]];
1325                                 p = src[i*256 + j];
1326                                 alphapixels[(i*128) + j] = p ? palette_bgra_complete[p] : bgra.i;
1327                         }
1328                 }
1329         }
1330
1331         loadmodel->brush.solidskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_solidtexture", 128, 128, (unsigned char *) solidpixels, TEXTYPE_BGRA, TEXF_PRECACHE, NULL);
1332         loadmodel->brush.alphaskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_alphatexture", 128, 128, (unsigned char *) alphapixels, TEXTYPE_BGRA, TEXF_ALPHA | TEXF_PRECACHE, NULL);
1333 }
1334
1335 static void Mod_Q1BSP_LoadTextures(lump_t *l)
1336 {
1337         int i, j, k, num, max, altmax, mtwidth, mtheight, *dofs, incomplete;
1338         skinframe_t *skinframe;
1339         miptex_t *dmiptex;
1340         texture_t *tx, *tx2, *anims[10], *altanims[10];
1341         dmiptexlump_t *m;
1342         unsigned char *data, *mtdata;
1343         const char *s;
1344         char mapname[MAX_QPATH], name[MAX_QPATH];
1345
1346         loadmodel->data_textures = NULL;
1347
1348         // add two slots for notexture walls and notexture liquids
1349         if (l->filelen)
1350         {
1351                 m = (dmiptexlump_t *)(mod_base + l->fileofs);
1352                 m->nummiptex = LittleLong (m->nummiptex);
1353                 loadmodel->num_textures = m->nummiptex + 2;
1354                 loadmodel->num_texturesperskin = loadmodel->num_textures;
1355         }
1356         else
1357         {
1358                 m = NULL;
1359                 loadmodel->num_textures = 2;
1360                 loadmodel->num_texturesperskin = loadmodel->num_textures;
1361         }
1362
1363         loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_textures * sizeof(texture_t));
1364
1365         // fill out all slots with notexture
1366         if (cls.state != ca_dedicated)
1367                 skinframe = R_SkinFrame_LoadMissing();
1368         else
1369                 skinframe = NULL;
1370         for (i = 0, tx = loadmodel->data_textures;i < loadmodel->num_textures;i++, tx++)
1371         {
1372                 strlcpy(tx->name, "NO TEXTURE FOUND", sizeof(tx->name));
1373                 tx->width = 16;
1374                 tx->height = 16;
1375                 if (cls.state != ca_dedicated)
1376                 {
1377                         tx->numskinframes = 1;
1378                         tx->skinframerate = 1;
1379                         tx->skinframes[0] = skinframe;
1380                         tx->currentskinframe = tx->skinframes[0];
1381                         tx->basematerialflags = 0;
1382                 }
1383                 if (i == loadmodel->num_textures - 1)
1384                 {
1385                         tx->basematerialflags |= MATERIALFLAG_WATER | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1386                         tx->supercontents = mod_q1bsp_texture_water.supercontents;
1387                         tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1388                 }
1389                 else
1390                 {
1391                         tx->basematerialflags |= MATERIALFLAG_WALL;
1392                         tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1393                         tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1394                 }
1395                 tx->currentframe = tx;
1396
1397                 // clear water settings
1398                 tx->reflectmin = 0;
1399                 tx->reflectmax = 1;
1400                 tx->refractfactor = 1;
1401                 Vector4Set(tx->refractcolor4f, 1, 1, 1, 1);
1402                 tx->reflectfactor = 1;
1403                 Vector4Set(tx->reflectcolor4f, 1, 1, 1, 1);
1404         }
1405
1406         if (!m)
1407         {
1408                 Con_Printf("%s: no miptex lump to load textures from\n", loadmodel->name);
1409                 return;
1410         }
1411
1412         s = loadmodel->name;
1413         if (!strncasecmp(s, "maps/", 5))
1414                 s += 5;
1415         FS_StripExtension(s, mapname, sizeof(mapname));
1416
1417         // just to work around bounds checking when debugging with it (array index out of bounds error thing)
1418         dofs = m->dataofs;
1419         // LordHavoc: mostly rewritten map texture loader
1420         for (i = 0;i < m->nummiptex;i++)
1421         {
1422                 dofs[i] = LittleLong(dofs[i]);
1423                 if (r_nosurftextures.integer)
1424                         continue;
1425                 if (dofs[i] == -1)
1426                 {
1427                         Con_DPrintf("%s: miptex #%i missing\n", loadmodel->name, i);
1428                         continue;
1429                 }
1430                 dmiptex = (miptex_t *)((unsigned char *)m + dofs[i]);
1431
1432                 // copy name, but only up to 16 characters
1433                 // (the output buffer can hold more than this, but the input buffer is
1434                 //  only 16)
1435                 for (j = 0;dmiptex->name[j] && j < 16;j++)
1436                         name[j] = dmiptex->name[j];
1437                 name[j] = 0;
1438
1439                 if (!name[0])
1440                 {
1441                         sprintf(name, "unnamed%i", i);
1442                         Con_DPrintf("%s: warning: renaming unnamed texture to %s\n", loadmodel->name, name);
1443                 }
1444
1445                 mtwidth = LittleLong(dmiptex->width);
1446                 mtheight = LittleLong(dmiptex->height);
1447                 mtdata = NULL;
1448                 j = LittleLong(dmiptex->offsets[0]);
1449                 if (j)
1450                 {
1451                         // texture included
1452                         if (j < 40 || j + mtwidth * mtheight > l->filelen)
1453                         {
1454                                 Con_Printf("%s: Texture \"%s\" is corrupt or incomplete\n", loadmodel->name, dmiptex->name);
1455                                 continue;
1456                         }
1457                         mtdata = (unsigned char *)dmiptex + j;
1458                 }
1459
1460                 if ((mtwidth & 15) || (mtheight & 15))
1461                         Con_DPrintf("%s: warning: texture \"%s\" is not 16 aligned\n", loadmodel->name, dmiptex->name);
1462
1463                 // LordHavoc: force all names to lowercase
1464                 for (j = 0;name[j];j++)
1465                         if (name[j] >= 'A' && name[j] <= 'Z')
1466                                 name[j] += 'a' - 'A';
1467
1468                 if (dmiptex->name[0] && Mod_LoadTextureFromQ3Shader(loadmodel->data_textures + i, name, true, false, false))
1469                         continue;
1470
1471                 tx = loadmodel->data_textures + i;
1472                 strlcpy(tx->name, name, sizeof(tx->name));
1473                 tx->width = mtwidth;
1474                 tx->height = mtheight;
1475
1476                 if (tx->name[0] == '*')
1477                 {
1478                         if (!strncmp(tx->name, "*lava", 5))
1479                         {
1480                                 tx->supercontents = mod_q1bsp_texture_lava.supercontents;
1481                                 tx->surfaceflags = mod_q1bsp_texture_lava.surfaceflags;
1482                         }
1483                         else if (!strncmp(tx->name, "*slime", 6))
1484                         {
1485                                 tx->supercontents = mod_q1bsp_texture_slime.supercontents;
1486                                 tx->surfaceflags = mod_q1bsp_texture_slime.surfaceflags;
1487                         }
1488                         else
1489                         {
1490                                 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1491                                 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1492                         }
1493                 }
1494                 else if (!strncmp(tx->name, "sky", 3))
1495                 {
1496                         tx->supercontents = mod_q1bsp_texture_sky.supercontents;
1497                         tx->surfaceflags = mod_q1bsp_texture_sky.surfaceflags;
1498                 }
1499                 else
1500                 {
1501                         tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1502                         tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1503                 }
1504
1505                 if (cls.state != ca_dedicated)
1506                 {
1507                         // LordHavoc: HL sky textures are entirely different than quake
1508                         if (!loadmodel->brush.ishlbsp && !strncmp(tx->name, "sky", 3) && mtwidth == 256 && mtheight == 128)
1509                         {
1510                                 if (loadmodel->isworldmodel)
1511                                 {
1512                                         data = loadimagepixelsbgra(tx->name, false, false);
1513                                         if (data && image_width == 256 && image_height == 128)
1514                                         {
1515                                                 R_Q1BSP_LoadSplitSky(data, image_width, image_height, 4);
1516                                                 Mem_Free(data);
1517                                         }
1518                                         else if (mtdata != NULL)
1519                                                 R_Q1BSP_LoadSplitSky(mtdata, mtwidth, mtheight, 1);
1520                                 }
1521                         }
1522                         else
1523                         {
1524                                 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);
1525                                 if (!skinframe)
1526                                         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);
1527                                 if (!skinframe)
1528                                 {
1529                                         // did not find external texture, load it from the bsp or wad3
1530                                         if (loadmodel->brush.ishlbsp)
1531                                         {
1532                                                 // internal texture overrides wad
1533                                                 unsigned char *pixels, *freepixels;
1534                                                 pixels = freepixels = NULL;
1535                                                 if (mtdata)
1536                                                         pixels = W_ConvertWAD3TextureBGRA(dmiptex);
1537                                                 if (pixels == NULL)
1538                                                         pixels = freepixels = W_GetTextureBGRA(tx->name);
1539                                                 if (pixels != NULL)
1540                                                 {
1541                                                         tx->width = image_width;
1542                                                         tx->height = image_height;
1543                                                         skinframe = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0), pixels, image_width, image_height);
1544                                                 }
1545                                                 if (freepixels)
1546                                                         Mem_Free(freepixels);
1547                                         }
1548                                         else if (mtdata) // texture included
1549                                                 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);
1550                                 }
1551                                 // if skinframe is still NULL the "missing" texture will be used
1552                                 if (skinframe)
1553                                         tx->skinframes[0] = skinframe;
1554                         }
1555
1556                         tx->basematerialflags = 0;
1557                         if (tx->name[0] == '*')
1558                         {
1559                                 // LordHavoc: some turbulent textures should not be affected by wateralpha
1560                                 if (strncmp(tx->name,"*lava",5)
1561                                  && strncmp(tx->name,"*teleport",9)
1562                                  && strncmp(tx->name,"*rift",5)) // Scourge of Armagon texture
1563                                         tx->basematerialflags |= MATERIALFLAG_WATERALPHA | MATERIALFLAG_NOSHADOW | MATERIALFLAG_WATERSHADER;
1564                                 tx->basematerialflags |= MATERIALFLAG_WATER | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1565                         }
1566                         else if (!strncmp(tx->name, "sky", 3))
1567                                 tx->basematerialflags |= MATERIALFLAG_SKY | MATERIALFLAG_NOSHADOW;
1568                         else
1569                                 tx->basematerialflags |= MATERIALFLAG_WALL;
1570                         if (tx->skinframes[0] && tx->skinframes[0]->fog)
1571                                 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1572
1573                         // start out with no animation
1574                         tx->currentframe = tx;
1575                         tx->currentskinframe = tx->skinframes[0];
1576                 }
1577         }
1578
1579         // sequence the animations
1580         for (i = 0;i < m->nummiptex;i++)
1581         {
1582                 tx = loadmodel->data_textures + i;
1583                 if (!tx || tx->name[0] != '+' || tx->name[1] == 0 || tx->name[2] == 0)
1584                         continue;
1585                 if (tx->anim_total[0] || tx->anim_total[1])
1586                         continue;       // already sequenced
1587
1588                 // find the number of frames in the animation
1589                 memset(anims, 0, sizeof(anims));
1590                 memset(altanims, 0, sizeof(altanims));
1591
1592                 for (j = i;j < m->nummiptex;j++)
1593                 {
1594                         tx2 = loadmodel->data_textures + j;
1595                         if (!tx2 || tx2->name[0] != '+' || strcmp(tx2->name+2, tx->name+2))
1596                                 continue;
1597
1598                         num = tx2->name[1];
1599                         if (num >= '0' && num <= '9')
1600                                 anims[num - '0'] = tx2;
1601                         else if (num >= 'a' && num <= 'j')
1602                                 altanims[num - 'a'] = tx2;
1603                         else
1604                                 Con_Printf("Bad animating texture %s\n", tx->name);
1605                 }
1606
1607                 max = altmax = 0;
1608                 for (j = 0;j < 10;j++)
1609                 {
1610                         if (anims[j])
1611                                 max = j + 1;
1612                         if (altanims[j])
1613                                 altmax = j + 1;
1614                 }
1615                 //Con_Printf("linking animation %s (%i:%i frames)\n\n", tx->name, max, altmax);
1616
1617                 incomplete = false;
1618                 for (j = 0;j < max;j++)
1619                 {
1620                         if (!anims[j])
1621                         {
1622                                 Con_Printf("Missing frame %i of %s\n", j, tx->name);
1623                                 incomplete = true;
1624                         }
1625                 }
1626                 for (j = 0;j < altmax;j++)
1627                 {
1628                         if (!altanims[j])
1629                         {
1630                                 Con_Printf("Missing altframe %i of %s\n", j, tx->name);
1631                                 incomplete = true;
1632                         }
1633                 }
1634                 if (incomplete)
1635                         continue;
1636
1637                 if (altmax < 1)
1638                 {
1639                         // if there is no alternate animation, duplicate the primary
1640                         // animation into the alternate
1641                         altmax = max;
1642                         for (k = 0;k < 10;k++)
1643                                 altanims[k] = anims[k];
1644                 }
1645
1646                 // link together the primary animation
1647                 for (j = 0;j < max;j++)
1648                 {
1649                         tx2 = anims[j];
1650                         tx2->animated = true;
1651                         tx2->anim_total[0] = max;
1652                         tx2->anim_total[1] = altmax;
1653                         for (k = 0;k < 10;k++)
1654                         {
1655                                 tx2->anim_frames[0][k] = anims[k];
1656                                 tx2->anim_frames[1][k] = altanims[k];
1657                         }
1658                 }
1659
1660                 // if there really is an alternate anim...
1661                 if (anims[0] != altanims[0])
1662                 {
1663                         // link together the alternate animation
1664                         for (j = 0;j < altmax;j++)
1665                         {
1666                                 tx2 = altanims[j];
1667                                 tx2->animated = true;
1668                                 // the primary/alternate are reversed here
1669                                 tx2->anim_total[0] = altmax;
1670                                 tx2->anim_total[1] = max;
1671                                 for (k = 0;k < 10;k++)
1672                                 {
1673                                         tx2->anim_frames[0][k] = altanims[k];
1674                                         tx2->anim_frames[1][k] = anims[k];
1675                                 }
1676                         }
1677                 }
1678         }
1679 }
1680
1681 static void Mod_Q1BSP_LoadLighting(lump_t *l)
1682 {
1683         int i;
1684         unsigned char *in, *out, *data, d;
1685         char litfilename[MAX_QPATH];
1686         char dlitfilename[MAX_QPATH];
1687         fs_offset_t filesize;
1688         if (loadmodel->brush.ishlbsp) // LordHavoc: load the colored lighting data straight
1689         {
1690                 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1691                 for (i=0; i<l->filelen; i++)
1692                         loadmodel->brushq1.lightdata[i] = mod_base[l->fileofs+i] >>= 1;
1693         }
1694         else if (loadmodel->brush.ismcbsp)
1695         {
1696                 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1697                 memcpy(loadmodel->brushq1.lightdata, mod_base + l->fileofs, l->filelen);
1698         }
1699         else // LordHavoc: bsp version 29 (normal white lighting)
1700         {
1701                 // LordHavoc: hope is not lost yet, check for a .lit file to load
1702                 strlcpy (litfilename, loadmodel->name, sizeof (litfilename));
1703                 FS_StripExtension (litfilename, litfilename, sizeof (litfilename));
1704                 strlcpy (dlitfilename, litfilename, sizeof (dlitfilename));
1705                 strlcat (litfilename, ".lit", sizeof (litfilename));
1706                 strlcat (dlitfilename, ".dlit", sizeof (dlitfilename));
1707                 data = (unsigned char*) FS_LoadFile(litfilename, tempmempool, false, &filesize);
1708                 if (data)
1709                 {
1710                         if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1711                         {
1712                                 i = LittleLong(((int *)data)[1]);
1713                                 if (i == 1)
1714                                 {
1715                                         Con_DPrintf("loaded %s\n", litfilename);
1716                                         loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1717                                         memcpy(loadmodel->brushq1.lightdata, data + 8, filesize - 8);
1718                                         Mem_Free(data);
1719                                         data = (unsigned char*) FS_LoadFile(dlitfilename, tempmempool, false, &filesize);
1720                                         if (data)
1721                                         {
1722                                                 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1723                                                 {
1724                                                         i = LittleLong(((int *)data)[1]);
1725                                                         if (i == 1)
1726                                                         {
1727                                                                 Con_DPrintf("loaded %s\n", dlitfilename);
1728                                                                 loadmodel->brushq1.nmaplightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1729                                                                 memcpy(loadmodel->brushq1.nmaplightdata, data + 8, filesize - 8);
1730                                                                 loadmodel->brushq3.deluxemapping_modelspace = false;
1731                                                                 loadmodel->brushq3.deluxemapping = true;
1732                                                         }
1733                                                 }
1734                                                 Mem_Free(data);
1735                                                 data = NULL;
1736                                         }
1737                                         return;
1738                                 }
1739                                 else
1740                                         Con_Printf("Unknown .lit file version (%d)\n", i);
1741                         }
1742                         else if (filesize == 8)
1743                                 Con_Print("Empty .lit file, ignoring\n");
1744                         else
1745                                 Con_Printf("Corrupt .lit file (file size %i bytes, should be %i bytes), ignoring\n", (int) filesize, (int) (8 + l->filelen * 3));
1746                         if (data)
1747                         {
1748                                 Mem_Free(data);
1749                                 data = NULL;
1750                         }
1751                 }
1752                 // LordHavoc: oh well, expand the white lighting data
1753                 if (!l->filelen)
1754                         return;
1755                 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen*3);
1756                 in = mod_base + l->fileofs;
1757                 out = loadmodel->brushq1.lightdata;
1758                 for (i = 0;i < l->filelen;i++)
1759                 {
1760                         d = *in++;
1761                         *out++ = d;
1762                         *out++ = d;
1763                         *out++ = d;
1764                 }
1765         }
1766 }
1767
1768 static void Mod_Q1BSP_LoadVisibility(lump_t *l)
1769 {
1770         loadmodel->brushq1.num_compressedpvs = 0;
1771         loadmodel->brushq1.data_compressedpvs = NULL;
1772         if (!l->filelen)
1773                 return;
1774         loadmodel->brushq1.num_compressedpvs = l->filelen;
1775         loadmodel->brushq1.data_compressedpvs = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1776         memcpy(loadmodel->brushq1.data_compressedpvs, mod_base + l->fileofs, l->filelen);
1777 }
1778
1779 // used only for HalfLife maps
1780 static void Mod_Q1BSP_ParseWadsFromEntityLump(const char *data)
1781 {
1782         char key[128], value[4096];
1783         char wadname[128];
1784         int i, j, k;
1785         if (!data)
1786                 return;
1787         if (!COM_ParseToken_Simple(&data, false, false))
1788                 return; // error
1789         if (com_token[0] != '{')
1790                 return; // error
1791         while (1)
1792         {
1793                 if (!COM_ParseToken_Simple(&data, false, false))
1794                         return; // error
1795                 if (com_token[0] == '}')
1796                         break; // end of worldspawn
1797                 if (com_token[0] == '_')
1798                         strlcpy(key, com_token + 1, sizeof(key));
1799                 else
1800                         strlcpy(key, com_token, sizeof(key));
1801                 while (key[strlen(key)-1] == ' ') // remove trailing spaces
1802                         key[strlen(key)-1] = 0;
1803                 if (!COM_ParseToken_Simple(&data, false, false))
1804                         return; // error
1805                 dpsnprintf(value, sizeof(value), "%s", com_token);
1806                 if (!strcmp("wad", key)) // for HalfLife maps
1807                 {
1808                         if (loadmodel->brush.ishlbsp)
1809                         {
1810                                 j = 0;
1811                                 for (i = 0;i < (int)sizeof(value);i++)
1812                                         if (value[i] != ';' && value[i] != '\\' && value[i] != '/' && value[i] != ':')
1813                                                 break;
1814                                 if (value[i])
1815                                 {
1816                                         for (;i < (int)sizeof(value);i++)
1817                                         {
1818                                                 // ignore path - the \\ check is for HalfLife... stupid windoze 'programmers'...
1819                                                 if (value[i] == '\\' || value[i] == '/' || value[i] == ':')
1820                                                         j = i+1;
1821                                                 else if (value[i] == ';' || value[i] == 0)
1822                                                 {
1823                                                         k = value[i];
1824                                                         value[i] = 0;
1825                                                         strlcpy(wadname, "textures/", sizeof(wadname));
1826                                                         strlcat(wadname, &value[j], sizeof(wadname));
1827                                                         W_LoadTextureWadFile(wadname, false);
1828                                                         j = i+1;
1829                                                         if (!k)
1830                                                                 break;
1831                                                 }
1832                                         }
1833                                 }
1834                         }
1835                 }
1836         }
1837 }
1838
1839 static void Mod_Q1BSP_LoadEntities(lump_t *l)
1840 {
1841         loadmodel->brush.entities = NULL;
1842         if (!l->filelen)
1843                 return;
1844         loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1845         memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
1846         if (loadmodel->brush.ishlbsp)
1847                 Mod_Q1BSP_ParseWadsFromEntityLump(loadmodel->brush.entities);
1848 }
1849
1850
1851 static void Mod_Q1BSP_LoadVertexes(lump_t *l)
1852 {
1853         dvertex_t       *in;
1854         mvertex_t       *out;
1855         int                     i, count;
1856
1857         in = (dvertex_t *)(mod_base + l->fileofs);
1858         if (l->filelen % sizeof(*in))
1859                 Host_Error("Mod_Q1BSP_LoadVertexes: funny lump size in %s",loadmodel->name);
1860         count = l->filelen / sizeof(*in);
1861         out = (mvertex_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
1862
1863         loadmodel->brushq1.vertexes = out;
1864         loadmodel->brushq1.numvertexes = count;
1865
1866         for ( i=0 ; i<count ; i++, in++, out++)
1867         {
1868                 out->position[0] = LittleFloat(in->point[0]);
1869                 out->position[1] = LittleFloat(in->point[1]);
1870                 out->position[2] = LittleFloat(in->point[2]);
1871         }
1872 }
1873
1874 // The following two functions should be removed and MSG_* or SZ_* function sets adjusted so they
1875 // can be used for this
1876 // REMOVEME
1877 int SB_ReadInt (unsigned char **buffer)
1878 {
1879         int     i;
1880         i = ((*buffer)[0]) + 256*((*buffer)[1]) + 65536*((*buffer)[2]) + 16777216*((*buffer)[3]);
1881         (*buffer) += 4;
1882         return i;
1883 }
1884
1885 // REMOVEME
1886 float SB_ReadFloat (unsigned char **buffer)
1887 {
1888         union
1889         {
1890                 int             i;
1891                 float   f;
1892         } u;
1893
1894         u.i = SB_ReadInt (buffer);
1895         return u.f;
1896 }
1897
1898 static void Mod_Q1BSP_LoadSubmodels(lump_t *l, hullinfo_t *hullinfo)
1899 {
1900         unsigned char           *index;
1901         dmodel_t        *out;
1902         int                     i, j, count;
1903
1904         index = (unsigned char *)(mod_base + l->fileofs);
1905         if (l->filelen % (48+4*hullinfo->filehulls))
1906                 Host_Error ("Mod_Q1BSP_LoadSubmodels: funny lump size in %s", loadmodel->name);
1907
1908         count = l->filelen / (48+4*hullinfo->filehulls);
1909         out = (dmodel_t *)Mem_Alloc (loadmodel->mempool, count*sizeof(*out));
1910
1911         loadmodel->brushq1.submodels = out;
1912         loadmodel->brush.numsubmodels = count;
1913
1914         for (i = 0; i < count; i++, out++)
1915         {
1916         // spread out the mins / maxs by a pixel
1917                 out->mins[0] = SB_ReadFloat (&index) - 1;
1918                 out->mins[1] = SB_ReadFloat (&index) - 1;
1919                 out->mins[2] = SB_ReadFloat (&index) - 1;
1920                 out->maxs[0] = SB_ReadFloat (&index) + 1;
1921                 out->maxs[1] = SB_ReadFloat (&index) + 1;
1922                 out->maxs[2] = SB_ReadFloat (&index) + 1;
1923                 out->origin[0] = SB_ReadFloat (&index);
1924                 out->origin[1] = SB_ReadFloat (&index);
1925                 out->origin[2] = SB_ReadFloat (&index);
1926                 for (j = 0; j < hullinfo->filehulls; j++)
1927                         out->headnode[j] = SB_ReadInt (&index);
1928                 out->visleafs = SB_ReadInt (&index);
1929                 out->firstface = SB_ReadInt (&index);
1930                 out->numfaces = SB_ReadInt (&index);
1931         }
1932 }
1933
1934 static void Mod_Q1BSP_LoadEdges(lump_t *l)
1935 {
1936         dedge_t *in;
1937         medge_t *out;
1938         int     i, count;
1939
1940         in = (dedge_t *)(mod_base + l->fileofs);
1941         if (l->filelen % sizeof(*in))
1942                 Host_Error("Mod_Q1BSP_LoadEdges: funny lump size in %s",loadmodel->name);
1943         count = l->filelen / sizeof(*in);
1944         out = (medge_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1945
1946         loadmodel->brushq1.edges = out;
1947         loadmodel->brushq1.numedges = count;
1948
1949         for ( i=0 ; i<count ; i++, in++, out++)
1950         {
1951                 out->v[0] = (unsigned short)LittleShort(in->v[0]);
1952                 out->v[1] = (unsigned short)LittleShort(in->v[1]);
1953                 if (out->v[0] >= loadmodel->brushq1.numvertexes || out->v[1] >= loadmodel->brushq1.numvertexes)
1954                 {
1955                         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);
1956                         out->v[0] = 0;
1957                         out->v[1] = 0;
1958                 }
1959         }
1960 }
1961
1962 static void Mod_Q1BSP_LoadTexinfo(lump_t *l)
1963 {
1964         texinfo_t *in;
1965         mtexinfo_t *out;
1966         int i, j, k, count, miptex;
1967
1968         in = (texinfo_t *)(mod_base + l->fileofs);
1969         if (l->filelen % sizeof(*in))
1970                 Host_Error("Mod_Q1BSP_LoadTexinfo: funny lump size in %s",loadmodel->name);
1971         count = l->filelen / sizeof(*in);
1972         out = (mtexinfo_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1973
1974         loadmodel->brushq1.texinfo = out;
1975         loadmodel->brushq1.numtexinfo = count;
1976
1977         for (i = 0;i < count;i++, in++, out++)
1978         {
1979                 for (k = 0;k < 2;k++)
1980                         for (j = 0;j < 4;j++)
1981                                 out->vecs[k][j] = LittleFloat(in->vecs[k][j]);
1982
1983                 miptex = LittleLong(in->miptex);
1984                 out->flags = LittleLong(in->flags);
1985
1986                 out->texture = NULL;
1987                 if (loadmodel->data_textures)
1988                 {
1989                         if ((unsigned int) miptex >= (unsigned int) loadmodel->num_textures)
1990                                 Con_Printf("error in model \"%s\": invalid miptex index %i(of %i)\n", loadmodel->name, miptex, loadmodel->num_textures);
1991                         else
1992                                 out->texture = loadmodel->data_textures + miptex;
1993                 }
1994                 if (out->flags & TEX_SPECIAL)
1995                 {
1996                         // if texture chosen is NULL or the shader needs a lightmap,
1997                         // force to notexture water shader
1998                         if (out->texture == NULL || out->texture->basematerialflags & MATERIALFLAG_WALL)
1999                                 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 1);
2000                 }
2001                 else
2002                 {
2003                         // if texture chosen is NULL, force to notexture
2004                         if (out->texture == NULL)
2005                                 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 2);
2006                 }
2007         }
2008 }
2009
2010 #if 0
2011 void BoundPoly(int numverts, float *verts, vec3_t mins, vec3_t maxs)
2012 {
2013         int             i, j;
2014         float   *v;
2015
2016         mins[0] = mins[1] = mins[2] = 9999;
2017         maxs[0] = maxs[1] = maxs[2] = -9999;
2018         v = verts;
2019         for (i = 0;i < numverts;i++)
2020         {
2021                 for (j = 0;j < 3;j++, v++)
2022                 {
2023                         if (*v < mins[j])
2024                                 mins[j] = *v;
2025                         if (*v > maxs[j])
2026                                 maxs[j] = *v;
2027                 }
2028         }
2029 }
2030
2031 #define MAX_SUBDIVPOLYTRIANGLES 4096
2032 #define MAX_SUBDIVPOLYVERTS(MAX_SUBDIVPOLYTRIANGLES * 3)
2033
2034 static int subdivpolyverts, subdivpolytriangles;
2035 static int subdivpolyindex[MAX_SUBDIVPOLYTRIANGLES][3];
2036 static float subdivpolyvert[MAX_SUBDIVPOLYVERTS][3];
2037
2038 static int subdivpolylookupvert(vec3_t v)
2039 {
2040         int i;
2041         for (i = 0;i < subdivpolyverts;i++)
2042                 if (subdivpolyvert[i][0] == v[0]
2043                  && subdivpolyvert[i][1] == v[1]
2044                  && subdivpolyvert[i][2] == v[2])
2045                         return i;
2046         if (subdivpolyverts >= MAX_SUBDIVPOLYVERTS)
2047                 Host_Error("SubDividePolygon: ran out of vertices in buffer, please increase your r_subdivide_size");
2048         VectorCopy(v, subdivpolyvert[subdivpolyverts]);
2049         return subdivpolyverts++;
2050 }
2051
2052 static void SubdividePolygon(int numverts, float *verts)
2053 {
2054         int             i, i1, i2, i3, f, b, c, p;
2055         vec3_t  mins, maxs, front[256], back[256];
2056         float   m, *pv, *cv, dist[256], frac;
2057
2058         if (numverts > 250)
2059                 Host_Error("SubdividePolygon: ran out of verts in buffer");
2060
2061         BoundPoly(numverts, verts, mins, maxs);
2062
2063         for (i = 0;i < 3;i++)
2064         {
2065                 m = (mins[i] + maxs[i]) * 0.5;
2066                 m = r_subdivide_size.value * floor(m/r_subdivide_size.value + 0.5);
2067                 if (maxs[i] - m < 8)
2068                         continue;
2069                 if (m - mins[i] < 8)
2070                         continue;
2071
2072                 // cut it
2073                 for (cv = verts, c = 0;c < numverts;c++, cv += 3)
2074                         dist[c] = cv[i] - m;
2075
2076                 f = b = 0;
2077                 for (p = numverts - 1, c = 0, pv = verts + p * 3, cv = verts;c < numverts;p = c, c++, pv = cv, cv += 3)
2078                 {
2079                         if (dist[p] >= 0)
2080                         {
2081                                 VectorCopy(pv, front[f]);
2082                                 f++;
2083                         }
2084                         if (dist[p] <= 0)
2085                         {
2086                                 VectorCopy(pv, back[b]);
2087                                 b++;
2088                         }
2089                         if (dist[p] == 0 || dist[c] == 0)
2090                                 continue;
2091                         if ((dist[p] > 0) != (dist[c] > 0) )
2092                         {
2093                                 // clip point
2094                                 frac = dist[p] / (dist[p] - dist[c]);
2095                                 front[f][0] = back[b][0] = pv[0] + frac * (cv[0] - pv[0]);
2096                                 front[f][1] = back[b][1] = pv[1] + frac * (cv[1] - pv[1]);
2097                                 front[f][2] = back[b][2] = pv[2] + frac * (cv[2] - pv[2]);
2098                                 f++;
2099                                 b++;
2100                         }
2101                 }
2102
2103                 SubdividePolygon(f, front[0]);
2104                 SubdividePolygon(b, back[0]);
2105                 return;
2106         }
2107
2108         i1 = subdivpolylookupvert(verts);
2109         i2 = subdivpolylookupvert(verts + 3);
2110         for (i = 2;i < numverts;i++)
2111         {
2112                 if (subdivpolytriangles >= MAX_SUBDIVPOLYTRIANGLES)
2113                 {
2114                         Con_Print("SubdividePolygon: ran out of triangles in buffer, please increase your r_subdivide_size\n");
2115                         return;
2116                 }
2117
2118                 i3 = subdivpolylookupvert(verts + i * 3);
2119                 subdivpolyindex[subdivpolytriangles][0] = i1;
2120                 subdivpolyindex[subdivpolytriangles][1] = i2;
2121                 subdivpolyindex[subdivpolytriangles][2] = i3;
2122                 i2 = i3;
2123                 subdivpolytriangles++;
2124         }
2125 }
2126
2127 //Breaks a polygon up along axial 64 unit
2128 //boundaries so that turbulent and sky warps
2129 //can be done reasonably.
2130 static void Mod_Q1BSP_GenerateWarpMesh(msurface_t *surface)
2131 {
2132         int i, j;
2133         surfvertex_t *v;
2134         surfmesh_t *mesh;
2135
2136         subdivpolytriangles = 0;
2137         subdivpolyverts = 0;
2138         SubdividePolygon(surface->num_vertices, (surface->mesh->data_vertex3f + 3 * surface->num_firstvertex));
2139         if (subdivpolytriangles < 1)
2140                 Host_Error("Mod_Q1BSP_GenerateWarpMesh: no triangles?");
2141
2142         surface->mesh = mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + subdivpolytriangles * sizeof(int[3]) + subdivpolyverts * sizeof(surfvertex_t));
2143         mesh->num_vertices = subdivpolyverts;
2144         mesh->num_triangles = subdivpolytriangles;
2145         mesh->vertex = (surfvertex_t *)(mesh + 1);
2146         mesh->index = (int *)(mesh->vertex + mesh->num_vertices);
2147         memset(mesh->vertex, 0, mesh->num_vertices * sizeof(surfvertex_t));
2148
2149         for (i = 0;i < mesh->num_triangles;i++)
2150                 for (j = 0;j < 3;j++)
2151                         mesh->index[i*3+j] = subdivpolyindex[i][j];
2152
2153         for (i = 0, v = mesh->vertex;i < subdivpolyverts;i++, v++)
2154         {
2155                 VectorCopy(subdivpolyvert[i], v->v);
2156                 v->st[0] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[0]);
2157                 v->st[1] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[1]);
2158         }
2159 }
2160 #endif
2161
2162 /* Maximum size of a single LM */
2163 #define MAX_SINGLE_LM_SIZE    256
2164
2165 struct alloc_lm_row
2166 {
2167         int rowY;
2168         int currentX;
2169 };
2170
2171 struct alloc_lm_state
2172 {
2173         int currentY;
2174         struct alloc_lm_row rows[MAX_SINGLE_LM_SIZE];
2175 };
2176
2177 static void init_alloc_lm_state (struct alloc_lm_state* state)
2178 {
2179         int r;
2180         
2181         state->currentY = 0;
2182         for (r = 0; r < MAX_SINGLE_LM_SIZE; r++)
2183         {
2184           state->rows[r].currentX = 0;
2185           state->rows[r].rowY = -1;
2186         }
2187 }
2188
2189 static qboolean Mod_Q1BSP_AllocLightmapBlock(struct alloc_lm_state* state, int totalwidth, int totalheight, int blockwidth, int blockheight, int *outx, int *outy)
2190 {
2191         struct alloc_lm_row* row;
2192         int r;
2193
2194         row = &(state->rows[blockheight]);
2195         if ((row->rowY < 0) || (row->currentX + blockwidth > totalwidth))
2196         {
2197                 if (state->currentY + blockheight <= totalheight)
2198                 {
2199                         row->rowY = state->currentY;
2200                         row->currentX = 0;
2201                         state->currentY += blockheight;
2202                 }
2203                 else
2204                 {
2205                         /* See if we can stuff the block into a higher row */
2206                         row = NULL;
2207                         for (r = blockheight; r < MAX_SINGLE_LM_SIZE; r++)
2208                         {
2209                                 if ((state->rows[r].rowY >= 0)
2210                                   && (state->rows[r].currentX + blockwidth <= totalwidth))
2211                                 {
2212                                         row = &(state->rows[r]);
2213                                         break;
2214                                 }
2215                         }
2216                         if (row == NULL) return false;
2217                 }
2218         }
2219         *outy = row->rowY;
2220         *outx = row->currentX;
2221         row->currentX += blockwidth;
2222
2223         return true;
2224 }
2225
2226 extern cvar_t gl_max_size;
2227 static void Mod_Q1BSP_LoadFaces(lump_t *l)
2228 {
2229         dface_t *in;
2230         msurface_t *surface;
2231         int i, j, count, surfacenum, planenum, smax, tmax, ssize, tsize, firstedge, numedges, totalverts, totaltris, lightmapnumber, lightmapsize, totallightmapsamples;
2232         float texmins[2], texmaxs[2], val;
2233         rtexture_t *lightmaptexture, *deluxemaptexture;
2234
2235         in = (dface_t *)(mod_base + l->fileofs);
2236         if (l->filelen % sizeof(*in))
2237                 Host_Error("Mod_Q1BSP_LoadFaces: funny lump size in %s",loadmodel->name);
2238         count = l->filelen / sizeof(*in);
2239         loadmodel->data_surfaces = (msurface_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_t));
2240         loadmodel->data_surfaces_lightmapinfo = (msurface_lightmapinfo_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_lightmapinfo_t));
2241
2242         loadmodel->num_surfaces = count;
2243
2244         totalverts = 0;
2245         totaltris = 0;
2246         for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs);surfacenum < count;surfacenum++, in++)
2247         {
2248                 numedges = (unsigned short)LittleShort(in->numedges);
2249                 totalverts += numedges;
2250                 totaltris += numedges - 2;
2251         }
2252
2253         Mod_AllocSurfMesh(loadmodel->mempool, totalverts, totaltris, true, false, false);
2254
2255         lightmaptexture = NULL;
2256         deluxemaptexture = r_texture_blanknormalmap;
2257         lightmapnumber = 1;
2258         lightmapsize = max(256, gl_max_size.integer);
2259         totallightmapsamples = 0;
2260
2261         totalverts = 0;
2262         totaltris = 0;
2263         for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs), surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, in++, surface++)
2264         {
2265                 surface->lightmapinfo = loadmodel->data_surfaces_lightmapinfo + surfacenum;
2266
2267                 // FIXME: validate edges, texinfo, etc?
2268                 firstedge = LittleLong(in->firstedge);
2269                 numedges = (unsigned short)LittleShort(in->numedges);
2270                 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)
2271                         Host_Error("Mod_Q1BSP_LoadFaces: invalid edge range (firstedge %i, numedges %i, model edges %i)", firstedge, numedges, loadmodel->brushq1.numsurfedges);
2272                 i = (unsigned short)LittleShort(in->texinfo);
2273                 if ((unsigned int) i >= (unsigned int) loadmodel->brushq1.numtexinfo)
2274                         Host_Error("Mod_Q1BSP_LoadFaces: invalid texinfo index %i(model has %i texinfos)", i, loadmodel->brushq1.numtexinfo);
2275                 surface->lightmapinfo->texinfo = loadmodel->brushq1.texinfo + i;
2276                 surface->texture = surface->lightmapinfo->texinfo->texture;
2277
2278                 planenum = (unsigned short)LittleShort(in->planenum);
2279                 if ((unsigned int) planenum >= (unsigned int) loadmodel->brush.num_planes)
2280                         Host_Error("Mod_Q1BSP_LoadFaces: invalid plane index %i (model has %i planes)", planenum, loadmodel->brush.num_planes);
2281
2282                 //surface->flags = surface->texture->flags;
2283                 //if (LittleShort(in->side))
2284                 //      surface->flags |= SURF_PLANEBACK;
2285                 //surface->plane = loadmodel->brush.data_planes + planenum;
2286
2287                 surface->num_firstvertex = totalverts;
2288                 surface->num_vertices = numedges;
2289                 surface->num_firsttriangle = totaltris;
2290                 surface->num_triangles = numedges - 2;
2291                 totalverts += numedges;
2292                 totaltris += numedges - 2;
2293
2294                 // convert edges back to a normal polygon
2295                 for (i = 0;i < surface->num_vertices;i++)
2296                 {
2297                         int lindex = loadmodel->brushq1.surfedges[firstedge + i];
2298                         float s, t;
2299                         if (lindex > 0)
2300                                 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[lindex].v[0]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2301                         else
2302                                 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[-lindex].v[1]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2303                         s = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2304                         t = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2305                         (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 0] = s / surface->texture->width;
2306                         (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 1] = t / surface->texture->height;
2307                         (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = 0;
2308                         (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = 0;
2309                         (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = 0;
2310                 }
2311
2312                 for (i = 0;i < surface->num_triangles;i++)
2313                 {
2314                         (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 0] = 0 + surface->num_firstvertex;
2315                         (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 1] = i + 1 + surface->num_firstvertex;
2316                         (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 2] = i + 2 + surface->num_firstvertex;
2317                 }
2318
2319                 // compile additional data about the surface geometry
2320                 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);
2321                 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);
2322                 BoxFromPoints(surface->mins, surface->maxs, surface->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex));
2323
2324                 // generate surface extents information
2325                 texmins[0] = texmaxs[0] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2326                 texmins[1] = texmaxs[1] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2327                 for (i = 1;i < surface->num_vertices;i++)
2328                 {
2329                         for (j = 0;j < 2;j++)
2330                         {
2331                                 val = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3, surface->lightmapinfo->texinfo->vecs[j]) + surface->lightmapinfo->texinfo->vecs[j][3];
2332                                 texmins[j] = min(texmins[j], val);
2333                                 texmaxs[j] = max(texmaxs[j], val);
2334                         }
2335                 }
2336                 for (i = 0;i < 2;i++)
2337                 {
2338                         surface->lightmapinfo->texturemins[i] = (int) floor(texmins[i] / 16.0) * 16;
2339                         surface->lightmapinfo->extents[i] = (int) ceil(texmaxs[i] / 16.0) * 16 - surface->lightmapinfo->texturemins[i];
2340                 }
2341
2342                 smax = surface->lightmapinfo->extents[0] >> 4;
2343                 tmax = surface->lightmapinfo->extents[1] >> 4;
2344                 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2345                 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2346
2347                 // lighting info
2348                 for (i = 0;i < MAXLIGHTMAPS;i++)
2349                         surface->lightmapinfo->styles[i] = in->styles[i];
2350                 surface->lightmaptexture = NULL;
2351                 surface->deluxemaptexture = r_texture_blanknormalmap;
2352                 i = LittleLong(in->lightofs);
2353                 if (i == -1)
2354                 {
2355                         surface->lightmapinfo->samples = NULL;
2356                         // give non-lightmapped water a 1x white lightmap
2357                         if ((surface->texture->basematerialflags & MATERIALFLAG_WATER) && (surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) && ssize <= 256 && tsize <= 256)
2358                         {
2359                                 surface->lightmapinfo->samples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2360                                 surface->lightmapinfo->styles[0] = 0;
2361                                 memset(surface->lightmapinfo->samples, 128, ssize * tsize * 3);
2362                         }
2363                 }
2364                 else if (loadmodel->brush.ishlbsp) // LordHavoc: HalfLife map (bsp version 30)
2365                         surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + i;
2366                 else // LordHavoc: white lighting (bsp version 29)
2367                 {
2368                         surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + (i * 3);
2369                         if (loadmodel->brushq1.nmaplightdata)
2370                                 surface->lightmapinfo->nmapsamples = loadmodel->brushq1.nmaplightdata + (i * 3);
2371                 }
2372
2373                 // check if we should apply a lightmap to this
2374                 if (!(surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) || surface->lightmapinfo->samples)
2375                 {
2376                         if (ssize > 256 || tsize > 256)
2377                                 Host_Error("Bad surface extents");
2378
2379                         if (lightmapsize < ssize)
2380                                 lightmapsize = ssize;
2381                         if (lightmapsize < tsize)
2382                                 lightmapsize = tsize;
2383
2384                         totallightmapsamples += ssize*tsize;
2385
2386                         // force lightmap upload on first time seeing the surface
2387                         //
2388                         // additionally this is used by the later code to see if a
2389                         // lightmap is needed on this surface (rather than duplicating the
2390                         // logic above)
2391                         surface->cached_dlight = true;
2392                 }
2393         }
2394
2395         // small maps (such as ammo boxes especially) don't need big lightmap
2396         // textures, so this code tries to guess a good size based on
2397         // totallightmapsamples (size of the lightmaps lump basically), as well as
2398         // trying to max out the gl_max_size if there is a lot of lightmap data to
2399         // store
2400         // additionally, never choose a lightmapsize that is smaller than the
2401         // largest surface encountered (as it would fail)
2402         i = lightmapsize;
2403         for (lightmapsize = 64; (lightmapsize < i) && (lightmapsize < gl_max_size.integer) && (totallightmapsamples > lightmapsize*lightmapsize); lightmapsize*=2)
2404                 ;
2405
2406         // now that we've decided the lightmap texture size, we can do the rest
2407         if (cls.state != ca_dedicated)
2408         {
2409                 struct alloc_lm_state allocState;
2410
2411                 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2412                 {
2413                         int i, iu, iv, lightmapx, lightmapy;
2414                         float u, v, ubase, vbase, uscale, vscale;
2415                         
2416                         smax = surface->lightmapinfo->extents[0] >> 4;
2417                         tmax = surface->lightmapinfo->extents[1] >> 4;
2418                         ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2419                         tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2420                         
2421                         // stainmap for permanent marks on walls
2422                         surface->lightmapinfo->stainsamples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2423                         // clear to white
2424                         memset(surface->lightmapinfo->stainsamples, 255, ssize * tsize * 3);
2425
2426                         if (!lightmaptexture || !Mod_Q1BSP_AllocLightmapBlock(&allocState, lightmapsize, lightmapsize, ssize, tsize, &lightmapx, &lightmapy))
2427                         {
2428                                 // allocate a texture pool if we need it
2429                                 if (loadmodel->texturepool == NULL)
2430                                         loadmodel->texturepool = R_AllocTexturePool();
2431                                 // could not find room, make a new lightmap
2432                                 lightmaptexture = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2433                                 if (loadmodel->brushq1.nmaplightdata)
2434                                         deluxemaptexture = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2435                                 lightmapnumber++;
2436                                 init_alloc_lm_state (&allocState);
2437                                 Mod_Q1BSP_AllocLightmapBlock(&allocState, lightmapsize, lightmapsize, ssize, tsize, &lightmapx, &lightmapy);
2438                         }
2439                         surface->lightmaptexture = lightmaptexture;
2440                         surface->deluxemaptexture = deluxemaptexture;
2441                         surface->lightmapinfo->lightmaporigin[0] = lightmapx;
2442                         surface->lightmapinfo->lightmaporigin[1] = lightmapy;
2443
2444                         uscale = 1.0f / (float)lightmapsize;
2445                         vscale = 1.0f / (float)lightmapsize;
2446                         ubase = lightmapx * uscale;
2447                         vbase = lightmapy * vscale;
2448
2449                         for (i = 0;i < surface->num_vertices;i++)
2450                         {
2451                                 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);
2452                                 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);
2453                                 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = u * uscale + ubase;
2454                                 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = v * vscale + vbase;
2455                                 // LordHavoc: calc lightmap data offset for vertex lighting to use
2456                                 iu = (int) u;
2457                                 iv = (int) v;
2458                                 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = (bound(0, iv, tmax) * ssize + bound(0, iu, smax)) * 3;
2459                         }
2460
2461                 }
2462         }
2463 }
2464
2465 static void Mod_Q1BSP_LoadNodes_RecursiveSetParent(mnode_t *node, mnode_t *parent)
2466 {
2467         //if (node->parent)
2468         //      Host_Error("Mod_Q1BSP_LoadNodes_RecursiveSetParent: runaway recursion");
2469         node->parent = parent;
2470         if (node->plane)
2471         {
2472                 // this is a node, recurse to children
2473                 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[0], node);
2474                 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[1], node);
2475                 // combine supercontents of children
2476                 node->combinedsupercontents = node->children[0]->combinedsupercontents | node->children[1]->combinedsupercontents;
2477         }
2478         else
2479         {
2480                 int j;
2481                 mleaf_t *leaf = (mleaf_t *)node;
2482                 // if this is a leaf, calculate supercontents mask from all collidable
2483                 // primitives in the leaf (brushes and collision surfaces)
2484                 // also flag if the leaf contains any collision surfaces
2485                 leaf->combinedsupercontents = 0;
2486                 // combine the supercontents values of all brushes in this leaf
2487                 for (j = 0;j < leaf->numleafbrushes;j++)
2488                         leaf->combinedsupercontents |= loadmodel->brush.data_brushes[leaf->firstleafbrush[j]].texture->supercontents;
2489                 // check if this leaf contains any collision surfaces (q3 patches)
2490                 for (j = 0;j < leaf->numleafsurfaces;j++)
2491                 {
2492                         msurface_t *surface = loadmodel->data_surfaces + leaf->firstleafsurface[j];
2493                         if (surface->num_collisiontriangles)
2494                         {
2495                                 leaf->containscollisionsurfaces = true;
2496                                 leaf->combinedsupercontents |= surface->texture->supercontents;
2497                         }
2498                 }
2499         }
2500 }
2501
2502 static void Mod_Q1BSP_LoadNodes(lump_t *l)
2503 {
2504         int                     i, j, count, p;
2505         dnode_t         *in;
2506         mnode_t         *out;
2507
2508         in = (dnode_t *)(mod_base + l->fileofs);
2509         if (l->filelen % sizeof(*in))
2510                 Host_Error("Mod_Q1BSP_LoadNodes: funny lump size in %s",loadmodel->name);
2511         count = l->filelen / sizeof(*in);
2512         out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2513
2514         loadmodel->brush.data_nodes = out;
2515         loadmodel->brush.num_nodes = count;
2516
2517         for ( i=0 ; i<count ; i++, in++, out++)
2518         {
2519                 for (j=0 ; j<3 ; j++)
2520                 {
2521                         out->mins[j] = LittleShort(in->mins[j]);
2522                         out->maxs[j] = LittleShort(in->maxs[j]);
2523                 }
2524
2525                 p = LittleLong(in->planenum);
2526                 out->plane = loadmodel->brush.data_planes + p;
2527
2528                 out->firstsurface = (unsigned short)LittleShort(in->firstface);
2529                 out->numsurfaces = (unsigned short)LittleShort(in->numfaces);
2530
2531                 for (j=0 ; j<2 ; j++)
2532                 {
2533                         // LordHavoc: this code supports broken bsp files produced by
2534                         // arguire qbsp which can produce more than 32768 nodes, any value
2535                         // below count is assumed to be a node number, any other value is
2536                         // assumed to be a leaf number
2537                         p = (unsigned short)LittleShort(in->children[j]);
2538                         if (p < count)
2539                         {
2540                                 if (p < loadmodel->brush.num_nodes)
2541                                         out->children[j] = loadmodel->brush.data_nodes + p;
2542                                 else
2543                                 {
2544                                         Con_Printf("Mod_Q1BSP_LoadNodes: invalid node index %i (file has only %i nodes)\n", p, loadmodel->brush.num_nodes);
2545                                         // map it to the solid leaf
2546                                         out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2547                                 }
2548                         }
2549                         else
2550                         {
2551                                 // note this uses 65535 intentionally, -1 is leaf 0
2552                                 p = 65535 - p;
2553                                 if (p < loadmodel->brush.num_leafs)
2554                                         out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + p);
2555                                 else
2556                                 {
2557                                         Con_Printf("Mod_Q1BSP_LoadNodes: invalid leaf index %i (file has only %i leafs)\n", p, loadmodel->brush.num_leafs);
2558                                         // map it to the solid leaf
2559                                         out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2560                                 }
2561                         }
2562                 }
2563         }
2564
2565         Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);      // sets nodes and leafs
2566 }
2567
2568 static void Mod_Q1BSP_LoadLeafs(lump_t *l)
2569 {
2570         dleaf_t *in;
2571         mleaf_t *out;
2572         int i, j, count, p;
2573
2574         in = (dleaf_t *)(mod_base + l->fileofs);
2575         if (l->filelen % sizeof(*in))
2576                 Host_Error("Mod_Q1BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
2577         count = l->filelen / sizeof(*in);
2578         out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2579
2580         loadmodel->brush.data_leafs = out;
2581         loadmodel->brush.num_leafs = count;
2582         // get visleafs from the submodel data
2583         loadmodel->brush.num_pvsclusters = loadmodel->brushq1.submodels[0].visleafs;
2584         loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters+7)>>3;
2585         loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2586         memset(loadmodel->brush.data_pvsclusters, 0xFF, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2587
2588         for ( i=0 ; i<count ; i++, in++, out++)
2589         {
2590                 for (j=0 ; j<3 ; j++)
2591                 {
2592                         out->mins[j] = LittleShort(in->mins[j]);
2593                         out->maxs[j] = LittleShort(in->maxs[j]);
2594                 }
2595
2596                 // FIXME: this function could really benefit from some error checking
2597
2598                 out->contents = LittleLong(in->contents);
2599
2600                 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + (unsigned short)LittleShort(in->firstmarksurface);
2601                 out->numleafsurfaces = (unsigned short)LittleShort(in->nummarksurfaces);
2602                 if (out->firstleafsurface < 0 || (unsigned short)LittleShort(in->firstmarksurface) + out->numleafsurfaces > loadmodel->brush.num_leafsurfaces)
2603                 {
2604                         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);
2605                         out->firstleafsurface = NULL;
2606                         out->numleafsurfaces = 0;
2607                 }
2608
2609                 out->clusterindex = i - 1;
2610                 if (out->clusterindex >= loadmodel->brush.num_pvsclusters)
2611                         out->clusterindex = -1;
2612
2613                 p = LittleLong(in->visofs);
2614                 // ignore visofs errors on leaf 0 (solid)
2615                 if (p >= 0 && out->clusterindex >= 0)
2616                 {
2617                         if (p >= loadmodel->brushq1.num_compressedpvs)
2618                                 Con_Print("Mod_Q1BSP_LoadLeafs: invalid visofs\n");
2619                         else
2620                                 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);
2621                 }
2622
2623                 for (j = 0;j < 4;j++)
2624                         out->ambient_sound_level[j] = in->ambient_level[j];
2625
2626                 // FIXME: Insert caustics here
2627         }
2628 }
2629
2630 qboolean Mod_Q1BSP_CheckWaterAlphaSupport(void)
2631 {
2632         int i, j;
2633         mleaf_t *leaf;
2634         const unsigned char *pvs;
2635         // check all liquid leafs to see if they can see into empty leafs, if any
2636         // can we can assume this map supports r_wateralpha
2637         for (i = 0, leaf = loadmodel->brush.data_leafs;i < loadmodel->brush.num_leafs;i++, leaf++)
2638         {
2639                 if ((leaf->contents == CONTENTS_WATER || leaf->contents == CONTENTS_SLIME) && (leaf->clusterindex >= 0 && loadmodel->brush.data_pvsclusters))
2640                 {
2641                         pvs = loadmodel->brush.data_pvsclusters + leaf->clusterindex * loadmodel->brush.num_pvsclusterbytes;
2642                         for (j = 0;j < loadmodel->brush.num_leafs;j++)
2643                                 if (CHECKPVSBIT(pvs, loadmodel->brush.data_leafs[j].clusterindex) && loadmodel->brush.data_leafs[j].contents == CONTENTS_EMPTY)
2644                                         return true;
2645                 }
2646         }
2647         return false;
2648 }
2649
2650 static void Mod_Q1BSP_LoadClipnodes(lump_t *l, hullinfo_t *hullinfo)
2651 {
2652         dclipnode_t *in;
2653         mclipnode_t *out;
2654         int                     i, count;
2655         hull_t          *hull;
2656
2657         in = (dclipnode_t *)(mod_base + l->fileofs);
2658         if (l->filelen % sizeof(*in))
2659                 Host_Error("Mod_Q1BSP_LoadClipnodes: funny lump size in %s",loadmodel->name);
2660         count = l->filelen / sizeof(*in);
2661         out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2662
2663         loadmodel->brushq1.clipnodes = out;
2664         loadmodel->brushq1.numclipnodes = count;
2665
2666         for (i = 1; i < hullinfo->numhulls; i++)
2667         {
2668                 hull = &loadmodel->brushq1.hulls[i];
2669                 hull->clipnodes = out;
2670                 hull->firstclipnode = 0;
2671                 hull->lastclipnode = count-1;
2672                 hull->planes = loadmodel->brush.data_planes;
2673                 hull->clip_mins[0] = hullinfo->hullsizes[i][0][0];
2674                 hull->clip_mins[1] = hullinfo->hullsizes[i][0][1];
2675                 hull->clip_mins[2] = hullinfo->hullsizes[i][0][2];
2676                 hull->clip_maxs[0] = hullinfo->hullsizes[i][1][0];
2677                 hull->clip_maxs[1] = hullinfo->hullsizes[i][1][1];
2678                 hull->clip_maxs[2] = hullinfo->hullsizes[i][1][2];
2679                 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2680         }
2681
2682         for (i=0 ; i<count ; i++, out++, in++)
2683         {
2684                 out->planenum = LittleLong(in->planenum);
2685                 // LordHavoc: this code supports arguire qbsp's broken clipnodes indices (more than 32768 clipnodes), values above count are assumed to be contents values
2686                 out->children[0] = (unsigned short)LittleShort(in->children[0]);
2687                 out->children[1] = (unsigned short)LittleShort(in->children[1]);
2688                 if (out->children[0] >= count)
2689                         out->children[0] -= 65536;
2690                 if (out->children[1] >= count)
2691                         out->children[1] -= 65536;
2692                 if (out->planenum < 0 || out->planenum >= loadmodel->brush.num_planes)
2693                         Host_Error("Corrupt clipping hull(out of range planenum)");
2694         }
2695 }
2696
2697 //Duplicate the drawing hull structure as a clipping hull
2698 static void Mod_Q1BSP_MakeHull0(void)
2699 {
2700         mnode_t         *in;
2701         mclipnode_t *out;
2702         int                     i;
2703         hull_t          *hull;
2704
2705         hull = &loadmodel->brushq1.hulls[0];
2706
2707         in = loadmodel->brush.data_nodes;
2708         out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(*out));
2709
2710         hull->clipnodes = out;
2711         hull->firstclipnode = 0;
2712         hull->lastclipnode = loadmodel->brush.num_nodes - 1;
2713         hull->planes = loadmodel->brush.data_planes;
2714
2715         for (i = 0;i < loadmodel->brush.num_nodes;i++, out++, in++)
2716         {
2717                 out->planenum = in->plane - loadmodel->brush.data_planes;
2718                 out->children[0] = in->children[0]->plane ? in->children[0] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[0])->contents;
2719                 out->children[1] = in->children[1]->plane ? in->children[1] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[1])->contents;
2720         }
2721 }
2722
2723 static void Mod_Q1BSP_LoadLeaffaces(lump_t *l)
2724 {
2725         int i, j;
2726         short *in;
2727
2728         in = (short *)(mod_base + l->fileofs);
2729         if (l->filelen % sizeof(*in))
2730                 Host_Error("Mod_Q1BSP_LoadLeaffaces: funny lump size in %s",loadmodel->name);
2731         loadmodel->brush.num_leafsurfaces = l->filelen / sizeof(*in);
2732         loadmodel->brush.data_leafsurfaces = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafsurfaces * sizeof(int));
2733
2734         for (i = 0;i < loadmodel->brush.num_leafsurfaces;i++)
2735         {
2736                 j = (unsigned short) LittleShort(in[i]);
2737                 if (j >= loadmodel->num_surfaces)
2738                         Host_Error("Mod_Q1BSP_LoadLeaffaces: bad surface number");
2739                 loadmodel->brush.data_leafsurfaces[i] = j;
2740         }
2741 }
2742
2743 static void Mod_Q1BSP_LoadSurfedges(lump_t *l)
2744 {
2745         int             i;
2746         int             *in;
2747
2748         in = (int *)(mod_base + l->fileofs);
2749         if (l->filelen % sizeof(*in))
2750                 Host_Error("Mod_Q1BSP_LoadSurfedges: funny lump size in %s",loadmodel->name);
2751         loadmodel->brushq1.numsurfedges = l->filelen / sizeof(*in);
2752         loadmodel->brushq1.surfedges = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numsurfedges * sizeof(int));
2753
2754         for (i = 0;i < loadmodel->brushq1.numsurfedges;i++)
2755                 loadmodel->brushq1.surfedges[i] = LittleLong(in[i]);
2756 }
2757
2758
2759 static void Mod_Q1BSP_LoadPlanes(lump_t *l)
2760 {
2761         int                     i;
2762         mplane_t        *out;
2763         dplane_t        *in;
2764
2765         in = (dplane_t *)(mod_base + l->fileofs);
2766         if (l->filelen % sizeof(*in))
2767                 Host_Error("Mod_Q1BSP_LoadPlanes: funny lump size in %s", loadmodel->name);
2768
2769         loadmodel->brush.num_planes = l->filelen / sizeof(*in);
2770         loadmodel->brush.data_planes = out = (mplane_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_planes * sizeof(*out));
2771
2772         for (i = 0;i < loadmodel->brush.num_planes;i++, in++, out++)
2773         {
2774                 out->normal[0] = LittleFloat(in->normal[0]);
2775                 out->normal[1] = LittleFloat(in->normal[1]);
2776                 out->normal[2] = LittleFloat(in->normal[2]);
2777                 out->dist = LittleFloat(in->dist);
2778
2779                 PlaneClassify(out);
2780         }
2781 }
2782
2783 static void Mod_Q1BSP_LoadMapBrushes(void)
2784 {
2785 #if 0
2786 // unfinished
2787         int submodel, numbrushes;
2788         qboolean firstbrush;
2789         char *text, *maptext;
2790         char mapfilename[MAX_QPATH];
2791         FS_StripExtension (loadmodel->name, mapfilename, sizeof (mapfilename));
2792         strlcat (mapfilename, ".map", sizeof (mapfilename));
2793         maptext = (unsigned char*) FS_LoadFile(mapfilename, tempmempool, false, NULL);
2794         if (!maptext)
2795                 return;
2796         text = maptext;
2797         if (!COM_ParseToken_Simple(&data, false, false))
2798                 return; // error
2799         submodel = 0;
2800         for (;;)
2801         {
2802                 if (!COM_ParseToken_Simple(&data, false, false))
2803                         break;
2804                 if (com_token[0] != '{')
2805                         return; // error
2806                 // entity
2807                 firstbrush = true;
2808                 numbrushes = 0;
2809                 maxbrushes = 256;
2810                 brushes = Mem_Alloc(loadmodel->mempool, maxbrushes * sizeof(mbrush_t));
2811                 for (;;)
2812                 {
2813                         if (!COM_ParseToken_Simple(&data, false, false))
2814                                 return; // error
2815                         if (com_token[0] == '}')
2816                                 break; // end of entity
2817                         if (com_token[0] == '{')
2818                         {
2819                                 // brush
2820                                 if (firstbrush)
2821                                 {
2822                                         if (submodel)
2823                                         {
2824                                                 if (submodel > loadmodel->brush.numsubmodels)
2825                                                 {
2826                                                         Con_Printf("Mod_Q1BSP_LoadMapBrushes: .map has more submodels than .bsp!\n");
2827                                                         model = NULL;
2828                                                 }
2829                                                 else
2830                                                         model = loadmodel->brush.submodels[submodel];
2831                                         }
2832                                         else
2833                                                 model = loadmodel;
2834                                 }
2835                                 for (;;)
2836                                 {
2837                                         if (!COM_ParseToken_Simple(&data, false, false))
2838                                                 return; // error
2839                                         if (com_token[0] == '}')
2840                                                 break; // end of brush
2841                                         // each brush face should be this format:
2842                                         // ( x y z ) ( x y z ) ( x y z ) texture scroll_s scroll_t rotateangle scale_s scale_t
2843                                         // FIXME: support hl .map format
2844                                         for (pointnum = 0;pointnum < 3;pointnum++)
2845                                         {
2846                                                 COM_ParseToken_Simple(&data, false, false);
2847                                                 for (componentnum = 0;componentnum < 3;componentnum++)
2848                                                 {
2849                                                         COM_ParseToken_Simple(&data, false, false);
2850                                                         point[pointnum][componentnum] = atof(com_token);
2851                                                 }
2852                                                 COM_ParseToken_Simple(&data, false, false);
2853                                         }
2854                                         COM_ParseToken_Simple(&data, false, false);
2855                                         strlcpy(facetexture, com_token, sizeof(facetexture));
2856                                         COM_ParseToken_Simple(&data, false, false);
2857                                         //scroll_s = atof(com_token);
2858                                         COM_ParseToken_Simple(&data, false, false);
2859                                         //scroll_t = atof(com_token);
2860                                         COM_ParseToken_Simple(&data, false, false);
2861                                         //rotate = atof(com_token);
2862                                         COM_ParseToken_Simple(&data, false, false);
2863                                         //scale_s = atof(com_token);
2864                                         COM_ParseToken_Simple(&data, false, false);
2865                                         //scale_t = atof(com_token);
2866                                         TriangleNormal(point[0], point[1], point[2], planenormal);
2867                                         VectorNormalizeDouble(planenormal);
2868                                         planedist = DotProduct(point[0], planenormal);
2869                                         //ChooseTexturePlane(planenormal, texturevector[0], texturevector[1]);
2870                                 }
2871                                 continue;
2872                         }
2873                 }
2874         }
2875 #endif
2876 }
2877
2878
2879 #define MAX_PORTALPOINTS 64
2880
2881 typedef struct portal_s
2882 {
2883         mplane_t plane;
2884         mnode_t *nodes[2];              // [0] = front side of plane
2885         struct portal_s *next[2];
2886         int numpoints;
2887         double points[3*MAX_PORTALPOINTS];
2888         struct portal_s *chain; // all portals are linked into a list
2889 }
2890 portal_t;
2891
2892 static portal_t *portalchain;
2893
2894 /*
2895 ===========
2896 AllocPortal
2897 ===========
2898 */
2899 static portal_t *AllocPortal(void)
2900 {
2901         portal_t *p;
2902         p = (portal_t *)Mem_Alloc(loadmodel->mempool, sizeof(portal_t));
2903         p->chain = portalchain;
2904         portalchain = p;
2905         return p;
2906 }
2907
2908 static void FreePortal(portal_t *p)
2909 {
2910         Mem_Free(p);
2911 }
2912
2913 static void Mod_Q1BSP_RecursiveRecalcNodeBBox(mnode_t *node)
2914 {
2915         // process only nodes (leafs already had thei