oops, the r_picmipworld should be CVAR_SAVE of course. Sorry for that.
[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         dclipnode_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 dclipnode_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                 return;
1385
1386         s = loadmodel->name;
1387         if (!strncasecmp(s, "maps/", 5))
1388                 s += 5;
1389         FS_StripExtension(s, mapname, sizeof(mapname));
1390
1391         // just to work around bounds checking when debugging with it (array index out of bounds error thing)
1392         dofs = m->dataofs;
1393         // LordHavoc: mostly rewritten map texture loader
1394         for (i = 0;i < m->nummiptex;i++)
1395         {
1396                 dofs[i] = LittleLong(dofs[i]);
1397                 if (dofs[i] == -1 || r_nosurftextures.integer)
1398                         continue;
1399                 dmiptex = (miptex_t *)((unsigned char *)m + dofs[i]);
1400
1401                 // make sure name is no more than 15 characters
1402                 for (j = 0;dmiptex->name[j] && j < 15;j++)
1403                         name[j] = dmiptex->name[j];
1404                 name[j] = 0;
1405
1406                 mtwidth = LittleLong(dmiptex->width);
1407                 mtheight = LittleLong(dmiptex->height);
1408                 mtdata = NULL;
1409                 j = LittleLong(dmiptex->offsets[0]);
1410                 if (j)
1411                 {
1412                         // texture included
1413                         if (j < 40 || j + mtwidth * mtheight > l->filelen)
1414                         {
1415                                 Con_Printf("Texture \"%s\" in \"%s\"is corrupt or incomplete\n", dmiptex->name, loadmodel->name);
1416                                 continue;
1417                         }
1418                         mtdata = (unsigned char *)dmiptex + j;
1419                 }
1420
1421                 if ((mtwidth & 15) || (mtheight & 15))
1422                         Con_Printf("warning: texture \"%s\" in \"%s\" is not 16 aligned\n", dmiptex->name, loadmodel->name);
1423
1424                 // LordHavoc: force all names to lowercase
1425                 for (j = 0;name[j];j++)
1426                         if (name[j] >= 'A' && name[j] <= 'Z')
1427                                 name[j] += 'a' - 'A';
1428
1429                 tx = loadmodel->data_textures + i;
1430                 strlcpy(tx->name, name, sizeof(tx->name));
1431                 tx->width = mtwidth;
1432                 tx->height = mtheight;
1433
1434                 if (!tx->name[0])
1435                 {
1436                         sprintf(tx->name, "unnamed%i", i);
1437                         Con_Printf("warning: unnamed texture in %s, renaming to %s\n", loadmodel->name, tx->name);
1438                 }
1439
1440                 if (tx->name[0] == '*')
1441                 {
1442                         if (!strncmp(tx->name, "*lava", 5))
1443                         {
1444                                 tx->supercontents = mod_q1bsp_texture_lava.supercontents;
1445                                 tx->surfaceflags = mod_q1bsp_texture_lava.surfaceflags;
1446                         }
1447                         else if (!strncmp(tx->name, "*slime", 6))
1448                         {
1449                                 tx->supercontents = mod_q1bsp_texture_slime.supercontents;
1450                                 tx->surfaceflags = mod_q1bsp_texture_slime.surfaceflags;
1451                         }
1452                         else
1453                         {
1454                                 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1455                                 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1456                         }
1457                 }
1458                 else if (!strncmp(tx->name, "sky", 3))
1459                 {
1460                         tx->supercontents = mod_q1bsp_texture_sky.supercontents;
1461                         tx->surfaceflags = mod_q1bsp_texture_sky.surfaceflags;
1462                 }
1463                 else
1464                 {
1465                         tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1466                         tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1467                 }
1468
1469                 if (cls.state != ca_dedicated)
1470                 {
1471                         // LordHavoc: HL sky textures are entirely different than quake
1472                         if (!loadmodel->brush.ishlbsp && !strncmp(tx->name, "sky", 3) && mtwidth == 256 && mtheight == 128)
1473                         {
1474                                 if (loadmodel->isworldmodel)
1475                                 {
1476                                         data = loadimagepixels(tx->name, false, 0, 0);
1477                                         if (data)
1478                                         {
1479                                                 R_Q1BSP_LoadSplitSky(data, image_width, image_height, 4);
1480                                                 Mem_Free(data);
1481                                         }
1482                                         else if (mtdata != NULL)
1483                                                 R_Q1BSP_LoadSplitSky(mtdata, mtwidth, mtheight, 1);
1484                                 }
1485                         }
1486                         else
1487                         {
1488                                 skinframe = R_SkinFrame_LoadExternal(gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s/%s", mapname, tx->name), TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0), false);
1489                                 if (!skinframe)
1490                                         skinframe = R_SkinFrame_LoadExternal(gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s", tx->name), TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0), false);
1491                                 if (!skinframe)
1492                                 {
1493                                         // did not find external texture, load it from the bsp or wad3
1494                                         if (loadmodel->brush.ishlbsp)
1495                                         {
1496                                                 // internal texture overrides wad
1497                                                 unsigned char *pixels, *freepixels;
1498                                                 pixels = freepixels = NULL;
1499                                                 if (mtdata)
1500                                                         pixels = W_ConvertWAD3Texture(dmiptex);
1501                                                 if (pixels == NULL)
1502                                                         pixels = freepixels = W_GetTexture(tx->name);
1503                                                 if (pixels != NULL)
1504                                                 {
1505                                                         tx->width = image_width;
1506                                                         tx->height = image_height;
1507                                                         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);
1508                                                 }
1509                                                 if (freepixels)
1510                                                         Mem_Free(freepixels);
1511                                         }
1512                                         else if (mtdata) // texture included
1513                                                 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);
1514                                 }
1515                                 // if skinframe is still NULL the "missing" texture will be used
1516                                 if (skinframe)
1517                                         tx->skinframes[0] = skinframe;
1518                         }
1519
1520                         tx->basematerialflags = 0;
1521                         if (tx->name[0] == '*')
1522                         {
1523                                 // LordHavoc: some turbulent textures should not be affected by wateralpha
1524                                 if (strncmp(tx->name,"*lava",5)
1525                                  && strncmp(tx->name,"*teleport",9)
1526                                  && strncmp(tx->name,"*rift",5)) // Scourge of Armagon texture
1527                                         tx->basematerialflags |= MATERIALFLAG_WATERALPHA | MATERIALFLAG_NOSHADOW;
1528                                 tx->basematerialflags |= MATERIALFLAG_WATER | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1529                         }
1530                         else if (!strncmp(tx->name, "sky", 3))
1531                                 tx->basematerialflags |= MATERIALFLAG_SKY | MATERIALFLAG_NOSHADOW;
1532                         else
1533                                 tx->basematerialflags |= MATERIALFLAG_WALL;
1534                         if (tx->skinframes[0] && tx->skinframes[0]->fog)
1535                                 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1536
1537                         // start out with no animation
1538                         tx->currentframe = tx;
1539                         tx->currentskinframe = tx->skinframes[0];
1540                 }
1541         }
1542
1543         // sequence the animations
1544         for (i = 0;i < m->nummiptex;i++)
1545         {
1546                 tx = loadmodel->data_textures + i;
1547                 if (!tx || tx->name[0] != '+' || tx->name[1] == 0 || tx->name[2] == 0)
1548                         continue;
1549                 if (tx->anim_total[0] || tx->anim_total[1])
1550                         continue;       // already sequenced
1551
1552                 // find the number of frames in the animation
1553                 memset(anims, 0, sizeof(anims));
1554                 memset(altanims, 0, sizeof(altanims));
1555
1556                 for (j = i;j < m->nummiptex;j++)
1557                 {
1558                         tx2 = loadmodel->data_textures + j;
1559                         if (!tx2 || tx2->name[0] != '+' || strcmp(tx2->name+2, tx->name+2))
1560                                 continue;
1561
1562                         num = tx2->name[1];
1563                         if (num >= '0' && num <= '9')
1564                                 anims[num - '0'] = tx2;
1565                         else if (num >= 'a' && num <= 'j')
1566                                 altanims[num - 'a'] = tx2;
1567                         else
1568                                 Con_Printf("Bad animating texture %s\n", tx->name);
1569                 }
1570
1571                 max = altmax = 0;
1572                 for (j = 0;j < 10;j++)
1573                 {
1574                         if (anims[j])
1575                                 max = j + 1;
1576                         if (altanims[j])
1577                                 altmax = j + 1;
1578                 }
1579                 //Con_Printf("linking animation %s (%i:%i frames)\n\n", tx->name, max, altmax);
1580
1581                 incomplete = false;
1582                 for (j = 0;j < max;j++)
1583                 {
1584                         if (!anims[j])
1585                         {
1586                                 Con_Printf("Missing frame %i of %s\n", j, tx->name);
1587                                 incomplete = true;
1588                         }
1589                 }
1590                 for (j = 0;j < altmax;j++)
1591                 {
1592                         if (!altanims[j])
1593                         {
1594                                 Con_Printf("Missing altframe %i of %s\n", j, tx->name);
1595                                 incomplete = true;
1596                         }
1597                 }
1598                 if (incomplete)
1599                         continue;
1600
1601                 if (altmax < 1)
1602                 {
1603                         // if there is no alternate animation, duplicate the primary
1604                         // animation into the alternate
1605                         altmax = max;
1606                         for (k = 0;k < 10;k++)
1607                                 altanims[k] = anims[k];
1608                 }
1609
1610                 // link together the primary animation
1611                 for (j = 0;j < max;j++)
1612                 {
1613                         tx2 = anims[j];
1614                         tx2->animated = true;
1615                         tx2->anim_total[0] = max;
1616                         tx2->anim_total[1] = altmax;
1617                         for (k = 0;k < 10;k++)
1618                         {
1619                                 tx2->anim_frames[0][k] = anims[k];
1620                                 tx2->anim_frames[1][k] = altanims[k];
1621                         }
1622                 }
1623
1624                 // if there really is an alternate anim...
1625                 if (anims[0] != altanims[0])
1626                 {
1627                         // link together the alternate animation
1628                         for (j = 0;j < altmax;j++)
1629                         {
1630                                 tx2 = altanims[j];
1631                                 tx2->animated = true;
1632                                 // the primary/alternate are reversed here
1633                                 tx2->anim_total[0] = altmax;
1634                                 tx2->anim_total[1] = max;
1635                                 for (k = 0;k < 10;k++)
1636                                 {
1637                                         tx2->anim_frames[0][k] = altanims[k];
1638                                         tx2->anim_frames[1][k] = anims[k];
1639                                 }
1640                         }
1641                 }
1642         }
1643 }
1644
1645 static void Mod_Q1BSP_LoadLighting(lump_t *l)
1646 {
1647         int i;
1648         unsigned char *in, *out, *data, d;
1649         char litfilename[MAX_QPATH];
1650         char dlitfilename[MAX_QPATH];
1651         fs_offset_t filesize;
1652         if (loadmodel->brush.ishlbsp) // LordHavoc: load the colored lighting data straight
1653         {
1654                 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1655                 for (i=0; i<l->filelen; i++)
1656                         loadmodel->brushq1.lightdata[i] = mod_base[l->fileofs+i] >>= 1;
1657         }
1658         else if (loadmodel->brush.ismcbsp)
1659         {
1660                 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1661                 memcpy(loadmodel->brushq1.lightdata, mod_base + l->fileofs, l->filelen);
1662         }
1663         else // LordHavoc: bsp version 29 (normal white lighting)
1664         {
1665                 // LordHavoc: hope is not lost yet, check for a .lit file to load
1666                 strlcpy (litfilename, loadmodel->name, sizeof (litfilename));
1667                 FS_StripExtension (litfilename, litfilename, sizeof (litfilename));
1668                 strlcpy (dlitfilename, litfilename, sizeof (dlitfilename));
1669                 strlcat (litfilename, ".lit", sizeof (litfilename));
1670                 strlcat (dlitfilename, ".dlit", sizeof (dlitfilename));
1671                 data = (unsigned char*) FS_LoadFile(litfilename, tempmempool, false, &filesize);
1672                 if (data)
1673                 {
1674                         if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1675                         {
1676                                 i = LittleLong(((int *)data)[1]);
1677                                 if (i == 1)
1678                                 {
1679                                         Con_DPrintf("loaded %s\n", litfilename);
1680                                         loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1681                                         memcpy(loadmodel->brushq1.lightdata, data + 8, filesize - 8);
1682                                         Mem_Free(data);
1683                                         data = (unsigned char*) FS_LoadFile(dlitfilename, tempmempool, false, &filesize);
1684                                         if (data)
1685                                         {
1686                                                 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1687                                                 {
1688                                                         i = LittleLong(((int *)data)[1]);
1689                                                         if (i == 1)
1690                                                         {
1691                                                                 Con_DPrintf("loaded %s\n", dlitfilename);
1692                                                                 loadmodel->brushq1.nmaplightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1693                                                                 memcpy(loadmodel->brushq1.nmaplightdata, data + 8, filesize - 8);
1694                                                                 loadmodel->brushq3.deluxemapping_modelspace = false;
1695                                                                 loadmodel->brushq3.deluxemapping = true;
1696                                                         }
1697                                                 }
1698                                                 Mem_Free(data);
1699                                                 data = NULL;
1700                                         }
1701                                         return;
1702                                 }
1703                                 else
1704                                         Con_Printf("Unknown .lit file version (%d)\n", i);
1705                         }
1706                         else if (filesize == 8)
1707                                 Con_Print("Empty .lit file, ignoring\n");
1708                         else
1709                                 Con_Printf("Corrupt .lit file (file size %i bytes, should be %i bytes), ignoring\n", (int) filesize, (int) (8 + l->filelen * 3));
1710                         if (data)
1711                         {
1712                                 Mem_Free(data);
1713                                 data = NULL;
1714                         }
1715                 }
1716                 // LordHavoc: oh well, expand the white lighting data
1717                 if (!l->filelen)
1718                         return;
1719                 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen*3);
1720                 in = mod_base + l->fileofs;
1721                 out = loadmodel->brushq1.lightdata;
1722                 for (i = 0;i < l->filelen;i++)
1723                 {
1724                         d = *in++;
1725                         *out++ = d;
1726                         *out++ = d;
1727                         *out++ = d;
1728                 }
1729         }
1730 }
1731
1732 static void Mod_Q1BSP_LoadVisibility(lump_t *l)
1733 {
1734         loadmodel->brushq1.num_compressedpvs = 0;
1735         loadmodel->brushq1.data_compressedpvs = NULL;
1736         if (!l->filelen)
1737                 return;
1738         loadmodel->brushq1.num_compressedpvs = l->filelen;
1739         loadmodel->brushq1.data_compressedpvs = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1740         memcpy(loadmodel->brushq1.data_compressedpvs, mod_base + l->fileofs, l->filelen);
1741 }
1742
1743 // used only for HalfLife maps
1744 static void Mod_Q1BSP_ParseWadsFromEntityLump(const char *data)
1745 {
1746         char key[128], value[4096];
1747         char wadname[128];
1748         int i, j, k;
1749         if (!data)
1750                 return;
1751         if (!COM_ParseTokenConsole(&data))
1752                 return; // error
1753         if (com_token[0] != '{')
1754                 return; // error
1755         while (1)
1756         {
1757                 if (!COM_ParseTokenConsole(&data))
1758                         return; // error
1759                 if (com_token[0] == '}')
1760                         break; // end of worldspawn
1761                 if (com_token[0] == '_')
1762                         strlcpy(key, com_token + 1, sizeof(key));
1763                 else
1764                         strlcpy(key, com_token, sizeof(key));
1765                 while (key[strlen(key)-1] == ' ') // remove trailing spaces
1766                         key[strlen(key)-1] = 0;
1767                 if (!COM_ParseTokenConsole(&data))
1768                         return; // error
1769                 dpsnprintf(value, sizeof(value), "%s", com_token);
1770                 if (!strcmp("wad", key)) // for HalfLife maps
1771                 {
1772                         if (loadmodel->brush.ishlbsp)
1773                         {
1774                                 j = 0;
1775                                 for (i = 0;i < (int)sizeof(value);i++)
1776                                         if (value[i] != ';' && value[i] != '\\' && value[i] != '/' && value[i] != ':')
1777                                                 break;
1778                                 if (value[i])
1779                                 {
1780                                         for (;i < (int)sizeof(value);i++)
1781                                         {
1782                                                 // ignore path - the \\ check is for HalfLife... stupid windoze 'programmers'...
1783                                                 if (value[i] == '\\' || value[i] == '/' || value[i] == ':')
1784                                                         j = i+1;
1785                                                 else if (value[i] == ';' || value[i] == 0)
1786                                                 {
1787                                                         k = value[i];
1788                                                         value[i] = 0;
1789                                                         strlcpy(wadname, "textures/", sizeof(wadname));
1790                                                         strlcat(wadname, &value[j], sizeof(wadname));
1791                                                         W_LoadTextureWadFile(wadname, false);
1792                                                         j = i+1;
1793                                                         if (!k)
1794                                                                 break;
1795                                                 }
1796                                         }
1797                                 }
1798                         }
1799                 }
1800         }
1801 }
1802
1803 static void Mod_Q1BSP_LoadEntities(lump_t *l)
1804 {
1805         loadmodel->brush.entities = NULL;
1806         if (!l->filelen)
1807                 return;
1808         loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1809         memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
1810         if (loadmodel->brush.ishlbsp)
1811                 Mod_Q1BSP_ParseWadsFromEntityLump(loadmodel->brush.entities);
1812 }
1813
1814
1815 static void Mod_Q1BSP_LoadVertexes(lump_t *l)
1816 {
1817         dvertex_t       *in;
1818         mvertex_t       *out;
1819         int                     i, count;
1820
1821         in = (dvertex_t *)(mod_base + l->fileofs);
1822         if (l->filelen % sizeof(*in))
1823                 Host_Error("Mod_Q1BSP_LoadVertexes: funny lump size in %s",loadmodel->name);
1824         count = l->filelen / sizeof(*in);
1825         out = (mvertex_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
1826
1827         loadmodel->brushq1.vertexes = out;
1828         loadmodel->brushq1.numvertexes = count;
1829
1830         for ( i=0 ; i<count ; i++, in++, out++)
1831         {
1832                 out->position[0] = LittleFloat(in->point[0]);
1833                 out->position[1] = LittleFloat(in->point[1]);
1834                 out->position[2] = LittleFloat(in->point[2]);
1835         }
1836 }
1837
1838 // The following two functions should be removed and MSG_* or SZ_* function sets adjusted so they
1839 // can be used for this
1840 // REMOVEME
1841 int SB_ReadInt (unsigned char **buffer)
1842 {
1843         int     i;
1844         i = ((*buffer)[0]) + 256*((*buffer)[1]) + 65536*((*buffer)[2]) + 16777216*((*buffer)[3]);
1845         (*buffer) += 4;
1846         return i;
1847 }
1848
1849 // REMOVEME
1850 float SB_ReadFloat (unsigned char **buffer)
1851 {
1852         union
1853         {
1854                 int             i;
1855                 float   f;
1856         } u;
1857
1858         u.i = SB_ReadInt (buffer);
1859         return u.f;
1860 }
1861
1862 static void Mod_Q1BSP_LoadSubmodels(lump_t *l, hullinfo_t *hullinfo)
1863 {
1864         unsigned char           *index;
1865         dmodel_t        *out;
1866         int                     i, j, count;
1867
1868         index = (unsigned char *)(mod_base + l->fileofs);
1869         if (l->filelen % (48+4*hullinfo->filehulls))
1870                 Host_Error ("Mod_Q1BSP_LoadSubmodels: funny lump size in %s", loadmodel->name);
1871
1872         count = l->filelen / (48+4*hullinfo->filehulls);
1873         out = (dmodel_t *)Mem_Alloc (loadmodel->mempool, count*sizeof(*out));
1874
1875         loadmodel->brushq1.submodels = out;
1876         loadmodel->brush.numsubmodels = count;
1877
1878         for (i = 0; i < count; i++, out++)
1879         {
1880         // spread out the mins / maxs by a pixel
1881                 out->mins[0] = SB_ReadFloat (&index) - 1;
1882                 out->mins[1] = SB_ReadFloat (&index) - 1;
1883                 out->mins[2] = SB_ReadFloat (&index) - 1;
1884                 out->maxs[0] = SB_ReadFloat (&index) + 1;
1885                 out->maxs[1] = SB_ReadFloat (&index) + 1;
1886                 out->maxs[2] = SB_ReadFloat (&index) + 1;
1887                 out->origin[0] = SB_ReadFloat (&index);
1888                 out->origin[1] = SB_ReadFloat (&index);
1889                 out->origin[2] = SB_ReadFloat (&index);
1890                 for (j = 0; j < hullinfo->filehulls; j++)
1891                         out->headnode[j] = SB_ReadInt (&index);
1892                 out->visleafs = SB_ReadInt (&index);
1893                 out->firstface = SB_ReadInt (&index);
1894                 out->numfaces = SB_ReadInt (&index);
1895         }
1896 }
1897
1898 static void Mod_Q1BSP_LoadEdges(lump_t *l)
1899 {
1900         dedge_t *in;
1901         medge_t *out;
1902         int     i, count;
1903
1904         in = (dedge_t *)(mod_base + l->fileofs);
1905         if (l->filelen % sizeof(*in))
1906                 Host_Error("Mod_Q1BSP_LoadEdges: funny lump size in %s",loadmodel->name);
1907         count = l->filelen / sizeof(*in);
1908         out = (medge_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1909
1910         loadmodel->brushq1.edges = out;
1911         loadmodel->brushq1.numedges = count;
1912
1913         for ( i=0 ; i<count ; i++, in++, out++)
1914         {
1915                 out->v[0] = (unsigned short)LittleShort(in->v[0]);
1916                 out->v[1] = (unsigned short)LittleShort(in->v[1]);
1917                 if (out->v[0] >= loadmodel->brushq1.numvertexes || out->v[1] >= loadmodel->brushq1.numvertexes)
1918                 {
1919                         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);
1920                         out->v[0] = 0;
1921                         out->v[1] = 0;
1922                 }
1923         }
1924 }
1925
1926 static void Mod_Q1BSP_LoadTexinfo(lump_t *l)
1927 {
1928         texinfo_t *in;
1929         mtexinfo_t *out;
1930         int i, j, k, count, miptex;
1931
1932         in = (texinfo_t *)(mod_base + l->fileofs);
1933         if (l->filelen % sizeof(*in))
1934                 Host_Error("Mod_Q1BSP_LoadTexinfo: funny lump size in %s",loadmodel->name);
1935         count = l->filelen / sizeof(*in);
1936         out = (mtexinfo_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1937
1938         loadmodel->brushq1.texinfo = out;
1939         loadmodel->brushq1.numtexinfo = count;
1940
1941         for (i = 0;i < count;i++, in++, out++)
1942         {
1943                 for (k = 0;k < 2;k++)
1944                         for (j = 0;j < 4;j++)
1945                                 out->vecs[k][j] = LittleFloat(in->vecs[k][j]);
1946
1947                 miptex = LittleLong(in->miptex);
1948                 out->flags = LittleLong(in->flags);
1949
1950                 out->texture = NULL;
1951                 if (loadmodel->data_textures)
1952                 {
1953                         if ((unsigned int) miptex >= (unsigned int) loadmodel->num_textures)
1954                                 Con_Printf("error in model \"%s\": invalid miptex index %i(of %i)\n", loadmodel->name, miptex, loadmodel->num_textures);
1955                         else
1956                                 out->texture = loadmodel->data_textures + miptex;
1957                 }
1958                 if (out->flags & TEX_SPECIAL)
1959                 {
1960                         // if texture chosen is NULL or the shader needs a lightmap,
1961                         // force to notexture water shader
1962                         if (out->texture == NULL || out->texture->basematerialflags & MATERIALFLAG_WALL)
1963                                 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 1);
1964                 }
1965                 else
1966                 {
1967                         // if texture chosen is NULL, force to notexture
1968                         if (out->texture == NULL)
1969                                 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 2);
1970                 }
1971         }
1972 }
1973
1974 #if 0
1975 void BoundPoly(int numverts, float *verts, vec3_t mins, vec3_t maxs)
1976 {
1977         int             i, j;
1978         float   *v;
1979
1980         mins[0] = mins[1] = mins[2] = 9999;
1981         maxs[0] = maxs[1] = maxs[2] = -9999;
1982         v = verts;
1983         for (i = 0;i < numverts;i++)
1984         {
1985                 for (j = 0;j < 3;j++, v++)
1986                 {
1987                         if (*v < mins[j])
1988                                 mins[j] = *v;
1989                         if (*v > maxs[j])
1990                                 maxs[j] = *v;
1991                 }
1992         }
1993 }
1994
1995 #define MAX_SUBDIVPOLYTRIANGLES 4096
1996 #define MAX_SUBDIVPOLYVERTS(MAX_SUBDIVPOLYTRIANGLES * 3)
1997
1998 static int subdivpolyverts, subdivpolytriangles;
1999 static int subdivpolyindex[MAX_SUBDIVPOLYTRIANGLES][3];
2000 static float subdivpolyvert[MAX_SUBDIVPOLYVERTS][3];
2001
2002 static int subdivpolylookupvert(vec3_t v)
2003 {
2004         int i;
2005         for (i = 0;i < subdivpolyverts;i++)
2006                 if (subdivpolyvert[i][0] == v[0]
2007                  && subdivpolyvert[i][1] == v[1]
2008                  && subdivpolyvert[i][2] == v[2])
2009                         return i;
2010         if (subdivpolyverts >= MAX_SUBDIVPOLYVERTS)
2011                 Host_Error("SubDividePolygon: ran out of vertices in buffer, please increase your r_subdivide_size");
2012         VectorCopy(v, subdivpolyvert[subdivpolyverts]);
2013         return subdivpolyverts++;
2014 }
2015
2016 static void SubdividePolygon(int numverts, float *verts)
2017 {
2018         int             i, i1, i2, i3, f, b, c, p;
2019         vec3_t  mins, maxs, front[256], back[256];
2020         float   m, *pv, *cv, dist[256], frac;
2021
2022         if (numverts > 250)
2023                 Host_Error("SubdividePolygon: ran out of verts in buffer");
2024
2025         BoundPoly(numverts, verts, mins, maxs);
2026
2027         for (i = 0;i < 3;i++)
2028         {
2029                 m = (mins[i] + maxs[i]) * 0.5;
2030                 m = r_subdivide_size.value * floor(m/r_subdivide_size.value + 0.5);
2031                 if (maxs[i] - m < 8)
2032                         continue;
2033                 if (m - mins[i] < 8)
2034                         continue;
2035
2036                 // cut it
2037                 for (cv = verts, c = 0;c < numverts;c++, cv += 3)
2038                         dist[c] = cv[i] - m;
2039
2040                 f = b = 0;
2041                 for (p = numverts - 1, c = 0, pv = verts + p * 3, cv = verts;c < numverts;p = c, c++, pv = cv, cv += 3)
2042                 {
2043                         if (dist[p] >= 0)
2044                         {
2045                                 VectorCopy(pv, front[f]);
2046                                 f++;
2047                         }
2048                         if (dist[p] <= 0)
2049                         {
2050                                 VectorCopy(pv, back[b]);
2051                                 b++;
2052                         }
2053                         if (dist[p] == 0 || dist[c] == 0)
2054                                 continue;
2055                         if ((dist[p] > 0) != (dist[c] > 0) )
2056                         {
2057                                 // clip point
2058                                 frac = dist[p] / (dist[p] - dist[c]);
2059                                 front[f][0] = back[b][0] = pv[0] + frac * (cv[0] - pv[0]);
2060                                 front[f][1] = back[b][1] = pv[1] + frac * (cv[1] - pv[1]);
2061                                 front[f][2] = back[b][2] = pv[2] + frac * (cv[2] - pv[2]);
2062                                 f++;
2063                                 b++;
2064                         }
2065                 }
2066
2067                 SubdividePolygon(f, front[0]);
2068                 SubdividePolygon(b, back[0]);
2069                 return;
2070         }
2071
2072         i1 = subdivpolylookupvert(verts);
2073         i2 = subdivpolylookupvert(verts + 3);
2074         for (i = 2;i < numverts;i++)
2075         {
2076                 if (subdivpolytriangles >= MAX_SUBDIVPOLYTRIANGLES)
2077                 {
2078                         Con_Print("SubdividePolygon: ran out of triangles in buffer, please increase your r_subdivide_size\n");
2079                         return;
2080                 }
2081
2082                 i3 = subdivpolylookupvert(verts + i * 3);
2083                 subdivpolyindex[subdivpolytriangles][0] = i1;
2084                 subdivpolyindex[subdivpolytriangles][1] = i2;
2085                 subdivpolyindex[subdivpolytriangles][2] = i3;
2086                 i2 = i3;
2087                 subdivpolytriangles++;
2088         }
2089 }
2090
2091 //Breaks a polygon up along axial 64 unit
2092 //boundaries so that turbulent and sky warps
2093 //can be done reasonably.
2094 static void Mod_Q1BSP_GenerateWarpMesh(msurface_t *surface)
2095 {
2096         int i, j;
2097         surfvertex_t *v;
2098         surfmesh_t *mesh;
2099
2100         subdivpolytriangles = 0;
2101         subdivpolyverts = 0;
2102         SubdividePolygon(surface->num_vertices, (surface->mesh->data_vertex3f + 3 * surface->num_firstvertex));
2103         if (subdivpolytriangles < 1)
2104                 Host_Error("Mod_Q1BSP_GenerateWarpMesh: no triangles?");
2105
2106         surface->mesh = mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + subdivpolytriangles * sizeof(int[3]) + subdivpolyverts * sizeof(surfvertex_t));
2107         mesh->num_vertices = subdivpolyverts;
2108         mesh->num_triangles = subdivpolytriangles;
2109         mesh->vertex = (surfvertex_t *)(mesh + 1);
2110         mesh->index = (int *)(mesh->vertex + mesh->num_vertices);
2111         memset(mesh->vertex, 0, mesh->num_vertices * sizeof(surfvertex_t));
2112
2113         for (i = 0;i < mesh->num_triangles;i++)
2114                 for (j = 0;j < 3;j++)
2115                         mesh->index[i*3+j] = subdivpolyindex[i][j];
2116
2117         for (i = 0, v = mesh->vertex;i < subdivpolyverts;i++, v++)
2118         {
2119                 VectorCopy(subdivpolyvert[i], v->v);
2120                 v->st[0] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[0]);
2121                 v->st[1] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[1]);
2122         }
2123 }
2124 #endif
2125
2126 static qboolean Mod_Q1BSP_AllocLightmapBlock(int *lineused, int totalwidth, int totalheight, int blockwidth, int blockheight, int *outx, int *outy)
2127 {
2128         int y, x2, y2;
2129         int bestx = totalwidth, besty = 0;
2130         // find the left-most space we can find
2131         for (y = 0;y <= totalheight - blockheight;y++)
2132         {
2133                 x2 = 0;
2134                 for (y2 = 0;y2 < blockheight;y2++)
2135                         x2 = max(x2, lineused[y+y2]);
2136                 if (bestx > x2)
2137                 {
2138                         bestx = x2;
2139                         besty = y;
2140                 }
2141         }
2142         // if the best was not good enough, return failure
2143         if (bestx > totalwidth - blockwidth)
2144                 return false;
2145         // we found a good spot
2146         if (outx)
2147                 *outx = bestx;
2148         if (outy)
2149                 *outy = besty;
2150         // now mark the space used
2151         for (y2 = 0;y2 < blockheight;y2++)
2152                 lineused[besty+y2] = bestx + blockwidth;
2153         // return success
2154         return true;
2155 }
2156
2157 static void Mod_Q1BSP_LoadFaces(lump_t *l)
2158 {
2159         dface_t *in;
2160         msurface_t *surface;
2161         int i, j, count, surfacenum, planenum, smax, tmax, ssize, tsize, firstedge, numedges, totalverts, totaltris, lightmapnumber;
2162         float texmins[2], texmaxs[2], val, lightmaptexcoordscale;
2163 #define LIGHTMAPSIZE 256
2164         rtexture_t *lightmaptexture, *deluxemaptexture;
2165         int lightmap_lineused[LIGHTMAPSIZE];
2166
2167         in = (dface_t *)(mod_base + l->fileofs);
2168         if (l->filelen % sizeof(*in))
2169                 Host_Error("Mod_Q1BSP_LoadFaces: funny lump size in %s",loadmodel->name);
2170         count = l->filelen / sizeof(*in);
2171         loadmodel->data_surfaces = (msurface_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_t));
2172         loadmodel->data_surfaces_lightmapinfo = (msurface_lightmapinfo_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_lightmapinfo_t));
2173
2174         loadmodel->num_surfaces = count;
2175
2176         totalverts = 0;
2177         totaltris = 0;
2178         for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs);surfacenum < count;surfacenum++, in++)
2179         {
2180                 numedges = LittleShort(in->numedges);
2181                 totalverts += numedges;
2182                 totaltris += numedges - 2;
2183         }
2184
2185         Mod_AllocSurfMesh(loadmodel->mempool, totalverts, totaltris, true, false, false);
2186
2187         lightmaptexture = NULL;
2188         deluxemaptexture = r_texture_blanknormalmap;
2189         lightmapnumber = 1;
2190         lightmaptexcoordscale = 1.0f / (float)LIGHTMAPSIZE;
2191
2192         totalverts = 0;
2193         totaltris = 0;
2194         for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs), surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, in++, surface++)
2195         {
2196                 surface->lightmapinfo = loadmodel->data_surfaces_lightmapinfo + surfacenum;
2197
2198                 // FIXME: validate edges, texinfo, etc?
2199                 firstedge = LittleLong(in->firstedge);
2200                 numedges = LittleShort(in->numedges);
2201                 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)
2202                         Host_Error("Mod_Q1BSP_LoadFaces: invalid edge range (firstedge %i, numedges %i, model edges %i)", firstedge, numedges, loadmodel->brushq1.numsurfedges);
2203                 i = LittleShort(in->texinfo);
2204                 if ((unsigned int) i >= (unsigned int) loadmodel->brushq1.numtexinfo)
2205                         Host_Error("Mod_Q1BSP_LoadFaces: invalid texinfo index %i(model has %i texinfos)", i, loadmodel->brushq1.numtexinfo);
2206                 surface->lightmapinfo->texinfo = loadmodel->brushq1.texinfo + i;
2207                 surface->texture = surface->lightmapinfo->texinfo->texture;
2208
2209                 planenum = LittleShort(in->planenum);
2210                 if ((unsigned int) planenum >= (unsigned int) loadmodel->brush.num_planes)
2211                         Host_Error("Mod_Q1BSP_LoadFaces: invalid plane index %i (model has %i planes)", planenum, loadmodel->brush.num_planes);
2212
2213                 //surface->flags = surface->texture->flags;
2214                 //if (LittleShort(in->side))
2215                 //      surface->flags |= SURF_PLANEBACK;
2216                 //surface->plane = loadmodel->brush.data_planes + planenum;
2217
2218                 surface->num_firstvertex = totalverts;
2219                 surface->num_vertices = numedges;
2220                 surface->num_firsttriangle = totaltris;
2221                 surface->num_triangles = numedges - 2;
2222                 totalverts += numedges;
2223                 totaltris += numedges - 2;
2224
2225                 // convert edges back to a normal polygon
2226                 for (i = 0;i < surface->num_vertices;i++)
2227                 {
2228                         int lindex = loadmodel->brushq1.surfedges[firstedge + i];
2229                         float s, t;
2230                         if (lindex > 0)
2231                                 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[lindex].v[0]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2232                         else
2233                                 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[-lindex].v[1]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2234                         s = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2235                         t = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2236                         (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 0] = s / surface->texture->width;
2237                         (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 1] = t / surface->texture->height;
2238                         (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = 0;
2239                         (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = 0;
2240                         (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = 0;
2241                 }
2242
2243                 for (i = 0;i < surface->num_triangles;i++)
2244                 {
2245                         (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 0] = 0 + surface->num_firstvertex;
2246                         (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 1] = i + 1 + surface->num_firstvertex;
2247                         (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 2] = i + 2 + surface->num_firstvertex;
2248                 }
2249
2250                 // compile additional data about the surface geometry
2251                 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);
2252                 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);
2253                 BoxFromPoints(surface->mins, surface->maxs, surface->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex));
2254
2255                 // generate surface extents information
2256                 texmins[0] = texmaxs[0] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2257                 texmins[1] = texmaxs[1] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2258                 for (i = 1;i < surface->num_vertices;i++)
2259                 {
2260                         for (j = 0;j < 2;j++)
2261                         {
2262                                 val = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3, surface->lightmapinfo->texinfo->vecs[j]) + surface->lightmapinfo->texinfo->vecs[j][3];
2263                                 texmins[j] = min(texmins[j], val);
2264                                 texmaxs[j] = max(texmaxs[j], val);
2265                         }
2266                 }
2267                 for (i = 0;i < 2;i++)
2268                 {
2269                         surface->lightmapinfo->texturemins[i] = (int) floor(texmins[i] / 16.0) * 16;
2270                         surface->lightmapinfo->extents[i] = (int) ceil(texmaxs[i] / 16.0) * 16 - surface->lightmapinfo->texturemins[i];
2271                 }
2272
2273                 smax = surface->lightmapinfo->extents[0] >> 4;
2274                 tmax = surface->lightmapinfo->extents[1] >> 4;
2275                 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2276                 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2277
2278                 // lighting info
2279                 for (i = 0;i < MAXLIGHTMAPS;i++)
2280                         surface->lightmapinfo->styles[i] = in->styles[i];
2281                 surface->lightmaptexture = NULL;
2282                 surface->deluxemaptexture = r_texture_blanknormalmap;
2283                 i = LittleLong(in->lightofs);
2284                 if (i == -1)
2285                 {
2286                         surface->lightmapinfo->samples = NULL;
2287                         // give non-lightmapped water a 1x white lightmap
2288                         if ((surface->texture->basematerialflags & MATERIALFLAG_WATER) && (surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) && ssize <= 256 && tsize <= 256)
2289                         {
2290                                 surface->lightmapinfo->samples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2291                                 surface->lightmapinfo->styles[0] = 0;
2292                                 memset(surface->lightmapinfo->samples, 128, ssize * tsize * 3);
2293                         }
2294                 }
2295                 else if (loadmodel->brush.ishlbsp) // LordHavoc: HalfLife map (bsp version 30)
2296                         surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + i;
2297                 else // LordHavoc: white lighting (bsp version 29)
2298                 {
2299                         surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + (i * 3);
2300                         if (loadmodel->brushq1.nmaplightdata)
2301                                 surface->lightmapinfo->nmapsamples = loadmodel->brushq1.nmaplightdata + (i * 3);
2302                 }
2303
2304                 // check if we should apply a lightmap to this
2305                 if (!(surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) || surface->lightmapinfo->samples)
2306                 {
2307                         int i, iu, iv, lightmapx, lightmapy;
2308                         float u, v, ubase, vbase, uscale, vscale;
2309
2310                         if (ssize > 256 || tsize > 256)
2311                                 Host_Error("Bad surface extents");
2312                         // force lightmap upload on first time seeing the surface
2313                         surface->cached_dlight = true;
2314                         // stainmap for permanent marks on walls
2315                         surface->lightmapinfo->stainsamples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2316                         // clear to white
2317                         memset(surface->lightmapinfo->stainsamples, 255, ssize * tsize * 3);
2318
2319                         // find a place for this lightmap
2320                         if (!lightmaptexture || !Mod_Q1BSP_AllocLightmapBlock(lightmap_lineused, LIGHTMAPSIZE, LIGHTMAPSIZE, ssize, tsize, &lightmapx, &lightmapy))
2321                         {
2322                                 // allocate a texture pool if we need it
2323                                 if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
2324                                         loadmodel->texturepool = R_AllocTexturePool();
2325                                 // could not find room, make a new lightmap
2326                                 lightmaptexture = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%i", lightmapnumber), LIGHTMAPSIZE, LIGHTMAPSIZE, NULL, loadmodel->brushq1.lightmaprgba ? TEXTYPE_RGBA : TEXTYPE_RGB, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2327                                 if (loadmodel->brushq1.nmaplightdata)
2328                                         deluxemaptexture = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%i", lightmapnumber), LIGHTMAPSIZE, LIGHTMAPSIZE, NULL, loadmodel->brushq1.lightmaprgba ? TEXTYPE_RGBA : TEXTYPE_RGB, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2329                                 lightmapnumber++;
2330                                 memset(lightmap_lineused, 0, sizeof(lightmap_lineused));
2331                                 Mod_Q1BSP_AllocLightmapBlock(lightmap_lineused, LIGHTMAPSIZE, LIGHTMAPSIZE, ssize, tsize, &lightmapx, &lightmapy);
2332                         }
2333
2334                         surface->lightmaptexture = lightmaptexture;
2335                         surface->deluxemaptexture = deluxemaptexture;
2336                         surface->lightmapinfo->lightmaporigin[0] = lightmapx;
2337                         surface->lightmapinfo->lightmaporigin[1] = lightmapy;
2338
2339                         ubase = lightmapx * lightmaptexcoordscale;
2340                         vbase = lightmapy * lightmaptexcoordscale;
2341                         uscale = lightmaptexcoordscale;
2342                         vscale = lightmaptexcoordscale;
2343
2344                         for (i = 0;i < surface->num_vertices;i++)
2345                         {
2346                                 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);
2347                                 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);
2348                                 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = u * uscale + ubase;
2349                                 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = v * vscale + vbase;
2350                                 // LordHavoc: calc lightmap data offset for vertex lighting to use
2351                                 iu = (int) u;
2352                                 iv = (int) v;
2353                                 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = (bound(0, iv, tmax) * ssize + bound(0, iu, smax)) * 3;
2354                         }
2355                 }
2356         }
2357 }
2358
2359 static void Mod_Q1BSP_LoadNodes_RecursiveSetParent(mnode_t *node, mnode_t *parent)
2360 {
2361         //if (node->parent)
2362         //      Host_Error("Mod_Q1BSP_LoadNodes_RecursiveSetParent: runaway recursion");
2363         node->parent = parent;
2364         if (node->plane)
2365         {
2366                 // this is a node, recurse to children
2367                 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[0], node);
2368                 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[1], node);
2369                 // combine supercontents of children
2370                 node->combinedsupercontents = node->children[0]->combinedsupercontents | node->children[1]->combinedsupercontents;
2371         }
2372         else
2373         {
2374                 int j;
2375                 mleaf_t *leaf = (mleaf_t *)node;
2376                 // if this is a leaf, calculate supercontents mask from all collidable
2377                 // primitives in the leaf (brushes and collision surfaces)
2378                 // also flag if the leaf contains any collision surfaces
2379                 leaf->combinedsupercontents = 0;
2380                 // combine the supercontents values of all brushes in this leaf
2381                 for (j = 0;j < leaf->numleafbrushes;j++)
2382                         leaf->combinedsupercontents |= loadmodel->brush.data_brushes[leaf->firstleafbrush[j]].texture->supercontents;
2383                 // check if this leaf contains any collision surfaces (q3 patches)
2384                 for (j = 0;j < leaf->numleafsurfaces;j++)
2385                 {
2386                         msurface_t *surface = loadmodel->data_surfaces + leaf->firstleafsurface[j];
2387                         if (surface->num_collisiontriangles)
2388                         {
2389                                 leaf->containscollisionsurfaces = true;
2390                                 leaf->combinedsupercontents |= surface->texture->supercontents;
2391                         }
2392                 }
2393         }
2394 }
2395
2396 static void Mod_Q1BSP_LoadNodes(lump_t *l)
2397 {
2398         int                     i, j, count, p;
2399         dnode_t         *in;
2400         mnode_t         *out;
2401
2402         in = (dnode_t *)(mod_base + l->fileofs);
2403         if (l->filelen % sizeof(*in))
2404                 Host_Error("Mod_Q1BSP_LoadNodes: funny lump size in %s",loadmodel->name);
2405         count = l->filelen / sizeof(*in);
2406         out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2407
2408         loadmodel->brush.data_nodes = out;
2409         loadmodel->brush.num_nodes = count;
2410
2411         for ( i=0 ; i<count ; i++, in++, out++)
2412         {
2413                 for (j=0 ; j<3 ; j++)
2414                 {
2415                         out->mins[j] = LittleShort(in->mins[j]);
2416                         out->maxs[j] = LittleShort(in->maxs[j]);
2417                 }
2418
2419                 p = LittleLong(in->planenum);
2420                 out->plane = loadmodel->brush.data_planes + p;
2421
2422                 out->firstsurface = LittleShort(in->firstface);
2423                 out->numsurfaces = LittleShort(in->numfaces);
2424
2425                 for (j=0 ; j<2 ; j++)
2426                 {
2427                         p = LittleShort(in->children[j]);
2428                         if (p >= 0)
2429                                 out->children[j] = loadmodel->brush.data_nodes + p;
2430                         else
2431                                 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + (-1 - p));
2432                 }
2433         }
2434
2435         Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);      // sets nodes and leafs
2436 }
2437
2438 static void Mod_Q1BSP_LoadLeafs(lump_t *l)
2439 {
2440         dleaf_t *in;
2441         mleaf_t *out;
2442         int i, j, count, p;
2443
2444         in = (dleaf_t *)(mod_base + l->fileofs);
2445         if (l->filelen % sizeof(*in))
2446                 Host_Error("Mod_Q1BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
2447         count = l->filelen / sizeof(*in);
2448         out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2449
2450         loadmodel->brush.data_leafs = out;
2451         loadmodel->brush.num_leafs = count;
2452         // get visleafs from the submodel data
2453         loadmodel->brush.num_pvsclusters = loadmodel->brushq1.submodels[0].visleafs;
2454         loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters+7)>>3;
2455         loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2456         memset(loadmodel->brush.data_pvsclusters, 0xFF, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2457
2458         for ( i=0 ; i<count ; i++, in++, out++)
2459         {
2460                 for (j=0 ; j<3 ; j++)
2461                 {
2462                         out->mins[j] = LittleShort(in->mins[j]);
2463                         out->maxs[j] = LittleShort(in->maxs[j]);
2464                 }
2465
2466                 // FIXME: this function could really benefit from some error checking
2467
2468                 out->contents = LittleLong(in->contents);
2469
2470                 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + LittleShort(in->firstmarksurface);
2471                 out->numleafsurfaces = LittleShort(in->nummarksurfaces);
2472                 if (out->firstleafsurface < 0 || LittleShort(in->firstmarksurface) + out->numleafsurfaces > loadmodel->brush.num_leafsurfaces)
2473                 {
2474                         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);
2475                         out->firstleafsurface = NULL;
2476                         out->numleafsurfaces = 0;
2477                 }
2478
2479                 out->clusterindex = i - 1;
2480                 if (out->clusterindex >= loadmodel->brush.num_pvsclusters)
2481                         out->clusterindex = -1;
2482
2483                 p = LittleLong(in->visofs);
2484                 // ignore visofs errors on leaf 0 (solid)
2485                 if (p >= 0 && out->clusterindex >= 0)
2486                 {
2487                         if (p >= loadmodel->brushq1.num_compressedpvs)
2488                                 Con_Print("Mod_Q1BSP_LoadLeafs: invalid visofs\n");
2489                         else
2490                                 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);
2491                 }
2492
2493                 for (j = 0;j < 4;j++)
2494                         out->ambient_sound_level[j] = in->ambient_level[j];
2495
2496                 // FIXME: Insert caustics here
2497         }
2498 }
2499
2500 qboolean Mod_Q1BSP_CheckWaterAlphaSupport(void)
2501 {
2502         int i, j;
2503         mleaf_t *leaf;
2504         const unsigned char *pvs;
2505         // check all liquid leafs to see if they can see into empty leafs, if any
2506         // can we can assume this map supports r_wateralpha
2507         for (i = 0, leaf = loadmodel->brush.data_leafs;i < loadmodel->brush.num_leafs;i++, leaf++)
2508         {
2509                 if ((leaf->contents == CONTENTS_WATER || leaf->contents == CONTENTS_SLIME) && (leaf->clusterindex >= 0 && loadmodel->brush.data_pvsclusters))
2510                 {
2511                         pvs = loadmodel->brush.data_pvsclusters + leaf->clusterindex * loadmodel->brush.num_pvsclusterbytes;
2512                         for (j = 0;j < loadmodel->brush.num_leafs;j++)
2513                                 if (CHECKPVSBIT(pvs, loadmodel->brush.data_leafs[j].clusterindex) && loadmodel->brush.data_leafs[j].contents == CONTENTS_EMPTY)
2514                                         return true;
2515                 }
2516         }
2517         return false;
2518 }
2519
2520 static void Mod_Q1BSP_LoadClipnodes(lump_t *l, hullinfo_t *hullinfo)
2521 {
2522         dclipnode_t *in, *out;
2523         int                     i, count;
2524         hull_t          *hull;
2525
2526         in = (dclipnode_t *)(mod_base + l->fileofs);
2527         if (l->filelen % sizeof(*in))
2528                 Host_Error("Mod_Q1BSP_LoadClipnodes: funny lump size in %s",loadmodel->name);
2529         count = l->filelen / sizeof(*in);
2530         out = (dclipnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2531
2532         loadmodel->brushq1.clipnodes = out;
2533         loadmodel->brushq1.numclipnodes = count;
2534
2535         for (i = 1; i < hullinfo->numhulls; i++)
2536         {
2537                 hull = &loadmodel->brushq1.hulls[i];
2538                 hull->clipnodes = out;
2539                 hull->firstclipnode = 0;
2540                 hull->lastclipnode = count-1;
2541                 hull->planes = loadmodel->brush.data_planes;
2542                 hull->clip_mins[0] = hullinfo->hullsizes[i][0][0];
2543                 hull->clip_mins[1] = hullinfo->hullsizes[i][0][1];
2544                 hull->clip_mins[2] = hullinfo->hullsizes[i][0][2];
2545                 hull->clip_maxs[0] = hullinfo->hullsizes[i][1][0];
2546                 hull->clip_maxs[1] = hullinfo->hullsizes[i][1][1];
2547                 hull->clip_maxs[2] = hullinfo->hullsizes[i][1][2];
2548                 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2549         }
2550
2551         for (i=0 ; i<count ; i++, out++, in++)
2552         {
2553                 out->planenum = LittleLong(in->planenum);
2554                 out->children[0] = LittleShort(in->children[0]);
2555                 out->children[1] = LittleShort(in->children[1]);
2556                 if (out->planenum < 0 || out->planenum >= loadmodel->brush.num_planes)
2557                         Host_Error("Corrupt clipping hull(out of range planenum)");
2558                 if (out->children[0] >= count || out->children[1] >= count)
2559                         Host_Error("Corrupt clipping hull(out of range child)");
2560         }
2561 }
2562
2563 //Duplicate the drawing hull structure as a clipping hull
2564 static void Mod_Q1BSP_MakeHull0(void)
2565 {
2566         mnode_t         *in;
2567         dclipnode_t *out;
2568         int                     i;
2569         hull_t          *hull;
2570
2571         hull = &loadmodel->brushq1.hulls[0];
2572
2573         in = loadmodel->brush.data_nodes;
2574         out = (dclipnode_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(dclipnode_t));
2575
2576         hull->clipnodes = out;
2577         hull->firstclipnode = 0;
2578         hull->lastclipnode = loadmodel->brush.num_nodes - 1;
2579         hull->planes = loadmodel->brush.data_planes;
2580
2581         for (i = 0;i < loadmodel->brush.num_nodes;i++, out++, in++)
2582         {
2583                 out->planenum = in->plane - loadmodel->brush.data_planes;
2584                 out->children[0] = in->children[0]->plane ? in->children[0] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[0])->contents;
2585                 out->children[1] = in->children[1]->plane ? in->children[1] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[1])->contents;
2586         }
2587 }
2588
2589 static void Mod_Q1BSP_LoadLeaffaces(lump_t *l)
2590 {
2591         int i, j;
2592         short *in;
2593
2594         in = (short *)(mod_base + l->fileofs);
2595         if (l->filelen % sizeof(*in))
2596                 Host_Error("Mod_Q1BSP_LoadLeaffaces: funny lump size in %s",loadmodel->name);
2597         loadmodel->brush.num_leafsurfaces = l->filelen / sizeof(*in);
2598         loadmodel->brush.data_leafsurfaces = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafsurfaces * sizeof(int));
2599
2600         for (i = 0;i < loadmodel->brush.num_leafsurfaces;i++)
2601         {
2602                 j = (unsigned) LittleShort(in[i]);
2603                 if (j >= loadmodel->num_surfaces)
2604                         Host_Error("Mod_Q1BSP_LoadLeaffaces: bad surface number");
2605                 loadmodel->brush.data_leafsurfaces[i] = j;
2606         }
2607 }
2608
2609 static void Mod_Q1BSP_LoadSurfedges(lump_t *l)
2610 {
2611         int             i;
2612         int             *in;
2613
2614         in = (int *)(mod_base + l->fileofs);
2615         if (l->filelen % sizeof(*in))
2616                 Host_Error("Mod_Q1BSP_LoadSurfedges: funny lump size in %s",loadmodel->name);
2617         loadmodel->brushq1.numsurfedges = l->filelen / sizeof(*in);
2618         loadmodel->brushq1.surfedges = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numsurfedges * sizeof(int));
2619
2620         for (i = 0;i < loadmodel->brushq1.numsurfedges;i++)
2621                 loadmodel->brushq1.surfedges[i] = LittleLong(in[i]);
2622 }
2623
2624
2625 static void Mod_Q1BSP_LoadPlanes(lump_t *l)
2626 {
2627         int                     i;
2628         mplane_t        *out;
2629         dplane_t        *in;
2630
2631         in = (dplane_t *)(mod_base + l->fileofs);
2632         if (l->filelen % sizeof(*in))
2633                 Host_Error("Mod_Q1BSP_LoadPlanes: funny lump size in %s", loadmodel->name);
2634
2635         loadmodel->brush.num_planes = l->filelen / sizeof(*in);
2636         loadmodel->brush.data_planes = out = (mplane_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_planes * sizeof(*out));
2637
2638         for (i = 0;i < loadmodel->brush.num_planes;i++, in++, out++)
2639         {
2640                 out->normal[0] = LittleFloat(in->normal[0]);
2641                 out->normal[1] = LittleFloat(in->normal[1]);
2642                 out->normal[2] = LittleFloat(in->normal[2]);
2643                 out->dist = LittleFloat(in->dist);
2644
2645                 PlaneClassify(out);
2646         }
2647 }
2648
2649 static void Mod_Q1BSP_LoadMapBrushes(void)
2650 {
2651 #if 0
2652 // unfinished
2653         int submodel, numbrushes;
2654         qboolean firstbrush;
2655         char *text, *maptext;
2656         char mapfilename[MAX_QPATH];
2657         FS_StripExtension (loadmodel->name, mapfilename, sizeof (mapfilename));
2658         strlcat (mapfilename, ".map", sizeof (mapfilename));
2659         maptext = (unsigned char*) FS_LoadFile(mapfilename, tempmempool, false, NULL);
2660         if (!maptext)
2661                 return;
2662         text = maptext;
2663         if (!COM_ParseTokenConsole(&data))
2664                 return; // error
2665         submodel = 0;
2666         for (;;)
2667         {
2668                 if (!COM_ParseTokenConsole(&data))
2669                         break;
2670                 if (com_token[0] != '{')
2671                         return; // error
2672                 // entity
2673                 firstbrush = true;
2674                 numbrushes = 0;
2675                 maxbrushes = 256;
2676                 brushes = Mem_Alloc(loadmodel->mempool, maxbrushes * sizeof(mbrush_t));
2677                 for (;;)
2678                 {
2679                         if (!COM_ParseTokenConsole(&data))
2680                                 return; // error
2681                         if (com_token[0] == '}')
2682                                 break; // end of entity
2683                         if (com_token[0] == '{')
2684                         {
2685                                 // brush
2686                                 if (firstbrush)
2687                                 {
2688                                         if (submodel)
2689                                         {
2690                                                 if (submodel > loadmodel->brush.numsubmodels)
2691                                                 {
2692                                                         Con_Printf("Mod_Q1BSP_LoadMapBrushes: .map has more submodels than .bsp!\n");
2693                                                         model = NULL;
2694                                                 }
2695                                                 else
2696                                                         model = loadmodel->brush.submodels[submodel];
2697                                         }
2698                                         else
2699                                                 model = loadmodel;
2700                                 }
2701                                 for (;;)
2702                                 {
2703                                         if (!COM_ParseTokenConsole(&data))
2704                                                 return; // error
2705                                         if (com_token[0] == '}')
2706                                                 break; // end of brush
2707                                         // each brush face should be this format:
2708                                         // ( x y z ) ( x y z ) ( x y z ) texture scroll_s scroll_t rotateangle scale_s scale_t
2709                                         // FIXME: support hl .map format
2710                                         for (pointnum = 0;pointnum < 3;pointnum++)
2711                                         {
2712                                                 COM_ParseTokenConsole(&data);
2713                                                 for (componentnum = 0;componentnum < 3;componentnum++)
2714                                                 {
2715                                                         COM_ParseTokenConsole(&data);
2716                                                         point[pointnum][componentnum] = atof(com_token);
2717                                                 }
2718                                                 COM_ParseTokenConsole(&data);
2719                                         }
2720                                         COM_ParseTokenConsole(&data);
2721                                         strlcpy(facetexture, com_token, sizeof(facetexture));
2722                                         COM_ParseTokenConsole(&data);
2723                                         //scroll_s = atof(com_token);
2724                                         COM_ParseTokenConsole(&data);
2725                                         //scroll_t = atof(com_token);
2726                                         COM_ParseTokenConsole(&data);
2727                                         //rotate = atof(com_token);
2728                                         COM_ParseTokenConsole(&data);
2729                                         //scale_s = atof(com_token);
2730                                         COM_ParseTokenConsole(&data);
2731                                         //scale_t = atof(com_token);
2732                                         TriangleNormal(point[0], point[1], point[2], planenormal);
2733                                         VectorNormalizeDouble(planenormal);
2734                                         planedist = DotProduct(point[0], planenormal);
2735                                         //ChooseTexturePlane(planenormal, texturevector[0], texturevector[1]);
2736                                 }
2737                                 continue;
2738                         }
2739                 }
2740         }
2741 #endif
2742 }
2743
2744
2745 #define MAX_PORTALPOINTS 64
2746
2747 typedef struct portal_s
2748 {
2749         mplane_t plane;
2750         mnode_t *nodes[2];              // [0] = front side of plane
2751         struct portal_s *next[2];
2752         int numpoints;
2753         double points[3*MAX_PORTALPOINTS];
2754         struct portal_s *chain; // all portals are linked into a list
2755 }
2756 portal_t;
2757
2758 static portal_t *portalchain;
2759
2760 /*
2761 ===========
2762 AllocPortal
2763 ===========
2764 */
2765 static portal_t *AllocPortal(void)
2766 {
2767         portal_t *p;
2768         p = (portal_t *)Mem_Alloc(loadmodel->mempool, sizeof(portal_t));
2769         p->chain = portalchain;
2770         portalchain = p;
2771         return p;
2772 }
2773
2774 static void FreePortal(portal_t *p)
2775 {
2776         Mem_Free(p);
2777 }
2778
2779 static void Mod_Q1BSP_RecursiveRecalcNodeBBox(mnode_t *node)
2780 {
2781         // process only nodes (leafs already had their box calculated)
2782         if (!node->plane)
2783                 return;
2784
2785         // calculate children first
2786         Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[0]);
2787         Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[1]);
2788
2789         // make combined bounding box from children
2790         node->mins[0] = min(node->children[0]->mins[0], node->children[1]->mins[0]);
2791         node->mins[1] = min(node->children[0]->mins[1], node->children[1]->mins[1]);
2792         node->mins[2] = min(node->children[0]->mins[2], node->children[1]->mins[2]);
2793         node->maxs[0] = max(node->children[0]->maxs[0], node->children[1]->maxs[0]);
2794         node->maxs[1] = max(node->children[0]->maxs[1], node->children[1]->maxs[1]);
2795         node->maxs[2] = max(node->children[0]->maxs[2], node->children[1]->maxs[2]);
2796 }
2797
2798 static void Mod_Q1BSP_FinalizePortals(void)
2799 {
2800         int i, j, numportals, numpoints;
2801         portal_t *p, *pnext;
2802         mportal_t *portal;
2803         mvertex_t *point;
2804         mleaf_t *leaf, *endleaf;
2805
2806         // tally up portal and point counts and recalculate bounding boxes for all
2807         // leafs (because qbsp is very sloppy)
2808         leaf = loadmodel->brush.data_leafs;
2809         endleaf = leaf + loadmodel->brush.num_leafs;
2810         for (;leaf < endleaf;leaf++)
2811         {
2812                 VectorSet(leaf->mins,  2000000000,  2000000000,  2000000000);
2813                 VectorSet(leaf->maxs, -2000000000, -2000000000, -2000000000);
2814         }
2815         p = portalchain;
2816         numportals = 0;
2817         numpoints = 0;
2818         while (p)
2819         {
2820                 // note: this check must match the one below or it will usually corrupt memory
2821                 // the nodes[0] != nodes[1] check is because leaf 0 is the shared solid leaf, it can have many portals inside with leaf 0 on both sides
2822                 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1] && ((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
2823                 {
2824                         numportals += 2;
2825                         numpoints += p->numpoints * 2;
2826                 }
2827                 p = p->chain;
2828         }
2829         loadmodel->brush.data_portals = (mportal_t *)Mem_Alloc(loadmodel->mempool, numportals * sizeof(mportal_t) + numpoints * sizeof(mvertex_t));
2830         loadmodel->brush.num_portals = numportals;
2831         loadmodel->brush.data_portalpoints = (mvertex_t *)((unsigned char *) loadmodel->brush.data_portals + numportals * sizeof(mportal_t));
2832         loadmodel->brush.num_portalpoints = numpoints;
2833         // clear all leaf portal chains
2834         for (i = 0;i < loadmodel->brush.num_leafs;i++)
2835                 loadmodel->brush.data_leafs[i].portals = NULL;
2836         // process all portals in the global portal chain, while freeing them
2837         portal = loadmodel->brush.data_portals;
2838         point = loadmodel->brush.data_portalpoints;
2839         p = portalchain;
2840         portalchain = NULL;
2841         while (p)
2842         {
2843                 pnext = p->chain;
2844
2845                 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1])
2846                 {
2847                         // note: this check must match the one above or it will usually corrupt memory
2848                         // the nodes[0] != nodes[1] check is because leaf 0 is the shared solid leaf, it can have many portals inside with leaf 0 on both sides
2849                         if (((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
2850                         {
2851                                 // first make the back to front portal(forward portal)
2852                                 portal->points = point;
2853                                 portal->numpoints = p->numpoints;
2854                                 portal->plane.dist = p->plane.dist;
2855                                 VectorCopy(p->plane.normal, portal->plane.normal);
2856                                 portal->here = (mleaf_t *)p->nodes[1];
2857                                 portal->past = (mleaf_t *)p->nodes[0];
2858                                 // copy points
2859                                 for (j = 0;j < portal->numpoints;j++)
2860                                 {
2861                                         VectorCopy(p->points + j*3, point->position);
2862                                         point++;
2863                                 }
2864                                 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
2865                                 PlaneClassify(&portal->plane);
2866
2867                                 // link into leaf's portal chain
2868                                 portal->next = portal->here->portals;
2869                                 portal->here->portals = portal;
2870
2871                                 // advance to next portal
2872                                 portal++;
2873
2874                                 // then make the front to back portal(backward portal)
2875                                 portal->points = point;
2876                                 portal->numpoints = p->numpoints;
2877                                 portal->plane.dist = -p->plane.dist;
2878                                 VectorNegate(p->plane.normal, portal->plane.normal);
2879                                 portal->here = (mleaf_t *)p->nodes[0];
2880                                 portal->past = (mleaf_t *)p->nodes[1];
2881                                 // copy points
2882                                 for (j = portal->numpoints - 1;j >= 0;j--)
2883                                 {
2884                                         VectorCopy(p->points + j*3, point->position);
2885                                         point++;
2886                                 }
2887                                 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
2888                                 PlaneClassify(&portal->plane);
2889
2890                                 // link into leaf's portal chain
2891                                 portal->next = portal->here->portals;
2892                                 portal->here->portals = portal;
2893
2894                                 // advance to next portal
2895                                 portal++;
2896                         }
2897                         // add the portal's polygon points to the leaf bounding boxes
2898                         for (i = 0;i < 2;i++)
2899                         {
2900                                 leaf = (mleaf_t *)p->nodes[i];
2901                                 for (j = 0;j < p->numpoints;j++)
2902                                 {
2903                                         if (leaf->mins[0] > p->points[j*3+0]) leaf->mins[0] = p->points[j*3+0];
2904                                         if (leaf->mins[1] > p->points[j*3+1]) leaf->mins[1] = p->points[j*3+1];
2905                                         if (leaf->mins[2] > p->points[j*3+2]) leaf->mins[2] = p->points[j*3+2];
2906                                         if (leaf->maxs[0] < p->points[j*3+0]) leaf->maxs[0] = p->points[j*3+0];
2907                                         if (leaf->maxs[1] < p->points[j*3+1]) leaf->maxs[1] = p->points[j*3+1];
2908                                         if (leaf->maxs[2] < p->points[j*3+2]) leaf->maxs[2] = p->points[j*3+2];
2909                                 }
2910                         }
2911                 }
2912                 FreePortal(p);
2913                 p = pnext;
2914         }
2915         // now recalculate the node bounding boxes from the leafs
2916         Mod_Q1BSP_RecursiveRecalcNodeBBox(loadmodel->brush.data_nodes);
2917 }
2918
2919 /*
2920 =============
2921 AddPortalToNodes
2922 =============
2923 */
2924 static void AddPortalToNodes(portal_t *p, mnode_t *front, mnode_t *back)
2925 {
2926         if (!front)
2927                 Host_Error("AddPortalToNodes: NULL front node");
2928         if (!back)
2929                 Host_Error("AddPortalToNodes: NULL back node");
2930         if (p->nodes[0] || p->nodes[1])
2931                 Host_Error("AddPortalToNodes: already included");
2932         // note: front == back is handled gracefully, because leaf 0 is the shared solid leaf, it can often have portals with the same leaf on both sides
2933
2934         p->nodes[0] = front;
2935         p->next[0] = (portal_t *)front->portals;
2936         front->portals = (mportal_t *)p;
2937
2938         p->nodes[1] = back;
2939         p->next[1] = (portal_t *)back->portals;
2940         back->portals = (mportal_t *)p;
2941 }
2942
2943 /*
2944 =============
2945 RemovePortalFromNode
2946 =============
2947 */
2948 static void RemovePortalFromNodes(portal_t *portal)
2949 {
2950         int i;
2951         mnode_t *node;
2952         void **portalpointer;
2953         portal_t *t;
2954         for (i = 0;i < 2;i++)
2955         {
2956                 node = portal->nodes[i];
2957
2958                 portalpointer = (void **) &node->portals;
2959                 while (1)
2960                 {
2961                         t = (portal_t *)*portalpointer;
2962                         if (!t)
2963                                 Host_Error("RemovePortalFromNodes: portal not in leaf");
2964
2965                         if (t == portal)
2966                         {
2967                                 if (portal->nodes[0] == node)
2968                                 {
2969                                         *portalpointer = portal->next[0];
2970                                         portal->nodes[0] = NULL;
2971                                 }
2972                                 else if (portal->nodes[1] == node)
2973                                 {
2974                                         *portalpointer = portal->next[1];
2975                                         portal->nodes[1] = NULL;
2976                                 }
2977                                 else
2978                                         Host_Error("RemovePortalFromNodes: portal not bounding leaf");
2979                                 break;
2980                         }
2981
2982                         if (t->nodes[0] == node)
2983                                 portalpointer = (void **) &t->next[0];
2984                         else if (t->nodes[1] == node)
2985                                 portalpointer = (void **) &t->next[1];
2986                         else
2987                                 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
2988                 }
2989         }
2990 }
2991
2992 #define PORTAL_DIST_EPSILON (1.0 / 32.0)
2993 static void Mod_Q1BSP_RecursiveNodePortals(mnode_t *node)
2994 {
2995         int i, side;
2996         mnode_t *front, *back, *other_node;
2997         mplane_t clipplane, *plane;
2998         portal_t *portal, *nextportal, *nodeportal, *splitportal, *temp;
2999         int numfrontpoints, numbackpoints;
3000         double frontpoints[3*MAX_PORTALPOINTS], backpoints[3*MAX_PORTALPOINTS];
3001
3002         // if a leaf, we're done
3003         if (!node->plane)
3004                 return;
3005
3006         plane = node->plane;
3007
3008         front = node->children[0];
3009         back = node->children[1];
3010         if (front == back)
3011                 Host_Error("Mod_Q1BSP_RecursiveNodePortals: corrupt node hierarchy");
3012
3013         // create the new portal by generating a polygon for the node plane,
3014         // and clipping it by all of the other portals(which came from nodes above this one)
3015         nodeportal = AllocPortal();
3016         nodeportal->plane = *plane;
3017
3018         // TODO: calculate node bounding boxes during recursion and calculate a maximum plane size accordingly to improve precision (as most maps do not need 1 billion unit plane polygons)
3019         PolygonD_QuadForPlane(nodeportal->points, nodeportal->plane.normal[0], nodeportal->plane.normal[1], nodeportal->plane.normal[2], nodeportal->plane.dist, 1024.0*1024.0*1024.0);
3020         nodeportal->numpoints = 4;
3021         side = 0;       // shut up compiler warning
3022         for (portal = (portal_t *)node->portals;portal;portal = portal->next[side])
3023         {
3024                 clipplane = portal->plane;
3025                 if (portal->nodes[0] == portal->nodes[1])
3026                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(1)");
3027                 if (portal->nodes[0] == node)
3028                         side = 0;
3029                 else if (portal->nodes[1] == node)
3030                 {
3031                         clipplane.dist = -clipplane.dist;
3032                         VectorNegate(clipplane.normal, clipplane.normal);
3033                         side = 1;
3034                 }
3035                 else
3036                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3037
3038                 for (i = 0;i < nodeportal->numpoints*3;i++)
3039                         frontpoints[i] = nodeportal->points[i];
3040                 PolygonD_Divide(nodeportal->numpoints, frontpoints, clipplane.normal[0], clipplane.normal[1], clipplane.normal[2], clipplane.dist, PORTAL_DIST_EPSILON, MAX_PORTALPOINTS, nodeportal->points, &nodeportal->numpoints, 0, NULL, NULL, NULL);
3041                 if (nodeportal->numpoints <= 0 || nodeportal->numpoints >= MAX_PORTALPOINTS)
3042                         break;
3043         }
3044
3045         if (nodeportal->numpoints < 3)
3046         {
3047                 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal was clipped away\n");
3048                 nodeportal->numpoints = 0;
3049         }
3050         else if (nodeportal->numpoints >= MAX_PORTALPOINTS)
3051         {
3052                 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal has too many points\n");
3053                 nodeportal->numpoints = 0;
3054         }
3055
3056         AddPortalToNodes(nodeportal, front, back);
3057
3058         // split the portals of this node along this node's plane and assign them to the children of this node
3059         // (migrating the portals downward through the tree)
3060         for (portal = (portal_t *)node->portals;portal;portal = nextportal)
3061         {
3062                 if (portal->nodes[0] == portal->nodes[1])
3063                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(2)");
3064                 if (portal->nodes[0] == node)
3065                         side = 0;
3066                 else if (portal->nodes[1] == node)
3067                         side = 1;
3068                 else
3069                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3070                 nextportal = portal->next[side];
3071                 if (!portal->numpoints)
3072                         continue;
3073
3074                 other_node = portal->nodes[!side];
3075                 RemovePortalFromNodes(portal);
3076
3077                 // cut the portal into two portals, one on each side of the node plane
3078                 PolygonD_Divide(portal->numpoints, portal->points, plane->normal[0], plane->normal[1], plane->normal[2], plane->dist, PORTAL_DIST_EPSILON, MAX_PORTALPOINTS, frontpoints, &numfrontpoints, MAX_PORTALPOINTS, backpoints, &numbackpoints, NULL);
3079
3080                 if (!numfrontpoints)
3081                 {
3082                         if (side == 0)
3083                                 AddPortalToNodes(portal, back, other_node);
3084                         else
3085                                 AddPortalToNodes(portal, other_node, back);
3086                         continue;
3087                 }
3088                 if (!numbackpoints)
3089                 {
3090                         if (side == 0)
3091                                 AddPortalToNodes(portal, front, other_node);
3092                         else
3093                                 AddPortalToNodes(portal, other_node, front);
3094                         continue;
3095                 }
3096
3097                 // the portal is split
3098                 splitportal = AllocPortal();
3099                 temp = splitportal->chain;
3100                 *splitportal = *portal;
3101                 splitportal->chain = temp;
3102                 for (i = 0;i < numbackpoints*3;i++)
3103                         splitportal->points[i] = backpoints[i];
3104                 splitportal->numpoints = numbackpoints;
3105                 for (i = 0;i < numfrontpoints*3;i++)
3106                         portal->points[i] = frontpoints[i];
3107                 portal->numpoints = numfrontpoints;
3108
3109                 if (side == 0)
3110                 {
3111                         AddPortalToNodes(portal, front, other_node);
3112                         AddPortalToNodes(splitportal, back, other_node);
3113                 }
3114                 else
3115                 {
3116                         AddPortalToNodes(portal, other_node, front);
3117                         AddPortalToNodes(splitportal, other_node, back);
3118                 }
3119         }
3120
3121         Mod_Q1BSP_RecursiveNodePortals(front);
3122         Mod_Q1BSP_RecursiveNodePortals(back);
3123 }
3124
3125 static void Mod_Q1BSP_MakePortals(void)
3126 {
3127         portalchain = NULL;
3128         Mod_Q1BSP_RecursiveNodePortals(loadmodel->brush.data_nodes);
3129         Mod_Q1BSP_FinalizePortals();
3130 }
3131
3132 static void Mod_Q1BSP_BuildLightmapUpdateChains(mempool_t *mempool, model_t *model)
3133 {
3134         int i, j, stylecounts[256], totalcount, remapstyles[256];
3135         msurface_t *surface;
3136         memset(stylecounts, 0, sizeof(stylecounts));
3137         for (i = 0;i < model->nummodelsurfaces;i++)
3138         {
3139                 surface = model->data_surfaces + model->firstmodelsurface + i;
3140                 for (j = 0;j < MAXLIGHTMAPS;j++)
3141                         stylecounts[surface->lightmapinfo->styles[j]]++;
3142         }
3143         totalcount = 0;
3144         model->brushq1.light_styles = 0;
3145         for (i = 0;i < 255;i++)
3146         {
3147                 if (stylecounts[i])
3148                 {
3149                         remapstyles[i] = model->brushq1.light_styles++;
3150                         totalcount += stylecounts[i] + 1;
3151                 }
3152         }
3153         if (!totalcount)
3154                 return;
3155         model->brushq1.light_style = (unsigned char *)Mem_Alloc(mempool, model->brushq1.light_styles * sizeof(unsigned char));
3156         model->brushq1.light_stylevalue = (int *)Mem_Alloc(mempool, model->brushq1.light_styles * sizeof(int));
3157         model->brushq1.light_styleupdatechains = (msurface_t ***)Mem_Alloc(mempool, model->brushq1.light_styles * sizeof(msurface_t **));
3158         model->brushq1.light_styleupdatechainsbuffer = (msurface_t **)Mem_Alloc(mempool, totalcount * sizeof(msurface_t *));
3159         model->brushq1.light_styles = 0;
3160         for (i = 0;i < 255;i++)
3161                 if (stylecounts[i])
3162                         model->brushq1.light_style[model->brushq1.light_styles++] = i;
3163         j = 0;
3164         for (i = 0;i < model->brushq1.light_styles;i++)
3165         {
3166                 model->brushq1.light_styleupdatechains[i] = model->brushq1.light_styleupdatechainsbuffer + j;
3167                 j += stylecounts[model->brushq1.light_style[i]] + 1;
3168         }
3169         for (i = 0;i < model->nummodelsurfaces;i++)
3170         {
3171                 surface = model->data_surfaces + model->firstmodelsurface + i;
3172                 for (j = 0;j < MAXLIGHTMAPS;j++)
3173                         if (surface->lightmapinfo->styles[j] != 255)
3174                                 *model->brushq1.light_styleupdatechains[remapstyles[surface->lightmapinfo->styles[j]]]++ = surface;
3175         }
3176         j = 0;
3177         for (i = 0;i < model->brushq1.light_styles;i++)
3178         {
3179                 *model->brushq1.light_styleupdatechains[i] = NULL;
3180                 model->brushq1.light_styleupdatechains[i] = model->brushq1.light_styleupdatechainsbuffer + j;
3181                 j += stylecounts[model->brushq1.light_style[i]] + 1;
3182         }
3183 }
3184
3185 //Returns PVS data for a given point
3186 //(note: can return NULL)
3187 static unsigned char *Mod_Q1BSP_GetPVS(model_t *model, const vec3_t p)
3188 {
3189         mnode_t *node;
3190         node = model->brush.data_nodes;
3191         while (node->plane)
3192                 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
3193         if (((mleaf_t *)node)->clusterindex >= 0)
3194                 return model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3195         else
3196                 return NULL;
3197 }
3198
3199 static void Mod_Q1BSP_FatPVS_RecursiveBSPNode(model_t *model, const vec3_t org, vec_t radius, unsigned char *pvsbuffer, int pvsbytes, mnode_t *node)
3200 {
3201         while (node->plane)
3202         {
3203                 float d = PlaneDiff(org, node->plane);
3204                 if (d > radius)
3205                         node = node->children[0];
3206                 else if (d < -radius)
3207                         node = node->children[1];
3208                 else
3209                 {
3210                         // go down both sides
3211                         Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, pvsbytes, node->children[0]);
3212                         node = node->children[1];
3213                 }
3214         }
3215         // if this leaf is in a cluster, accumulate the pvs bits
3216         if (((mleaf_t *)node)->clusterindex >= 0)
3217         {
3218                 int i;
3219                 unsigned char *pvs = model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3220                 for (i = 0;i < pvsbytes;i++)
3221                         pvsbuffer[i] |= pvs[i];
3222         }
3223 }
3224
3225 //Calculates a PVS that is the inclusive or of all leafs within radius pixels
3226 //of the given point.
3227 static int Mod_Q1BSP_FatPVS(model_t *model, const vec3_t org, vec_t radius, unsigned char *pvsbuffer, int pvsbufferlength)
3228 {
3229         int bytes = model->brush.num_pvsclusterbytes;
3230         bytes = min(bytes, pvsbufferlength);
3231         if (r_novis.integer || !model->brush.num_pvsclusters || !Mod_Q1BSP_GetPVS(model, org))
3232         {
3233                 memset(pvsbuffer, 0xFF, bytes);
3234                 return bytes;
3235         }
3236         memset(pvsbuffer, 0, bytes);
3237         Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, bytes, model->brush.data_nodes);
3238         return bytes;
3239 }
3240
3241 static void Mod_Q1BSP_RoundUpToHullSize(model_t *cmodel, const vec3_t inmins, const vec3_t inmaxs, vec3_t outmins, vec3_t outmaxs)
3242 {
3243         vec3_t size;
3244         const hull_t *hull;
3245
3246         VectorSubtract(inmaxs, inmins, size);
3247         if (cmodel->brush.ismcbsp)
3248         {
3249                 if (size[0] < 3)
3250                         hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3251                 else if (size[2] < 48) // pick the nearest of 40 or 56
3252                         hull = &cmodel->brushq1.hulls[2]; // 16x16x40
3253                 else
3254                         hull = &cmodel->brushq1.hulls[1]; // 16x16x56
3255         }
3256         else if (cmodel->brush.ishlbsp)
3257         {
3258                 if (size[0] < 3)
3259                         hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3260                 else if (size[0] <= 32)
3261                 {
3262                         if (size[2] < 54) // pick the nearest of 36 or 72
3263                                 hull = &cmodel->brushq1.hulls[3]; // 32x32x36
3264                         else
3265                                 hull = &cmodel->brushq1.hulls[1]; // 32x32x72
3266                 }
3267                 else
3268                         hull = &cmodel->brushq1.hulls[2]; // 64x64x64
3269         }
3270         else
3271         {
3272                 if (size[0] < 3)
3273                         hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3274                 else if (size[0] <= 32)
3275                         hull = &cmodel->brushq1.hulls[1]; // 32x32x56
3276                 else
3277                         hull = &cmodel->brushq1.hulls[2]; // 64x64x88
3278         }
3279         VectorCopy(inmins, outmins);
3280         VectorAdd(inmins, hull->clip_size, outmaxs);
3281 }
3282
3283 void Mod_Q1BSP_Load(model_t *mod, void *buffer, void *bufferend)
3284 {
3285         int i, j, k;
3286         dheader_t *header;
3287         dmodel_t *bm;
3288         mempool_t *mainmempool;
3289         float dist, modelyawradius, modelradius, *vec;
3290         msurface_t *surface;
3291         int numshadowmeshtriangles;
3292         dheader_t _header;
3293         hullinfo_t hullinfo;
3294
3295         mod->type = mod_brushq1;
3296
3297         if (!memcmp (buffer, "MCBSPpad", 8))
3298         {
3299                 unsigned char   *index;
3300
3301                 mod->brush.ismcbsp = true;
3302                 mod->brush.ishlbsp = false;
3303
3304                 mod_base = (unsigned char*)buffer;
3305
3306                 index = mod_base;
3307                 index += 8;
3308                 i = SB_ReadInt (&index);
3309                 if (i != MCBSPVERSION)
3310                         Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i)", mod->name, i, MCBSPVERSION);
3311
3312         // read hull info
3313                 hullinfo.numhulls = LittleLong(*(int*)index); index += 4;
3314                 hullinfo.filehulls = hullinfo.numhulls;
3315                 VectorClear (hullinfo.hullsizes[0][0]);
3316                 VectorClear (hullinfo.hullsizes[0][1]);
3317                 for (i = 1; i < hullinfo.numhulls; i++)
3318                 {
3319                         hullinfo.hullsizes[i][0][0] = SB_ReadFloat (&index);
3320                         hullinfo.hullsizes[i][0][1] = SB_ReadFloat (&index);
3321                         hullinfo.hullsizes[i][0][2] = SB_ReadFloat (&index);
3322                         hullinfo.hullsizes[i][1][0] = SB_ReadFloat (&index);
3323                         hullinfo.hullsizes[i][1][1] = SB_ReadFloat (&index);
3324                         hullinfo.hullsizes[i][1][2] = SB_ReadFloat (&index);
3325                 }
3326
3327         // read lumps
3328                 _header.version = 0;
3329                 for (i = 0; i < HEADER_LUMPS; i++)
3330                 {
3331                         _header.lumps[i].fileofs = SB_ReadInt (&index);
3332                         _header.lumps[i].filelen = SB_ReadInt (&index);
3333                 }
3334
3335                 header = &_header;
3336         }
3337         else
3338         {
3339                 header = (dheader_t *)buffer;
3340
3341                 i = LittleLong(header->version);
3342                 if (i != BSPVERSION && i != 30)
3343                         Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i(Quake) or 30(HalfLife)", mod->name, i, BSPVERSION);
3344                 mod->brush.ishlbsp = i == 30;
3345                 mod->brush.ismcbsp = false;