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