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