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