patch from div0 that enables printf format warnings in gcc
[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 = (info->model->surfmesh.data_element3i + 3 * surface->num_firsttriangle) + k * 3;
434                                 VectorCopy((info->model->surfmesh.data_vertex3f + tri[0] * 3), vert[0]);
435                                 VectorCopy((info->model->surfmesh.data_vertex3f + tri[1] * 3), vert[1]);
436                                 VectorCopy((info->model->surfmesh.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 | SUPERCONTENTS_BODY))
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         {
854
855                 double test[3];
856                 trace_t testtrace;
857                 VectorLerp(rhc.start, rhc.trace->fraction, rhc.end, test);
858                 memset(&testtrace, 0, sizeof(trace_t));
859                 rhc.trace = &testtrace;
860                 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
861                 rhc.trace->fraction = 1;
862                 rhc.trace->realfraction = 1;
863                 rhc.trace->allsolid = true;
864                 VectorCopy(test, rhc.start);
865                 VectorCopy(test, rhc.end);
866                 VectorClear(rhc.dist);
867                 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
868                 //Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, test, test);
869                 if (!trace->startsolid && testtrace.startsolid)
870                         Con_Printf(" - ended in solid!\n");
871         }
872         Con_Print("\n");
873 #else
874         if (VectorLength2(rhc.dist))
875                 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
876         else
877                 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
878 #endif
879 }
880
881 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)
882 {
883 #if 1
884         colbrushf_t cbox;
885         colplanef_t cbox_planes[6];
886         cbox.supercontents = boxsupercontents;
887         cbox.numplanes = 6;
888         cbox.numpoints = 0;
889         cbox.numtriangles = 0;
890         cbox.planes = cbox_planes;
891         cbox.points = NULL;
892         cbox.elements = NULL;
893         cbox.markframe = 0;
894         cbox.mins[0] = 0;
895         cbox.mins[1] = 0;
896         cbox.mins[2] = 0;
897         cbox.maxs[0] = 0;
898         cbox.maxs[1] = 0;
899         cbox.maxs[2] = 0;
900         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];
901         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];
902         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];
903         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];
904         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];
905         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];
906         cbox_planes[0].q3surfaceflags = boxq3surfaceflags;cbox_planes[0].texture = boxtexture;
907         cbox_planes[1].q3surfaceflags = boxq3surfaceflags;cbox_planes[1].texture = boxtexture;
908         cbox_planes[2].q3surfaceflags = boxq3surfaceflags;cbox_planes[2].texture = boxtexture;
909         cbox_planes[3].q3surfaceflags = boxq3surfaceflags;cbox_planes[3].texture = boxtexture;
910         cbox_planes[4].q3surfaceflags = boxq3surfaceflags;cbox_planes[4].texture = boxtexture;
911         cbox_planes[5].q3surfaceflags = boxq3surfaceflags;cbox_planes[5].texture = boxtexture;
912         memset(trace, 0, sizeof(trace_t));
913         trace->hitsupercontentsmask = hitsupercontentsmask;
914         trace->fraction = 1;
915         trace->realfraction = 1;
916         Collision_TraceLineBrushFloat(trace, start, end, &cbox, &cbox);
917 #else
918         RecursiveHullCheckTraceInfo_t rhc;
919         static hull_t box_hull;
920         static dclipnode_t box_clipnodes[6];
921         static mplane_t box_planes[6];
922         // fill in a default trace
923         memset(&rhc, 0, sizeof(rhc));
924         memset(trace, 0, sizeof(trace_t));
925         //To keep everything totally uniform, bounding boxes are turned into small
926         //BSP trees instead of being compared directly.
927         // create a temp hull from bounding box sizes
928         box_planes[0].dist = cmaxs[0] - mins[0];
929         box_planes[1].dist = cmins[0] - maxs[0];
930         box_planes[2].dist = cmaxs[1] - mins[1];
931         box_planes[3].dist = cmins[1] - maxs[1];
932         box_planes[4].dist = cmaxs[2] - mins[2];
933         box_planes[5].dist = cmins[2] - maxs[2];
934 #if COLLISIONPARANOID >= 3
935         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]);
936 #endif
937
938         if (box_hull.clipnodes == NULL)
939         {
940                 int i, side;
941
942                 //Set up the planes and clipnodes so that the six floats of a bounding box
943                 //can just be stored out and get a proper hull_t structure.
944
945                 box_hull.clipnodes = box_clipnodes;
946                 box_hull.planes = box_planes;
947                 box_hull.firstclipnode = 0;
948                 box_hull.lastclipnode = 5;
949
950                 for (i = 0;i < 6;i++)
951                 {
952                         box_clipnodes[i].planenum = i;
953
954                         side = i&1;
955
956                         box_clipnodes[i].children[side] = CONTENTS_EMPTY;
957                         if (i != 5)
958                                 box_clipnodes[i].children[side^1] = i + 1;
959                         else
960                                 box_clipnodes[i].children[side^1] = CONTENTS_SOLID;
961
962                         box_planes[i].type = i>>1;
963                         box_planes[i].normal[i>>1] = 1;
964                 }
965         }
966
967         // trace a line through the generated clipping hull
968         //rhc.boxsupercontents = boxsupercontents;
969         rhc.hull = &box_hull;
970         rhc.trace = trace;
971         rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
972         rhc.trace->fraction = 1;
973         rhc.trace->realfraction = 1;
974         rhc.trace->allsolid = true;
975         VectorCopy(start, rhc.start);
976         VectorCopy(end, rhc.end);
977         VectorSubtract(rhc.end, rhc.start, rhc.dist);
978         Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
979         //VectorMA(rhc.start, rhc.trace->fraction, rhc.dist, rhc.trace->endpos);
980         if (rhc.trace->startsupercontents)
981                 rhc.trace->startsupercontents = boxsupercontents;
982 #endif
983 }
984
985 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)
986 {
987         int side;
988         float front, back;
989         float mid, distz = endz - startz;
990
991 loc0:
992         if (!node->plane)
993                 return false;           // didn't hit anything
994
995         switch (node->plane->type)
996         {
997         case PLANE_X:
998                 node = node->children[x < node->plane->dist];
999                 goto loc0;
1000         case PLANE_Y:
1001                 node = node->children[y < node->plane->dist];
1002                 goto loc0;
1003         case PLANE_Z:
1004                 side = startz < node->plane->dist;
1005                 if ((endz < node->plane->dist) == side)
1006                 {
1007                         node = node->children[side];
1008                         goto loc0;
1009                 }
1010                 // found an intersection
1011                 mid = node->plane->dist;
1012                 break;
1013         default:
1014                 back = front = x * node->plane->normal[0] + y * node->plane->normal[1];
1015                 front += startz * node->plane->normal[2];
1016                 back += endz * node->plane->normal[2];
1017                 side = front < node->plane->dist;
1018                 if ((back < node->plane->dist) == side)
1019                 {
1020                         node = node->children[side];
1021                         goto loc0;
1022                 }
1023                 // found an intersection
1024                 mid = startz + distz * (front - node->plane->dist) / (front - back);
1025                 break;
1026         }
1027
1028         // go down front side
1029         if (node->children[side]->plane && Mod_Q1BSP_LightPoint_RecursiveBSPNode(model, ambientcolor, diffusecolor, diffusenormal, node->children[side], x, y, startz, mid))
1030                 return true;    // hit something
1031         else
1032         {
1033                 // check for impact on this node
1034                 if (node->numsurfaces)
1035                 {
1036                         int i, ds, dt;
1037                         msurface_t *surface;
1038
1039                         surface = model->data_surfaces + node->firstsurface;
1040                         for (i = 0;i < node->numsurfaces;i++, surface++)
1041                         {
1042                                 if (!(surface->texture->basematerialflags & MATERIALFLAG_WALL) || !surface->lightmapinfo->samples)
1043                                         continue;       // no lightmaps
1044
1045                                 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];
1046                                 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];
1047
1048                                 if (ds >= 0 && ds < surface->lightmapinfo->extents[0] && dt >= 0 && dt < surface->lightmapinfo->extents[1])
1049                                 {
1050                                         unsigned char *lightmap;
1051                                         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;
1052                                         lmwidth = ((surface->lightmapinfo->extents[0]>>4)+1);
1053                                         lmheight = ((surface->lightmapinfo->extents[1]>>4)+1);
1054                                         line3 = lmwidth * 3; // LordHavoc: *3 for colored lighting
1055                                         size3 = lmwidth * lmheight * 3; // LordHavoc: *3 for colored lighting
1056
1057                                         lightmap = surface->lightmapinfo->samples + ((dt>>4) * lmwidth + (ds>>4))*3; // LordHavoc: *3 for colored lighting
1058
1059                                         for (maps = 0;maps < MAXLIGHTMAPS && surface->lightmapinfo->styles[maps] != 255;maps++)
1060                                         {
1061                                                 scale = r_refdef.lightstylevalue[surface->lightmapinfo->styles[maps]];
1062                                                 r00 += lightmap[      0] * scale;g00 += lightmap[      1] * scale;b00 += lightmap[      2] * scale;
1063                                                 r01 += lightmap[      3] * scale;g01 += lightmap[      4] * scale;b01 += lightmap[      5] * scale;
1064                                                 r10 += lightmap[line3+0] * scale;g10 += lightmap[line3+1] * scale;b10 += lightmap[line3+2] * scale;
1065                                                 r11 += lightmap[line3+3] * scale;g11 += lightmap[line3+4] * scale;b11 += lightmap[line3+5] * scale;
1066                                                 lightmap += size3;
1067                                         }
1068
1069 /*
1070 LordHavoc: here's the readable version of the interpolation
1071 code, not quite as easy for the compiler to optimize...
1072
1073 dsfrac is the X position in the lightmap pixel, * 16
1074 dtfrac is the Y position in the lightmap pixel, * 16
1075 r00 is top left corner, r01 is top right corner
1076 r10 is bottom left corner, r11 is bottom right corner
1077 g and b are the same layout.
1078 r0 and r1 are the top and bottom intermediate results
1079
1080 first we interpolate the top two points, to get the top
1081 edge sample
1082
1083         r0 = (((r01-r00) * dsfrac) >> 4) + r00;
1084         g0 = (((g01-g00) * dsfrac) >> 4) + g00;
1085         b0 = (((b01-b00) * dsfrac) >> 4) + b00;
1086
1087 then we interpolate the bottom two points, to get the
1088 bottom edge sample
1089
1090         r1 = (((r11-r10) * dsfrac) >> 4) + r10;
1091         g1 = (((g11-g10) * dsfrac) >> 4) + g10;
1092         b1 = (((b11-b10) * dsfrac) >> 4) + b10;
1093
1094 then we interpolate the top and bottom samples to get the
1095 middle sample (the one which was requested)
1096
1097         r = (((r1-r0) * dtfrac) >> 4) + r0;
1098         g = (((g1-g0) * dtfrac) >> 4) + g0;
1099         b = (((b1-b0) * dtfrac) >> 4) + b0;
1100 */
1101
1102                                         ambientcolor[0] += (float) ((((((((r11-r10) * dsfrac) >> 4) + r10)-((((r01-r00) * dsfrac) >> 4) + r00)) * dtfrac) >> 4) + ((((r01-r00) * dsfrac) >> 4) + r00)) * (1.0f / 32768.0f);
1103                                         ambientcolor[1] += (float) ((((((((g11-g10) * dsfrac) >> 4) + g10)-((((g01-g00) * dsfrac) >> 4) + g00)) * dtfrac) >> 4) + ((((g01-g00) * dsfrac) >> 4) + g00)) * (1.0f / 32768.0f);
1104                                         ambientcolor[2] += (float) ((((((((b11-b10) * dsfrac) >> 4) + b10)-((((b01-b00) * dsfrac) >> 4) + b00)) * dtfrac) >> 4) + ((((b01-b00) * dsfrac) >> 4) + b00)) * (1.0f / 32768.0f);
1105                                         return true; // success
1106                                 }
1107                         }
1108                 }
1109
1110                 // go down back side
1111                 node = node->children[side ^ 1];
1112                 startz = mid;
1113                 distz = endz - startz;
1114                 goto loc0;
1115         }
1116 }
1117
1118 void Mod_Q1BSP_LightPoint(model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
1119 {
1120         Mod_Q1BSP_LightPoint_RecursiveBSPNode(model, ambientcolor, diffusecolor, diffusenormal, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode, p[0], p[1], p[2] + 0.125, p[2] - 65536);
1121         // pretend lighting is coming down from above (due to lack of a lightgrid to know primary lighting direction)
1122         VectorSet(diffusenormal, 0, 0, 1);
1123 }
1124
1125 static void Mod_Q1BSP_DecompressVis(const unsigned char *in, const unsigned char *inend, unsigned char *out, unsigned char *outend)
1126 {
1127         int c;
1128         unsigned char *outstart = out;
1129         while (out < outend)
1130         {
1131                 if (in == inend)
1132                 {
1133                         Con_Printf("Mod_Q1BSP_DecompressVis: input underrun on model \"%s\" (decompressed %i of %i output bytes)\n", loadmodel->name, (int)(out - outstart), (int)(outend - outstart));
1134                         return;
1135                 }
1136                 c = *in++;
1137                 if (c)
1138                         *out++ = c;
1139                 else
1140                 {
1141                         if (in == inend)
1142                         {
1143                                 Con_Printf("Mod_Q1BSP_DecompressVis: input underrun (during zero-run) on model \"%s\" (decompressed %i of %i output bytes)\n", loadmodel->name, (int)(out - outstart), (int)(outend - outstart));
1144                                 return;
1145                         }
1146                         for (c = *in++;c > 0;c--)
1147                         {
1148                                 if (out == outend)
1149                                 {
1150                                         Con_Printf("Mod_Q1BSP_DecompressVis: output overrun on model \"%s\" (decompressed %i of %i output bytes)\n", loadmodel->name, (int)(out - outstart), (int)(outend - outstart));
1151                                         return;
1152                                 }
1153                                 *out++ = 0;
1154                         }
1155                 }
1156         }
1157 }
1158
1159 /*
1160 =============
1161 R_Q1BSP_LoadSplitSky
1162
1163 A sky texture is 256*128, with the right side being a masked overlay
1164 ==============
1165 */
1166 void R_Q1BSP_LoadSplitSky (unsigned char *src, int width, int height, int bytesperpixel)
1167 {
1168         int i, j;
1169         unsigned solidpixels[128*128], alphapixels[128*128];
1170
1171         // if sky isn't the right size, just use it as a solid layer
1172         if (width != 256 || height != 128)
1173         {
1174                 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);
1175                 loadmodel->brush.alphaskytexture = NULL;
1176                 return;
1177         }
1178
1179         if (bytesperpixel == 4)
1180         {
1181                 for (i = 0;i < 128;i++)
1182                 {
1183                         for (j = 0;j < 128;j++)
1184                         {
1185                                 solidpixels[(i*128) + j] = ((unsigned *)src)[i*256+j+128];
1186                                 alphapixels[(i*128) + j] = ((unsigned *)src)[i*256+j];
1187                         }
1188                 }
1189         }
1190         else
1191         {
1192                 // make an average value for the back to avoid
1193                 // a fringe on the top level
1194                 int p, r, g, b;
1195                 union
1196                 {
1197                         unsigned int i;
1198                         unsigned char b[4];
1199                 }
1200                 rgba;
1201                 r = g = b = 0;
1202                 for (i = 0;i < 128;i++)
1203                 {
1204                         for (j = 0;j < 128;j++)
1205                         {
1206                                 rgba.i = palette_complete[src[i*256 + j + 128]];
1207                                 r += rgba.b[0];
1208                                 g += rgba.b[1];
1209                                 b += rgba.b[2];
1210                         }
1211                 }
1212                 rgba.b[0] = r/(128*128);
1213                 rgba.b[1] = g/(128*128);
1214                 rgba.b[2] = b/(128*128);
1215                 rgba.b[3] = 0;
1216                 for (i = 0;i < 128;i++)
1217                 {
1218                         for (j = 0;j < 128;j++)
1219                         {
1220                                 solidpixels[(i*128) + j] = palette_complete[src[i*256 + j + 128]];
1221                                 alphapixels[(i*128) + j] = (p = src[i*256 + j]) ? palette_complete[p] : rgba.i;
1222                         }
1223                 }
1224         }
1225
1226         loadmodel->brush.solidskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_solidtexture", 128, 128, (unsigned char *) solidpixels, TEXTYPE_RGBA, TEXF_PRECACHE, NULL);
1227         loadmodel->brush.alphaskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_alphatexture", 128, 128, (unsigned char *) alphapixels, TEXTYPE_RGBA, TEXF_ALPHA | TEXF_PRECACHE, NULL);
1228 }
1229
1230 static void Mod_Q1BSP_LoadTextures(lump_t *l)
1231 {
1232         int i, j, k, num, max, altmax, mtwidth, mtheight, *dofs, incomplete;
1233         miptex_t *dmiptex;
1234         texture_t *tx, *tx2, *anims[10], *altanims[10];
1235         dmiptexlump_t *m;
1236         unsigned char *data, *mtdata;
1237         const char *s;
1238         char mapname[MAX_QPATH], name[MAX_QPATH];
1239
1240         loadmodel->data_textures = NULL;
1241
1242         // add two slots for notexture walls and notexture liquids
1243         if (l->filelen)
1244         {
1245                 m = (dmiptexlump_t *)(mod_base + l->fileofs);
1246                 m->nummiptex = LittleLong (m->nummiptex);
1247                 loadmodel->num_textures = m->nummiptex + 2;
1248         }
1249         else
1250         {
1251                 m = NULL;
1252                 loadmodel->num_textures = 2;
1253         }
1254
1255         loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_textures * sizeof(texture_t));
1256
1257         // fill out all slots with notexture
1258         for (i = 0, tx = loadmodel->data_textures;i < loadmodel->num_textures;i++, tx++)
1259         {
1260                 strlcpy(tx->name, "NO TEXTURE FOUND", sizeof(tx->name));
1261                 tx->width = 16;
1262                 tx->height = 16;
1263                 tx->numskinframes = 1;
1264                 tx->skinframerate = 1;
1265                 tx->currentskinframe = tx->skinframes;
1266                 tx->skinframes[0].base = r_texture_notexture;
1267                 tx->basematerialflags = 0;
1268                 if (i == loadmodel->num_textures - 1)
1269                 {
1270                         tx->basematerialflags |= MATERIALFLAG_WATER | MATERIALFLAG_LIGHTBOTHSIDES;
1271                         tx->supercontents = mod_q1bsp_texture_water.supercontents;
1272                         tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1273                 }
1274                 else
1275                 {
1276                         tx->basematerialflags |= MATERIALFLAG_WALL;
1277                         tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1278                         tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1279                 }
1280                 tx->currentframe = tx;
1281         }
1282
1283         if (!m)
1284                 return;
1285
1286         s = loadmodel->name;
1287         if (!strncasecmp(s, "maps/", 5))
1288                 s += 5;
1289         FS_StripExtension(s, mapname, sizeof(mapname));
1290
1291         // just to work around bounds checking when debugging with it (array index out of bounds error thing)
1292         dofs = m->dataofs;
1293         // LordHavoc: mostly rewritten map texture loader
1294         for (i = 0;i < m->nummiptex;i++)
1295         {
1296                 dofs[i] = LittleLong(dofs[i]);
1297                 if (dofs[i] == -1 || r_nosurftextures.integer)
1298                         continue;
1299                 dmiptex = (miptex_t *)((unsigned char *)m + dofs[i]);
1300
1301                 // make sure name is no more than 15 characters
1302                 for (j = 0;dmiptex->name[j] && j < 15;j++)
1303                         name[j] = dmiptex->name[j];
1304                 name[j] = 0;
1305
1306                 mtwidth = LittleLong(dmiptex->width);
1307                 mtheight = LittleLong(dmiptex->height);
1308                 mtdata = NULL;
1309                 j = LittleLong(dmiptex->offsets[0]);
1310                 if (j)
1311                 {
1312                         // texture included
1313                         if (j < 40 || j + mtwidth * mtheight > l->filelen)
1314                         {
1315                                 Con_Printf("Texture \"%s\" in \"%s\"is corrupt or incomplete\n", dmiptex->name, loadmodel->name);
1316                                 continue;
1317                         }
1318                         mtdata = (unsigned char *)dmiptex + j;
1319                 }
1320
1321                 if ((mtwidth & 15) || (mtheight & 15))
1322                         Con_Printf("warning: texture \"%s\" in \"%s\" is not 16 aligned\n", dmiptex->name, loadmodel->name);
1323
1324                 // LordHavoc: force all names to lowercase
1325                 for (j = 0;name[j];j++)
1326                         if (name[j] >= 'A' && name[j] <= 'Z')
1327                                 name[j] += 'a' - 'A';
1328
1329                 tx = loadmodel->data_textures + i;
1330                 strlcpy(tx->name, name, sizeof(tx->name));
1331                 tx->width = mtwidth;
1332                 tx->height = mtheight;
1333
1334                 if (!tx->name[0])
1335                 {
1336                         sprintf(tx->name, "unnamed%i", i);
1337                         Con_Printf("warning: unnamed texture in %s, renaming to %s\n", loadmodel->name, tx->name);
1338                 }
1339
1340                 if (cls.state != ca_dedicated)
1341                 {
1342                         // LordHavoc: HL sky textures are entirely different than quake
1343                         if (!loadmodel->brush.ishlbsp && !strncmp(tx->name, "sky", 3) && mtwidth == 256 && mtheight == 128)
1344                         {
1345                                 if (loadmodel->isworldmodel)
1346                                 {
1347                                         data = loadimagepixels(tx->name, false, 0, 0);
1348                                         if (data)
1349                                         {
1350                                                 R_Q1BSP_LoadSplitSky(data, image_width, image_height, 4);
1351                                                 Mem_Free(data);
1352                                         }
1353                                         else if (mtdata != NULL)
1354                                                 R_Q1BSP_LoadSplitSky(mtdata, mtwidth, mtheight, 1);
1355                                 }
1356                         }
1357                         else
1358                         {
1359                                 if (!Mod_LoadSkinFrame(&tx->skinframes[0], gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s/%s", mapname, tx->name), TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE | TEXF_PICMIP, false, true)
1360                                  && !Mod_LoadSkinFrame(&tx->skinframes[0], gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s", tx->name), TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE | TEXF_PICMIP, false, true))
1361                                 {
1362                                         // did not find external texture, load it from the bsp or wad3
1363                                         if (loadmodel->brush.ishlbsp)
1364                                         {
1365                                                 // internal texture overrides wad
1366                                                 unsigned char *pixels, *freepixels;
1367                                                 pixels = freepixels = NULL;
1368                                                 if (mtdata)
1369                                                         pixels = W_ConvertWAD3Texture(dmiptex);
1370                                                 if (pixels == NULL)
1371                                                         pixels = freepixels = W_GetTexture(tx->name);
1372                                                 if (pixels != NULL)
1373                                                 {
1374                                                         tx->width = image_width;
1375                                                         tx->height = image_height;
1376                                                         Mod_LoadSkinFrame_Internal(&tx->skinframes[0], tx->name, TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE | TEXF_PICMIP, false, false, pixels, image_width, image_height, 32, NULL, NULL);
1377                                                 }
1378                                                 if (freepixels)
1379                                                         Mem_Free(freepixels);
1380                                         }
1381                                         else if (mtdata) // texture included
1382                                                 Mod_LoadSkinFrame_Internal(&tx->skinframes[0], tx->name, TEXF_MIPMAP | TEXF_PRECACHE | TEXF_PICMIP, false, r_fullbrights.integer, mtdata, tx->width, tx->height, 8, NULL, NULL);
1383                                 }
1384                         }
1385                         if (tx->skinframes[0].base == NULL)
1386                         {
1387                                 // no texture found
1388                                 tx->width = 16;
1389                                 tx->height = 16;
1390                                 tx->skinframes[0].base = r_texture_notexture;
1391                         }
1392                 }
1393
1394                 tx->basematerialflags = 0;
1395                 if (tx->name[0] == '*')
1396                 {
1397                         // LordHavoc: some turbulent textures should not be affected by wateralpha
1398                         if (strncmp(tx->name,"*lava",5)
1399                          && strncmp(tx->name,"*teleport",9)
1400                          && strncmp(tx->name,"*rift",5)) // Scourge of Armagon texture
1401                                 tx->basematerialflags |= MATERIALFLAG_WATERALPHA;
1402                         if (!strncmp(tx->name, "*lava", 5))
1403                         {
1404                                 tx->supercontents = mod_q1bsp_texture_lava.supercontents;
1405                                 tx->surfaceflags = mod_q1bsp_texture_lava.surfaceflags;
1406                         }
1407                         else if (!strncmp(tx->name, "*slime", 6))
1408                         {
1409                                 tx->supercontents = mod_q1bsp_texture_slime.supercontents;
1410                                 tx->surfaceflags = mod_q1bsp_texture_slime.surfaceflags;
1411                         }
1412                         else
1413                         {
1414                                 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1415                                 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1416                         }
1417                         tx->basematerialflags |= MATERIALFLAG_WATER | MATERIALFLAG_LIGHTBOTHSIDES;
1418                 }
1419                 else if (tx->name[0] == 's' && tx->name[1] == 'k' && tx->name[2] == 'y')
1420                 {
1421                         tx->supercontents = mod_q1bsp_texture_sky.supercontents;
1422                         tx->surfaceflags = mod_q1bsp_texture_sky.surfaceflags;
1423                         tx->basematerialflags |= MATERIALFLAG_SKY;
1424                 }
1425                 else
1426                 {
1427                         tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1428                         tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1429                         tx->basematerialflags |= MATERIALFLAG_WALL;
1430                 }
1431                 if (tx->skinframes[0].fog)
1432                         tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_TRANSPARENT;
1433
1434                 // start out with no animation
1435                 tx->currentframe = tx;
1436         }
1437
1438         // sequence the animations
1439         for (i = 0;i < m->nummiptex;i++)
1440         {
1441                 tx = loadmodel->data_textures + i;
1442                 if (!tx || tx->name[0] != '+' || tx->name[1] == 0 || tx->name[2] == 0)
1443                         continue;
1444                 if (tx->anim_total[0] || tx->anim_total[1])
1445                         continue;       // already sequenced
1446
1447                 // find the number of frames in the animation
1448                 memset(anims, 0, sizeof(anims));
1449                 memset(altanims, 0, sizeof(altanims));
1450
1451                 for (j = i;j < m->nummiptex;j++)
1452                 {
1453                         tx2 = loadmodel->data_textures + j;
1454                         if (!tx2 || tx2->name[0] != '+' || strcmp(tx2->name+2, tx->name+2))
1455                                 continue;
1456
1457                         num = tx2->name[1];
1458                         if (num >= '0' && num <= '9')
1459                                 anims[num - '0'] = tx2;
1460                         else if (num >= 'a' && num <= 'j')
1461                                 altanims[num - 'a'] = tx2;
1462                         else
1463                                 Con_Printf("Bad animating texture %s\n", tx->name);
1464                 }
1465
1466                 max = altmax = 0;
1467                 for (j = 0;j < 10;j++)
1468                 {
1469                         if (anims[j])
1470                                 max = j + 1;
1471                         if (altanims[j])
1472                                 altmax = j + 1;
1473                 }
1474                 //Con_Printf("linking animation %s (%i:%i frames)\n\n", tx->name, max, altmax);
1475
1476                 incomplete = false;
1477                 for (j = 0;j < max;j++)
1478                 {
1479                         if (!anims[j])
1480                         {
1481                                 Con_Printf("Missing frame %i of %s\n", j, tx->name);
1482                                 incomplete = true;
1483                         }
1484                 }
1485                 for (j = 0;j < altmax;j++)
1486                 {
1487                         if (!altanims[j])
1488                         {
1489                                 Con_Printf("Missing altframe %i of %s\n", j, tx->name);
1490                                 incomplete = true;
1491                         }
1492                 }
1493                 if (incomplete)
1494                         continue;
1495
1496                 if (altmax < 1)
1497                 {
1498                         // if there is no alternate animation, duplicate the primary
1499                         // animation into the alternate
1500                         altmax = max;
1501                         for (k = 0;k < 10;k++)
1502                                 altanims[k] = anims[k];
1503                 }
1504
1505                 // link together the primary animation
1506                 for (j = 0;j < max;j++)
1507                 {
1508                         tx2 = anims[j];
1509                         tx2->animated = true;
1510                         tx2->anim_total[0] = max;
1511                         tx2->anim_total[1] = altmax;
1512                         for (k = 0;k < 10;k++)
1513                         {
1514                                 tx2->anim_frames[0][k] = anims[k];
1515                                 tx2->anim_frames[1][k] = altanims[k];
1516                         }
1517                 }
1518
1519                 // if there really is an alternate anim...
1520                 if (anims[0] != altanims[0])
1521                 {
1522                         // link together the alternate animation
1523                         for (j = 0;j < altmax;j++)
1524                         {
1525                                 tx2 = altanims[j];
1526                                 tx2->animated = true;
1527                                 // the primary/alternate are reversed here
1528                                 tx2->anim_total[0] = altmax;
1529                                 tx2->anim_total[1] = max;
1530                                 for (k = 0;k < 10;k++)
1531                                 {
1532                                         tx2->anim_frames[0][k] = altanims[k];
1533                                         tx2->anim_frames[1][k] = anims[k];
1534                                 }
1535                         }
1536                 }
1537         }
1538 }
1539
1540 static void Mod_Q1BSP_LoadLighting(lump_t *l)
1541 {
1542         int i;
1543         unsigned char *in, *out, *data, d;
1544         char litfilename[MAX_QPATH];
1545         char dlitfilename[MAX_QPATH];
1546         fs_offset_t filesize;
1547         if (loadmodel->brush.ishlbsp) // LordHavoc: load the colored lighting data straight
1548         {
1549                 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1550                 for (i=0; i<l->filelen; i++)
1551                         loadmodel->brushq1.lightdata[i] = mod_base[l->fileofs+i] >>= 1;
1552         }
1553         else if (loadmodel->brush.ismcbsp)
1554         {
1555                 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1556                 memcpy(loadmodel->brushq1.lightdata, mod_base + l->fileofs, l->filelen);
1557         }
1558         else // LordHavoc: bsp version 29 (normal white lighting)
1559         {
1560                 // LordHavoc: hope is not lost yet, check for a .lit file to load
1561                 strlcpy (litfilename, loadmodel->name, sizeof (litfilename));
1562                 FS_StripExtension (litfilename, litfilename, sizeof (litfilename));
1563                 strlcpy (dlitfilename, litfilename, sizeof (dlitfilename));
1564                 strlcat (litfilename, ".lit", sizeof (litfilename));
1565                 strlcat (dlitfilename, ".dlit", sizeof (dlitfilename));
1566                 data = (unsigned char*) FS_LoadFile(litfilename, tempmempool, false, &filesize);
1567                 if (data)
1568                 {
1569                         if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1570                         {
1571                                 i = LittleLong(((int *)data)[1]);
1572                                 if (i == 1)
1573                                 {
1574                                         Con_DPrintf("loaded %s\n", litfilename);
1575                                         loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1576                                         memcpy(loadmodel->brushq1.lightdata, data + 8, filesize - 8);
1577                                         Mem_Free(data);
1578                                         data = (unsigned char*) FS_LoadFile(dlitfilename, tempmempool, false, &filesize);
1579                                         if (data)
1580                                         {
1581                                                 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1582                                                 {
1583                                                         i = LittleLong(((int *)data)[1]);
1584                                                         if (i == 1)
1585                                                         {
1586                                                                 Con_DPrintf("loaded %s\n", dlitfilename);
1587                                                                 loadmodel->brushq1.nmaplightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1588                                                                 memcpy(loadmodel->brushq1.nmaplightdata, data + 8, filesize - 8);
1589                                                                 loadmodel->brushq3.deluxemapping_modelspace = false;
1590                                                                 loadmodel->brushq3.deluxemapping = true;
1591                                                         }
1592                                                 }
1593                                                 Mem_Free(data);
1594                                                 data = NULL;
1595                                         }
1596                                         return;
1597                                 }
1598                                 else
1599                                         Con_Printf("Unknown .lit file version (%d)\n", i);
1600                         }
1601                         else if (filesize == 8)
1602                                 Con_Print("Empty .lit file, ignoring\n");
1603                         else
1604                                 Con_Printf("Corrupt .lit file (file size %i bytes, should be %i bytes), ignoring\n", (int) filesize, (int) (8 + l->filelen * 3));
1605                         if (data)
1606                         {
1607                                 Mem_Free(data);
1608                                 data = NULL;
1609                         }
1610                 }
1611                 // LordHavoc: oh well, expand the white lighting data
1612                 if (!l->filelen)
1613                         return;
1614                 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen*3);
1615                 in = mod_base + l->fileofs;
1616                 out = loadmodel->brushq1.lightdata;
1617                 for (i = 0;i < l->filelen;i++)
1618                 {
1619                         d = *in++;
1620                         *out++ = d;
1621                         *out++ = d;
1622                         *out++ = d;
1623                 }
1624         }
1625 }
1626
1627 static void Mod_Q1BSP_LoadVisibility(lump_t *l)
1628 {
1629         loadmodel->brushq1.num_compressedpvs = 0;
1630         loadmodel->brushq1.data_compressedpvs = NULL;
1631         if (!l->filelen)
1632                 return;
1633         loadmodel->brushq1.num_compressedpvs = l->filelen;
1634         loadmodel->brushq1.data_compressedpvs = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1635         memcpy(loadmodel->brushq1.data_compressedpvs, mod_base + l->fileofs, l->filelen);
1636 }
1637
1638 // used only for HalfLife maps
1639 static void Mod_Q1BSP_ParseWadsFromEntityLump(const char *data)
1640 {
1641         char key[128], value[4096];
1642         char wadname[128];
1643         int i, j, k;
1644         if (!data)
1645                 return;
1646         if (!COM_ParseTokenConsole(&data))
1647                 return; // error
1648         if (com_token[0] != '{')
1649                 return; // error
1650         while (1)
1651         {
1652                 if (!COM_ParseTokenConsole(&data))
1653                         return; // error
1654                 if (com_token[0] == '}')
1655                         break; // end of worldspawn
1656                 if (com_token[0] == '_')
1657                         strlcpy(key, com_token + 1, sizeof(key));
1658                 else
1659                         strlcpy(key, com_token, sizeof(key));
1660                 while (key[strlen(key)-1] == ' ') // remove trailing spaces
1661                         key[strlen(key)-1] = 0;
1662                 if (!COM_ParseTokenConsole(&data))
1663                         return; // error
1664                 dpsnprintf(value, sizeof(value), "%s", com_token);
1665                 if (!strcmp("wad", key)) // for HalfLife maps
1666                 {
1667                         if (loadmodel->brush.ishlbsp)
1668                         {
1669                                 j = 0;
1670                                 for (i = 0;i < (int)sizeof(value);i++)
1671                                         if (value[i] != ';' && value[i] != '\\' && value[i] != '/' && value[i] != ':')
1672                                                 break;
1673                                 if (value[i])
1674                                 {
1675                                         for (;i < (int)sizeof(value);i++)
1676                                         {
1677                                                 // ignore path - the \\ check is for HalfLife... stupid windoze 'programmers'...
1678                                                 if (value[i] == '\\' || value[i] == '/' || value[i] == ':')
1679                                                         j = i+1;
1680                                                 else if (value[i] == ';' || value[i] == 0)
1681                                                 {
1682                                                         k = value[i];
1683                                                         value[i] = 0;
1684                                                         strlcpy(wadname, "textures/", sizeof(wadname));
1685                                                         strlcat(wadname, &value[j], sizeof(wadname));
1686                                                         W_LoadTextureWadFile(wadname, false);
1687                                                         j = i+1;
1688                                                         if (!k)
1689                                                                 break;
1690                                                 }
1691                                         }
1692                                 }
1693                         }
1694                 }
1695         }
1696 }
1697
1698 static void Mod_Q1BSP_LoadEntities(lump_t *l)
1699 {
1700         loadmodel->brush.entities = NULL;
1701         if (!l->filelen)
1702                 return;
1703         loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1704         memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
1705         if (loadmodel->brush.ishlbsp)
1706                 Mod_Q1BSP_ParseWadsFromEntityLump(loadmodel->brush.entities);
1707 }
1708
1709
1710 static void Mod_Q1BSP_LoadVertexes(lump_t *l)
1711 {
1712         dvertex_t       *in;
1713         mvertex_t       *out;
1714         int                     i, count;
1715
1716         in = (dvertex_t *)(mod_base + l->fileofs);
1717         if (l->filelen % sizeof(*in))
1718                 Host_Error("Mod_Q1BSP_LoadVertexes: funny lump size in %s",loadmodel->name);
1719         count = l->filelen / sizeof(*in);
1720         out = (mvertex_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
1721
1722         loadmodel->brushq1.vertexes = out;
1723         loadmodel->brushq1.numvertexes = count;
1724
1725         for ( i=0 ; i<count ; i++, in++, out++)
1726         {
1727                 out->position[0] = LittleFloat(in->point[0]);
1728                 out->position[1] = LittleFloat(in->point[1]);
1729                 out->position[2] = LittleFloat(in->point[2]);
1730         }
1731 }
1732
1733 // The following two functions should be removed and MSG_* or SZ_* function sets adjusted so they
1734 // can be used for this
1735 // REMOVEME
1736 int SB_ReadInt (unsigned char **buffer)
1737 {
1738         int     i;
1739         i = ((*buffer)[0]) + 256*((*buffer)[1]) + 65536*((*buffer)[2]) + 16777216*((*buffer)[3]);
1740         (*buffer) += 4;
1741         return i;
1742 }
1743
1744 // REMOVEME
1745 float SB_ReadFloat (unsigned char **buffer)
1746 {
1747         union
1748         {
1749                 int             i;
1750                 float   f;
1751         } u;
1752
1753         u.i = SB_ReadInt (buffer);
1754         return u.f;
1755 }
1756
1757 static void Mod_Q1BSP_LoadSubmodels(lump_t *l, hullinfo_t *hullinfo)
1758 {
1759         unsigned char           *index;
1760         dmodel_t        *out;
1761         int                     i, j, count;
1762
1763         index = (unsigned char *)(mod_base + l->fileofs);
1764         if (l->filelen % (48+4*hullinfo->filehulls))
1765                 Host_Error ("Mod_Q1BSP_LoadSubmodels: funny lump size in %s", loadmodel->name);
1766
1767         count = l->filelen / (48+4*hullinfo->filehulls);
1768         out = (dmodel_t *)Mem_Alloc (loadmodel->mempool, count*sizeof(*out));
1769
1770         loadmodel->brushq1.submodels = out;
1771         loadmodel->brush.numsubmodels = count;
1772
1773         for (i = 0; i < count; i++, out++)
1774         {
1775         // spread out the mins / maxs by a pixel
1776                 out->mins[0] = SB_ReadFloat (&index) - 1;
1777                 out->mins[1] = SB_ReadFloat (&index) - 1;
1778                 out->mins[2] = SB_ReadFloat (&index) - 1;
1779                 out->maxs[0] = SB_ReadFloat (&index) + 1;
1780                 out->maxs[1] = SB_ReadFloat (&index) + 1;
1781                 out->maxs[2] = SB_ReadFloat (&index) + 1;
1782                 out->origin[0] = SB_ReadFloat (&index);
1783                 out->origin[1] = SB_ReadFloat (&index);
1784                 out->origin[2] = SB_ReadFloat (&index);
1785                 for (j = 0; j < hullinfo->filehulls; j++)
1786                         out->headnode[j] = SB_ReadInt (&index);
1787                 out->visleafs = SB_ReadInt (&index);
1788                 out->firstface = SB_ReadInt (&index);
1789                 out->numfaces = SB_ReadInt (&index);
1790         }
1791 }
1792
1793 static void Mod_Q1BSP_LoadEdges(lump_t *l)
1794 {
1795         dedge_t *in;
1796         medge_t *out;
1797         int     i, count;
1798
1799         in = (dedge_t *)(mod_base + l->fileofs);
1800         if (l->filelen % sizeof(*in))
1801                 Host_Error("Mod_Q1BSP_LoadEdges: funny lump size in %s",loadmodel->name);
1802         count = l->filelen / sizeof(*in);
1803         out = (medge_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1804
1805         loadmodel->brushq1.edges = out;
1806         loadmodel->brushq1.numedges = count;
1807
1808         for ( i=0 ; i<count ; i++, in++, out++)
1809         {
1810                 out->v[0] = (unsigned short)LittleShort(in->v[0]);
1811                 out->v[1] = (unsigned short)LittleShort(in->v[1]);
1812                 if (out->v[0] >= loadmodel->brushq1.numvertexes || out->v[1] >= loadmodel->brushq1.numvertexes)
1813                 {
1814                         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);
1815                         out->v[0] = 0;
1816                         out->v[1] = 0;
1817                 }
1818         }
1819 }
1820
1821 static void Mod_Q1BSP_LoadTexinfo(lump_t *l)
1822 {
1823         texinfo_t *in;
1824         mtexinfo_t *out;
1825         int i, j, k, count, miptex;
1826
1827         in = (texinfo_t *)(mod_base + l->fileofs);
1828         if (l->filelen % sizeof(*in))
1829                 Host_Error("Mod_Q1BSP_LoadTexinfo: funny lump size in %s",loadmodel->name);
1830         count = l->filelen / sizeof(*in);
1831         out = (mtexinfo_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1832
1833         loadmodel->brushq1.texinfo = out;
1834         loadmodel->brushq1.numtexinfo = count;
1835
1836         for (i = 0;i < count;i++, in++, out++)
1837         {
1838                 for (k = 0;k < 2;k++)
1839                         for (j = 0;j < 4;j++)
1840                                 out->vecs[k][j] = LittleFloat(in->vecs[k][j]);
1841
1842                 miptex = LittleLong(in->miptex);
1843                 out->flags = LittleLong(in->flags);
1844
1845                 out->texture = NULL;
1846                 if (loadmodel->data_textures)
1847                 {
1848                         if ((unsigned int) miptex >= (unsigned int) loadmodel->num_textures)
1849                                 Con_Printf("error in model \"%s\": invalid miptex index %i(of %i)\n", loadmodel->name, miptex, loadmodel->num_textures);
1850                         else
1851                                 out->texture = loadmodel->data_textures + miptex;
1852                 }
1853                 if (out->flags & TEX_SPECIAL)
1854                 {
1855                         // if texture chosen is NULL or the shader needs a lightmap,
1856                         // force to notexture water shader
1857                         if (out->texture == NULL || out->texture->basematerialflags & MATERIALFLAG_WALL)
1858                                 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 1);
1859                 }
1860                 else
1861                 {
1862                         // if texture chosen is NULL, force to notexture
1863                         if (out->texture == NULL)
1864                                 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 2);
1865                 }
1866         }
1867 }
1868
1869 #if 0
1870 void BoundPoly(int numverts, float *verts, vec3_t mins, vec3_t maxs)
1871 {
1872         int             i, j;
1873         float   *v;
1874
1875         mins[0] = mins[1] = mins[2] = 9999;
1876         maxs[0] = maxs[1] = maxs[2] = -9999;
1877         v = verts;
1878         for (i = 0;i < numverts;i++)
1879         {
1880                 for (j = 0;j < 3;j++, v++)
1881                 {
1882                         if (*v < mins[j])
1883                                 mins[j] = *v;
1884                         if (*v > maxs[j])
1885                                 maxs[j] = *v;
1886                 }
1887         }
1888 }
1889
1890 #define MAX_SUBDIVPOLYTRIANGLES 4096
1891 #define MAX_SUBDIVPOLYVERTS(MAX_SUBDIVPOLYTRIANGLES * 3)
1892
1893 static int subdivpolyverts, subdivpolytriangles;
1894 static int subdivpolyindex[MAX_SUBDIVPOLYTRIANGLES][3];
1895 static float subdivpolyvert[MAX_SUBDIVPOLYVERTS][3];
1896
1897 static int subdivpolylookupvert(vec3_t v)
1898 {
1899         int i;
1900         for (i = 0;i < subdivpolyverts;i++)
1901                 if (subdivpolyvert[i][0] == v[0]
1902                  && subdivpolyvert[i][1] == v[1]
1903                  && subdivpolyvert[i][2] == v[2])
1904                         return i;
1905         if (subdivpolyverts >= MAX_SUBDIVPOLYVERTS)
1906                 Host_Error("SubDividePolygon: ran out of vertices in buffer, please increase your r_subdivide_size");
1907         VectorCopy(v, subdivpolyvert[subdivpolyverts]);
1908         return subdivpolyverts++;
1909 }
1910
1911 static void SubdividePolygon(int numverts, float *verts)
1912 {
1913         int             i, i1, i2, i3, f, b, c, p;
1914         vec3_t  mins, maxs, front[256], back[256];
1915         float   m, *pv, *cv, dist[256], frac;
1916
1917         if (numverts > 250)
1918                 Host_Error("SubdividePolygon: ran out of verts in buffer");
1919
1920         BoundPoly(numverts, verts, mins, maxs);
1921
1922         for (i = 0;i < 3;i++)
1923         {
1924                 m = (mins[i] + maxs[i]) * 0.5;
1925                 m = r_subdivide_size.value * floor(m/r_subdivide_size.value + 0.5);
1926                 if (maxs[i] - m < 8)
1927                         continue;
1928                 if (m - mins[i] < 8)
1929                         continue;
1930
1931                 // cut it
1932                 for (cv = verts, c = 0;c < numverts;c++, cv += 3)
1933                         dist[c] = cv[i] - m;
1934
1935                 f = b = 0;
1936                 for (p = numverts - 1, c = 0, pv = verts + p * 3, cv = verts;c < numverts;p = c, c++, pv = cv, cv += 3)
1937                 {
1938                         if (dist[p] >= 0)
1939                         {
1940                                 VectorCopy(pv, front[f]);
1941                                 f++;
1942                         }
1943                         if (dist[p] <= 0)
1944                         {
1945                                 VectorCopy(pv, back[b]);
1946                                 b++;
1947                         }
1948                         if (dist[p] == 0 || dist[c] == 0)
1949                                 continue;
1950                         if ((dist[p] > 0) != (dist[c] > 0) )
1951                         {
1952                                 // clip point
1953                                 frac = dist[p] / (dist[p] - dist[c]);
1954                                 front[f][0] = back[b][0] = pv[0] + frac * (cv[0] - pv[0]);
1955                                 front[f][1] = back[b][1] = pv[1] + frac * (cv[1] - pv[1]);
1956                                 front[f][2] = back[b][2] = pv[2] + frac * (cv[2] - pv[2]);
1957                                 f++;
1958                                 b++;
1959                         }
1960                 }
1961
1962                 SubdividePolygon(f, front[0]);
1963                 SubdividePolygon(b, back[0]);
1964                 return;
1965         }
1966
1967         i1 = subdivpolylookupvert(verts);
1968         i2 = subdivpolylookupvert(verts + 3);
1969         for (i = 2;i < numverts;i++)
1970         {
1971                 if (subdivpolytriangles >= MAX_SUBDIVPOLYTRIANGLES)
1972                 {
1973                         Con_Print("SubdividePolygon: ran out of triangles in buffer, please increase your r_subdivide_size\n");
1974                         return;
1975                 }
1976
1977                 i3 = subdivpolylookupvert(verts + i * 3);
1978                 subdivpolyindex[subdivpolytriangles][0] = i1;
1979                 subdivpolyindex[subdivpolytriangles][1] = i2;
1980                 subdivpolyindex[subdivpolytriangles][2] = i3;
1981                 i2 = i3;
1982                 subdivpolytriangles++;
1983         }
1984 }
1985
1986 //Breaks a polygon up along axial 64 unit
1987 //boundaries so that turbulent and sky warps
1988 //can be done reasonably.
1989 static void Mod_Q1BSP_GenerateWarpMesh(msurface_t *surface)
1990 {
1991         int i, j;
1992         surfvertex_t *v;
1993         surfmesh_t *mesh;
1994
1995         subdivpolytriangles = 0;
1996         subdivpolyverts = 0;
1997         SubdividePolygon(surface->num_vertices, (surface->mesh->data_vertex3f + 3 * surface->num_firstvertex));
1998         if (subdivpolytriangles < 1)
1999                 Host_Error("Mod_Q1BSP_GenerateWarpMesh: no triangles?");
2000
2001         surface->mesh = mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + subdivpolytriangles * sizeof(int[3]) + subdivpolyverts * sizeof(surfvertex_t));
2002         mesh->num_vertices = subdivpolyverts;
2003         mesh->num_triangles = subdivpolytriangles;
2004         mesh->vertex = (surfvertex_t *)(mesh + 1);
2005         mesh->index = (int *)(mesh->vertex + mesh->num_vertices);
2006         memset(mesh->vertex, 0, mesh->num_vertices * sizeof(surfvertex_t));
2007
2008         for (i = 0;i < mesh->num_triangles;i++)
2009                 for (j = 0;j < 3;j++)
2010                         mesh->index[i*3+j] = subdivpolyindex[i][j];
2011
2012         for (i = 0, v = mesh->vertex;i < subdivpolyverts;i++, v++)
2013         {
2014                 VectorCopy(subdivpolyvert[i], v->v);
2015                 v->st[0] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[0]);
2016                 v->st[1] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[1]);
2017         }
2018 }
2019 #endif
2020
2021 static qboolean Mod_Q1BSP_AllocLightmapBlock(int *lineused, int totalwidth, int totalheight, int blockwidth, int blockheight, int *outx, int *outy)
2022 {
2023         int y, x2, y2;
2024         int bestx = totalwidth, besty = 0;
2025         // find the left-most space we can find
2026         for (y = 0;y <= totalheight - blockheight;y++)
2027         {
2028                 x2 = 0;
2029                 for (y2 = 0;y2 < blockheight;y2++)
2030                         x2 = max(x2, lineused[y+y2]);
2031                 if (bestx > x2)
2032                 {
2033                         bestx = x2;
2034                         besty = y;
2035                 }
2036         }
2037         // if the best was not good enough, return failure
2038         if (bestx > totalwidth - blockwidth)
2039                 return false;
2040         // we found a good spot
2041         if (outx)
2042                 *outx = bestx;
2043         if (outy)
2044                 *outy = besty;
2045         // now mark the space used
2046         for (y2 = 0;y2 < blockheight;y2++)
2047                 lineused[besty+y2] = bestx + blockwidth;
2048         // return success
2049         return true;
2050 }
2051
2052 static void Mod_Q1BSP_LoadFaces(lump_t *l)
2053 {
2054         dface_t *in;
2055         msurface_t *surface;
2056         int i, j, count, surfacenum, planenum, smax, tmax, ssize, tsize, firstedge, numedges, totalverts, totaltris, lightmapnumber;
2057         float texmins[2], texmaxs[2], val, lightmaptexcoordscale;
2058 #define LIGHTMAPSIZE 256
2059         rtexture_t *lightmaptexture, *deluxemaptexture;
2060         int lightmap_lineused[LIGHTMAPSIZE];
2061
2062         in = (dface_t *)(mod_base + l->fileofs);
2063         if (l->filelen % sizeof(*in))
2064                 Host_Error("Mod_Q1BSP_LoadFaces: funny lump size in %s",loadmodel->name);
2065         count = l->filelen / sizeof(*in);
2066         loadmodel->data_surfaces = (msurface_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_t));
2067         loadmodel->data_surfaces_lightmapinfo = (msurface_lightmapinfo_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_lightmapinfo_t));
2068
2069         loadmodel->num_surfaces = count;
2070
2071         totalverts = 0;
2072         totaltris = 0;
2073         for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs);surfacenum < count;surfacenum++, in++)
2074         {
2075                 numedges = LittleShort(in->numedges);
2076                 totalverts += numedges;
2077                 totaltris += numedges - 2;
2078         }
2079
2080         Mod_AllocSurfMesh(loadmodel->mempool, totalverts, totaltris, true, false, false);
2081
2082         lightmaptexture = NULL;
2083         deluxemaptexture = r_texture_blanknormalmap;
2084         lightmapnumber = 1;
2085         lightmaptexcoordscale = 1.0f / (float)LIGHTMAPSIZE;
2086
2087         totalverts = 0;
2088         totaltris = 0;
2089         for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs), surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, in++, surface++)
2090         {
2091                 surface->lightmapinfo = loadmodel->data_surfaces_lightmapinfo + surfacenum;
2092
2093                 // FIXME: validate edges, texinfo, etc?
2094                 firstedge = LittleLong(in->firstedge);
2095                 numedges = LittleShort(in->numedges);
2096                 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)
2097                         Host_Error("Mod_Q1BSP_LoadFaces: invalid edge range (firstedge %i, numedges %i, model edges %i)", firstedge, numedges, loadmodel->brushq1.numsurfedges);
2098                 i = LittleShort(in->texinfo);
2099                 if ((unsigned int) i >= (unsigned int) loadmodel->brushq1.numtexinfo)
2100                         Host_Error("Mod_Q1BSP_LoadFaces: invalid texinfo index %i(model has %i texinfos)", i, loadmodel->brushq1.numtexinfo);
2101                 surface->lightmapinfo->texinfo = loadmodel->brushq1.texinfo + i;
2102                 surface->texture = surface->lightmapinfo->texinfo->texture;
2103
2104                 planenum = LittleShort(in->planenum);
2105                 if ((unsigned int) planenum >= (unsigned int) loadmodel->brush.num_planes)
2106                         Host_Error("Mod_Q1BSP_LoadFaces: invalid plane index %i (model has %i planes)", planenum, loadmodel->brush.num_planes);
2107
2108                 //surface->flags = surface->texture->flags;
2109                 //if (LittleShort(in->side))
2110                 //      surface->flags |= SURF_PLANEBACK;
2111                 //surface->plane = loadmodel->brush.data_planes + planenum;
2112
2113                 surface->num_firstvertex = totalverts;
2114                 surface->num_vertices = numedges;
2115                 surface->num_firsttriangle = totaltris;
2116                 surface->num_triangles = numedges - 2;
2117                 totalverts += numedges;
2118                 totaltris += numedges - 2;
2119
2120                 // convert edges back to a normal polygon
2121                 for (i = 0;i < surface->num_vertices;i++)
2122                 {
2123                         int lindex = loadmodel->brushq1.surfedges[firstedge + i];
2124                         float s, t;
2125                         if (lindex > 0)
2126                                 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[lindex].v[0]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2127                         else
2128                                 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[-lindex].v[1]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2129                         s = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2130                         t = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2131                         (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 0] = s / surface->texture->width;
2132                         (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 1] = t / surface->texture->height;
2133                         (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = 0;
2134                         (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = 0;
2135                         (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = 0;
2136                 }
2137
2138                 for (i = 0;i < surface->num_triangles;i++)
2139                 {
2140                         (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 0] = 0 + surface->num_firstvertex;
2141                         (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 1] = i + 1 + surface->num_firstvertex;
2142                         (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 2] = i + 2 + surface->num_firstvertex;
2143                 }
2144
2145                 // compile additional data about the surface geometry
2146                 Mod_BuildNormals(surface->num_firstvertex, surface->num_vertices, surface->num_triangles, loadmodel->surfmesh.data_vertex3f, (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle), loadmodel->surfmesh.data_normal3f, true);
2147                 Mod_BuildTextureVectorsFromNormals(surface->num_firstvertex, surface->num_vertices, surface->num_triangles, loadmodel->surfmesh.data_vertex3f, loadmodel->surfmesh.data_texcoordtexture2f, loadmodel->surfmesh.data_normal3f, (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle), loadmodel->surfmesh.data_svector3f, loadmodel->surfmesh.data_tvector3f, true);
2148                 BoxFromPoints(surface->mins, surface->maxs, surface->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex));
2149
2150                 // generate surface extents information
2151                 texmins[0] = texmaxs[0] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2152                 texmins[1] = texmaxs[1] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2153                 for (i = 1;i < surface->num_vertices;i++)
2154                 {
2155                         for (j = 0;j < 2;j++)
2156                         {
2157                                 val = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3, surface->lightmapinfo->texinfo->vecs[j]) + surface->lightmapinfo->texinfo->vecs[j][3];
2158                                 texmins[j] = min(texmins[j], val);
2159                                 texmaxs[j] = max(texmaxs[j], val);
2160                         }
2161                 }
2162                 for (i = 0;i < 2;i++)
2163                 {
2164                         surface->lightmapinfo->texturemins[i] = (int) floor(texmins[i] / 16.0) * 16;
2165                         surface->lightmapinfo->extents[i] = (int) ceil(texmaxs[i] / 16.0) * 16 - surface->lightmapinfo->texturemins[i];
2166                 }
2167
2168                 smax = surface->lightmapinfo->extents[0] >> 4;
2169                 tmax = surface->lightmapinfo->extents[1] >> 4;
2170                 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2171                 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2172
2173                 // lighting info
2174                 for (i = 0;i < MAXLIGHTMAPS;i++)
2175                         surface->lightmapinfo->styles[i] = in->styles[i];
2176                 surface->lightmaptexture = NULL;
2177                 surface->deluxemaptexture = r_texture_blanknormalmap;
2178                 i = LittleLong(in->lightofs);
2179                 if (i == -1)
2180                 {
2181                         surface->lightmapinfo->samples = NULL;
2182                         // give non-lightmapped water a 1x white lightmap
2183                         if ((surface->texture->basematerialflags & MATERIALFLAG_WATER) && (surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) && ssize <= 256 && tsize <= 256)
2184                         {
2185                                 surface->lightmapinfo->samples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2186                                 surface->lightmapinfo->styles[0] = 0;
2187                                 memset(surface->lightmapinfo->samples, 128, ssize * tsize * 3);
2188                         }
2189                 }
2190                 else if (loadmodel->brush.ishlbsp) // LordHavoc: HalfLife map (bsp version 30)
2191                         surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + i;
2192                 else // LordHavoc: white lighting (bsp version 29)
2193                 {
2194                         surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + (i * 3);
2195                         if (loadmodel->brushq1.nmaplightdata)
2196                                 surface->lightmapinfo->nmapsamples = loadmodel->brushq1.nmaplightdata + (i * 3);
2197                 }
2198
2199                 // check if we should apply a lightmap to this
2200                 if (!(surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) || surface->lightmapinfo->samples)
2201                 {
2202                         int i, iu, iv, lightmapx, lightmapy;
2203                         float u, v, ubase, vbase, uscale, vscale;
2204
2205                         if (ssize > 256 || tsize > 256)
2206                                 Host_Error("Bad surface extents");
2207                         // force lightmap upload on first time seeing the surface
2208                         surface->cached_dlight = true;
2209                         // stainmap for permanent marks on walls
2210                         surface->lightmapinfo->stainsamples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2211                         // clear to white
2212                         memset(surface->lightmapinfo->stainsamples, 255, ssize * tsize * 3);
2213
2214                         // find a place for this lightmap
2215                         if (!lightmaptexture || !Mod_Q1BSP_AllocLightmapBlock(lightmap_lineused, LIGHTMAPSIZE, LIGHTMAPSIZE, ssize, tsize, &lightmapx, &lightmapy))
2216                         {
2217                                 // could not find room, make a new lightmap
2218                                 lightmaptexture = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%i", lightmapnumber), LIGHTMAPSIZE, LIGHTMAPSIZE, NULL, loadmodel->brushq1.lightmaprgba ? TEXTYPE_RGBA : TEXTYPE_RGB, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2219                                 if (loadmodel->brushq1.nmaplightdata)
2220                                         deluxemaptexture = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%i", lightmapnumber), LIGHTMAPSIZE, LIGHTMAPSIZE, NULL, loadmodel->brushq1.lightmaprgba ? TEXTYPE_RGBA : TEXTYPE_RGB, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2221                                 lightmapnumber++;
2222                                 memset(lightmap_lineused, 0, sizeof(lightmap_lineused));
2223                                 Mod_Q1BSP_AllocLightmapBlock(lightmap_lineused, LIGHTMAPSIZE, LIGHTMAPSIZE, ssize, tsize, &lightmapx, &lightmapy);
2224                         }
2225
2226                         surface->lightmaptexture = lightmaptexture;
2227                         surface->deluxemaptexture = deluxemaptexture;
2228                         surface->lightmapinfo->lightmaporigin[0] = lightmapx;
2229                         surface->lightmapinfo->lightmaporigin[1] = lightmapy;
2230
2231                         ubase = lightmapx * lightmaptexcoordscale;
2232                         vbase = lightmapy * lightmaptexcoordscale;
2233                         uscale = lightmaptexcoordscale;
2234                         vscale = lightmaptexcoordscale;
2235
2236                         for (i = 0;i < surface->num_vertices;i++)
2237                         {
2238                                 u = ((DotProduct(((loadmodel->surfmesh.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);
2239                                 v = ((DotProduct(((loadmodel->surfmesh.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);
2240                                 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = u * uscale + ubase;
2241                                 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = v * vscale + vbase;
2242                                 // LordHavoc: calc lightmap data offset for vertex lighting to use
2243                                 iu = (int) u;
2244                                 iv = (int) v;
2245                                 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = (bound(0, iv, tmax) * ssize + bound(0, iu, smax)) * 3;
2246                         }
2247                 }
2248         }
2249 }
2250
2251 static void Mod_Q1BSP_LoadNodes_RecursiveSetParent(mnode_t *node, mnode_t *parent)
2252 {
2253         //if (node->parent)
2254         //      Host_Error("Mod_Q1BSP_LoadNodes_RecursiveSetParent: runaway recursion");
2255         node->parent = parent;
2256         if (node->plane)
2257         {
2258                 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[0], node);
2259                 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[1], node);
2260         }
2261 }
2262
2263 static void Mod_Q1BSP_LoadNodes(lump_t *l)
2264 {
2265         int                     i, j, count, p;
2266         dnode_t         *in;
2267         mnode_t         *out;
2268
2269         in = (dnode_t *)(mod_base + l->fileofs);
2270         if (l->filelen % sizeof(*in))
2271                 Host_Error("Mod_Q1BSP_LoadNodes: funny lump size in %s",loadmodel->name);
2272         count = l->filelen / sizeof(*in);
2273         out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2274
2275         loadmodel->brush.data_nodes = out;
2276         loadmodel->brush.num_nodes = count;
2277
2278         for ( i=0 ; i<count ; i++, in++, out++)
2279         {
2280                 for (j=0 ; j<3 ; j++)
2281                 {
2282                         out->mins[j] = LittleShort(in->mins[j]);
2283                         out->maxs[j] = LittleShort(in->maxs[j]);
2284                 }
2285
2286                 p = LittleLong(in->planenum);
2287                 out->plane = loadmodel->brush.data_planes + p;
2288
2289                 out->firstsurface = LittleShort(in->firstface);
2290                 out->numsurfaces = LittleShort(in->numfaces);
2291
2292                 for (j=0 ; j<2 ; j++)
2293                 {
2294                         p = LittleShort(in->children[j]);
2295                         if (p >= 0)
2296                                 out->children[j] = loadmodel->brush.data_nodes + p;
2297                         else
2298                                 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + (-1 - p));
2299                 }
2300         }
2301
2302         Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);      // sets nodes and leafs
2303 }
2304
2305 static void Mod_Q1BSP_LoadLeafs(lump_t *l)
2306 {
2307         dleaf_t *in;
2308         mleaf_t *out;
2309         int i, j, count, p;
2310
2311         in = (dleaf_t *)(mod_base + l->fileofs);
2312         if (l->filelen % sizeof(*in))
2313                 Host_Error("Mod_Q1BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
2314         count = l->filelen / sizeof(*in);
2315         out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2316
2317         loadmodel->brush.data_leafs = out;
2318         loadmodel->brush.num_leafs = count;
2319         // get visleafs from the submodel data
2320         loadmodel->brush.num_pvsclusters = loadmodel->brushq1.submodels[0].visleafs;
2321         loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters+7)>>3;
2322         loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2323         memset(loadmodel->brush.data_pvsclusters, 0xFF, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2324
2325         for ( i=0 ; i<count ; i++, in++, out++)
2326         {
2327                 for (j=0 ; j<3 ; j++)
2328                 {
2329                         out->mins[j] = LittleShort(in->mins[j]);
2330                         out->maxs[j] = LittleShort(in->maxs[j]);
2331                 }
2332
2333                 // FIXME: this function could really benefit from some error checking
2334
2335                 out->contents = LittleLong(in->contents);
2336
2337                 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + LittleShort(in->firstmarksurface);
2338                 out->numleafsurfaces = LittleShort(in->nummarksurfaces);
2339                 if (out->firstleafsurface < 0 || LittleShort(in->firstmarksurface) + out->numleafsurfaces > loadmodel->brush.num_leafsurfaces)
2340                 {
2341                         Con_Printf("Mod_Q1BSP_LoadLeafs: invalid leafsurface range %i:%i outside range %i:%i\n", (int)(out->firstleafsurface - loadmodel->brush.data_leafsurfaces), (int)(out->firstleafsurface + out->numleafsurfaces - loadmodel->brush.data_leafsurfaces), 0, loadmodel->brush.num_leafsurfaces);
2342                         out->firstleafsurface = NULL;
2343                         out->numleafsurfaces = 0;
2344                 }
2345
2346                 out->clusterindex = i - 1;
2347                 if (out->clusterindex >= loadmodel->brush.num_pvsclusters)
2348                         out->clusterindex = -1;
2349
2350                 p = LittleLong(in->visofs);
2351                 // ignore visofs errors on leaf 0 (solid)
2352                 if (p >= 0 && out->clusterindex >= 0)
2353                 {
2354                         if (p >= loadmodel->brushq1.num_compressedpvs)
2355                                 Con_Print("Mod_Q1BSP_LoadLeafs: invalid visofs\n");
2356                         else
2357                                 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);
2358                 }
2359
2360                 for (j = 0;j < 4;j++)
2361                         out->ambient_sound_level[j] = in->ambient_level[j];
2362
2363                 // FIXME: Insert caustics here
2364         }
2365 }
2366
2367 static void Mod_Q1BSP_LoadClipnodes(lump_t *l, hullinfo_t *hullinfo)
2368 {
2369         dclipnode_t *in, *out;
2370         int                     i, count;
2371         hull_t          *hull;
2372
2373         in = (dclipnode_t *)(mod_base + l->fileofs);
2374         if (l->filelen % sizeof(*in))
2375                 Host_Error("Mod_Q1BSP_LoadClipnodes: funny lump size in %s",loadmodel->name);
2376         count = l->filelen / sizeof(*in);
2377         out = (dclipnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2378
2379         loadmodel->brushq1.clipnodes = out;
2380         loadmodel->brushq1.numclipnodes = count;
2381
2382         for (i = 1; i < hullinfo->numhulls; i++)
2383         {
2384                 hull = &loadmodel->brushq1.hulls[i];
2385                 hull->clipnodes = out;
2386                 hull->firstclipnode = 0;
2387                 hull->lastclipnode = count-1;
2388                 hull->planes = loadmodel->brush.data_planes;
2389                 hull->clip_mins[0] = hullinfo->hullsizes[i][0][0];
2390                 hull->clip_mins[1] = hullinfo->hullsizes[i][0][1];
2391                 hull->clip_mins[2] = hullinfo->hullsizes[i][0][2];
2392                 hull->clip_maxs[0] = hullinfo->hullsizes[i][1][0];
2393                 hull->clip_maxs[1] = hullinfo->hullsizes[i][1][1];
2394                 hull->clip_maxs[2] = hullinfo->hullsizes[i][1][2];
2395                 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2396         }
2397
2398         for (i=0 ; i<count ; i++, out++, in++)
2399         {
2400                 out->planenum = LittleLong(in->planenum);
2401                 out->children[0] = LittleShort(in->children[0]);
2402                 out->children[1] = LittleShort(in->children[1]);
2403                 if (out->planenum < 0 || out->planenum >= loadmodel->brush.num_planes)
2404                         Host_Error("Corrupt clipping hull(out of range planenum)");
2405                 if (out->children[0] >= count || out->children[1] >= count)
2406                         Host_Error("Corrupt clipping hull(out of range child)");
2407         }
2408 }
2409
2410 //Duplicate the drawing hull structure as a clipping hull
2411 static void Mod_Q1BSP_MakeHull0(void)
2412 {
2413         mnode_t         *in;
2414         dclipnode_t *out;
2415         int                     i;
2416         hull_t          *hull;
2417
2418         hull = &loadmodel->brushq1.hulls[0];
2419
2420         in = loadmodel->brush.data_nodes;
2421         out = (dclipnode_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(dclipnode_t));
2422
2423         hull->clipnodes = out;
2424         hull->firstclipnode = 0;
2425         hull->lastclipnode = loadmodel->brush.num_nodes - 1;
2426         hull->planes = loadmodel->brush.data_planes;
2427
2428         for (i = 0;i < loadmodel->brush.num_nodes;i++, out++, in++)
2429         {
2430                 out->planenum = in->plane - loadmodel->brush.data_planes;
2431                 out->children[0] = in->children[0]->plane ? in->children[0] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[0])->contents;
2432                 out->children[1] = in->children[1]->plane ? in->children[1] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[1])->contents;
2433         }
2434 }
2435
2436 static void Mod_Q1BSP_LoadLeaffaces(lump_t *l)
2437 {
2438         int i, j;
2439         short *in;
2440
2441         in = (short *)(mod_base + l->fileofs);
2442         if (l->filelen % sizeof(*in))
2443                 Host_Error("Mod_Q1BSP_LoadLeaffaces: funny lump size in %s",loadmodel->name);
2444         loadmodel->brush.num_leafsurfaces = l->filelen / sizeof(*in);
2445         loadmodel->brush.data_leafsurfaces = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafsurfaces * sizeof(int));
2446
2447         for (i = 0;i < loadmodel->brush.num_leafsurfaces;i++)
2448         {
2449                 j = (unsigned) LittleShort(in[i]);
2450                 if (j >= loadmodel->num_surfaces)
2451                         Host_Error("Mod_Q1BSP_LoadLeaffaces: bad surface number");
2452                 loadmodel->brush.data_leafsurfaces[i] = j;
2453         }
2454 }
2455
2456 static void Mod_Q1BSP_LoadSurfedges(lump_t *l)
2457 {
2458         int             i;
2459         int             *in;
2460
2461         in = (int *)(mod_base + l->fileofs);
2462         if (l->filelen % sizeof(*in))
2463                 Host_Error("Mod_Q1BSP_LoadSurfedges: funny lump size in %s",loadmodel->name);
2464         loadmodel->brushq1.numsurfedges = l->filelen / sizeof(*in);
2465         loadmodel->brushq1.surfedges = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numsurfedges * sizeof(int));
2466
2467         for (i = 0;i < loadmodel->brushq1.numsurfedges;i++)
2468                 loadmodel->brushq1.surfedges[i] = LittleLong(in[i]);
2469 }
2470
2471
2472 static void Mod_Q1BSP_LoadPlanes(lump_t *l)
2473 {
2474         int                     i;
2475         mplane_t        *out;
2476         dplane_t        *in;
2477
2478         in = (dplane_t *)(mod_base + l->fileofs);
2479         if (l->filelen % sizeof(*in))
2480                 Host_Error("Mod_Q1BSP_LoadPlanes: funny lump size in %s", loadmodel->name);
2481
2482         loadmodel->brush.num_planes = l->filelen / sizeof(*in);
2483         loadmodel->brush.data_planes = out = (mplane_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_planes * sizeof(*out));
2484
2485         for (i = 0;i < loadmodel->brush.num_planes;i++, in++, out++)
2486         {
2487                 out->normal[0] = LittleFloat(in->normal[0]);
2488                 out->normal[1] = LittleFloat(in->normal[1]);
2489                 out->normal[2] = LittleFloat(in->normal[2]);
2490                 out->dist = LittleFloat(in->dist);
2491
2492                 PlaneClassify(out);
2493         }
2494 }
2495
2496 static void Mod_Q1BSP_LoadMapBrushes(void)
2497 {
2498 #if 0
2499 // unfinished
2500         int submodel, numbrushes;
2501         qboolean firstbrush;
2502         char *text, *maptext;
2503         char mapfilename[MAX_QPATH];
2504         FS_StripExtension (loadmodel->name, mapfilename, sizeof (mapfilename));
2505         strlcat (mapfilename, ".map", sizeof (mapfilename));
2506         maptext = (unsigned char*) FS_LoadFile(mapfilename, tempmempool, false, NULL);
2507         if (!maptext)
2508                 return;
2509         text = maptext;
2510         if (!COM_ParseTokenConsole(&data))
2511                 return; // error
2512         submodel = 0;
2513         for (;;)
2514         {
2515                 if (!COM_ParseTokenConsole(&data))
2516                         break;
2517                 if (com_token[0] != '{')
2518                         return; // error
2519                 // entity
2520                 firstbrush = true;
2521                 numbrushes = 0;
2522                 maxbrushes = 256;
2523                 brushes = Mem_Alloc(loadmodel->mempool, maxbrushes * sizeof(mbrush_t));
2524                 for (;;)
2525                 {
2526                         if (!COM_ParseTokenConsole(&data))
2527                                 return; // error
2528                         if (com_token[0] == '}')
2529                                 break; // end of entity
2530                         if (com_token[0] == '{')
2531                         {
2532                                 // brush
2533                                 if (firstbrush)
2534                                 {
2535                                         if (submodel)
2536                                         {
2537                                                 if (submodel > loadmodel->brush.numsubmodels)
2538                                                 {
2539                                                         Con_Printf("Mod_Q1BSP_LoadMapBrushes: .map has more submodels than .bsp!\n");
2540                                                         model = NULL;
2541                                                 }
2542                                                 else
2543                                                         model = loadmodel->brush.submodels[submodel];
2544                                         }
2545                                         else
2546                                                 model = loadmodel;
2547                                 }
2548                                 for (;;)
2549                                 {
2550                                         if (!COM_ParseTokenConsole(&data))
2551                                                 return; // error
2552                                         if (com_token[0] == '}')
2553                                                 break; // end of brush
2554                                         // each brush face should be this format:
2555                                         // ( x y z ) ( x y z ) ( x y z ) texture scroll_s scroll_t rotateangle scale_s scale_t
2556                                         // FIXME: support hl .map format
2557                                         for (pointnum = 0;pointnum < 3;pointnum++)
2558                                         {
2559                                                 COM_ParseTokenConsole(&data);
2560                                                 for (componentnum = 0;componentnum < 3;componentnum++)
2561                                                 {
2562                                                         COM_ParseTokenConsole(&data);
2563                                                         point[pointnum][componentnum] = atof(com_token);
2564                                                 }
2565                                                 COM_ParseTokenConsole(&data);
2566                                         }
2567                                         COM_ParseTokenConsole(&data);
2568                                         strlcpy(facetexture, com_token, sizeof(facetexture));
2569                                         COM_ParseTokenConsole(&data);
2570                                         //scroll_s = atof(com_token);
2571                                         COM_ParseTokenConsole(&data);
2572                                         //scroll_t = atof(com_token);
2573                                         COM_ParseTokenConsole(&data);
2574                                         //rotate = atof(com_token);
2575                                         COM_ParseTokenConsole(&data);
2576                                         //scale_s = atof(com_token);
2577                                         COM_ParseTokenConsole(&data);
2578                                         //scale_t = atof(com_token);
2579                                         TriangleNormal(point[0], point[1], point[2], planenormal);
2580                                         VectorNormalizeDouble(planenormal);
2581                                         planedist = DotProduct(point[0], planenormal);
2582                                         //ChooseTexturePlane(planenormal, texturevector[0], texturevector[1]);
2583                                 }
2584                                 continue;
2585                         }
2586                 }
2587         }
2588 #endif
2589 }
2590
2591
2592 #define MAX_PORTALPOINTS 64
2593
2594 typedef struct portal_s
2595 {
2596         mplane_t plane;
2597         mnode_t *nodes[2];              // [0] = front side of plane
2598         struct portal_s *next[2];
2599         int numpoints;
2600         double points[3*MAX_PORTALPOINTS];
2601         struct portal_s *chain; // all portals are linked into a list
2602 }
2603 portal_t;
2604
2605 static portal_t *portalchain;
2606
2607 /*
2608 ===========
2609 AllocPortal
2610 ===========
2611 */
2612 static portal_t *AllocPortal(void)
2613 {
2614         portal_t *p;
2615         p = (portal_t *)Mem_Alloc(loadmodel->mempool, sizeof(portal_t));
2616         p->chain = portalchain;
2617         portalchain = p;
2618         return p;
2619 }
2620
2621 static void FreePortal(portal_t *p)
2622 {
2623         Mem_Free(p);
2624 }
2625
2626 static void Mod_Q1BSP_RecursiveRecalcNodeBBox(mnode_t *node)
2627 {
2628         // process only nodes (leafs already had their box calculated)
2629         if (!node->plane)
2630                 return;
2631
2632         // calculate children first
2633         Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[0]);
2634         Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[1]);
2635
2636         // make combined bounding box from children
2637         node->mins[0] = min(node->children[0]->mins[0], node->children[1]->mins[0]);
2638         node->mins[1] = min(node->children[0]->mins[1], node->children[1]->mins[1]);
2639         node->mins[2] = min(node->children[0]->mins[2], node->children[1]->mins[2]);
2640         node->maxs[0] = max(node->children[0]->maxs[0], node->children[1]->maxs[0]);
2641         node->maxs[1] = max(node->children[0]->maxs[1], node->children[1]->maxs[1]);
2642         node->maxs[2] = max(node->children[0]->maxs[2], node->children[1]->maxs[2]);
2643 }
2644
2645 static void Mod_Q1BSP_FinalizePortals(void)
2646 {
2647         int i, j, numportals, numpoints;
2648         portal_t *p, *pnext;
2649         mportal_t *portal;
2650         mvertex_t *point;
2651         mleaf_t *leaf, *endleaf;
2652
2653         // tally up portal and point counts and recalculate bounding boxes for all
2654         // leafs (because qbsp is very sloppy)
2655         leaf = loadmodel->brush.data_leafs;
2656         endleaf = leaf + loadmodel->brush.num_leafs;
2657         for (;leaf < endleaf;leaf++)
2658         {
2659                 VectorSet(leaf->mins,  2000000000,  2000000000,  2000000000);
2660                 VectorSet(leaf->maxs, -2000000000, -2000000000, -2000000000);
2661         }
2662         p = portalchain;
2663         numportals = 0;
2664         numpoints = 0;
2665         while (p)
2666         {
2667                 // note: this check must match the one below or it will usually corrupt memory
2668                 // 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
2669                 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1] && ((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
2670                 {
2671                         numportals += 2;
2672                         numpoints += p->numpoints * 2;
2673                 }
2674                 p = p->chain;
2675         }
2676         loadmodel->brush.data_portals = (mportal_t *)Mem_Alloc(loadmodel->mempool, numportals * sizeof(mportal_t) + numpoints * sizeof(mvertex_t));
2677         loadmodel->brush.num_portals = numportals;
2678         loadmodel->brush.data_portalpoints = (mvertex_t *)((unsigned char *) loadmodel->brush.data_portals + numportals * sizeof(mportal_t));
2679         loadmodel->brush.num_portalpoints = numpoints;
2680         // clear all leaf portal chains
2681         for (i = 0;i < loadmodel->brush.num_leafs;i++)
2682                 loadmodel->brush.data_leafs[i].portals = NULL;
2683         // process all portals in the global portal chain, while freeing them
2684         portal = loadmodel->brush.data_portals;
2685         point = loadmodel->brush.data_portalpoints;
2686         p = portalchain;
2687         portalchain = NULL;
2688         while (p)
2689         {
2690                 pnext = p->chain;
2691
2692                 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1])
2693                 {
2694                         // note: this check must match the one above or it will usually corrupt memory
2695                         // 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
2696                         if (((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
2697                         {
2698                                 // first make the back to front portal(forward portal)
2699                                 portal->points = point;
2700                                 portal->numpoints = p->numpoints;
2701                                 portal->plane.dist = p->plane.dist;
2702                                 VectorCopy(p->plane.normal, portal->plane.normal);
2703                                 portal->here = (mleaf_t *)p->nodes[1];
2704                                 portal->past = (mleaf_t *)p->nodes[0];
2705                                 // copy points
2706                                 for (j = 0;j < portal->numpoints;j++)
2707                                 {
2708                                         VectorCopy(p->points + j*3, point->position);
2709                                         point++;
2710                                 }
2711                                 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
2712                                 PlaneClassify(&portal->plane);
2713
2714                                 // link into leaf's portal chain
2715                                 portal->next = portal->here->portals;
2716                                 portal->here->portals = portal;
2717
2718                                 // advance to next portal
2719                                 portal++;
2720
2721                                 // then make the front to back portal(backward portal)
2722                                 portal->points = point;
2723                                 portal->numpoints = p->numpoints;
2724                                 portal->plane.dist = -p->plane.dist;
2725                                 VectorNegate(p->plane.normal, portal->plane.normal);
2726                                 portal->here = (mleaf_t *)p->nodes[0];
2727                                 portal->past = (mleaf_t *)p->nodes[1];
2728                                 // copy points
2729                                 for (j = portal->numpoints - 1;j >= 0;j--)
2730                                 {
2731                                         VectorCopy(p->points + j*3, point->position);
2732                                         point++;
2733                                 }
2734                                 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
2735                                 PlaneClassify(&portal->plane);
2736
2737                                 // link into leaf's portal chain
2738                                 portal->next = portal->here->portals;
2739                                 portal->here->portals = portal;
2740
2741                                 // advance to next portal
2742                                 portal++;
2743                         }
2744                         // add the portal's polygon points to the leaf bounding boxes
2745                         for (i = 0;i < 2;i++)
2746                         {
2747                                 leaf = (mleaf_t *)p->nodes[i];
2748                                 for (j = 0;j < p->numpoints;j++)
2749                                 {
2750                                         if (leaf->mins[0] > p->points[j*3+0]) leaf->mins[0] = p->points[j*3+0];
2751                                         if (leaf->mins[1] > p->points[j*3+1]) leaf->mins[1] = p->points[j*3+1];
2752                                         if (leaf->mins[2] > p->points[j*3+2]) leaf->mins[2] = p->points[j*3+2];
2753                                         if (leaf->maxs[0] < p->points[j*3+0]) leaf->maxs[0] = p->points[j*3+0];
2754                                         if (leaf->maxs[1] < p->points[j*3+1]) leaf->maxs[1] = p->points[j*3+1];
2755                                         if (leaf->maxs[2] < p->points[j*3+2]) leaf->maxs[2] = p->points[j*3+2];
2756                                 }
2757                         }
2758                 }
2759                 FreePortal(p);
2760                 p = pnext;
2761         }
2762         // now recalculate the node bounding boxes from the leafs
2763         Mod_Q1BSP_RecursiveRecalcNodeBBox(loadmodel->brush.data_nodes);
2764 }
2765
2766 /*
2767 =============
2768 AddPortalToNodes
2769 =============
2770 */
2771 static void AddPortalToNodes(portal_t *p, mnode_t *front, mnode_t *back)
2772 {
2773         if (!front)
2774                 Host_Error("AddPortalToNodes: NULL front node");
2775         if (!back)
2776                 Host_Error("AddPortalToNodes: NULL back node");
2777         if (p->nodes[0] || p->nodes[1])
2778                 Host_Error("AddPortalToNodes: already included");
2779         // 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
2780
2781         p->nodes[0] = front;
2782         p->next[0] = (portal_t *)front->portals;
2783         front->portals = (mportal_t *)p;
2784
2785         p->nodes[1] = back;
2786         p->next[1] = (portal_t *)back->portals;
2787         back->portals = (mportal_t *)p;
2788 }
2789
2790 /*
2791 =============
2792 RemovePortalFromNode
2793 =============
2794 */
2795 static void RemovePortalFromNodes(portal_t *portal)
2796 {
2797         int i;
2798         mnode_t *node;
2799         void **portalpointer;
2800         portal_t *t;
2801         for (i = 0;i < 2;i++)
2802         {
2803                 node = portal->nodes[i];
2804
2805                 portalpointer = (void **) &node->portals;
2806                 while (1)
2807                 {
2808                         t = (portal_t *)*portalpointer;
2809                         if (!t)
2810                                 Host_Error("RemovePortalFromNodes: portal not in leaf");
2811
2812                         if (t == portal)
2813                         {
2814                                 if (portal->nodes[0] == node)
2815                                 {
2816                                         *portalpointer = portal->next[0];
2817                                         portal->nodes[0] = NULL;
2818                                 }
2819                                 else if (portal->nodes[1] == node)
2820                                 {
2821                                         *portalpointer = portal->next[1];
2822                                         portal->nodes[1] = NULL;
2823                                 }
2824                                 else
2825                                         Host_Error("RemovePortalFromNodes: portal not bounding leaf");
2826                                 break;
2827                         }
2828
2829                         if (t->nodes[0] == node)
2830                                 portalpointer = (void **) &t->next[0];
2831                         else if (t->nodes[1] == node)
2832                                 portalpointer = (void **) &t->next[1];
2833                         else
2834                                 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
2835                 }
2836         }
2837 }
2838
2839 #define PORTAL_DIST_EPSILON (1.0 / 32.0)
2840 static void Mod_Q1BSP_RecursiveNodePortals(mnode_t *node)
2841 {
2842         int i, side;
2843         mnode_t *front, *back, *other_node;
2844         mplane_t clipplane, *plane;
2845         portal_t *portal, *nextportal, *nodeportal, *splitportal, *temp;
2846         int numfrontpoints, numbackpoints;
2847         double frontpoints[3*MAX_PORTALPOINTS], backpoints[3*MAX_PORTALPOINTS];
2848
2849         // if a leaf, we're done
2850         if (!node->plane)
2851                 return;
2852
2853         plane = node->plane;
2854
2855         front = node->children[0];
2856         back = node->children[1];
2857         if (front == back)
2858                 Host_Error("Mod_Q1BSP_RecursiveNodePortals: corrupt node hierarchy");
2859
2860         // create the new portal by generating a polygon for the node plane,
2861         // and clipping it by all of the other portals(which came from nodes above this one)
2862         nodeportal = AllocPortal();
2863         nodeportal->plane = *plane;
2864
2865         // TODO: calculate node bounding boxes during recursion and calculate a maximum plane size accordingly to improve precision (as most maps do not need 1 billion unit plane polygons)
2866         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);
2867         nodeportal->numpoints = 4;
2868         side = 0;       // shut up compiler warning
2869         for (portal = (portal_t *)node->portals;portal;portal = portal->next[side])
2870         {
2871                 clipplane = portal->plane;
2872                 if (portal->nodes[0] == portal->nodes[1])
2873                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(1)");
2874                 if (portal->nodes[0] == node)
2875                         side = 0;
2876                 else if (portal->nodes[1] == node)
2877                 {
2878                         clipplane.dist = -clipplane.dist;
2879                         VectorNegate(clipplane.normal, clipplane.normal);
2880                         side = 1;
2881                 }
2882                 else
2883                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
2884
2885                 for (i = 0;i < nodeportal->numpoints*3;i++)
2886                         frontpoints[i] = nodeportal->points[i];
2887                 PolygonD_Divide(nodeportal->numpoints, frontpoints, clipplane.normal[0], clipplane.normal[1], clipplane.normal[2], clipplane.dist, PORTAL_DIST_EPSILON, MAX_PORTALPOINTS, nodeportal->points, &nodeportal->numpoints, 0, NULL, NULL, NULL);
2888                 if (nodeportal->numpoints <= 0 || nodeportal->numpoints >= MAX_PORTALPOINTS)
2889                         break;
2890         }
2891
2892         if (nodeportal->numpoints < 3)
2893         {
2894                 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal was clipped away\n");
2895                 nodeportal->numpoints = 0;
2896         }
2897         else if (nodeportal->numpoints >= MAX_PORTALPOINTS)
2898         {
2899                 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal has too many points\n");
2900                 nodeportal->numpoints = 0;
2901         }
2902
2903         AddPortalToNodes(nodeportal, front, back);
2904
2905         // split the portals of this node along this node's plane and assign them to the children of this node
2906         // (migrating the portals downward through the tree)
2907         for (portal = (portal_t *)node->portals;portal;portal = nextportal)
2908         {
2909                 if (portal->nodes[0] == portal->nodes[1])
2910                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(2)");
2911                 if (portal->nodes[0] == node)
2912                         side = 0;
2913                 else if (portal->nodes[1] == node)
2914                         side = 1;
2915                 else
2916                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
2917                 nextportal = portal->next[side];
2918                 if (!portal->numpoints)
2919                         continue;
2920
2921                 other_node = portal->nodes[!side];
2922                 RemovePortalFromNodes(portal);
2923
2924                 // cut the portal into two portals, one on each side of the node plane
2925                 PolygonD_Divide(portal->numpoints, portal->points, plane->normal[0], plane->normal[1], plane->normal[2], plane->dist, PORTAL_DIST_EPSILON, MAX_PORTALPOINTS, frontpoints, &numfrontpoints, MAX_PORTALPOINTS, backpoints, &numbackpoints, NULL);
2926
2927                 if (!numfrontpoints)
2928                 {
2929                         if (side == 0)
2930                                 AddPortalToNodes(portal, back, other_node);
2931                         else
2932                                 AddPortalToNodes(portal, other_node, back);
2933                         continue;
2934                 }
2935                 if (!numbackpoints)
2936                 {
2937                         if (side == 0)
2938                                 AddPortalToNodes(portal, front, other_node);
2939                         else
2940                                 AddPortalToNodes(portal, other_node, front);
2941                         continue;
2942                 }
2943
2944                 // the portal is split
2945                 splitportal = AllocPortal();
2946                 temp = splitportal->chain;
2947                 *splitportal = *portal;
2948                 splitportal->chain = temp;
2949                 for (i = 0;i < numbackpoints*3;i++)
2950                         splitportal->points[i] = backpoints[i];
2951                 splitportal->numpoints = numbackpoints;
2952                 for (i = 0;i < numfrontpoints*3;i++)
2953                         portal->points[i] = frontpoints[i];
2954                 portal->numpoints = numfrontpoints;
2955
2956                 if (side == 0)
2957                 {
2958                         AddPortalToNodes(portal, front, other_node);
2959                         AddPortalToNodes(splitportal, back, other_node);
2960                 }
2961                 else
2962                 {
2963                         AddPortalToNodes(portal, other_node, front);
2964                         AddPortalToNodes(splitportal, other_node, back);
2965                 }
2966         }
2967
2968         Mod_Q1BSP_RecursiveNodePortals(front);
2969         Mod_Q1BSP_RecursiveNodePortals(back);
2970 }
2971
2972 static void Mod_Q1BSP_MakePortals(void)
2973 {
2974         portalchain = NULL;
2975         Mod_Q1BSP_RecursiveNodePortals(loadmodel->brush.data_nodes);
2976         Mod_Q1BSP_FinalizePortals();
2977 }
2978
2979 static void Mod_Q1BSP_BuildLightmapUpdateChains(mempool_t *mempool, model_t *model)
2980 {
2981         int i, j, stylecounts[256], totalcount, remapstyles[256];
2982         msurface_t *surface;
2983         memset(stylecounts, 0, sizeof(stylecounts));
2984         for (i = 0;i < model->nummodelsurfaces;i++)
2985         {
2986                 surface = model->data_surfaces + model->firstmodelsurface + i;
2987                 for (j = 0;j < MAXLIGHTMAPS;j++)
2988                         stylecounts[surface->lightmapinfo->styles[j]]++;
2989         }
2990         totalcount = 0;
2991         model->brushq1.light_styles = 0;
2992         for (i = 0;i < 255;i++)
2993         {
2994                 if (stylecounts[i])
2995                 {
2996                         remapstyles[i] = model->brushq1.light_styles++;
2997                         totalcount += stylecounts[i] + 1;
2998                 }
2999         }
3000         if (!totalcount)
3001                 return;
3002         model->brushq1.light_style = (unsigned char *)Mem_Alloc(mempool, model->brushq1.light_styles * sizeof(unsigned char));
3003         model->brushq1.light_stylevalue = (int *)Mem_Alloc(mempool, model->brushq1.light_styles * sizeof(int));
3004         model->brushq1.light_styleupdatechains = (msurface_t ***)Mem_Alloc(mempool, model->brushq1.light_styles * sizeof(msurface_t **));
3005         model->brushq1.light_styleupdatechainsbuffer = (msurface_t **)Mem_Alloc(mempool, totalcount * sizeof(msurface_t *));
3006         model->brushq1.light_styles = 0;
3007         for (i = 0;i < 255;i++)
3008                 if (stylecounts[i])
3009                         model->brushq1.light_style[model->brushq1.light_styles++] = i;
3010         j = 0;
3011         for (i = 0;i < model->brushq1.light_styles;i++)
3012         {
3013                 model->brushq1.light_styleupdatechains[i] = model->brushq1.light_styleupdatechainsbuffer + j;
3014                 j += stylecounts[model->brushq1.light_style[i]] + 1;
3015         }
3016         for (i = 0;i < model->nummodelsurfaces;i++)
3017         {
3018                 surface = model->data_surfaces + model->firstmodelsurface + i;
3019                 for (j = 0;j < MAXLIGHTMAPS;j++)
3020                         if (surface->lightmapinfo->styles[j] != 255)
3021                                 *model->brushq1.light_styleupdatechains[remapstyles[surface->lightmapinfo->styles[j]]]++ = surface;
3022         }
3023         j = 0;
3024         for (i = 0;i < model->brushq1.light_styles;i++)
3025         {
3026                 *model->brushq1.light_styleupdatechains[i] = NULL;
3027                 model->brushq1.light_styleupdatechains[i] = model->brushq1.light_styleupdatechainsbuffer + j;
3028                 j += stylecounts[model->brushq1.light_style[i]] + 1;
3029         }
3030 }
3031
3032 //Returns PVS data for a given point
3033 //(note: can return NULL)
3034 static unsigned char *Mod_Q1BSP_GetPVS(model_t *model, const vec3_t p)
3035 {
3036         mnode_t *node;
3037         node = model->brush.data_nodes;
3038         while (node->plane)
3039                 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
3040         if (((mleaf_t *)node)->clusterindex >= 0)
3041                 return model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3042         else
3043                 return NULL;
3044 }
3045
3046 static void Mod_Q1BSP_FatPVS_RecursiveBSPNode(model_t *model, const vec3_t org, vec_t radius, unsigned char *pvsbuffer, int pvsbytes, mnode_t *node)
3047 {
3048         while (node->plane)
3049         {
3050                 float d = PlaneDiff(org, node->plane);
3051                 if (d > radius)
3052                         node = node->children[0];
3053                 else if (d < -radius)
3054                         node = node->children[1];
3055                 else
3056                 {
3057                         // go down both sides
3058                         Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, pvsbytes, node->children[0]);
3059                         node = node->children[1];
3060                 }
3061         }
3062         // if this leaf is in a cluster, accumulate the pvs bits
3063         if (((mleaf_t *)node)->clusterindex >= 0)
3064         {
3065                 int i;
3066                 unsigned char *pvs = model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3067                 for (i = 0;i < pvsbytes;i++)
3068                         pvsbuffer[i] |= pvs[i];
3069         }
3070 }
3071
3072 //Calculates a PVS that is the inclusive or of all leafs within radius pixels
3073 //of the given point.
3074 static int Mod_Q1BSP_FatPVS(model_t *model, const vec3_t org, vec_t radius, unsigned char *pvsbuffer, int pvsbufferlength)
3075 {
3076         int bytes = model->brush.num_pvsclusterbytes;
3077         bytes = min(bytes, pvsbufferlength);
3078         if (r_novis.integer || !model->brush.num_pvsclusters || !Mod_Q1BSP_GetPVS(model, org))
3079         {
3080                 memset(pvsbuffer, 0xFF, bytes);
3081                 return bytes;
3082         }
3083         memset(pvsbuffer, 0, bytes);
3084         Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, bytes, model->brush.data_nodes);
3085         return bytes;
3086 }
3087
3088 static void Mod_Q1BSP_RoundUpToHullSize(model_t *cmodel, const vec3_t inmins, const vec3_t inmaxs, vec3_t outmins, vec3_t outmaxs)
3089 {
3090         vec3_t size;
3091         const hull_t *hull;
3092
3093         VectorSubtract(inmaxs, inmins, size);
3094         if (cmodel->brush.ismcbsp)
3095         {
3096                 if (size[0] < 3)
3097                         hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3098                 else if (size[2] < 48) // pick the nearest of 40 or 56
3099                         hull = &cmodel->brushq1.hulls[2]; // 16x16x40
3100                 else
3101                         hull = &cmodel->brushq1.hulls[1]; // 16x16x56
3102         }
3103         else if (cmodel->brush.ishlbsp)
3104         {
3105                 if (size[0] < 3)
3106                         hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3107                 else if (size[0] <= 32)
3108                 {
3109                         if (size[2] < 54) // pick the nearest of 36 or 72
3110                                 hull = &cmodel->brushq1.hulls[3]; // 32x32x36
3111                         else
3112                                 hull = &cmodel->brushq1.hulls[1]; // 32x32x72
3113                 }
3114                 else
3115                         hull = &cmodel->brushq1.hulls[2]; // 64x64x64
3116         }
3117         else
3118         {
3119                 if (size[0] < 3)
3120                         hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3121                 else if (size[0] <= 32)
3122                         hull = &cmodel->brushq1.hulls[1]; // 32x32x56
3123                 else
3124                         hull = &cmodel->brushq1.hulls[2]; // 64x64x88
3125         }
3126         VectorCopy(inmins, outmins);
3127         VectorAdd(inmins, hull->clip_size, outmaxs);
3128 }
3129
3130 void Mod_Q1BSP_Load(model_t *mod, void *buffer, void *bufferend)
3131 {
3132         int i, j, k;
3133         dheader_t *header;
3134         dmodel_t *bm;
3135         mempool_t *mainmempool;
3136         float dist, modelyawradius, modelradius, *vec;
3137         msurface_t *surface;
3138         int numshadowmeshtriangles;
3139         dheader_t _header;
3140         hullinfo_t hullinfo;
3141
3142         mod->type = mod_brushq1;
3143
3144         if (!memcmp (buffer, "MCBSPpad", 8))
3145         {
3146                 unsigned char   *index;
3147
3148                 mod->brush.ismcbsp = true;
3149                 mod->brush.ishlbsp = false;
3150
3151                 mod_base = (unsigned char*)buffer;
3152
3153                 index = mod_base;
3154                 index += 8;
3155                 i = SB_ReadInt (&index);
3156                 if (i != MCBSPVERSION)
3157                         Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i)", mod->name, i, MCBSPVERSION);
3158
3159         // read hull info
3160                 hullinfo.numhulls = LittleLong(*(int*)index); index += 4;
3161                 hullinfo.filehulls = hullinfo.numhulls;
3162                 VectorClear (hullinfo.hullsizes[0][0]);
3163                 VectorClear (hullinfo.hullsizes[0][1]);
3164                 for (i = 1; i < hullinfo.numhulls; i++)
3165                 {
3166                         hullinfo.hullsizes[i][0][0] = SB_ReadFloat (&index);
3167                         hullinfo.hullsizes[i][0][1] = SB_ReadFloat (&index);
3168                         hullinfo.hullsizes[i][0][2] = SB_ReadFloat (&index);
3169                         hullinfo.hullsizes[i][1][0] = SB_ReadFloat (&index);
3170                         hullinfo.hullsizes[i][1][1] = SB_ReadFloat (&index);
3171                         hullinfo.hullsizes[i][1][2] = SB_ReadFloat (&index);
3172                 }
3173
3174         // read lumps
3175                 _header.version = 0;
3176                 for (i = 0; i < HEADER_LUMPS; i++)
3177                 {
3178                         _header.lumps[i].fileofs = SB_ReadInt (&index);
3179                         _header.lumps[i].filelen = SB_ReadInt (&index);
3180                 }
3181
3182                 header = &_header;
3183         }
3184         else
3185         {
3186                 header = (dheader_t *)buffer;
3187
3188                 i = LittleLong(header->version);
3189                 if (i != BSPVERSION && i != 30)
3190                         Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i(Quake) or 30(HalfLife)", mod->name, i, BSPVERSION);
3191                 mod->brush.ishlbsp = i == 30;
3192                 mod->brush.ismcbsp = false;
3193
3194         // fill in hull info
3195                 VectorClear (hullinfo.hullsizes[0][0]);
3196                 VectorClear (hullinfo.hullsizes[0][1]);
3197                 if (mod->brush.ishlbsp)
3198                 {
3199                         hullinfo.numhulls = 4;
3200                         hullinfo.filehulls = 4;
3201                         VectorSet (hullinfo.hullsizes[1][0], -16, -16, -36);
3202                         VectorSet (hullinfo.hullsizes[1][1], 16, 16, 36);
3203                         VectorSet (hullinfo.hullsizes[2][0], -32, -32, -32);
3204                         VectorSet (hullinfo.hullsizes[2][1], 32, 32, 32);
3205                         VectorSet (hullinfo.hullsizes[3][0], -16, -16, -18);
3206                         VectorSet (hullinfo.hullsizes[3][1], 16, 16, 18);
3207                 }
3208                 else
3209                 {
3210                         hullinfo.numhulls = 3;
3211                         hullinfo.filehulls = 4;
3212                         VectorSet (hullinfo.hullsizes[1][0], -16, -16, -24);
3213                         VectorSet (hullinfo.hullsizes[1][1], 16, 16, 32);
3214                         VectorSet (hullinfo.hullsizes[2][0], -32, -32, -24);
3215                         VectorSet (hullinfo.hullsizes[2][1], 32, 32, 64);
3216                 }
3217
3218         // read lumps
3219                 mod_base = (unsigned char*)buffer;
3220                 for (i = 0; i < HEADER_LUMPS; i++)
3221                 {
3222                         header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
3223                         header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
3224                 }
3225         }
3226
3227         mod->soundfromcenter = true;
3228         mod->TraceBox = Mod_Q1BSP_TraceBox;
3229         mod->brush.SuperContentsFromNativeContents = Mod_Q1BSP_SuperContentsFromNativeContents;
3230         mod->brush.NativeContentsFromSuperContents = Mod_Q1BSP_NativeContentsFromSuperContents;
3231         mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
3232         mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
3233         mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
3234         mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
3235         mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
3236         mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
3237         mod->brush.LightPoint = Mod_Q1BSP_LightPoint;
3238         mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
3239         mod->brush.AmbientSoundLevelsForPoint = Mod_Q1BSP_AmbientSoundLevelsForPoint;
3240         mod->brush.RoundUpToHullSize = Mod_Q1BSP_RoundUpToHullSize;
3241         mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
3242
3243         if (loadmodel->isworldmodel)
3244         {
3245                 Cvar_SetValue("halflifebsp", mod->brush.ishlbsp);
3246                 Cvar_SetValue("mcbsp", mod->brush.ismcbsp);
3247         }
3248
3249 // load into heap
3250
3251         // store which lightmap format to use
3252         mod->brushq1.lightmaprgba = r_lightmaprgba.integer;
3253
3254         mod->brush.qw_md4sum = 0;
3255         mod->brush.qw_md4sum2 = 0;
3256         for (i = 0;i < HEADER_LUMPS;i++)
3257         {
3258                 if (i == LUMP_ENTITIES)
3259                         continue;
3260                 mod->brush.qw_md4sum ^= LittleLong(Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen));
3261                 if (i == LUMP_VISIBILITY || i == LUMP_LEAFS || i == LUMP_NODES)
3262                         continue;
3263                 mod->brush.qw_md4sum2 ^= LittleLong(Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen));
3264         }
3265
3266         Mod_Q1BSP_LoadEntities(&header->lumps[LUMP_ENTITIES]);
3267         Mod_Q1BSP_LoadVertexes(&header->lumps[LUMP_VERTEXES]);
3268         Mod_Q1BSP_LoadEdges(&header->lumps[LUMP_EDGES]);
3269         Mod_Q1BSP_LoadSurfedges(&header->lumps[LUMP_SURFEDGES]);
3270         Mod_Q1BSP_LoadTextures(&header->lumps[LUMP_TEXTURES]);
3271         Mod_Q1BSP_LoadLighting(&header->lumps[LUMP_LIGHTING]);
3272         Mod_Q1BSP_LoadPlanes(&header->lumps[LUMP_PLANES]);
3273         Mod_Q1BSP_LoadTexinfo(&header->lumps[LUMP_TEXINFO]);
3274         Mod_Q1BSP_LoadFaces(&header->lumps[LUMP_FACES]);
3275         Mod_Q1BSP_LoadLeaffaces(&header->lumps[LUMP_MARKSURFACES]);
3276         Mod_Q1BSP_LoadVisibility(&header->lumps[LUMP_VISIBILITY]);
3277         // load submodels before leafs because they contain the number of vis leafs
3278         Mod_Q1BSP_LoadSubmodels(&header->lumps[LUMP_MODELS], &hullinfo);
3279         Mod_Q1BSP_LoadLeafs(&header->lumps[LUMP_LEAFS]);
3280         Mod_Q1BSP_LoadNodes(&header->lumps[LUMP_NODES]);
3281         Mod_Q1BSP_LoadClipnodes(&header->lumps[LUMP_CLIPNODES], &hullinfo);
3282
3283         if (!mod->brushq1.lightdata)
3284                 mod->brush.LightPoint = NULL;
3285
3286         if (mod->brushq1.data_compressedpvs)
3287                 Mem_Free(mod->brushq1.data_compressedpvs);
3288         mod->brushq1.data_compressedpvs = NULL;
3289         mod->brushq1.num_compressedpvs = 0;
3290
3291         Mod_Q1BSP_MakeHull0();
3292         Mod_Q1BSP_MakePortals();
3293
3294         mod->numframes = 2;             // regular and alternate animation
3295         mod->numskins = 1;
3296
3297         mainmempool = mod->mempool;
3298
3299         // make a single combined shadow mesh to allow optimized shadow volume creation
3300         numshadowmeshtriangles = 0;
3301         for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3302         {
3303                 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
3304                 numshadowmeshtriangles += surface->num_triangles;
3305         }
3306         loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
3307         for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3308                 Mod_ShadowMesh_AddMesh(loadmodel->mempool, loadmodel->brush.shadowmesh, NULL, NULL, NULL, loadmodel->surfmesh.data_vertex3f, NULL, NULL, NULL, NULL, surface->num_triangles, (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle));
3309         loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true);
3310         Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
3311
3312         if (loadmodel->brush.numsubmodels)
3313                 loadmodel->brush.submodels = (model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(model_t *));
3314
3315         if (loadmodel->isworldmodel)
3316         {
3317                 // clear out any stale submodels or worldmodels lying around
3318                 // if we did this clear before now, an error might abort loading and
3319                 // leave things in a bad state
3320                 Mod_RemoveStaleWorldModels(loadmodel);
3321         }
3322
3323         // LordHavoc: to clear the fog around the original quake submodel code, I
3324         // will explain:
3325         // first of all, some background info on the submodels:
3326         // model 0 is the map model (the world, named maps/e1m1.bsp for example)
3327         // model 1 and higher are submodels (doors and the like, named *1, *2, etc)
3328         // now the weird for loop itself:
3329         // the loop functions in an odd way, on each iteration it sets up the
3330         // current 'mod' model (which despite the confusing code IS the model of
3331         // the number i), at the end of the loop it duplicates the model to become
3332         // the next submodel, and loops back to set up the new submodel.
3333
3334         // LordHavoc: now the explanation of my sane way (which works identically):
3335         // set up the world model, then on each submodel copy from the world model
3336         // and set up the submodel with the respective model info.
3337         for (i = 0;i < mod->brush.numsubmodels;i++)
3338         {
3339                 // LordHavoc: this code was originally at the end of this loop, but
3340                 // has been transformed to something more readable at the start here.
3341
3342                 if (i > 0)
3343                 {
3344                         char name[10];
3345                         // LordHavoc: only register submodels if it is the world
3346                         // (prevents external bsp models from replacing world submodels with
3347                         //  their own)
3348                         if (!loadmodel->isworldmodel)
3349                                 continue;
3350                         // duplicate the basic information
3351                         sprintf(name, "*%i", i);
3352                         mod = Mod_FindName(name);
3353