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