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