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