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