Fix alpha transparent textures (used by HLBSP maps) in HL/Q1 BSP maps
[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 r_novis = {0, "r_novis", "0", "draws whole level, see also sv_cullentities_pvs 0"};
32 cvar_t r_picmipworld = {CVAR_SAVE, "r_picmipworld", "1", "whether gl_picmip shall apply to world textures too"};
33 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)"};
34 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)"};
35 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)"};
36 cvar_t r_subdivisions_maxtess = {0, "r_subdivisions_maxtess", "1024", "maximum number of subdivisions (prevents curves beyond a certain detail level, limits smoothing)"};
37 cvar_t r_subdivisions_maxvertices = {0, "r_subdivisions_maxvertices", "65536", "maximum vertices allowed per subdivided curve"};
38 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)"};
39 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)"};
40 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)"};
41 cvar_t r_subdivisions_collision_maxvertices = {0, "r_subdivisions_collision_maxvertices", "4225", "maximum vertices allowed per subdivided curve"};
42 cvar_t mod_q3bsp_curves_collisions = {0, "mod_q3bsp_curves_collisions", "1", "enables collisions with curves (SLOW)"};
43 cvar_t mod_q3bsp_optimizedtraceline = {0, "mod_q3bsp_optimizedtraceline", "1", "whether to use optimized traceline code for line traces (as opposed to tracebox code)"};
44 cvar_t mod_q3bsp_debugtracebrush = {0, "mod_q3bsp_debugtracebrush", "0", "selects different tracebrush bsp recursion algorithms (for debugging purposes only)"};
45 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, ..."};
46 cvar_t mod_q3bsp_nolightmaps = {CVAR_SAVE, "mod_q3bsp_nolightmaps", "0", "do not load lightmaps in Q3BSP maps (to save video RAM, but be warned: it looks ugly)"};
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(&r_novis);
59         Cvar_RegisterVariable(&r_picmipworld);
60         Cvar_RegisterVariable(&r_nosurftextures);
61         Cvar_RegisterVariable(&r_subdivisions_tolerance);
62         Cvar_RegisterVariable(&r_subdivisions_mintess);
63         Cvar_RegisterVariable(&r_subdivisions_maxtess);
64         Cvar_RegisterVariable(&r_subdivisions_maxvertices);
65         Cvar_RegisterVariable(&r_subdivisions_collision_tolerance);
66         Cvar_RegisterVariable(&r_subdivisions_collision_mintess);
67         Cvar_RegisterVariable(&r_subdivisions_collision_maxtess);
68         Cvar_RegisterVariable(&r_subdivisions_collision_maxvertices);
69         Cvar_RegisterVariable(&mod_q3bsp_curves_collisions);
70         Cvar_RegisterVariable(&mod_q3bsp_optimizedtraceline);
71         Cvar_RegisterVariable(&mod_q3bsp_debugtracebrush);
72         Cvar_RegisterVariable(&mod_q3bsp_lightmapmergepower);
73         Cvar_RegisterVariable(&mod_q3bsp_nolightmaps);
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(dp_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(dp_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(dp_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(dp_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(dp_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(dp_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         dp_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(dp_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(dp_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(dp_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         mclipnode_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         mplane_t *plane;
787         mclipnode_t *nodes = t->hull->clipnodes;
788         mplane_t *planes = t->hull->planes;
789         vec3_t point;
790         VectorCopy(t->start, point);
791         while (num >= 0)
792         {
793                 plane = planes + nodes[num].planenum;
794                 num = nodes[num].children[(plane->type < 3 ? point[plane->type] : DotProduct(plane->normal, point)) < plane->dist];
795         }
796         num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
797         t->trace->startsupercontents |= num;
798         if (num & SUPERCONTENTS_LIQUIDSMASK)
799                 t->trace->inwater = true;
800         if (num == 0)
801                 t->trace->inopen = true;
802         if (num & t->trace->hitsupercontentsmask)
803         {
804                 t->trace->allsolid = t->trace->startsolid = true;
805                 return HULLCHECKSTATE_SOLID;
806         }
807         else
808         {
809                 t->trace->allsolid = t->trace->startsolid = false;
810                 return HULLCHECKSTATE_EMPTY;
811         }
812 }
813 //#endif
814
815 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)
816 {
817         // this function currently only supports same size start and end
818         double boxsize[3];
819         RecursiveHullCheckTraceInfo_t rhc;
820
821         memset(&rhc, 0, sizeof(rhc));
822         memset(trace, 0, sizeof(trace_t));
823         rhc.trace = trace;
824         rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
825         rhc.trace->fraction = 1;
826         rhc.trace->realfraction = 1;
827         rhc.trace->allsolid = true;
828         VectorSubtract(boxmaxs, boxmins, boxsize);
829         if (boxsize[0] < 3)
830                 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
831         else if (model->brush.ishlbsp)
832         {
833                 // LordHavoc: this has to have a minor tolerance (the .1) because of
834                 // minor float precision errors from the box being transformed around
835                 if (boxsize[0] < 32.1)
836                 {
837                         if (boxsize[2] < 54) // pick the nearest of 36 or 72
838                                 rhc.hull = &model->brushq1.hulls[3]; // 32x32x36
839                         else
840                                 rhc.hull = &model->brushq1.hulls[1]; // 32x32x72
841                 }
842                 else
843                         rhc.hull = &model->brushq1.hulls[2]; // 64x64x64
844         }
845         else
846         {
847                 // LordHavoc: this has to have a minor tolerance (the .1) because of
848                 // minor float precision errors from the box being transformed around
849                 if (boxsize[0] < 32.1)
850                         rhc.hull = &model->brushq1.hulls[1]; // 32x32x56
851                 else
852                         rhc.hull = &model->brushq1.hulls[2]; // 64x64x88
853         }
854         VectorMAMAM(1, start, 1, boxmins, -1, rhc.hull->clip_mins, rhc.start);
855         VectorMAMAM(1, end, 1, boxmins, -1, rhc.hull->clip_mins, rhc.end);
856         VectorSubtract(rhc.end, rhc.start, rhc.dist);
857 #if COLLISIONPARANOID >= 2
858         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]);
859         Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
860         {
861
862                 double test[3];
863                 trace_t testtrace;
864                 VectorLerp(rhc.start, rhc.trace->fraction, rhc.end, test);
865                 memset(&testtrace, 0, sizeof(trace_t));
866                 rhc.trace = &testtrace;
867                 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
868                 rhc.trace->fraction = 1;
869                 rhc.trace->realfraction = 1;
870                 rhc.trace->allsolid = true;
871                 VectorCopy(test, rhc.start);
872                 VectorCopy(test, rhc.end);
873                 VectorClear(rhc.dist);
874                 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
875                 //Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, test, test);
876                 if (!trace->startsolid && testtrace.startsolid)
877                         Con_Printf(" - ended in solid!\n");
878         }
879         Con_Print("\n");
880 #else
881         if (VectorLength2(rhc.dist))
882                 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
883         else
884                 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
885 #endif
886 }
887
888 static int Mod_Q1BSP_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
889 {
890         int num = model->brushq1.hulls[0].firstclipnode;
891         mplane_t *plane;
892         mclipnode_t *nodes = model->brushq1.hulls[0].clipnodes;
893         mplane_t *planes = model->brushq1.hulls[0].planes;
894         while (num >= 0)
895         {
896                 plane = planes + nodes[num].planenum;
897                 num = nodes[num].children[(plane->type < 3 ? point[plane->type] : DotProduct(plane->normal, point)) < plane->dist];
898         }
899         return Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
900 }
901
902 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)
903 {
904 #if 1
905         colbrushf_t cbox;
906         colplanef_t cbox_planes[6];
907         cbox.supercontents = boxsupercontents;
908         cbox.numplanes = 6;
909         cbox.numpoints = 0;
910         cbox.numtriangles = 0;
911         cbox.planes = cbox_planes;
912         cbox.points = NULL;
913         cbox.elements = NULL;
914         cbox.markframe = 0;
915         cbox.mins[0] = 0;
916         cbox.mins[1] = 0;
917         cbox.mins[2] = 0;
918         cbox.maxs[0] = 0;
919         cbox.maxs[1] = 0;
920         cbox.maxs[2] = 0;
921         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];
922         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];
923         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];
924         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];
925         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];
926         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];
927         cbox_planes[0].q3surfaceflags = boxq3surfaceflags;cbox_planes[0].texture = boxtexture;
928         cbox_planes[1].q3surfaceflags = boxq3surfaceflags;cbox_planes[1].texture = boxtexture;
929         cbox_planes[2].q3surfaceflags = boxq3surfaceflags;cbox_planes[2].texture = boxtexture;
930         cbox_planes[3].q3surfaceflags = boxq3surfaceflags;cbox_planes[3].texture = boxtexture;
931         cbox_planes[4].q3surfaceflags = boxq3surfaceflags;cbox_planes[4].texture = boxtexture;
932         cbox_planes[5].q3surfaceflags = boxq3surfaceflags;cbox_planes[5].texture = boxtexture;
933         memset(trace, 0, sizeof(trace_t));
934         trace->hitsupercontentsmask = hitsupercontentsmask;
935         trace->fraction = 1;
936         trace->realfraction = 1;
937         Collision_TraceLineBrushFloat(trace, start, end, &cbox, &cbox);
938 #else
939         RecursiveHullCheckTraceInfo_t rhc;
940         static hull_t box_hull;
941         static mclipnode_t box_clipnodes[6];
942         static mplane_t box_planes[6];
943         // fill in a default trace
944         memset(&rhc, 0, sizeof(rhc));
945         memset(trace, 0, sizeof(trace_t));
946         //To keep everything totally uniform, bounding boxes are turned into small
947         //BSP trees instead of being compared directly.
948         // create a temp hull from bounding box sizes
949         box_planes[0].dist = cmaxs[0] - mins[0];
950         box_planes[1].dist = cmins[0] - maxs[0];
951         box_planes[2].dist = cmaxs[1] - mins[1];
952         box_planes[3].dist = cmins[1] - maxs[1];
953         box_planes[4].dist = cmaxs[2] - mins[2];
954         box_planes[5].dist = cmins[2] - maxs[2];
955 #if COLLISIONPARANOID >= 3
956         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]);
957 #endif
958
959         if (box_hull.clipnodes == NULL)
960         {
961                 int i, side;
962
963                 //Set up the planes and clipnodes so that the six floats of a bounding box
964                 //can just be stored out and get a proper hull_t structure.
965
966                 box_hull.clipnodes = box_clipnodes;
967                 box_hull.planes = box_planes;
968                 box_hull.firstclipnode = 0;
969                 box_hull.lastclipnode = 5;
970
971                 for (i = 0;i < 6;i++)
972                 {
973                         box_clipnodes[i].planenum = i;
974
975                         side = i&1;
976
977                         box_clipnodes[i].children[side] = CONTENTS_EMPTY;
978                         if (i != 5)
979                                 box_clipnodes[i].children[side^1] = i + 1;
980                         else
981                                 box_clipnodes[i].children[side^1] = CONTENTS_SOLID;
982
983                         box_planes[i].type = i>>1;
984                         box_planes[i].normal[i>>1] = 1;
985                 }
986         }
987
988         // trace a line through the generated clipping hull
989         //rhc.boxsupercontents = boxsupercontents;
990         rhc.hull = &box_hull;
991         rhc.trace = trace;
992         rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
993         rhc.trace->fraction = 1;
994         rhc.trace->realfraction = 1;
995         rhc.trace->allsolid = true;
996         VectorCopy(start, rhc.start);
997         VectorCopy(end, rhc.end);
998         VectorSubtract(rhc.end, rhc.start, rhc.dist);
999         Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
1000         //VectorMA(rhc.start, rhc.trace->fraction, rhc.dist, rhc.trace->endpos);
1001         if (rhc.trace->startsupercontents)
1002                 rhc.trace->startsupercontents = boxsupercontents;
1003 #endif
1004 }
1005
1006 static int Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(mnode_t *node, double p1[3], double p2[3])
1007 {
1008         double t1, t2;
1009         double midf, mid[3];
1010         int ret, side;
1011
1012         // check for empty
1013         while (node->plane)
1014         {
1015                 // find the point distances
1016                 mplane_t *plane = node->plane;
1017                 if (plane->type < 3)
1018                 {
1019                         t1 = p1[plane->type] - plane->dist;
1020                         t2 = p2[plane->type] - plane->dist;
1021                 }
1022                 else
1023                 {
1024                         t1 = DotProduct (plane->normal, p1) - plane->dist;
1025                         t2 = DotProduct (plane->normal, p2) - plane->dist;
1026                 }
1027
1028                 if (t1 < 0)
1029                 {
1030                         if (t2 < 0)
1031                         {
1032                                 node = node->children[1];
1033                                 continue;
1034                         }
1035                         side = 1;
1036                 }
1037                 else
1038                 {
1039                         if (t2 >= 0)
1040                         {
1041                                 node = node->children[0];
1042                                 continue;
1043                         }
1044                         side = 0;
1045                 }
1046
1047                 midf = t1 / (t1 - t2);
1048                 VectorLerp(p1, midf, p2, mid);
1049
1050                 // recurse both sides, front side first
1051                 // return 2 if empty is followed by solid (hit something)
1052                 // do not return 2 if both are solid or both empty,
1053                 // or if start is solid and end is empty
1054                 // as these degenerate cases usually indicate the eye is in solid and
1055                 // should see the target point anyway
1056                 ret = Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side    ], p1, mid);
1057                 if (ret != 0)
1058                         return ret;
1059                 ret = Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ^ 1], mid, p2);
1060                 if (ret != 1)
1061                         return ret;
1062                 return 2;
1063         }
1064         return ((mleaf_t *)node)->clusterindex < 0;
1065 }
1066
1067 static qboolean Mod_Q1BSP_TraceLineOfSight(struct model_s *model, const vec3_t start, const vec3_t end)
1068 {
1069         // this function currently only supports same size start and end
1070         double tracestart[3], traceend[3];
1071         VectorCopy(start, tracestart);
1072         VectorCopy(end, traceend);
1073         return Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(model->brush.data_nodes, tracestart, traceend) != 2;
1074 }
1075
1076 static int Mod_Q1BSP_LightPoint_RecursiveBSPNode(dp_model_t *model, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal, const mnode_t *node, float x, float y, float startz, float endz)
1077 {
1078         int side;
1079         float front, back;
1080         float mid, distz = endz - startz;
1081
1082 loc0:
1083         if (!node->plane)
1084                 return false;           // didn't hit anything
1085
1086         switch (node->plane->type)
1087         {
1088         case PLANE_X:
1089                 node = node->children[x < node->plane->dist];
1090                 goto loc0;
1091         case PLANE_Y:
1092                 node = node->children[y < node->plane->dist];
1093                 goto loc0;
1094         case PLANE_Z:
1095                 side = startz < node->plane->dist;
1096                 if ((endz < node->plane->dist) == side)
1097                 {
1098                         node = node->children[side];
1099                         goto loc0;
1100                 }
1101                 // found an intersection
1102                 mid = node->plane->dist;
1103                 break;
1104         default:
1105                 back = front = x * node->plane->normal[0] + y * node->plane->normal[1];
1106                 front += startz * node->plane->normal[2];
1107                 back += endz * node->plane->normal[2];
1108                 side = front < node->plane->dist;
1109                 if ((back < node->plane->dist) == side)
1110                 {
1111                         node = node->children[side];
1112                         goto loc0;
1113                 }
1114                 // found an intersection
1115                 mid = startz + distz * (front - node->plane->dist) / (front - back);
1116                 break;
1117         }
1118
1119         // go down front side
1120         if (node->children[side]->plane && Mod_Q1BSP_LightPoint_RecursiveBSPNode(model, ambientcolor, diffusecolor, diffusenormal, node->children[side], x, y, startz, mid))
1121                 return true;    // hit something
1122         else
1123         {
1124                 // check for impact on this node
1125                 if (node->numsurfaces)
1126                 {
1127                         int i, dsi, dti, lmwidth, lmheight;
1128                         float ds, dt;
1129                         msurface_t *surface;
1130                         unsigned char *lightmap;
1131                         int maps, line3, size3;
1132                         float dsfrac;
1133                         float dtfrac;
1134                         float scale, w, w00, w01, w10, w11;
1135
1136                         surface = model->data_surfaces + node->firstsurface;
1137                         for (i = 0;i < node->numsurfaces;i++, surface++)
1138                         {
1139                                 if (!(surface->texture->basematerialflags & MATERIALFLAG_WALL) || !surface->lightmapinfo->samples)
1140                                         continue;       // no lightmaps
1141
1142                                 // location we want to sample in the lightmap
1143                                 ds = ((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]) * 0.0625f;
1144                                 dt = ((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]) * 0.0625f;
1145
1146                                 // check the bounds
1147                                 dsi = (int)ds;
1148                                 dti = (int)dt;
1149                                 lmwidth = ((surface->lightmapinfo->extents[0]>>4)+1);
1150                                 lmheight = ((surface->lightmapinfo->extents[1]>>4)+1);
1151
1152                                 // is it in bounds?
1153                                 if (dsi >= 0 && dsi < lmwidth-1 && dti >= 0 && dti < lmheight-1)
1154                                 {
1155                                         // calculate bilinear interpolation factors
1156                                         // and also multiply by fixedpoint conversion factors
1157                                         dsfrac = ds - dsi;
1158                                         dtfrac = dt - dti;
1159                                         w00 = (1 - dsfrac) * (1 - dtfrac) * (1.0f / 32768.0f);
1160                                         w01 = (    dsfrac) * (1 - dtfrac) * (1.0f / 32768.0f);
1161                                         w10 = (1 - dsfrac) * (    dtfrac) * (1.0f / 32768.0f);
1162                                         w11 = (    dsfrac) * (    dtfrac) * (1.0f / 32768.0f);
1163
1164                                         // values for pointer math
1165                                         line3 = lmwidth * 3; // LordHavoc: *3 for colored lighting
1166                                         size3 = lmwidth * lmheight * 3; // LordHavoc: *3 for colored lighting
1167
1168                                         // look up the pixel
1169                                         lightmap = surface->lightmapinfo->samples + dti * line3 + dsi*3; // LordHavoc: *3 for colored lighting
1170
1171                                         // bilinear filter each lightmap style, and sum them
1172                                         for (maps = 0;maps < MAXLIGHTMAPS && surface->lightmapinfo->styles[maps] != 255;maps++)
1173                                         {
1174                                                 scale = r_refdef.scene.lightstylevalue[surface->lightmapinfo->styles[maps]];
1175                                                 w = w00 * scale;VectorMA(ambientcolor, w, lightmap            , ambientcolor);
1176                                                 w = w01 * scale;VectorMA(ambientcolor, w, lightmap + 3        , ambientcolor);
1177                                                 w = w10 * scale;VectorMA(ambientcolor, w, lightmap + line3    , ambientcolor);
1178                                                 w = w11 * scale;VectorMA(ambientcolor, w, lightmap + line3 + 3, ambientcolor);
1179                                                 lightmap += size3;
1180                                         }
1181
1182                                         return true; // success
1183                                 }
1184                         }
1185                 }
1186
1187                 // go down back side
1188                 node = node->children[side ^ 1];
1189                 startz = mid;
1190                 distz = endz - startz;
1191                 goto loc0;
1192         }
1193 }
1194
1195 void Mod_Q1BSP_LightPoint(dp_model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
1196 {
1197         // pretend lighting is coming down from above (due to lack of a lightgrid to know primary lighting direction)
1198         VectorSet(diffusenormal, 0, 0, 1);
1199
1200         if (!model->brushq1.lightdata)
1201         {
1202                 VectorSet(ambientcolor, 1, 1, 1);
1203                 VectorSet(diffusecolor, 0, 0, 0);
1204                 return;
1205         }
1206
1207         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);
1208 }
1209
1210 static void Mod_Q1BSP_DecompressVis(const unsigned char *in, const unsigned char *inend, unsigned char *out, unsigned char *outend)
1211 {
1212         int c;
1213         unsigned char *outstart = out;
1214         while (out < outend)
1215         {
1216                 if (in == inend)
1217                 {
1218                         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));
1219                         return;
1220                 }
1221                 c = *in++;
1222                 if (c)
1223                         *out++ = c;
1224                 else
1225                 {
1226                         if (in == inend)
1227                         {
1228                                 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));
1229                                 return;
1230                         }
1231                         for (c = *in++;c > 0;c--)
1232                         {
1233                                 if (out == outend)
1234                                 {
1235                                         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));
1236                                         return;
1237                                 }
1238                                 *out++ = 0;
1239                         }
1240                 }
1241         }
1242 }
1243
1244 /*
1245 =============
1246 R_Q1BSP_LoadSplitSky
1247
1248 A sky texture is 256*128, with the right side being a masked overlay
1249 ==============
1250 */
1251 void R_Q1BSP_LoadSplitSky (unsigned char *src, int width, int height, int bytesperpixel)
1252 {
1253         int i, j;
1254         unsigned solidpixels[128*128], alphapixels[128*128];
1255
1256         // allocate a texture pool if we need it
1257         if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
1258                 loadmodel->texturepool = R_AllocTexturePool();
1259
1260         if (bytesperpixel == 4)
1261         {
1262                 for (i = 0;i < 128;i++)
1263                 {
1264                         for (j = 0;j < 128;j++)
1265                         {
1266                                 solidpixels[(i*128) + j] = ((unsigned *)src)[i*256+j+128];
1267                                 alphapixels[(i*128) + j] = ((unsigned *)src)[i*256+j];
1268                         }
1269                 }
1270         }
1271         else
1272         {
1273                 // make an average value for the back to avoid
1274                 // a fringe on the top level
1275                 int p, r, g, b;
1276                 union
1277                 {
1278                         unsigned int i;
1279                         unsigned char b[4];
1280                 }
1281                 bgra;
1282                 r = g = b = 0;
1283                 for (i = 0;i < 128;i++)
1284                 {
1285                         for (j = 0;j < 128;j++)
1286                         {
1287                                 p = src[i*256 + j + 128];
1288                                 r += palette_rgb[p][0];
1289                                 g += palette_rgb[p][1];
1290                                 b += palette_rgb[p][2];
1291                         }
1292                 }
1293                 bgra.b[2] = r/(128*128);
1294                 bgra.b[1] = g/(128*128);
1295                 bgra.b[0] = b/(128*128);
1296                 bgra.b[3] = 0;
1297                 for (i = 0;i < 128;i++)
1298                 {
1299                         for (j = 0;j < 128;j++)
1300                         {
1301                                 solidpixels[(i*128) + j] = palette_bgra_complete[src[i*256 + j + 128]];
1302                                 p = src[i*256 + j];
1303                                 alphapixels[(i*128) + j] = p ? palette_bgra_complete[p] : bgra.i;
1304                         }
1305                 }
1306         }
1307
1308         loadmodel->brush.solidskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_solidtexture", 128, 128, (unsigned char *) solidpixels, TEXTYPE_BGRA, TEXF_PRECACHE, NULL);
1309         loadmodel->brush.alphaskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_alphatexture", 128, 128, (unsigned char *) alphapixels, TEXTYPE_BGRA, TEXF_ALPHA | TEXF_PRECACHE, NULL);
1310 }
1311
1312 static void Mod_Q1BSP_LoadTextures(lump_t *l)
1313 {
1314         int i, j, k, num, max, altmax, mtwidth, mtheight, *dofs, incomplete;
1315         skinframe_t *skinframe;
1316         miptex_t *dmiptex;
1317         texture_t *tx, *tx2, *anims[10], *altanims[10];
1318         dmiptexlump_t *m;
1319         unsigned char *data, *mtdata;
1320         const char *s;
1321         char mapname[MAX_QPATH], name[MAX_QPATH];
1322         unsigned char zero[4];
1323
1324         memset(zero, 0, sizeof(zero));
1325
1326         loadmodel->data_textures = NULL;
1327
1328         // add two slots for notexture walls and notexture liquids
1329         if (l->filelen)
1330         {
1331                 m = (dmiptexlump_t *)(mod_base + l->fileofs);
1332                 m->nummiptex = LittleLong (m->nummiptex);
1333                 loadmodel->num_textures = m->nummiptex + 2;
1334                 loadmodel->num_texturesperskin = loadmodel->num_textures;
1335         }
1336         else
1337         {
1338                 m = NULL;
1339                 loadmodel->num_textures = 2;
1340                 loadmodel->num_texturesperskin = loadmodel->num_textures;
1341         }
1342
1343         loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_textures * sizeof(texture_t));
1344
1345         // fill out all slots with notexture
1346         if (cls.state != ca_dedicated)
1347                 skinframe = R_SkinFrame_LoadMissing();
1348         else
1349                 skinframe = NULL;
1350         for (i = 0, tx = loadmodel->data_textures;i < loadmodel->num_textures;i++, tx++)
1351         {
1352                 strlcpy(tx->name, "NO TEXTURE FOUND", sizeof(tx->name));
1353                 tx->width = 16;
1354                 tx->height = 16;
1355                 if (cls.state != ca_dedicated)
1356                 {
1357                         tx->numskinframes = 1;
1358                         tx->skinframerate = 1;
1359                         tx->skinframes[0] = skinframe;
1360                         tx->currentskinframe = tx->skinframes[0];
1361                         tx->basematerialflags = 0;
1362                 }
1363                 tx->basematerialflags = MATERIALFLAG_WALL;
1364                 if (i == loadmodel->num_textures - 1)
1365                 {
1366                         tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1367                         tx->supercontents = mod_q1bsp_texture_water.supercontents;
1368                         tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1369                 }
1370                 else
1371                 {
1372                         tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1373                         tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1374                 }
1375                 tx->currentframe = tx;
1376
1377                 // clear water settings
1378                 tx->reflectmin = 0;
1379                 tx->reflectmax = 1;
1380                 tx->refractfactor = 1;
1381                 Vector4Set(tx->refractcolor4f, 1, 1, 1, 1);
1382                 tx->reflectfactor = 1;
1383                 Vector4Set(tx->reflectcolor4f, 1, 1, 1, 1);
1384                 tx->r_water_wateralpha = 1;
1385         }
1386
1387         if (!m)
1388         {
1389                 Con_Printf("%s: no miptex lump to load textures from\n", loadmodel->name);
1390                 return;
1391         }
1392
1393         s = loadmodel->name;
1394         if (!strncasecmp(s, "maps/", 5))
1395                 s += 5;
1396         FS_StripExtension(s, mapname, sizeof(mapname));
1397
1398         // just to work around bounds checking when debugging with it (array index out of bounds error thing)
1399         dofs = m->dataofs;
1400         // LordHavoc: mostly rewritten map texture loader
1401         for (i = 0;i < m->nummiptex;i++)
1402         {
1403                 dofs[i] = LittleLong(dofs[i]);
1404                 if (r_nosurftextures.integer)
1405                         continue;
1406                 if (dofs[i] == -1)
1407                 {
1408                         Con_DPrintf("%s: miptex #%i missing\n", loadmodel->name, i);
1409                         continue;
1410                 }
1411                 dmiptex = (miptex_t *)((unsigned char *)m + dofs[i]);
1412
1413                 // copy name, but only up to 16 characters
1414                 // (the output buffer can hold more than this, but the input buffer is
1415                 //  only 16)
1416                 for (j = 0;j < 16 && dmiptex->name[j];j++)
1417                         name[j] = dmiptex->name[j];
1418                 name[j] = 0;
1419
1420                 if (!name[0])
1421                 {
1422                         dpsnprintf(name, sizeof(name), "unnamed%i", i);
1423                         Con_DPrintf("%s: warning: renaming unnamed texture to %s\n", loadmodel->name, name);
1424                 }
1425
1426                 mtwidth = LittleLong(dmiptex->width);
1427                 mtheight = LittleLong(dmiptex->height);
1428                 mtdata = NULL;
1429                 j = LittleLong(dmiptex->offsets[0]);
1430                 if (j)
1431                 {
1432                         // texture included
1433                         if (j < 40 || j + mtwidth * mtheight > l->filelen)
1434                         {
1435                                 Con_Printf("%s: Texture \"%s\" is corrupt or incomplete\n", loadmodel->name, dmiptex->name);
1436                                 continue;
1437                         }
1438                         mtdata = (unsigned char *)dmiptex + j;
1439                 }
1440
1441                 if ((mtwidth & 15) || (mtheight & 15))
1442                         Con_DPrintf("%s: warning: texture \"%s\" is not 16 aligned\n", loadmodel->name, dmiptex->name);
1443
1444                 // LordHavoc: force all names to lowercase
1445                 for (j = 0;name[j];j++)
1446                         if (name[j] >= 'A' && name[j] <= 'Z')
1447                                 name[j] += 'a' - 'A';
1448
1449                 if (dmiptex->name[0] && Mod_LoadTextureFromQ3Shader(loadmodel->data_textures + i, name, false, false, 0))
1450                         continue;
1451
1452                 tx = loadmodel->data_textures + i;
1453                 strlcpy(tx->name, name, sizeof(tx->name));
1454                 tx->width = mtwidth;
1455                 tx->height = mtheight;
1456
1457                 if (tx->name[0] == '*')
1458                 {
1459                         if (!strncmp(tx->name, "*lava", 5))
1460                         {
1461                                 tx->supercontents = mod_q1bsp_texture_lava.supercontents;
1462                                 tx->surfaceflags = mod_q1bsp_texture_lava.surfaceflags;
1463                         }
1464                         else if (!strncmp(tx->name, "*slime", 6))
1465                         {
1466                                 tx->supercontents = mod_q1bsp_texture_slime.supercontents;
1467                                 tx->surfaceflags = mod_q1bsp_texture_slime.surfaceflags;
1468                         }
1469                         else
1470                         {
1471                                 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1472                                 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1473                         }
1474                 }
1475                 else if (!strncmp(tx->name, "sky", 3))
1476                 {
1477                         tx->supercontents = mod_q1bsp_texture_sky.supercontents;
1478                         tx->surfaceflags = mod_q1bsp_texture_sky.surfaceflags;
1479                 }
1480                 else
1481                 {
1482                         tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1483                         tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1484                 }
1485
1486                 if (cls.state != ca_dedicated)
1487                 {
1488                         // LordHavoc: HL sky textures are entirely different than quake
1489                         if (!loadmodel->brush.ishlbsp && !strncmp(tx->name, "sky", 3) && mtwidth == 256 && mtheight == 128)
1490                         {
1491                                 if (loadmodel->isworldmodel)
1492                                 {
1493                                         data = loadimagepixelsbgra(tx->name, false, false);
1494                                         if (data && image_width == 256 && image_height == 128)
1495                                         {
1496                                                 R_Q1BSP_LoadSplitSky(data, image_width, image_height, 4);
1497                                                 Mem_Free(data);
1498                                         }
1499                                         else if (mtdata != NULL)
1500                                                 R_Q1BSP_LoadSplitSky(mtdata, mtwidth, mtheight, 1);
1501                                 }
1502                         }
1503                         else
1504                         {
1505                                 skinframe = R_SkinFrame_LoadExternal(gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s/%s", mapname, tx->name), TEXF_ALPHA | TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0) | TEXF_COMPRESS, false);
1506                                 if (!skinframe)
1507                                         skinframe = R_SkinFrame_LoadExternal(gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s", tx->name), TEXF_ALPHA | TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0) | TEXF_COMPRESS, false);
1508                                 if (!skinframe)
1509                                 {
1510                                         // did not find external texture, load it from the bsp or wad3
1511                                         if (loadmodel->brush.ishlbsp)
1512                                         {
1513                                                 // internal texture overrides wad
1514                                                 unsigned char *pixels, *freepixels;
1515                                                 pixels = freepixels = NULL;
1516                                                 if (mtdata)
1517                                                         pixels = W_ConvertWAD3TextureBGRA(dmiptex);
1518                                                 if (pixels == NULL)
1519                                                         pixels = freepixels = W_GetTextureBGRA(tx->name);
1520                                                 if (pixels != NULL)
1521                                                 {
1522                                                         tx->width = image_width;
1523                                                         tx->height = image_height;
1524                                                         skinframe = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_ALPHA | TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0), pixels, image_width, image_height);
1525                                                 }
1526                                                 if (freepixels)
1527                                                         Mem_Free(freepixels);
1528                                         }
1529                                         else if (mtdata) // texture included
1530                                                 skinframe = R_SkinFrame_LoadInternalQuake(tx->name, TEXF_ALPHA | TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0), false, r_fullbrights.integer, mtdata, tx->width, tx->height);
1531                                 }
1532                                 // if skinframe is still NULL the "missing" texture will be used
1533                                 if (skinframe)
1534                                         tx->skinframes[0] = skinframe;
1535                         }
1536
1537                         tx->basematerialflags = MATERIALFLAG_WALL;
1538                         if (tx->name[0] == '*')
1539                         {
1540                                 // LordHavoc: some turbulent textures should not be affected by wateralpha
1541                                 if (!strncmp(tx->name, "*glassmirror", 12)) // Tenebrae
1542                                 {
1543                                         // replace the texture with transparent black
1544                                         Vector4Set(zero, 128, 128, 128, 128);
1545                                         tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_MIPMAP | TEXF_PRECACHE | TEXF_ALPHA, zero, 1, 1);
1546                                         tx->basematerialflags |= MATERIALFLAG_NOSHADOW | MATERIALFLAG_ADD | MATERIALFLAG_BLENDED | MATERIALFLAG_REFLECTION;
1547                                 }
1548                                 else if (!strncmp(tx->name,"*lava",5)
1549                                  || !strncmp(tx->name,"*teleport",9)
1550                                  || !strncmp(tx->name,"*rift",5)) // Scourge of Armagon texture
1551                                         tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1552                                 else
1553                                         tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW | MATERIALFLAG_WATERALPHA | MATERIALFLAG_WATERSHADER;
1554                                 if (tx->skinframes[0] && tx->skinframes[0]->fog)
1555                                         tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1556                         }
1557                         else if (!strncmp(tx->name, "mirror", 6)) // Tenebrae
1558                         {
1559                                 // replace the texture with black
1560                                 tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_PRECACHE, zero, 1, 1);
1561                                 tx->basematerialflags |= MATERIALFLAG_REFLECTION;
1562                         }
1563                         else if (!strncmp(tx->name, "sky", 3))
1564                                 tx->basematerialflags = MATERIALFLAG_SKY | MATERIALFLAG_NOSHADOW;
1565                         else if (!strcmp(tx->name, "caulk"))
1566                                 tx->basematerialflags = MATERIALFLAG_NODRAW;
1567                         else if (tx->skinframes[0] && tx->skinframes[0]->fog)
1568                                 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1569
1570                         // start out with no animation
1571                         tx->currentframe = tx;
1572                         tx->currentskinframe = tx->skinframes[0];
1573                 }
1574         }
1575
1576         // sequence the animations
1577         for (i = 0;i < m->nummiptex;i++)
1578         {
1579                 tx = loadmodel->data_textures + i;
1580                 if (!tx || tx->name[0] != '+' || tx->name[1] == 0 || tx->name[2] == 0)
1581                         continue;
1582                 if (tx->anim_total[0] || tx->anim_total[1])
1583                         continue;       // already sequenced
1584
1585                 // find the number of frames in the animation
1586                 memset(anims, 0, sizeof(anims));
1587                 memset(altanims, 0, sizeof(altanims));
1588
1589                 for (j = i;j < m->nummiptex;j++)
1590                 {
1591                         tx2 = loadmodel->data_textures + j;
1592                         if (!tx2 || tx2->name[0] != '+' || strcmp(tx2->name+2, tx->name+2))
1593                                 continue;
1594
1595                         num = tx2->name[1];
1596                         if (num >= '0' && num <= '9')
1597                                 anims[num - '0'] = tx2;
1598                         else if (num >= 'a' && num <= 'j')
1599                                 altanims[num - 'a'] = tx2;
1600                         else
1601                                 Con_Printf("Bad animating texture %s\n", tx->name);
1602                 }
1603
1604                 max = altmax = 0;
1605                 for (j = 0;j < 10;j++)
1606                 {
1607                         if (anims[j])
1608                                 max = j + 1;
1609                         if (altanims[j])
1610                                 altmax = j + 1;
1611                 }
1612                 //Con_Printf("linking animation %s (%i:%i frames)\n\n", tx->name, max, altmax);
1613
1614                 incomplete = false;
1615                 for (j = 0;j < max;j++)
1616                 {
1617                         if (!anims[j])
1618                         {
1619                                 Con_Printf("Missing frame %i of %s\n", j, tx->name);
1620                                 incomplete = true;
1621                         }
1622                 }
1623                 for (j = 0;j < altmax;j++)
1624                 {
1625                         if (!altanims[j])
1626                         {
1627                                 Con_Printf("Missing altframe %i of %s\n", j, tx->name);
1628                                 incomplete = true;
1629                         }
1630                 }
1631                 if (incomplete)
1632                         continue;
1633
1634                 if (altmax < 1)
1635                 {
1636                         // if there is no alternate animation, duplicate the primary
1637                         // animation into the alternate
1638                         altmax = max;
1639                         for (k = 0;k < 10;k++)
1640                                 altanims[k] = anims[k];
1641                 }
1642
1643                 // link together the primary animation
1644                 for (j = 0;j < max;j++)
1645                 {
1646                         tx2 = anims[j];
1647                         tx2->animated = true;
1648                         tx2->anim_total[0] = max;
1649                         tx2->anim_total[1] = altmax;
1650                         for (k = 0;k < 10;k++)
1651                         {
1652                                 tx2->anim_frames[0][k] = anims[k];
1653                                 tx2->anim_frames[1][k] = altanims[k];
1654                         }
1655                 }
1656
1657                 // if there really is an alternate anim...
1658                 if (anims[0] != altanims[0])
1659                 {
1660                         // link together the alternate animation
1661                         for (j = 0;j < altmax;j++)
1662                         {
1663                                 tx2 = altanims[j];
1664                                 tx2->animated = true;
1665                                 // the primary/alternate are reversed here
1666                                 tx2->anim_total[0] = altmax;
1667                                 tx2->anim_total[1] = max;
1668                                 for (k = 0;k < 10;k++)
1669                                 {
1670                                         tx2->anim_frames[0][k] = altanims[k];
1671                                         tx2->anim_frames[1][k] = anims[k];
1672                                 }
1673                         }
1674                 }
1675         }
1676 }
1677
1678 static void Mod_Q1BSP_LoadLighting(lump_t *l)
1679 {
1680         int i;
1681         unsigned char *in, *out, *data, d;
1682         char litfilename[MAX_QPATH];
1683         char dlitfilename[MAX_QPATH];
1684         fs_offset_t filesize;
1685         if (loadmodel->brush.ishlbsp) // LordHavoc: load the colored lighting data straight
1686         {
1687                 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1688                 for (i=0; i<l->filelen; i++)
1689                         loadmodel->brushq1.lightdata[i] = mod_base[l->fileofs+i] >>= 1;
1690         }
1691         else // LordHavoc: bsp version 29 (normal white lighting)
1692         {
1693                 // LordHavoc: hope is not lost yet, check for a .lit file to load
1694                 strlcpy (litfilename, loadmodel->name, sizeof (litfilename));
1695                 FS_StripExtension (litfilename, litfilename, sizeof (litfilename));
1696                 strlcpy (dlitfilename, litfilename, sizeof (dlitfilename));
1697                 strlcat (litfilename, ".lit", sizeof (litfilename));
1698                 strlcat (dlitfilename, ".dlit", sizeof (dlitfilename));
1699                 data = (unsigned char*) FS_LoadFile(litfilename, tempmempool, false, &filesize);
1700                 if (data)
1701                 {
1702                         if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1703                         {
1704                                 i = LittleLong(((int *)data)[1]);
1705                                 if (i == 1)
1706                                 {
1707                                         if (developer_loading.integer)
1708                                                 Con_Printf("loaded %s\n", litfilename);
1709                                         loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1710                                         memcpy(loadmodel->brushq1.lightdata, data + 8, filesize - 8);
1711                                         Mem_Free(data);
1712                                         data = (unsigned char*) FS_LoadFile(dlitfilename, tempmempool, false, &filesize);
1713                                         if (data)
1714                                         {
1715                                                 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1716                                                 {
1717                                                         i = LittleLong(((int *)data)[1]);
1718                                                         if (i == 1)
1719                                                         {
1720                                                                 if (developer_loading.integer)
1721                                                                         Con_Printf("loaded %s\n", dlitfilename);
1722                                                                 loadmodel->brushq1.nmaplightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1723                                                                 memcpy(loadmodel->brushq1.nmaplightdata, data + 8, filesize - 8);
1724                                                                 loadmodel->brushq3.deluxemapping_modelspace = false;
1725                                                                 loadmodel->brushq3.deluxemapping = true;
1726                                                         }
1727                                                 }
1728                                                 Mem_Free(data);
1729                                                 data = NULL;
1730                                         }
1731                                         return;
1732                                 }
1733                                 else
1734                                         Con_Printf("Unknown .lit file version (%d)\n", i);
1735                         }
1736                         else if (filesize == 8)
1737                                 Con_Print("Empty .lit file, ignoring\n");
1738                         else
1739                                 Con_Printf("Corrupt .lit file (file size %i bytes, should be %i bytes), ignoring\n", (int) filesize, (int) (8 + l->filelen * 3));
1740                         if (data)
1741                         {
1742                                 Mem_Free(data);
1743                                 data = NULL;
1744                         }
1745                 }
1746                 // LordHavoc: oh well, expand the white lighting data
1747                 if (!l->filelen)
1748                         return;
1749                 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen*3);
1750                 in = mod_base + l->fileofs;
1751                 out = loadmodel->brushq1.lightdata;
1752                 for (i = 0;i < l->filelen;i++)
1753                 {
1754                         d = *in++;
1755                         *out++ = d;
1756                         *out++ = d;
1757                         *out++ = d;
1758                 }
1759         }
1760 }
1761
1762 static void Mod_Q1BSP_LoadVisibility(lump_t *l)
1763 {
1764         loadmodel->brushq1.num_compressedpvs = 0;
1765         loadmodel->brushq1.data_compressedpvs = NULL;
1766         if (!l->filelen)
1767                 return;
1768         loadmodel->brushq1.num_compressedpvs = l->filelen;
1769         loadmodel->brushq1.data_compressedpvs = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1770         memcpy(loadmodel->brushq1.data_compressedpvs, mod_base + l->fileofs, l->filelen);
1771 }
1772
1773 // used only for HalfLife maps
1774 static void Mod_Q1BSP_ParseWadsFromEntityLump(const char *data)
1775 {
1776         char key[128], value[4096];
1777         char wadname[128];
1778         int i, j, k;
1779         if (!data)
1780                 return;
1781         if (!COM_ParseToken_Simple(&data, false, false))
1782                 return; // error
1783         if (com_token[0] != '{')
1784                 return; // error
1785         while (1)
1786         {
1787                 if (!COM_ParseToken_Simple(&data, false, false))
1788                         return; // error
1789                 if (com_token[0] == '}')
1790                         break; // end of worldspawn
1791                 if (com_token[0] == '_')
1792                         strlcpy(key, com_token + 1, sizeof(key));
1793                 else
1794                         strlcpy(key, com_token, sizeof(key));
1795                 while (key[strlen(key)-1] == ' ') // remove trailing spaces
1796                         key[strlen(key)-1] = 0;
1797                 if (!COM_ParseToken_Simple(&data, false, false))
1798                         return; // error
1799                 dpsnprintf(value, sizeof(value), "%s", com_token);
1800                 if (!strcmp("wad", key)) // for HalfLife maps
1801                 {
1802                         if (loadmodel->brush.ishlbsp)
1803                         {
1804                                 j = 0;
1805                                 for (i = 0;i < (int)sizeof(value);i++)
1806                                         if (value[i] != ';' && value[i] != '\\' && value[i] != '/' && value[i] != ':')
1807                                                 break;
1808                                 if (value[i])
1809                                 {
1810                                         for (;i < (int)sizeof(value);i++)
1811                                         {
1812                                                 // ignore path - the \\ check is for HalfLife... stupid windoze 'programmers'...
1813                                                 if (value[i] == '\\' || value[i] == '/' || value[i] == ':')
1814                                                         j = i+1;
1815                                                 else if (value[i] == ';' || value[i] == 0)
1816                                                 {
1817                                                         k = value[i];
1818                                                         value[i] = 0;
1819                                                         strlcpy(wadname, "textures/", sizeof(wadname));
1820                                                         strlcat(wadname, &value[j], sizeof(wadname));
1821                                                         W_LoadTextureWadFile(wadname, false);
1822                                                         j = i+1;
1823                                                         if (!k)
1824                                                                 break;
1825                                                 }
1826                                         }
1827                                 }
1828                         }
1829                 }
1830         }
1831 }
1832
1833 static void Mod_Q1BSP_LoadEntities(lump_t *l)
1834 {
1835         loadmodel->brush.entities = NULL;
1836         if (!l->filelen)
1837                 return;
1838         loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1839         memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
1840         if (loadmodel->brush.ishlbsp)
1841                 Mod_Q1BSP_ParseWadsFromEntityLump(loadmodel->brush.entities);
1842 }
1843
1844
1845 static void Mod_Q1BSP_LoadVertexes(lump_t *l)
1846 {
1847         dvertex_t       *in;
1848         mvertex_t       *out;
1849         int                     i, count;
1850
1851         in = (dvertex_t *)(mod_base + l->fileofs);
1852         if (l->filelen % sizeof(*in))
1853                 Host_Error("Mod_Q1BSP_LoadVertexes: funny lump size in %s",loadmodel->name);
1854         count = l->filelen / sizeof(*in);
1855         out = (mvertex_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
1856
1857         loadmodel->brushq1.vertexes = out;
1858         loadmodel->brushq1.numvertexes = count;
1859
1860         for ( i=0 ; i<count ; i++, in++, out++)
1861         {
1862                 out->position[0] = LittleFloat(in->point[0]);
1863                 out->position[1] = LittleFloat(in->point[1]);
1864                 out->position[2] = LittleFloat(in->point[2]);
1865         }
1866 }
1867
1868 // The following two functions should be removed and MSG_* or SZ_* function sets adjusted so they
1869 // can be used for this
1870 // REMOVEME
1871 int SB_ReadInt (unsigned char **buffer)
1872 {
1873         int     i;
1874         i = ((*buffer)[0]) + 256*((*buffer)[1]) + 65536*((*buffer)[2]) + 16777216*((*buffer)[3]);
1875         (*buffer) += 4;
1876         return i;
1877 }
1878
1879 // REMOVEME
1880 float SB_ReadFloat (unsigned char **buffer)
1881 {
1882         union
1883         {
1884                 int             i;
1885                 float   f;
1886         } u;
1887
1888         u.i = SB_ReadInt (buffer);
1889         return u.f;
1890 }
1891
1892 static void Mod_Q1BSP_LoadSubmodels(lump_t *l, hullinfo_t *hullinfo)
1893 {
1894         unsigned char           *index;
1895         dmodel_t        *out;
1896         int                     i, j, count;
1897
1898         index = (unsigned char *)(mod_base + l->fileofs);
1899         if (l->filelen % (48+4*hullinfo->filehulls))
1900                 Host_Error ("Mod_Q1BSP_LoadSubmodels: funny lump size in %s", loadmodel->name);
1901
1902         count = l->filelen / (48+4*hullinfo->filehulls);
1903         out = (dmodel_t *)Mem_Alloc (loadmodel->mempool, count*sizeof(*out));
1904
1905         loadmodel->brushq1.submodels = out;
1906         loadmodel->brush.numsubmodels = count;
1907
1908         for (i = 0; i < count; i++, out++)
1909         {
1910         // spread out the mins / maxs by a pixel
1911                 out->mins[0] = SB_ReadFloat (&index) - 1;
1912                 out->mins[1] = SB_ReadFloat (&index) - 1;
1913                 out->mins[2] = SB_ReadFloat (&index) - 1;
1914                 out->maxs[0] = SB_ReadFloat (&index) + 1;
1915                 out->maxs[1] = SB_ReadFloat (&index) + 1;
1916                 out->maxs[2] = SB_ReadFloat (&index) + 1;
1917                 out->origin[0] = SB_ReadFloat (&index);
1918                 out->origin[1] = SB_ReadFloat (&index);
1919                 out->origin[2] = SB_ReadFloat (&index);
1920                 for (j = 0; j < hullinfo->filehulls; j++)
1921                         out->headnode[j] = SB_ReadInt (&index);
1922                 out->visleafs = SB_ReadInt (&index);
1923                 out->firstface = SB_ReadInt (&index);
1924                 out->numfaces = SB_ReadInt (&index);
1925         }
1926 }
1927
1928 static void Mod_Q1BSP_LoadEdges(lump_t *l)
1929 {
1930         dedge_t *in;
1931         medge_t *out;
1932         int     i, count;
1933
1934         in = (dedge_t *)(mod_base + l->fileofs);
1935         if (l->filelen % sizeof(*in))
1936                 Host_Error("Mod_Q1BSP_LoadEdges: funny lump size in %s",loadmodel->name);
1937         count = l->filelen / sizeof(*in);
1938         out = (medge_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1939
1940         loadmodel->brushq1.edges = out;
1941         loadmodel->brushq1.numedges = count;
1942
1943         for ( i=0 ; i<count ; i++, in++, out++)
1944         {
1945                 out->v[0] = (unsigned short)LittleShort(in->v[0]);
1946                 out->v[1] = (unsigned short)LittleShort(in->v[1]);
1947                 if (out->v[0] >= loadmodel->brushq1.numvertexes || out->v[1] >= loadmodel->brushq1.numvertexes)
1948                 {
1949                         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);
1950                         out->v[0] = 0;
1951                         out->v[1] = 0;
1952                 }
1953         }
1954 }
1955
1956 static void Mod_Q1BSP_LoadTexinfo(lump_t *l)
1957 {
1958         texinfo_t *in;
1959         mtexinfo_t *out;
1960         int i, j, k, count, miptex;
1961
1962         in = (texinfo_t *)(mod_base + l->fileofs);
1963         if (l->filelen % sizeof(*in))
1964                 Host_Error("Mod_Q1BSP_LoadTexinfo: funny lump size in %s",loadmodel->name);
1965         count = l->filelen / sizeof(*in);
1966         out = (mtexinfo_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1967
1968         loadmodel->brushq1.texinfo = out;
1969         loadmodel->brushq1.numtexinfo = count;
1970
1971         for (i = 0;i < count;i++, in++, out++)
1972         {
1973                 for (k = 0;k < 2;k++)
1974                         for (j = 0;j < 4;j++)
1975                                 out->vecs[k][j] = LittleFloat(in->vecs[k][j]);
1976
1977                 miptex = LittleLong(in->miptex);
1978                 out->flags = LittleLong(in->flags);
1979
1980                 out->texture = NULL;
1981                 if (loadmodel->data_textures)
1982                 {
1983                         if ((unsigned int) miptex >= (unsigned int) loadmodel->num_textures)
1984                                 Con_Printf("error in model \"%s\": invalid miptex index %i(of %i)\n", loadmodel->name, miptex, loadmodel->num_textures);
1985                         else
1986                                 out->texture = loadmodel->data_textures + miptex;
1987                 }
1988                 if (out->flags & TEX_SPECIAL)
1989                 {
1990                         // if texture chosen is NULL or the shader needs a lightmap,
1991                         // force to notexture water shader
1992                         if (out->texture == NULL)
1993                                 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 1);
1994                 }
1995                 else
1996                 {
1997                         // if texture chosen is NULL, force to notexture
1998                         if (out->texture == NULL)
1999                                 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 2);
2000                 }
2001         }
2002 }
2003
2004 #if 0
2005 void BoundPoly(int numverts, float *verts, vec3_t mins, vec3_t maxs)
2006 {
2007         int             i, j;
2008         float   *v;
2009
2010         mins[0] = mins[1] = mins[2] = 9999;
2011         maxs[0] = maxs[1] = maxs[2] = -9999;
2012         v = verts;
2013         for (i = 0;i < numverts;i++)
2014         {
2015                 for (j = 0;j < 3;j++, v++)
2016                 {
2017                         if (*v < mins[j])
2018                                 mins[j] = *v;
2019                         if (*v > maxs[j])
2020                                 maxs[j] = *v;
2021                 }
2022         }
2023 }
2024
2025 #define MAX_SUBDIVPOLYTRIANGLES 4096
2026 #define MAX_SUBDIVPOLYVERTS(MAX_SUBDIVPOLYTRIANGLES * 3)
2027
2028 static int subdivpolyverts, subdivpolytriangles;
2029 static int subdivpolyindex[MAX_SUBDIVPOLYTRIANGLES][3];
2030 static float subdivpolyvert[MAX_SUBDIVPOLYVERTS][3];
2031
2032 static int subdivpolylookupvert(vec3_t v)
2033 {
2034         int i;
2035         for (i = 0;i < subdivpolyverts;i++)
2036                 if (subdivpolyvert[i][0] == v[0]
2037                  && subdivpolyvert[i][1] == v[1]
2038                  && subdivpolyvert[i][2] == v[2])
2039                         return i;
2040         if (subdivpolyverts >= MAX_SUBDIVPOLYVERTS)
2041                 Host_Error("SubDividePolygon: ran out of vertices in buffer, please increase your r_subdivide_size");
2042         VectorCopy(v, subdivpolyvert[subdivpolyverts]);
2043         return subdivpolyverts++;
2044 }
2045
2046 static void SubdividePolygon(int numverts, float *verts)
2047 {
2048         int             i, i1, i2, i3, f, b, c, p;
2049         vec3_t  mins, maxs, front[256], back[256];
2050         float   m, *pv, *cv, dist[256], frac;
2051
2052         if (numverts > 250)
2053                 Host_Error("SubdividePolygon: ran out of verts in buffer");
2054
2055         BoundPoly(numverts, verts, mins, maxs);
2056
2057         for (i = 0;i < 3;i++)
2058         {
2059                 m = (mins[i] + maxs[i]) * 0.5;
2060                 m = r_subdivide_size.value * floor(m/r_subdivide_size.value + 0.5);
2061                 if (maxs[i] - m < 8)
2062                         continue;
2063                 if (m - mins[i] < 8)
2064                         continue;
2065
2066                 // cut it
2067                 for (cv = verts, c = 0;c < numverts;c++, cv += 3)
2068                         dist[c] = cv[i] - m;
2069
2070                 f = b = 0;
2071                 for (p = numverts - 1, c = 0, pv = verts + p * 3, cv = verts;c < numverts;p = c, c++, pv = cv, cv += 3)
2072                 {
2073                         if (dist[p] >= 0)
2074                         {
2075                                 VectorCopy(pv, front[f]);
2076                                 f++;
2077                         }
2078                         if (dist[p] <= 0)
2079                         {
2080                                 VectorCopy(pv, back[b]);
2081                                 b++;
2082                         }
2083                         if (dist[p] == 0 || dist[c] == 0)
2084                                 continue;
2085                         if ((dist[p] > 0) != (dist[c] > 0) )
2086                         {
2087                                 // clip point
2088                                 frac = dist[p] / (dist[p] - dist[c]);
2089                                 front[f][0] = back[b][0] = pv[0] + frac * (cv[0] - pv[0]);
2090                                 front[f][1] = back[b][1] = pv[1] + frac * (cv[1] - pv[1]);
2091                                 front[f][2] = back[b][2] = pv[2] + frac * (cv[2] - pv[2]);
2092                                 f++;
2093                                 b++;
2094                         }
2095                 }
2096
2097                 SubdividePolygon(f, front[0]);
2098                 SubdividePolygon(b, back[0]);
2099                 return;
2100         }
2101
2102         i1 = subdivpolylookupvert(verts);
2103         i2 = subdivpolylookupvert(verts + 3);
2104         for (i = 2;i < numverts;i++)
2105         {
2106                 if (subdivpolytriangles >= MAX_SUBDIVPOLYTRIANGLES)
2107                 {
2108                         Con_Print("SubdividePolygon: ran out of triangles in buffer, please increase your r_subdivide_size\n");
2109                         return;
2110                 }
2111
2112                 i3 = subdivpolylookupvert(verts + i * 3);
2113                 subdivpolyindex[subdivpolytriangles][0] = i1;
2114                 subdivpolyindex[subdivpolytriangles][1] = i2;
2115                 subdivpolyindex[subdivpolytriangles][2] = i3;
2116                 i2 = i3;
2117                 subdivpolytriangles++;
2118         }
2119 }
2120
2121 //Breaks a polygon up along axial 64 unit
2122 //boundaries so that turbulent and sky warps
2123 //can be done reasonably.
2124 static void Mod_Q1BSP_GenerateWarpMesh(msurface_t *surface)
2125 {
2126         int i, j;
2127         surfvertex_t *v;
2128         surfmesh_t *mesh;
2129
2130         subdivpolytriangles = 0;
2131         subdivpolyverts = 0;
2132         SubdividePolygon(surface->num_vertices, (surface->mesh->data_vertex3f + 3 * surface->num_firstvertex));
2133         if (subdivpolytriangles < 1)
2134                 Host_Error("Mod_Q1BSP_GenerateWarpMesh: no triangles?");
2135
2136         surface->mesh = mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + subdivpolytriangles * sizeof(int[3]) + subdivpolyverts * sizeof(surfvertex_t));
2137         mesh->num_vertices = subdivpolyverts;
2138         mesh->num_triangles = subdivpolytriangles;
2139         mesh->vertex = (surfvertex_t *)(mesh + 1);
2140         mesh->index = (int *)(mesh->vertex + mesh->num_vertices);
2141         memset(mesh->vertex, 0, mesh->num_vertices * sizeof(surfvertex_t));
2142
2143         for (i = 0;i < mesh->num_triangles;i++)
2144                 for (j = 0;j < 3;j++)
2145                         mesh->index[i*3+j] = subdivpolyindex[i][j];
2146
2147         for (i = 0, v = mesh->vertex;i < subdivpolyverts;i++, v++)
2148         {
2149                 VectorCopy(subdivpolyvert[i], v->v);
2150                 v->st[0] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[0]);
2151                 v->st[1] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[1]);
2152         }
2153 }
2154 #endif
2155
2156 /* Maximum size of a single LM */
2157 #define MAX_SINGLE_LM_SIZE    256
2158
2159 struct alloc_lm_row
2160 {
2161         int rowY;
2162         int currentX;
2163 };
2164
2165 struct alloc_lm_state
2166 {
2167         int currentY;
2168         struct alloc_lm_row rows[MAX_SINGLE_LM_SIZE];
2169 };
2170
2171 static void init_alloc_lm_state (struct alloc_lm_state* state)
2172 {
2173         int r;
2174
2175         state->currentY = 0;
2176         for (r = 0; r < MAX_SINGLE_LM_SIZE; r++)
2177         {
2178           state->rows[r].currentX = 0;
2179           state->rows[r].rowY = -1;
2180         }
2181 }
2182
2183 static qboolean Mod_Q1BSP_AllocLightmapBlock(struct alloc_lm_state* state, int totalwidth, int totalheight, int blockwidth, int blockheight, int *outx, int *outy)
2184 {
2185         struct alloc_lm_row* row;
2186         int r;
2187
2188         row = &(state->rows[blockheight]);
2189         if ((row->rowY < 0) || (row->currentX + blockwidth > totalwidth))
2190         {
2191                 if (state->currentY + blockheight <= totalheight)
2192                 {
2193                         row->rowY = state->currentY;
2194                         row->currentX = 0;
2195                         state->currentY += blockheight;
2196                 }
2197                 else
2198                 {
2199                         /* See if we can stuff the block into a higher row */
2200                         row = NULL;
2201                         for (r = blockheight; r < MAX_SINGLE_LM_SIZE; r++)
2202                         {
2203                                 if ((state->rows[r].rowY >= 0)
2204                                   && (state->rows[r].currentX + blockwidth <= totalwidth))
2205                                 {
2206                                         row = &(state->rows[r]);
2207                                         break;
2208                                 }
2209                         }
2210                         if (row == NULL) return false;
2211                 }
2212         }
2213         *outy = row->rowY;
2214         *outx = row->currentX;
2215         row->currentX += blockwidth;
2216
2217         return true;
2218 }
2219
2220 extern cvar_t gl_max_size;
2221 static void Mod_Q1BSP_LoadFaces(lump_t *l)
2222 {
2223         dface_t *in;
2224         msurface_t *surface;
2225         int i, j, count, surfacenum, planenum, smax, tmax, ssize, tsize, firstedge, numedges, totalverts, totaltris, lightmapnumber, lightmapsize, totallightmapsamples;
2226         float texmins[2], texmaxs[2], val;
2227         rtexture_t *lightmaptexture, *deluxemaptexture;
2228
2229         in = (dface_t *)(mod_base + l->fileofs);
2230         if (l->filelen % sizeof(*in))
2231                 Host_Error("Mod_Q1BSP_LoadFaces: funny lump size in %s",loadmodel->name);
2232         count = l->filelen / sizeof(*in);
2233         loadmodel->data_surfaces = (msurface_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_t));
2234         loadmodel->data_surfaces_lightmapinfo = (msurface_lightmapinfo_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_lightmapinfo_t));
2235
2236         loadmodel->num_surfaces = count;
2237
2238         loadmodel->brushq1.lightmapupdateflags = (unsigned char *)Mem_Alloc(loadmodel->mempool, count*sizeof(unsigned char));
2239
2240         totalverts = 0;
2241         totaltris = 0;
2242         for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs);surfacenum < count;surfacenum++, in++)
2243         {
2244                 numedges = (unsigned short)LittleShort(in->numedges);
2245                 totalverts += numedges;
2246                 totaltris += numedges - 2;
2247         }
2248
2249         Mod_AllocSurfMesh(loadmodel->mempool, totalverts, totaltris, true, false, false);
2250
2251         lightmaptexture = NULL;
2252         deluxemaptexture = r_texture_blanknormalmap;
2253         lightmapnumber = 1;
2254         lightmapsize = max(256, gl_max_size.integer);
2255         totallightmapsamples = 0;
2256
2257         totalverts = 0;
2258         totaltris = 0;
2259         for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs), surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, in++, surface++)
2260         {
2261                 surface->lightmapinfo = loadmodel->data_surfaces_lightmapinfo + surfacenum;
2262
2263                 // FIXME: validate edges, texinfo, etc?
2264                 firstedge = LittleLong(in->firstedge);
2265                 numedges = (unsigned short)LittleShort(in->numedges);
2266                 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)
2267                         Host_Error("Mod_Q1BSP_LoadFaces: invalid edge range (firstedge %i, numedges %i, model edges %i)", firstedge, numedges, loadmodel->brushq1.numsurfedges);
2268                 i = (unsigned short)LittleShort(in->texinfo);
2269                 if ((unsigned int) i >= (unsigned int) loadmodel->brushq1.numtexinfo)
2270                         Host_Error("Mod_Q1BSP_LoadFaces: invalid texinfo index %i(model has %i texinfos)", i, loadmodel->brushq1.numtexinfo);
2271                 surface->lightmapinfo->texinfo = loadmodel->brushq1.texinfo + i;
2272                 surface->texture = surface->lightmapinfo->texinfo->texture;
2273
2274                 planenum = (unsigned short)LittleShort(in->planenum);
2275                 if ((unsigned int) planenum >= (unsigned int) loadmodel->brush.num_planes)
2276                         Host_Error("Mod_Q1BSP_LoadFaces: invalid plane index %i (model has %i planes)", planenum, loadmodel->brush.num_planes);
2277
2278                 //surface->flags = surface->texture->flags;
2279                 //if (LittleShort(in->side))
2280                 //      surface->flags |= SURF_PLANEBACK;
2281                 //surface->plane = loadmodel->brush.data_planes + planenum;
2282
2283                 surface->num_firstvertex = totalverts;
2284                 surface->num_vertices = numedges;
2285                 surface->num_firsttriangle = totaltris;
2286                 surface->num_triangles = numedges - 2;
2287                 totalverts += numedges;
2288                 totaltris += numedges - 2;
2289
2290                 // convert edges back to a normal polygon
2291                 for (i = 0;i < surface->num_vertices;i++)
2292                 {
2293                         int lindex = loadmodel->brushq1.surfedges[firstedge + i];
2294                         float s, t;
2295                         if (lindex > 0)
2296                                 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[lindex].v[0]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2297                         else
2298                                 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[-lindex].v[1]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2299                         s = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2300                         t = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2301                         (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 0] = s / surface->texture->width;
2302                         (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 1] = t / surface->texture->height;
2303                         (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = 0;
2304                         (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = 0;
2305                         (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = 0;
2306                 }
2307
2308                 for (i = 0;i < surface->num_triangles;i++)
2309                 {
2310                         (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 0] = 0 + surface->num_firstvertex;
2311                         (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 1] = i + 1 + surface->num_firstvertex;
2312                         (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 2] = i + 2 + surface->num_firstvertex;
2313                 }
2314
2315                 // compile additional data about the surface geometry
2316                 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);
2317                 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);
2318                 BoxFromPoints(surface->mins, surface->maxs, surface->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex));
2319
2320                 // generate surface extents information
2321                 texmins[0] = texmaxs[0] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2322                 texmins[1] = texmaxs[1] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2323                 for (i = 1;i < surface->num_vertices;i++)
2324                 {
2325                         for (j = 0;j < 2;j++)
2326                         {
2327                                 val = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3, surface->lightmapinfo->texinfo->vecs[j]) + surface->lightmapinfo->texinfo->vecs[j][3];
2328                                 texmins[j] = min(texmins[j], val);
2329                                 texmaxs[j] = max(texmaxs[j], val);
2330                         }
2331                 }
2332                 for (i = 0;i < 2;i++)
2333                 {
2334                         surface->lightmapinfo->texturemins[i] = (int) floor(texmins[i] / 16.0) * 16;
2335                         surface->lightmapinfo->extents[i] = (int) ceil(texmaxs[i] / 16.0) * 16 - surface->lightmapinfo->texturemins[i];
2336                 }
2337
2338                 smax = surface->lightmapinfo->extents[0] >> 4;
2339                 tmax = surface->lightmapinfo->extents[1] >> 4;
2340                 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2341                 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2342
2343                 // lighting info
2344                 for (i = 0;i < MAXLIGHTMAPS;i++)
2345                         surface->lightmapinfo->styles[i] = in->styles[i];
2346                 surface->lightmaptexture = NULL;
2347                 surface->deluxemaptexture = r_texture_blanknormalmap;
2348                 i = LittleLong(in->lightofs);
2349                 if (i == -1)
2350                 {
2351                         surface->lightmapinfo->samples = NULL;
2352                         // give non-lightmapped water a 1x white lightmap
2353                         if (surface->texture->name[0] == '*' && (surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) && ssize <= 256 && tsize <= 256)
2354                         {
2355                                 surface->lightmapinfo->samples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2356                                 surface->lightmapinfo->styles[0] = 0;
2357                                 memset(surface->lightmapinfo->samples, 128, ssize * tsize * 3);
2358                         }
2359                 }
2360                 else if (loadmodel->brush.ishlbsp) // LordHavoc: HalfLife map (bsp version 30)
2361                         surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + i;
2362                 else // LordHavoc: white lighting (bsp version 29)
2363                 {
2364                         surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + (i * 3);
2365                         if (loadmodel->brushq1.nmaplightdata)
2366                                 surface->lightmapinfo->nmapsamples = loadmodel->brushq1.nmaplightdata + (i * 3);
2367                 }
2368
2369                 // check if we should apply a lightmap to this
2370                 if (!(surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) || surface->lightmapinfo->samples)
2371                 {
2372                         if (ssize > 256 || tsize > 256)
2373                                 Host_Error("Bad surface extents");
2374
2375                         if (lightmapsize < ssize)
2376                                 lightmapsize = ssize;
2377                         if (lightmapsize < tsize)
2378                                 lightmapsize = tsize;
2379
2380                         totallightmapsamples += ssize*tsize;
2381
2382                         // force lightmap upload on first time seeing the surface
2383                         //
2384                         // additionally this is used by the later code to see if a
2385                         // lightmap is needed on this surface (rather than duplicating the
2386                         // logic above)
2387                         loadmodel->brushq1.lightmapupdateflags[surfacenum] = true;
2388                 }
2389         }
2390
2391         // small maps (such as ammo boxes especially) don't need big lightmap
2392         // textures, so this code tries to guess a good size based on
2393         // totallightmapsamples (size of the lightmaps lump basically), as well as
2394         // trying to max out the gl_max_size if there is a lot of lightmap data to
2395         // store
2396         // additionally, never choose a lightmapsize that is smaller than the
2397         // largest surface encountered (as it would fail)
2398         i = lightmapsize;
2399         for (lightmapsize = 64; (lightmapsize < i) && (lightmapsize < gl_max_size.integer) && (totallightmapsamples > lightmapsize*lightmapsize); lightmapsize*=2)
2400                 ;
2401
2402         // now that we've decided the lightmap texture size, we can do the rest
2403         if (cls.state != ca_dedicated)
2404         {
2405                 struct alloc_lm_state allocState;
2406
2407                 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2408                 {
2409                         int i, iu, iv, lightmapx = 0, lightmapy = 0;
2410                         float u, v, ubase, vbase, uscale, vscale;
2411
2412                         smax = surface->lightmapinfo->extents[0] >> 4;
2413                         tmax = surface->lightmapinfo->extents[1] >> 4;
2414                         ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2415                         tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2416
2417                         if (!lightmaptexture || !Mod_Q1BSP_AllocLightmapBlock(&allocState, lightmapsize, lightmapsize, ssize, tsize, &lightmapx, &lightmapy))
2418                         {
2419                                 // allocate a texture pool if we need it
2420                                 if (loadmodel->texturepool == NULL)
2421                                         loadmodel->texturepool = R_AllocTexturePool();
2422                                 // could not find room, make a new lightmap
2423                                 lightmaptexture = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2424                                 if (loadmodel->brushq1.nmaplightdata)
2425                                         deluxemaptexture = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2426                                 lightmapnumber++;
2427                                 init_alloc_lm_state (&allocState);
2428                                 Mod_Q1BSP_AllocLightmapBlock(&allocState, lightmapsize, lightmapsize, ssize, tsize, &lightmapx, &lightmapy);
2429                         }
2430                         surface->lightmaptexture = lightmaptexture;
2431                         surface->deluxemaptexture = deluxemaptexture;
2432                         surface->lightmapinfo->lightmaporigin[0] = lightmapx;
2433                         surface->lightmapinfo->lightmaporigin[1] = lightmapy;
2434
2435                         uscale = 1.0f / (float)lightmapsize;
2436                         vscale = 1.0f / (float)lightmapsize;
2437                         ubase = lightmapx * uscale;
2438                         vbase = lightmapy * vscale;
2439
2440                         for (i = 0;i < surface->num_vertices;i++)
2441                         {
2442                                 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);
2443                                 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);
2444                                 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = u * uscale + ubase;
2445                                 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = v * vscale + vbase;
2446                                 // LordHavoc: calc lightmap data offset for vertex lighting to use
2447                                 iu = (int) u;
2448                                 iv = (int) v;
2449                                 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = (bound(0, iv, tmax) * ssize + bound(0, iu, smax)) * 3;
2450                         }
2451
2452                 }
2453
2454                 if (cl_stainmaps.integer)
2455                 {
2456                         // allocate stainmaps for permanent marks on walls
2457                         int stainmapsize = 0;
2458                         unsigned char *stainsamples = NULL;
2459                         for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2460                         {
2461                                 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2462                                 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2463                                 stainmapsize += ssize * tsize * 3;
2464                         }
2465                         // allocate and clear to white
2466                         stainsamples = (unsigned char *)Mem_Alloc(loadmodel->mempool, stainmapsize);
2467                         memset(stainsamples, 255, stainmapsize);
2468                         // assign pointers
2469                         for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2470                         {
2471                                 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2472                                 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2473                                 surface->lightmapinfo->stainsamples = stainsamples;
2474                                 stainsamples += ssize * tsize * 3;
2475                         }
2476                 }
2477         }
2478
2479         // generate ushort elements array if possible
2480         if (loadmodel->surfmesh.data_element3s)
2481                 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
2482                         loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
2483 }
2484
2485 static void Mod_Q1BSP_LoadNodes_RecursiveSetParent(mnode_t *node, mnode_t *parent)
2486 {
2487         //if (node->parent)
2488         //      Host_Error("Mod_Q1BSP_LoadNodes_RecursiveSetParent: runaway recursion");
2489         node->parent = parent;
2490         if (node->plane)
2491         {
2492                 // this is a node, recurse to children
2493                 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[0], node);
2494                 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[1], node);
2495                 // combine supercontents of children
2496                 node->combinedsupercontents = node->children[0]->combinedsupercontents | node->children[1]->combinedsupercontents;
2497         }
2498         else
2499         {
2500                 int j;
2501                 mleaf_t *leaf = (mleaf_t *)node;
2502                 // if this is a leaf, calculate supercontents mask from all collidable
2503                 // primitives in the leaf (brushes and collision surfaces)
2504                 // also flag if the leaf contains any collision surfaces
2505                 leaf->combinedsupercontents = 0;
2506                 // combine the supercontents values of all brushes in this leaf
2507                 for (j = 0;j < leaf->numleafbrushes;j++)
2508                         leaf->combinedsupercontents |= loadmodel->brush.data_brushes[leaf->firstleafbrush[j]].texture->supercontents;
2509                 // check if this leaf contains any collision surfaces (q3 patches)
2510                 for (j = 0;j < leaf->numleafsurfaces;j++)
2511                 {
2512                         msurface_t *surface = loadmodel->data_surfaces + leaf->firstleafsurface[j];
2513                         if (surface->num_collisiontriangles)
2514                         {
2515                                 leaf->containscollisionsurfaces = true;
2516                                 leaf->combinedsupercontents |= surface->texture->supercontents;
2517                         }
2518                 }
2519         }
2520 }
2521
2522 static void Mod_Q1BSP_LoadNodes(lump_t *l)
2523 {
2524         int                     i, j, count, p;
2525         dnode_t         *in;
2526         mnode_t         *out;
2527
2528         in = (dnode_t *)(mod_base + l->fileofs);
2529         if (l->filelen % sizeof(*in))
2530                 Host_Error("Mod_Q1BSP_LoadNodes: funny lump size in %s",loadmodel->name);
2531         count = l->filelen / sizeof(*in);
2532         out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2533
2534         loadmodel->brush.data_nodes = out;
2535         loadmodel->brush.num_nodes = count;
2536
2537         for ( i=0 ; i<count ; i++, in++, out++)
2538         {
2539                 for (j=0 ; j<3 ; j++)
2540                 {
2541                         out->mins[j] = LittleShort(in->mins[j]);
2542                         out->maxs[j] = LittleShort(in->maxs[j]);
2543                 }
2544
2545                 p = LittleLong(in->planenum);
2546                 out->plane = loadmodel->brush.data_planes + p;
2547
2548                 out->firstsurface = (unsigned short)LittleShort(in->firstface);
2549                 out->numsurfaces = (unsigned short)LittleShort(in->numfaces);
2550
2551                 for (j=0 ; j<2 ; j++)
2552                 {
2553                         // LordHavoc: this code supports broken bsp files produced by
2554                         // arguire qbsp which can produce more than 32768 nodes, any value
2555                         // below count is assumed to be a node number, any other value is
2556                         // assumed to be a leaf number
2557                         p = (unsigned short)LittleShort(in->children[j]);
2558                         if (p < count)
2559                         {
2560                                 if (p < loadmodel->brush.num_nodes)
2561                                         out->children[j] = loadmodel->brush.data_nodes + p;
2562                                 else
2563                                 {
2564                                         Con_Printf("Mod_Q1BSP_LoadNodes: invalid node index %i (file has only %i nodes)\n", p, loadmodel->brush.num_nodes);
2565                                         // map it to the solid leaf
2566                                         out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2567                                 }
2568                         }
2569                         else
2570                         {
2571                                 // note this uses 65535 intentionally, -1 is leaf 0
2572                                 p = 65535 - p;
2573                                 if (p < loadmodel->brush.num_leafs)
2574                                         out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + p);
2575                                 else
2576                                 {
2577                                         Con_Printf("Mod_Q1BSP_LoadNodes: invalid leaf index %i (file has only %i leafs)\n", p, loadmodel->brush.num_leafs);
2578                                         // map it to the solid leaf
2579                                         out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2580                                 }
2581                         }
2582                 }
2583         }
2584
2585         Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);      // sets nodes and leafs
2586 }
2587
2588 static void Mod_Q1BSP_LoadLeafs(lump_t *l)
2589 {
2590         dleaf_t *in;
2591         mleaf_t *out;
2592         int i, j, count, p;
2593
2594         in = (dleaf_t *)(mod_base + l->fileofs);
2595         if (l->filelen % sizeof(*in))
2596                 Host_Error("Mod_Q1BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
2597         count = l->filelen / sizeof(*in);
2598         out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2599
2600         loadmodel->brush.data_leafs = out;
2601         loadmodel->brush.num_leafs = count;
2602         // get visleafs from the submodel data
2603         loadmodel->brush.num_pvsclusters = loadmodel->brushq1.submodels[0].visleafs;
2604         loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters+7)>>3;
2605         loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2606         memset(loadmodel->brush.data_pvsclusters, 0xFF, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2607
2608         for ( i=0 ; i<count ; i++, in++, out++)
2609         {
2610                 for (j=0 ; j<3 ; j++)
2611                 {
2612                         out->mins[j] = LittleShort(in->mins[j]);
2613                         out->maxs[j] = LittleShort(in->maxs[j]);
2614                 }
2615
2616                 // FIXME: this function could really benefit from some error checking
2617
2618                 out->contents = LittleLong(in->contents);
2619
2620                 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + (unsigned short)LittleShort(in->firstmarksurface);
2621                 out->numleafsurfaces = (unsigned short)LittleShort(in->nummarksurfaces);
2622                 if (out->firstleafsurface < 0 || (unsigned short)LittleShort(in->firstmarksurface) + out->numleafsurfaces > loadmodel->brush.num_leafsurfaces)
2623                 {
2624                         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);
2625                         out->firstleafsurface = NULL;
2626                         out->numleafsurfaces = 0;
2627                 }
2628
2629                 out->clusterindex = i - 1;
2630                 if (out->clusterindex >= loadmodel->brush.num_pvsclusters)
2631                         out->clusterindex = -1;
2632
2633                 p = LittleLong(in->visofs);
2634                 // ignore visofs errors on leaf 0 (solid)
2635                 if (p >= 0 && out->clusterindex >= 0)
2636                 {
2637                         if (p >= loadmodel->brushq1.num_compressedpvs)
2638                                 Con_Print("Mod_Q1BSP_LoadLeafs: invalid visofs\n");
2639                         else
2640                                 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);
2641                 }
2642
2643                 for (j = 0;j < 4;j++)
2644                         out->ambient_sound_level[j] = in->ambient_level[j];
2645
2646                 // FIXME: Insert caustics here
2647         }
2648 }
2649
2650 qboolean Mod_Q1BSP_CheckWaterAlphaSupport(void)
2651 {
2652         int i, j;
2653         mleaf_t *leaf;
2654         const unsigned char *pvs;
2655         // if there's no vis data, assume supported (because everything is visible all the time)
2656         if (!loadmodel->brush.data_pvsclusters)
2657                 return true;
2658         // check all liquid leafs to see if they can see into empty leafs, if any
2659         // can we can assume this map supports r_wateralpha
2660         for (i = 0, leaf = loadmodel->brush.data_leafs;i < loadmodel->brush.num_leafs;i++, leaf++)
2661         {
2662                 if ((leaf->contents == CONTENTS_WATER || leaf->contents == CONTENTS_SLIME) && leaf->clusterindex >= 0)
2663                 {
2664                         pvs = loadmodel->brush.data_pvsclusters + leaf->clusterindex * loadmodel->brush.num_pvsclusterbytes;
2665                         for (j = 0;j < loadmodel->brush.num_leafs;j++)
2666                                 if (CHECKPVSBIT(pvs, loadmodel->brush.data_leafs[j].clusterindex) && loadmodel->brush.data_leafs[j].contents == CONTENTS_EMPTY)
2667                                         return true;
2668                 }
2669         }
2670         return false;
2671 }
2672
2673 static void Mod_Q1BSP_LoadClipnodes(lump_t *l, hullinfo_t *hullinfo)
2674 {
2675         dclipnode_t *in;
2676         mclipnode_t *out;
2677         int                     i, count;
2678         hull_t          *hull;
2679
2680         in = (dclipnode_t *)(mod_base + l->fileofs);
2681         if (l->filelen % sizeof(*in))
2682                 Host_Error("Mod_Q1BSP_LoadClipnodes: funny lump size in %s",loadmodel->name);
2683         count = l->filelen / sizeof(*in);
2684         out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2685
2686         loadmodel->brushq1.clipnodes = out;
2687         loadmodel->brushq1.numclipnodes = count;
2688
2689         for (i = 1; i < MAX_MAP_HULLS; i++)
2690         {
2691                 hull = &loadmodel->brushq1.hulls[i];
2692                 hull->clipnodes = out;
2693                 hull->firstclipnode = 0;
2694                 hull->lastclipnode = count-1;
2695                 hull->planes = loadmodel->brush.data_planes;
2696                 hull->clip_mins[0] = hullinfo->hullsizes[i][0][0];
2697                 hull->clip_mins[1] = hullinfo->hullsizes[i][0][1];
2698                 hull->clip_mins[2] = hullinfo->hullsizes[i][0][2];
2699                 hull->clip_maxs[0] = hullinfo->hullsizes[i][1][0];
2700                 hull->clip_maxs[1] = hullinfo->hullsizes[i][1][1];
2701                 hull->clip_maxs[2] = hullinfo->hullsizes[i][1][2];
2702                 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2703         }
2704
2705         for (i=0 ; i<count ; i++, out++, in++)
2706         {
2707                 out->planenum = LittleLong(in->planenum);
2708                 // LordHavoc: this code supports arguire qbsp's broken clipnodes indices (more than 32768 clipnodes), values above count are assumed to be contents values
2709                 out->children[0] = (unsigned short)LittleShort(in->children[0]);
2710                 out->children[1] = (unsigned short)LittleShort(in->children[1]);
2711                 if (out->children[0] >= count)
2712                         out->children[0] -= 65536;
2713                 if (out->children[1] >= count)
2714                         out->children[1] -= 65536;
2715                 if (out->planenum < 0 || out->planenum >= loadmodel->brush.num_planes)
2716                         Host_Error("Corrupt clipping hull(out of range planenum)");
2717         }
2718 }
2719
2720 //Duplicate the drawing hull structure as a clipping hull
2721 static void Mod_Q1BSP_MakeHull0(void)
2722 {
2723         mnode_t         *in;
2724         mclipnode_t *out;
2725         int                     i;
2726         hull_t          *hull;
2727
2728         hull = &loadmodel->brushq1.hulls[0];
2729
2730         in = loadmodel->brush.data_nodes;
2731         out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(*out));
2732
2733         hull->clipnodes = out;
2734         hull->firstclipnode = 0;
2735         hull->lastclipnode = loadmodel->brush.num_nodes - 1;
2736         hull->planes = loadmodel->brush.data_planes;
2737
2738         for (i = 0;i < loadmodel->brush.num_nodes;i++, out++, in++)
2739         {
2740                 out->planenum = in->plane - loadmodel->brush.data_planes;
2741                 out->children[0] = in->children[0]->plane ? in->children[0] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[0])->contents;
2742                 out->children[1] = in->children[1]->plane ? in->children[1] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[1])->contents;
2743         }
2744 }
2745
2746 static void Mod_Q1BSP_LoadLeaffaces(lump_t *l)
2747 {
2748         int i, j;
2749         short *in;
2750
2751         in = (short *)(mod_base + l->fileofs);
2752         if (l->filelen % sizeof(*in))
2753                 Host_Error("Mod_Q1BSP_LoadLeaffaces: funny lump size in %s",loadmodel->name);
2754         loadmodel->brush.num_leafsurfaces = l->filelen / sizeof(*in);
2755         loadmodel->brush.data_leafsurfaces = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafsurfaces * sizeof(int));
2756
2757         for (i = 0;i < loadmodel->brush.num_leafsurfaces;i++)
2758         {
2759                 j = (unsigned short) LittleShort(in[i]);
2760                 if (j >= loadmodel->num_surfaces)
2761                         Host_Error("Mod_Q1BSP_LoadLeaffaces: bad surface number");
2762                 loadmodel->brush.data_leafsurfaces[i] = j;
2763         }
2764 }
2765
2766 static void Mod_Q1BSP_LoadSurfedges(lump_t *l)
2767 {
2768         int             i;
2769         int             *in;
2770
2771         in = (int *)(mod_base + l->fileofs);
2772         if (l->filelen % sizeof(*in))
2773                 Host_Error("Mod_Q1BSP_LoadSurfedges: funny lump size in %s",loadmodel->name);
2774         loadmodel->brushq1.numsurfedges = l->filelen / sizeof(*in);
2775         loadmodel->brushq1.surfedges = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numsurfedges * sizeof(int));
2776
2777         for (i = 0;i < loadmodel->brushq1.numsurfedges;i++)
2778                 loadmodel->brushq1.surfedges[i] = LittleLong(in[i]);
2779 }
2780
2781
2782 static void Mod_Q1BSP_LoadPlanes(lump_t *l)
2783 {
2784         int                     i;
2785         mplane_t        *out;
2786         dplane_t        *in;
2787
2788         in = (dplane_t *)(mod_base + l->fileofs);
2789         if (l->filelen % sizeof(*in))
2790                 Host_Error("Mod_Q1BSP_LoadPlanes: funny lump size in %s", loadmodel->name);
2791
2792         loadmodel->brush.num_planes = l->filelen / sizeof(*in);
2793         loadmodel->brush.data_planes = out = (mplane_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_planes * sizeof(*out));
2794
2795         for (i = 0;i < loadmodel->brush.num_planes;i++, in++, out++)
2796         {
2797                 out->normal[0] = LittleFloat(in->normal[0]);
2798                 out->normal[1] = LittleFloat(in->normal[1]);
2799                 out->normal[2] = LittleFloat(in->normal[2]);
2800                 out->dist = LittleFloat(in->dist);
2801
2802                 PlaneClassify(out);
2803         }
2804 }
2805
2806 static void Mod_Q1BSP_LoadMapBrushes(void)
2807 {
2808 #if 0
2809 // unfinished
2810         int submodel, numbrushes;
2811         qboolean firstbrush;
2812         char *text, *maptext;
2813         char mapfilename[MAX_QPATH];
2814         FS_StripExtension (loadmodel->name, mapfilename, sizeof (mapfilename));
2815         strlcat (mapfilename, ".map", sizeof (mapfilename));
2816         maptext = (unsigned char*) FS_LoadFile(mapfilename, tempmempool, false, NULL);
2817         if (!maptext)
2818                 return;
2819         text = maptext;
2820         if (!COM_ParseToken_Simple(&data, false, false))
2821                 return; // error
2822         submodel = 0;
2823         for (;;)
2824         {
2825                 if (!COM_ParseToken_Simple(&data, false, false))
2826                         break;
2827                 if (com_token[0] != '{')
2828                         return; // error
2829                 // entity
2830                 firstbrush = true;
2831                 numbrushes = 0;
2832                 maxbrushes = 256;
2833                 brushes = Mem_Alloc(loadmodel->mempool, maxbrushes * sizeof(mbrush_t));
2834                 for (;;)
2835                 {
2836                         if (!COM_ParseToken_Simple(&data, false, false))
2837                                 return; // error
2838                         if (com_token[0] == '}')
2839                                 break; // end of entity
2840                         if (com_token[0] == '{')
2841                         {
2842                                 // brush
2843                                 if (firstbrush)
2844                                 {
2845                                         if (submodel)
2846                                         {
2847                                                 if (submodel > loadmodel->brush.numsubmodels)
2848                                                 {
2849                                                         Con_Printf("Mod_Q1BSP_LoadMapBrushes: .map has more submodels than .bsp!\n");
2850                                                         model = NULL;
2851                                                 }
2852                                                 else
2853                                                         model = loadmodel->brush.submodels[submodel];
2854                                         }
2855                                         else
2856                                                 model = loadmodel;
2857                                 }
2858                                 for (;;)
2859                                 {
2860                                         if (!COM_ParseToken_Simple(&data, false, false))
2861                                                 return; // error
2862                                         if (com_token[0] == '}')
2863                                                 break; // end of brush
2864                                         // each brush face should be this format:
2865                                         // ( x y z ) ( x y z ) ( x y z ) texture scroll_s scroll_t rotateangle scale_s scale_t
2866                                         // FIXME: support hl .map format
2867                                         for (pointnum = 0;pointnum < 3;pointnum++)
2868                                         {
2869                                                 COM_ParseToken_Simple(&data, false, false);
2870                                                 for (componentnum = 0;componentnum < 3;componentnum++)
2871                                                 {
2872                                                         COM_ParseToken_Simple(&data, false, false);
2873                                                         point[pointnum][componentnum] = atof(com_token);
2874                                                 }
2875                                                 COM_ParseToken_Simple(&data, false, false);
2876                                         }
2877                                         COM_ParseToken_Simple(&data, false, false);
2878                                         strlcpy(facetexture, com_token, sizeof(facetexture));
2879                                         COM_ParseToken_Simple(&data, false, false);
2880                                         //scroll_s = atof(com_token);
2881                                         COM_ParseToken_Simple(&data, false, false);
2882                                         //scroll_t = atof(com_token);
2883                                         COM_ParseToken_Simple(&data, false, false);
2884                                         //rotate = atof(com_token);
2885                                         COM_ParseToken_Simple(&data, false, false);
2886                                         //scale_s = atof(com_token);
2887                                         COM_ParseToken_Simple(&data, false, false);
2888                                         //scale_t = atof(com_token);
2889                                         TriangleNormal(point[0], point[1], point[2], planenormal);
2890                                         VectorNormalizeDouble(planenormal);
2891                                         planedist = DotProduct(point[0], planenormal);
2892                                         //ChooseTexturePlane(planenormal, texturevector[0], texturevector[1]);
2893                                 }
2894                                 continue;
2895                         }
2896                 }
2897         }
2898 #endif
2899 }
2900
2901
2902 #define MAX_PORTALPOINTS 64
2903
2904 typedef struct portal_s
2905 {
2906         mplane_t plane;
2907         mnode_t *nodes[2];              // [0] = front side of plane
2908         struct portal_s *next[2];
2909         int numpoints;
2910         double points[3*MAX_PORTALPOINTS];
2911         struct portal_s *chain; // all portals are linked into a list
2912 }
2913 portal_t;
2914
2915 static portal_t *portalchain;
2916
2917 /*
2918 ===========
2919 AllocPortal