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