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