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