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