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