improved detection of q3 terrain blend shaders to reduce chances of a misidentification
[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_lightmaprgba = {0, "r_lightmaprgba", "1", "whether to use RGBA (32bit) or RGB (24bit) lightmaps"};
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_lightmaprgba);
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         dclipnode_t *node;
631         int side;
632         double midf, mid[3];
633
634         // LordHavoc: a goto!  everyone flee in terror... :)
635 loc0:
636         // check for empty
637         if (num < 0)
638         {
639                 num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
640                 if (!t->trace->startfound)
641                 {
642                         t->trace->startfound = true;
643                         t->trace->startsupercontents |= num;
644                 }
645                 if (num & SUPERCONTENTS_LIQUIDSMASK)
646                         t->trace->inwater = true;
647                 if (num == 0)
648                         t->trace->inopen = true;
649                 if (num & SUPERCONTENTS_SOLID)
650                         t->trace->hittexture = &mod_q1bsp_texture_solid;
651                 else if (num & SUPERCONTENTS_SKY)
652                         t->trace->hittexture = &mod_q1bsp_texture_sky;
653                 else if (num & SUPERCONTENTS_LAVA)
654                         t->trace->hittexture = &mod_q1bsp_texture_lava;
655                 else if (num & SUPERCONTENTS_SLIME)
656                         t->trace->hittexture = &mod_q1bsp_texture_slime;
657                 else
658                         t->trace->hittexture = &mod_q1bsp_texture_water;
659                 t->trace->hitq3surfaceflags = t->trace->hittexture->surfaceflags;
660                 t->trace->hitsupercontents = num;
661                 if (num & t->trace->hitsupercontentsmask)
662                 {
663                         // if the first leaf is solid, set startsolid
664                         if (t->trace->allsolid)
665                                 t->trace->startsolid = true;
666 #if COLLISIONPARANOID >= 3
667                         Con_Print("S");
668 #endif
669                         return HULLCHECKSTATE_SOLID;
670                 }
671                 else
672                 {
673                         t->trace->allsolid = false;
674 #if COLLISIONPARANOID >= 3
675                         Con_Print("E");
676 #endif
677                         return HULLCHECKSTATE_EMPTY;
678                 }
679         }
680
681         // find the point distances
682         node = t->hull->clipnodes + num;
683
684         plane = t->hull->planes + node->planenum;
685         if (plane->type < 3)
686         {
687                 t1 = p1[plane->type] - plane->dist;
688                 t2 = p2[plane->type] - plane->dist;
689         }
690         else
691         {
692                 t1 = DotProduct (plane->normal, p1) - plane->dist;
693                 t2 = DotProduct (plane->normal, p2) - plane->dist;
694         }
695
696         if (t1 < 0)
697         {
698                 if (t2 < 0)
699                 {
700 #if COLLISIONPARANOID >= 3
701                         Con_Print("<");
702 #endif
703                         num = node->children[1];
704                         goto loc0;
705                 }
706                 side = 1;
707         }
708         else
709         {
710                 if (t2 >= 0)
711                 {
712 #if COLLISIONPARANOID >= 3
713                         Con_Print(">");
714 #endif
715                         num = node->children[0];
716                         goto loc0;
717                 }
718                 side = 0;
719         }
720
721         // the line intersects, find intersection point
722         // LordHavoc: this uses the original trace for maximum accuracy
723 #if COLLISIONPARANOID >= 3
724         Con_Print("M");
725 #endif
726         if (plane->type < 3)
727         {
728                 t1 = t->start[plane->type] - plane->dist;
729                 t2 = t->end[plane->type] - plane->dist;
730         }
731         else
732         {
733                 t1 = DotProduct (plane->normal, t->start) - plane->dist;
734                 t2 = DotProduct (plane->normal, t->end) - plane->dist;
735         }
736
737         midf = t1 / (t1 - t2);
738         midf = bound(p1f, midf, p2f);
739         VectorMA(t->start, midf, t->dist, mid);
740
741         // recurse both sides, front side first
742         ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side], p1f, midf, p1, mid);
743         // if this side is not empty, return what it is (solid or done)
744         if (ret != HULLCHECKSTATE_EMPTY)
745                 return ret;
746
747         ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side ^ 1], midf, p2f, mid, p2);
748         // if other side is not solid, return what it is (empty or done)
749         if (ret != HULLCHECKSTATE_SOLID)
750                 return ret;
751
752         // front is air and back is solid, this is the impact point...
753         if (side)
754         {
755                 t->trace->plane.dist = -plane->dist;
756                 VectorNegate (plane->normal, t->trace->plane.normal);
757         }
758         else
759         {
760                 t->trace->plane.dist = plane->dist;
761                 VectorCopy (plane->normal, t->trace->plane.normal);
762         }
763
764         // calculate the true fraction
765         t1 = DotProduct(t->trace->plane.normal, t->start) - t->trace->plane.dist;
766         t2 = DotProduct(t->trace->plane.normal, t->end) - t->trace->plane.dist;
767         midf = t1 / (t1 - t2);
768         t->trace->realfraction = bound(0, midf, 1);
769
770         // calculate the return fraction which is nudged off the surface a bit
771         midf = (t1 - DIST_EPSILON) / (t1 - t2);
772         t->trace->fraction = bound(0, midf, 1);
773
774         if (collision_prefernudgedfraction.integer)
775                 t->trace->realfraction = t->trace->fraction;
776
777 #if COLLISIONPARANOID >= 3
778         Con_Print("D");
779 #endif
780         return HULLCHECKSTATE_DONE;
781 }
782
783 //#if COLLISIONPARANOID < 2
784 static int Mod_Q1BSP_RecursiveHullCheckPoint(RecursiveHullCheckTraceInfo_t *t, int num)
785 {
786         while (num >= 0)
787                 num = t->hull->clipnodes[num].children[(t->hull->planes[t->hull->clipnodes[num].planenum].type < 3 ? t->start[t->hull->planes[t->hull->clipnodes[num].planenum].type] : DotProduct(t->hull->planes[t->hull->clipnodes[num].planenum].normal, t->start)) < t->hull->planes[t->hull->clipnodes[num].planenum].dist];
788         num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
789         t->trace->startsupercontents |= num;
790         if (num & SUPERCONTENTS_LIQUIDSMASK)
791                 t->trace->inwater = true;
792         if (num == 0)
793                 t->trace->inopen = true;
794         if (num & t->trace->hitsupercontentsmask)
795         {
796                 t->trace->allsolid = t->trace->startsolid = true;
797                 return HULLCHECKSTATE_SOLID;
798         }
799         else
800         {
801                 t->trace->allsolid = t->trace->startsolid = false;
802                 return HULLCHECKSTATE_EMPTY;
803         }
804 }
805 //#endif
806
807 static void Mod_Q1BSP_TraceBox(struct model_s *model, int frame, trace_t *trace, const vec3_t start, const vec3_t boxmins, const vec3_t boxmaxs, const vec3_t end, int hitsupercontentsmask)
808 {
809         // this function currently only supports same size start and end
810         double boxsize[3];
811         RecursiveHullCheckTraceInfo_t rhc;
812
813         memset(&rhc, 0, sizeof(rhc));
814         memset(trace, 0, sizeof(trace_t));
815         rhc.trace = trace;
816         rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
817         rhc.trace->fraction = 1;
818         rhc.trace->realfraction = 1;
819         rhc.trace->allsolid = true;
820         VectorSubtract(boxmaxs, boxmins, boxsize);
821         if (boxsize[0] < 3)
822                 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
823         else if (model->brush.ismcbsp)
824         {
825                 if (boxsize[2] < 48) // pick the nearest of 40 or 56
826                         rhc.hull = &model->brushq1.hulls[2]; // 16x16x40
827                 else
828                         rhc.hull = &model->brushq1.hulls[1]; // 16x16x56
829         }
830         else if (model->brush.ishlbsp)
831         {
832                 // LordHavoc: this has to have a minor tolerance (the .1) because of
833                 // minor float precision errors from the box being transformed around
834                 if (boxsize[0] < 32.1)
835                 {
836                         if (boxsize[2] < 54) // pick the nearest of 36 or 72
837                                 rhc.hull = &model->brushq1.hulls[3]; // 32x32x36
838                         else
839                                 rhc.hull = &model->brushq1.hulls[1]; // 32x32x72
840                 }
841                 else
842                         rhc.hull = &model->brushq1.hulls[2]; // 64x64x64
843         }
844         else
845         {
846                 // LordHavoc: this has to have a minor tolerance (the .1) because of
847                 // minor float precision errors from the box being transformed around
848                 if (boxsize[0] < 32.1)
849                         rhc.hull = &model->brushq1.hulls[1]; // 32x32x56
850                 else
851                         rhc.hull = &model->brushq1.hulls[2]; // 64x64x88
852         }
853         VectorMAMAM(1, start, 1, boxmins, -1, rhc.hull->clip_mins, rhc.start);
854         VectorMAMAM(1, end, 1, boxmins, -1, rhc.hull->clip_mins, rhc.end);
855         VectorSubtract(rhc.end, rhc.start, rhc.dist);
856 #if COLLISIONPARANOID >= 2
857         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]);
858         Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
859         {
860
861                 double test[3];
862                 trace_t testtrace;
863                 VectorLerp(rhc.start, rhc.trace->fraction, rhc.end, test);
864                 memset(&testtrace, 0, sizeof(trace_t));
865                 rhc.trace = &testtrace;
866                 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
867                 rhc.trace->fraction = 1;
868                 rhc.trace->realfraction = 1;
869                 rhc.trace->allsolid = true;
870                 VectorCopy(test, rhc.start);
871                 VectorCopy(test, rhc.end);
872                 VectorClear(rhc.dist);
873                 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
874                 //Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, test, test);
875                 if (!trace->startsolid && testtrace.startsolid)
876                         Con_Printf(" - ended in solid!\n");
877         }
878         Con_Print("\n");
879 #else
880         if (VectorLength2(rhc.dist))
881                 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
882         else
883                 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
884 #endif
885 }
886
887 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)
888 {
889 #if 1
890         colbrushf_t cbox;
891         colplanef_t cbox_planes[6];
892         cbox.supercontents = boxsupercontents;
893         cbox.numplanes = 6;
894         cbox.numpoints = 0;
895         cbox.numtriangles = 0;
896         cbox.planes = cbox_planes;
897         cbox.points = NULL;
898         cbox.elements = NULL;
899         cbox.markframe = 0;
900         cbox.mins[0] = 0;
901         cbox.mins[1] = 0;
902         cbox.mins[2] = 0;
903         cbox.maxs[0] = 0;
904         cbox.maxs[1] = 0;
905         cbox.maxs[2] = 0;
906         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];
907         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];
908         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];
909         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];
910         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];
911         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];
912         cbox_planes[0].q3surfaceflags = boxq3surfaceflags;cbox_planes[0].texture = boxtexture;
913         cbox_planes[1].q3surfaceflags = boxq3surfaceflags;cbox_planes[1].texture = boxtexture;
914         cbox_planes[2].q3surfaceflags = boxq3surfaceflags;cbox_planes[2].texture = boxtexture;
915         cbox_planes[3].q3surfaceflags = boxq3surfaceflags;cbox_planes[3].texture = boxtexture;
916         cbox_planes[4].q3surfaceflags = boxq3surfaceflags;cbox_planes[4].texture = boxtexture;
917         cbox_planes[5].q3surfaceflags = boxq3surfaceflags;cbox_planes[5].texture = boxtexture;
918         memset(trace, 0, sizeof(trace_t));
919         trace->hitsupercontentsmask = hitsupercontentsmask;
920         trace->fraction = 1;
921         trace->realfraction = 1;
922         Collision_TraceLineBrushFloat(trace, start, end, &cbox, &cbox);
923 #else
924         RecursiveHullCheckTraceInfo_t rhc;
925         static hull_t box_hull;
926         static dclipnode_t box_clipnodes[6];
927         static mplane_t box_planes[6];
928         // fill in a default trace
929         memset(&rhc, 0, sizeof(rhc));
930         memset(trace, 0, sizeof(trace_t));
931         //To keep everything totally uniform, bounding boxes are turned into small
932         //BSP trees instead of being compared directly.
933         // create a temp hull from bounding box sizes
934         box_planes[0].dist = cmaxs[0] - mins[0];
935         box_planes[1].dist = cmins[0] - maxs[0];
936         box_planes[2].dist = cmaxs[1] - mins[1];
937         box_planes[3].dist = cmins[1] - maxs[1];
938         box_planes[4].dist = cmaxs[2] - mins[2];
939         box_planes[5].dist = cmins[2] - maxs[2];
940 #if COLLISIONPARANOID >= 3
941         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]);
942 #endif
943
944         if (box_hull.clipnodes == NULL)
945         {
946                 int i, side;
947
948                 //Set up the planes and clipnodes so that the six floats of a bounding box
949                 //can just be stored out and get a proper hull_t structure.
950
951                 box_hull.clipnodes = box_clipnodes;
952                 box_hull.planes = box_planes;
953                 box_hull.firstclipnode = 0;
954                 box_hull.lastclipnode = 5;
955
956                 for (i = 0;i < 6;i++)
957                 {
958                         box_clipnodes[i].planenum = i;
959
960                         side = i&1;
961
962                         box_clipnodes[i].children[side] = CONTENTS_EMPTY;
963                         if (i != 5)
964                                 box_clipnodes[i].children[side^1] = i + 1;
965                         else
966                                 box_clipnodes[i].children[side^1] = CONTENTS_SOLID;
967
968                         box_planes[i].type = i>>1;
969                         box_planes[i].normal[i>>1] = 1;
970                 }
971         }
972
973         // trace a line through the generated clipping hull
974         //rhc.boxsupercontents = boxsupercontents;
975         rhc.hull = &box_hull;
976         rhc.trace = trace;
977         rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
978         rhc.trace->fraction = 1;
979         rhc.trace->realfraction = 1;
980         rhc.trace->allsolid = true;
981         VectorCopy(start, rhc.start);
982         VectorCopy(end, rhc.end);
983         VectorSubtract(rhc.end, rhc.start, rhc.dist);
984         Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
985         //VectorMA(rhc.start, rhc.trace->fraction, rhc.dist, rhc.trace->endpos);
986         if (rhc.trace->startsupercontents)
987                 rhc.trace->startsupercontents = boxsupercontents;
988 #endif
989 }
990
991 static int Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(mnode_t *node, double p1[3], double p2[3])
992 {
993         double t1, t2;
994         double midf, mid[3];
995         int ret, side;
996
997         // check for empty
998         while (node->plane)
999         {
1000                 // find the point distances
1001                 mplane_t *plane = node->plane;
1002                 if (plane->type < 3)
1003                 {
1004                         t1 = p1[plane->type] - plane->dist;
1005                         t2 = p2[plane->type] - plane->dist;
1006                 }
1007                 else
1008                 {
1009                         t1 = DotProduct (plane->normal, p1) - plane->dist;
1010                         t2 = DotProduct (plane->normal, p2) - plane->dist;
1011                 }
1012
1013                 if (t1 < 0)
1014                 {
1015                         if (t2 < 0)
1016                         {
1017                                 node = node->children[1];
1018                                 continue;
1019                         }
1020                         side = 1;
1021                 }
1022                 else
1023                 {
1024                         if (t2 >= 0)
1025                         {
1026                                 node = node->children[0];
1027                                 continue;
1028                         }
1029                         side = 0;
1030                 }
1031
1032                 midf = t1 / (t1 - t2);
1033                 VectorLerp(p1, midf, p2, mid);
1034
1035                 // recurse both sides, front side first
1036                 // return 2 if empty is followed by solid (hit something)
1037                 // do not return 2 if both are solid or both empty,
1038                 // or if start is solid and end is empty
1039                 // as these degenerate cases usually indicate the eye is in solid and
1040                 // should see the target point anyway
1041                 ret = Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side    ], p1, mid);
1042                 if (ret != 0)
1043                         return ret;
1044                 ret = Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ^ 1], mid, p2);
1045                 if (ret != 1)
1046                         return ret;
1047                 return 2;
1048         }
1049         return ((mleaf_t *)node)->clusterindex < 0;
1050 }
1051
1052 static qboolean Mod_Q1BSP_TraceLineOfSight(struct model_s *model, const vec3_t start, const vec3_t end)
1053 {
1054         // this function currently only supports same size start and end
1055         double tracestart[3], traceend[3];
1056         VectorCopy(start, tracestart);
1057         VectorCopy(end, traceend);
1058         return Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(model->brush.data_nodes, tracestart, traceend) != 2;
1059 }
1060
1061 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)
1062 {
1063         int side;
1064         float front, back;
1065         float mid, distz = endz - startz;
1066
1067 loc0:
1068         if (!node->plane)
1069                 return false;           // didn't hit anything
1070
1071         switch (node->plane->type)
1072         {
1073         case PLANE_X:
1074                 node = node->children[x < node->plane->dist];
1075                 goto loc0;
1076         case PLANE_Y:
1077                 node = node->children[y < node->plane->dist];
1078                 goto loc0;
1079         case PLANE_Z:
1080                 side = startz < node->plane->dist;
1081                 if ((endz < node->plane->dist) == side)
1082                 {
1083                         node = node->children[side];
1084                         goto loc0;
1085                 }
1086                 // found an intersection
1087                 mid = node->plane->dist;
1088                 break;
1089         default:
1090                 back = front = x * node->plane->normal[0] + y * node->plane->normal[1];
1091                 front += startz * node->plane->normal[2];
1092                 back += endz * node->plane->normal[2];
1093                 side = front < node->plane->dist;
1094                 if ((back < node->plane->dist) == side)
1095                 {
1096                         node = node->children[side];
1097                         goto loc0;
1098                 }
1099                 // found an intersection
1100                 mid = startz + distz * (front - node->plane->dist) / (front - back);
1101                 break;
1102         }
1103
1104         // go down front side
1105         if (node->children[side]->plane && Mod_Q1BSP_LightPoint_RecursiveBSPNode(model, ambientcolor, diffusecolor, diffusenormal, node->children[side], x, y, startz, mid))
1106                 return true;    // hit something
1107         else
1108         {
1109                 // check for impact on this node
1110                 if (node->numsurfaces)
1111                 {
1112                         int i, ds, dt;
1113                         msurface_t *surface;
1114
1115                         surface = model->data_surfaces + node->firstsurface;
1116                         for (i = 0;i < node->numsurfaces;i++, surface++)
1117                         {
1118                                 if (!(surface->texture->basematerialflags & MATERIALFLAG_WALL) || !surface->lightmapinfo->samples)
1119                                         continue;       // no lightmaps
1120
1121                                 ds = (int) (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];
1122                                 dt = (int) (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];
1123
1124                                 if (ds >= 0 && ds < surface->lightmapinfo->extents[0] && dt >= 0 && dt < surface->lightmapinfo->extents[1])
1125                                 {
1126                                         unsigned char *lightmap;
1127                                         int lmwidth, lmheight, maps, line3, size3, dsfrac = ds & 15, dtfrac = dt & 15, scale = 0, r00 = 0, g00 = 0, b00 = 0, r01 = 0, g01 = 0, b01 = 0, r10 = 0, g10 = 0, b10 = 0, r11 = 0, g11 = 0, b11 = 0;
1128                                         lmwidth = ((surface->lightmapinfo->extents[0]>>4)+1);
1129                                         lmheight = ((surface->lightmapinfo->extents[1]>>4)+1);
1130                                         line3 = lmwidth * 3; // LordHavoc: *3 for colored lighting
1131                                         size3 = lmwidth * lmheight * 3; // LordHavoc: *3 for colored lighting
1132
1133                                         lightmap = surface->lightmapinfo->samples + ((dt>>4) * lmwidth + (ds>>4))*3; // LordHavoc: *3 for colored lighting
1134
1135                                         for (maps = 0;maps < MAXLIGHTMAPS && surface->lightmapinfo->styles[maps] != 255;maps++)
1136                                         {
1137                                                 scale = r_refdef.lightstylevalue[surface->lightmapinfo->styles[maps]];
1138                                                 r00 += lightmap[      0] * scale;g00 += lightmap[      1] * scale;b00 += lightmap[      2] * scale;
1139                                                 r01 += lightmap[      3] * scale;g01 += lightmap[      4] * scale;b01 += lightmap[      5] * scale;
1140                                                 r10 += lightmap[line3+0] * scale;g10 += lightmap[line3+1] * scale;b10 += lightmap[line3+2] * scale;
1141                                                 r11 += lightmap[line3+3] * scale;g11 += lightmap[line3+4] * scale;b11 += lightmap[line3+5] * scale;
1142                                                 lightmap += size3;
1143                                         }
1144
1145 /*
1146 LordHavoc: here's the readable version of the interpolation
1147 code, not quite as easy for the compiler to optimize...
1148
1149 dsfrac is the X position in the lightmap pixel, * 16
1150 dtfrac is the Y position in the lightmap pixel, * 16
1151 r00 is top left corner, r01 is top right corner
1152 r10 is bottom left corner, r11 is bottom right corner
1153 g and b are the same layout.
1154 r0 and r1 are the top and bottom intermediate results
1155
1156 first we interpolate the top two points, to get the top
1157 edge sample
1158
1159         r0 = (((r01-r00) * dsfrac) >> 4) + r00;
1160         g0 = (((g01-g00) * dsfrac) >> 4) + g00;
1161         b0 = (((b01-b00) * dsfrac) >> 4) + b00;
1162
1163 then we interpolate the bottom two points, to get the
1164 bottom edge sample
1165
1166         r1 = (((r11-r10) * dsfrac) >> 4) + r10;
1167         g1 = (((g11-g10) * dsfrac) >> 4) + g10;
1168         b1 = (((b11-b10) * dsfrac) >> 4) + b10;
1169
1170 then we interpolate the top and bottom samples to get the
1171 middle sample (the one which was requested)
1172
1173         r = (((r1-r0) * dtfrac) >> 4) + r0;
1174         g = (((g1-g0) * dtfrac) >> 4) + g0;
1175         b = (((b1-b0) * dtfrac) >> 4) + b0;
1176 */
1177
1178                                         ambientcolor[0] += (float) ((((((((r11-r10) * dsfrac) >> 4) + r10)-((((r01-r00) * dsfrac) >> 4) + r00)) * dtfrac) >> 4) + ((((r01-r00) * dsfrac) >> 4) + r00)) * (1.0f / 32768.0f);
1179                                         ambientcolor[1] += (float) ((((((((g11-g10) * dsfrac) >> 4) + g10)-((((g01-g00) * dsfrac) >> 4) + g00)) * dtfrac) >> 4) + ((((g01-g00) * dsfrac) >> 4) + g00)) * (1.0f / 32768.0f);
1180                                         ambientcolor[2] += (float) ((((((((b11-b10) * dsfrac) >> 4) + b10)-((((b01-b00) * dsfrac) >> 4) + b00)) * dtfrac) >> 4) + ((((b01-b00) * dsfrac) >> 4) + b00)) * (1.0f / 32768.0f);
1181                                         return true; // success
1182                                 }
1183                         }
1184                 }
1185
1186                 // go down back side
1187                 node = node->children[side ^ 1];
1188                 startz = mid;
1189                 distz = endz - startz;
1190                 goto loc0;
1191         }
1192 }
1193
1194 void Mod_Q1BSP_LightPoint(model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
1195 {
1196         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);
1197         // pretend lighting is coming down from above (due to lack of a lightgrid to know primary lighting direction)
1198         VectorSet(diffusenormal, 0, 0, 1);
1199 }
1200
1201 static void Mod_Q1BSP_DecompressVis(const unsigned char *in, const unsigned char *inend, unsigned char *out, unsigned char *outend)
1202 {
1203         int c;
1204         unsigned char *outstart = out;
1205         while (out < outend)
1206         {
1207                 if (in == inend)
1208                 {
1209                         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));
1210                         return;
1211                 }
1212                 c = *in++;
1213                 if (c)
1214                         *out++ = c;
1215                 else
1216                 {
1217                         if (in == inend)
1218                         {
1219                                 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));
1220                                 return;
1221                         }
1222                         for (c = *in++;c > 0;c--)
1223                         {
1224                                 if (out == outend)
1225                                 {
1226                                         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));
1227                                         return;
1228                                 }
1229                                 *out++ = 0;
1230                         }
1231                 }
1232         }
1233 }
1234
1235 /*
1236 =============
1237 R_Q1BSP_LoadSplitSky
1238
1239 A sky texture is 256*128, with the right side being a masked overlay
1240 ==============
1241 */
1242 void R_Q1BSP_LoadSplitSky (unsigned char *src, int width, int height, int bytesperpixel)
1243 {
1244         int i, j;
1245         unsigned solidpixels[128*128], alphapixels[128*128];
1246
1247         // if sky isn't the right size, just use it as a solid layer
1248         if (width != 256 || height != 128)
1249         {
1250                 loadmodel->brush.solidskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_solidtexture", width, height, src, bytesperpixel == 4 ? TEXTYPE_RGBA : TEXTYPE_PALETTE, TEXF_PRECACHE, bytesperpixel == 1 ? palette_complete : NULL);
1251                 loadmodel->brush.alphaskytexture = NULL;
1252                 return;
1253         }
1254
1255         if (bytesperpixel == 4)
1256         {
1257                 for (i = 0;i < 128;i++)
1258                 {
1259                         for (j = 0;j < 128;j++)
1260                         {
1261                                 solidpixels[(i*128) + j] = ((unsigned *)src)[i*256+j+128];
1262                                 alphapixels[(i*128) + j] = ((unsigned *)src)[i*256+j];
1263                         }
1264                 }
1265         }
1266         else
1267         {
1268                 // make an average value for the back to avoid
1269                 // a fringe on the top level
1270                 int p, r, g, b;
1271                 union
1272                 {
1273                         unsigned int i;
1274                         unsigned char b[4];
1275                 }
1276                 rgba;
1277                 r = g = b = 0;
1278                 for (i = 0;i < 128;i++)
1279                 {
1280                         for (j = 0;j < 128;j++)
1281                         {
1282                                 rgba.i = palette_complete[src[i*256 + j + 128]];
1283                                 r += rgba.b[0];
1284                                 g += rgba.b[1];
1285                                 b += rgba.b[2];
1286                         }
1287                 }
1288                 rgba.b[0] = r/(128*128);
1289                 rgba.b[1] = g/(128*128);
1290                 rgba.b[2] = b/(128*128);
1291                 rgba.b[3] = 0;
1292                 for (i = 0;i < 128;i++)
1293                 {
1294                         for (j = 0;j < 128;j++)
1295                         {
1296                                 solidpixels[(i*128) + j] = palette_complete[src[i*256 + j + 128]];
1297                                 alphapixels[(i*128) + j] = (p = src[i*256 + j]) ? palette_complete[p] : rgba.i;
1298                         }
1299                 }
1300         }
1301
1302         loadmodel->brush.solidskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_solidtexture", 128, 128, (unsigned char *) solidpixels, TEXTYPE_RGBA, TEXF_PRECACHE, NULL);
1303         loadmodel->brush.alphaskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_alphatexture", 128, 128, (unsigned char *) alphapixels, TEXTYPE_RGBA, TEXF_ALPHA | TEXF_PRECACHE, NULL);
1304 }
1305
1306 static void Mod_Q1BSP_LoadTextures(lump_t *l)
1307 {
1308         int i, j, k, num, max, altmax, mtwidth, mtheight, *dofs, incomplete;
1309         miptex_t *dmiptex;
1310         texture_t *tx, *tx2, *anims[10], *altanims[10];
1311         dmiptexlump_t *m;
1312         unsigned char *data, *mtdata;
1313         const char *s;
1314         char mapname[MAX_QPATH], name[MAX_QPATH];
1315
1316         loadmodel->data_textures = NULL;
1317
1318         // add two slots for notexture walls and notexture liquids
1319         if (l->filelen)
1320         {
1321                 m = (dmiptexlump_t *)(mod_base + l->fileofs);
1322                 m->nummiptex = LittleLong (m->nummiptex);
1323                 loadmodel->num_textures = m->nummiptex + 2;
1324         }
1325         else
1326         {
1327                 m = NULL;
1328                 loadmodel->num_textures = 2;
1329         }
1330
1331         loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_textures * sizeof(texture_t));
1332
1333         // fill out all slots with notexture
1334         for (i = 0, tx = loadmodel->data_textures;i < loadmodel->num_textures;i++, tx++)
1335         {
1336                 strlcpy(tx->name, "NO TEXTURE FOUND", sizeof(tx->name));
1337                 tx->width = 16;
1338                 tx->height = 16;
1339                 tx->numskinframes = 1;
1340                 tx->skinframerate = 1;
1341                 tx->currentskinframe = tx->skinframes;
1342                 tx->skinframes[0].base = r_texture_notexture;
1343                 tx->backgroundcurrentskinframe = tx->backgroundskinframes;
1344                 tx->basematerialflags = 0;
1345                 if (i == loadmodel->num_textures - 1)
1346                 {
1347                         tx->basematerialflags |= MATERIALFLAG_WATER | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1348                         tx->supercontents = mod_q1bsp_texture_water.supercontents;
1349                         tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1350                 }
1351                 else
1352                 {
1353                         tx->basematerialflags |= MATERIALFLAG_WALL;
1354                         tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1355                         tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1356                 }
1357                 tx->currentframe = tx;
1358         }
1359
1360         if (!m)
1361                 return;
1362
1363         s = loadmodel->name;
1364         if (!strncasecmp(s, "maps/", 5))
1365                 s += 5;
1366         FS_StripExtension(s, mapname, sizeof(mapname));
1367
1368         // just to work around bounds checking when debugging with it (array index out of bounds error thing)
1369         dofs = m->dataofs;
1370         // LordHavoc: mostly rewritten map texture loader
1371         for (i = 0;i < m->nummiptex;i++)
1372         {
1373                 dofs[i] = LittleLong(dofs[i]);
1374                 if (dofs[i] == -1 || r_nosurftextures.integer)
1375                         continue;
1376                 dmiptex = (miptex_t *)((unsigned char *)m + dofs[i]);
1377
1378                 // make sure name is no more than 15 characters
1379                 for (j = 0;dmiptex->name[j] && j < 15;j++)
1380                         name[j] = dmiptex->name[j];
1381                 name[j] = 0;
1382
1383                 mtwidth = LittleLong(dmiptex->width);
1384                 mtheight = LittleLong(dmiptex->height);
1385                 mtdata = NULL;
1386                 j = LittleLong(dmiptex->offsets[0]);
1387                 if (j)
1388                 {
1389                         // texture included
1390                         if (j < 40 || j + mtwidth * mtheight > l->filelen)
1391                         {
1392                                 Con_Printf("Texture \"%s\" in \"%s\"is corrupt or incomplete\n", dmiptex->name, loadmodel->name);
1393                                 continue;
1394                         }
1395                         mtdata = (unsigned char *)dmiptex + j;
1396                 }
1397
1398                 if ((mtwidth & 15) || (mtheight & 15))
1399                         Con_Printf("warning: texture \"%s\" in \"%s\" is not 16 aligned\n", dmiptex->name, loadmodel->name);
1400
1401                 // LordHavoc: force all names to lowercase
1402                 for (j = 0;name[j];j++)
1403                         if (name[j] >= 'A' && name[j] <= 'Z')
1404                                 name[j] += 'a' - 'A';
1405
1406                 tx = loadmodel->data_textures + i;
1407                 strlcpy(tx->name, name, sizeof(tx->name));
1408                 tx->width = mtwidth;
1409                 tx->height = mtheight;
1410
1411                 if (!tx->name[0])
1412                 {
1413                         sprintf(tx->name, "unnamed%i", i);
1414                         Con_Printf("warning: unnamed texture in %s, renaming to %s\n", loadmodel->name, tx->name);
1415                 }
1416
1417                 if (cls.state != ca_dedicated)
1418                 {
1419                         // LordHavoc: HL sky textures are entirely different than quake
1420                         if (!loadmodel->brush.ishlbsp && !strncmp(tx->name, "sky", 3) && mtwidth == 256 && mtheight == 128)
1421                         {
1422                                 if (loadmodel->isworldmodel)
1423                                 {
1424                                         data = loadimagepixels(tx->name, false, 0, 0);
1425                                         if (data)
1426                                         {
1427                                                 R_Q1BSP_LoadSplitSky(data, image_width, image_height, 4);
1428                                                 Mem_Free(data);
1429                                         }
1430                                         else if (mtdata != NULL)
1431                                                 R_Q1BSP_LoadSplitSky(mtdata, mtwidth, mtheight, 1);
1432                                 }
1433                         }
1434                         else
1435                         {
1436                                 if (!Mod_LoadSkinFrame(&tx->skinframes[0], gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s/%s", mapname, tx->name), TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE | TEXF_PICMIP, false, true)
1437                                  && !Mod_LoadSkinFrame(&tx->skinframes[0], gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s", tx->name), TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE | TEXF_PICMIP, false, true))
1438                                 {
1439                                         // did not find external texture, load it from the bsp or wad3
1440                                         if (loadmodel->brush.ishlbsp)
1441                                         {
1442                                                 // internal texture overrides wad
1443                                                 unsigned char *pixels, *freepixels;
1444                                                 pixels = freepixels = NULL;
1445                                                 if (mtdata)
1446                                                         pixels = W_ConvertWAD3Texture(dmiptex);
1447                                                 if (pixels == NULL)
1448                                                         pixels = freepixels = W_GetTexture(tx->name);
1449                                                 if (pixels != NULL)
1450                                                 {
1451                                                         tx->width = image_width;
1452                                                         tx->height = image_height;
1453                                                         Mod_LoadSkinFrame_Internal(&tx->skinframes[0], tx->name, TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE | TEXF_PICMIP, false, false, pixels, image_width, image_height, 32, NULL, NULL);
1454                                                 }
1455                                                 if (freepixels)
1456                                                         Mem_Free(freepixels);
1457                                         }
1458                                         else if (mtdata) // texture included
1459                                                 Mod_LoadSkinFrame_Internal(&tx->skinframes[0], tx->name, TEXF_MIPMAP | TEXF_PRECACHE | TEXF_PICMIP, false, r_fullbrights.integer, mtdata, tx->width, tx->height, 8, NULL, NULL);
1460                                 }
1461                         }
1462                         if (tx->skinframes[0].base == NULL)
1463                         {
1464                                 // no texture found
1465                                 tx->width = 16;
1466                                 tx->height = 16;
1467                                 tx->skinframes[0].base = r_texture_notexture;
1468                         }
1469                 }
1470
1471                 tx->basematerialflags = 0;
1472                 if (tx->name[0] == '*')
1473                 {
1474                         // LordHavoc: some turbulent textures should not be affected by wateralpha
1475                         if (strncmp(tx->name,"*lava",5)
1476                          && strncmp(tx->name,"*teleport",9)
1477                          && strncmp(tx->name,"*rift",5)) // Scourge of Armagon texture
1478                                 tx->basematerialflags |= MATERIALFLAG_WATERALPHA | MATERIALFLAG_NOSHADOW;
1479                         if (!strncmp(tx->name, "*lava", 5))
1480                         {
1481                                 tx->supercontents = mod_q1bsp_texture_lava.supercontents;
1482                                 tx->surfaceflags = mod_q1bsp_texture_lava.surfaceflags;
1483                         }
1484                         else if (!strncmp(tx->name, "*slime", 6))
1485                         {
1486                                 tx->supercontents = mod_q1bsp_texture_slime.supercontents;
1487                                 tx->surfaceflags = mod_q1bsp_texture_slime.surfaceflags;
1488                         }
1489                         else
1490                         {
1491                                 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1492                                 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1493                         }
1494                         tx->basematerialflags |= MATERIALFLAG_WATER | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1495                 }
1496                 else if (tx->name[0] == 's' && tx->name[1] == 'k' && tx->name[2] == 'y')
1497                 {
1498                         tx->supercontents = mod_q1bsp_texture_sky.supercontents;
1499                         tx->surfaceflags = mod_q1bsp_texture_sky.surfaceflags;
1500                         tx->basematerialflags |= MATERIALFLAG_SKY | MATERIALFLAG_NOSHADOW;
1501                 }
1502                 else
1503                 {
1504                         tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1505                         tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1506                         tx->basematerialflags |= MATERIALFLAG_WALL;
1507                 }
1508                 if (tx->skinframes[0].fog)
1509                         tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_TRANSPARENT | MATERIALFLAG_NOSHADOW;
1510
1511                 // start out with no animation
1512                 tx->currentframe = tx;
1513         }
1514
1515         // sequence the animations
1516         for (i = 0;i < m->nummiptex;i++)
1517         {
1518                 tx = loadmodel->data_textures + i;
1519                 if (!tx || tx->name[0] != '+' || tx->name[1] == 0 || tx->name[2] == 0)
1520                         continue;
1521                 if (tx->anim_total[0] || tx->anim_total[1])
1522                         continue;       // already sequenced
1523
1524                 // find the number of frames in the animation
1525                 memset(anims, 0, sizeof(anims));
1526                 memset(altanims, 0, sizeof(altanims));
1527
1528                 for (j = i;j < m->nummiptex;j++)
1529                 {
1530                         tx2 = loadmodel->data_textures + j;
1531                         if (!tx2 || tx2->name[0] != '+' || strcmp(tx2->name+2, tx->name+2))
1532                                 continue;
1533
1534                         num = tx2->name[1];
1535                         if (num >= '0' && num <= '9')
1536                                 anims[num - '0'] = tx2;
1537                         else if (num >= 'a' && num <= 'j')
1538                                 altanims[num - 'a'] = tx2;
1539                         else
1540                                 Con_Printf("Bad animating texture %s\n", tx->name);
1541                 }
1542
1543                 max = altmax = 0;
1544                 for (j = 0;j < 10;j++)
1545                 {
1546                         if (anims[j])
1547                                 max = j + 1;
1548                         if (altanims[j])
1549                                 altmax = j + 1;
1550                 }
1551                 //Con_Printf("linking animation %s (%i:%i frames)\n\n", tx->name, max, altmax);
1552
1553                 incomplete = false;
1554                 for (j = 0;j < max;j++)
1555                 {
1556                         if (!anims[j])
1557                         {
1558                                 Con_Printf("Missing frame %i of %s\n", j, tx->name);
1559                                 incomplete = true;
1560                         }
1561                 }
1562                 for (j = 0;j < altmax;j++)
1563                 {
1564                         if (!altanims[j])
1565                         {
1566                                 Con_Printf("Missing altframe %i of %s\n", j, tx->name);
1567                                 incomplete = true;
1568                         }
1569                 }
1570                 if (incomplete)
1571                         continue;
1572
1573                 if (altmax < 1)
1574                 {
1575                         // if there is no alternate animation, duplicate the primary
1576                         // animation into the alternate
1577                         altmax = max;
1578                         for (k = 0;k < 10;k++)
1579                                 altanims[k] = anims[k];
1580                 }
1581
1582                 // link together the primary animation
1583                 for (j = 0;j < max;j++)
1584                 {
1585                         tx2 = anims[j];
1586                         tx2->animated = true;
1587                         tx2->anim_total[0] = max;
1588                         tx2->anim_total[1] = altmax;
1589                         for (k = 0;k < 10;k++)
1590                         {
1591                                 tx2->anim_frames[0][k] = anims[k];
1592                                 tx2->anim_frames[1][k] = altanims[k];
1593                         }
1594                 }
1595
1596                 // if there really is an alternate anim...
1597                 if (anims[0] != altanims[0])
1598                 {
1599                         // link together the alternate animation
1600                         for (j = 0;j < altmax;j++)
1601                         {
1602                                 tx2 = altanims[j];
1603                                 tx2->animated = true;
1604                                 // the primary/alternate are reversed here
1605                                 tx2->anim_total[0] = altmax;
1606                                 tx2->anim_total[1] = max;
1607                                 for (k = 0;k < 10;k++)
1608                                 {
1609                                         tx2->anim_frames[0][k] = altanims[k];
1610                                         tx2->anim_frames[1][k] = anims[k];
1611                                 }
1612                         }
1613                 }
1614         }
1615 }
1616
1617 static void Mod_Q1BSP_LoadLighting(lump_t *l)
1618 {
1619         int i;
1620         unsigned char *in, *out, *data, d;
1621         char litfilename[MAX_QPATH];
1622         char dlitfilename[MAX_QPATH];
1623         fs_offset_t filesize;
1624         if (loadmodel->brush.ishlbsp) // LordHavoc: load the colored lighting data straight
1625         {
1626                 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1627                 for (i=0; i<l->filelen; i++)
1628                         loadmodel->brushq1.lightdata[i] = mod_base[l->fileofs+i] >>= 1;
1629         }
1630         else if (loadmodel->brush.ismcbsp)
1631         {
1632                 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1633                 memcpy(loadmodel->brushq1.lightdata, mod_base + l->fileofs, l->filelen);
1634         }
1635         else // LordHavoc: bsp version 29 (normal white lighting)
1636         {
1637                 // LordHavoc: hope is not lost yet, check for a .lit file to load
1638                 strlcpy (litfilename, loadmodel->name, sizeof (litfilename));
1639                 FS_StripExtension (litfilename, litfilename, sizeof (litfilename));
1640                 strlcpy (dlitfilename, litfilename, sizeof (dlitfilename));
1641                 strlcat (litfilename, ".lit", sizeof (litfilename));
1642                 strlcat (dlitfilename, ".dlit", sizeof (dlitfilename));
1643                 data = (unsigned char*) FS_LoadFile(litfilename, tempmempool, false, &filesize);
1644                 if (data)
1645                 {
1646                         if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1647                         {
1648                                 i = LittleLong(((int *)data)[1]);
1649                                 if (i == 1)
1650                                 {
1651                                         Con_DPrintf("loaded %s\n", litfilename);
1652                                         loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1653                                         memcpy(loadmodel->brushq1.lightdata, data + 8, filesize - 8);
1654                                         Mem_Free(data);
1655                                         data = (unsigned char*) FS_LoadFile(dlitfilename, tempmempool, false, &filesize);
1656                                         if (data)
1657                                         {
1658                                                 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1659                                                 {
1660                                                         i = LittleLong(((int *)data)[1]);
1661                                                         if (i == 1)
1662                                                         {
1663                                                                 Con_DPrintf("loaded %s\n", dlitfilename);
1664                                                                 loadmodel->brushq1.nmaplightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1665                                                                 memcpy(loadmodel->brushq1.nmaplightdata, data + 8, filesize - 8);
1666                                                                 loadmodel->brushq3.deluxemapping_modelspace = false;
1667                                                                 loadmodel->brushq3.deluxemapping = true;
1668                                                         }
1669                                                 }
1670                                                 Mem_Free(data);
1671                                                 data = NULL;
1672                                         }
1673                                         return;
1674                                 }
1675                                 else
1676                                         Con_Printf("Unknown .lit file version (%d)\n", i);
1677                         }
1678                         else if (filesize == 8)
1679                                 Con_Print("Empty .lit file, ignoring\n");
1680                         else
1681                                 Con_Printf("Corrupt .lit file (file size %i bytes, should be %i bytes), ignoring\n", (int) filesize, (int) (8 + l->filelen * 3));
1682                         if (data)
1683                         {
1684                                 Mem_Free(data);
1685                                 data = NULL;
1686                         }
1687                 }
1688                 // LordHavoc: oh well, expand the white lighting data
1689                 if (!l->filelen)
1690                         return;
1691                 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen*3);
1692                 in = mod_base + l->fileofs;
1693                 out = loadmodel->brushq1.lightdata;
1694                 for (i = 0;i < l->filelen;i++)
1695                 {
1696                         d = *in++;
1697                         *out++ = d;
1698                         *out++ = d;
1699                         *out++ = d;
1700                 }
1701         }
1702 }
1703
1704 static void Mod_Q1BSP_LoadVisibility(lump_t *l)
1705 {
1706         loadmodel->brushq1.num_compressedpvs = 0;
1707         loadmodel->brushq1.data_compressedpvs = NULL;
1708         if (!l->filelen)
1709                 return;
1710         loadmodel->brushq1.num_compressedpvs = l->filelen;
1711         loadmodel->brushq1.data_compressedpvs = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1712         memcpy(loadmodel->brushq1.data_compressedpvs, mod_base + l->fileofs, l->filelen);
1713 }
1714
1715 // used only for HalfLife maps
1716 static void Mod_Q1BSP_ParseWadsFromEntityLump(const char *data)
1717 {
1718         char key[128], value[4096];
1719         char wadname[128];
1720         int i, j, k;
1721         if (!data)
1722                 return;
1723         if (!COM_ParseTokenConsole(&data))
1724                 return; // error
1725         if (com_token[0] != '{')
1726                 return; // error
1727         while (1)
1728         {
1729                 if (!COM_ParseTokenConsole(&data))
1730                         return; // error
1731                 if (com_token[0] == '}')
1732                         break; // end of worldspawn
1733                 if (com_token[0] == '_')
1734                         strlcpy(key, com_token + 1, sizeof(key));
1735                 else
1736                         strlcpy(key, com_token, sizeof(key));
1737                 while (key[strlen(key)-1] == ' ') // remove trailing spaces
1738                         key[strlen(key)-1] = 0;
1739                 if (!COM_ParseTokenConsole(&data))
1740                         return; // error
1741                 dpsnprintf(value, sizeof(value), "%s", com_token);
1742                 if (!strcmp("wad", key)) // for HalfLife maps
1743                 {
1744                         if (loadmodel->brush.ishlbsp)
1745                         {
1746                                 j = 0;
1747                                 for (i = 0;i < (int)sizeof(value);i++)
1748                                         if (value[i] != ';' && value[i] != '\\' && value[i] != '/' && value[i] != ':')
1749                                                 break;
1750                                 if (value[i])
1751                                 {
1752                                         for (;i < (int)sizeof(value);i++)
1753                                         {
1754                                                 // ignore path - the \\ check is for HalfLife... stupid windoze 'programmers'...
1755                                                 if (value[i] == '\\' || value[i] == '/' || value[i] == ':')
1756                                                         j = i+1;
1757                                                 else if (value[i] == ';' || value[i] == 0)
1758                                                 {
1759                                                         k = value[i];
1760                                                         value[i] = 0;
1761                                                         strlcpy(wadname, "textures/", sizeof(wadname));
1762                                                         strlcat(wadname, &value[j], sizeof(wadname));
1763                                                         W_LoadTextureWadFile(wadname, false);
1764                                                         j = i+1;
1765                                                         if (!k)
1766                                                                 break;
1767                                                 }
1768                                         }
1769                                 }
1770                         }
1771                 }
1772         }
1773 }
1774
1775 static void Mod_Q1BSP_LoadEntities(lump_t *l)
1776 {
1777         loadmodel->brush.entities = NULL;
1778         if (!l->filelen)
1779                 return;
1780         loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1781         memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
1782         if (loadmodel->brush.ishlbsp)
1783                 Mod_Q1BSP_ParseWadsFromEntityLump(loadmodel->brush.entities);
1784 }
1785
1786
1787 static void Mod_Q1BSP_LoadVertexes(lump_t *l)
1788 {
1789         dvertex_t       *in;
1790         mvertex_t       *out;
1791         int                     i, count;
1792
1793         in = (dvertex_t *)(mod_base + l->fileofs);
1794         if (l->filelen % sizeof(*in))
1795                 Host_Error("Mod_Q1BSP_LoadVertexes: funny lump size in %s",loadmodel->name);
1796         count = l->filelen / sizeof(*in);
1797         out = (mvertex_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
1798
1799         loadmodel->brushq1.vertexes = out;
1800         loadmodel->brushq1.numvertexes = count;
1801
1802         for ( i=0 ; i<count ; i++, in++, out++)
1803         {
1804                 out->position[0] = LittleFloat(in->point[0]);
1805                 out->position[1] = LittleFloat(in->point[1]);
1806                 out->position[2] = LittleFloat(in->point[2]);
1807         }
1808 }
1809
1810 // The following two functions should be removed and MSG_* or SZ_* function sets adjusted so they
1811 // can be used for this
1812 // REMOVEME
1813 int SB_ReadInt (unsigned char **buffer)
1814 {
1815         int     i;
1816         i = ((*buffer)[0]) + 256*((*buffer)[1]) + 65536*((*buffer)[2]) + 16777216*((*buffer)[3]);
1817         (*buffer) += 4;
1818         return i;
1819 }
1820
1821 // REMOVEME
1822 float SB_ReadFloat (unsigned char **buffer)
1823 {
1824         union
1825         {
1826                 int             i;
1827                 float   f;
1828         } u;
1829
1830         u.i = SB_ReadInt (buffer);
1831         return u.f;
1832 }
1833
1834 static void Mod_Q1BSP_LoadSubmodels(lump_t *l, hullinfo_t *hullinfo)
1835 {
1836         unsigned char           *index;
1837         dmodel_t        *out;
1838         int                     i, j, count;
1839
1840         index = (unsigned char *)(mod_base + l->fileofs);
1841         if (l->filelen % (48+4*hullinfo->filehulls))
1842                 Host_Error ("Mod_Q1BSP_LoadSubmodels: funny lump size in %s", loadmodel->name);
1843
1844         count = l->filelen / (48+4*hullinfo->filehulls);
1845         out = (dmodel_t *)Mem_Alloc (loadmodel->mempool, count*sizeof(*out));
1846
1847         loadmodel->brushq1.submodels = out;
1848         loadmodel->brush.numsubmodels = count;
1849
1850         for (i = 0; i < count; i++, out++)
1851         {
1852         // spread out the mins / maxs by a pixel
1853                 out->mins[0] = SB_ReadFloat (&index) - 1;
1854                 out->mins[1] = SB_ReadFloat (&index) - 1;
1855                 out->mins[2] = SB_ReadFloat (&index) - 1;
1856                 out->maxs[0] = SB_ReadFloat (&index) + 1;
1857                 out->maxs[1] = SB_ReadFloat (&index) + 1;
1858                 out->maxs[2] = SB_ReadFloat (&index) + 1;
1859                 out->origin[0] = SB_ReadFloat (&index);
1860                 out->origin[1] = SB_ReadFloat (&index);
1861                 out->origin[2] = SB_ReadFloat (&index);
1862                 for (j = 0; j < hullinfo->filehulls; j++)
1863                         out->headnode[j] = SB_ReadInt (&index);
1864                 out->visleafs = SB_ReadInt (&index);
1865                 out->firstface = SB_ReadInt (&index);
1866                 out->numfaces = SB_ReadInt (&index);
1867         }
1868 }
1869
1870 static void Mod_Q1BSP_LoadEdges(lump_t *l)
1871 {
1872         dedge_t *in;
1873         medge_t *out;
1874         int     i, count;
1875
1876         in = (dedge_t *)(mod_base + l->fileofs);
1877         if (l->filelen % sizeof(*in))
1878                 Host_Error("Mod_Q1BSP_LoadEdges: funny lump size in %s",loadmodel->name);
1879         count = l->filelen / sizeof(*in);
1880         out = (medge_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1881
1882         loadmodel->brushq1.edges = out;
1883         loadmodel->brushq1.numedges = count;
1884
1885         for ( i=0 ; i<count ; i++, in++, out++)
1886         {
1887                 out->v[0] = (unsigned short)LittleShort(in->v[0]);
1888                 out->v[1] = (unsigned short)LittleShort(in->v[1]);
1889                 if (out->v[0] >= loadmodel->brushq1.numvertexes || out->v[1] >= loadmodel->brushq1.numvertexes)
1890                 {
1891                         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);
1892                         out->v[0] = 0;
1893                         out->v[1] = 0;
1894                 }
1895         }
1896 }
1897
1898 static void Mod_Q1BSP_LoadTexinfo(lump_t *l)
1899 {
1900         texinfo_t *in;
1901         mtexinfo_t *out;
1902         int i, j, k, count, miptex;
1903
1904         in = (texinfo_t *)(mod_base + l->fileofs);
1905         if (l->filelen % sizeof(*in))
1906                 Host_Error("Mod_Q1BSP_LoadTexinfo: funny lump size in %s",loadmodel->name);
1907         count = l->filelen / sizeof(*in);
1908         out = (mtexinfo_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1909
1910         loadmodel->brushq1.texinfo = out;
1911         loadmodel->brushq1.numtexinfo = count;
1912
1913         for (i = 0;i < count;i++, in++, out++)
1914         {
1915                 for (k = 0;k < 2;k++)
1916                         for (j = 0;j < 4;j++)
1917                                 out->vecs[k][j] = LittleFloat(in->vecs[k][j]);
1918
1919                 miptex = LittleLong(in->miptex);
1920                 out->flags = LittleLong(in->flags);
1921
1922                 out->texture = NULL;
1923                 if (loadmodel->data_textures)
1924                 {
1925                         if ((unsigned int) miptex >= (unsigned int) loadmodel->num_textures)
1926                                 Con_Printf("error in model \"%s\": invalid miptex index %i(of %i)\n", loadmodel->name, miptex, loadmodel->num_textures);
1927                         else
1928                                 out->texture = loadmodel->data_textures + miptex;
1929                 }
1930                 if (out->flags & TEX_SPECIAL)
1931                 {
1932                         // if texture chosen is NULL or the shader needs a lightmap,
1933                         // force to notexture water shader
1934                         if (out->texture == NULL || out->texture->basematerialflags & MATERIALFLAG_WALL)
1935                                 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 1);
1936                 }
1937                 else
1938                 {
1939                         // if texture chosen is NULL, force to notexture
1940                         if (out->texture == NULL)
1941                                 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 2);
1942                 }
1943         }
1944 }
1945
1946 #if 0
1947 void BoundPoly(int numverts, float *verts, vec3_t mins, vec3_t maxs)
1948 {
1949         int             i, j;
1950         float   *v;
1951
1952         mins[0] = mins[1] = mins[2] = 9999;
1953         maxs[0] = maxs[1] = maxs[2] = -9999;
1954         v = verts;
1955         for (i = 0;i < numverts;i++)
1956         {
1957                 for (j = 0;j < 3;j++, v++)
1958                 {
1959                         if (*v < mins[j])
1960                                 mins[j] = *v;
1961                         if (*v > maxs[j])
1962                                 maxs[j] = *v;
1963                 }
1964         }
1965 }
1966
1967 #define MAX_SUBDIVPOLYTRIANGLES 4096
1968 #define MAX_SUBDIVPOLYVERTS(MAX_SUBDIVPOLYTRIANGLES * 3)
1969
1970 static int subdivpolyverts, subdivpolytriangles;
1971 static int subdivpolyindex[MAX_SUBDIVPOLYTRIANGLES][3];
1972 static float subdivpolyvert[MAX_SUBDIVPOLYVERTS][3];
1973
1974 static int subdivpolylookupvert(vec3_t v)
1975 {
1976         int i;
1977         for (i = 0;i < subdivpolyverts;i++)
1978                 if (subdivpolyvert[i][0] == v[0]
1979                  && subdivpolyvert[i][1] == v[1]
1980                  && subdivpolyvert[i][2] == v[2])
1981                         return i;
1982         if (subdivpolyverts >= MAX_SUBDIVPOLYVERTS)
1983                 Host_Error("SubDividePolygon: ran out of vertices in buffer, please increase your r_subdivide_size");
1984         VectorCopy(v, subdivpolyvert[subdivpolyverts]);
1985         return subdivpolyverts++;
1986 }
1987
1988 static void SubdividePolygon(int numverts, float *verts)
1989 {
1990         int             i, i1, i2, i3, f, b, c, p;
1991         vec3_t  mins, maxs, front[256], back[256];
1992         float   m, *pv, *cv, dist[256], frac;
1993
1994         if (numverts > 250)
1995                 Host_Error("SubdividePolygon: ran out of verts in buffer");
1996
1997         BoundPoly(numverts, verts, mins, maxs);
1998
1999         for (i = 0;i < 3;i++)
2000         {
2001                 m = (mins[i] + maxs[i]) * 0.5;
2002                 m = r_subdivide_size.value * floor(m/r_subdivide_size.value + 0.5);
2003                 if (maxs[i] - m < 8)
2004                         continue;
2005                 if (m - mins[i] < 8)
2006                         continue;
2007
2008                 // cut it
2009                 for (cv = verts, c = 0;c < numverts;c++, cv += 3)
2010                         dist[c] = cv[i] - m;
2011
2012                 f = b = 0;
2013                 for (p = numverts - 1, c = 0, pv = verts + p * 3, cv = verts;c < numverts;p = c, c++, pv = cv, cv += 3)
2014                 {
2015                         if (dist[p] >= 0)
2016                         {
2017                                 VectorCopy(pv, front[f]);
2018                                 f++;
2019                         }
2020                         if (dist[p] <= 0)
2021                         {
2022                                 VectorCopy(pv, back[b]);
2023                                 b++;
2024                         }
2025                         if (dist[p] == 0 || dist[c] == 0)
2026                                 continue;
2027                         if ((dist[p] > 0) != (dist[c] > 0) )
2028                         {
2029                                 // clip point
2030                                 frac = dist[p] / (dist[p] - dist[c]);
2031                                 front[f][0] = back[b][0] = pv[0] + frac * (cv[0] - pv[0]);
2032                                 front[f][1] = back[b][1] = pv[1] + frac * (cv[1] - pv[1]);
2033                                 front[f][2] = back[b][2] = pv[2] + frac * (cv[2] - pv[2]);
2034                                 f++;
2035                                 b++;
2036                         }
2037                 }
2038
2039                 SubdividePolygon(f, front[0]);
2040                 SubdividePolygon(b, back[0]);
2041                 return;
2042         }
2043
2044         i1 = subdivpolylookupvert(verts);
2045         i2 = subdivpolylookupvert(verts + 3);
2046         for (i = 2;i < numverts;i++)
2047         {
2048                 if (subdivpolytriangles >= MAX_SUBDIVPOLYTRIANGLES)
2049                 {
2050                         Con_Print("SubdividePolygon: ran out of triangles in buffer, please increase your r_subdivide_size\n");
2051                         return;
2052                 }
2053
2054                 i3 = subdivpolylookupvert(verts + i * 3);
2055                 subdivpolyindex[subdivpolytriangles][0] = i1;
2056                 subdivpolyindex[subdivpolytriangles][1] = i2;
2057                 subdivpolyindex[subdivpolytriangles][2] = i3;
2058                 i2 = i3;
2059                 subdivpolytriangles++;
2060         }
2061 }
2062
2063 //Breaks a polygon up along axial 64 unit
2064 //boundaries so that turbulent and sky warps
2065 //can be done reasonably.
2066 static void Mod_Q1BSP_GenerateWarpMesh(msurface_t *surface)
2067 {
2068         int i, j;
2069         surfvertex_t *v;
2070         surfmesh_t *mesh;
2071
2072         subdivpolytriangles = 0;
2073         subdivpolyverts = 0;
2074         SubdividePolygon(surface->num_vertices, (surface->mesh->data_vertex3f + 3 * surface->num_firstvertex));
2075         if (subdivpolytriangles < 1)
2076                 Host_Error("Mod_Q1BSP_GenerateWarpMesh: no triangles?");
2077
2078         surface->mesh = mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + subdivpolytriangles * sizeof(int[3]) + subdivpolyverts * sizeof(surfvertex_t));
2079         mesh->num_vertices = subdivpolyverts;
2080         mesh->num_triangles = subdivpolytriangles;
2081         mesh->vertex = (surfvertex_t *)(mesh + 1);
2082         mesh->index = (int *)(mesh->vertex + mesh->num_vertices);
2083         memset(mesh->vertex, 0, mesh->num_vertices * sizeof(surfvertex_t));
2084
2085         for (i = 0;i < mesh->num_triangles;i++)
2086                 for (j = 0;j < 3;j++)
2087                         mesh->index[i*3+j] = subdivpolyindex[i][j];
2088
2089         for (i = 0, v = mesh->vertex;i < subdivpolyverts;i++, v++)
2090         {
2091                 VectorCopy(subdivpolyvert[i], v->v);
2092                 v->st[0] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[0]);
2093                 v->st[1] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[1]);
2094         }
2095 }
2096 #endif
2097
2098 static qboolean Mod_Q1BSP_AllocLightmapBlock(int *lineused, int totalwidth, int totalheight, int blockwidth, int blockheight, int *outx, int *outy)
2099 {
2100         int y, x2, y2;
2101         int bestx = totalwidth, besty = 0;
2102         // find the left-most space we can find
2103         for (y = 0;y <= totalheight - blockheight;y++)
2104         {
2105                 x2 = 0;
2106                 for (y2 = 0;y2 < blockheight;y2++)
2107                         x2 = max(x2, lineused[y+y2]);
2108                 if (bestx > x2)
2109                 {
2110                         bestx = x2;
2111                         besty = y;
2112                 }
2113         }
2114         // if the best was not good enough, return failure
2115         if (bestx > totalwidth - blockwidth)
2116                 return false;
2117         // we found a good spot
2118         if (outx)
2119                 *outx = bestx;
2120         if (outy)
2121                 *outy = besty;
2122         // now mark the space used
2123         for (y2 = 0;y2 < blockheight;y2++)
2124                 lineused[besty+y2] = bestx + blockwidth;
2125         // return success
2126         return true;
2127 }
2128
2129 static void Mod_Q1BSP_LoadFaces(lump_t *l)
2130 {
2131         dface_t *in;
2132         msurface_t *surface;
2133         int i, j, count, surfacenum, planenum, smax, tmax, ssize, tsize, firstedge, numedges, totalverts, totaltris, lightmapnumber;
2134         float texmins[2], texmaxs[2], val, lightmaptexcoordscale;
2135 #define LIGHTMAPSIZE 256
2136         rtexture_t *lightmaptexture, *deluxemaptexture;
2137         int lightmap_lineused[LIGHTMAPSIZE];
2138
2139         in = (dface_t *)(mod_base + l->fileofs);
2140         if (l->filelen % sizeof(*in))
2141                 Host_Error("Mod_Q1BSP_LoadFaces: funny lump size in %s",loadmodel->name);
2142         count = l->filelen / sizeof(*in);
2143         loadmodel->data_surfaces = (msurface_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_t));
2144         loadmodel->data_surfaces_lightmapinfo = (msurface_lightmapinfo_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_lightmapinfo_t));
2145
2146         loadmodel->num_surfaces = count;
2147
2148         totalverts = 0;
2149         totaltris = 0;
2150         for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs);surfacenum < count;surfacenum++, in++)
2151         {
2152                 numedges = LittleShort(in->numedges);
2153                 totalverts += numedges;
2154                 totaltris += numedges - 2;
2155         }
2156
2157         Mod_AllocSurfMesh(loadmodel->mempool, totalverts, totaltris, true, false, false);
2158
2159         lightmaptexture = NULL;
2160         deluxemaptexture = r_texture_blanknormalmap;
2161         lightmapnumber = 1;
2162         lightmaptexcoordscale = 1.0f / (float)LIGHTMAPSIZE;
2163
2164         totalverts = 0;
2165         totaltris = 0;
2166         for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs), surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, in++, surface++)
2167         {
2168                 surface->lightmapinfo = loadmodel->data_surfaces_lightmapinfo + surfacenum;
2169
2170                 // FIXME: validate edges, texinfo, etc?
2171                 firstedge = LittleLong(in->firstedge);
2172                 numedges = LittleShort(in->numedges);
2173                 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)
2174                         Host_Error("Mod_Q1BSP_LoadFaces: invalid edge range (firstedge %i, numedges %i, model edges %i)", firstedge, numedges, loadmodel->brushq1.numsurfedges);
2175                 i = LittleShort(in->texinfo);
2176                 if ((unsigned int) i >= (unsigned int) loadmodel->brushq1.numtexinfo)
2177                         Host_Error("Mod_Q1BSP_LoadFaces: invalid texinfo index %i(model has %i texinfos)", i, loadmodel->brushq1.numtexinfo);
2178                 surface->lightmapinfo->texinfo = loadmodel->brushq1.texinfo + i;
2179                 surface->texture = surface->lightmapinfo->texinfo->texture;
2180
2181                 planenum = LittleShort(in->planenum);
2182                 if ((unsigned int) planenum >= (unsigned int) loadmodel->brush.num_planes)
2183                         Host_Error("Mod_Q1BSP_LoadFaces: invalid plane index %i (model has %i planes)", planenum, loadmodel->brush.num_planes);
2184
2185                 //surface->flags = surface->texture->flags;
2186                 //if (LittleShort(in->side))
2187                 //      surface->flags |= SURF_PLANEBACK;
2188                 //surface->plane = loadmodel->brush.data_planes + planenum;
2189
2190                 surface->num_firstvertex = totalverts;
2191                 surface->num_vertices = numedges;
2192                 surface->num_firsttriangle = totaltris;
2193                 surface->num_triangles = numedges - 2;
2194                 totalverts += numedges;
2195                 totaltris += numedges - 2;
2196
2197                 // convert edges back to a normal polygon
2198                 for (i = 0;i < surface->num_vertices;i++)
2199                 {
2200                         int lindex = loadmodel->brushq1.surfedges[firstedge + i];
2201                         float s, t;
2202                         if (lindex > 0)
2203                                 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[lindex].v[0]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2204                         else
2205                                 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[-lindex].v[1]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2206                         s = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2207                         t = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2208                         (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 0] = s / surface->texture->width;
2209                         (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 1] = t / surface->texture->height;
2210                         (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = 0;
2211                         (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = 0;
2212                         (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = 0;
2213                 }
2214
2215                 for (i = 0;i < surface->num_triangles;i++)
2216                 {
2217                         (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 0] = 0 + surface->num_firstvertex;
2218                         (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 1] = i + 1 + surface->num_firstvertex;
2219                         (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 2] = i + 2 + surface->num_firstvertex;
2220                 }
2221
2222                 // compile additional data about the surface geometry
2223                 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);
2224                 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);
2225                 BoxFromPoints(surface->mins, surface->maxs, surface->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex));
2226
2227                 // generate surface extents information
2228                 texmins[0] = texmaxs[0] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2229                 texmins[1] = texmaxs[1] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2230                 for (i = 1;i < surface->num_vertices;i++)
2231                 {
2232                         for (j = 0;j < 2;j++)
2233                         {
2234                                 val = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3, surface->lightmapinfo->texinfo->vecs[j]) + surface->lightmapinfo->texinfo->vecs[j][3];
2235                                 texmins[j] = min(texmins[j], val);
2236                                 texmaxs[j] = max(texmaxs[j], val);
2237                         }
2238                 }
2239                 for (i = 0;i < 2;i++)
2240                 {
2241                         surface->lightmapinfo->texturemins[i] = (int) floor(texmins[i] / 16.0) * 16;
2242                         surface->lightmapinfo->extents[i] = (int) ceil(texmaxs[i] / 16.0) * 16 - surface->lightmapinfo->texturemins[i];
2243                 }
2244
2245                 smax = surface->lightmapinfo->extents[0] >> 4;
2246                 tmax = surface->lightmapinfo->extents[1] >> 4;
2247                 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2248                 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2249
2250                 // lighting info
2251                 for (i = 0;i < MAXLIGHTMAPS;i++)
2252                         surface->lightmapinfo->styles[i] = in->styles[i];
2253                 surface->lightmaptexture = NULL;
2254                 surface->deluxemaptexture = r_texture_blanknormalmap;
2255                 i = LittleLong(in->lightofs);
2256                 if (i == -1)
2257                 {
2258                         surface->lightmapinfo->samples = NULL;
2259                         // give non-lightmapped water a 1x white lightmap
2260                         if ((surface->texture->basematerialflags & MATERIALFLAG_WATER) && (surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) && ssize <= 256 && tsize <= 256)
2261                         {
2262                                 surface->lightmapinfo->samples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2263                                 surface->lightmapinfo->styles[0] = 0;
2264                                 memset(surface->lightmapinfo->samples, 128, ssize * tsize * 3);
2265                         }
2266                 }
2267                 else if (loadmodel->brush.ishlbsp) // LordHavoc: HalfLife map (bsp version 30)
2268                         surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + i;
2269                 else // LordHavoc: white lighting (bsp version 29)
2270                 {
2271                         surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + (i * 3);
2272                         if (loadmodel->brushq1.nmaplightdata)
2273                                 surface->lightmapinfo->nmapsamples = loadmodel->brushq1.nmaplightdata + (i * 3);
2274                 }
2275
2276                 // check if we should apply a lightmap to this
2277                 if (!(surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) || surface->lightmapinfo->samples)
2278                 {
2279                         int i, iu, iv, lightmapx, lightmapy;
2280                         float u, v, ubase, vbase, uscale, vscale;
2281
2282                         if (ssize > 256 || tsize > 256)
2283                                 Host_Error("Bad surface extents");
2284                         // force lightmap upload on first time seeing the surface
2285                         surface->cached_dlight = true;
2286                         // stainmap for permanent marks on walls
2287                         surface->lightmapinfo->stainsamples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2288                         // clear to white
2289                         memset(surface->lightmapinfo->stainsamples, 255, ssize * tsize * 3);
2290
2291                         // find a place for this lightmap
2292                         if (!lightmaptexture || !Mod_Q1BSP_AllocLightmapBlock(lightmap_lineused, LIGHTMAPSIZE, LIGHTMAPSIZE, ssize, tsize, &lightmapx, &lightmapy))
2293                         {
2294                                 // could not find room, make a new lightmap
2295                                 lightmaptexture = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%i", lightmapnumber), LIGHTMAPSIZE, LIGHTMAPSIZE, NULL, loadmodel->brushq1.lightmaprgba ? TEXTYPE_RGBA : TEXTYPE_RGB, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2296                                 if (loadmodel->brushq1.nmaplightdata)
2297                                         deluxemaptexture = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%i", lightmapnumber), LIGHTMAPSIZE, LIGHTMAPSIZE, NULL, loadmodel->brushq1.lightmaprgba ? TEXTYPE_RGBA : TEXTYPE_RGB, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2298                                 lightmapnumber++;
2299                                 memset(lightmap_lineused, 0, sizeof(lightmap_lineused));
2300                                 Mod_Q1BSP_AllocLightmapBlock(lightmap_lineused, LIGHTMAPSIZE, LIGHTMAPSIZE, ssize, tsize, &lightmapx, &lightmapy);
2301                         }
2302
2303                         surface->lightmaptexture = lightmaptexture;
2304                         surface->deluxemaptexture = deluxemaptexture;
2305                         surface->lightmapinfo->lightmaporigin[0] = lightmapx;
2306                         surface->lightmapinfo->lightmaporigin[1] = lightmapy;
2307
2308                         ubase = lightmapx * lightmaptexcoordscale;
2309                         vbase = lightmapy * lightmaptexcoordscale;
2310                         uscale = lightmaptexcoordscale;
2311                         vscale = lightmaptexcoordscale;
2312
2313                         for (i = 0;i < surface->num_vertices;i++)
2314                         {
2315                                 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);
2316                                 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);
2317                                 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = u * uscale + ubase;
2318                                 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = v * vscale + vbase;
2319                                 // LordHavoc: calc lightmap data offset for vertex lighting to use
2320                                 iu = (int) u;
2321                                 iv = (int) v;
2322                                 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = (bound(0, iv, tmax) * ssize + bound(0, iu, smax)) * 3;
2323                         }
2324                 }
2325         }
2326 }
2327
2328 static void Mod_Q1BSP_LoadNodes_RecursiveSetParent(mnode_t *node, mnode_t *parent)
2329 {
2330         //if (node->parent)
2331         //      Host_Error("Mod_Q1BSP_LoadNodes_RecursiveSetParent: runaway recursion");
2332         node->parent = parent;
2333         if (node->plane)
2334         {
2335                 // this is a node, recurse to children
2336                 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[0], node);
2337                 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[1], node);
2338                 // combine supercontents of children
2339                 node->combinedsupercontents = node->children[0]->combinedsupercontents | node->children[1]->combinedsupercontents;
2340         }
2341         else
2342         {
2343                 int j;
2344                 mleaf_t *leaf = (mleaf_t *)node;
2345                 // if this is a leaf, calculate supercontents mask from all collidable
2346                 // primitives in the leaf (brushes and collision surfaces)
2347                 // also flag if the leaf contains any collision surfaces
2348                 leaf->combinedsupercontents = 0;
2349                 // combine the supercontents values of all brushes in this leaf
2350                 for (j = 0;j < leaf->numleafbrushes;j++)
2351                         leaf->combinedsupercontents |= loadmodel->brush.data_brushes[leaf->firstleafbrush[j]].texture->supercontents;
2352                 // check if this leaf contains any collision surfaces (q3 patches)
2353                 for (j = 0;j < leaf->numleafsurfaces;j++)
2354                 {
2355                         msurface_t *surface = loadmodel->data_surfaces + leaf->firstleafsurface[j];
2356                         if (surface->num_collisiontriangles)
2357                         {
2358                                 leaf->containscollisionsurfaces = true;
2359                                 leaf->combinedsupercontents |= surface->texture->supercontents;
2360                         }
2361                 }
2362         }
2363 }
2364
2365 static void Mod_Q1BSP_LoadNodes(lump_t *l)
2366 {
2367         int                     i, j, count, p;
2368         dnode_t         *in;
2369         mnode_t         *out;
2370
2371         in = (dnode_t *)(mod_base + l->fileofs);
2372         if (l->filelen % sizeof(*in))
2373                 Host_Error("Mod_Q1BSP_LoadNodes: funny lump size in %s",loadmodel->name);
2374         count = l->filelen / sizeof(*in);
2375         out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2376
2377         loadmodel->brush.data_nodes = out;
2378         loadmodel->brush.num_nodes = count;
2379
2380         for ( i=0 ; i<count ; i++, in++, out++)
2381         {
2382                 for (j=0 ; j<3 ; j++)
2383                 {
2384                         out->mins[j] = LittleShort(in->mins[j]);
2385                         out->maxs[j] = LittleShort(in->maxs[j]);
2386                 }
2387
2388                 p = LittleLong(in->planenum);
2389                 out->plane = loadmodel->brush.data_planes + p;
2390
2391                 out->firstsurface = LittleShort(in->firstface);
2392                 out->numsurfaces = LittleShort(in->numfaces);
2393
2394                 for (j=0 ; j<2 ; j++)
2395                 {
2396                         p = LittleShort(in->children[j]);
2397                         if (p >= 0)
2398                                 out->children[j] = loadmodel->brush.data_nodes + p;
2399                         else
2400                                 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + (-1 - p));
2401                 }
2402         }
2403
2404         Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);      // sets nodes and leafs
2405 }
2406
2407 static void Mod_Q1BSP_LoadLeafs(lump_t *l)
2408 {
2409         dleaf_t *in;
2410         mleaf_t *out;
2411         int i, j, count, p;
2412
2413         in = (dleaf_t *)(mod_base + l->fileofs);
2414         if (l->filelen % sizeof(*in))
2415                 Host_Error("Mod_Q1BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
2416         count = l->filelen / sizeof(*in);
2417         out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2418
2419         loadmodel->brush.data_leafs = out;
2420         loadmodel->brush.num_leafs = count;
2421         // get visleafs from the submodel data
2422         loadmodel->brush.num_pvsclusters = loadmodel->brushq1.submodels[0].visleafs;
2423         loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters+7)>>3;
2424         loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2425         memset(loadmodel->brush.data_pvsclusters, 0xFF, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2426
2427         for ( i=0 ; i<count ; i++, in++, out++)
2428         {
2429                 for (j=0 ; j<3 ; j++)
2430                 {
2431                         out->mins[j] = LittleShort(in->mins[j]);
2432                         out->maxs[j] = LittleShort(in->maxs[j]);
2433                 }
2434
2435                 // FIXME: this function could really benefit from some error checking
2436
2437                 out->contents = LittleLong(in->contents);
2438
2439                 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + LittleShort(in->firstmarksurface);
2440                 out->numleafsurfaces = LittleShort(in->nummarksurfaces);
2441                 if (out->firstleafsurface < 0 || LittleShort(in->firstmarksurface) + out->numleafsurfaces > loadmodel->brush.num_leafsurfaces)
2442                 {
2443                         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);
2444                         out->firstleafsurface = NULL;
2445                         out->numleafsurfaces = 0;
2446                 }
2447
2448                 out->clusterindex = i - 1;
2449                 if (out->clusterindex >= loadmodel->brush.num_pvsclusters)
2450                         out->clusterindex = -1;
2451
2452                 p = LittleLong(in->visofs);
2453                 // ignore visofs errors on leaf 0 (solid)
2454                 if (p >= 0 && out->clusterindex >= 0)
2455                 {
2456                         if (p >= loadmodel->brushq1.num_compressedpvs)
2457                                 Con_Print("Mod_Q1BSP_LoadLeafs: invalid visofs\n");
2458                         else
2459                                 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);
2460                 }
2461
2462                 for (j = 0;j < 4;j++)
2463                         out->ambient_sound_level[j] = in->ambient_level[j];
2464
2465                 // FIXME: Insert caustics here
2466         }
2467 }
2468
2469 qboolean Mod_Q1BSP_CheckWaterAlphaSupport(void)
2470 {
2471         int i, j;
2472         mleaf_t *leaf;
2473         const unsigned char *pvs;
2474         // check all liquid leafs to see if they can see into empty leafs, if any
2475         // can we can assume this map supports r_wateralpha
2476         for (i = 0, leaf = loadmodel->brush.data_leafs;i < loadmodel->brush.num_leafs;i++, leaf++)
2477         {
2478                 if ((leaf->contents == CONTENTS_WATER || leaf->contents == CONTENTS_SLIME) && (leaf->clusterindex >= 0 && loadmodel->brush.data_pvsclusters))
2479                 {
2480                         pvs = loadmodel->brush.data_pvsclusters + leaf->clusterindex * loadmodel->brush.num_pvsclusterbytes;
2481                         for (j = 0;j < loadmodel->brush.num_leafs;j++)
2482                                 if (CHECKPVSBIT(pvs, loadmodel->brush.data_leafs[j].clusterindex) && loadmodel->brush.data_leafs[j].contents == CONTENTS_EMPTY)
2483                                         return true;
2484                 }
2485         }
2486         return false;
2487 }
2488
2489 static void Mod_Q1BSP_LoadClipnodes(lump_t *l, hullinfo_t *hullinfo)
2490 {
2491         dclipnode_t *in, *out;
2492         int                     i, count;
2493         hull_t          *hull;
2494
2495         in = (dclipnode_t *)(mod_base + l->fileofs);
2496         if (l->filelen % sizeof(*in))
2497                 Host_Error("Mod_Q1BSP_LoadClipnodes: funny lump size in %s",loadmodel->name);
2498         count = l->filelen / sizeof(*in);
2499         out = (dclipnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2500
2501         loadmodel->brushq1.clipnodes = out;
2502         loadmodel->brushq1.numclipnodes = count;
2503
2504         for (i = 1; i < hullinfo->numhulls; i++)
2505         {
2506                 hull = &loadmodel->brushq1.hulls[i];
2507                 hull->clipnodes = out;
2508                 hull->firstclipnode = 0;
2509                 hull->lastclipnode = count-1;
2510                 hull->planes = loadmodel->brush.data_planes;
2511                 hull->clip_mins[0] = hullinfo->hullsizes[i][0][0];
2512                 hull->clip_mins[1] = hullinfo->hullsizes[i][0][1];
2513                 hull->clip_mins[2] = hullinfo->hullsizes[i][0][2];
2514                 hull->clip_maxs[0] = hullinfo->hullsizes[i][1][0];
2515                 hull->clip_maxs[1] = hullinfo->hullsizes[i][1][1];
2516                 hull->clip_maxs[2] = hullinfo->hullsizes[i][1][2];
2517                 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2518         }
2519
2520         for (i=0 ; i<count ; i++, out++, in++)
2521         {
2522                 out->planenum = LittleLong(in->planenum);
2523                 out->children[0] = LittleShort(in->children[0]);
2524                 out->children[1] = LittleShort(in->children[1]);
2525                 if (out->planenum < 0 || out->planenum >= loadmodel->brush.num_planes)
2526                         Host_Error("Corrupt clipping hull(out of range planenum)");
2527                 if (out->children[0] >= count || out->children[1] >= count)
2528                         Host_Error("Corrupt clipping hull(out of range child)");
2529         }
2530 }
2531
2532 //Duplicate the drawing hull structure as a clipping hull
2533 static void Mod_Q1BSP_MakeHull0(void)
2534 {
2535         mnode_t         *in;
2536         dclipnode_t *out;
2537         int                     i;
2538         hull_t          *hull;
2539
2540         hull = &loadmodel->brushq1.hulls[0];
2541
2542         in = loadmodel->brush.data_nodes;
2543         out = (dclipnode_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(dclipnode_t));
2544
2545         hull->clipnodes = out;
2546         hull->firstclipnode = 0;
2547         hull->lastclipnode = loadmodel->brush.num_nodes - 1;
2548         hull->planes = loadmodel->brush.data_planes;
2549
2550         for (i = 0;i < loadmodel->brush.num_nodes;i++, out++, in++)
2551         {
2552                 out->planenum = in->plane - loadmodel->brush.data_planes;
2553                 out->children[0] = in->children[0]->plane ? in->children[0] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[0])->contents;
2554                 out->children[1] = in->children[1]->plane ? in->children[1] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[1])->contents;
2555         }
2556 }
2557
2558 static void Mod_Q1BSP_LoadLeaffaces(lump_t *l)
2559 {
2560         int i, j;
2561         short *in;
2562
2563         in = (short *)(mod_base + l->fileofs);
2564         if (l->filelen % sizeof(*in))
2565                 Host_Error("Mod_Q1BSP_LoadLeaffaces: funny lump size in %s",loadmodel->name);
2566         loadmodel->brush.num_leafsurfaces = l->filelen / sizeof(*in);
2567         loadmodel->brush.data_leafsurfaces = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafsurfaces * sizeof(int));
2568
2569         for (i = 0;i < loadmodel->brush.num_leafsurfaces;i++)
2570         {
2571                 j = (unsigned) LittleShort(in[i]);
2572                 if (j >= loadmodel->num_surfaces)
2573                         Host_Error("Mod_Q1BSP_LoadLeaffaces: bad surface number");
2574                 loadmodel->brush.data_leafsurfaces[i] = j;
2575         }
2576 }
2577
2578 static void Mod_Q1BSP_LoadSurfedges(lump_t *l)
2579 {
2580         int             i;
2581         int             *in;
2582
2583         in = (int *)(mod_base + l->fileofs);
2584         if (l->filelen % sizeof(*in))
2585                 Host_Error("Mod_Q1BSP_LoadSurfedges: funny lump size in %s",loadmodel->name);
2586         loadmodel->brushq1.numsurfedges = l->filelen / sizeof(*in);
2587         loadmodel->brushq1.surfedges = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numsurfedges * sizeof(int));
2588
2589         for (i = 0;i < loadmodel->brushq1.numsurfedges;i++)
2590                 loadmodel->brushq1.surfedges[i] = LittleLong(in[i]);
2591 }
2592
2593
2594 static void Mod_Q1BSP_LoadPlanes(lump_t *l)
2595 {
2596         int                     i;
2597         mplane_t        *out;
2598         dplane_t        *in;
2599
2600         in = (dplane_t *)(mod_base + l->fileofs);
2601         if (l->filelen % sizeof(*in))
2602                 Host_Error("Mod_Q1BSP_LoadPlanes: funny lump size in %s", loadmodel->name);
2603
2604         loadmodel->brush.num_planes = l->filelen / sizeof(*in);
2605         loadmodel->brush.data_planes = out = (mplane_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_planes * sizeof(*out));
2606
2607         for (i = 0;i < loadmodel->brush.num_planes;i++, in++, out++)
2608         {
2609                 out->normal[0] = LittleFloat(in->normal[0]);
2610                 out->normal[1] = LittleFloat(in->normal[1]);
2611                 out->normal[2] = LittleFloat(in->normal[2]);
2612                 out->dist = LittleFloat(in->dist);
2613
2614                 PlaneClassify(out);
2615         }
2616 }
2617
2618 static void Mod_Q1BSP_LoadMapBrushes(void)
2619 {
2620 #if 0
2621 // unfinished
2622         int submodel, numbrushes;
2623         qboolean firstbrush;
2624         char *text, *maptext;
2625         char mapfilename[MAX_QPATH];
2626         FS_StripExtension (loadmodel->name, mapfilename, sizeof (mapfilename));
2627         strlcat (mapfilename, ".map", sizeof (mapfilename));
2628         maptext = (unsigned char*) FS_LoadFile(mapfilename, tempmempool, false, NULL);
2629         if (!maptext)
2630                 return;
2631         text = maptext;
2632         if (!COM_ParseTokenConsole(&data))
2633                 return; // error
2634         submodel = 0;
2635         for (;;)
2636         {
2637                 if (!COM_ParseTokenConsole(&data))
2638                         break;
2639                 if (com_token[0] != '{')
2640                         return; // error
2641                 // entity
2642                 firstbrush = true;
2643                 numbrushes = 0;
2644                 maxbrushes = 256;
2645                 brushes = Mem_Alloc(loadmodel->mempool, maxbrushes * sizeof(mbrush_t));
2646                 for (;;)
2647                 {
2648                         if (!COM_ParseTokenConsole(&data))
2649                                 return; // error
2650                         if (com_token[0] == '}')
2651                                 break; // end of entity
2652                         if (com_token[0] == '{')
2653                         {
2654                                 // brush
2655                                 if (firstbrush)
2656                                 {
2657                                         if (submodel)
2658                                         {
2659                                                 if (submodel > loadmodel->brush.numsubmodels)
2660                                                 {
2661                                                         Con_Printf("Mod_Q1BSP_LoadMapBrushes: .map has more submodels than .bsp!\n");
2662                                                         model = NULL;
2663                                                 }
2664                                                 else
2665                                                         model = loadmodel->brush.submodels[submodel];
2666                                         }
2667                                         else
2668                                                 model = loadmodel;
2669                                 }
2670                                 for (;;)
2671                                 {
2672                                         if (!COM_ParseTokenConsole(&data))
2673                                                 return; // error
2674                                         if (com_token[0] == '}')
2675                                                 break; // end of brush
2676                                         // each brush face should be this format:
2677                                         // ( x y z ) ( x y z ) ( x y z ) texture scroll_s scroll_t rotateangle scale_s scale_t
2678                                         // FIXME: support hl .map format
2679                                         for (pointnum = 0;pointnum < 3;pointnum++)
2680                                         {
2681                                                 COM_ParseTokenConsole(&data);
2682                                                 for (componentnum = 0;componentnum < 3;componentnum++)
2683                                                 {
2684                                                         COM_ParseTokenConsole(&data);
2685                                                         point[pointnum][componentnum] = atof(com_token);
2686                                                 }
2687                                                 COM_ParseTokenConsole(&data);
2688                                         }
2689                                         COM_ParseTokenConsole(&data);
2690                                         strlcpy(facetexture, com_token, sizeof(facetexture));
2691                                         COM_ParseTokenConsole(&data);
2692                                         //scroll_s = atof(com_token);
2693                                         COM_ParseTokenConsole(&data);
2694                                         //scroll_t = atof(com_token);
2695                                         COM_ParseTokenConsole(&data);
2696                                         //rotate = atof(com_token);
2697                                         COM_ParseTokenConsole(&data);
2698                                         //scale_s = atof(com_token);
2699                                         COM_ParseTokenConsole(&data);
2700                                         //scale_t = atof(com_token);
2701                                         TriangleNormal(point[0], point[1], point[2], planenormal);
2702                                         VectorNormalizeDouble(planenormal);
2703                                         planedist = DotProduct(point[0], planenormal);
2704                                         //ChooseTexturePlane(planenormal, texturevector[0], texturevector[1]);
2705                                 }
2706                                 continue;
2707                         }
2708                 }
2709         }
2710 #endif
2711 }
2712
2713
2714 #define MAX_PORTALPOINTS 64
2715
2716 typedef struct portal_s
2717 {
2718         mplane_t plane;
2719         mnode_t *nodes[2];              // [0] = front side of plane
2720         struct portal_s *next[2];
2721         int numpoints;
2722         double points[3*MAX_PORTALPOINTS];
2723         struct portal_s *chain; // all portals are linked into a list
2724 }
2725 portal_t;
2726
2727 static portal_t *portalchain;
2728
2729 /*
2730 ===========
2731 AllocPortal
2732 ===========
2733 */
2734 static portal_t *AllocPortal(void)
2735 {
2736         portal_t *p;
2737         p = (portal_t *)Mem_Alloc(loadmodel->mempool, sizeof(portal_t));
2738         p->chain = portalchain;
2739         portalchain = p;
2740         return p;
2741 }
2742
2743 static void FreePortal(portal_t *p)
2744 {
2745         Mem_Free(p);
2746 }
2747
2748 static void Mod_Q1BSP_RecursiveRecalcNodeBBox(mnode_t *node)
2749 {
2750         // process only nodes (leafs already had their box calculated)
2751         if (!node->plane)
2752                 return;
2753
2754         // calculate children first
2755         Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[0]);
2756         Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[1]);
2757
2758         // make combined bounding box from children
2759         node->mins[0] = min(node->children[0]->mins[0], node->children[1]->mins[0]);
2760         node->mins[1] = min(node->children[0]->mins[1], node->children[1]->mins[1]);
2761         node->mins[2] = min(node->children[0]->mins[2], node->children[1]->mins[2]);
2762         node->maxs[0] = max(node->children[0]->maxs[0], node->children[1]->maxs[0]);
2763         node->maxs[1] = max(node->children[0]->maxs[1], node->children[1]->maxs[1]);
2764         node->maxs[2] = max(node->children[0]->maxs[2], node->children[1]->maxs[2]);
2765 }
2766
2767 static void Mod_Q1BSP_FinalizePortals(void)
2768 {
2769         int i, j, numportals, numpoints;
2770         portal_t *p, *pnext;
2771         mportal_t *portal;
2772         mvertex_t *point;
2773         mleaf_t *leaf, *endleaf;
2774
2775         // tally up portal and point counts and recalculate bounding boxes for all
2776         // leafs (because qbsp is very sloppy)
2777         leaf = loadmodel->brush.data_leafs;
2778         endleaf = leaf + loadmodel->brush.num_leafs;
2779         for (;leaf < endleaf;leaf++)
2780         {
2781                 VectorSet(leaf->mins,  2000000000,  2000000000,  2000000000);
2782                 VectorSet(leaf->maxs, -2000000000, -2000000000, -2000000000);
2783         }
2784         p = portalchain;
2785         numportals = 0;
2786         numpoints = 0;
2787         while (p)
2788         {
2789                 // note: this check must match the one below or it will usually corrupt memory
2790                 // the nodes[0] != nodes[1] check is because leaf 0 is the shared solid leaf, it can have many portals inside with leaf 0 on both sides
2791                 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1] && ((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
2792                 {
2793                         numportals += 2;
2794                         numpoints += p->numpoints * 2;
2795                 }
2796                 p = p->chain;
2797         }
2798         loadmodel->brush.data_portals = (mportal_t *)Mem_Alloc(loadmodel->mempool, numportals * sizeof(mportal_t) + numpoints * sizeof(mvertex_t));
2799         loadmodel->brush.num_portals = numportals;
2800         loadmodel->brush.data_portalpoints = (mvertex_t *)((unsigned char *) loadmodel->brush.data_portals + numportals * sizeof(mportal_t));
2801         loadmodel->brush.num_portalpoints = numpoints;
2802         // clear all leaf portal chains
2803         for (i = 0;i < loadmodel->brush.num_leafs;i++)
2804                 loadmodel->brush.data_leafs[i].portals = NULL;
2805         // process all portals in the global portal chain, while freeing them
2806         portal = loadmodel->brush.data_portals;
2807         point = loadmodel->brush.data_portalpoints;
2808         p = portalchain;
2809         portalchain = NULL;
2810         while (p)
2811         {
2812                 pnext = p->chain;
2813
2814                 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1])
2815                 {
2816                         // note: this check must match the one above or it will usually corrupt memory
2817                         // the nodes[0] != nodes[1] check is because leaf 0 is the shared solid leaf, it can have many portals inside with leaf 0 on both sides
2818                         if (((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
2819                         {
2820                                 // first make the back to front portal(forward portal)
2821                                 portal->points = point;
2822                                 portal->numpoints = p->numpoints;
2823                                 portal->plane.dist = p->plane.dist;
2824                                 VectorCopy(p->plane.normal, portal->plane.normal);
2825                                 portal->here = (mleaf_t *)p->nodes[1];
2826                                 portal->past = (mleaf_t *)p->nodes[0];
2827                                 // copy points
2828                                 for (j = 0;j < portal->numpoints;j++)
2829                                 {
2830                                         VectorCopy(p->points + j*3, point->position);
2831                                         point++;
2832                                 }
2833                                 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
2834                                 PlaneClassify(&portal->plane);
2835
2836                                 // link into leaf's portal chain
2837                                 portal->next = portal->here->portals;
2838                                 portal->here->portals = portal;
2839
2840                                 // advance to next portal
2841                                 portal++;
2842
2843                                 // then make the front to back portal(backward portal)
2844                                 portal->points = point;
2845                                 portal->numpoints = p->numpoints;
2846                                 portal->plane.dist = -p->plane.dist;
2847                                 VectorNegate(p->plane.normal, portal->plane.normal);
2848                                 portal->here = (mleaf_t *)p->nodes[0];
2849                                 portal->past = (mleaf_t *)p->nodes[1];
2850                                 // copy points
2851                                 for (j = portal->numpoints - 1;j >= 0;j--)
2852                                 {
2853                                         VectorCopy(p->points + j*3, point->position);
2854                                         point++;
2855                                 }
2856                                 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
2857                                 PlaneClassify(&portal->plane);
2858
2859                                 // link into leaf's portal chain
2860                                 portal->next = portal->here->portals;
2861                                 portal->here->portals = portal;
2862
2863                                 // advance to next portal
2864                                 portal++;
2865                         }
2866                         // add the portal's polygon points to the leaf bounding boxes
2867                         for (i = 0;i < 2;i++)
2868                         {
2869                                 leaf = (mleaf_t *)p->nodes[i];
2870                                 for (j = 0;j < p->numpoints;j++)
2871                                 {
2872                                         if (leaf->mins[0] > p->points[j*3+0]) leaf->mins[0] = p->points[j*3+0];
2873                                         if (leaf->mins[1] > p->points[j*3+1]) leaf->mins[1] = p->points[j*3+1];
2874                                         if (leaf->mins[2] > p->points[j*3+2]) leaf->mins[2] = p->points[j*3+2];
2875                                         if (leaf->maxs[0] < p->points[j*3+0]) leaf->maxs[0] = p->points[j*3+0];
2876                                         if (leaf->maxs[1] < p->points[j*3+1]) leaf->maxs[1] = p->points[j*3+1];
2877                                         if (leaf->maxs[2] < p->points[j*3+2]) leaf->maxs[2] = p->points[j*3+2];
2878                                 }
2879                         }
2880                 }
2881                 FreePortal(p);
2882                 p = pnext;
2883         }
2884         // now recalculate the node bounding boxes from the leafs
2885         Mod_Q1BSP_RecursiveRecalcNodeBBox(loadmodel->brush.data_nodes);
2886 }
2887
2888 /*
2889 =============
2890 AddPortalToNodes
2891 =============
2892 */
2893 static void AddPortalToNodes(portal_t *p, mnode_t *front, mnode_t *back)
2894 {
2895         if (!front)
2896                 Host_Error("AddPortalToNodes: NULL front node");
2897         if (!back)
2898                 Host_Error("AddPortalToNodes: NULL back node");
2899         if (p->nodes[0] || p->nodes[1])
2900                 Host_Error("AddPortalToNodes: already included");
2901         // note: front == back is handled gracefully, because leaf 0 is the shared solid leaf, it can often have portals with the same leaf on both sides
2902
2903         p->nodes[0] = front;
2904         p->next[0] = (portal_t *)front->portals;
2905         front->portals = (mportal_t *)p;
2906
2907         p->nodes[1] = back;
2908         p->next[1] = (portal_t *)back->portals;
2909         back->portals = (mportal_t *)p;
2910 }
2911
2912 /*
2913 =============
2914 RemovePortalFromNode
2915 =============
2916 */
2917 static void RemovePortalFromNodes(portal_t *portal)
2918 {
2919         int i;
2920         mnode_t *node;
2921         void **portalpointer;
2922         portal_t *t;
2923         for (i = 0;i < 2;i++)
2924         {
2925                 node = portal->nodes[i];
2926
2927                 portalpointer = (void **) &node->portals;
2928                 while (1)
2929                 {
2930                         t = (portal_t *)*portalpointer;
2931                         if (!t)
2932                                 Host_Error("RemovePortalFromNodes: portal not in leaf");
2933
2934                         if (t == portal)
2935                         {
2936                                 if (portal->nodes[0] == node)
2937                                 {
2938                                         *portalpointer = portal->next[0];
2939                                         portal->nodes[0] = NULL;
2940                                 }
2941                                 else if (portal->nodes[1] == node)
2942                                 {
2943                                         *portalpointer = portal->next[1];
2944                                         portal->nodes[1] = NULL;
2945                                 }
2946                                 else
2947                                         Host_Error("RemovePortalFromNodes: portal not bounding leaf");
2948                                 break;
2949                         }
2950
2951                         if (t->nodes[0] == node)
2952                                 portalpointer = (void **) &t->next[0];
2953                         else if (t->nodes[1] == node)
2954                                 portalpointer = (void **) &t->next[1];
2955                         else
2956                                 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
2957                 }
2958         }
2959 }
2960
2961 #define PORTAL_DIST_EPSILON (1.0 / 32.0)
2962 static void Mod_Q1BSP_RecursiveNodePortals(mnode_t *node)
2963 {
2964         int i, side;
2965         mnode_t *front, *back, *other_node;
2966         mplane_t clipplane, *plane;
2967         portal_t *portal, *nextportal, *nodeportal, *splitportal, *temp;
2968         int numfrontpoints, numbackpoints;
2969         double frontpoints[3*MAX_PORTALPOINTS], backpoints[3*MAX_PORTALPOINTS];
2970
2971         // if a leaf, we're done
2972         if (!node->plane)
2973                 return;
2974
2975         plane = node->plane;
2976
2977         front = node->children[0];
2978         back = node->children[1];
2979         if (front == back)
2980                 Host_Error("Mod_Q1BSP_RecursiveNodePortals: corrupt node hierarchy");
2981
2982         // create the new portal by generating a polygon for the node plane,
2983         // and clipping it by all of the other portals(which came from nodes above this one)
2984         nodeportal = AllocPortal();
2985         nodeportal->plane = *plane;
2986
2987         // TODO: calculate node bounding boxes during recursion and calculate a maximum plane size accordingly to improve precision (as most maps do not need 1 billion unit plane polygons)
2988         PolygonD_QuadForPlane(nodeportal->points, nodeportal->plane.normal[0], nodeportal->plane.normal[1], nodeportal->plane.normal[2], nodeportal->plane.dist, 1024.0*1024.0*1024.0);
2989         nodeportal->numpoints = 4;
2990         side = 0;       // shut up compiler warning
2991         for (portal = (portal_t *)node->portals;portal;portal = portal->next[side])
2992         {
2993                 clipplane = portal->plane;
2994                 if (portal->nodes[0] == portal->nodes[1])
2995                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(1)");
2996                 if (portal->nodes[0] == node)
2997                         side = 0;
2998                 else if (portal->nodes[1] == node)
2999                 {
3000                         clipplane.dist = -clipplane.dist;
3001                         VectorNegate(clipplane.normal, clipplane.normal);
3002                         side = 1;
3003                 }
3004                 else
3005                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3006
3007                 for (i = 0;i < nodeportal->numpoints*3;i++)
3008                         frontpoints[i] = nodeportal->points[i];
3009                 PolygonD_Divide(nodeportal->numpoints, frontpoints, clipplane.normal[0], clipplane.normal[1], clipplane.normal[2], clipplane.dist, PORTAL_DIST_EPSILON, MAX_PORTALPOINTS, nodeportal->points, &nodeportal->numpoints, 0, NULL, NULL, NULL);
3010                 if (nodeportal->numpoints <= 0 || nodeportal->numpoints >= MAX_PORTALPOINTS)
3011                         break;
3012         }
3013
3014         if (nodeportal->numpoints < 3)
3015         {
3016                 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal was clipped away\n");
3017                 nodeportal->numpoints = 0;
3018         }
3019         else if (nodeportal->numpoints >= MAX_PORTALPOINTS)
3020         {
3021                 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal has too many points\n");
3022                 nodeportal->numpoints = 0;
3023         }
3024
3025         AddPortalToNodes(nodeportal, front, back);
3026
3027         // split the portals of this node along this node's plane and assign them to the children of this node
3028         // (migrating the portals downward through the tree)
3029         for (portal = (portal_t *)node->portals;portal;portal = nextportal)
3030         {
3031                 if (portal->nodes[0] == portal->nodes[1])
3032                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(2)");
3033                 if (portal->nodes[0] == node)
3034                         side = 0;
3035                 else if (portal->nodes[1] == node)
3036                         side = 1;
3037                 else
3038                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3039                 nextportal = portal->next[side];
3040                 if (!portal->numpoints)
3041                         continue;
3042
3043                 other_node = portal->nodes[!side];
3044                 RemovePortalFromNodes(portal);
3045
3046                 // cut the portal into two portals, one on each side of the node plane
3047                 PolygonD_Divide(portal->numpoints, portal->points, plane->normal[0], plane->normal[1], plane->normal[2], plane->dist, PORTAL_DIST_EPSILON, MAX_PORTALPOINTS, frontpoints, &numfrontpoints, MAX_PORTALPOINTS, backpoints, &numbackpoints, NULL);
3048
3049                 if (!numfrontpoints)
3050                 {
3051                         if (side == 0)
3052                                 AddPortalToNodes(portal, back, other_node);
3053                         else
3054                                 AddPortalToNodes(portal, other_node, back);
3055                         continue;
3056                 }
3057                 if (!numbackpoints)
3058                 {
3059                         if (side == 0)
3060                                 AddPortalToNodes(portal, front, other_node);
3061                         else
3062                                 AddPortalToNodes(portal, other_node, front);
3063                         continue;
3064                 }
3065
3066                 // the portal is split
3067                 splitportal = AllocPortal();
3068                 temp = splitportal->chain;
3069                 *splitportal = *portal;
3070                 splitportal->chain = temp;
3071                 for (i = 0;i < numbackpoints*3;i++)
3072                         splitportal->points[i] = backpoints[i];
3073                 splitportal->numpoints = numbackpoints;
3074                 for (i = 0;i < numfrontpoints*3;i++)
3075                         portal->points[i] = frontpoints[i];
3076                 portal->numpoints = numfrontpoints;
3077
3078                 if (side == 0)
3079                 {
3080                         AddPortalToNodes(portal, front, other_node);
3081                         AddPortalToNodes(splitportal, back, other_node);
3082                 }
3083                 else
3084                 {
3085                         AddPortalToNodes(portal, other_node, front);
3086                         AddPortalToNodes(splitportal, other_node, back);
3087                 }
3088         }
3089
3090         Mod_Q1BSP_RecursiveNodePortals(front);
3091         Mod_Q1BSP_RecursiveNodePortals(back);
3092 }
3093
3094 static void Mod_Q1BSP_MakePortals(void)
3095 {
3096         portalchain = NULL;
3097         Mod_Q1BSP_RecursiveNodePortals(loadmodel->brush.data_nodes);
3098         Mod_Q1BSP_FinalizePortals();
3099 }
3100
3101 static void Mod_Q1BSP_BuildLightmapUpdateChains(mempool_t *mempool, model_t *model)
3102 {
3103         int i, j, stylecounts[256], totalcount, remapstyles[256];
3104         msurface_t *surface;
3105         memset(stylecounts, 0, sizeof(stylecounts));
3106         for (i = 0;i < model->nummodelsurfaces;i++)
3107         {
3108                 surface = model->data_surfaces + model->firstmodelsurface + i;
3109                 for (j = 0;j < MAXLIGHTMAPS;j++)
3110                         stylecounts[surface->lightmapinfo->styles[j]]++;
3111         }
3112         totalcount = 0;
3113         model->brushq1.light_styles = 0;
3114         for (i = 0;i < 255;i++)
3115         {
3116                 if (stylecounts[i])
3117                 {
3118                         remapstyles[i] = model->brushq1.light_styles++;
3119                         totalcount += stylecounts[i] + 1;
3120                 }
3121         }
3122         if (!totalcount)
3123                 return;
3124         model->brushq1.light_style = (unsigned char *)Mem_Alloc(mempool, model->brushq1.light_styles * sizeof(unsigned char));
3125         model->brushq1.light_stylevalue = (int *)Mem_Alloc(mempool, model->brushq1.light_styles * sizeof(int));
3126         model->brushq1.light_styleupdatechains = (msurface_t ***)Mem_Alloc(mempool, model->brushq1.light_styles * sizeof(msurface_t **));
3127         model->brushq1.light_styleupdatechainsbuffer = (msurface_t **)Mem_Alloc(mempool, totalcount * sizeof(msurface_t *));
3128         model->brushq1.light_styles = 0;
3129         for (i = 0;i < 255;i++)
3130                 if (stylecounts[i])
3131                         model->brushq1.light_style[model->brushq1.light_styles++] = i;
3132         j = 0;
3133         for (i = 0;i < model->brushq1.light_styles;i++)
3134         {
3135                 model->brushq1.light_styleupdatechains[i] = model->brushq1.light_styleupdatechainsbuffer + j;
3136                 j += stylecounts[model->brushq1.light_style[i]] + 1;
3137         }
3138         for (i = 0;i < model->nummodelsurfaces;i++)
3139         {
3140                 surface = model->data_surfaces + model->firstmodelsurface + i;
3141                 for (j = 0;j < MAXLIGHTMAPS;j++)
3142                         if (surface->lightmapinfo->styles[j] != 255)
3143                                 *model->brushq1.light_styleupdatechains[remapstyles[surface->lightmapinfo->styles[j]]]++ = surface;
3144         }
3145         j = 0;
3146         for (i = 0;i < model->brushq1.light_styles;i++)
3147         {
3148                 *model->brushq1.light_styleupdatechains[i] = NULL;
3149                 model->brushq1.light_styleupdatechains[i] = model->brushq1.light_styleupdatechainsbuffer + j;
3150                 j += stylecounts[model->brushq1.light_style[i]] + 1;
3151         }
3152 }
3153
3154 //Returns PVS data for a given point
3155 //(note: can return NULL)
3156 static unsigned char *Mod_Q1BSP_GetPVS(model_t *model, const vec3_t p)
3157 {
3158         mnode_t *node;
3159         node = model->brush.data_nodes;
3160         while (node->plane)
3161                 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
3162         if (((mleaf_t *)node)->clusterindex >= 0)
3163                 return model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3164         else
3165                 return NULL;
3166 }
3167
3168 static void Mod_Q1BSP_FatPVS_RecursiveBSPNode(model_t *model, const vec3_t org, vec_t radius, unsigned char *pvsbuffer, int pvsbytes, mnode_t *node)
3169 {
3170         while (node->plane)
3171         {
3172                 float d = PlaneDiff(org, node->plane);
3173                 if (d > radius)
3174                         node = node->children[0];
3175                 else if (d < -radius)
3176                         node = node->children[1];
3177                 else
3178                 {
3179                         // go down both sides
3180                         Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, pvsbytes, node->children[0]);
3181                         node = node->children[1];
3182                 }
3183         }
3184         // if this leaf is in a cluster, accumulate the pvs bits
3185         if (((mleaf_t *)node)->clusterindex >= 0)
3186         {
3187                 int i;
3188                 unsigned char *pvs = model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3189                 for (i = 0;i < pvsbytes;i++)
3190                         pvsbuffer[i] |= pvs[i];
3191         }
3192 }
3193
3194 //Calculates a PVS that is the inclusive or of all leafs within radius pixels
3195 //of the given point.
3196 static int Mod_Q1BSP_FatPVS(model_t *model, const vec3_t org, vec_t radius, unsigned char *pvsbuffer, int pvsbufferlength)
3197 {
3198         int bytes = model->brush.num_pvsclusterbytes;
3199         bytes = min(bytes, pvsbufferlength);
3200         if (r_novis.integer || !model->brush.num_pvsclusters || !Mod_Q1BSP_GetPVS(model, org))
3201         {
3202                 memset(pvsbuffer, 0xFF, bytes);
3203                 return bytes;
3204         }
3205         memset(pvsbuffer, 0, bytes);
3206         Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, bytes, model->brush.data_nodes);
3207         return bytes;
3208 }
3209
3210 static void Mod_Q1BSP_RoundUpToHullSize(model_t *cmodel, const vec3_t inmins, const vec3_t inmaxs, vec3_t outmins, vec3_t outmaxs)
3211 {
3212         vec3_t size;
3213         const hull_t *hull;
3214
3215         VectorSubtract(inmaxs, inmins, size);
3216         if (cmodel->brush.ismcbsp)
3217         {
3218                 if (size[0] < 3)
3219                         hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3220                 else if (size[2] < 48) // pick the nearest of 40 or 56
3221                         hull = &cmodel->brushq1.hulls[2]; // 16x16x40
3222                 else
3223                         hull = &cmodel->brushq1.hulls[1]; // 16x16x56
3224         }
3225         else if (cmodel->brush.ishlbsp)
3226         {
3227                 if (size[0] < 3)
3228                         hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3229                 else if (size[0] <= 32)
3230                 {
3231                         if (size[2] < 54) // pick the nearest of 36 or 72
3232                                 hull = &cmodel->brushq1.hulls[3]; // 32x32x36
3233                         else
3234                                 hull = &cmodel->brushq1.hulls[1]; // 32x32x72
3235                 }
3236                 else
3237                         hull = &cmodel->brushq1.hulls[2]; // 64x64x64
3238         }
3239         else
3240         {
3241                 if (size[0] < 3)
3242                         hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3243                 else if (size[0] <= 32)
3244                         hull = &cmodel->brushq1.hulls[1]; // 32x32x56
3245                 else
3246                         hull = &cmodel->brushq1.hulls[2]; // 64x64x88
3247         }
3248         VectorCopy(inmins, outmins);
3249         VectorAdd(inmins, hull->clip_size, outmaxs);
3250 }
3251
3252 void Mod_Q1BSP_Load(model_t *mod, void *buffer, void *bufferend)
3253 {
3254         int i, j, k;
3255         dheader_t *header;
3256         dmodel_t *bm;
3257         mempool_t *mainmempool;
3258         float dist, modelyawradius, modelradius, *vec;
3259         msurface_t *surface;
3260         int numshadowmeshtriangles;
3261         dheader_t _header;
3262         hullinfo_t hullinfo;
3263
3264         mod->type = mod_brushq1;
3265
3266         if (!memcmp (buffer, "MCBSPpad", 8))
3267         {
3268                 unsigned char   *index;
3269
3270                 mod->brush.ismcbsp = true;
3271                 mod->brush.ishlbsp = false;
3272
3273                 mod_base = (unsigned char*)buffer;
3274
3275                 index = mod_base;
3276                 index += 8;
3277                 i = SB_ReadInt (&index);
3278                 if (i != MCBSPVERSION)
3279                         Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i)", mod->name, i, MCBSPVERSION);
3280
3281         // read hull info
3282                 hullinfo.numhulls = LittleLong(*(int*)index); index += 4;
3283                 hullinfo.filehulls = hullinfo.numhulls;
3284                 VectorClear (hullinfo.hullsizes[0][0]);
3285                 VectorClear (hullinfo.hullsizes[0][1]);
3286                 for (i = 1; i < hullinfo.numhulls; i++)
3287                 {
3288                         hullinfo.hullsizes[i][0][0] = SB_ReadFloat (&index);
3289                         hullinfo.hullsizes[i][0][1] = SB_ReadFloat (&index);
3290                         hullinfo.hullsizes[i][0][2] = SB_ReadFloat (&index);
3291                         hullinfo.hullsizes[i][1][0] = SB_ReadFloat (&index);
3292                         hullinfo.hullsizes[i][1][1] = SB_ReadFloat (&index);
3293                         hullinfo.hullsizes[i][1][2] = SB_ReadFloat (&index);
3294                 }
3295
3296         // read lumps
3297                 _header.version = 0;
3298                 for (i = 0; i < HEADER_LUMPS; i++)
3299                 {
3300                         _header.lumps[i].fileofs = SB_ReadInt (&index);
3301                         _header.lumps[i].filelen = SB_ReadInt (&index);
3302                 }
3303
3304                 header = &_header;
3305         }
3306         else
3307         {
3308                 header = (dheader_t *)buffer;
3309
3310                 i = LittleLong(header->version);
3311                 if (i != BSPVERSION && i != 30)
3312                         Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i(Quake) or 30(HalfLife)", mod->name, i, BSPVERSION);
3313                 mod->brush.ishlbsp = i == 30;
3314                 mod->brush.ismcbsp = false;
3315
3316         // fill in hull info
3317                 VectorClear (hullinfo.hullsizes[0][0]);
3318                 VectorClear (hullinfo.hullsizes[0][1]);
3319                 if (mod->brush.ishlbsp)
3320                 {
3321                         hullinfo.numhulls = 4;
3322                         hullinfo.filehulls = 4;
3323                         VectorSet (hullinfo.hullsizes[1][0], -16, -16, -36);
3324                         VectorSet (hullinfo.hullsizes[1][1], 16, 16, 36);
3325                         VectorSet (hullinfo.hullsizes[2][0], -32, -32, -32);
3326                         VectorSet (hullinfo.hullsizes[2][1], 32, 32, 32);
3327                         VectorSet (hullinfo.hullsizes[3][0], -16, -16, -18);
3328                         VectorSet (hullinfo.hullsizes[3][1], 16, 16, 18);
3329                 }
3330                 else
3331                 {
3332                         hullinfo.numhulls = 3;
3333                         hullinfo.filehulls = 4;
3334                         VectorSet (hullinfo.hullsizes[1][0], -16, -16, -24);
3335                         VectorSet (hullinfo.hullsizes[1][1], 16, 16, 32);
3336                         VectorSet (hullinfo.hullsizes[2][0], -32, -32, -24);
3337                         VectorSet (hullinfo.hullsizes[2][1], 32, 32, 64);
3338                 }
3339
3340         // read lumps
3341                 mod_base = (unsigned char*)buffer;
3342                 for (i = 0; i < HEADER_LUMPS; i++)
3343                 {
3344                         header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
3345                         header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
3346                 }