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