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